Triple
T6660393
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Felix Hausdorff |
E151458
|
entity |
| Predicate | notableConcept |
P201
|
FINISHED |
| Object |
Hausdorff maximal principle
The Hausdorff maximal principle is a foundational result in set theory and order theory stating that every partially ordered set contains a maximal totally ordered subset (a maximal chain), and it is equivalent to the axiom of choice.
|
E608817
|
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: [Felix Hausdorff, notableConcept, Hausdorff maximal principle]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hausdorff maximal principle Context triple: [Felix Hausdorff, notableConcept, Hausdorff maximal principle]
-
A.
Hahn–Banach theorem
The Hahn–Banach theorem is a fundamental result in functional analysis that guarantees the extension of bounded linear functionals from a subspace to the whole space without increasing their norm.
-
B.
Krein–Milman theorem
The Krein–Milman theorem is a fundamental result in functional analysis and convex geometry stating that a compact convex set in a locally convex topological vector space is the closed convex hull of its extreme points.
-
C.
Banach–Alaoglu theorem
The Banach–Alaoglu theorem is a fundamental result in functional analysis stating that the closed unit ball in the dual of a normed space is compact in the weak-* topology.
-
D.
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.
-
E.
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.
- 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: [Felix Hausdorff, notableConcept, Hausdorff maximal principle]
Generated description
The Hausdorff maximal principle is a foundational result in set theory and order theory stating that every partially ordered set contains a maximal totally ordered subset (a maximal chain), and it is 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 foundational result in set theory and order theory stating that every partially ordered set contains a maximal totally ordered subset (a maximal chain), and it is equivalent to the axiom of choice.
-
A.
Hahn–Banach theorem
The Hahn–Banach theorem is a fundamental result in functional analysis that guarantees the extension of bounded linear functionals from a subspace to the whole space without increasing their norm.
-
B.
Krein–Milman theorem
The Krein–Milman theorem is a fundamental result in functional analysis and convex geometry stating that a compact convex set in a locally convex topological vector space is the closed convex hull of its extreme points.
-
C.
Banach–Alaoglu theorem
The Banach–Alaoglu theorem is a fundamental result in functional analysis stating that the closed unit ball in the dual of a normed space is compact in the weak-* topology.
-
D.
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.
-
E.
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.
- 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_69c687f5fac48190a09e4838d9c6b45d |
completed | March 27, 2026, 1:36 p.m. |
| NER | Named-entity recognition | batch_69c6b071cc6c81909d7df1841c645661 |
completed | March 27, 2026, 4:29 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c6ef0738a88190802abaeb0ab0a927 |
completed | March 27, 2026, 8:56 p.m. |
| NEDg | Description generation | batch_69c6f0a3f0b481908dfe70d626277e8f |
completed | March 27, 2026, 9:03 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69c6f1a3995c8190b22766356b6e6bf8 |
completed | March 27, 2026, 9:07 p.m. |
Created at: March 27, 2026, 2:02 p.m.