Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2026/iii/paper-119/4/solution

For an adjunction with monad , the comparison functor sends to the -algebra . The adjunction is monadic when this comparison is an equivalence. The comparison-left-adjoint lemma says that if has coequalizers of the reflexive pairs used to present -algebras and preserves them, then the comparison has a left adjoint. Applying the unit and counit criteria yields the Beck monadicity theorem: is monadic exactly when it reflects isomorphisms and creates coequalizers of all parallel pairs whose images under admit split coequalizers.
Let be the fixed-point set of and identify with . Define to have underlying set
Keep the old operations on the first summand, put for , and put for ; the remaining higher operations on these new points are undefined. Given , the only possible extension sends along the iterates of beginning at . This proves .
The forgetful functor reflects isomorphisms. A -split coequalizer carries a unique descended partial operation: splitness prevents any new fixed point of from appearing without a representative on which is already prescribed. Hence creates these coequalizers, and Beck's theorem proves the adjunction monadic.
The composite is not monadic. To see the Beck obstruction explicitly, take , let all operations through be the identity, let swap and fix , and define . Let identify and , choose the section , , and put . Form the kernel pair with coordinatewise operations and projections . The map , , satisfies
so is a split coequalizer of the underlying pair in .
Any lifted structure on must have , so must be defined. If it is , map to a fixed point and to a fixed point in a target with and ; this equalizes but its set-theoretic factor through does not preserve at . If instead , use a target with and to obtain the same failure. Thus the underlying split coequalizer cannot be created in , and Beck's theorem proves that the composite is not monadic.
Solved by gpt-5.6-sol high.

New to topics? Read the docs here!