Triple

T1056914
Position Surface form Disambiguated ID Type / Status
Subject Brouwer fixed-point theorem E22815 entity
Predicate relatedTo P37 FINISHED
Object 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.
E121350 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: Schauder fixed-point theorem | Statement: [Brouwer fixed-point theorem, relatedTo, Schauder fixed-point theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Schauder fixed-point theorem
Context triple: [Brouwer fixed-point theorem, relatedTo, Schauder fixed-point theorem]
  • A. 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.
  • B. 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.
  • C. 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.
  • D. Weierstrass approximation theorem
    The Weierstrass approximation theorem is a fundamental result in real analysis stating that any continuous function on a closed interval can be uniformly approximated by polynomials.
  • E. Banach spaces
    Banach spaces are complete normed vector spaces that provide a fundamental framework for functional analysis and the study of infinite-dimensional linear phenomena.
  • 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: Schauder fixed-point theorem
Triple: [Brouwer fixed-point theorem, relatedTo, Schauder fixed-point theorem]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Schauder fixed-point theorem
Target entity description: 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.
  • A. 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.
  • B. 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.
  • C. 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.
  • D. Weierstrass approximation theorem
    The Weierstrass approximation theorem is a fundamental result in real analysis stating that any continuous function on a closed interval can be uniformly approximated by polynomials.
  • E. Banach spaces
    Banach spaces are complete normed vector spaces that provide a fundamental framework for functional analysis and the study of infinite-dimensional linear phenomena.
  • 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_69a493dada0481909c43649f9843ea91 completed March 1, 2026, 7:30 p.m.
NER Named-entity recognition batch_69a4b8da80dc8190b79beaf509910725 completed March 1, 2026, 10:08 p.m.
NED1 Entity disambiguation (via context triple) batch_69ac3bd110ac8190b66163de42bd3034 completed March 7, 2026, 2:53 p.m.
NEDg Description generation batch_69ac3d4b32348190883244f2b8af32a0 completed March 7, 2026, 2:59 p.m.
NED2 Entity disambiguation (via description) batch_69ac3dbf5c70819084a942fc97a9b50f completed March 7, 2026, 3:01 p.m.
Created at: March 1, 2026, 7:42 p.m.