Monadic descent
Jump to navigation
Jump to search
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (November 2025) |
In mathematics, especially category theory, a monadic descent is roughly an idea to encode descent data using a monad.
Bénabou-Roubaud theorem
[edit | edit source]The Bénabou-Roubaud theorem says that (roughly) given a bifibration satisfying the Beck–Chevalley condition for p, the category of descent data is canonically equivalent to the category of algebras of the monad induced by .
See also
[edit | edit source]References
[edit | edit source]- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
Further reading
[edit | edit source]- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). -English translation of Bénabou&Roubaud(1970).
This article needs additional or more specific categories. (November 2025) |