Triple

T16474916
Position Surface form Disambiguated ID Type / Status
Subject Banach–Tarski paradox E400162 entity
Predicate relatedTo P37 FINISHED
Object Tarski’s theorem on amenable groups
Tarski’s theorem on amenable groups is a fundamental result in group theory and measure theory that characterizes amenable groups as precisely those that do not admit Banach–Tarski-type paradoxical decompositions.
E1215852 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: Tarski’s theorem on amenable groups | Statement: [Banach–Tarski paradox, relatedTo, Tarski’s theorem on amenable groups]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Tarski’s theorem on amenable groups
Context triple: [Banach–Tarski paradox, relatedTo, Tarski’s theorem on amenable groups]
  • A. Kesten’s theorem on random walks on groups
    Kesten’s theorem on random walks on groups is a fundamental result in probability theory that characterizes amenability of groups via the spectral radius of associated random walks.
  • B. Connes embedding problem
    The Connes embedding problem is a central open question in operator algebras and quantum theory that asks whether every separable II₁ factor can be approximated in a specific way by finite-dimensional matrix algebras.
  • C. Dehn’s decision problems in group theory
    Dehn’s decision problems in group theory are foundational early 20th-century problems that introduced algorithmic questions about the solvability of word, conjugacy, and isomorphism problems in finitely presented groups, helping launch the field of algorithmic group theory.
  • D. Dixmier problem in group theory
    The Dixmier problem in group theory is a famous open question asking whether every nontrivial finitely generated group has a nontrivial finite-dimensional unitary representation.
  • E. Gowers dichotomy for Banach spaces
    Gowers dichotomy for Banach spaces is a fundamental result in functional analysis that classifies infinite-dimensional Banach spaces by showing that each contains either a subspace with an unconditional basis or a hereditarily indecomposable subspace.
  • 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: Tarski’s theorem on amenable groups
Triple: [Banach–Tarski paradox, relatedTo, Tarski’s theorem on amenable groups]
Generated description
Tarski’s theorem on amenable groups is a fundamental result in group theory and measure theory that characterizes amenable groups as precisely those that do not admit Banach–Tarski-type paradoxical decompositions.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Tarski’s theorem on amenable groups
Target entity description: Tarski’s theorem on amenable groups is a fundamental result in group theory and measure theory that characterizes amenable groups as precisely those that do not admit Banach–Tarski-type paradoxical decompositions.
  • A. Kesten’s theorem on random walks on groups
    Kesten’s theorem on random walks on groups is a fundamental result in probability theory that characterizes amenability of groups via the spectral radius of associated random walks.
  • B. Connes embedding problem
    The Connes embedding problem is a central open question in operator algebras and quantum theory that asks whether every separable II₁ factor can be approximated in a specific way by finite-dimensional matrix algebras.
  • C. Dehn’s decision problems in group theory
    Dehn’s decision problems in group theory are foundational early 20th-century problems that introduced algorithmic questions about the solvability of word, conjugacy, and isomorphism problems in finitely presented groups, helping launch the field of algorithmic group theory.
  • D. Dixmier problem in group theory
    The Dixmier problem in group theory is a famous open question asking whether every nontrivial finitely generated group has a nontrivial finite-dimensional unitary representation.
  • E. Gowers dichotomy for Banach spaces
    Gowers dichotomy for Banach spaces is a fundamental result in functional analysis that classifies infinite-dimensional Banach spaces by showing that each contains either a subspace with an unconditional basis or a hereditarily indecomposable subspace.
  • 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.