Triple

T1358585
Position Surface form Disambiguated ID Type / Status
Subject Joseph-Louis Lagrange E29045 entity
Predicate knownFor P22 FINISHED
Object 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.
E156184 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: Lagrange's theorem in group theory | Statement: [Joseph-Louis Lagrange, knownFor, Lagrange's theorem in group theory]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Lagrange's theorem in group theory
Context triple: [Joseph-Louis Lagrange, knownFor, Lagrange's theorem in group theory]
  • A. 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.
  • B. Fermat's little theorem
    Fermat's little theorem is a fundamental result in number theory that characterizes how prime numbers interact with integer powers modulo that prime, forming the basis for many modern cryptographic algorithms.
  • C. Gauss’s lemma in number theory
    Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
  • D. Abelian groups
    Abelian groups are algebraic structures in which the group operation is commutative, meaning the order of combining elements does not affect the result.
  • E. Kronecker–Weber theorem
    The Kronecker–Weber theorem is a fundamental result in algebraic number theory stating that every finite abelian extension of the rational numbers is contained in a cyclotomic field generated by roots of unity.
  • 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: Lagrange's theorem in group theory
Triple: [Joseph-Louis Lagrange, knownFor, Lagrange's theorem in group theory]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Lagrange's theorem in group theory
Target entity description: 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.
  • A. 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.
  • B. Fermat's little theorem
    Fermat's little theorem is a fundamental result in number theory that characterizes how prime numbers interact with integer powers modulo that prime, forming the basis for many modern cryptographic algorithms.
  • C. Gauss’s lemma in number theory
    Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
  • D. Abelian groups
    Abelian groups are algebraic structures in which the group operation is commutative, meaning the order of combining elements does not affect the result.
  • E. Kronecker–Weber theorem
    The Kronecker–Weber theorem is a fundamental result in algebraic number theory stating that every finite abelian extension of the rational numbers is contained in a cyclotomic field generated by roots of unity.
  • 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_69a498d77abc8190913bf57e5f51d2c4 completed March 1, 2026, 7:51 p.m.
NER Named-entity recognition batch_69a4c28f5b988190b0be4504eabb919d completed March 1, 2026, 10:49 p.m.
NED1 Entity disambiguation (via context triple) batch_69acce701a84819094815ab6e8383b76 completed March 8, 2026, 1:18 a.m.
NEDg Description generation batch_69accf15d910819098e9a4b24247881b completed March 8, 2026, 1:21 a.m.
NED2 Entity disambiguation (via description) batch_69accff8af488190a7580cf7c02ceed9 completed March 8, 2026, 1:25 a.m.
Created at: March 1, 2026, 7:56 p.m.