Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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 unit-counit, hom-set, unit-universal, and counit-universal encodings of an adjunction are equivalent

Statement

For functors F:C→D and G:D→C, the following descriptions carry the same adjunction data:

  1. a unit and counit satisfying the triangle identities;
  2. when C and D are locally small, a natural family of bijections D(Fc,d)≅C(c,Gd);
  3. a natural family of universal arrows (Fc,ηc) from each c to G;
  4. a natural family of universal arrows (Gd,εd) from F to each d.

Only description 2 requires local smallness.

Facts & Assumptions

Given: Categories C,D and functors F:C→D, G:D→C.

[L1]

An adjunction is functors together with a unit, counit, and the two triangle identities (Adjunction by unit, counit, and the triangle identities).

[L2]

Under local smallness, unit-counit data and natural hom-set bijections determine one another uniquely (Under local smallness, transposition gives the natural hom-set bijection, and conversely).

[L3]

Unit components are universal arrows and initial comma objects, while counit components are universal arrows and terminal comma objects (Unit components are initial in comma categories, and counit components are terminal).

Proof

technique · direct
1.1L2

Descriptions 1 and 2 determine one another by [L2], including the recovery formulas obtained by transposing identity morphisms.

1.2L3

Description 1 gives descriptions 3 and 4 by [L3].

1.3L1L3

Conversely, from description 3, put u♭:=G(u)∘ηc for u:Fc→d; the unique-factorisation property of (Fc,ηc) says exactly that this is a bijection onto the morphisms c→Gd, with inverse the unique factorisation. Define εd:FGd→d as the unique morphism with G(εd)∘ηGd=1Gd, which is the second triangle identity. For g:d→d′ the two morphisms g∘εd and εd′∘FG(g) have the same factorisation datum, since G(g)G(εd)ηGd=G(g) and G(εd′)GFG(g)ηGd=G(εd′)ηGd′G(g)=G(g); uniqueness makes ε natural. Likewise G(εFc)GF(ηc)ηc=G(εFc)ηGFcηc=ηc=G(1Fc)ηc, so uniqueness gives the first triangle identity εFcF(ηc)=1Fc. This recovers a unit and counit satisfying [L1].

2.1step 1.3L1L3

The dual construction from description 4 defines ηc:c→GFc as the unique morphism with εFc∘F(ηc)=1Fc, proves its naturality from terminality of (Gd,εd) in (F↓d) by the argument of step 1.3 read in the opposite categories, and yields the second triangle identity the same way. It therefore gives the same unit-counit data.

3.1step 1.1step 1.2step 1.3step 2.1∎

Steps 1.1 through 2.1 establish all implications. Since [L3] is expressed by unique individual factorisations, descriptions 1, 3, and 4 remain meaningful without local smallness, whereas [L2] explicitly uses hom-sets.

Depends on

Used by

Dependency tree · two levels

11 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