Triple
T1477426
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Shizuo Kakutani |
E30873
|
entity |
| Predicate | hasTheoremNamedAfter |
P29208
|
FINISHED |
| Object | Kakutani fixed-point theorem |
E3648
|
NE FINISHED |
How this triple was built (3 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 fixed-point theorem | Statement: [Shizuo Kakutani, hasTheoremNamedAfter, Kakutani fixed-point theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Kakutani fixed-point theorem Context triple: [Shizuo Kakutani, hasTheoremNamedAfter, Kakutani fixed-point theorem]
-
A.
Kakutani fixed-point theorem
chosen
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.
Glicksberg fixed-point theorem
The Glicksberg fixed-point theorem is a result in functional analysis that extends Kakutani’s fixed-point theorem to certain infinite-dimensional or compact convex subsets of locally convex topological vector spaces.
-
C.
Schauder fixed-point theorem
The Schauder fixed-point theorem is a fundamental result in functional analysis that guarantees the existence of fixed points for continuous compact mappings on convex closed subsets of Banach spaces, generalizing the Brouwer fixed-point theorem to infinite-dimensional settings.
-
D.
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.
-
E.
Banach fixed-point theorem
The Banach fixed-point theorem is a fundamental result in metric space theory that guarantees the existence and uniqueness of a fixed point for any contraction mapping and provides a method for finding it via iterative approximation.
- F. None of above.
- G. Unsure - the case is ambiguous/there is not enough information to decide.
PD
Predicate disambiguation
gpt-5-mini-2025-08-07
Target predicate: hasTheoremNamedAfter Context triple: [Shizuo Kakutani, hasTheoremNamedAfter, Kakutani fixed-point theorem]
-
A.
hasAwardNamedAfter
Indicates that an entity has an award that is named in honor of another entity.
-
B.
hasLawNamedAfter
Indicates that a law or piece of legislation is named in honor of, or directly after, a particular entity.
-
C.
hasAsteroidNamedAfter
Indicates that an asteroid has been officially named in honor of a particular entity.
-
D.
hasHeritageSiteNamedAfter
Indicates that one entity has a heritage site that is named after another entity.
-
E.
hasCraterNamedAfter
Indicates that a crater is named in honor of a particular person, place, or entity.
- 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_69a4c605d4c0819088ab06678b2ba6f3 |
completed | March 1, 2026, 11:04 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69ad232d039c8190840719485e214bfc |
completed | March 8, 2026, 7:20 a.m. |
| PD | Predicate disambiguation | batch_69a4c484e52c81908948ff8c0a42751b |
completed | March 1, 2026, 10:58 p.m. |
| PDg | Predicate description generation | batch_69a4c57984088190b2c2d2d9cc2e5df9 |
completed | March 1, 2026, 11:02 p.m. |
Created at: March 1, 2026, 8:11 p.m.