A braid on strands is the everyday object it sounds like: strings hanging between two horizontal plates, each string descending monotonically, no two strings meeting. Emil Artin turned this picture into algebra in 1925 by showing that braids form a group under concatenation and that this group has a finite presentation with generators. The braid groups sit at the crossroads of low-dimensional topology (they are the mapping class groups of punctured discs, and closures of braids produce every link), of algebra (they are the prototypical Artin–Tits groups, torsion-free and orderable), and of representation theory and mathematical physics through the Burau, Lawrence– Krammer and Temperley–Lieb representations.
This mission formalizes the braid-group development of a 2023 master's dissertation, Alexsander Andrey Gomes Tarcha's Um Estudo Introdutório da Teoria de Tranças (UNESP, Rio Claro), whose capstone is Teorema 3.15: the braid group on strands admits Artin's presentation. The dissertation builds the group structure on equivalence classes of geometric braids (Teorema 3.9), shows that the Artin generators generate (Teorema 3.11), derives the braid and commutation relations (Proposição 3.14), establishes the presentation (Teorema 3.15), and closes with two structural properties: the full twist is central (Proposição 3.16) and embeds in for (Proposição 3.17).
Work in the plane . The ordered configuration space
carries the subspace topology of , and the symmetric group acts on it by permuting coordinates. The unordered configuration space carries the quotient topology; its points are the -element subsets of the plane. The base configuration is , and denotes its class in . The geometric braid group is
a loop of -point configurations being exactly a geometric braid, and homotopy of loops being exactly the equivalence by elementary moves used in the dissertation.
The elementary half-twist , for , is the loop that rotates the two base points and by the angle about their midpoint , leaving the other points fixed:
It returns to the base configuration at with the two moving points interchanged, so it is a loop in and defines a class in .
The abstract braid group is the group presented by generators subject to
This is the statement the dissertation actually proves: the map of its proof is defined on generators by , and the work consists in showing that it is a well-defined homomorphism which is surjective and injective. Asking only for an abstract isomorphism would leave the generators unconstrained; naming their images is what makes the presentation usable downstream.
Artin's presentation is what makes the braid groups computable: the word problem, the Burau and Lawrence–Krammer representations, the Markov moves on braid closures, and the Garside normal form all start from generators and relations, while the topological side supplies the meaning of those generators. A formalization that only exhibits an abstract isomorphism cannot be used to compute with a given geometric braid; the version stated here transports each half-twist loop to a generator word, which is what downstream work needs.
On the formalization side, the geometric model (configuration spaces and their fundamental groups) and the algebraic model (a presented group) are already available on the platform in this environment, and the abstract form of Artin's theorem is already stated there as an open problem. What this mission adds is: the elementary half-twist as an explicit, machine-checked loop in — this definition is proved sorry-free here, including the injectivity of the moving configuration at every time and the continuity of the path; the sharpened goal that fixes the isomorphism on generators; and the dissertation's supporting results, none of which is currently on the platform. None of the milestones or the goal has a machine-checked proof yet.
Surjectivity of — every braid is a product of half-twists — is a compactness-and-general- position argument in the dissertation: cut the braid into finitely many slabs in which a single crossing occurs. Turning that into a formal proof requires the homotopy-theoretic substitute, since "general position" is not available for free: a loop of configurations must be subdivided and each piece pushed to a standard crossing.
Injectivity is harder and is the step where a naive approach fails. It is not enough to check that the relations hold; one has to know that they are all the relations, i.e. that a word whose braid is null-homotopic is a consequence of the braid relations. The dissertation follows the classical route through elementary moves on braid diagrams (its Figuras 3.22–3.26), which formalizes as a long case analysis. The standard modern alternative is the Fadell–Neuwirth fibration together with an induction on ; its inductive step needs the exact sequence of the fibration , which is itself substantial work.
The plane is ; configurations are injective tuples indexed by Fin n; the unordered
configuration space is the quotient by the coordinate-permutation action with the quotient
topology; the base configuration is (not ). Braid generators are
indexed by Fin (n-1), the index standing for the book generator ; truncated
natural subtraction means the degenerate values give the trivial group, and the
statements are asserted for all including those cases. The abstract braid group is the
presented group on Fin (n-1) modulo the normal closure of the commutation and braid relators.
The half-twist rotates counterclockwise. The mirror symmetry fixes the base configuration and exchanges the two orientations, so the goal statement does not depend on this choice; a solver may use either convention internally.
The goal cannot be satisfied trivially: it asks for a group isomorphism whose values on the generators are the prescribed classes of explicit loops, so neither the identity on a presented group nor an abstract counting argument suffices.
Contributions welcome beyond the milestones: the Fadell–Neuwirth exact sequence for the plane, the pure braid group as the kernel of the map to , the exponent-sum homomorphism, and torsion-freeness of . The half-twist definition published with this mission is reusable for any further work on braids in this environment.
namespace TarchaBraids
open BraidsLinksMCG
theorem thm_3_15_artin_presentation (n : ℕ) :
∃ f : ArtinBraidGroup n ≃* GeomBraidGroup n,
∀ i : Fin (n - 1), f (sigma i) = halfTwistBraid n i := by sorry
end TarchaBraidsThis is the capstone of the dissertation, Teorema 3.15: for the braid group on strands admits the presentation
The proof in the dissertation constructs the map from the presented group to the braid group determined on generators by , checks that it is a well-defined homomorphism, that it is surjective (Teorema 3.11) and that it is injective (the analysis of elementary moves, Figuras 3.18–3.27).
Accordingly the statement formalized here is not merely that the two groups are abstractly isomorphic: it asserts the existence of a group isomorphism
from the presented group onto the fundamental group of the unordered configuration space of points of the plane, which sends each abstract generator to the class of the elementary half-twist interchanging the base points and . Fixing the isomorphism on generators is what makes the presentation usable for computation with concrete braids.
The statement is asserted for every ; the degenerate cases and assert an isomorphism between two trivial groups.
No open leaves. Every sub-goal is proved or awaiting decomposition.