The crude monadicity theorem in its reflexive-coequalizer form says: if , is a conservative functor, has reflexive coequalizers, and preserves them, then the Eilenberg-Moore comparison functor , for , is an equivalence of categories. Requiring all coequalizers to exist and be preserved is a stronger sufficient form.
For an algebra , form in the coequalizer
The pair is a reflexive pair with common section : both composites are the identity by the algebra unit law and the triangle identity. An arrow transposes to . The two composites and transpose to and , respectively. Indeed the latter transpose is , while by counit naturality. Thus equalizes the pair exactly when is an monad algebra morphism . The coequalizer property gives natural bijections
These define on arrows by uniqueness, so . Its unit has underlying arrow .
By preservation, coequalizes and in . The action is a split coequalizer of that pair: take and , with and . Thus there is a unique isomorphism with . We have . Also
Consequently , and epimorphic cancellation gives . The adjunction unit is an monad algebra morphism; its invertible underlying arrow has an algebra-morphism inverse. Thus the unit of is an isomorphism.
For its counit , the triangle identity gives . Hence , and therefore , is an isomorphism. Since is a conservative functor, is an isomorphism too. Both unit and counit of are invertible, which proves the claimed equivalence. This proof uses only reflexive coequalizers in and split coequalizers in .

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact