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

Every equivalence of categories can be equipped as an adjoint equivalence

Statement

Every equivalence of categories admits a choice of unit and counit satisfying the triangle identities, and hence can be equipped as an adjoint equivalence.

Facts & Assumptions

Given: Equivalence data F:C⇄D:G with a natural isomorphism η:1C⇒GF.

[L1]

An adjoint equivalence is equivalence data satisfying two triangle identities (Equivalence, quasi-inverse, and adjoint equivalence of categories), and natural isomorphisms have invertible components (A natural transformation is a natural isomorphism exactly when every component is an isomorphism).

Proof

technique · direct
1.1

The quasi-inverse G is itself an equivalence, hence fully faithful by [L2]; for each D, fullness gives a unique εD′:FGD→D with G(εD′)=ηGD−1.

givenL1L2
2.1

Naturality of η and faithfulness of G show that the components εD′ are natural; since G(εD′) is an isomorphism, reflection in [L2] makes each εD′ an isomorphism.

step 1.1L1L2
3.1

The defining equation gives Gε′∘ηG=1G; applying G to ε′F∘Fη and using naturality of η at each ηA gives the identity, and faithfulness of G yields ε′F∘Fη=1F.

step 2.1L1L2
4.1

Thus (F,G,η,ε′) satisfies both triangle identities and is an adjoint equivalence.

step 3.1L1∎

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