Beck's monadicity theorem¶

A categorical criterion determining when a functor is equivalent to the forgetful functor from algebras for the monad induced by its adjunction.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3428
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Category Theory → Mathematics

Core Idea¶

Beck's theorem recognizes when a category can be reconstructed as algebras for a monad over a base category. The left adjoint generates free algebra structure, while reflection and creation or preservation of specified coequalizers make the comparison functor an equivalence. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of category theory. It is A categorical criterion determining when a functor is equivalent to the forgetful functor from algebras for the monad induced by its adjunction.

How would you explain it like I'm…

No faithful explanation at this level. All three generators agree any five-year-old picture collapses into 'some things are built from simpler things by rules', erasing the theorem's actual content, a precise adjoint, conservativity and coequalizer test for when the comparison functor to monad algebras is an equivalence, which many such structures fail.

The Stuff-Plus-Recipe Test

Mathematicians study many kinds of objects, and some kinds turn out to be 'plain stuff plus a recipe of allowed operations and rules'. Beck's monadicity theorem is a test that tells you exactly when a kind of object can be rebuilt that way. It looks at a 'forgetting' process that strips an object down to plain stuff, and at a partner process that builds the freest possible version from plain stuff. If certain checks about these two processes pass, the objects really are 'stuff plus recipe', and nothing is lost by seeing them that way.

Test for Monad Algebras

In category theory, a monad on a base category is a kind of abstract 'recipe of operations', and its algebras are objects of the base category equipped with that structure. Beck's monadicity theorem answers when a given category can be reconstructed as exactly the algebras for such a monad. You start with a functor that forgets structure, which must have a left adjoint that builds free structures; together they produce a monad. The theorem says the natural comparison with the category of algebras is an equivalence exactly when the forgetful functor meets specific conditions: roughly, it reflects isomorphisms and handles a special kind of coequalizer (a way of gluing things together) correctly. Knowing the exact version of the conditions matters, because different formulations use slightly different hypotheses.

Beck's monadicity theorem is a criterion for when a functor U: C → D is monadic, that is, equivalent to the forgetful functor from the category of algebras for the monad induced by an adjunction. Given U with a left adjoint F, the composite UF carries a monad structure, and there is a canonical comparison functor from C to the category of algebras of that monad. The left adjoint supplies free algebra structure. Beck's theorem states that the comparison functor is an equivalence if and only if U satisfies coequalizer conditions: in one standard formulation, U reflects isomorphisms (is conservative) and C has, and U preserves, coequalizers of U-split pairs (or, in another, U creates them). Establishing monadicity requires stating which formulation is used and verifying its exact adjoint, conservativity and coequalizer hypotheses rather than relying on resemblance to familiar algebraic examples. Once established, the theorem licenses treating C as a category of algebras and transferring the corresponding consequences, but not beyond those hypotheses.

Scope of Application¶

Beck's monadicity theorem belongs to category theory and is useful where the analyst can specify an adjunction F left-adjoint to U, induced monad, comparison functor, reflected isomorphisms and U-split coequalizers, then evaluate the exact adjoint, conservativity and coequalizer hypotheses of the selected monadicity formulation hold. The scope is broad within that domain but bounded by the need for the exact adjoint, conservativity and coequalizer hypotheses of the selected monadicity formulation hold. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the exact adjoint, conservativity and coequalizer hypotheses of the selected monadicity formulation hold the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Beck's monadicity theorem can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Beck's monadicity theorem. Beck's monadicity theorem compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: an adjunction F left-adjoint to U, induced monad, comparison functor, reflected isomorphisms and U-split coequalizers. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the exact adjoint, conservativity and coequalizer hypotheses of the selected monadicity formulation hold independently of one notation or implementation. This step prevents the canonical example from becoming the definition.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of category theory because they reuse an adjunction F left-adjoint to U, induced monad, comparison functor, reflected isomorphisms and U-split coequalizers, The left adjoint generates free algebra structure, while reflection and creation or preservation of specified coequalizers make the comparison functor an equivalence., and type the carrier, state every parameter and convention in the definition, test that the exact adjoint, conservativity and coequalizer hypotheses of the selected monadicity formulation hold, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Beck's monadicity theorem Domain-specific

Parents (1) — outgoing typed relations

Beck's monadicity theorem is a kind of Classification Prime

What makes it its own entry: A categorical criterion determining when a functor is equivalent to the forgetful functor from algebras for the monad induced by its adjunction.

Hierarchy path (1) — routes to 1 parentless root

Beck's monadicity theorem → is a kind of Classification

Neighborhood in Abstraction Space¶

Beck's monadicity theorem sits in a crowded region of the domain-specific corpus (28^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Homological Algebra Constructions (19 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25