Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 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.

FALSE: ordinary Beck creation characterizes strict monadicity

Statement

False claim: a right adjoint is strictly monadic if and only if it creates coequalizers of its split pairs in the ordinary isomorphism-invariant sense.

Facts & Assumptions

Given: Ordinary and strict monadicity with their respective Beck conditions.

[L1]

A right adjoint is monadic when its comparison functor is an equivalence of categories and strictly monadic when that functor is an isomorphism of categories; strict monadicity implies monadicity, but the converse is not part of the definition (Monadic and strictly monadic functors).

[L2]

A monadic right adjoint creates coequalizers of its split pairs in the ordinary isomorphism-invariant sense (Beck's monadicity theorem in data-supplied form).

[L3]

An isomorphism of categories is bijective on objects and on morphisms (A functor is an isomorphism of categories exactly when its object and morphism maps are bijective).

[L4]

A functor is an equivalence exactly when it is fully faithful and split essentially surjective, and no choice principle is needed because the splitting is part of the data (A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice).

Refutation

technique · direct
1.1

Let D have objects tagged sets (X,i) with i{0,1} and let every morphism (X,i)(Y,j) be a function XY. The forgetful functor U:DSet has a left adjoint F(X)=(X,0).

construct
2.1

The unit and counit of this adjunction act as identity functions, so the induced monad on Set is the identity monad.

step 1.1algebra
2.2

Its object map is not injective because (X,0) and (X,1) are distinct objects with the same image. Hence the comparison is not an isomorphism by [L3] and U is not strictly monadic.

step 1.1L3
3.1

The comparison is U itself. It is fully faithful because every function XY is a morphism (X,i)(Y,j) and no two morphisms have the same underlying function, and the assignment X(X,0) splits it on objects, since U(X,0)=X on the nose. By [L4] it is therefore an equivalence, so U is monadic in the sense of [L1].

step 2.1L1L4
4.1

By [L2], ordinary Beck creation holds for this monadic right adjoint, while step 2.2 shows strict monadicity fails. Thus the implication from ordinary creation to strict monadicity is false.

step 3.1step 2.2L2
5.1

The other implication is true: strict monadicity implies monadicity by [L1], and monadicity implies ordinary creation by [L2]. Hence step 4.1 refutes exactly the reverse implication in the displayed biconditional; strict creation is the additional condition characterized by strict Beck.

step 4.1L1L2

Depends on

Used by

Nothing in the library uses this result yet.

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