The braid group is one of the places where group theory, low-dimensional topology and knot theory meet. Artin introduced it in 1925 (E. Artin, Theorie der Zöpfe, Abh. Math. Sem. Univ. Hamburg 4 (1925), 47–72) and returned to it in 1947; since then it has become standard equipment in the study of links (closed braids and Markov's theorem), of mapping class groups of punctured surfaces, and of configuration spaces. Birman's Braids, Links, and Mapping Class Groups (Annals of Mathematics Studies 82, Princeton University Press, 1974) is the classical reference that develops all three subjects from the braid group outwards, and its Chapter 1 is the foundation on which the rest of the book rests.
The chapter's structure is itself the reason to formalize it first: everything later in the book — the closed-braid picture of links, Markov's theorem, the Magnus representations, the mapping class group of the punctured sphere — is phrased in terms of the group and of the presentation established here. A mission that fixes faithful Lean definitions of the configuration spaces and of the abstract braid group therefore fixes the vocabulary for the whole series.
Timeline of the results collected here: Artin (1925) gave the presentation and the characterization of braid automorphisms of a free group; Chow (1948) determined the centre; Fadell–Neuwirth (1962) introduced the configuration-space fibrations, and Fadell–Van Buskirk (1962) used them to give the proof of the presentation reproduced by Birman.
Write for the Euclidean plane, identified throughout with the complex numbers . For let
be the ordered configuration space of points in the plane, topologized as a subspace of . The symmetric group acts on it by permuting coordinates; the quotient
with the quotient topology, is the unordered configuration space. A point of is an unordered set of distinct points of the plane. The base configuration is , and all fundamental groups below are taken at or at its image.
The braid group of the plane is : a loop is a motion of points of the plane returning to the same set of points, and homotopy classes of such motions compose as braids. The pure braid group is , the subgroup of motions returning each point to its own starting position.
Separately, let denote the abstract group given by generators subject to
These are equations (1-1) and (1-2) of the book (p. 11). Geometrically interchanges the -th and -st points along a semicircle.
The group of motions of points of the plane is the group with generators and the two families of relations above: the relations are not only valid but defining.
The milestone list follows the chapter: the covering-space description of the projection (Proposition 1.1, p. 11), the Fadell–Neuwirth exact sequence (Theorem 1.4, p. 14), the semidirect-product decomposition of the pure braid group (Corollary 1.8.1, p. 24), the faithful representation of by automorphisms of a free group (Corollary 1.8.3, p. 25), the centre of (Corollary 1.8.4, p. 28, due to Chow), and Artin's algebraic characterization of the braid automorphisms (Theorem 1.9, p. 30).
Theorem 1.8 is what makes the braid group computable: with defining relations in hand one can combine braids into the normal form of Corollary 1.8.2 and solve the word problem, represent braids by automorphisms of a free group, and pass to the link-theoretic material of Chapters 2 and 5 where braid words, not motions, are the objects manipulated. Corollary 1.8.3 turns braids into concrete data — a braid is determined by what it does to the generators of a free group — and Theorem 1.9 says exactly which endomorphisms arise this way; both are the algebraic engine behind the conjugacy-problem and Magnus-representation chapters.
For formalization the state of play is that Mathlib has free groups, presented groups, the fundamental groupoid and fundamental group, covering maps and fibre bundles, but no braid groups and no configuration spaces: nothing here can be assembled from existing declarations. The mission therefore produces reusable infrastructure — configuration spaces of the plane, the symmetric-group quotient, the Artin presentation, the Artin action on a free group — as well as machine-checked proofs of results that are classical but, as far as the mission's search of the library showed, not yet formalized in Mathlib.
The generators and relations are easy to write down and easy to verify in ; what is hard is completeness, i.e. that no further relations are needed. The naive route — draw the braid, push it into a normal form by hand — is exactly what a formal proof cannot do. The Fadell–Van Buskirk argument reproduced by Birman instead runs an induction on driven by the fibration : its homotopy exact sequence gives a split extension of by a free group, presentations are assembled along the extension, and finally the covering with deck group transfers the answer from the pure braid group to the full braid group. Each of those steps needs genuine algebraic topology — local triviality of the projection, exactness of the homotopy sequence, freeness of of a punctured plane — which is where the formalization work actually lies.
The plane is . is the subtype of injective functions
; is its quotient by the equivalence "differ by
precomposition with a permutation", with the quotient topology. Base point: the configuration
, i.e. , and its image. Fundamental groups are Mathlib's
FundamentalGroup at those base points. Braid generators are indexed by
with -based indices ( stands for ), and free-group generators by
; the abstract braid group is a PresentedGroup on that index set. Truncated
subtraction makes the generator set empty for , so and are trivial, as
intended. Two milestones are stated with the shift (i.e. for the projection
) to avoid truncated subtraction in the maps.
Two conventions are worth flagging because they weaken what the Lean text asserts relative to the prose. First, the goal asserts the existence of some isomorphism ; it does not pin the isomorphism down on the geometric generators of Figure 2, since those loops are not part of the formal development. Second, Artin's representation is formalized as the existence of a homomorphism from to the automorphism group of the free group whose value on each is the explicit endomorphism of equation (1-14), together with its injectivity; Theorem 1.9 is then stated for an arbitrary such , given as a hypothesis, and is non-vacuous precisely because Corollary 1.8.3 supplies one.
No trivializing formalization is available: the goal is an isomorphism statement between two groups that are both defined independently of it, and the degenerate cases (both sides trivial) are genuine special cases of it, not the content.
Infrastructure a complete development needs, all reusable: freeness of of a punctured plane, local triviality of the Fadell–Neuwirth projection, the homotopy exact sequence of a fibration in the range needed, presentations of split extensions, and the transfer of a presentation along a regular covering. Contributions of any of these as standalone lemmas are welcome, as is a formalization of the geometric generators (1-9) that would let the goal be strengthened to pin the isomorphism on .
namespace BraidsLinksMCG
theorem thm_1_8_artin_presentation (n : ℕ) :
Nonempty (ArtinBraidGroup n ≃* GeomBraidGroup n) := by sorry
end BraidsLinksMCG
Theorem 1.8 (Artin, 1925). The group admits a presentation with generators and defining relations
Equivalently, the abstract group defined by that presentation is isomorphic to the fundamental group of the space of unordered -point subsets of the plane, i.e. to the group of braids on strands. The relations are easily seen to hold between the elementary braids ; 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 at the base configuration . It does not additionally require the isomorphism to carry to the specific geometric generator of Figure 2, since those loops are not part of the formal development.
No open leaves. Every sub-goal is proved or awaiting decomposition.