Triple

T179306
Position Surface form Disambiguated ID Type / Status
Subject Kakutani fixed-point theorem E3648 entity
Predicate relatedTo P37 FINISHED
Object 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.
E23636 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: Glicksberg fixed-point theorem | Statement: [Kakutani fixed-point theorem, relatedTo, Glicksberg fixed-point theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Glicksberg fixed-point theorem
Context triple: [Kakutani fixed-point theorem, relatedTo, Glicksberg fixed-point 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. 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.
  • C. Nash embedding theorem
    The Nash embedding theorem is a fundamental result in differential geometry that shows any Riemannian manifold can be isometrically embedded into some Euclidean space, thereby realizing abstract curved spaces as concrete subsets of standard Euclidean space.
  • D. Janet–Cartan theorem
    The Janet–Cartan theorem is a fundamental result in differential geometry stating that any real-analytic Riemannian manifold can be locally isometrically embedded into a Euclidean space of sufficiently high dimension.
  • E. Kalai–Smorodinsky bargaining solution
    The Kalai–Smorodinsky bargaining solution is a cooperative game theory concept that selects a fair agreement between parties by preserving proportional gains relative to their best possible outcomes.
  • 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: Glicksberg fixed-point theorem
Triple: [Kakutani fixed-point theorem, relatedTo, Glicksberg fixed-point theorem]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Glicksberg fixed-point theorem
Target entity description: 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.
  • 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. 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.
  • C. Nash embedding theorem
    The Nash embedding theorem is a fundamental result in differential geometry that shows any Riemannian manifold can be isometrically embedded into some Euclidean space, thereby realizing abstract curved spaces as concrete subsets of standard Euclidean space.
  • D. Janet–Cartan theorem
    The Janet–Cartan theorem is a fundamental result in differential geometry stating that any real-analytic Riemannian manifold can be locally isometrically embedded into a Euclidean space of sufficiently high dimension.
  • E. Kalai–Smorodinsky bargaining solution
    The Kalai–Smorodinsky bargaining solution is a cooperative game theory concept that selects a fair agreement between parties by preserving proportional gains relative to their best possible outcomes.
  • 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_69a25374990081909766d30c79a18e0e completed Feb. 28, 2026, 2:31 a.m.
NER Named-entity recognition batch_69a25900709c8190a65e778936be5dd5 completed Feb. 28, 2026, 2:54 a.m.
NED1 Entity disambiguation (via context triple) batch_69a30283df7081909701063a3ffa82aa completed Feb. 28, 2026, 2:58 p.m.
NEDg Description generation batch_69a302e8435c8190b5849dc295d19ccf completed Feb. 28, 2026, 2:59 p.m.
NED2 Entity disambiguation (via description) batch_69a30390b0d48190a6b100124e76cf8e completed Feb. 28, 2026, 3:02 p.m.
Created at: Feb. 28, 2026, 2:39 a.m.