Triple
T6834031
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Categories for the Working Mathematician |
E157404
|
entity |
| Predicate | hasConcept |
P531
|
FINISHED |
| Object |
Yoneda lemma
The Yoneda lemma is a fundamental result in category theory that characterizes objects by their sets of morphisms into them, providing a powerful bridge between abstract categories and concrete set-valued functors.
|
E621111
|
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: Yoneda lemma | Statement: [Categories for the Working Mathematician, hasConcept, Yoneda lemma]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Yoneda lemma Context triple: [Categories for the Working Mathematician, hasConcept, Yoneda lemma]
-
A.
category theory
Category theory is a branch of mathematics that studies abstract structures and relationships between them using the language of objects and morphisms, providing a unifying framework across many areas of math and theoretical computer science.
-
B.
Curry–Howard correspondence
The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
-
C.
Ky Fan’s lemma
Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
-
D.
Grothendieck universe
A Grothendieck universe is a set-theoretic construct large enough to contain all the usual objects and operations of mathematics, used to rigorously handle "large" categories while avoiding paradoxes.
-
E.
Poincaré lemma
The Poincaré lemma is a fundamental result in differential geometry and topology stating that every closed differential form on a star-shaped (or more generally, contractible) domain is locally exact.
- 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: Yoneda lemma Triple: [Categories for the Working Mathematician, hasConcept, Yoneda lemma]
Generated description
The Yoneda lemma is a fundamental result in category theory that characterizes objects by their sets of morphisms into them, providing a powerful bridge between abstract categories and concrete set-valued functors.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Yoneda lemma Target entity description: The Yoneda lemma is a fundamental result in category theory that characterizes objects by their sets of morphisms into them, providing a powerful bridge between abstract categories and concrete set-valued functors.
-
A.
category theory
Category theory is a branch of mathematics that studies abstract structures and relationships between them using the language of objects and morphisms, providing a unifying framework across many areas of math and theoretical computer science.
-
B.
Curry–Howard correspondence
The Curry–Howard correspondence is a foundational principle in logic and computer science that establishes a deep analogy between proofs and programs, and between logical propositions and types in programming languages.
-
C.
Ky Fan’s lemma
Ky Fan’s lemma is a combinatorial topological result that generalizes Tucker’s lemma and provides conditions guaranteeing the existence of certain balanced or fully labeled simplices in labeled triangulations of spheres or simplices.
-
D.
Grothendieck universe
A Grothendieck universe is a set-theoretic construct large enough to contain all the usual objects and operations of mathematics, used to rigorously handle "large" categories while avoiding paradoxes.
-
E.
Poincaré lemma
The Poincaré lemma is a fundamental result in differential geometry and topology stating that every closed differential form on a star-shaped (or more generally, contractible) domain is locally exact.
- 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_69c6882c53608190b99aebef079b23bd |
completed | March 27, 2026, 1:37 p.m. |
| NER | Named-entity recognition | batch_69c6d67936288190829fedc3729aadd8 |
completed | March 27, 2026, 7:11 p.m. |
| NED1 | Entity disambiguation (via context triple) | batch_69c723fd50c88190af005fd58ca0aee6 |
completed | March 28, 2026, 12:42 a.m. |
| NEDg | Description generation | batch_69c7247806808190ac60c134cec612c8 |
completed | March 28, 2026, 12:44 a.m. |
| NED2 | Entity disambiguation (via description) | batch_69c7253b94f081909e7cee870a12af6b |
completed | March 28, 2026, 12:47 a.m. |
Created at: March 27, 2026, 2:18 p.m.