Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.8 (Artin, 1925): Bn≅π1B0,nE2B_n \cong \pi_1 B_{0,n}E^2Bn​≅π1​B0,n​E2

Proved
BraidsLinksMCG.thm_1_8_artin_presentation

by LG · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-topologybraid-groupsgroup-theory

Theorem 1.8 (Artin, 1925). The group π1B0,nE2\pi_1 B_{0,n}E^2π1​B0,n​E2 admits a presentation with generators σ1,…,σn−1\sigma_1, \dots, \sigma_{n-1}σ1​,…,σn−1​ and defining relations

σiσj=σjσi(∣i−j∣≥2, 1≤i,j≤n−1),σiσi+1σi=σi+1σiσi+1(1≤i≤n−2).\sigma_i\sigma_j = \sigma_j\sigma_i \quad (|i-j| \ge 2,\ 1 \le i, j \le n-1), \qquad \sigma_i\sigma_{i+1}\sigma_i = \sigma_{i+1}\sigma_i\sigma_{i+1} \quad (1 \le i \le n-2).σi​σj​=σj​σi​(∣i−j∣≥2, 1≤i,j≤n−1),σi​σi+1​σi​=σi+1​σi​σi+1​(1≤i≤n−2).

Equivalently, the abstract group BnB_nBn​ defined by that presentation is isomorphic to the fundamental group of the space of unordered nnn-point subsets of the plane, i.e. to the group of braids on nnn strands. The relations are easily seen to hold between the elementary braids σi\sigma_iσi​; the content of the theorem is that they are defining, so that every relation between braids is a consequence of them.

The formal statement asserts the existence of a group isomorphism between the presented group and π1B0,nE2\pi_1 B_{0,n}E^2π1​B0,n​E2 at the base configuration (1,2,…,n)(1,2,\dots,n)(1,2,…,n). It does not additionally require the isomorphism to carry σi\sigma_iσi​ to the specific geometric generator of Figure 2, since those loops are not part of the formal development.

Preamble
import Mathlib
import Definitions.Def_BraidsLinksMCG_ArtinBraidGroup
import Definitions.Def_BraidsLinksMCG_ConfigSpace
Formal statement
namespace BraidsLinksMCG

theorem thm_1_8_artin_presentation (n : ℕ) :
    Nonempty (ArtinBraidGroup n ≃* GeomBraidGroup n) := 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, p. 18, Theorem 1.8 [Artin, 1925]; relations (1-1), (1-2) on p. 11
Read-back

What the Lean code literally says, in plain math · self-authored-by-drafting-agent (non-blind)

Provenance: non-blind read-back. This read-back was written by the same agent that drafted the Lean statements in this proposal, not by an independent auditor with a fresh context. It is therefore not independent testimony and must not be treated as such: it cannot be relied on to catch an unfaithful formalization, because any misunderstanding in the draft is reproduced here. Please audit the Lean text directly, or obtain a genuinely blind read-back, before confirming the item.

The statement is a single assertion, quantified over every natural number n≥0n \ge 0n≥0:

there exists a group isomorphism   Bn  → ∼   π1(Cn, zˉ 0),\textbf{there exists a group isomorphism } \; B_n \;\xrightarrow{\ \sim\ }\; \pi_1\bigl(C_n,\ \bar z^{\,0}\bigr),there exists a group isomorphism Bn​ ∼ ​π1​(Cn​, zˉ0),

where the two sides are the following.

Left-hand side. BnB_nBn​ is the group presented by the generator set {0,1,…,n−2}\{0, 1, \dots, n-2\}{0,1,…,n−2} — empty when n≤1n \le 1n≤1 — subject to the relations sisjsi−1sj−1s_is_js_i^{-1}s_j^{-1}si​sj​si−1​sj−1​ for all pairs of indices with ∣i−j∣≥2|i-j| \ge 2∣i−j∣≥2, and sisjsi(sjsisj)−1s_is_js_i(s_js_is_j)^{-1}si​sj​si​(sj​si​sj​)−1 for all pairs with j=i+1j = i+1j=i+1; formally, the free group on that index set modulo the normal closure of those words.

Right-hand side. CnC_nCn​ is the quotient of Fn={ p:{0,…,n−1}→C:p injective }⊆CnF_n = \{\,p : \{0,\dots,n-1\} \to \mathbb{C} : p \text{ injective}\,\} \subseteq \mathbb{C}^nFn​={p:{0,…,n−1}→C:p injective}⊆Cn by the relation "q=p∘gq = p \circ gq=p∘g for some permutation ggg", with the quotient topology, and zˉ 0\bar z^{\,0}zˉ0 is the class of the configuration (1,2,…,n)(1, 2, \dots, n)(1,2,…,n). The group is the fundamental group of CnC_nCn​ at zˉ 0\bar z^{\,0}zˉ0: homotopy classes rel endpoints of loops at that point.

Exact logical strength. The claim is only that the set of isomorphisms between these two groups is non-empty. No isomorphism is named, no compatibility is required between the generators σi\sigma_iσi​ of the presented group and any particular loop in CnC_nCn​, and no naturality in nnn is required. In particular, any statement about which element of the fundamental group corresponds to σi\sigma_iσi​ is outside the assertion.

Degenerate cases. The quantifier includes n=0n = 0n=0 and n=1n = 1n=1: there the generator set is empty, so BnB_nBn​ is trivial, and CnC_nCn​ is a one-point space, respectively C\mathbb{C}C, so the fundamental group is trivial as well; the claim is true but empty of content there. It also includes n=2n = 2n=2, where B2B_2B2​ is infinite cyclic.

Human review
  • Endorsed by Shuze Chen · Sep 13, 2026

  • Endorsed by LG · Sep 13, 2026

    Confirmed by the mission captain (proposal self-audit).

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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me