Triple

T6800956
Position Surface form Disambiguated ID Type / Status
Subject Lagrange's theorem in group theory E156184 entity
Predicate isGeneralizedBy P2372 FINISHED
Object Sylow theorems
The Sylow theorems are fundamental results in finite group theory that describe the existence, conjugacy, and number of subgroups whose orders are powers of a prime dividing the group order.
E620660 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: Sylow theorems | Statement: [Lagrange's theorem in group theory, isGeneralizedBy, Sylow theorems]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Sylow theorems
Context triple: [Lagrange's theorem in group theory, isGeneralizedBy, Sylow theorems]
  • A. Lagrange's theorem in group theory
    Lagrange's theorem in group theory is a fundamental result stating that the order of any subgroup of a finite group divides the order of the group.
  • B. 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.
  • C. 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.
  • D. Burnside's lemma
    Burnside's lemma is a result in group theory and combinatorics that counts distinct configurations under symmetries by averaging the number of fixed points of group actions.
  • E. Theorie der Gruppen von endlicher Ordnung
    "Theorie der Gruppen von endlicher Ordnung" is a foundational mathematical monograph on finite group theory that helped shape the modern development of abstract algebra.
  • 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: Sylow theorems
Triple: [Lagrange's theorem in group theory, isGeneralizedBy, Sylow theorems]
Generated description
The Sylow theorems are fundamental results in finite group theory that describe the existence, conjugacy, and number of subgroups whose orders are powers of a prime dividing the group order.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Sylow theorems
Target entity description: The Sylow theorems are fundamental results in finite group theory that describe the existence, conjugacy, and number of subgroups whose orders are powers of a prime dividing the group order.
  • A. Lagrange's theorem in group theory
    Lagrange's theorem in group theory is a fundamental result stating that the order of any subgroup of a finite group divides the order of the group.
  • B. 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.
  • C. 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.
  • D. Burnside's lemma
    Burnside's lemma is a result in group theory and combinatorics that counts distinct configurations under symmetries by averaging the number of fixed points of group actions.
  • E. Theorie der Gruppen von endlicher Ordnung
    "Theorie der Gruppen von endlicher Ordnung" is a foundational mathematical monograph on finite group theory that helped shape the modern development of abstract algebra.
  • 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_69c68826e6a48190a3d220b541e639de completed March 27, 2026, 1:37 p.m.
NER Named-entity recognition batch_69c6d2e595188190a0bb4b595df3adb2 completed March 27, 2026, 6:56 p.m.
NED1 Entity disambiguation (via context triple) batch_69c71a9b0cc48190819380aeaf0228e7 completed March 28, 2026, 12:02 a.m.
NEDg Description generation batch_69c71d64c2fc8190abda8b5a0f57291b completed March 28, 2026, 12:14 a.m.
NED2 Entity disambiguation (via description) batch_69c71f3d4b8081908768c79642266431 completed March 28, 2026, 12:22 a.m.
Created at: March 27, 2026, 2:16 p.m.