Triple
T6710768
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | David Gale |
E153133
|
entity |
| Predicate | notableWork |
P4
|
FINISHED |
| Object |
Gale–Nikaidō–Debreu theorem
The Gale–Nikaidō–Debreu theorem is a fundamental result in mathematical economics that provides conditions ensuring the existence (and sometimes uniqueness) of equilibrium in certain nonlinear and general equilibrium models.
|
E612750
|
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: Gale–Nikaidō–Debreu theorem | Statement: [David Gale, notableWork, Gale–Nikaidō–Debreu theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Gale–Nikaidō–Debreu theorem Context triple: [David Gale, notableWork, Gale–Nikaidō–Debreu 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.
Knaster–Kuratowski–Mazurkiewicz lemma
The Knaster–Kuratowski–Mazurkiewicz lemma is a fundamental result in combinatorial topology that guarantees the existence of a point common to a family of closed sets covering a simplex under certain intersection conditions, and underlies several fixed-point theorems.
-
C.
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.
-
D.
Tarski’s fixed point theorem
Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
-
E.
Kuhn’s theorem
Kuhn’s theorem is a fundamental result in game theory that shows any finite extensive-form game with perfect recall has an equivalent normal-form (strategic-form) representation, ensuring the existence of mixed-strategy equilibria.
- 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: Gale–Nikaidō–Debreu theorem Triple: [David Gale, notableWork, Gale–Nikaidō–Debreu theorem]
Generated description
The Gale–Nikaidō–Debreu theorem is a fundamental result in mathematical economics that provides conditions ensuring the existence (and sometimes uniqueness) of equilibrium in certain nonlinear and general equilibrium models.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Gale–Nikaidō–Debreu theorem Target entity description: The Gale–Nikaidō–Debreu theorem is a fundamental result in mathematical economics that provides conditions ensuring the existence (and sometimes uniqueness) of equilibrium in certain nonlinear and general equilibrium models.
-
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.
Knaster–Kuratowski–Mazurkiewicz lemma
The Knaster–Kuratowski–Mazurkiewicz lemma is a fundamental result in combinatorial topology that guarantees the existence of a point common to a family of closed sets covering a simplex under certain intersection conditions, and underlies several fixed-point theorems.
-
C.
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.
-
D.
Tarski’s fixed point theorem
Tarski’s fixed point theorem is a fundamental result in order theory and lattice theory that guarantees the existence of fixed points for monotone functions on complete lattices, with wide applications in logic, computer science, and economics.
-
E.
Kuhn’s theorem
Kuhn’s theorem is a fundamental result in game theory that shows any finite extensive-form game with perfect recall has an equivalent normal-form (strategic-form) representation, ensuring the existence of mixed-strategy equilibria.
- 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_69c68808d8d8819087369015270788fe |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d107380481909cc761dc182834c1 |
completed | March 27, 2026, 6:48 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c700906a9c81908a121db4291195d8 |
completed | March 27, 2026, 10:11 p.m. |
| NEDg | Description generation | batch_69c701db4eb081908db6dd22fbfb28d1 |
completed | March 27, 2026, 10:16 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69c7026529ec81909479b826efb5eb54 |
completed | March 27, 2026, 10:19 p.m. |
Created at: March 27, 2026, 2:06 p.m.