Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Over a cocomplete base, a monadic category is cocomplete exactly when it has coequalizers

Statement

Let U:AC be monadic and suppose C is cocomplete. Then A is cocomplete if and only if A has coequalizers.

Facts & Assumptions

Given: A monadic functor U:AC with cocomplete base C and induced monad T.

[L1]

A category is cocomplete when every small diagram in it has a colimit (Finite, small, and large limits and colimits; complete and cocomplete categories).

[L2]

Once the required coproducts and a coequalizer between them exist, every small colimit is constructed by the standard coproduct-coequalizer formula (Every small colimit can be constructed as a coequalizer between coproducts over the arrows and objects of the index category).

[L3]

An equivalence of categories preserves and reflects every existing colimit (Equivalences preserve, reflect, and create limits and colimits in the isomorphism-invariant sense).

[L4]

Every T-algebra (A,a) is the coequalizer in CT of the canonical pair T(a),μA:T2ATA (Every algebra is the coequalizer of its canonical pair of free algebras).

[L5]

The free T-algebra functor FT is left adjoint to the Eilenberg–Moore forgetful functor (The free–forgetful Eilenberg–Moore adjunction induces the given monad).

[L6]

Left adjoints preserve every colimit that exists (Left adjoints preserve every colimit that exists).

Proof

technique · direct
1.1

For the forward direction, if A is cocomplete then it has the colimit of every parallel pair, hence every coequalizer.

L1
1.2

For the reverse direction, replace A across its monadic comparison equivalence by CT. Given a small family (Ai,ai), [L5] and [L6] identify the coproducts of free algebras P:=iFT(TAi),Q:=iFT(Ai) with free algebras on the corresponding base coproducts. If ji and ki are their coproduct injections, define α,β:PQ by αji=kiT(ai),βji=kiμAi. By hypothesis this pair has a coequalizer q:QR in CT. The construction also applies to the empty family.

L5L6construct
2.1

For every i, the map qki coequalizes the canonical pair for (Ai,ai). Its universal property [L4] gives a unique algebra map ιi:(Ai,ai)R satisfying ιiai=qki.

step 1.2L4
3.1

Given algebra maps ri:(Ai,ai)(D,d), the maps riai:FT(Ai)(D,d) assemble to a map r:Q(D,d). Each coequalizes its canonical pair by [L4], so rα=rβ and there is a unique rˉ:R(D,d) with rˉq=r. Then rˉιi=ri because the two maps agree after the epimorphism ai, and uniqueness follows because the qki=ιiai are jointly epimorphic. Thus (R,(ιi)) is the coproduct of the family.

step 1.2step 2.1L4construct
4.1

For the reverse direction, CT now has all small coproducts by step 3.1 and all coequalizers by hypothesis, so [L2] constructs every small colimit.

step 3.1L2
5.1

For the reverse direction, transport these colimits back across the comparison equivalence by [L3]. Thus A is cocomplete.

step 4.1L3
6.1

Step 1.1 proves the forward implication, while steps 1.2 to 5.1 prove the reverse implication, establishing the biconditional.

step 1.1step 5.1

Depends on

Used by

Dependency tree · two levels

26 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