Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-13
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 C be a locally small category, so every hom-collection C(a,b) is a set (Category, object, morphism, domain, codomain, identity, composition, and hom-collection, Small, locally small, and large categories). Since sets and functions form Set (Sets and functions form the large locally small category Set), the following assignments take values in Set.

For an object a, the covariant hom-assignment C(a,−) sends an object b to C(a,b) and a morphism u:b→c to the function

u∗:C(a,b)⟶C(a,c),f⟼u∘f.

The contravariant hom-assignment C(−,a) sends b to C(b,a) and u:b→c to

u∗:C(c,a)⟶C(b,a),g⟼g∘u.

Equivalently, the latter is an assignment on Cop (Opposite category Cop). Their functor laws are proved in The assignments C(a,−) and C(−,a) are functors to Set ↗.

The two variables combine into the hom-assignment

C(−,−):Cop×C⟶Set.

It sends (a,b) to C(a,b). A morphism (a,b)→(a′,b′) in the product category consists of h:a′→a and u:b→b′ in C (Product category and its projection functors), and its action is

C(h,u):C(a,b)⟶C(a′,b′),f⟼u∘f∘h.

That this assignment is a functor, and hence a bifunctor, is proved in The hom-assignment C(−,−):Cop×C→Set is a bifunctor ↗.

Depends on

Used by

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