Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 2 3 b Solution Created 2026-10-03 Updated 2026-10-14
For an invertible braiding satisfying the braid equation on , begin with the free associative algebra over a field on matrix coefficients , with and . Impose precisely the coefficients ofThis quotient is the FRT bialgebra, or Faddeev-Reshetikhin-Takhtajan construction. The relations form a coideal because composing two coactions that preserve again preserves ; the trivial coaction also preserves it, so the counit descends. Universality follows because any such coaction must satisfy exactly these coefficient relations.
For the given , take , , , . Thus and . The coefficient relations, after cancellation of , areThese are exactly the defining relations of in the inverse-parameter convention of Question 1, without setting the quantum determinant equal to one. They therefore define mutually inverse algebra homomorphisms: each named generator maps to the corresponding , and conversely. The matrix comultiplication and counit are the same, so the isomorphism is also one of bialgebras.
Here is the requested check of directly from . Apply colinearity to and compare the coefficient of . On the left, , giving . On the right, the corresponding term of is , and . Hence , proving the relation. The other coefficient comparisons give the remaining displayed relations; no additional determinant relation is imposed in an FRT bialgebra.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 2 3 c Solution 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.