Triple

T4597341
Position Surface form Disambiguated ID Type / Status
Subject Luitzen Egbertus Jan Brouwer E100235 entity
Predicate notableFor P22 FINISHED
Object Brouwer fixed-point theorem E22815 NE FINISHED

How this triple was built (2 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: Brouwer fixed-point theorem | Statement: [Luitzen Egbertus Jan Brouwer, notableFor, Brouwer fixed-point theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07 
Target entity: Brouwer fixed-point theorem
Context triple: [Luitzen Egbertus Jan Brouwer, notableFor, Brouwer fixed-point theorem]
  • A. Brouwer fixed-point theorem chosen
    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.
  • B. 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.
  • 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. 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.
  • E. Sperner's lemma
    Sperner's lemma is a fundamental result in combinatorial topology that guarantees the existence of a fully labeled simplex in certain labeled triangulations, and is widely used to prove fixed-point and equilibrium theorems.
  • F. None of above.
  • G. Unsure - the case is ambiguous/there is not enough information to decide.

Provenance (3 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_69bd43cbc014819098b45f435908f88a completed March 20, 2026, 12:55 p.m.
NER Named-entity recognition batch_69bd59420c108190b5c2c5039e964da5 completed March 20, 2026, 2:27 p.m.
NED1 Entity disambiguation (via context triple) batch_69bdfa4a99c88190b7332fd2e1799b3a completed March 21, 2026, 1:54 a.m.
Created at: March 20, 2026, 1:11 p.m.