---
title: Crossing Matrix of a Braid
url: https://www.emergentmind.com/topics/crossing-matrix-of-a-braid
type: topic
---

# Crossing Matrix of a Braid

A crossing matrix encodes the signed intersection pattern of strands in a braid; it provides an integral matrix model that is functorial with respect to braid composition and robust under braid group relations. The crossing matrix is a key algebraic and combinatorial invariant in the structure theory of braid groups, with applications ranging from braid group representations to link invariants, and, more recently, surface braid systems and quantum information.

## 1. Definition and Construction

Let $b \in \mathfrak B_n$ be a braid in the $n$-strand Artin braid group, presented diagrammatically with strands labeled $1$ to $n$ at the top and bottom. The crossing matrix $C(b)$ is the $n \times n$ integer matrix whose off-diagonal entries
\[
C(b)_{ij} = \bigl(\#\text{positive crossings where $i$ passes over $j$}\bigr) - \bigl(\#\text{negative crossings where $i$ passes over $j$}\bigr)
\]
record the algebraic number of signed overcrossings from strand $i$ to strand $j$. The diagonal entries vanish: $C(b)_{ii} = 0$. This matrix is independent of the chosen diagram due to invariance under the Artin braid relations $\sigma_i \sigma_i^{-1} = 1$, $\sigma_i \sigma_j = \sigma_j \sigma_i$ $(|i-j|>1)$, and $\sigma_i \sigma_{i+1} \sigma_i = \sigma_{i+1} \sigma_i \sigma_{i+1}$ [2509.08464, 2601.02323, 2511.20356].

Given a braid word $b = \sigma_{i_1}^{\varepsilon_1} \ldots \sigma_{i_k}^{\varepsilon_k}$, $C(b)$ is constructed by sequentially inserting, for each letter, a $+1$ (resp. $-1$) in the $(i,i+1)$ (resp. $(i+1,i)$) position for $\sigma_i$ (resp. $\sigma_i^{-1}$), under the current permutation of strands induced so far in the word [2511.20356].

## 2. Algebraic Properties and Functoriality

The crossing matrix induces a crossed homomorphism $C: \mathfrak{B}_n \to \operatorname{Mat}^0_n(\mathbb{Z})$, reflecting the semidirect product structure of $B_n$ with the natural $S_n$-action:
\[
C(b_1 b_2) = C(b_1) + \rho(b_1)(C(b_2))
\]
where $\rho(b)$ is the permutation of $S_n$ induced by $b$, acting on matrices by simultaneous permutation of rows and columns. Under conjugation,
\[
C(\gamma b \gamma^{-1}) = |\gamma|(C(b))
\]
where $|\gamma|$ acts as a permutation matrix on the indices [2511.20356, 1805.12189].

When restricted to the pure braid group $P_n = \ker(\rho)$, $C$ is a genuine homomorphism to symmetric zero-diagonal integer matrices, and provides the abelianization of $P_n$, with kernel $[P_n, P_n]$ [1805.12189].

## 3. Characterization and Classification

For general braids, every crossing matrix decomposes as $A = S + R$ where $S$ is symmetric zero-diagonal (from the pure component), and $R$ is a strictly upper-triangular 0–1 matrix associated with permutation braids, subject to Thurston’s T0 and T1 axioms:
- (T0): $R_{ik}=0$ and $R_{kj}=0$ $\implies R_{ij}=0$ for all $i<k<j$
- (T1): $R_{ik}=R_{kj}=1$ $\implies R_{ij}=1$

A matrix $A$ is the crossing matrix of some $b\in B_n$ if and only if such a decomposition exists [1805.12189].

For positive pure braids, $C$ is nonnegative, symmetric, and satisfies T0. For $n\leq6$, such matrices coincide with realizable crossing matrices of positive pure braids. The T0 condition reflects transitive-exclusion: if strands $i$ and $j$, and $j$ and $k$ do not cross, then neither can $i$ and $k$ [2506.08659, 2502.16035].

## 4. Invariants Derived from the Crossing Matrix

Several braid invariants are constructed from $C(b)$:
- **Exponent sum ("writhe")**: $\mathrm{tr}\, C(b)$
- **Purified determinant** $P(b)$: for $b$ with induced permutation of order $r$, $P(b)=\det(C(b^r))$, which is a conjugacy invariant and satisfies $P(b_1 b_2) = P(b_2 b_1)$ [2509.08464]
- **Characteristic polynomial**: $P(b)=\det(xI_n-C(b^r))$, yielding a multiset of eigenvalues; invariance holds under conjugation, and its essential eigenvalues are stable under Hurwitz moves in braid systems [2601.02323]
- **Johnson homomorphism**: $C(b)$, when suitably mapped, yields the extended first Johnson homomorphism $\tau_1^{\theta}$ [2511.20356].

## 5. Connections to Braid Group Representations

Path-analyzing and quantum representations encode the combinatorics of crossings via generalized crossing matrices:
- In Pourkia’s construction, matrices with entries in $\mathbb{Z}[t^{\pm1},b^{\pm1}]$ capture the path history of each strand; the unreduced Burau representation is obtained for suitable parameter specialization [1811.09809].
- In quantum topology, each over-crossing is replaced by a Yang–Baxter $R$-matrix acting on tensor powers of $\mathbb{C}^2$; the full “crossing matrix” is the ordered product of these operators, yielding a unitary representation of the braid group [1403.2524].

## 6. Applications: Braid and Link Invariants, Surface Braids, and Decision Problems

Crossing matrices play a pivotal role in:
- **Algorithmic braid recognition**: Algorithms exist to construct all positive braid words yielding a given matrix or detect non-realizability via T0 violations [1805.12189]
- **Surface braids and surface links**: Crossing matrices, via their characteristic polynomials, produce invariants for braid systems up to Hurwitz equivalence; essential eigenvalues detect the necessity of Euler fusion/fission steps in surface link equivalence [2601.02323]
- **Link theory**: While the determinant $P(b)$ generally does not descend to a link invariant due to non-invariance under Markov moves, the construction suggests enhancements for link invariance [2509.08464]

## 7. Realizability and Structural Characterization

Matrix models such as the CN matrix and OU matrix are derived from or related to the crossing matrix:
- **CN matrix**: For a braid projection, the symmetric, zero-diagonal matrix of total crossings between strand pairs, characterized for pure 6-braids as even, nonnegative, T0 matrices [2506.08659]
- **OU matrix**: Number of over-crossings (ignoring sign), with characterization via symmetrization and T0 [2502.16035]
- **Positive braids**: Crossing matrices further constrained to be nonnegative and admit a recursive decomposition into contribution of elementary generators, yielding an effective realization algorithm [1805.12189]

These frameworks provide necessary and sufficient conditions for the existence of a braid diagram corresponding to a given crossing matrix for pure and positive braids up to $n=6$; for larger $n$, the T0-based criteria and their generalizations remain conjectural.

---

**References**:  
Key foundational results and recent advances on the crossing matrix and related invariants are found in [2509.08464], [2511.20356], [2601.02323], [2506.08659], [2502.16035], and [1805.12189]. For connections to quantum representations, see [1811.09809] and [1403.2524].

Source: https://www.emergentmind.com/topics/crossing-matrix-of-a-braid