Braid group Created 2026-10-06 Updated 2026-11-05
For , the braid group consists geometrically of braids on strands, composed by stacking. Algebraically it is generated by subject to the braid group relations: adjacent generators obey , and nonadjacent generators commute. There is no relation .
Recording only the strand endpoints gives a surjective group homomorphism , sending to the transposition . Its group kernel is the pure braid group, whose strands return to their original endpoints. Thus endpoint permutations discard crossing information. For example, has one generator and no relations, so it is an infinite cyclic group, while its endpoint permutation group is ; the square of its generator has trivial endpoint permutation but is a nontrivial braid. This distinction does not conflict with Cayley's theorem, which realizes every group as some permutation group.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 122 1 b Solution Created 2026-10-03 Updated 2026-10-06
Define the length of a formal tensor expression recursively byThe 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, andon 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 isomorphismobtained 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.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 122 4 a ii Solution Created 2026-10-03 Updated 2026-10-06
The braid group has generators and relationsIn the strict monoidal category , put and sendThe 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 .