Metraipolis › archive › dc_89cb966e7571

Beck's monadicity theorem — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Beck%27s_monadicity_theorem
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T08:53:01.427Z
SHA-256 of the archived text
70f1dc2d3108f894e587021e75eb7617ceb9982193fb7b0646fa7f2bf4008243
Stable URL of this page
https://metraipolis.com/documento/dc_89cb966e7571

How to cite

Beck's monadicity theorem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Beck%27s_monadicity_theorem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_89cb966e7571 (Metraipolis archive dc_89cb966e7571, sha256 70f1dc2d3108f894e587021e75eb7617ceb9982193fb7b0646fa7f2bf4008243)
BibTeX
@misc{dc89cb966e7571,
  title = {Beck's monadicity theorem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Beck%27s_monadicity_theorem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_89cb966e7571; sha256 70f1dc2d3108f894e587021e75eb7617ceb9982193fb7b0646fa7f2bf4008243},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Beck%27s_monadicity_theorem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In category theory, a branch of mathematics, Beck's monadicity theorem gives a criterion that characterises monadic functors, introduced by Jonathan Mock Beck (1968). It is often stated in dual form for comonads. It is sometimes called the Beck tripleability theorem because of the older term triple for a monad. Beck's monadicity theorem asserts that a functor U : C → D {\displaystyle U:C\to D} is monadic if and only if U has a left adjoint; U reflects isomorphisms (if U(f) is an isomorphism then so is f); and C has coequalizers of U-split parallel pairs (those parallel pairs of morphisms in C, which U sends to pairs having a split coequalizer in D), and U preserves those coequalizers. There are several variations of Beck's theorem: if U has a left adjoint then any of the following conditions ensure that U is monadic: U reflects isomorphisms and C has coequalizers of reflexive pairs (those with a common right inverse) and U preserves those coequalizers. (This gives the crude monadicity theorem.) Every diagram in C which is by U sent to a split coequalizer sequence in D is itself a coequalizer sequence in C. In different words, U creates (preserves and reflects) U-split coequalizer sequences. Another variation of Beck's theorem characterizes strictly monadic functors: those for which the comparison functor is an isomorphism rather than just an equivalence of categories. For this version the definitions of what it means to create coequalizers is changed slightly: the coequalizer has to be unique rather than just unique up to isomorphism. Beck's theorem is particularly important in its relation with the descent theory, which plays a role in sheaf and stack theory, as well as in the Alexander Grothendieck's approach to algebraic geometry. Most cases of faithfully flat descent of algebraic structures (e.g. those in FGA and in SGA1) are special cases of Beck's theorem. The theorem gives an exact categorical description of the process of 'descent', at this level. In 1970 the Grothendieck approach via fibered categories and descent data was shown (by Jean Bénabou and Jacques Roubaud) to be equivalent (under some conditions) to the comonad approach. In a later work, Pierre Deligne applied Beck's theorem to Tannakian category theory, greatly simplifying the basic developments. Linton's monadicity theorem: Let A {\displaystyle {\mathcal {A}}} be a category that has kernel pairs of retractions, and let C {\displaystyle {\mathcal {C}}} be a category that has kernel pairs and coequalizers. Let U : C → A {\displaystyle U:{\mathcal {C}}\rightarrow {\mathcal {A}}} be functor. When A = Set {\displaystyle {\mathcal {A}}={\textbf {Set}}} , U {\displaystyle U} is monadic if and only if U {\displaystyle U} has a left adjoint; U {\displaystyle U} preserves and reflects regular epimorphisms; and ( f , g ) {\displaystyle (f,g)} is kernel pair if and only if ( U f , U g ) {\displaystyle (U_{f},U_{g})} is kernel pair. Linton (1969) proved this theorem in a more general cate

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «category theory»).
Fonte: Wikipedia in inglese, voce «Beck's monadicity theorem» — https://en.wikipedia.org/wiki/Beck%27s_monadicity_theorem
Wikidata Q4878586 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4878586
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Beck%27s_monadicity_theorem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1362782929, consultata il 2026-10-06T08:20:35.302Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4a327f8e75c2bd8c8924bc2cd683230a6d03b3f9be30091b0d523a78af45faeb