2000 character limit reached
The Bénabou-Roubaud theorem via string diagrams
Published 9 Jan 2026 in math.CT | (2601.05691v1)
Abstract: We give a complete proof of the Bénabou-Roubaud monadic descent theorem using the graphical calculus of string diagrams. Our proof links the monadic and Grothendieck's original viewpoint on descent via an internal-category-based characterization of the category of descent data, equivalent to the one of Janelidze and Tholen.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.