Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

Under local smallness, transposition gives the natural hom-set bijection, and conversely

Statement

Let C and D be locally small categories and let F:C→D and G:D→C be functors.

An adjunction F⊣G determines bijections

Φc,d:D(Fc,d)→ ≅ C(c,Gd),Φc,d(u)=G(u)∘ηc,

natural in c and d, whose inverses are Ψc,d(v)=εd∘F(v). Conversely, every such natural family of bijections determines a unique unit and counit satisfying the triangle identities, and hence a unique adjunction structure on F and G.

Facts & Assumptions

Given: Locally small categories C,D and functors F:C→D, G:D→C.

[F1]

In a locally small category every hom-collection is a set (Small, locally small, and large categories).

[F2]

In a locally small category the two-variable hom assignment is a Set-valued bifunctor, contravariant in its first variable and covariant in its second (The covariant and contravariant hom-assignments and the hom-bifunctor of a locally small category).

[L1]

Under an adjunction, the two transpose formulas are mutually inverse on every pair of hom-collections (The unit and counit transpose formulas are mutually inverse).

[L2]

The transpose formulas are u♭=G(u)ηc and v♯=εdF(v) (Adjuncts and transposition under an adjunction).

Proof

technique · direct
1.1F1L1

Given an adjunction, [F1] makes the displayed hom-collections sets, and [L1] shows that Φc,d and Ψc,d are inverse bijections.

1.2L2F2algebra

For a:c′→c, b:d→d′, and u:Fc→d, functoriality and naturality of η give Φc′,d′(b∘u∘F(a))=G(b)∘Φc,d(u)∘a; this is naturality in both variables in the sense of [F2].

1.3construct

Conversely, let Φ be a natural family of bijections with inverse Ψ. Define ηc:=Φc,Fc(1Fc) and εd:=ΨGd,d(1Gd).

2.1step 1.3F2

Naturality of Φ in c makes η natural, and naturality of Ψ in d makes ε natural.

2.2step 1.3F2

Naturality in d and c, respectively, gives Φc,d(u)=G(u)∘ηc and Ψc,d(v)=εd∘F(v).

3.1step 2.2algebra

Since ΨΦ fixes 1Fc, step 2.2 gives εFc∘F(ηc)=1Fc; since ΦΨ fixes 1Gd, it gives G(εd)∘ηGd=1Gd.

4.1step 1.3step 2.1step 3.1∎

Thus the data of steps 1.3 and 2.1 satisfy both triangle identities and define an adjunction. Any unit and counit inducing Φ must be the transposes of the two identity morphisms, so step 1.3 also proves uniqueness.

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