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 assignments C(a,) and C(,a) are functors to Set

Statement

Let C be a locally small category and let a be an object. The covariant hom-assignment C(a,):CSet and the contravariant hom-assignment C(,a):CopSet of The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category are functors.

Facts & Assumptions

Given: A locally small category C, an object a, morphisms u:bc and v:cd, and the identity and associativity axioms of C.

[F1]

The covariant assignment sends u:bc to u:fuf, while the contravariant assignment sends it to u:ggu (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[F2]

A covariant functor preserves identities and composites; a contravariant functor from C means a covariant functor from Cop (Covariant functor, identity functor, composite functor, and contravariant functor).

Proof

technique · direct
1.1

The maps in [F1] have the asserted source and target: if f:ab then uf:ac, and if g:ca then gu:ba.

givenF1
1.2

Postcomposition by 1b fixes every f:ab, and precomposition by 1b fixes every g:ba.

givenF1
1.3

For f:ab, one has (vu)(f)=(vu)f=v(uf)=v(u(f)).

givenF1
1.4

For g:da, one has (vu)(g)=g(vu)=(gv)u=u(v(g)), which is the composition law in Cop.

givenF1
2.1

Steps 1.1--1.4 give the identity and composition laws required by [F2], so both hom-assignments are functors to Set.

step 1.1step 1.2step 1.3step 1.4F2

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: 11 results over 7 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