Triple
T16474913
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Banach–Tarski paradox |
E400162
|
entity |
| Predicate | relatedTo |
P37
|
FINISHED |
| Object |
Hausdorff paradox
The Hausdorff paradox is a result in set-theoretic geometry showing that, using the axiom of choice, a sphere can be decomposed into finitely many disjoint pieces that can be reassembled into a set not congruent to the original, illustrating the existence of non-measurable sets and paving the way for the Banach–Tarski paradox.
|
E1215851
|
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 paradox | Statement: [Banach–Tarski paradox, relatedTo, Hausdorff paradox]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hausdorff paradox Context triple: [Banach–Tarski paradox, relatedTo, Hausdorff paradox]
-
A.
Banach–Tarski paradox
The Banach–Tarski paradox is a theorem in set-theoretic geometry stating that a solid ball in 3‑dimensional space can be decomposed into finitely many non-measurable pieces and reassembled into two identical copies of the original ball, highlighting counterintuitive consequences of the axiom of choice.
-
B.
Mazurkiewicz–Sierpiński paradox
The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
-
C.
Steinhaus theorem
The Steinhaus theorem is a fundamental result in measure theory stating that the difference set of any subset of the real numbers with positive Lebesgue measure contains an open interval around zero.
-
D.
Hausdorff
Hausdorff is a topological separation property requiring that any two distinct points in a space can be enclosed in disjoint open sets.
-
E.
Sierpiński set
The Sierpiński set is a subset of the real numbers with the property that it intersects every uncountable closed subset of the reals in only countably many points, illustrating extreme pathological behavior in set theory and real analysis.
- 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 paradox Triple: [Banach–Tarski paradox, relatedTo, Hausdorff paradox]
Generated description
The Hausdorff paradox is a result in set-theoretic geometry showing that, using the axiom of choice, a sphere can be decomposed into finitely many disjoint pieces that can be reassembled into a set not congruent to the original, illustrating the existence of non-measurable sets and paving the way for the Banach–Tarski paradox.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hausdorff paradox Target entity description: The Hausdorff paradox is a result in set-theoretic geometry showing that, using the axiom of choice, a sphere can be decomposed into finitely many disjoint pieces that can be reassembled into a set not congruent to the original, illustrating the existence of non-measurable sets and paving the way for the Banach–Tarski paradox.
-
A.
Banach–Tarski paradox
The Banach–Tarski paradox is a theorem in set-theoretic geometry stating that a solid ball in 3‑dimensional space can be decomposed into finitely many non-measurable pieces and reassembled into two identical copies of the original ball, highlighting counterintuitive consequences of the axiom of choice.
-
B.
Mazurkiewicz–Sierpiński paradox
The Mazurkiewicz–Sierpiński paradox is a result in set-theoretic geometry showing that a sphere can be decomposed and reassembled in a counterintuitive way, illustrating the existence of paradoxical decompositions similar to the Banach–Tarski paradox.
-
C.
Steinhaus theorem
The Steinhaus theorem is a fundamental result in measure theory stating that the difference set of any subset of the real numbers with positive Lebesgue measure contains an open interval around zero.
-
D.
Hausdorff
Hausdorff is a topological separation property requiring that any two distinct points in a space can be enclosed in disjoint open sets.
-
E.
Sierpiński set
The Sierpiński set is a subset of the real numbers with the property that it intersects every uncountable closed subset of the reals in only countably many points, illustrating extreme pathological behavior in set theory and real analysis.
- 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_69d883813098819084f5409539723b59 |
completed | April 10, 2026, 4:58 a.m. |
| NER | Named-entity recognition | batch_69e32dd43cf88190881a5cbc80da1490 |
completed | April 18, 2026, 7:08 a.m. |
| NED1 | Entity disambiguation (via context triple) | batch_6a004f5f238881909b5f2fb41da3f932 |
completed | May 10, 2026, 9:26 a.m. |
| NEDg | Description generation | batch_6a00509164cc8190a381ba0a1de95ed1 |
completed | May 10, 2026, 9:32 a.m. |
| NED2 | Entity disambiguation (via description) | batch_6a005447f1948190a939c0051891e444 |
completed | May 10, 2026, 9:47 a.m. |
Created at: April 10, 2026, 5:13 a.m.