How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category
Definition
Let be a locally small category, so every hom-collection is a set (Category, object, morphism, domain, codomain, identity, composition, and hom-collection, Small, locally small, and large categories). Since sets and functions form (Sets and functions form the large locally small category ), the following assignments take values in .
For an object , the covariant hom-assignment sends an object to and a morphism to the function
The contravariant hom-assignment sends to and to
Equivalently, the latter is an assignment on (Opposite category ). Their functor laws are proved in The assignments and are functors to ↗.
The two variables combine into the hom-assignment
It sends to . A morphism in the product category consists of and in (Product category and its projection functors), and its action is
That this assignment is a functor, and hence a bifunctor, is proved in The hom-assignment is a bifunctor ↗.
Depends on
Used by
- Hom(X,−) is continuous, while Hom(−,X) sends every existing small colimit to a limit of sets Corollary
- The end of the hom-bifunctor is the commutative monoid of natural endomorphisms of the identity functor Corollary
- The hom-functor turns a coend into an end and carries an end to an end Corollary
- Pointwise Kan extensions as those preserved by representables Definition
- Set-weighted limits and colimits Definition
- The power and the copower of an object by a set Definition
- The tensor product of a presheaf and a covariant set-valued functor Definition
- A weighted limit computing a kernel pair Example
- The coend of the hom-bifunctor Example
- FALSE: under this page's convention a coend is the colimit of the same twisted-arrow diagram whose limit is the end False statement
- Evaluation at the identity gives Nat(C(a,-),F)≅ F(a) and proves that the natural-transformation collection is a set Lemma
- A weighted limit of a set-valued diagram is the set of natural transformations from the weight Proposition
- A coend is a colimit weighted by the hom-bifunctor, and an end a limit weighted by it Theorem
- A power by a set is the product of that many copies and a copower is the coproduct Theorem
- A representable functor carries a weighted limit to the weighted limit of the composed diagram Theorem
- A weighted limit is an end of powers and a weighted colimit a coend of copowers Theorem
- A weighted limit is an ordinary limit over the category of elements of the weight, and a weighted colimit an ordinary colimit over it Theorem
- Every covariantly representable functor to Set preserves all existing small limits Theorem
- For a small source category, the set of natural transformations is an end of the hom-bifunctor of the values Theorem
- Hom is left exact in each variable Theorem
- Kan extensions as coends and ends Theorem
- The assignments C(a,-) and C(-,a) are functors to Set Theorem
- The co-Yoneda isomorphisms: a set-valued functor is a coend against a representable Theorem
- The comma-category and representable-preservation notions of pointwise Kan extension agree Theorem
- The end of the function-set functor on a representable is evaluation Theorem
- The hom-assignment C(-,-):CᵒᵖtimesCtoSet is a bifunctor Theorem
- The hom-bifunctor of a preadditive category takes values in abelian groups Theorem
- The twisted arrow category is the category of elements of the hom-bifunctor Theorem
- Under local smallness, transposition gives the natural hom-set bijection, and conversely Theorem
- Weighting by a representable evaluates the diagram Theorem
- Weighting by the constant singleton gives exactly the ordinary limit Theorem
Dependency tree · two levels
10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Emily Riehl, Category Theory in Context, Chapter 2, Section 2.1 (standard reference, not scraped)
- Tom Leinster, Basic Category Theory, Chapter 4, Section 4.1 (standard reference, not scraped)