Triple

T739665
Position Surface form Disambiguated ID Type / Status
Subject von Neumann paradox in set theory E15214 entity
Predicate relatedTo P37 FINISHED
Object 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, illustrating the counterintuitive consequences of the axiom of choice.
E15214 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: Banach–Tarski paradox | Statement: [von Neumann paradox in set theory, relatedTo, Banach–Tarski paradox]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Banach–Tarski paradox
Context triple: [von Neumann paradox in set theory, relatedTo, Banach–Tarski paradox]
  • A. Brouwer fixed-point theorem
    The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
  • B. Cantor’s paradox
    Cantor’s paradox is a foundational result in set theory showing that the “set of all sets” cannot exist because its power set would have a strictly larger cardinality, leading to a contradiction.
  • C. von Neumann paradox in set theory
    The von Neumann paradox in set theory is a foundational result showing that, under certain group-theoretic conditions, a set can be decomposed and reassembled into paradoxical subsets of equal “size,” illustrating the counterintuitive consequences of the axiom of choice.
  • D. Ulam problem in set theory
    The Ulam problem in set theory is a well-known question posed by Stanislaw Ulam concerning the structure and properties of measurable sets and functions, particularly in relation to homomorphisms and measure-theoretic regularity.
  • E. Russell’s paradox
    Russell’s paradox is a foundational logical contradiction in naive set theory that reveals problems with sets that contain themselves, leading to major developments in modern logic and the axiomatization of set theory.
  • 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: Banach–Tarski paradox
Triple: [von Neumann paradox in set theory, relatedTo, Banach–Tarski paradox]
Generated description
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, illustrating the counterintuitive consequences of the axiom of choice.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Banach–Tarski paradox
Target entity description: 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, illustrating the counterintuitive consequences of the axiom of choice.
  • A. Brouwer fixed-point theorem
    The Brouwer fixed-point theorem is a fundamental result in topology stating that any continuous function from a compact convex set (such as a closed disk) to itself has at least one fixed point.
  • B. Cantor’s paradox
    Cantor’s paradox is a foundational result in set theory showing that the “set of all sets” cannot exist because its power set would have a strictly larger cardinality, leading to a contradiction.
  • C. von Neumann paradox in set theory chosen
    The von Neumann paradox in set theory is a foundational result showing that, under certain group-theoretic conditions, a set can be decomposed and reassembled into paradoxical subsets of equal “size,” illustrating the counterintuitive consequences of the axiom of choice.
  • D. Ulam problem in set theory
    The Ulam problem in set theory is a well-known question posed by Stanislaw Ulam concerning the structure and properties of measurable sets and functions, particularly in relation to homomorphisms and measure-theoretic regularity.
  • E. Russell’s paradox
    Russell’s paradox is a foundational logical contradiction in naive set theory that reveals problems with sets that contain themselves, leading to major developments in modern logic and the axiomatization of set theory.
  • 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_69a49358aa308190adbc9b5a0a2adcf9 completed March 1, 2026, 7:28 p.m.
NER Named-entity recognition batch_69a4a5f3b6388190b5ca3fa31416b61a completed March 1, 2026, 8:47 p.m.
NED1 Entity disambiguation (via context triple) batch_69a64a63f9288190b86e4a75467acce0 completed March 3, 2026, 2:41 a.m.
NEDg Description generation batch_69a64aef14c48190b947a4c3a7becc0f completed March 3, 2026, 2:43 a.m.
NED2 Entity disambiguation (via description) batch_69a64b80d5fc81909e69832457569064 completed March 3, 2026, 2:46 a.m.
Created at: March 1, 2026, 7:37 p.m.