The natural homomorphism sending to a transposition
ProvedBraidsLinksMCG.braid_perm_homEvery braid has an underlying permutation of its strands, and this assignment is a group homomorphism.
Let be the abstract braid group with Artin generators and defining relations
and let be the symmetric group on the strand labels . The assertion is that there exists a group homomorphism
sending each elementary braid to the transposition of the two strands it interchanges. Equivalently, the transpositions satisfy Artin's two families of relations in , so the assignment on generators extends to the whole group.
This homomorphism is the algebraic counterpart of the map that records, for a motion of points of the plane, the permutation by which the points are rearranged; its kernel is the pure braid group. It is the basic tool for separating a braid's combinatorial shadow from its genuinely braided content, and it is used whenever a statement about is reduced to the corresponding statement about pure braids.
Formalization Note Braid generators are indexed by with truncated subtraction, the index standing for the book's ; strandIdx i and strandIdxSucc i are the two strand labels and in that the generator interchanges. The statement is existential because the homomorphism is being constructed, and it is pinned down uniquely by its values on the generators, which generate the group.
import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup import Definitions.Def_BraidsLinksMCG_ArtinEndo
namespace BraidsLinksMCG
theorem braid_perm_hom (n : ℕ) :
∃ pi : ArtinBraidGroup n →* Equiv.Perm (Fin n),
∀ i : Fin (n - 1), pi (sigma i) = Equiv.swap (strandIdx i) (strandIdxSucc i) := by sorry
end BraidsLinksMCG