Triple

T9867904
Position Surface form Disambiguated ID Type / Status
Subject Hans Zassenhaus E239880 entity
Predicate notableWork P4 FINISHED
Object Zassenhaus lemma
The Zassenhaus lemma is a fundamental result in group theory that describes how subgroups in a group extension correspond and relate to each other, often used in the study of composition series and the Jordan–Hölder theorem.
E827064 NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: Zassenhaus lemma | Statement: [Hans Zassenhaus, notableWork, Zassenhaus lemma]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Zassenhaus lemma
Context triple: [Hans Zassenhaus, notableWork, Zassenhaus lemma]
  • A. Schreier refinement theorem
    The Schreier refinement theorem is a result in group theory stating that any two subnormal series of a group admit equivalent refinements, serving as a precursor and companion to the Jordan–Hölder theorem.
  • B. Jordan–Hölder theorem
    The Jordan–Hölder theorem is a fundamental result in group theory stating that any two composition series of a finite group have the same length and the same (up to order and isomorphism) simple factor groups.
  • C. Noether's isomorphism theorems
    Noether's isomorphism theorems are fundamental results in abstract algebra that relate quotient structures and substructures of groups, rings, and modules, providing a unifying framework for understanding homomorphic images and factor structures.
  • D. Cauchy's theorem in group theory
    Cauchy's theorem in group theory is a fundamental result stating that if a finite group’s order is divisible by a prime p, then the group contains an element (and hence a subgroup) of order p.
  • E. Eilenberg–Zilber theorem
    The Eilenberg–Zilber theorem is a fundamental result in algebraic topology that establishes a chain homotopy equivalence between the singular chain complex of a product space and the tensor product of the singular chain complexes of the factors.
  • F. None of above. chosen
  • G. Unsure - the case is ambiguous/there is not enough information to decide.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: Zassenhaus lemma
Triple: [Hans Zassenhaus, notableWork, Zassenhaus lemma]
Generated description
The Zassenhaus lemma is a fundamental result in group theory that describes how subgroups in a group extension correspond and relate to each other, often used in the study of composition series and the Jordan–Hölder theorem.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Zassenhaus lemma
Target entity description: The Zassenhaus lemma is a fundamental result in group theory that describes how subgroups in a group extension correspond and relate to each other, often used in the study of composition series and the Jordan–Hölder theorem.
  • A. Schreier refinement theorem
    The Schreier refinement theorem is a result in group theory stating that any two subnormal series of a group admit equivalent refinements, serving as a precursor and companion to the Jordan–Hölder theorem.
  • B. Jordan–Hölder theorem
    The Jordan–Hölder theorem is a fundamental result in group theory stating that any two composition series of a finite group have the same length and the same (up to order and isomorphism) simple factor groups.
  • C. Noether's isomorphism theorems
    Noether's isomorphism theorems are fundamental results in abstract algebra that relate quotient structures and substructures of groups, rings, and modules, providing a unifying framework for understanding homomorphic images and factor structures.
  • D. Cauchy's theorem in group theory
    Cauchy's theorem in group theory is a fundamental result stating that if a finite group’s order is divisible by a prime p, then the group contains an element (and hence a subgroup) of order p.
  • E. Eilenberg–Zilber theorem
    The Eilenberg–Zilber theorem is a fundamental result in algebraic topology that establishes a chain homotopy equivalence between the singular chain complex of a product space and the tensor product of the singular chain complexes of the factors.
  • F. None of above. chosen

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69ca84e7506c819095cbde4ff16512bb completed March 30, 2026, 2:12 p.m.
NER Named-entity recognition batch_69cdb3d209ac8190b9bc9ff017a132da completed April 2, 2026, 12:09 a.m.
NED1 Entity disambiguation (via context triple) batch_69d1e45add0481909a0416035054a563 completed April 5, 2026, 4:26 a.m.
NEDg Description generation batch_69d1e62832b081908de7872f62505f6c completed April 5, 2026, 4:33 a.m.
NED2 Entity disambiguation (via description) batch_69d1e69041e881909fc31e35e9bfc4f3 completed April 5, 2026, 4:35 a.m.
Created at: March 30, 2026, 8:36 p.m.