Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 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 hom-assignment C(,):Cop×CSet is a bifunctor

Statement

For every locally small category C, the hom-assignment

C(,):Cop×CSet

of The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category is a functor. Its restrictions in the two variables are the contravariant and covariant hom-functors of The assignments C(a,) and C(,a) are functors to Set.

Facts & Assumptions

Given: A locally small category C; morphisms h:aa, k:aa, u:bb, and v:bb; and the category axioms of C.

[L1]

The one-variable assignments C(a,) and C(,a) are functors to Set (The assignments C(a,) and C(,a) are functors to Set).

[F1]

A morphism in a product category is a pair, and identities and composition are componentwise (Product category and its projection functors).

[F2]

The hom-assignment sends (h,u) to fufh (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

Proof

technique · direct
1.1

If f:ab, then ufh:ab, so [F2] defines a function C(a,b)C(a,b).

givenF2
1.2

For every f:ab, the identity pair acts by 1bf1a=f.

givenF1F2
1.3

Applying (h,u) and then (k,v) sends f to v(ufh)k=(vu)f(hk), which is the action of their componentwise composite in Cop×C.

givenF1F2
2.1

Steps 1.1--1.3 prove the functor laws, and fixing either variable recovers the postcomposition or precomposition action of [L1]; hence the hom-assignment is the asserted bifunctor.

step 1.1step 1.2step 1.3L1

Depends on

Used by

Cited to discharge well-definedness by The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 12 results over 8 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources