Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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.

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:C→D 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 1C⇒GF and FG⇒1D (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:CT→CT is an equivalence of categories (The Kleisli and Eilenberg–Moore categories of an idempotent monad are equivalent).

Refutation

technique · direct
1.1L1

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

1.2L2

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.

2.1step 1.1

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

3.1L2L3step 1.2step 2.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.

4.1L4L5step 3.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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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