Triple
T6834114
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Peter Freyd |
E157406
|
entity |
| Predicate | knownFor |
P22
|
FINISHED |
| Object | Freyd adjoint functor theorem |
E621114
|
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: Freyd adjoint functor theorem | Statement: [Peter Freyd, knownFor, Freyd adjoint functor theorem]
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Freyd adjoint functor theorem Context triple: [Peter Freyd, knownFor, Freyd adjoint functor theorem]
-
A.
Freyd adjoint functor theorem
chosen
The Freyd adjoint functor theorem is a fundamental result in category theory that provides general conditions under which a functor admits a left or right adjoint, linking completeness and solution-set conditions to the existence of adjoint functors.
-
B.
Freyd–Mitchell embedding theorem
The Freyd–Mitchell embedding theorem is a fundamental result in category theory stating that every small abelian category can be faithfully represented as a full subcategory of a module category, thereby allowing the use of element-wise methods in abstract settings.
-
C.
Freyd–Kelly factorization system
The Freyd–Kelly factorization system is a concept in category theory that generalizes the idea of factoring morphisms into two classes with specific lifting and composition properties, providing a unifying framework for many standard factorization results.
-
D.
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.
-
E.
“Abelian Categories: An Introduction to the Theory of Functors”
“Abelian Categories: An Introduction to the Theory of Functors” is a foundational monograph in category theory that systematically develops the theory of abelian categories and functors, significantly shaping modern homological algebra.
- 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_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_69c72fab60708190825876e5715c0cc4 |
completed | March 28, 2026, 1:32 a.m. |
Created at: March 27, 2026, 2:18 p.m.