Triple

T2300711
Position Surface form Disambiguated ID Type / Status
Subject Ernst Zermelo E51722 entity
Predicate proved P21917 FINISHED
Object well-ordering theorem
The well-ordering theorem is a fundamental result in set theory stating that every set can be equipped with a well-order, meaning its elements can be arranged so that every nonempty subset has a least element.
E87367 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: well-ordering theorem | Statement: [Ernst Zermelo, proved, well-ordering theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: well-ordering theorem
Context triple: [Ernst Zermelo, proved, well-ordering theorem]
  • A. Cantor–Bernstein–Schröder theorem
    The Cantor–Bernstein–Schröder theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
  • B. axiom of choice
    The axiom of choice is a fundamental principle in set theory asserting that one can select an element from each set in any collection of nonempty sets, with far-reaching consequences across mathematics.
  • C. Cantor’s theorem
    Cantor’s theorem is a fundamental result in set theory stating that the power set of any set has a strictly greater cardinality than the set itself, implying there is no largest infinity.
  • D. Zermelo set theory
    Zermelo set theory is an early axiomatic system for set theory, introduced by Ernst Zermelo to rigorously formalize the concept of sets and avoid known paradoxes.
  • E. Zermelo–Fraenkel set theory
    Zermelo–Fraenkel set theory is the standard axiomatic framework for modern set theory, designed to avoid paradoxes and provide a rigorous foundation for much of mathematics.
  • 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: well-ordering theorem
Triple: [Ernst Zermelo, proved, well-ordering theorem]
Generated description
The well-ordering theorem is a fundamental result in set theory stating that every set can be equipped with a well-order, meaning its elements can be arranged so that every nonempty subset has a least element.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: well-ordering theorem
Target entity description: The well-ordering theorem is a fundamental result in set theory stating that every set can be equipped with a well-order, meaning its elements can be arranged so that every nonempty subset has a least element.
  • A. Cantor–Bernstein–Schröder theorem
    The Cantor–Bernstein–Schröder theorem is a fundamental result in set theory stating that if each of two sets can be injected into the other, then there exists a bijection between them, so the sets have the same cardinality.
  • B. axiom of choice chosen
    The axiom of choice is a fundamental principle in set theory asserting that one can select an element from each set in any collection of nonempty sets, with far-reaching consequences across mathematics.
  • C. Cantor’s theorem
    Cantor’s theorem is a fundamental result in set theory stating that the power set of any set has a strictly greater cardinality than the set itself, implying there is no largest infinity.
  • D. Zermelo set theory
    Zermelo set theory is an early axiomatic system for set theory, introduced by Ernst Zermelo to rigorously formalize the concept of sets and avoid known paradoxes.
  • E. Zermelo–Fraenkel set theory
    Zermelo–Fraenkel set theory is the standard axiomatic framework for modern set theory, designed to avoid paradoxes and provide a rigorous foundation for much of mathematics.
  • F. None of above.

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_69a88b0a9f248190bcff941463d8f65a completed March 4, 2026, 7:42 p.m.
NER Named-entity recognition batch_69abc5edc1348190a4d84606b1310711 completed March 7, 2026, 6:30 a.m.
NED1 Entity disambiguation (via context triple) batch_69ae8954a804819092c716582f23af14 completed March 9, 2026, 8:48 a.m.
NEDg Description generation batch_69ae8b188f18819088eaa3866485191a completed March 9, 2026, 8:55 a.m.
NED2 Entity disambiguation (via description) batch_69ae8b83efd48190a832032775803919 completed March 9, 2026, 8:57 a.m.
Created at: March 4, 2026, 7:49 p.m.