= Solution
Use right <comodules> with <coaction> $u\mapsto\sum u_{(0)}\otimes u_{(1)}$. Fix the convention that $\diamond$ is induced by $m$ and $\bullet$ by $n$. 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> $\gamma:H\otimes H\to k$, and its components have the <comodule tensor transformation formula>
$$
\boxed{\varphi_{M,N}(u\otimes v)=\sum u_{(0)}\otimes v_{(0)}\gamma(u_{(1)},v_{(1)}).}
$$
To prove the assertion, set $\gamma=(\varepsilon\otimes\varepsilon)\varphi_{H,H}$. On the cofree <comodules> $V\otimes H,W\otimes H$, <naturality> with respect to $h\mapsto v\otimes h$ forces the component to act as $\varphi_{H,H}$ on the two $H$ factors. Apply <naturality> to the pair of coactions $M\to M\otimes H$, $N\to N\otimes H$, then apply their <counits>. This yields the formula. Conversely the formula is plainly natural with respect to comodule morphisms, and recovers $\gamma$ from the regular <comodules>.
It remains to impose exactly three kinds of equations. First, the component must be $H$-colinear from the tensor with product $n$ to the tensor with product $m$. Expanding its two coactions gives \b[(C)], the <multiplication compatibility for a comodule tensor transformation>
$$
\boxed{\sum m(a_{(1)},b_{(1)})\gamma(a_{(2)},b_{(2)})=\sum\gamma(a_{(1)},b_{(1)})n(a_{(2)},b_{(2)}).}
$$
Necessity follows by taking $M=N=H$ and applying the two <counits>; sufficiency follows by substituting the identity into the coaction formula for arbitrary $M,N$.
Second, the two unit triangles in the preceding part are exactly \b[(U)]:
$$
\boxed{\gamma(1,a)=\varepsilon(a),\qquad\gamma(a,1)=\varepsilon(a).}
$$
Here $1=j(1_k)$ 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 \b[(A)]:
$$
\boxed{\sum\gamma(m(a_{(1)},b_{(1)}),c)\gamma(a_{(2)},b_{(2)})=\sum\gamma(a,m(b_{(1)},c_{(1)}))\gamma(b_{(2)},c_{(2)}).}
$$
The product in this expression is $m$, because the intermediate arguments $M\diamond N$ and $N\diamond P$ 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 $n$:
$$
\sum\gamma(a_{(1)},b_{(1)})\gamma(n(a_{(2)},b_{(2)}),c)=\sum\gamma(b_{(1)},c_{(1)})\gamma(a,n(b_{(2)},c_{(2)})).
$$
This is the normalized <bialgebra scalar cocycle> equation for that convention.
\b[Thus the required structures correspond bijectively to all linear maps $\gamma$ 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 $\gamma$ is invertible under the <convolution product for coalgebra maps> on $\operatorname{Hom}_k(H\otimes H,k)$. Its convolution inverse $\bar\gamma$ 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
$$
\boxed{n(a,b)=\sum\bar\gamma(a_{(1)},b_{(1)})m(a_{(2)},b_{(2)})\gamma(a_{(3)},b_{(3)}).}
$$
This also records which multiplication lies on each side of the twist. Interchanging the names of $m,n$ interchanges the two tensor conventions, rather than silently changing the equation.
For a concrete lax example, take the two-dimensional <bialgebra> with basis $1,e$, product $e^2=e$, and $\Delta(e)=e\otimes e$, $\varepsilon(e)=1$. Set $m=n$ and $\gamma(1,1)=\gamma(1,e)=\gamma(e,1)=1$, $\gamma(e,e)=0$. Normalization and (C) hold, and (A) follows by checking the eight basis triples: triples involving $1$ reduce to normalization, and the triple $(e,e,e)$ has both sides zero. But the $(e,e)$ tensor component is zero, so this <lax monoidal functor> is not strong.
Back to article page
