Coaction 2026-10-06
The structure map of a comodule; a right coaction satisfies with coherent parentheses, and is the inverse right unitor.
A natural underlying transformation of tensor bifunctors on right comodules over a field has components . Recover ; colinearity and monoidal axioms impose further equations.
In a symmetric monoidal category, a convolution-invertible scalar pairing on a bimonoid inducing the comodule braiding . Its multiplicativity, normalization and commutation axioms express the hexagon, unit and colinearity conditions. The notation abbreviates morphisms and ambient symmetries, not a requirement for elements.
A comonoid morphism induces a functor on right comodules, replacing by and preserving underlying objects and arrows. For bimonoids, it is strict monoidal exactly when is also a monoid morphism.
We use right comodules and write their coactions as . A coquasitriangular structure gives the braiding on these comodules
In an arbitrary symmetric monoidal category this notation abbreviates a composite of the two coactions, the ambient symmetry, and ; it does not assume that the objects have elements. The coquasitriangular axioms ensure that this composite is a comodule morphism, is invertible using the convolution inverse of , and satisfies the two hexagon laws. More explicitly, in scalar notation those laws come from
while the comodule-morphism condition is
Unit normalizations give the unit constraints. These descriptions are identities of morphisms in the ambient symmetric category, with the displayed reordering carried by its symmetry.
Apply the preceding self-braiding result to the regular right comodule . Its Yang–Baxter operator is
Compose its braid equation with the three counits. Expanding and cancelling the leading counit factors gives
Expanding instead gives
They are equal by the Yang–Baxter operator equation. This is the required scalar identity:
Indeed, after the ordered factors are . The two ambient symmetries on the left produce the three pairings , , . On the right, the central symmetry produces , yielding exactly the other three pairings. Hence the calculation identifies the actual morphisms requested, also when the category is not a category of vector spaces.
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 is
and 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 leave
Equality on the unit comodule similarly gives . Thus is a monoid morphism. The criterion is exactly
The regular-comodule argument uses only the counit laws; it requires no elementwise or finite-dimensional assumption on the ambient category.
A useful comodule natural transformation formula determines from a single linear functional. Define
using the regular right comodule . For any vector space , the cofree right comodule has coaction . Naturality with respect to all maps gives
The coaction is itself a morphism of right comodules. Its naturality equation, followed by , therefore gives
This derivation works for all comodules, not merely finite-dimensional ones.
The monoidal equation , evaluated on the two regular comodules and followed by their counits, implies
The unit equation gives . Thus is a unital algebra homomorphism over a field . In addition, the -colinearity of gives the useful intertwining relation
This fixes the orientation of relative to .
For the convolution product for coalgebra maps, define . Multiplicativity of and the two antipode identities show
Consequently
Coassociativity and the two convolution identities verify both composites directly. Since was a -comodule morphism, its linear inverse is also a -comodule morphism. Inverting the naturality and monoidal equations shows that the inverses form a monoidal natural transformation . Every such monoidal transformation is therefore invertible, without requiring a bijective antipode.
Use right comodules with coaction . Fix the convention that is induced by and by . We classify lax monoidal structures first; the strong case is identified at the end.
Every natural transformation of the indicated tensor bifunctors is determined by a linear functional , and its components have the comodule tensor transformation formula
To prove the assertion, set . On the cofree comodules , naturality with respect to forces the component to act as on the two factors. Apply naturality to the pair of coactions , , then apply their counits. This yields the formula. Conversely the formula is plainly natural with respect to comodule morphisms, and recovers from the regular comodules.
It remains to impose exactly three kinds of equations. First, the component must be -colinear from the tensor with product to the tensor with product . Expanding its two coactions gives (C), the multiplication compatibility for a comodule tensor transformation
Necessity follows by taking and applying the two counits; sufficiency follows by substituting the identity into the coaction formula for arbitrary .
Second, the two unit triangles in the preceding part are exactly (U):
Here is the common algebra unit. These identities are forced by the regular comodule and sufficient by the counit law.
Third, expand the associativity diagram on three right comodules. The two scalar factors, after their counits are removed, are (A):
The product in this expression is , because the intermediate arguments and are source-tensor objects. Necessity follows from the three regular comodules; sufficiency is the same substitution for arbitrary coactions. Using (C), the same condition can equivalently be written with the target product :
This is the normalized bialgebra scalar cocycle equation for that convention.
Thus the required structures correspond bijectively to all linear maps satisfying (C), (U) and (A). No convolution invertibility has been imposed for a lax monoidal functor structure. If “monoidal” is required to mean strong, add precisely that is invertible under the convolution product for coalgebra maps on . Its convolution inverse supplies the inverse component by the same displayed formula; conversely natural inverse components recover a convolution inverse by the regular-comodule argument. In that case (C) is the explicit bialgebra cocycle twist relation
This also records which multiplication lies on each side of the twist. Interchanging the names of interchanges the two tensor conventions, rather than silently changing the equation.
For a concrete lax example, take the two-dimensional bialgebra with basis , product , and , . Set and , . Normalization and (C) hold, and (A) follows by checking the eight basis triples: triples involving reduce to normalization, and the triple has both sides zero. But the tensor component is zero, so this lax monoidal functor is not strong.