Triple
T3913060
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | axiom of choice |
E87367
|
entity |
| Predicate | implies |
P1661
|
FINISHED |
| Object |
Hausdorff maximal principle
The Hausdorff maximal principle is a set-theoretic statement asserting that every partially ordered set contains a maximal totally ordered subset (chain), and is known to be equivalent to the axiom of choice.
|
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: Hausdorff maximal principle | Statement: [axiom of choice, implies, Hausdorff maximal principle]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hausdorff maximal principle Context triple: [axiom of choice, implies, Hausdorff maximal principle]
-
A.
Alexandrov–Hausdorff theorem
The Alexandrov–Hausdorff theorem is a result in descriptive set theory that characterizes analytic sets as continuous images of Baire space, playing a key role in the study of definable sets in Polish spaces.
-
B.
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.
-
C.
Banach–Steinhaus theorem
The Banach–Steinhaus theorem is a fundamental result in functional analysis that characterizes when a family of continuous linear operators is uniformly bounded, with major implications for the behavior of sequences of operators on Banach spaces.
-
D.
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.
-
E.
Ky Fan’s lemma
Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
- 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: Hausdorff maximal principle Triple: [axiom of choice, implies, Hausdorff maximal principle]
Generated description
The Hausdorff maximal principle is a set-theoretic statement asserting that every partially ordered set contains a maximal totally ordered subset (chain), and is known to be equivalent to the axiom of choice.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hausdorff maximal principle Target entity description: The Hausdorff maximal principle is a set-theoretic statement asserting that every partially ordered set contains a maximal totally ordered subset (chain), and is known to be equivalent to the axiom of choice.
-
A.
Alexandrov–Hausdorff theorem
The Alexandrov–Hausdorff theorem is a result in descriptive set theory that characterizes analytic sets as continuous images of Baire space, playing a key role in the study of definable sets in Polish spaces.
-
B.
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.
-
C.
Banach–Steinhaus theorem
The Banach–Steinhaus theorem is a fundamental result in functional analysis that characterizes when a family of continuous linear operators is uniformly bounded, with major implications for the behavior of sequences of operators on Banach spaces.
-
D.
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.
-
E.
Ky Fan’s lemma
Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
- 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_69aed9424514819086e9c58adde6652d |
completed | March 9, 2026, 2:29 p.m. |
| NER | Named-entity recognition | batch_69aeed37b19c81908e690c495d96607f |
completed | March 9, 2026, 3:54 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b5285c52808190b9cbb2e3e03a18cb |
completed | March 14, 2026, 9:20 a.m. |
| NEDg | Description generation | batch_69b52c29e69c8190973940b8456a6b35 |
completed | March 14, 2026, 9:36 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69b52cbfb5dc8190a312ac87551803c6 |
completed | March 14, 2026, 9:39 a.m. |
Created at: March 9, 2026, 3:22 p.m.