Alphabeta Math
Session-authored (Fable 5 assisted)
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.

42 results · all verified · 28 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 14 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Monads Comonads and Their Algebras

1 · Prerequisites

2 · Summary

An adjunction is controlled by its unit, counit, and triangle identities (Adjunction by unit, counit, and the triangle identities), and composing adjunctions gives the formulas used to compare their induced endofunctors (Adjunctions compose with the composite unit and counit formulas). A reflective full subcategory has an inclusion with a left adjoint (Reflective full subcategory and reflector), whose counit is invertible (The counit of a reflection is an isomorphism). These facts supply the adjunction and reflection data used to construct monads, comparison functors, and the idempotent case.

A monad and its formal dual, a comonad, lead to algebra and coalgebra categories together with Kleisli and Eilenberg–Moore resolutions. The comparison constructions give monadicity, limit creation, and the reflective description of idempotent algebras. Monad morphisms restrict algebra structures, while distributive laws build composite monads. On a preorder monads and comonads become monotone maps that are extensive or contractive, and on a poset those are exactly closure and interior operators; free algebra, power-set, and ultrafilter constructions then provide concrete instances before the dual co-Kleisli and co-Eilenberg–Moore theory.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Monad on a category

Definition

Let C be a category. A monad on C is a triple (T,η,μ) consisting of an endofunctor T:CC (Covariant functor, identity functor, composite functor, and contravariant functor) and natural transformations (Natural transformation and its components)

η:1CT,μ:T2T,

called the unit and multiplication, such that

μTμ=μμT:T3T,

μTη=1T=μηT:TT.

Here Tμ, μT, Tη, and ηT are whiskerings in the sense of Whiskering and horizontal composition of natural transformations. Componentwise, for every object A,

μAT(μA)=μAμTA,μAT(ηA)=1TA=μAηTA.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The monoid description of a monad requires an endofunctor category

When the endofunctors of C and their natural transformations form the functor category [C,C] (Functor category [C,D]), composition makes that category monoidal, and the data and equations of Monad on a category say exactly that (T,η,μ) is a monoid object in it. In particular this description is available for a small C; If C is small and D is locally small then [C,D] is locally small; if both are small it is small supplies the corresponding smallness and local-smallness conclusions.

For an arbitrary large C, the library's convention treats endofunctors and natural transformations only as metatheoretic shorthand and does not form them into a category. The monad definition itself remains meaningful there, but the phrase “monoid object in the endofunctor category” is used only when that category exists.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Comonad on a category

Definition

Let C be a category. A comonad on C is a triple (G,ε,δ) consisting of an endofunctor G:CC, a counit ε:G1C, and a comultiplication δ:GG2 such that

Gδδ=δGδ:GG3,

Gεδ=1G=εGδ:GG.

Equivalently, a comonad on C is a monad (Monad on a category) on the opposite category Cop (Opposite category Cop), with every arrow reversed.

TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Every adjunction induces a monad on the domain of its left adjoint

Statement

Let F:CD be left adjoint to G:DC, with unit η:1CGF and counit ε:FG1D. Then

T:=GF,η:1CT,μ:=GεF:T2T

define a monad on C (Monad on a category).

Facts & Assumptions

Given: An adjunction FG with unit η and counit ε as in Adjunction by unit, counit, and the triangle identities.

[L1]

The triangle identities are (εF)(Fη)=1F and (Gε)(ηG)=1G (Adjunction by unit, counit, and the triangle identities).

Proof

technique · direct
1.1

Put T=GF and μ=GεF. Whiskering preserves naturality, so T is an endofunctor and η:1CT and μ:T2T are natural transformations.

given
2.1

At an object A, the two associativity composites are μAT(μA)=G(εFAFG(εFA)) and μAμTA=G(εFAεFGFA); naturality of ε at εFA:FGFAFA identifies the expressions inside G, so μTμ=μμT.

givenstep 1.1L1
3.1

Componentwise, μAηTA=G(εFA)ηGFA=1GFA by the second triangle identity, while μAT(ηA)=G(εFAF(ηA))=1GFA by the first; hence both unit laws hold and (T,η,μ) is a monad.

step 1.1L1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Every adjunction induces a comonad on the codomain of its left adjoint

Statement

For an adjunction F:CD:G with unit η and counit ε, the data

H:=FG,ε:H1D,δ:=FηG:HH2

define a comonad on D (Comonad on a category).

Facts & Assumptions

Given: An adjunction FG with unit η and counit ε.

[L1]

The adjunction induces the monad (GF,η,GεF) on C (Every adjunction induces a monad on the domain of its left adjoint).

Proof

technique · direct
1.1

Apply [L1] to the opposite adjunction GopFop. Reversing arrows translates its endofunctor FopGop, unit, and multiplication into FG, ε, and FηG on D.

L1
2.1

The translated associativity equation is Hδδ=δHδ, and the translated unit equations are Hεδ=1H=εHδ; these are precisely coassociativity and the two counit laws, so the displayed data form a comonad.

step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Algebra and algebra homomorphism for a monad

Definition

Let (T,η,μ) be a monad on C (Monad on a category). A T-algebra is an object A together with a morphism a:TAA, called its structure map, satisfying

aηA=1A,aT(a)=aμA.

For T-algebras (A,a) and (B,b), a T-algebra homomorphism f:(A,a)(B,b) is a morphism f:AB in C such that

fa=bT(f).

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Algebra homomorphisms are closed under identities and composition

Statement

For a monad T, identity morphisms are T-algebra homomorphisms, and the composite of two T-algebra homomorphisms is a T-algebra homomorphism. These operations inherit associativity and identity laws from the base category.

Facts & Assumptions

Given: T-algebras and their homomorphisms as in Algebra and algebra homomorphism for a monad.

Proof

technique · direct
1.1

For an algebra (A,a), functoriality gives T(1A)=1TA, so 1Aa=a=aT(1A) and 1A is an algebra homomorphism.

given
2.1

If f:(A,a)(B,b) and g:(B,b)(C,c) are algebra homomorphisms, then (gf)a=gbT(f)=cT(g)T(f)=cT(gf), so their composite is one too.

givenstep 1.1
3.1

Composition of these morphisms is the composition in C; step 1.1 supplies its identities and step 2.1 its closure, while associativity and the identity laws are inherited from C.

step 1.1step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Eilenberg–Moore category of a monad

Definition

For a monad T on C, the Eilenberg–Moore category CT has the T-algebras as objects and the T-algebra homomorphisms as morphisms. Its identities and composition are those of C; Algebra homomorphisms are closed under identities and composition proves that these operations are closed and satisfy the category laws.

The Eilenberg–Moore forgetful functor UT:CTC sends (A,a) to A and acts as the identity on each underlying morphism.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Free algebra for a monad

Definition

For a monad (T,η,μ) and an object A, the free T-algebra on A is

(TA,μA).

It is a T-algebra: its associativity axiom is the componentwise monad associativity equation, and its unit axiom is μAηTA=1TA. For a morphism f:AB, naturality of μ makes T(f):(TA,μA)(TB,μB) an algebra homomorphism.

TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-17Open item page →

The free–forgetful Eilenberg–Moore adjunction induces the given monad

Statement

For a monad (T,η,μ) on C, the assignment A(TA,μA) defines a functor FT:CCT left adjoint to the forgetful functor UT:CTC. The monad induced by FTUT is (T,η,μ) on the nose.

Facts & Assumptions

Given: A monad (T,η,μ), its Eilenberg–Moore category and forgetful functor (Eilenberg–Moore category of a monad), and its free algebras (Free algebra for a monad).

Proof

technique · direct
1.1

Define FT(A)=(TA,μA) and FT(f)=T(f). Naturality of μ gives T(f)μA=μBT2(f), so T(f) is an algebra homomorphism; the functor laws follow from those of T.

given
2.1

At an algebra (A,a) define the counit component ϵ(A,a):=a:(TA,μA)(A,a); the algebra associativity law makes it an algebra homomorphism and the homomorphism equation makes these components natural. The equations aηA=1A and μAT(ηA)=1TA are the two triangle identities, so FTUT.

step 1.1given
3.1

The composite UTFT equals T, the adjunction unit is η, and UTϵFT has component ϵ(TA,μA)=μA; hence the induced multiplication is μ and the induced monad is the given one on the nose.

step 1.1step 2.1
TheoremStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Kleisli composition is associative and unital

Statement

Let (T,η,μ) be a monad on C. For morphisms f:ATB and g:BTC, define

gf:=μCT(g)f:ATC.

Then is associative, and ηA:ATA is a two-sided identity at A.

Facts & Assumptions

Given: A monad (T,η,μ) as in Monad on a category and composable arrows f:ATB, g:BTC, and h:CTD.

Proof

technique · direct
1.1

Expanding the definitions gives (hg)f=μDT(μD)T2(h)T(g)f, while h(gf)=μDT(h)μCT(g)f.

given
2.1

Naturality of μ at h rewrites T(h)μC as μTDT2(h), and the monad associativity equation μDT(μD)=μDμTD identifies the two expansions in step 1.1.

step 1.1given
3.1

Naturality of η and the two distinct unit laws give fηA=μBT(f)ηA=μBηTBf=f and ηBf=μBT(ηB)f=f, so the asserted identities hold.

given
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Kleisli category of a monad

Definition

For a monad (T,η,μ) on C, the Kleisli category CT has the same objects as C and hom-collections

CT(A,B):=C(A,TB).

The identity at A is ηA, and composition is gf=μCT(g)f. The category laws are established before this definition in Kleisli composition is associative and unital.

TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-17Open item page →

The Kleisli adjunction induces the given monad

Statement

For a monad (T,η,μ) on C, there is an adjunction

FT:CCT:UT

whose induced monad is (T,η,μ) on the nose.

Facts & Assumptions

Given: The Kleisli category CT of Kleisli category of a monad and the monad (T,η,μ) used to define it.

Proof

technique · direct
1.1

Define FTA=A and FT(f)=ηBf:ATB. Define UTA=TA, and for a Kleisli arrow g:ATB put UT(g)=μBT(g):TATB.

given
2.1

The Kleisli identity and associativity laws show that both assignments preserve identities and composition. Moreover CT(FTA,B)=C(A,TB)=C(A,UTB) naturally in A and B, so they form an adjunction.

step 1.1given
3.1

The unit is η. The counit at a Kleisli object B is represented by 1TB:TBTB, and applying UT gives μB; the Kleisli unit laws are the triangle identities. Thus UTFT=T and the induced unit and multiplication are η and μ.

step 1.1step 2.1
RemarkRemark: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The Kleisli and Eilenberg–Moore universal properties are schematic

The universal properties of the Kleisli and Eilenberg–Moore adjunctions quantify over each supplied adjunction inducing a fixed monad and assert the existence and uniqueness of particular comparison functors. They do not require a category whose objects are all such adjunctions.

This distinction matters under the library's size convention. The functor category [C,D] is formed only when C is small, and for a large source the notation is metatheoretic shorthand rather than a category (Functor category [C,D]); smallness and local smallness of [C,D] then need the further hypotheses of If C is small and D is locally small then [C,D] is locally small; if both are small it is small. No large category of every monad resolution is presumed here. The following factorisation results state the universal properties in the objectwise form that remains meaningful without such a category.

TheoremStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The Kleisli factorisation functor for an adjunction inducing a monad exists and is unique

Statement

Let F:CD:U be an adjunction with counit ε whose induced monad is a fixed monad T on C on the nose, and write FTUT for the Kleisli adjunction with counit εT. There is exactly one functor J:CTD satisfying

JFT=F,UJ=UT,J(εBT)=εFB for every object B,

namely

J(A)=F(A),J(f:ATB)=εFBF(f):FAFB.

These three equalities are what it means for J to be a morphism of adjunctions from the Kleisli adjunction to FU.

Facts & Assumptions

Given: An adjunction FU as in Adjunction by unit, counit, and the triangle identities, inducing T=UF with μ=UεF as in Every adjunction induces a monad on the domain of its left adjoint, and the Kleisli adjunction of The Kleisli adjunction induces the given monad.

Proof

technique · direct
1.1

A Kleisli arrow f:ATB=UFB has adjoint transpose εFBF(f):FAFB; define J by this formula and by J(A)=FA.

given
2.1

For an identity ηA, the first triangle identity gives J(ηA)=εFAF(ηA)=1FA. For f:ATB and g:BTC, substitution of μ=UεF, naturality of ε, and the triangle identities gives J(gf)=J(g)J(f), so J is a functor.

step 1.1given
3.1

The formulas give JFT=F and UJ=UT on objects and arrows, and J sends the Kleisli counit to ε. Conversely, those equalities force the image of f:AUFB to be its adjoint transpose, so they force the formula of step 1.1 on every arrow and prove uniqueness.

step 1.1step 2.1
TheoremStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The comparison functor to the Eilenberg–Moore category exists and is unique

Statement

Let F:CD:U be an adjunction with counit ε inducing a fixed monad T on C on the nose, and write FTUT for the Eilenberg–Moore adjunction with counit εT. There is exactly one functor K:DCT satisfying

UTK=U,KF=FT,K(εd)=εKdT for every object d,

namely the comparison functor

K(d)=(Ud,Uεd),K(h)=U(h).

These three equalities are what it means for K to be a morphism of adjunctions from FU to the Eilenberg–Moore adjunction.

Facts & Assumptions

Given: An adjunction FU with unit η and counit ε as in Adjunction by unit, counit, and the triangle identities, inducing T=UF and μ=UεF as in Every adjunction induces a monad on the domain of its left adjoint, together with the Eilenberg–Moore adjunction of The free–forgetful Eilenberg–Moore adjunction induces the given monad.

Proof

technique · direct
1.1

For dD set K(d)=(Ud,Uεd), and for h:dd set K(h)=Uh.

given
2.1

The triangle identity gives UεdηUd=1Ud. Naturality of ε at εd gives the algebra associativity equation for Uεd, and naturality at h gives UhUεd=UεdT(Uh); hence the objects and arrows in step 1.1 are algebras and algebra homomorphisms.

step 1.1given
3.1

Directly UTK=U, and KFA=(UFA,UεFA)=(TA,μA)=FTA; the Eilenberg–Moore counit at K(d) is Uεd, so the counit data also agree. These strict equalities force the underlying arrow action and every structure map, proving uniqueness.

step 1.1step 2.1
CorollaryStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Kleisli and Eilenberg–Moore adjunctions have the extremal universal properties

Statement

Fix a monad T on C. Among supplied adjunctions inducing T on the nose, the Kleisli adjunction has the schematic initial universal property and the Eilenberg–Moore adjunction has the schematic terminal universal property: every such adjunction admits a unique morphism of adjunctions from the Kleisli resolution and a unique morphism of adjunctions to the Eilenberg–Moore resolution.

Facts & Assumptions

Given: A fixed monad T and an arbitrary supplied adjunction inducing it.

[L1]

For an adjunction FU with counit ε inducing T on the nose there is exactly one functor J:CTD with JFT=F, UJ=UT and J(εBT)=εFB for every B (The Kleisli factorisation functor for an adjunction inducing a monad exists and is unique).

[L2]

For the same adjunction there is exactly one functor K:DCT with UTK=U, KF=FT and K(εd)=εKdT for every d (The comparison functor to the Eilenberg–Moore category exists and is unique).

Proof

technique · direct
1.1

Apply [L1] to the supplied adjunction; its unique factorisation is the required morphism from the Kleisli resolution.

L1
1.2

Apply [L2] to the same adjunction; its unique comparison is the required morphism to the Eilenberg–Moore resolution.

L2
2.1

Steps 1.1 and 1.2 give the two asserted existence-and-uniqueness properties for each supplied adjunction. This objectwise assertion does not form a category of all resolutions.

step 1.1step 1.2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-17Open item page →

Composing with an adjunction that induces the identity monad on the nose does not change the induced monad

Statement

Let F:CD:G and F:DE:G be adjunctions. Suppose the monad induced by FG is the identity monad on D on the nose: GF=1D, η=1, and GεF=1. Then the monad induced on C by the composite adjunction FFGG is the monad induced by FG on the nose.

Facts & Assumptions

Given: The two adjunctions and the displayed strict identity-monad hypotheses.

[L1]

The composite adjunction has unit ηˉ=(GηF)η and counit εˉ=ε(FεG) (Adjunctions compose with the composite unit and counit formulas).

Proof

technique · direct
1.1

The composite induced endofunctor is GGFF=GF, and [L1] with η=1 gives ηˉ=η.

L1
2.1

Its multiplication is GGεˉFF. Expanding εˉ by [L1], then using GF=1D and GεF=1, reduces this transformation to GεF.

step 1.1L1
3.1

The endofunctor, unit, and multiplication obtained in steps 1.1 and 2.1 are exactly GF, η, and GεF, so the two induced monads agree on the nose.

step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The comparison from the Kleisli category is fully faithful with image the free algebras

Statement

For a monad T on C, the canonical comparison functor

M:CTCT

sends A to the free algebra (TA,μA) and is fully faithful. Its strict image is exactly the full subcategory of free T-algebras.

Facts & Assumptions

Proof

technique · direct
1.1

The comparison sends A to (TA,μA) and a Kleisli arrow f:ATB to the algebra homomorphism μBT(f):TATB.

given
2.1

For every A,B, the map fμBT(f) is a bijection from C(A,TB)=CT(A,B) to the algebra homomorphisms (TA,μA)(TB,μB); its inverse sends h to hηA. The monad unit laws show the two composites are identities, using the algebra-homomorphism equation for h in one direction.

step 1.1given
3.1

Thus every induced hom-set map is bijective, so M is fully faithful (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors); step 1.1 also shows that its objects are precisely the free algebras, giving the claimed strict image.

step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Monadic and strictly monadic functors

Definition

Let U:DC have a left adjoint F, let T=UF be the induced monad, and let K:DCT be the comparison functor of The comparison functor to the Eilenberg–Moore category exists and is unique. The functor U is monadic when K is an equivalence of categories (Equivalence, quasi-inverse, and adjoint equivalence of categories).

It is strictly monadic when K is an isomorphism of categories, so its object and morphism correspondences, inverse, and equations hold on the nose. Strict monadicity implies monadicity; the converse is not part of the definition.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Conservative functor

Definition

A functor U:DC is conservative if it reflects isomorphisms: whenever f is a morphism of D and U(f) is an isomorphism in C (Isomorphism, groupoid, and connected category), the morphism f is an isomorphism in D.

TheoremStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The Eilenberg–Moore forgetful functor strictly creates every limit that exists in the base

Statement

For every monad T on C, the forgetful functor UT:CTC strictly creates every limit that exists in C. No preservation hypothesis on T is required.

Facts & Assumptions

Given: A diagram D:JCT with algebra structures aj:TUTDjUTDj, and a limiting cone pj:LUTDj in C.

[L1]

Strict creation requires a unique lifted limiting cone with exactly the supplied apex and legs (Preservation, reflection, and creation of limits and colimits; continuous and cocontinuous functors).

Proof

technique · direct
1.1

The maps ajT(pj):TLUTDj form a cone because every arrow of D is an algebra homomorphism. By [L2] there is a unique :TLL with pj=ajT(pj) for every j.

L1L2
2.1

After composition with every pj, the equations ηL=1L and T()=μL become the corresponding algebra laws for aj by naturality; the limit legs are jointly monic by uniqueness in [L2], so both equations hold and (L,) is a T-algebra.

step 1.1L2
3.1

If a cone from an algebra (X,x) has underlying mediating arrow u:XL, then composing ux and T(u) with every pj gives the same map because each cone leg is an algebra homomorphism; joint monicity makes u an algebra homomorphism. Its uniqueness and the uniqueness of follow from the base limit, giving exactly the strict lift required by [L1], including when J is empty.

step 1.1step 2.1L1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17 rests on unproved material (inherited)Open item page →
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.

Every category monadic over Set is complete

Statement

If U:DSet is monadic, then D has every small limit.

Facts & Assumptions

Given: A monadic functor U:DSet in the sense of Monadic and strictly monadic functors.

[L2]

An Eilenberg–Moore forgetful functor strictly creates every base limit (The Eilenberg–Moore forgetful functor strictly creates every limit that exists in the base).

[L3]

Equivalences preserve, reflect, and create all existing limits in the ordinary isomorphism-invariant sense (Equivalences preserve, reflect, and create limits and colimits in the isomorphism-invariant sense).

Proof

technique · direct
1.1

For any small diagram in the Eilenberg–Moore category of the induced monad on Set, [L1] supplies its underlying limit and [L2] lifts that limit; hence this Eilenberg–Moore category is complete.

L1L2
2.1

Monadicity says that the comparison K:DSetT is an equivalence. By [L3], each small limit from step 1.1 transports across K, so D is complete.

step 1.1L3
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The Eilenberg–Moore forgetful functor creates every colimit in the base that the monad and its square preserve

Statement

Let D:JCT be a diagram of algebras whose underlying diagram has a colimit (Q,ij) in C. If both T and T2 preserve this colimit, then there is a unique algebra structure on Q making every ij an algebra homomorphism, and the resulting cocone is a colimit in CT. Thus UT creates every such colimit.

Facts & Assumptions

Given: The diagram, its structure maps aj, the base colimit (Q,ij), and preservation of that colimit by T and T2.

Proof

technique · direct
1.1

Since T preserves the colimit, the maps ijaj:TUTDjQ induce a unique a:TQQ satisfying aT(ij)=ijaj for every j.

givenL1
2.1

Precomposition with every ij proves aηQ=1Q. Precomposition with every T2(ij) proves aT(a)=aμQ; these families are jointly epic because T and T2 preserve the colimit, so (Q,a) is an algebra and every ij is an algebra homomorphism.

step 1.1given
3.1

Any algebra cocone has a unique underlying mediating arrow u:QX; precomposition with every T(ij) shows ua=xT(u), so u is automatically an algebra homomorphism. This proves the lifted universal property and the conditional creation claim.

step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-17Open item page →

Every monadic functor is conservative

Statement

Every monadic functor reflects isomorphisms; equivalently, every monadic functor is conservative (Conservative functor).

Facts & Assumptions

Given: A monad T, its algebra homomorphisms (Algebra and algebra homomorphism for a monad), a monadic functor with comparison equivalence as in Monadic and strictly monadic functors, and the fact that fully faithful functors reflect isomorphisms (Every fully faithful functor reflects isomorphisms).

Proof

technique · direct
1.1

Let f:(A,a)(B,b) be an algebra homomorphism whose underlying morphism has inverse g. From fa=bT(f), the inverse equations, and functoriality, one obtains gb=aT(g) by composing with f and cancelling it; hence g is an algebra homomorphism.

given
2.1

Therefore the Eilenberg–Moore forgetful functor reflects isomorphisms: an underlying inverse is automatically an inverse inside the algebra category by step 1.1.

step 1.1
3.1

For a monadic U, its comparison K is an equivalence and hence fully faithful. If U(f)=UTK(f) is an isomorphism, step 2.1 makes K(f) an isomorphism, and full faithfulness reflects that isomorphism back to f; thus U is conservative.

step 2.1given
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Idempotent monad

Definition

A monad (T,η,μ) is idempotent when its multiplication μ:T2T is a natural isomorphism.

TheoremStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

For a monad, invertibility of multiplication, monicity of every multiplication component, and equality of the two whiskered units are equivalent

Statement

For a monad (T,η,μ), the following are equivalent:

  1. μ is a natural isomorphism, so the monad is idempotent (Idempotent monad);
  2. every component μA:T2ATA is monic;
  3. ηT=Tη:TT2.

Facts & Assumptions

Given: A monad (T,η,μ).

[L1]

A monomorphism is left-cancellable: mg=mh implies g=h (Monomorphism and epimorphism by left and right cancellation).

Proof

technique · direct
1.1

If μ is a natural isomorphism, each μA is an isomorphism and therefore monic, proving 12.

given
1.2

If every μA is monic, the monad unit laws give μAηTA=1TA=μAT(ηA); cancellation by [L1] yields ηTA=T(ηA) for every A, proving 23.

L1given
2.1

Assume ηT=Tη. The unit law makes ηTA a right inverse to μA. Naturality of η at μA, followed by ηT2A=T(ηTA), gives ηTAμA=T(μA)T(ηTA)=1T2A; thus ηTA is also a left inverse, every μA is invertible, and 31.

given
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-17Open item page →

Algebras for an idempotent monad form a reflective subcategory

Statement

Let (T,η,μ) be an idempotent monad on C. An object A admits a T-algebra structure if and only if ηA:ATA is an isomorphism, and then the structure is uniquely ηA1. The forgetful functor identifies CT with the full reflective subcategory of such objects, with reflector T.

Facts & Assumptions

Given: An idempotent monad (Idempotent monad), its algebras (Algebra and algebra homomorphism for a monad), and its Eilenberg–Moore category (Eilenberg–Moore category of a monad).

Proof

technique · direct
1.1

If a:TAA is an algebra structure, then aηA=1A. Naturality of η at a and idempotence, which gives ηTA=T(ηA), imply ηAa=T(a)ηTA=T(aηA)=1TA; hence a=ηA1.

given
2.1

Conversely, if ηA is invertible, put a=ηA1. The unit axiom is immediate, and naturality of η together with the monad unit laws gives aT(a)=aμA; step 1.1 shows this structure is unique.

givenstep 1.1
3.1

Naturality of η shows every base morphism between two such fixed objects commutes with their inverse-unit algebra structures, so the subcategory is full. The unit ηA:ATA is universal from A to this subcategory, since TA is fixed and every map to a fixed object extends uniquely through ηA; hence T is its reflector in the sense of Reflective full subcategory and reflector.

step 1.1step 2.1
CorollaryStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The Kleisli and Eilenberg–Moore categories of an idempotent monad are equivalent

Statement

For an idempotent monad T, the canonical comparison M:CTCT is an equivalence of categories.

Facts & Assumptions

[L1]

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

Proof

technique · direct
1.1

The canonical comparison is fully faithful, and its strict image consists of the free algebras.

given
1.2

For each algebra (A,a), the idempotent-algebra theorem gives a=ηA1. The map ηA:(A,a)(TA,μA) is therefore a specified algebra isomorphism from (A,a) to the free algebra on A, with inverse a.

given
2.1

The specified isomorphisms of step 1.2 make the fully faithful comparison of step 1.1 split essentially surjective; [L1] therefore makes it an equivalence.

step 1.1step 1.2L1
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-17Open item page →

The inclusion of a reflective full subcategory is monadic

Statement

If A is a reflective full subcategory of C, then its inclusion I:AC is monadic.

Facts & Assumptions

Given: A reflection RI as in Reflective full subcategory and reflector.

[L1]

A reflection is an adjunction R:CA:I with I the full inclusion (Reflective full subcategory and reflector).

[L2]

Algebras for an idempotent monad are exactly the objects whose unit is invertible, with the unique inverse-unit structure (Algebras for an idempotent monad form a reflective subcategory).

[L3]

An adjunction induces the monad formed from its right adjoint after its left adjoint (Every adjunction induces a monad on the domain of its left adjoint).

[L4]

Every component of the counit of a reflection is an isomorphism (The counit of a reflection is an isomorphism).

Proof

technique · direct
1.1

By [L1] and [L3], the reflection induces the monad T=IR on C with multiplication IεR. By [L4] this multiplication is a natural isomorphism, so T is idempotent (Idempotent monad).

L1L3L4
2.1

By [L2], the Eilenberg–Moore category of T is the full subcategory of objects C for which the reflection unit CIRC is invertible. The comparison sends AA to (IA,IεA), and its essential image is exactly this fixed-object subcategory.

step 1.1L2
3.1

Fullness of I makes the comparison fully faithful, and every algebra (C,ηC1) has the specified isomorphism ηC:CIRC to the comparison image of RC. Thus the comparison is an equivalence, so I is monadic by Monadic and strictly monadic functors.

step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Morphisms between monads on one category

Definition

Let (T,ηT,μT) and (S,ηS,μS) be monads on the same category C. A monad morphism α:TS is a natural transformation satisfying

αηT=ηS

and

αμT=μSSααT.

At an object A, the multiplication equation is

αAμAT=μASS(αA)αTA.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Whenever the endofunctor category exists, monads on a fixed category and their morphisms form a category

Statement

Let C be a category for which the functor category [C,C] exists. Monads on C as objects and monad morphisms as arrows form a category.

Facts & Assumptions

Given: Monads (T,ηT,μT), (S,ηS,μS), and (R,ηR,μR) on C.

[L1]

A monad morphism is a natural transformation preserving the unit and multiplication (Morphisms between monads on one category).

[L2]

When [C,C] exists, natural transformations between endofunctors are arrows of a category and compose vertically (Functor category [C,D]).

Proof

technique · direct
1.1

The identity 1T:TT satisfies 1TηT=ηT and 1TμT=μTT1T(1T)T, so it is a monad morphism.

L1
2.1

If α:TS and β:SR are monad morphisms, then (βα)ηT=βηS=ηR, so their vertical composite preserves the unit.

L1step 1.1
3.1

Naturality of β gives βSSα=RαβT; substituting the multiplication equations for α and β yields (βα)μT=μRR(βα)(βα)T, so the composite preserves multiplication.

L1L2step 2.1
4.1

By [L2], vertical composition is associative and the transformations in step 1.1 are identities. Steps 2.1 and 3.1 give closure under composition under the stated endofunctor-category size condition. Hence these objects and arrows form a category.

L2step 1.1step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

A monad morphism induces restriction of algebras and a natural comparison of free algebras

Statement

A monad morphism α:TS on C induces a functor α:CSCT over C, defined by restriction of algebra structure. Its components also define a natural transformation from the free T-algebra functor to the free S-algebra functor followed by α.

Facts & Assumptions

Given: A monad morphism α:(T,ηT,μT)(S,ηS,μS) on C.

[L1]

The equations for α are αηT=ηS and αμT=μSSααT (Morphisms between monads on one category).

[L2]

An S-algebra (A,a) satisfies aηAS=1A and aμAS=aS(a), and its homomorphisms satisfy fa=bS(f) (Algebra and algebra homomorphism for a monad).

[L3]

The free T-algebra on A is (TA,μAT) (Free algebra for a monad).

Proof

technique · direct
1.1

For an S-algebra (A,a), put aT=aαA:TAA. By [L1]–[L2], aTηAT=aηAS=1A, while naturality of α and the two multiplication equations give aTμAT=aTT(aT). Thus (A,aT) is a T-algebra.

L1L2
2.1

If f:(A,a)(B,b) is an S-algebra homomorphism, then faαA=bS(f)αA=bαBT(f) by naturality of α. Hence the unchanged underlying arrow is a T-algebra homomorphism, and unchanged identities and composites define a functor α over C.

L1L2step 1.1
3.1

For every A, the multiplication equation in [L1] says precisely that αA:(TA,μAT)(SA,μASαSA) is a T-algebra homomorphism. Naturality of α makes these maps natural in A, giving the claimed comparison of free algebras.

L1L3step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Distributive law between two monads

Definition

Let (S,ηS,μS) and (T,ηT,μT) be monads on a category C. A distributive law of S over T is a natural transformation λ:STTS satisfying

ληST=TηS,λSηT=ηTS,

and

λμST=TμSλSSλ,

λSμT=μTSTλλT.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

A distributive law makes the composite endofunctor a monad

Statement

If λ:STTS is a distributive law of the monad S over the monad T, then TS is a monad. Its unit is ηTSηS and its multiplication is

TSTSTλSTTSSμTSSTSSTμSTS.

Facts & Assumptions

Given: Monads S,T on C and a distributive law λ:STTS.

[L1]

A distributive law of S over T is a natural transformation λ:STTS satisfying ληST=TηS and λSηT=ηTS, together with λμST=TμSλSSλ and λSμT=μTSTλλT (Distributive law between two monads).

[L2]

A monad consists of an endofunctor with a unit and multiplication satisfying the unit and associativity equations (Monad on a category).

[L3]

An S-algebra map a:SAA satisfies aηAS=1A and aS(a)=aμAS, and an algebra homomorphism f:(A,a)(B,b) satisfies fa=bS(f) (Algebra and algebra homomorphism for a monad).

[L4]

The Eilenberg--Moore forgetful functor is the identity on underlying morphisms, hence is faithful (Eilenberg–Moore category of a monad).

[L5]

The Eilenberg--Moore adjunction of any monad induces that monad on the nose (The free–forgetful Eilenberg–Moore adjunction induces the given monad).

[L6]

If FG has unit η and counit ε and FG has unit η and counit ε, then FFGG with unit ηˉ=(GηF)η and counit εˉ=ε(FεG) (Adjunctions compose with the composite unit and counit formulas).

[L7]

For an adjunction FG with unit η and counit ε, the data T:=GF, η:1T and μ:=GεF:T2T define a monad on the domain of F (Every adjunction induces a monad on the domain of its left adjoint).

Proof

technique · lift $T$ to $S$-algebras and compose Eilenberg--Moore adjunctions
1.1

For an S-algebra (A,a) define the following lifted object and arrow assignment.

L1L3

T~(A,a)=(TA,bA),bA:=T(a)λA:STATA,

Put T~(f)=T(f) on an S-algebra homomorphism f.

2.1

The first distributive unit law gives the first identity below, and the first distributive multiplication law, naturality of λ, and the S-algebra laws give the second.

L1L2L3step 1.1

bAηTAS=T(a)T(ηAS)=1TA,

and

bAμTAS=T(a)T(μAS)λSAS(λA)=T(aS(a))λSAS(λA)=T(a)λAS(T(a))S(λA)=bAS(bA).

Thus (TA,bA) is an S-algebra. If f:(A,a)(B,b) is an S-algebra homomorphism, then naturality of λ gives

T(f)bA=T(b)TS(f)λA=T(b)λBS(T(f))=bBS(T(f)),

so the assignment in step 1.1 is an endofunctor T~:CSCS.

3.1

The second distributive unit law and naturality of ηT give the following identity.

L1L3step 2.1

bAS(ηAT)=T(a)λAS(ηAT)=T(a)ηSAT=ηATa,

Thus each ηAT:(A,a)T~(A,a) is an S-algebra homomorphism.

3.2

The second distributive multiplication law and naturality of μT give the following identity.

L1L3step 2.1

bAS(μAT)=T(a)μSATT(λA)λTA=μATT(T(a))T(λA)λTA=μATT(bA)λTA.

Hence each μAT:T~2(A,a)T~(A,a) is also an S-algebra homomorphism.

4.1

The underlying components of these two natural transformations are ηT and μT. Their monad equations hold in C by [L2], and [L4] reflects those equalities. Therefore (T~,ηT,μT) is a monad on CS.

L2L4step 3.1step 3.2
5.1

Take the Eilenberg--Moore adjunction FSUS and the Eilenberg--Moore adjunction FT~UT~. By [L5] they induce S and T~, respectively, and by [L6] they compose to the following adjunction.

L5L6step 4.1

FT~FSUSUT~.

6.1

The induced endofunctor is TS. The composite-unit formula in [L6] gives ηTSηS. Expanding the two Eilenberg--Moore counits in the composite-counit formula gives the following multiplication.

L5L6step 1.1step 5.1

TSTSTλSTTSSTTμSTTSμTSTS.

Naturality of μT at μS identifies its last two arrows with

TTSSμTSSTSSTμSTS,

This is the multiplication in the Statement.

7.1

By [L7], the endofunctor, unit, and multiplication computed in step 6.1 satisfy both unit laws and associativity, so they define the asserted monad on TS.

L7step 6.1
TheoremStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

On a preorder the monads are exactly the monotone extensive maps with T(Tp) below Tp; on a poset they are exactly the closure operators

Statement

Let P be a preorder, regarded as a category. A monad on P is equivalently a monotone map T:PP such that pTp and T(Tp)Tp for every p. These inequalities force Tp and T(Tp) to be mutually comparable. If P is a poset, this is equivalently a closure operator: a monotone, extensive, idempotent map.

Facts & Assumptions

Given: A preorder P, regarded as a category.

[L1]

A preorder determines a category with at most one morphism between any two objects, and functors between such categories are exactly monotone maps (A preorder is a category with at most one morphism between any two objects, and its functors are exactly monotone maps).

[L2]

A monad has natural transformations η:1T and μ:T2T satisfying the monad equations (Monad on a category).

[L3]

A partial order is a preorder satisfying antisymmetry (Partial order and partially ordered set).

Proof

technique · direct
1.1

By [L1] the endofunctor is a monotone map, and a morphism FpGp in a preorder-category exists exactly when FpGp and is then the only one, so a natural transformation FG is precisely the family of inequalities FpGp. Hence by [L2] η is exactly the family pTp, and μ is exactly T(Tp)Tp. Applying monotonicity to pTp also gives TpT(Tp).

L1L2
1.2

Conversely, a monotone T with pTp and T(Tp)Tp supplies the unique transformations η:1T and μ:T2T by [L1]. Every monad diagram commutes because a preorder has at most one arrow between any fixed source and target.

L1L2
2.1

If P is a poset, step 1.1 and antisymmetry give T(Tp)=Tp; conversely an ordinary closure operator is monotone and extensive and its idempotence supplies T(Tp)Tp, so step 1.2 makes it a monad.

L3step 1.1step 1.2
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Algebras for a preorder monad are exactly its fixed objects up to preorder equivalence; on a poset they are its fixed points

Statement

For a monad T on a preorder P, a T-algebra structure exists on p exactly when p and Tp are mutually comparable. On a poset this says exactly that Tp=p.

Facts & Assumptions

Given: A monad T on a preorder P.

[L1]

A T-algebra on p includes an arrow Tpp (Algebra and algebra homomorphism for a monad).

[L2]

The monad unit supplies pTp, and every required diagram between fixed objects of a preorder commutes automatically (On a preorder the monads are exactly the monotone extensive maps with T(Tp) below Tp; on a poset they are exactly the closure operators).

[L3]

Antisymmetry turns mutual comparability into equality (Partial order and partially ordered set).

Proof

technique · direct
1.1

If p carries a T-algebra, [L1] gives Tpp, while [L2] gives pTp; hence the two objects are mutually comparable.

L1L2
2.1

Conversely, if Tpp, the corresponding unique arrow is an algebra structure: its unit and associativity diagrams commute because parallel arrows in a preorder are equal.

L1L2step 1.1
3.1

When P is a poset, [L3] changes mutual comparability into Tp=p, and equality plainly gives the comparison required in step 2.1.

L3step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-17Open item page →

On a preorder the comonads are exactly the monotone contractive maps with Gp below G(Gp); on a poset they are exactly the interior operators

Statement

Let P be a preorder. A comonad on P is equivalently a monotone map G:PP such that Gpp and GpG(Gp) for every p. These inequalities force Gp and G(Gp) to be mutually comparable. If P is a poset, this is equivalently an interior operator: a monotone, contractive, idempotent map.

Facts & Assumptions

Given: A preorder P.

[L1]

A comonad on P is a monad on Pop (Comonad on a category).

[L2]

Monads on a preorder are exactly its monotone extensive maps equipped with the reverse comparison from their square (On a preorder the monads are exactly the monotone extensive maps with T(Tp) below Tp; on a poset they are exactly the closure operators).

[L3]

Reversing a preorder reverses each inequality (Opposite category Cop).

[L4]

In a poset, mutual comparability implies equality (Partial order and partially ordered set).

Proof

technique · direct
1.1

By [L1], regard G as a monad on Pop, with its counit and comultiplication serving as the unit and multiplication there.

L1L3
2.1

Applying [L2] in the opposite order gives monotonicity, Gpp, and GpG(Gp). Monotonicity applied to Gpp gives G(Gp)Gp, so the two values are mutually comparable.

L2L3step 1.1
3.1

Conversely, the stated inequalities reverse to the data in [L2] on Pop, hence give a comonad by [L1]. If P is a poset, [L4] makes the two comparisons equivalent to G(Gp)=Gp, precisely the idempotence condition for an interior operator.

L1L2L3L4step 2.1
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passaudited 2026-08-17Open item page →

The free-monoid monad has monoids as its Eilenberg–Moore algebras

Statement

The monad on Set induced by the free-monoid adjunction sends a set X to the set X of finite words, inserts letters as one-letter words, and flattens words of words by concatenation. Its Eilenberg–Moore category is isomorphic over Set to the category of monoids.

Facts & Assumptions

Given: The free-monoid adjunction between sets and monoids.

[L1]

The free-monoid functor sends X to the monoid of finite words X and is left adjoint to the underlying-set functor (The free-monoid functor is left adjoint to the underlying-set functor).

[L2]

Every adjunction induces a monad, whose unit is the adjunction unit and whose multiplication uses the counit (Every adjunction induces a monad on the domain of its left adjoint).

[L3]

A monoid has an associative binary operation and a two-sided identity (Semigroup and monoid).

Proof

technique · direct
1.1

By [L1]–[L2], the induced endofunctor is XX, its unit sends a letter to its one-letter word, and its multiplication concatenates a finite word of finite words. A monoid M therefore gives an algebra MM by evaluating each word.

L1L2
2.1

Conversely, for an algebra a:XX, define e=a([]) and xy=a([x,y]). The algebra unit law evaluates one-letter words to their letters, and the multiplication law says evaluation is unchanged by first evaluating subwords; applied to empty, two-letter, and three-letter decompositions, it gives the two unit laws and associativity.

L3step 1.1
3.1

An algebra homomorphism commutes with evaluation, hence preserves the empty word and two-letter words and is a monoid homomorphism. Conversely a monoid homomorphism preserves every finite word evaluation, so it is an algebra homomorphism. These identifications are inverse and unchanged on underlying sets.

L3step 1.1step 2.1
TheoremStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The free-group monad has groups as its Eilenberg–Moore algebras

Statement

The monad on Set induced by the free-group adjunction sends a set to the underlying set of its free group. Its Eilenberg–Moore category is isomorphic over Set to the category of groups.

Facts & Assumptions

Given: The free-group adjunction between sets and groups.

[L1]

The free-group functor is left adjoint to the underlying-set functor (The free-group functor is left adjoint to the underlying-set functor).

[L2]

Every adjunction induces a monad on the domain of its left adjoint (Every adjunction induces a monad on the domain of its left adjoint).

[L3]

A group has associative multiplication, an identity, and inverses (Group and abelian group).

Proof

technique · direct
1.1

By [L1]–[L2], the monad sends X to the underlying set of the free group F(X), its unit inserts generators, and its multiplication evaluates a reduced word whose letters are themselves reduced words. Every group H gives an algebra F(UH)UH by word evaluation.

L1L2
2.1

Conversely, from an algebra a:UF(X)X, define the product, identity, and inverse by evaluating the free-group words xy, 1, and x1. The algebra unit law fixes generators, while the multiplication law identifies evaluation after substitution with direct evaluation; applying it to the standard group-word identities gives all axioms in [L3].

L3step 1.1
3.1

An algebra homomorphism commutes with word evaluation and therefore preserves product, identity, and inverse. Conversely a group homomorphism preserves every group word and hence is an algebra homomorphism. The two constructions are inverse over Set.

L3step 1.1step 2.1
TheoremStatement: AI-adaptedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

For a unital ring R, the free-R-module monad on sets has left R-modules as its Eilenberg–Moore algebras

Statement

Fix a unital ring R. The monad on Set induced by the free-left-R-module adjunction sends a set X to the underlying set of its free module R(X). Its Eilenberg–Moore category is isomorphic over Set to the category of left R-modules.

Facts & Assumptions

Given: A unital ring R and the free-left-R-module adjunction.

[L1]

The free-module functor XR(X) is left adjoint to the underlying-set functor (The free-module functor is left adjoint to the underlying-set functor).

[L2]

Every adjunction induces a monad on the domain of its left adjoint (Every adjunction induces a monad on the domain of its left adjoint).

[L3]

A left R-module is an abelian group with a compatible unital left R-action (Unital left and right modules over a ring; unqualified module means left module).

Proof

technique · direct
1.1

By [L1]–[L2], the monad sends X to finite formal sums xrx[x], its unit sends x to 1[x], and multiplication evaluates a finite formal sum of finite formal sums. Every left R-module gives an algebra by evaluating such sums.

L1L2
2.1

Conversely, for an algebra a:R(X)X, define 0=a(0), x+y=a(1[x]+1[y]), and rx=a(r[x]). The algebra unit and multiplication laws say that substituting finite formal sums before evaluation has the same result as flattening them first; the module axioms in [L3] follow by applying this equality to the corresponding formal sums.

L3step 1.1
3.1

An algebra homomorphism commutes with evaluation, hence preserves 0, addition, and scalar multiplication. Conversely an R-linear map preserves every finite formal sum and is therefore an algebra homomorphism. These identifications are inverse over Set.

L3step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-17Open item page →

Singleton and union define the covariant power-set monad

Statement

The covariant power-set functor P:SetSet carries a monad whose unit is ηX(x)={x} and whose multiplication μX:PPXPX is union.

Facts & Assumptions

Given: A set X and functions between sets.

[L1]

The power set P(X) is the set of all subsets of X (The power set P(x)={z:zx}).

[L2]

Direct image sends a subset AX along f:XY to f[A]Y (The image R[A] and the preimage R1[B] of a set under a relation).

[L3]

A monad requires natural unit and multiplication satisfying two unit laws and associativity (Monad on a category).

Proof

technique · direct
1.1

Define P(f)(A)=f[A]. Direct images preserve identities and composition, so this is an endofunctor; define ηX(x)={x} and μX(A)=A.

L1L2L3
2.1

For f:XY, one has f[A]=AAf[A], so union is natural. Also f[{x}]={f(x)}, which proves naturality of the singleton unit directly.

L2step 1.1
3.1

The two unit laws are {A}=A and xA{x}=A. Associativity is the equality obtained by removing either pair of parentheses from a union of families of families. These identities also hold when X=, so [L3] gives the claimed monad.

L3step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17 rests on unproved material (inherited)Open item page →
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.

Algebras for the covariant power-set monad are posets with all small suprema and their morphisms preserve every small supremum

Statement

The Eilenberg–Moore category of the covariant power-set monad is isomorphic to the category of posets admitting every small supremum and maps preserving every small supremum.

Facts & Assumptions

Given: The covariant power-set monad with singleton unit and union multiplication.

[L1]

The covariant power-set monad has singleton unit and union multiplication (Singleton and union define the covariant power-set monad), while an algebra map a:TXX satisfies aηX=1X and aT(a)=aμX, and a homomorphism f satisfies fa=bT(f) (Algebra and algebra homomorphism for a monad).

[L2]

A poset has all small suprema exactly when every set of its elements has a least upper bound (A poset category is complete exactly when every small family has an infimum, and cocomplete exactly when every small family has a supremum).

[L3]

Antisymmetry is the condition that xy and yx imply x=y (Partial order and partially ordered set).

Proof

technique · direct
1.1

Given an algebra a, define xy when a({x,y})=y. The singleton law gives reflexivity; symmetry of the set {x,y} gives antisymmetry; and the flattening law makes the induced binary join associative, from which transitivity follows. Thus this is a partial order.

L1L3
2.1

For every AX, put supA=a(A). Applying the flattening law to families formed from A, its singleton subsets, and an arbitrary common upper bound proves respectively that every member of A lies below a(A) and that a(A) lies below every upper bound; this includes A=. The algebra-homomorphism equation fa=bP(f) says exactly that f(supA)=supf[A].

L1L2step 1.1
3.1

Conversely, on a poset with all small suprema define a(A)=supA. Singleton suprema give the unit law, and sup(A)=sup{supA:AA} gives the multiplication law. A map satisfies the algebra-homomorphism equation exactly when it preserves these suprema.

L1L2step 2.1
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-17Open item page →

Pushforward sends ultrafilters to ultrafilters and is functorial

Statement

For a function f:XY and an ultrafilter U on X, define

fU={BY:f1[B]U}.

Then fU is an ultrafilter on Y. Moreover, (1X)=1βX and (gf)=gf, where βX denotes the set of ultrafilters on X.

Facts & Assumptions

Given: A function f:XY and an ultrafilter U on X.

[L1]

An ultrafilter is a proper filter maximal among proper filters (Ultrafilter).

[L2]

A proper filter is an ultrafilter exactly when, for every subset A, it contains either A or its complement (Characterisation of ultrafilters: every set or its complement).

Proof

technique · direct
1.1

Inverse image preserves the whole set, inclusions, and finite intersections and sends the empty set to the empty set. Consequently the displayed family contains Y, excludes , is upward closed, and is closed under finite intersections, so it is a proper filter.

L1
2.1

For BY, [L2] applied to f1[B] says that either f1[B]U or Xf1[B]=f1[YB]U. Thus fU decides every subset of Y and is an ultrafilter by [L2].

L2step 1.1
3.1

The equalities (1X)1[A]=A and (gf)1[C]=f1[g1[C]] show membership-by-membership that (1X)U=U and (gf)U=g(fU).

step 2.1
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-17Open item page →

The principal-ultrafilter and ultrafilter-flattening formulas are well-defined and natural

Statement

Write βX for the set of ultrafilters on X and A^={UβX:AU} for AX. The formulas

ηX(x)={AX:xA},μX(W)={AX:A^W}

define natural transformations η:1Setβ and μ:β2β.

Facts & Assumptions

Given: A set X, a point xX, and an ultrafilter W on βX.

[L1]

Pushforward makes XβX functorial (Pushforward sends ultrafilters to ultrafilters and is functorial).

[L2]

The complement-decision property characterises ultrafilters (Characterisation of ultrafilters: every set or its complement).

[L3]

In an ultrafilter, a finite union belongs exactly when one of its members belongs (Ultrafilters are prime: a union in U has a member in U).

Proof

technique · direct
1.1

The subsets containing x form a proper filter and decide every AX according as xA or xXA, so ηX(x) is an ultrafilter by [L2]. For f:XY, the equivalence BfηX(x)    xf1[B]    f(x)B proves naturality of η.

L1L2
1.2

The identities X^=βX, ^=, AB^=A^B^, and ABA^B^ give the filter axioms for μX(W). Inner complement decision gives XA^=βXA^; their union belongs to the outer ultrafilter, so [L3] puts one of them in it. By [L2] the resulting filter is an ultrafilter.

L2L3
2.1

For f:XY and BY, expanding definitions gives BfμX(W) exactly when f1[B]^W. This is equivalent to B^(βf)W, because (βf)1[B^]=f1[B]^ by [L1]. Hence fμX=μYβ(f).

L1step 1.2
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The ultrafilter endofunctor with principal unit and flattening multiplication

Definition

The ultrafilter endofunctor β:SetSet sends X to the set βX of ultrafilters on X and sends f:XY to ultrafilter pushforward f. Its principal unit and flattening multiplication are

ηX(x)={AX:xA},

μX(W)={AX:{UβX:AU}W}.

The preceding pushforward and flattening lemmas establish that these assignments are well-defined and natural.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-17Open item page →

The ultrafilter endofunctor with principal unit and flattening multiplication is a monad

Statement

The ultrafilter endofunctor β together with the principal unit η and flattening multiplication μ is a monad on Set.

Facts & Assumptions

Given: The functor β and the natural transformations η and μ from The ultrafilter endofunctor with principal unit and flattening multiplication.

[L1]

For AX, write A^={UβX:AU}; then AμX(W) exactly when A^W (The ultrafilter endofunctor with principal unit and flattening multiplication).

[L2]

The data in [L1] are already well-defined and natural (The ultrafilter endofunctor with principal unit and flattening multiplication).

Proof

technique · direct
1.1

For UβX, one has AμX(ηβX(U)) iff A^ηβX(U) iff UA^ iff AU. Thus μηβ=1β.

L1
1.2

Likewise AμX(βηX(U)) iff (ηX)1[A^]U. This inverse image is A, so μβη=1β.

L1L2
2.1

For Zβ3X, expanding membership in A along either μXβμX or μXμβX gives the same condition A^^Z. Hence multiplication is associative, and steps 1.1–1.2 give the unit laws.

L1L2step 1.1step 1.2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Coalgebra and coalgebra homomorphism for a comonad

Definition

Let (G,ε,δ) be a comonad on C. A G-coalgebra is an object A with a morphism c:AGA satisfying

εAc=1A,δAc=G(c)c.

A coalgebra homomorphism f:(A,c)(B,d) is a morphism f:AB in C satisfying

G(f)c=df.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Coalgebra homomorphisms are closed under identities and composition

Statement

For a comonad G, every identity on a G-coalgebra is a coalgebra homomorphism, and the composite of coalgebra homomorphisms is a coalgebra homomorphism.

Facts & Assumptions

Given: G-coalgebras (A,c), (B,d), and (C,e).

[L1]

A coalgebra homomorphism f:(A,c)(B,d) satisfies G(f)c=df (Coalgebra and coalgebra homomorphism for a comonad).

Proof

technique · direct
1.1

Functoriality gives G(1A)c=1GAc=c=c1A, so 1A is a coalgebra homomorphism by [L1].

L1
2.1

If f:(A,c)(B,d) and g:(B,d)(C,e) are coalgebra homomorphisms, then G(gf)c=G(g)G(f)c=G(g)df=egf. Thus gf is a coalgebra homomorphism.

L1step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Co-Eilenberg–Moore category of a comonad

Definition

For a comonad G on C, the co-Eilenberg–Moore category CG has G-coalgebras as objects and coalgebra homomorphisms as morphisms. Its identities and composition are those of C, whose closure is supplied by Coalgebra homomorphisms are closed under identities and composition. The forgetful functor UG:CGC sends a coalgebra and a coalgebra homomorphism to their underlying object and arrow.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The cofree–forgetful co-Eilenberg–Moore adjunction induces the given comonad

Statement

For a comonad (G,ε,δ) on C, the forgetful functor UG:CGC has a right adjoint FG, where FG(A)=(GA,δA). The comonad induced by UGFG is (G,ε,δ) on the nose.

Facts & Assumptions

Given: A comonad (G,ε,δ) on C.

[L1]

A comonad on C is a monad on Cop (Comonad on a category).

[L2]

The Eilenberg–Moore free–forgetful adjunction of a monad induces that monad on the nose (The free–forgetful Eilenberg–Moore adjunction induces the given monad).

Proof

technique · direct
1.1

Regard G as a monad on Cop and apply [L2] there.

L1L2
2.1

Taking opposites translates algebras into coalgebras, the free algebra into the cofree coalgebra FG(A)=(GA,δA), and the free–forgetful adjunction into UGFG. Its unit at (A,c) is c:(A,c)(GA,δA) and its counit at A is εA:GAA.

L1L2step 1.1
3.1

The triangle equations translate to Gεδ=1G and εGδ=1G. Therefore the induced endofunctor is UGFG=G, its counit is ε, and its comultiplication UGηFG is δ.

step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Co-Kleisli composition is associative and unital

Statement

For a comonad (G,ε,δ), regard a co-Kleisli arrow AB as a morphism f:GAB. Define

gf=gG(f)δA:GAC

for g:GBC, and define the identity at A to be εA:GAA. Then is associative and unital.

Facts & Assumptions

Given: A comonad (G,ε,δ) and co-Kleisli arrows f:GAB, g:GBC, and h:GCD.

[L1]

The comonad equations are coassociativity of δ and the two counit laws for ε (Comonad on a category).

[L2]

For a monad (T,η,μ) and morphisms f:ATB, g:BTC, the composite gf:=μCT(g)f is associative, and ηA:ATA is a two-sided identity at A (Kleisli composition is associative and unital).

Proof

technique · direct
1.1

The formula gf=gG(f)δA has source GA and target C, so it defines composition on the proposed arrows.

L1
2.1

Expanding h(gf) and (hg)f, naturality and coassociativity of δ move the two duplications into the same order, after which functoriality of G makes the composites equal.

L1L2step 1.1
3.1

Naturality of ε at f rewrites εBf=εBG(f)δA as fεGAδA, so the equation εGδ=1G gives εBf=f; and fεA=fG(εA)δA, so the equation Gεδ=1G gives fεA=f. Hence εA is a two-sided identity.

L1L2step 1.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

Co-Kleisli category of a comonad

Definition

For a comonad (G,ε,δ) on C, the co-Kleisli category CGcoKl has the objects of C and hom-collections

CGcoKl(A,B)=C(GA,B).

Composition is gf=gG(f)δA, and the identity of A is εA. These operations form a category by Co-Kleisli composition is associative and unital.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

The co-Kleisli adjunction induces the given comonad

Statement

For a comonad G on C, there is an adjunction

LG:CGcoKlC:RG

with LG(A)=GA and RG(A)=A. Its induced comonad LGRG is G on the nose.

Facts & Assumptions

Given: A comonad (G,ε,δ) and its co-Kleisli category.

[L1]

A co-Kleisli arrow AB is a base arrow GAB, with composition determined by δ (Co-Kleisli category of a comonad).

[L2]

The Kleisli adjunction construction induces its original monad (The Kleisli adjunction induces the given monad).

Proof

technique · direct
1.1

Define LG(A)=GA and LG(f)=G(f)δA for f:GAB. Define RG(A)=A and let RG(u) be the co-Kleisli arrow represented by uεA:GAB. These are the formal duals of the Kleisli functors.

L1L2
2.1

Co-Kleisli associativity and unit laws make both assignments functorial. The equality C(LGA,B)=C(GA,B)=CGcoKl(A,RGB) is a natural identity of hom-sets, so LGRG.

L1step 1.1
3.1

The counit of this adjunction is εA:GAA, while its unit at A is the co-Kleisli arrow represented by 1GA. The triangle identities are the co-Kleisli unit laws, and the induced comultiplication is LG of that unit, namely δA. Thus the induced comonad is (G,ε,δ).

L1L2step 1.1step 2.1
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-17Open item page →

Co-Kleisli and co-Eilenberg–Moore adjunctions have the dual extremal universal properties

Statement

Fix a comonad G on C. Among supplied adjunctions inducing G on the nose, the co-Kleisli adjunction has the schematic initial universal property and the co-Eilenberg–Moore adjunction has the schematic terminal universal property: every such adjunction admits a unique morphism of adjunctions from the co-Kleisli resolution and a unique morphism of adjunctions to the co-Eilenberg–Moore resolution, with the corresponding equalities over the base categories.

Facts & Assumptions

Given: A comonad G and an adjunction inducing G.

[L1]
[L2]

The co-Kleisli adjunction induces G (The co-Kleisli adjunction induces the given comonad).

[L3]

For a fixed monad, every supplied adjunction inducing it admits a unique morphism of adjunctions from the Kleisli adjunction and a unique morphism of adjunctions to the Eilenberg–Moore adjunction; Kleisli has the schematic initial universal property and Eilenberg–Moore the schematic terminal one (Kleisli and Eilenberg–Moore adjunctions have the extremal universal properties).

Proof

technique · direct
1.1

Regard G as a monad on the opposite category and apply [L3] there.

L3
2.1

An adjunction LR inducing G on C becomes RopLop inducing that monad on Cop, and under this translation the Kleisli and Eilenberg–Moore resolutions of the latter are the co-Kleisli and co-Eilenberg–Moore adjunctions of [L1]–[L2]. A morphism of adjunctions is a functor between their intermediate categories, and passing to opposite categories carries such a functor K to Kop, which runs between the same two adjunctions in the same order. The two comparison directions are therefore preserved rather than reversed, so the initial property stays with co-Kleisli and the terminal one with co-Eilenberg–Moore.

L1L2step 1.1
3.1

Transporting the two universal properties of [L3] back along this translation gives, for every supplied adjunction inducing G, a unique morphism of adjunctions from the co-Kleisli resolution and a unique morphism of adjunctions to the co-Eilenberg–Moore resolution, with the required equalities over the base categories. This assertion quantifies over supplied data and does not require a category of all such adjunctions.

L3step 2.1

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: The Kleisli and Eilenberg–Moore categories are equivalent for every monad

Statement

False claim: for every monad, its Kleisli and Eilenberg–Moore categories are equivalent.

The free-monoid monad on Set is a counterexample.

Facts & Assumptions

Given: The free-monoid monad T(X)=X on Set.

[L1]

Its Kleisli hom-set from X to Y is Set(X,Y) (Kleisli category of a monad; The free-monoid monad has monoids as its Eilenberg–Moore algebras).

[L2]

Its Eilenberg–Moore category is the category of monoids (The free-monoid monad has monoids as its Eilenberg–Moore algebras).

[L3]

A functor F:CD is an equivalence exactly when it is fully faithful and split essentially surjective (A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice); an equivalence consists of quasi-inverse functors and natural isomorphisms 1CGF and FG1D (Equivalence, quasi-inverse, and adjoint equivalence of categories), and F is fully faithful when every FA,B:C(A,B)D(FA,FB) is bijective (Faithful, full, fully faithful, essentially surjective, and split essentially surjective functors).

[L4]

The canonical Kleisli comparison is fully faithful with image the free algebras (The comparison from the Kleisli category is fully faithful with image the free algebras).

[L5]

For an idempotent monad T, the canonical comparison M:CTCT is an equivalence of categories (The Kleisli and Eilenberg–Moore categories of an idempotent monad are equivalent).

Refutation

technique · direct
1.1

By [L1], the endomorphism set of X in the Kleisli category is Set(X,X).

L1
1.2

The monoid M={1,e} with e2=e has exactly two endomorphisms: an endomorphism fixes 1, and it may send e to either idempotent 1 or e.

L2
2.1

If X=, this function set is a singleton. If X is nonempty, choose xX; the words [],[x],[x,x], are distinct, and the corresponding constant functions show that Set(X,X) is infinite.

step 1.1
3.1

If the two categories were equivalent, essential surjectivity would place M in the image up to isomorphism, and full faithfulness would give a bijection between its two-element endomorphism set and the endomorphism set of some Kleisli object. Step 2.1 rules this out.

L2L3step 1.2step 2.1
4.1

The claim is therefore false. The positive boundary is [L4], that the canonical comparison is fully faithful with image the free algebras, together with [L5], that it is an equivalence when the monad is idempotent.

L4L5step 3.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-17Open item page →

FALSE: Every functor with a left adjoint is monadic

Statement

False claim: every functor that has a left adjoint is monadic.

The underlying-set functor U:TopSet is a counterexample.

Facts & Assumptions

Given: The underlying-set functor U:TopSet.

[L1]

The discrete-topology functor is left adjoint to U (Discrete topology, underlying set, and indiscrete topology form an adjoint triple).

[L2]

Every monadic functor is conservative (Every monadic functor is conservative).

[L3]

A continuous bijection is an isomorphism in Top exactly when its inverse is continuous (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

Refutation

technique · direct
1.1

By [L1], U has a left adjoint.

L1
1.2

On a two-element set X, let Xd have the discrete topology and Xi the indiscrete topology. The identity function q:XdXi is continuous and U(q) is a bijection, but q1:XiXd is not continuous because a singleton is open in Xd and not in Xi.

L3
2.1

Thus U(q) is an isomorphism while q is not, so U is not conservative. By [L2] it is not monadic, even though step 1.1 gives it a left adjoint.

L2step 1.1step 1.2
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: A monad is a monoid object in the endofunctor category for every category

Statement

False claim under the library's size convention: for every category C, a monad on C is a monoid object in the endofunctor category [C,C].

The slogan is valid when that endofunctor category is formed, as recorded in The monoid description of a monad requires an endofunctor category.

Facts & Assumptions

Given: The library convention for functor categories.

[L1]

The functor category [C,D] is formed when the source C is small; for an arbitrary large source the same notation may be used only as metatheoretic shorthand, and the definition does not form those proper-class-sized data into a category (Functor category [C,D]).

[L2]

If C is small and D is locally small, then [C,D] is locally small; if both are small, then [C,D] is small (If C is small and D is locally small then [C,D] is locally small; if both are small it is small).

[L3]

Sets as objects and functions as morphisms form a large locally small category Set (Sets and functions form the large locally small category Set).

[L4]

A monad on C is an endofunctor with a unit and a multiplication satisfying the two unit equations and associativity (Monad on a category).

Refutation

technique · direct
1.1

A monoid object is defined only inside an actual monoidal category, so the claimed description presupposes that [C,C] is a category.

L1
2.1

Take C=Set, which is large by [L3], carrying the identity monad (1Set,1,1), whose unit and associativity equations hold trivially by [L4]. The source Set is not small, so by [L1] the adopted convention does not form [Set,Set] into a category, and the presupposition of step 1.1 fails for this monad.

L1L3L4step 1.1
3.1

A claim asserted for every category therefore fails at C=Set, where it presupposes a category the convention does not form. When C is small the functor category is formed by [L1] and is locally small by [L2], and the usual monoid description is valid there.

L1L2step 2.1
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17Open item page →

FALSE: Every algebra for a monad is free

Statement

False claim: every algebra for every monad is a free algebra.

The free-monoid monad has a two-element algebra that is not free.

Facts & Assumptions

Given: The free-monoid monad on Set.

[L1]

Its algebras are monoids, while its free algebras are free word monoids (The free-monoid monad has monoids as its Eilenberg–Moore algebras; Free algebra for a monad).

[L2]

A monoid has associative multiplication and a two-sided identity (Semigroup and monoid).

Refutation

technique · direct
1.1

By [L1], it suffices to exhibit a monoid that is not isomorphic to a free word monoid.

L1
1.2

Let M={1,e} with 1 an identity and e2=e. Its multiplication is associative by inspection, so it is a monoid and hence an algebra for the free-monoid monad.

L1L2
2.1

A free word monoid on the empty set has one element. A free word monoid on a nonempty set contains the distinct words [],[x],[x,x], for any chosen generator x, so it is infinite. Therefore no free word monoid has two elements, and M is not free.

L1step 1.2

Sources

Standard references

Recommended treatments; not extraction sources.