Triple
T1477427
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Shizuo Kakutani |
E30873
|
entity |
| Predicate | hasTheoremNamedAfter |
P29208
|
FINISHED |
| Object |
Kakutani’s random ergodic theorem
Kakutani’s random ergodic theorem is a fundamental result in ergodic theory that extends classical ergodic theorems to sequences of randomly chosen measure-preserving transformations.
|
E170224
|
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: Kakutani’s random ergodic theorem | Statement: [Shizuo Kakutani, hasTheoremNamedAfter, Kakutani’s random ergodic theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kakutani’s random ergodic theorem Context triple: [Shizuo Kakutani, hasTheoremNamedAfter, Kakutani’s random ergodic theorem]
-
A.
Kakutani fixed-point theorem
The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
-
B.
Khinchin–Kahane type inequalities
Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
-
C.
Poincaré–Birkhoff fixed-point theorem
The Poincaré–Birkhoff fixed-point theorem is a fundamental result in dynamical systems and topology that guarantees the existence of at least two fixed points for certain area-preserving twist maps of an annulus.
-
D.
Carathéodory’s extension theorem
Carathéodory’s extension theorem is a fundamental result in measure theory that guarantees a unique extension of a pre-measure defined on an algebra of sets to a complete measure on the generated σ-algebra.
-
E.
Poincaré recurrence theorem
The Poincaré recurrence theorem is a fundamental result in dynamical systems and ergodic theory stating that certain systems will, after a sufficiently long but finite time, return arbitrarily close to their initial state.
- 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: Kakutani’s random ergodic theorem Triple: [Shizuo Kakutani, hasTheoremNamedAfter, Kakutani’s random ergodic theorem]
Generated description
Kakutani’s random ergodic theorem is a fundamental result in ergodic theory that extends classical ergodic theorems to sequences of randomly chosen measure-preserving transformations.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Kakutani’s random ergodic theorem Target entity description: Kakutani’s random ergodic theorem is a fundamental result in ergodic theory that extends classical ergodic theorems to sequences of randomly chosen measure-preserving transformations.
-
A.
Kakutani fixed-point theorem
The Kakutani fixed-point theorem is a fundamental result in mathematical analysis and game theory that guarantees the existence of fixed points for certain set-valued (multivalued) functions, underpinning key existence proofs such as Nash equilibria.
-
B.
Khinchin–Kahane type inequalities
Khinchin–Kahane type inequalities are fundamental results in probability and functional analysis that bound moments or norms of random series (often with Rademacher or Gaussian coefficients) in terms of each other, providing powerful tools for studying the geometry of Banach spaces and random processes.
-
C.
Poincaré–Birkhoff fixed-point theorem
The Poincaré–Birkhoff fixed-point theorem is a fundamental result in dynamical systems and topology that guarantees the existence of at least two fixed points for certain area-preserving twist maps of an annulus.
-
D.
Carathéodory’s extension theorem
Carathéodory’s extension theorem is a fundamental result in measure theory that guarantees a unique extension of a pre-measure defined on an algebra of sets to a complete measure on the generated σ-algebra.
-
E.
Poincaré recurrence theorem
The Poincaré recurrence theorem is a fundamental result in dynamical systems and ergodic theory stating that certain systems will, after a sufficiently long but finite time, return arbitrarily close to their initial state.
- 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_69a498fe55a88190ab7f9e40ace88e49 |
completed | March 1, 2026, 7:52 p.m. |
| NER | Named-entity recognition | batch_69a4c9e02c188190b87c0aac939eafdd |
completed | March 1, 2026, 11:21 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad1ca21f288190b5f6f9a5895cdcf0 |
completed | March 8, 2026, 6:52 a.m. |
| NEDg | Description generation | batch_69ad1d13ff5c8190821d1d7026e19513 |
completed | March 8, 2026, 6:54 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69ad1d825bc48190a08db348c6222e03 |
completed | March 8, 2026, 6:56 a.m. |
Created at: March 1, 2026, 8:11 p.m.