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.

A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice

Statement

A functor F:C→D is an equivalence exactly when it is fully faithful and split essentially surjective. No choice principle is needed because the splitting is part of the data.

Facts & Assumptions

Given: A functor F:C→D.

[L1]

Equivalence and quasi-inverse data are defined in Equivalence, quasi-inverse, and adjoint equivalence of categories.

[L2]

Fully faithful and split essentially surjective have the precise hom-bijection and specified-witness meanings in Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors.

[L3]

A fully faithful functor reflects isomorphisms (Every fully faithful functor reflects isomorphisms).

Proof

technique · direct
1.1givenL1L2

Suppose first that F has quasi-inverse G, unit η:1C⇒GF, and counit ε:FG⇒1D. Then D↦(GD,εD) explicitly splits essential surjectivity.

1.2givenL2

Conversely, assume F is fully faithful and comes with objects CD and isomorphisms εD:FCD→D. Define GD=CD, and for u:D→E define G(u) as the unique morphism whose image under F is εE−1uεD; fullness gives existence and faithfulness gives uniqueness.

2.1step 1.1L1

Naturality and invertibility of η show faithfulness: if Ff=Fg, then GFf=GFg, so ηBf=GFf ηA=GFg ηA=ηBg and f=g.

2.2step 1.2L2

The defining equation makes G(1D)=1GD and G(vu)=G(v)G(u) after applying faithful F, so G is a functor, and the same equation is precisely naturality of ε:FG⇒1D.

3.1step 1.1step 2.1L1L2

Put δA=εFA∘F(ηA), an automorphism of FA. For u:FA→FB, set v=δBuδA−1 and h=ηB−1G(v)ηA; naturality of ε gives Fh=δB−1vδA=u, so F is full.

3.2step 2.2L2L3

For each A, fullness gives a unique ηA:A→GFA with F(ηA)=εFA−1; faithfulness and naturality of ε make η natural, and [L3] makes each ηA an isomorphism because its image is.

4.1step 1.1step 2.1step 3.1step 3.2L1∎

Thus (F,G,η,ε) is equivalence data. The two constructions prove both directions without making any unrecorded selection.

Depends on

Used by

Dependency tree · two levels

8 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