Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 122 1 b Solution Created 2026-10-03 Updated 2026-10-06
Define the length of a formal tensor expression recursively byThe canonical strict monoidal functor sends to , sends every associator and unitor to an identity braid, and sends to the block braiding . The pentagon and triangle become identity equations; the braiding axioms become the corresponding block-braid equations. Thus the assignment respects the defining relations, andon the nose. It is a braided monoidal functor with identity comparison maps.
To prove that is an equivalence of categories, choose a standard parenthesization of copies of , with . On , define the image of by canonically exposing the th and st factors, applying there, and restoring the chosen parentheses. The monoidal coherence theorem makes this independent of the structural rebracketing. Crossings on disjoint pairs commute by the tensor interchange law. The adjacent braid group relations follows from the hexagon laws and naturality of the braiding, as in the Yang–Baxter calculation below. Hence these assignments give group homomorphisms and a functor .
Equip with the canonical rebracketing maps . Their monoidal functor axioms follow from the monoidal coherence theorem; the block-braiding compatibility follows by iterating the two hexagon laws. Therefore is a strong monoidal functor compatible with the braiding.
We have , including its comparison maps. For every formal expression , there is a canonical structural isomorphismobtained by rebracketing and inserting the units appearing in . These maps form a natural isomorphism . To check naturality, it suffices to check the generating morphisms: for associators and unitors it is exactly monoidal coherence; for it follows from the hexagon expansion into the elementary crossings defining . Composition and tensor product then preserve the equation. The same structural coherence shows that is monoidal.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 122 2 b Solution Created 2026-10-03 Updated 2026-10-06
An opmonoidal monad on a monoidal category is a monad whose endofunctor is an opmonoidal functor and whose unit and multiplication of a monad are opmonoidal natural transformations. Suppress only the canonical parentheses. Explicitly,The composite opmonoidal functor has tensor comparison and unit comparison , explaining the last two equations.
For two algebras for a monad and , defineLet . The unit law for a monad algebra follows at once from the opmonoidality of :For the multiplication law, naturality of , the algebra laws, and the opmonoidality of giveThe two unit-comparison equations above similarly make a algebra for a monad. If are morphisms of algebras for a monad, naturality of shows that is an algebra morphism.
For a third algebra , the base associator is also an algebra morphism: its intertwining equation is precisely the opmonoidal associativity axiom, followed by . The two base unitors are algebra morphisms by the opmonoidal unit axioms. Their pentagon and triangle commute because they commute after the faithful forgetful functor, and the lifted maps have exactly the same underlying morphisms.
The Eilenberg-Moore category is therefore monoidal, with these lifted constraints. Its forgetful functor preserves the tensor product, unit object and constraints exactly, so it is a strict monoidal functor.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 122 5 a Solution Created 2026-10-03 Updated 2026-10-06
For the given bimonoids, use right comodules. The corestriction functor for comodules associated to a comonoid morphism keeps underlying objects and morphisms, and replaces a coaction by . The comonoid-morphism axioms ensure that this is a -coaction.
The tensor coaction for two -comodules in the ambient braided monoidal category isand the unit coaction is . If is also a monoid morphism, then and . Substituting these identities, and using naturality of the ambient braiding, shows that corestriction preserves both tensor and unit coactions exactly. Its structural maps are identities, so it is a strict monoidal functor.
Conversely, suppose this induced functor is strict monoidal. Apply equality of the tensor coactions to the two regular right comodules . Then apply to their two underlying factors. The counit laws and naturality of the braiding remove those factors and leaveEquality on the unit comodule similarly gives . Thus is a monoid morphism. The criterion is exactlyThe regular-comodule argument uses only the counit laws; it requires no elementwise or finite-dimensional assumption on the ambient category.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 122 6 a Solution Created 2026-10-03 Updated 2026-10-06
Because the direction of a lax monoidal functor compares the target tensor with the image of the source tensor, the given maps have the correct direction. They need not be invertible unless a strong monoidal functor is intended.
Their associativity condition is the following commutative diagram, with the associators of the two structures labelled explicitly:The two unit conditions, since , are the unit commutative diagramsTogether with the assumed naturality, these are exactly the axioms for the requested monoidal structure. There are no further coherence conditions.
The faithful strict monoidal functor allows all three diagrams to be checked after applying it. Both tensor structures then have the same underlying tensor and constraints in . In particular, the unit conditions are equivalent toThe associativity square becomes the displayed diagram with every tensor replaced by , both associators by , and every by . Faithfulness reflects equality of the two resulting composites. One should not identify itself with an identity in : its domain and codomain can be distinct objects with the same image under . Intrinsically it is , and similarly on the right.