Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2007/iii/paper-2/3/c/solution
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 2 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
With the right-comodule braiding convention in part (a), the defining formula isConsequently the scalar form on generators is the following table, with row the first argument and column the second:For example, the extra component of is . The other off-diagonal component gives .
For arbitrary elements of the FRT bialgebra, extend this table by bilinearity, the unit rule , andThese are an explicit recursive algorithm for any two words in the generators, so the table determines the entire cobraiding. The braid equation for ensures the algorithm annihilates the defining coefficient relations in either argument: moving one crossing past two successive crossings gives precisely the two reductions of a quadratic colinearity relation. Thus it descends from the free algebra over a field to the FRT bialgebra. For the convolution inverse, use the inverse of , where flips the tensor factors: its coefficients are . Equivalently, in the flipped coefficient formula use , not alone. This gives , , , and all other generator values zero. This specifies the coquasitriangular structure completely, not just its values on degree-one elements.
New to topics? Read the docs here!