A combinatorial proof for Artin's presentation of the braid group \(B_ n\) and some cyclic analogue (Q2367084)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A combinatorial proof for Artin's presentation of the braid group \(B_ n\) and some cyclic analogue
scientific article

    Statements

    A combinatorial proof for Artin's presentation of the braid group \(B_ n\) and some cyclic analogue (English)
    0 references
    0 references
    23 August 1993
    0 references
    In the first part of the paper the author proposes a new short algebraic proof of the following well-known Theorem of Artin. The group of braids with \(n + 1\) strings \(B_{n+1}\) has the presentation \[ \langle \sigma_ 1, \dots, \sigma_ n: \sigma_ i\sigma_ j\sigma_ i = \sigma_ j\sigma_ i\sigma_ j \quad (| i-j| = 1), \quad \sigma_ i\sigma_ j = \sigma_ j\sigma_ i \quad (| i-j| \neq 1)\rangle. \] Put \(\pi = \sigma_ 1 \sigma_ 2 \dots \sigma_{n-1}\sigma^ 2_ n\), \(\delta = \pi^{-1} \sigma_ 1 \pi\). Set \(C^*_{n+1} = \langle \beta_ 1 ,\dots, \beta_ n\); \(\beta_ i \beta_ j \beta_ i = \beta_ j \beta_ i \beta_ j\) \((| i-j| = 1)\), \(\beta_ i \beta_ j = \beta_ j \beta_ i\) \((| i-j| \neq 1)\rangle\). Let \(\mathbb{Z}\) be an infinite cyclic group \(\langle \xi\rangle\), \(B^*_{n+1}\) be the semidirect product \(\mathbb{Z} \ltimes C^*_{n+1} = \langle \mathbb{Z}\), \(C^*_{n+1}\); \(\xi \beta_ i \xi^{-1} = \beta_{i+1}\) \((i = 1,\dots,n)\), \(\xi\beta_ n\xi^{-1} = \beta_ 1\rangle\). Let \(\chi_{n+1}: B_{n+1} \to S_{n+1}\) be the natural homomorphism of \(B_{n+1}\) onto the symmetric group on the letters \((1,\dots, n+1)\). Set \(B^ 0_{n+1} = \chi^{-1}_{n+1}(S_ n)\), \(C^ 0_{n+1} = \langle B_ n,\delta\rangle \subset B_{n+1}\). It is proved in the second part of the paper that the mapping \(\varphi: \sigma_ i \to \beta_ i\), \(\pi \to \xi\) determines isomorphisms \(C^ 0_{n+1} \cong C^*_{n+1}\), \(B^ 0_{n+1} \cong B^*_{n+1}\).
    0 references
    0 references
    group of braids
    0 references
    presentation
    0 references
    0 references