Triple
T3044187
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Tucker’s lemma |
E83404
|
entity |
| Predicate | isAnalogOf |
P3882
|
FINISHED |
| Object |
Borsuk–Ulam theorem
The Borsuk–Ulam theorem is a fundamental result in algebraic topology stating that any continuous map from an n-dimensional sphere to n-dimensional Euclidean space maps some pair of antipodal points to the same point.
|
E83404
|
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: Borsuk–Ulam theorem | Statement: [Tucker’s lemma, isAnalogOf, Borsuk–Ulam theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Borsuk–Ulam theorem Context triple: [Tucker’s lemma, isAnalogOf, Borsuk–Ulam theorem]
-
A.
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.
-
B.
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.
-
C.
Tucker’s lemma
Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
-
D.
Poincaré–Hopf theorem
The Poincaré–Hopf theorem is a fundamental result in differential topology that relates the sum of the indices of a vector field’s isolated zeros on a compact manifold to the manifold’s Euler characteristic.
-
E.
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.
- 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: Borsuk–Ulam theorem Triple: [Tucker’s lemma, isAnalogOf, Borsuk–Ulam theorem]
Generated description
The Borsuk–Ulam theorem is a fundamental result in algebraic topology stating that any continuous map from an n-dimensional sphere to n-dimensional Euclidean space maps some pair of antipodal points to the same point.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Borsuk–Ulam theorem Target entity description: The Borsuk–Ulam theorem is a fundamental result in algebraic topology stating that any continuous map from an n-dimensional sphere to n-dimensional Euclidean space maps some pair of antipodal points to the same point.
-
A.
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.
-
B.
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.
-
C.
Tucker’s lemma
chosen
Tucker’s lemma is a combinatorial analog of the Borsuk–Ulam theorem that provides conditions guaranteeing the existence of certain complementary edge labels in triangulated spheres.
-
D.
Poincaré–Hopf theorem
The Poincaré–Hopf theorem is a fundamental result in differential topology that relates the sum of the indices of a vector field’s isolated zeros on a compact manifold to the manifold’s Euler characteristic.
-
E.
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.
- F. None of above.
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_69ad8b24924c8190a9bb6f61d519e4ae |
completed | March 8, 2026, 2:43 p.m. |
| NER | Named-entity recognition | batch_69ad9b5ec5988190b8b6c95c743c6d1e |
completed | March 8, 2026, 3:53 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69b1ded35e008190be7dd72aa7537a3b |
completed | March 11, 2026, 9:29 p.m. |
| NEDg | Description generation | batch_69b1dfa2fb28819089d7d76d9dc72e06 |
completed | March 11, 2026, 9:33 p.m. |
| NED2 | Entity disambiguation (via description) | batch_69b1e0243a848190bce24d035a79fc0a |
completed | March 11, 2026, 9:35 p.m. |
Created at: March 8, 2026, 3:01 p.m.