Triple

T1056916
Position Surface form Disambiguated ID Type / Status
Subject Brouwer fixed-point theorem E22815 entity
Predicate relatedTo P37 FINISHED
Object 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.
E126344 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: Banach fixed-point theorem | Statement: [Brouwer fixed-point theorem, relatedTo, Banach fixed-point theorem]
NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07
Target entity: Banach fixed-point theorem
Context triple: [Brouwer fixed-point theorem, relatedTo, Banach fixed-point theorem]
  • A. 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.
  • 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. 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. 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 inverse mapping theorem
    The Banach inverse mapping theorem is a fundamental result in functional analysis stating that a bijective bounded linear operator between Banach spaces has a bounded linear inverse.
  • 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: Banach fixed-point theorem
Triple: [Brouwer fixed-point theorem, relatedTo, Banach fixed-point theorem]
Generated description
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.
NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07
Target entity: Banach fixed-point theorem
Target entity description: 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.
  • A. 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.
  • 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. 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. 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 inverse mapping theorem
    The Banach inverse mapping theorem is a fundamental result in functional analysis stating that a bijective bounded linear operator between Banach spaces has a bounded linear inverse.
  • 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_69ac4c1d82c88190b418e2e2f050b563 completed March 7, 2026, 4:02 p.m.
NEDg Description generation batch_69ac4e109c3c8190abcbc66aef59c52f completed March 7, 2026, 4:10 p.m.
NED2 Entity disambiguation (via description) batch_69ac4e646698819083403336eb07b7ff completed March 7, 2026, 4:12 p.m.
Created at: March 1, 2026, 7:42 p.m.