Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The Artin representation is faithful on pure braids

Open
BraidsLinksMCG.artin_faithful_on_pure_braids

by Gabewhigham · Sep 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-topologybraid-groupsgroup-theory

This is the substantive half of the faithfulness of the Artin representation.

Let ξ:Bn→Aut⁡(Fn)\xi : B_n \to \operatorname{Aut}(F_n)ξ:Bn​→Aut(Fn​) be the Artin representation, given on the generators by equation (1-14),

ξ(σi):xi↦xixi+1xi−1,xi+1↦xi,xk↦xk (k≠i,i+1),\xi(\sigma_i) : x_i \mapsto x_i x_{i+1} x_i^{-1}, \qquad x_{i+1} \mapsto x_i, \qquad x_k \mapsto x_k\ (k \neq i, i+1),ξ(σi​):xi​↦xi​xi+1​xi−1​,xi+1​↦xi​,xk​↦xk​ (k=i,i+1),

and let π:Bn→Σn\pi : B_n \to \Sigma_nπ:Bn​→Σn​ be the homomorphism sending σi\sigma_iσi​ to the transposition (i,i+1)(i,i+1)(i,i+1), whose kernel is the pure braid group PnP_nPn​. The assertion is that a pure braid acting trivially on the free group is trivial: if β∈Bn\beta \in B_nβ∈Bn​ satisfies

ξ(β)=idFnandπ(β)=id,\xi(\beta) = \mathrm{id}_{F_n} \quad\text{and}\quad \pi(\beta) = \mathrm{id},ξ(β)=idFn​​andπ(β)=id,

then β=1\beta = 1β=1.

Together with the fact that the underlying permutation of a braid can be recovered from its action on FnF_nFn​, this yields the injectivity of ξ\xiξ on all of BnB_nBn​, i.e. Corollary 1.8.3: a braid is completely determined by the automorphism of the free group it induces. Restricting attention to pure braids is what makes the statement amenable to the inductive treatment of PnP_nPn​ furnished by the Fadell-Neuwirth fibrations and the semidirect-product decomposition of Corollary 1.8.1.

Formalization Note The representation ξ\xiξ and the permutation homomorphism π\piπ are supplied as hypotheses together with their values on the Artin generators, which determine them uniquely. The hypothesis π(β)=id\pi(\beta) = \mathrm{id}π(β)=id expresses that β\betaβ lies in the pure braid subgroup.

Preamble
import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup
import Definitions.Def_BraidsLinksMCG_ArtinEndo
Formal statement
namespace BraidsLinksMCG

theorem artin_faithful_on_pure_braids (n : ℕ)
    (xi : ArtinBraidGroup n →* MulAut (FreeGroup (Fin n)))
    (hxi : ∀ i : Fin (n - 1), ∀ w : FreeGroup (Fin n), xi (sigma i) w = artinEndo n i w)
    (pi : ArtinBraidGroup n →* Equiv.Perm (Fin n))
    (hpi : ∀ i : Fin (n - 1), pi (sigma i) = Equiv.swap (strandIdx i) (strandIdxSucc i))
    (b : ArtinBraidGroup n) (hb : xi b = 1) (hperm : pi b = 1) : b = 1 := by sorry

end BraidsLinksMCG
Source
Joan S. Birman, *Braids, Links, and Mapping Class Groups*, Annals of Mathematics Studies 82, Princeton University Press, 1974, Chapter 1, Corollary 1.8.3, p. 25 (faithfulness of the representation (1-14)), restricted to the pure braid group of Corollary 1.8.1, p. 24

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me