Let denote the generating object, the image of the unique object of the terminal category. The free braided monoidal category on one object can be described syntactically. Its objects are all fully parenthesized expressions built from , the monoidal unit object , and a binary monoidal tensor product. Thus and are distinct objects, though canonically isomorphic. Its morphisms are generated by the associators, unitors, braidings and their inverses, closed under composition and tensor product, subject to the pentagon, triangle, naturality and hexagon axioms. No symmetry relation is imposed on the braiding. The embedding of the terminal category selects .
The braid category has objects the nonnegative integers, with
where is the braid group on strands and are trivial. Composition is stacking braids, with the first morphism followed by the second. The monoidal tensor product is addition on objects and side-by-side juxtaposition of braids; its monoidal unit object is . The associators and unitors are identities, so it is a strict monoidal category.
Choose the positive crossing convention once and for all. Its braiding is the block braid moving the first strands over the next strands while retaining the order within each block. In particular . The usual braid group relations express the naturality and hexagon laws for these block braids. The generating functor selects .
The distinction is parenthesized tensor expressions versus strand counts: the first construction keeps the structural isomorphisms visible, while has strict tensor arithmetic. These descriptions give the two requested free constructions without needing to establish their universal properties.
Define the length of a formal tensor expression recursively by
The 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, and
on 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 isomorphism
obtained 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.
Thus has a specified quasi-inverse and is the required equivalence:
Only ordinary monoidal coherence, together with the defining braiding axioms, has been used; a separate braided coherence theorem is unnecessary.
An opmonoidal functor consists of a functor, a natural transformation
and a morphism . These maps need not be invertible. If are the respective associators and unitors, its axioms are
The first equation has domain and codomain , which fixes the direction of every arrow. This is also called a colax monoidal functor.
An opmonoidal natural transformation between opmonoidal functors is a natural transformation satisfying
It respects both the tensor and unit comparison maps. These are commutative diagrams and a unit commutative diagram; the arrow directions are opposite to those for a lax monoidal functor.
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 , define
Let . 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 give
The 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.
On the monoidal category of modules over the commutative ring , consider the monad coming from the unit and multiplication of the bialgebra . Its opmonoidal functor structure has comparison maps
Here and below Sweedler notation abbreviates the comultiplication . The opmonoidal associativity and unit axioms are the coassociativity and counit laws of the coalgebra. The unit and multiplication of a monad are opmonoidal natural transformations because the bialgebra axioms say
The Eilenberg-Moore category of this opmonoidal monad is the category of left -modules: a monad-algebra map is exactly a unital associative action.
Applying the preceding construction gives the diagonal bialgebra action and the unit action
The usual associators and unitors for the tensor product of modules are -linear, and the underlying tensor product is exactly . The forgetful functor into -modules is strict monoidal. The base need not be a field; the modules need be neither flat modules nor finitely generated modules.
We use the left internal-hom convention in which is right adjoint to , so its evaluation morphism has domain . For a Hopf algebra over the commutative ring , take the full -module
and give it the internal hom for modules over a Hopf algebra
The antipode is an antihomomorphism, , so
The unit acts identically. Thus this is a left -module.
The evaluation morphism is -linear. Using the diagonal bialgebra action and the antipode identity,
Now let be -linear and define its ordinary curried map . To see that it too is -linear, compute
Conversely, any -linear map uncurries to an -linear map by the already established linearity of evaluation. The ordinary tensor–hom adjunction therefore restricts to a natural bijection
Postcomposition by an -linear map makes a functor. This proves that the category of left -modules is a left closed monoidal category. All modules are allowed; no inverse antipode or finite-dimensional dual is required. Stating the tensor–hom convention explicitly avoids confusing this construction with the closure on the opposite side.
By the monoidal coherence theorem, calculations may suppress the canonical associators and unitors, restoring them uniquely afterwards. In this notation the two Frobenius monoidal functor identities read
Write
We check both snake identities for this prospective dual pair in a monoidal category. For , expand and use the first Frobenius identity:
The third line uses naturality of and . The last line uses , followed by the opmonoidal and monoidal unit axioms.
For , the second Frobenius identity gives the other calculation:
Thus both triangular identities hold, and
are the evaluation morphism and coevaluation morphism of a dual pair in a monoidal category. Notice that none of the comparison maps was assumed invertible.
Use the specified self-dual-pairing meaning of “coseparable”; categorically this is the Frobenius monoid structure relevant here. The induced monoid object on has maps
Its associativity follows from associativity of and the lax monoidal functor axiom for : both iterated products are of the corresponding triple product, preceded by the same coherent iterated tensor comparison. The unit laws follow from those of and the two monoidal unit axioms. Thus is a monoid object.
Its pairing is exactly the evaluation transported in the preceding part:
If is the original coevaluation morphism, the corresponding new one is . The preceding Frobenius monoidal functor calculation proves both snake identities. Hence the pairing of the induced monoid remains self-dual, giving the claimed canonical structure on . The terminology in the paper imposes this duality condition; it does not add a separability or semisimplicity condition.
The algebra must be finite-dimensional, and there is no universal bound on its dimension. Let and write its coevaluation morphism as a finite sum
For any , one snake identity gives
Thus the finitely many span , making it a finite-dimensional vector space. The other snake identity shows that is nondegenerate in the other variable as well, so the maps to the dual space determined by this pairing are isomorphisms. In the standard algebraic terminology this is a Frobenius algebra.
Every positive finite dimension of a vector space occurs: take with coordinatewise multiplication and . The coordinate idempotents give and . If zero unital algebras are allowed, the zero object gives dimension zero too.
The pairing need not make a semisimple algebra. For example, the dual numbers with have pairing matrix
and coevaluation morphism . This pairing is nondegenerate over every field, despite the nilpotent ideal . Finite-dimensionality is the dimension conclusion; separability is not part of the given definition.
For an object of a braided monoidal category, take its self-braiding
It is invertible by definition. Suppress canonical associators using the monoidal coherence theorem, and put , . The hexagon identity gives
Apply naturality of this braiding to the morphism in its second argument. It says
Substitution gives
This is the equation for a Yang–Baxter operator. Restoring the uniquely determined associators gives the non-strict diagram in the paper. Every object therefore has the canonical Yang–Baxter operator supplied by its self-braiding.
The braid group has generators and relations
In the strict monoidal category , put and send
The images are invertible because the Yang–Baxter operator is invertible. Distant images commute by the tensor interchange law, and adjacent images satisfy the braid group relations by the Yang–Baxter operator equation tensored with the remaining identities. Thus these assignments define group homomorphisms , and hence a functor .
Juxtaposition of braids puts generators into the corresponding two blocks of tensor factors, so their images are the tensor products of their images. Strictness of gives and exactly. The resulting functor is strict monoidal and sends to .
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.
The induced internal hom for modules over a Hopf algebra on is
where both occurrences of have their left regular action. If is a morphism of left -modules, then
So every such morphism is an invariant vector of a module over a Hopf algebra.
For the converse, a calculation valid for every -linear is
If is invariant, its left-hand side is instead . Hence for all , which is precisely the R-module homomorphism condition.
In fact an endomorphism of the left regular module is determined by and has . Conversely each right multiplication map is left -linear. Thus the invariant space has the explicit description
As a vector space it is isomorphic to , and under composition its algebra is the opposite algebra . No dimension or semisimplicity hypothesis is needed.
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 diagrams
Together 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 to
The 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.
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.

Articles by others on the same topic (0)

There are currently no matching articles.