Braids and the Braid Group - Key Properties

The algebraic structure of braid groups reveals remarkable properties connecting topology, algebra, and geometry.

Theorem

Fundamental Properties of $B_n$ :

Non-commutativity: $B_n$ is non-abelian for $n \geq 2$
Torsion-free: No element except identity has finite order
Hopfian: Every surjective endomorphism is an automorphism
Bi-orderable: Admits left-invariant and right-invariant total orders
Linear: Admits faithful linear representations (Burau, Lawrence-Krammer)

The linear representation property (proven by Krammer-Bigelow, 2000) resolved a longstanding question and provides computational tools for braid equivalence.

Definition

The word problem for $B_n$ : Given two braid words $w_1, w_2$ in generators $\sigma_i^{\pm 1}$ , decide if they represent the same element.

Solutions:

Garside normal form: Every braid has unique canonical representation
Handle reduction algorithm: Systematically simplify braid diagrams
Linear representation: Check matrix equality in Lawrence-Krammer representation

The word problem for $B_n$ is decidable (Garside, 1969) with polynomial-time algorithms.

Example

Computing in $B_3$ : Simplify $\sigma_1 \sigma_2 \sigma_1 \sigma_2^{-1} \sigma_1^{-1}$ :

Using braid relation $\sigma_1 \sigma_2 \sigma_1 = \sigma_2 \sigma_1 \sigma_2$ : $\sigma_1 \sigma_2 \sigma_1 \sigma_2^{-1} \sigma_1^{-1} = \sigma_2 \sigma_1 \sigma_2 \sigma_2^{-1} \sigma_1^{-1} = \sigma_2 \sigma_1 \sigma_1^{-1} = \sigma_2$

Garside normal form confirms this is $\sigma_2$ in canonical form.

Theorem

Garside Structure: $B_n$ is a Garside group with Garside element: $\Delta = (\sigma_1)(\sigma_2 \sigma_1)(\sigma_3 \sigma_2 \sigma_1) \cdots (\sigma_{n-1} \cdots \sigma_2 \sigma_1)$

Properties:

$\Delta^2$ generates the center $Z(B_n)$
Every braid has form $\Delta^k \cdot w$ where $w$ is positive
Provides canonical normal form for computational purposes

Remark

The Garside structure generalizes to Garside monoids and Garside groups, a rich framework in combinatorial group theory. Other examples include Artin groups of finite type and certain mapping class groups.

Applications include:

Efficient word problem algorithms
Computing centralizers and conjugacy classes
Understanding subgroup structure

Definition

The pure braid group $P_n \subset B_n$ consists of braids where each strand returns to its original position (top $i$ connects to bottom $i$ ).

Structure:

$P_n$ is the kernel of the homomorphism $B_n \to S_n$ (permutation induced by braid)
Exact sequence: $1 \to P_n \to B_n \to S_n \to 1$
$P_n$ is generated by elements $A_{i,j} = \sigma_{j-1} \cdots \sigma_{i+1} \sigma_i^2 \sigma_{i+1}^{-1} \cdots \sigma_{j-1}^{-1}$

For $n=3$ : $P_3 = \langle A_{1,2}, A_{1,3}, A_{2,3} \mid [A_{1,2}, A_{1,3}] = [A_{2,3}, A_{1,3}] = 1 \rangle$ (partially abelian)

Example

The configuration space interpretation: $B_n$ is the fundamental group of the configuration space of $n$ distinct points in $\mathbb{R}^2$ : $B_n = \pi_1(\{(z_1, \ldots, z_n) \in \mathbb{C}^n : z_i \neq z_j \text{ for } i \neq j\} / S_n)$

This geometric perspective connects braid groups to topology of configuration spaces, homotopy theory, and algebraic topology.

Theorem

Jones Representation: The Temperley-Lieb algebra $TL_n(q)$ admits a representation of $B_n$ given by: $\rho(\sigma_i) = A + A^{-1} E_i$

where $E_i$ are Temperley-Lieb generators satisfying $E_i^2 = \delta E_i$ for suitable $\delta$ .

Taking traces gives the Jones polynomial: $V_K(t) = \text{Tr}(\rho(\beta))$ for braid $\beta$ with closure $K$ .

These properties establish braid groups as fundamental objects bridging pure mathematics (group theory, topology) and applications (statistical mechanics, quantum computation).