Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-24
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.

Supplied created canonical presentations give a quasi-inverse to the comparison functor

Statement

Let F:CD:U be an adjunction inducing the monad T=UF, and let K:DCT be its comparison functor. Suppose U creates coequalizers of U-split pairs and, for every T-algebra (A,a), a specific created coequalizer of its lifted canonical pair is supplied. Then these supplied coequalizers define a functor H:CTD and natural isomorphisms

KH1CT,HK1D.

Thus H is a quasi-inverse to K.

Facts & Assumptions

Given: An adjunction FU inducing T on the nose, with U creating coequalizers of U-split pairs.

[L1]

The comparison functor is K(d)=(Ud,Uεd) and K(h)=U(h) (The comparison functor to the Eilenberg–Moore category exists and is unique).

[L2]
[L3]

A parallel pair is U-split when its image under U extends to a split coequalizer diagram, and ordinary creation supplies and reflects the corresponding lifted coequalizer up to isomorphism (U-split pairs and ordinary or strict creation of their coequalizers).

[L4]

The Eilenberg–Moore forgetful functor strictly creates coequalizers of its split pairs (The Eilenberg–Moore forgetful functor strictly creates coequalizers of UT-split pairs).

[L5]

Every T-algebra is the coequalizer in CT of its canonical pair of free algebras (Every algebra is the coequalizer of its canonical pair of free algebras).

Proof

technique · direct
1.1

For a T-algebra (A,a), the pair F(TA)F(A) with arrows F(a) and εFA has under U the canonical pair T(a),μA:T2ATA. By [L2] and [L3] it is U-split.

L2L3
2.1

Let qA:F(A)H(A,a) be the created coequalizer supplied for (A,a). Its image is isomorphic to the canonical base coequalizer from step 1.1, and the universal property fixes the resulting comparisons.

step 1.1L3given
3.1

An algebra homomorphism r:(A,a)(B,b) carries the canonical pair for A to that for B. The two coequalizer universal properties therefore define a unique morphism H(r):H(A,a)H(B,b), and uniqueness proves preservation of identities and composition.

step 2.1construct
3.2

For dD, the counit fork F(TUd)F(Ud)εdd maps under U to the canonical split presentation of K(d). Creation reflects the lifted coequalizer, so comparison with qK(d) yields an isomorphism HK(d)d.

step 2.1L1L2
3.3

The underlying fork of K(qA) is a split coequalizer, transported from the canonical split fork along the isomorphism supplied by ordinary creation. Since K(qA) is a lift of that fork, [L4] makes it a coequalizer in CT. The map a:TAA is the other canonical algebra coequalizer by [L5], so their universal properties produce a unique isomorphism KH(A,a)(A,a).

step 2.1L1L2L4L5
4.1

The defining equations for the comparisons in steps 3.3 and 3.2 commute with every algebra homomorphism and every morphism of D. Uniqueness of maps out of the coequalizers therefore makes both families natural, proving the two displayed natural isomorphisms.

step 3.3step 3.2algebra

Depends on

Used by

Dependency tree · two levels

20 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