Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 12 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 6 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Pure Braids, Fadell–Neuwirth, and Asphericity

1 · Prerequisites

2 · Summary

This page develops the Fadell–Neuwirth account of the pure braid group: the coordinate-forgetting maps of the ordered planar configuration spaces are fibrations whose exact sequences, together with the asphericity of those spaces, produce the short exact sequence 1→Fn−1→PBn→PBn−1→1, its splitting as a semidirect product, a torsion-freeness theorem for PBn, and finally the standard generators Aij. Everything is stated on the ordered configuration spaces Fm(X)={(x1,…,xm):xi≠xj (i≠j)} of the open disc, the plane and the closed disc, with the base configuration Q=(q1,…,qn) and h=14(n+1) fixed as on the geometric-braids pages.

The first ingredient is the homotopy type of a punctured disk. For a finite set Q of k distinct interior points, int⁡D2∖Q is homotopy equivalent to a wedge of k circles, with one positively oriented meridian loop per puncture as a free basis of π1, and its higher homotopy groups vanish; for k=0 the wedge is a point and the disk is contractible. The proof is explicit: a rotation and a piecewise-linear shear place the punctures on the real axis; radial homotopies push small punctured disks onto their boundary circles, and a vertical homotopy retracts the complement onto those circles joined by intervals. Contracting the two exterior rays gives a finite spine, and collapsing its interval tree gives the wedge; the published wedge theorem identifies the fundamental group and its meridian basis, and the universal cover of the wedge, built as the tree of reduced words, contracts so that based spheres of dimension at least two can be lifted and nullhomotoped upstairs. The radial homeomorphism h(w)=w/(1+∣w∣) transports all of this from C to the open disc, and no choice principle is used.

The vanishing of π2 is then proved by simultaneous induction on the number of points, along the Fadell–Neuwirth fibration supplied by the published local-triviality theorem for the coordinate-forgetting maps: the long exact sequence of the fibration F1(int⁡D2∖{q1,…,qn−1})→Fn(int⁡D2)→Fn−1(int⁡D2) sandwiches π2(Fn) between π2 of the fibre (a punctured disk, hence trivial) and π2(Fn−1) (trivial by the induction hypothesis), with F1(int⁡D2)≅int⁡D2 contractible as the base case. Because the fibration is only asserted under the Axiom of Choice through dependent choice and the numerable-bundle theorem, the lemma declares that assumption; the same conclusion is carried to the plane coordinates and to the closed disk through the published homeomorphism and homotopy equivalence.

With π2 in hand the forgetful map φ:PBn→PBn−1, forgetting the last strand, has an injective connecting fibre group: the low-degree part of the fibration sequence gives 1→Fn−1→κPBn→φPBn−1→1, where Fn−1=π1(int⁡D2∖{q1,…,qn−1},qn) is free on the n−1 positively oriented meridians and κ is the fibre inclusion. The base case PB1=1 is included, so at n=2 the sequence reads 1→F1→PB2→1→1. Iterating the same exact sequence in higher degrees, the ordered configuration spaces are aspherical: every πk(Fn(int⁡D2)) with k≥2 vanishes, the separate k=2 induction being the step that does not use point pushing; the statement transfers to the plane and closed-disk models, so the ordered configuration spaces are K(PBn,1) in the higher-homotopy sense.

The unordered configuration spaces are then obtained from the regular n!-sheeted cover Fn→Cn: every based map of a sphere Sk, k≥2, lifts through the covering because its domain is simply connected, the vanished ordered class nullhomotopes, and the nullhomotopy projects since the covering has the homotopy lifting property. Hence the unordered configuration spaces of the open disc, the plane and the closed disc have vanishing higher homotopy groups and fundamental group Bnconf, that is, they are K(Bnconf,1).

The sequence splits. The planar forgetful map p:Fn(C)→Fn−1(C) carries the explicit continuous section s(z1,…,zn−1)=(z1,…,zn−1,1+∑i<n∣zi∣), whose last coordinate is a positive real number strictly larger than every modulus ∣zi∣ and hence collides with nothing; transporting s through the coordinatewise radial homeomorphism gives a section of the open-disc forgetful map, choice-free and with no selection over an infinite family, and the single path needed to move its value to the chosen basepoint in the fibre is chosen once. Applying π1 to a section yields a homomorphism s:PBn−1→PBn with φ∘s=id⁡, so the extension splits as PBn≅Fn−1⋊PBn−1, the action being conjugation by the chosen section, g⋅x=s(g) xs(g)−1. The action depends on the section and the basepoint path, and no direct-product decomposition is asserted.

Point pushing closes the loop between this page and punctured-disks-mapping-classes-and-point-pushing, where the homomorphism Push⁡n was defined from based loops of the punctured disk but deliberately not proved injective. That page's braid–mapping-class identifications combine into an isomorphism Θn=Ψnmc∘(Ψnconf)−1 from PBn to the boundary-fixed pure mapping class group PMod⁡(D2,Qn;∂D2), and a naturality square with the homomorphism ψ forgetting the last marked point identifies Push⁡n=Θn∘κ: point pushing is injective with image exactly the kernel of ψ, so with Fn−1 the free meridian group the Birman sequence 1→Fn−1→Push⁡nPMod⁡(D2,Qn;∂D2)→ψPMod⁡(D2,Qn′;∂D2)→1 is short exact, where Qn′=(q1,…,qn−1) is the actual truncation of Qn. It differs from the canonical configuration at rank n−1; the proof transports that rank's identification through a boundary-fixed homeomorphism. The argument transports the Fadell–Neuwirth sequence through the two published braid-to-mapping-class isomorphisms and uses smooth configuration representatives and their extension to boundary-fixed isotopies; the two inversions in Ψconf and in the inverse-endpoint boundary map of point pushing cancel, so the point push of a fibre meridian corresponds to the image of the fibre class in PBn rather than to its inverse. This is the one place in the page where the Axiom of Choice is spent twice: for the numerable Fadell–Neuwirth fibration and, through countable choice, for the smooth motion extension.

The last group of results descends to the generators. The standard pure braid generators are the geometric classes Aij=[Wij] of the words Wij=σj−1⋯σi+1σi2σi+1−1⋯σj−1−1 in the elementary half twists, read with the library's first-under-second stacking convention; each is pure because its endpoint permutation is the identity, the definition is choice-free and invokes the Artin-to-geometric surjection only to fix the letters. Under the isomorphism Ψ from pure geometric braids to PBn — which inverts the raw slicing — the classes Ψ(Ain), 1≤i≤n−1, form a free basis of the kernel of the forgetful map, the i-th being the clockwise meridian of the i-th puncture, that is, (κ∗[γi])−1 for the counterclockwise spine-basis class γi. Since these free kernels form the tower of the split extension, an induction through the tower shows that the whole family {Aij}i<j generates PBn; no presentation, no completeness of relations and no injectivity of the Artin presentation is claimed. Finally, PBn is torsion-free for every n: in the short exact sequence a torsion element of PBn has image of finite order in the torsion-free group PBn−1, hence lies in the free kernel, which is torsion-free. The counterexample on the companion page shows that this argument genuinely needs the specific group, not merely the shape of the extension.

Choice is tracked throughout: the punctured-disk spine lemma, the standard generator definition and the continuous section are choice-free, while the vanishing-π2 lemma, the short exact sequence, the splitting, the asphericity statements, the point-pushing theorem, the generation theorem, torsion theorem and the two- and three-strand examples assume the Axiom of Choice, every use flowing through the numerable Fadell–Neuwirth fibration or through countable choice for smooth motion representatives. The companion page pure-braids-fadell-neuwirth-and-asphericity-examples works out the two-strand and three-strand groups explicitly, matches the standard generators with point pushes, and records the extension counterexample.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

A finitely punctured open disk has the homotopy type of a finite wedge of circles

Statement

Let k∈N, let int⁡D2={z∈C:∣z∣<1} be the open unit disc and let Q⊆int⁡D2 be a set of k distinct points. Then int⁡D2∖Q is homotopy equivalent to a wedge of k circles, and for each puncture there is a positively oriented meridian loop such that these k meridian classes form a free basis of the fundamental group. Moreover πj(int⁡D2∖Q)=0 for every j≥2. For k=0 the wedge is a point and int⁡D2 is contractible. The same conclusions hold for C minus k points under the explicit radial homeomorphism h:C→int⁡D2, h(w)=w/(1+∣w∣). No choice axiom is used.

Facts & Assumptions

Given: k∈N, a set Q={p1,…,pk} of k distinct points of int⁡D2, and the space X:=int⁡D2∖Q. Write h:C→int⁡D2 for h(w)=w/(1+∣w∣), with inverse h−1(z)=z/(1−∣z∣), and D2,int⁡D2 for the closed and open unit discs in the notation of The interior-disc and closed-disc configuration spaces are homotopy equivalent.

[F1]

A homotopy equivalence is a continuous map with a homotopy inverse (Homotopy equivalences, homotopy inverses and spaces of the same homotopy type); if A⊆Y is a deformation retract with retraction r then the inclusion is a homotopy equivalence with homotopy inverse r (Retractions and deformation retracts, with a deformation retraction required to fix the retract pointwise, The inclusion of a deformation retract is a homotopy equivalence with the retraction as homotopy inverse).

[F2]

Let Q=R/Z be pointed at [0] and Wr=⋁j<r(Q,[0]) for r∈N. Then π1(Wr,w) is the free group on the r standard loops, one traversing each circle summand once; for r=0, W0 is a point (The fundamental group of a finite wedge of circles is free of that rank, The wedge of a family of pointed spaces).

[F3]

Let Y be path-connected and locally path-connected, let f:(Y,y0)→(B,b0) be based and let p:(E,e0)→(B,b0) be a covering. A based lift exists if and only if f∗π1(Y,y0)⊆p∗π1(E,e0); it is then unique (Lifting criterion for maps from path-connected locally path-connected spaces).

[F4]

For j≥2 the sphere Sj is simply connected (Sn is simply connected for every n≥2).

[F5]

The reduced words on X⊔X−1 form the free group on X under concatenation followed by free reduction, and reduced representatives are unique: two reduced words represent the same element only if they are equal (Reduced words form the free group on an alphabet).

[F6]

For n≥1 the cubical model πn and the based sphere model agree under any fixed orientation-preserving based homeomorphism In/∂In≅Sn (Cubical and spherical models of higher homotopy agree); a based map induces a homomorphism f∗[a]=[f∘a], composition and identities are preserved, based homotopic maps induce equal maps and based homotopy equivalences induce isomorphisms, also in degree one (Higher homotopy groups are functorial and based homotopy invariant, Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).

[F8]

Let (Z,A) be a CW pair with A≠∅. If A admits a contraction, then the quotient map Z→Z/A is a homotopy equivalence (CW quotients and collapse of a contractible subcomplex).

Proof

technique · direct
1.1F1given

The plane model. The map h(w)=w/(1+∣w∣) is continuous, and h−1(z)=z/(1−∣z∣) is a two-sided inverse: both maps change only ∣w∣ and do it strictly increasingly onto [0,1) and [0,∞). Hence h is a homeomorphism, and it is orientation-preserving because it preserves arguments. A homeomorphism carries homotopy equivalences, free bases of fundamental groups, positive meridians and the vanishing of homotopy groups between the two spaces. So it suffices to prove the assertions of the statement for the plane model Y:=C∖Q′ with Q′=h−1(Q), and from now on we work in Y.

1.2given

Put the punctures on a line. For k=0, the contraction (z,t)↦(1−t)z proves all the assertions, so assume k≥1. Rotate coordinates so that the punctures pi=(xi,yi) have distinct first coordinates x1<⋯<xk; only finitely many directions are excluded. Let f:R→R interpolate the finitely many values f(xi)=yi linearly between consecutive xi, and be constant on the two exterior intervals. The shear J(x,y)=(x,y−f(x)) is a homeomorphism, with inverse (x,y)↦(x,y+f(x)). It carries the punctures to (xi,0) and preserves orientation: (x,y)↦(x,y−tf(x)) is an isotopy from the identity to J. Hence it suffices to work with punctures (xi,0).

1.3F1given

Push out the small disks. Choose ε>0 so that the closed disks Di=B((xi,0),ε)‾ are pairwise disjoint; for k=1 take ε=1, and otherwise take ε=14min⁡i<k(xi+1−xi). On a punctured disk write z=(xi,0)+ru, where 0<r≤ε and ∣u∣=1, and define Rt(z)=(xi,0)+((1−t)r+tε)u. Outside the disk interiors put Rt(z)=z. The formulas agree at r=ε, so finite pasting gives a continuous homotopy, which avoids all punctures and fixes B:=R2∖⋃iint⁡Di. At t=1 its image is B, so this is a deformation retraction onto B.

1.4F1step 1.3

A vertical retraction. Define the continuous function d:R→[0,ε] by d(x)=ε2−(x−xi)2 on each interval [xi−ε,xi+ε], and d(x)=0 elsewhere. These intervals are disjoint. A point (x,y) belongs to B exactly when ∣y∣≥d(x). On B put v(x,y)=d(x) for y>0, v(x,y)=−d(x) for y<0, and v(x,0)=0. This is continuous even at points with y=0: there d(x)=0, and throughout B the bound ∣v(x,y)∣=d(x)≤∣y∣ holds. The homotopy Vt(x,y)=(x,(1−t)y+tv(x,y)) stays in B, since on each half-plane the absolute value of its second coordinate remains at least d(x). It fixes the graph G:={(x,d(x)):x∈R}∪{(x,−d(x)):x∈R} pointwise and retracts B onto G. This graph consists of the k circles Ci=∂Di, joined consecutively by real intervals, and two exterior rays.

1.5F2F5given

Higher homotopy of the wedge vanishes. Let r≥1 and let Tr be the graph with vertex set the free group Fr:=F(x1,…,xr) realised as the reduced words of [F5], with one oriented edge from g to gxi for every g∈Fr and 1≤i≤r, traversable in either direction. Then Tr is connected: any word is reached from the empty word by appending its letters one at a time. It has no cycle: a cycle would exhibit a nonempty sequence of letters and their inverses, read as a reduced word equal to the identity of Fr, contradicting the uniqueness of reduced representatives in [F5]. Hence Tr is a tree and, for any two vertices g,h, the edge path from g to h is unique: two distinct reduced paths would differ by a cycle. The map pr:Tr→Wr that sends every vertex to the wedge point and traverses, on the edge from g to gxi, the i-th circle once in the positive direction, is a covering map: the star of each vertex in Tr is mapped homeomorphically onto the open neighbourhood of the wedge point formed by short initial and terminal arcs of all r circles, and interior points of edges are handled by the local homeomorphism property of the circle parametrisations, so the standard evenly covered neighbourhoods of Wr pull back to disjoint unions of stars.

2.1F1F2F8step 1.4

A finite spine and its tree. Put a=x1−ε, b′=xk+ε, and Σ=G∩([a,b′]×R). Contract each exterior ray of G to its endpoint by (x,0)↦((1−t)x+tmax⁡{a,min⁡{b′,x}},0), fixing Σ. This is a deformation retraction. Give Σ a finite graph structure with the left and right endpoints of each circle as vertices, its semicircles as edges, and the joining intervals as edges. The subgraph T consisting of all lower semicircles and joining intervals is an interval and is contractible fixing the leftmost vertex b=(a,0). By [F8] the collapse Σ→Σ/T is a based homotopy equivalence. Each upper semicircle becomes one circle after its endpoints are identified, so Σ/T≅Wk.

2.2F5step 1.5

The tree is contractible. For x∈Tr let π(x) be the unique edge path from x to the root vertex 1 (for x in the interior of an edge, start toward the endpoint closer to 1). Let L(x) be its length. Define H(x,t) to be the point on this path at distance t L(x) from x. On every finite subgraph of Tr the map (x,t)↦H(x,t) is continuous, because it is the inclusion of a finite star of intervals for a bounded number of steps and can be written as a finite patching of continuous maps on closed edges; continuity is local, so H is continuous. Then H(−,0)=id⁡, H(−,1)≡1 and H(1,t)=1: the tree Tr is contractible in the strong sense of having a contraction fixing the root.

3.1F1step 1.2step 1.3step 1.4step 2.1

The homotopy type. The deformation retractions of steps 1.3, 1.4 and 2.1 give R2∖{(xi,0):1≤i≤k}≃Σ≃Wk. The shear and rotation of step 1.2 transfer this equivalence back to Y.

3.2F2F3F4F6step 1.5step 2.2

πj(Wr)=0 for j≥2. Fix j≥2 and a based map u:Sj→Wr (the cubical model is identified with the spherical one by [F6]). The sphere Sj is path-connected, locally path-connected and simply connected by [F4], and π1(Tr)=1 because Tr is contractible by step 2.2, so the lifting criterion [F3] gives a based lift u~:Sj→Tr of u. By step 2.2 there is a based homotopy u~≃const in Tr; composing it with pr gives a based homotopy u≃const in Wr. Hence every based class in πj(Wr,w) is trivial, and πj(Wr,w)=0. For the case r=0, W0 is a point by [F2], so the same conclusion is immediate.

4.1F1F2F6step 1.2step 1.3step 1.4step 2.1step 3.1

The meridian basis. In the straightened plane, let αi be the path in the tree T from b to the left endpoint of Ci. Let γi follow αi, traverse Ci counterclockwise once, and return along αˉi. Its circular part encloses just (xi,0), so it is a positive based meridian. Collapsing T sends these loops to the k standard circle loops of Wk, oriented by their images. By [F2], [F6] and the based equivalence of step 2.1, their classes are a free basis of π1(Σ,b), hence of the punctured plane by the deformation retractions. Transferring them back by the inverse shear and rotation gives positive based meridians forming a free basis of π1(Y).

5.1F1F6step 1.1step 4.1step 3.2

Conclusion for the plane model and the disc. Combining steps 4.1 and 3.2 with the isomorphisms of homotopy groups induced by the homotopy equivalences Y≃Σ≃Wk ([F1], [F6]), we obtain πj(Y)=0 for every j≥2, with basepoint b; a homotopy equivalence induces isomorphisms at every basepoint, so the choice of basepoint is immaterial. Transferring along the homeomorphism h of step 1.1 gives the corresponding statements for int⁡D2∖Q; the image under h of the loops γj are positively oriented meridians of the punctures of Q, because h preserves arguments and is a homeomorphism, and their classes form a free basis of π1 for the same reason.

The meridian basis, the homotopy equivalence with the wedge and the vanishing of all πj with j≥2 are therefore established for int⁡D2∖Q and for C minus k points, with no choice principle beyond the ordered-field and interval facts already available in the ambient theory. ∎

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Vanishing π2 for every ordered planar configuration space

Statement

Assume the Axiom of Choice. For every n≥1 and every base configuration q∈Fn(int⁡D2) one has π2(Fn(int⁡D2),q)=0. The same conclusion holds for Fn(C) under the coordinatewise radial homeomorphism C→int⁡D2, w↦w/(1+∣w∣), applied to every coordinate, and for Fn(D2) under the published inclusion homotopy equivalence Fn(int⁡D2)→Fn(D2).

Facts & Assumptions

Given: the Axiom of Choice (AC) and, for every n≥1, an arbitrary base configuration q=(q1,…,qn)∈Fn(int⁡D2); write M:=int⁡D2 and M∖{q1,…,qn−1} for the complement of the first n−1 coordinates.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]

In ZF, AC implies DC, and DC implies countable choice (AC implies DC implies countable choice).

[F2]

Let M be a nonempty connected Hausdorff topological d-manifold without boundary with d≥2 and let m,n≥1; the map π:Fm+n(M)→Fm(M), π(x1,…,xm+n):=(x1,…,xm), has fibre π−1(q′)≅Fn(M∖Qq′) over every base configuration q′, it is a locally trivial fibre bundle with that fibre type, and if M=int⁡D2 then under AC and DC the bundle may be taken numerable and is therefore a Hurewicz fibration (The Fadell-Neuwirth forgetful map: local triviality, constant fibre, and numerability for configurations in the disk).

[F3]

For a based Serre fibration p:(E,e0)→(B,b0) with fibre F=p−1(b0) the segment π2(F)→i∗π2(E)→p∗π2(B)→∂pπ1(F) of the long exact sequence is exact, exactness meaning that the incoming image equals the inverse image of the distinguished element (Long exact sequence of homotopy groups of a fibration).

[F4]

For every finite set Q of k distinct points of int⁡D2, πj(int⁡D2∖Q)=0 for every j≥2, and for k=0 the space int⁡D2 is contractible; the same conclusions hold for C minus k points under the explicit radial homeomorphism h(w)=w/(1+∣w∣) (A finitely punctured open disk has the homotopy type of a finite wedge of circles).

[F5]

A based homotopy equivalence f:(X,x)→(Y,f(x)) induces isomorphisms f∗:πj(X,x)→πj(Y,f(x)) for all j≥1, and the inclusion ιF:Fn(int⁡D2)→Fn(D2) is a homotopy equivalence with ι∗F an isomorphism on fundamental groups at every configuration of interior points (Higher homotopy groups are functorial and based homotopy invariant, The interior-disc and closed-disc configuration spaces are homotopy equivalent).

Proof

technique · induction on $n$
1.1F4

The fibre fact. By [F4], for every finite set Q of distinct points of int⁡D2 the complement int⁡D2∖Q has vanishing πj in every degree j≥2 and, when Q is empty, is contractible; in particular every group π2(int⁡D2∖Q) is trivial.

1.2F4F5

Transferring the conclusion. The coordinatewise map h(n):Cn→(int⁡D2)n, h(z1,…,zn)=(h(z1),…,h(zn)), restricts to a homeomorphism Fn(C)→Fn(int⁡D2), and the inclusion ιF:Fn(int⁡D2)→Fn(D2) is a homotopy equivalence; by [F5] both induce isomorphisms on all homotopy groups in degrees ≥1, so vanishing of π2 transfers in either direction and at the corresponding basepoints.

1.3baseF4

Base case n=1. For n=1 single-coordinate evaluation is a homeomorphism F1(int⁡D2)≅int⁡D2, which is the case k=0 of the vanishing statement in [F4], so π2(F1(int⁡D2),q)=0 for the arbitrary base configuration q.

1.4ih

Induction hypothesis. Fix n≥2 and assume, for every base configuration b∈Fn−1(int⁡D2), that π2(Fn−1(int⁡D2),b)=0.

1.5A1F1F2

The forgetful fibration. By [F1], the Axiom of Choice [A1] yields the Axiom of Dependent Choice, so the choice hypotheses of [F2] are met; fixing n≥2 and a base configuration q, the map pn:Fn(int⁡D2)→Fn−1(int⁡D2), (x1,…,xn)↦(x1,…,xn−1), is of the form in [F2] with m=n−1≥1 and one forgotten point on the manifold M=int⁡D2, and is therefore a Hurewicz, hence Serre, fibration; over b:=pn(q)=(q1,…,qn−1) its fibre is pn−1(b)=F1(int⁡D2∖{q1,…,qn−1})=int⁡D2∖{q1,…,qn−1}, which contains q because qn∉{q1,…,qn−1}. This use of AC is the only one in the proof, and it is used solely to invoke [F2].

2.1step 1.1step 1.4step 1.5F3

The induction step. Let q∈Fn(int⁡D2) be arbitrary and let pn, b=pn(q) and the fibre F=int⁡D2∖{q1,…,qn−1} be as in step 1.5, so that q∈F. The map pn is a based Serre fibration, so the exact segment π2(F)→i∗π2(Fn(int⁡D2),q)→pn∗π2(Fn−1(int⁡D2),b)→∂π1(F) of [F3] is available. The term π2(F) is zero by step 1.1, and π2(Fn−1(int⁡D2),b)=0 by the induction hypothesis of step 1.4, so exactness gives im⁡(i∗)=ker⁡(pn∗)=0 and im⁡(pn∗)=ker⁡(∂)=0; hence pn∗ is both injective and zero, and therefore π2(Fn(int⁡D2),q)=0.

3.1step 1.3step 2.1discharge-induction

Induction conclusion. Step 1.3 is the base case and step 2.1 proves the successor implication for arbitrary n≥2 and arbitrary base configuration, so by induction π2(Fn(int⁡D2),q)=0 for every n≥1 and every q∈Fn(int⁡D2).

4.1step 3.1step 1.2discharge-induction

The plane and closed-disc models. Applying the homeomorphism and the homotopy equivalence of step 1.2 to the result of step 3.1 gives π2(Fn(C),q′)=0 for every q′∈Fn(C) and π2(Fn(D2),q′′)=0 for every q′′∈Fn(D2), which is the full statement.

∎

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

The Fadell-Neuwirth short exact sequence for pure braids

Statement

Assume the Axiom of Choice and let n≥2. Let q=(q1,…,qn)∈Fn(int⁡D2) be a base configuration and write q′:=(q1,…,qn−1), so that PBn=π1(Fn(D2),q),PBn−1=π1(Fn−1(D2),q′) in the closed-disc convention of The pure braid group PBn as the fundamental group of an ordered configuration space. Let Fn−1:=π1(int⁡D2∖{q1,…,qn−1}, qn) be the fundamental group of the fibre of the last-coordinate forgetful map, which is free on the n−1 positively oriented meridian classes of the punctures q1,…,qn−1 (A finitely punctured open disk has the homotopy type of a finite wedge of circles). Then forgetting the last strand, that is the map induced on fundamental groups by (x1,…,xn)↦(x1,…,xn−1), fits into a short exact sequence 1⟶Fn−1→ κ PBn→ φ PBn−1⟶1, where κ is the injection induced by the inclusion of the fibre int⁡D2∖{q1,…,qn−1}→Fn(int⁡D2), x↦(q1,…,qn−1,x), transported through the identity PBn=π1(Fn(D2),q) of the closed-disc convention, and φ is the forgetful map. Moreover PB1 is trivial, so for n=2 the displayed sequence reads 1→F1→PB2→1→1.

Facts & Assumptions

Given: the Axiom of Choice and integers n≥2; a base configuration q=(q1,…,qn)∈Fn(int⁡D2) with q′=(q1,…,qn−1); the open-disc configuration spaces Fn(int⁡D2), Fn−1(int⁡D2) and the closed-disc spaces Fn(D2), Fn−1(D2); the fibre space Mn−1:=int⁡D2∖{q1,…,qn−1}.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]
[F2]

For the nonempty connected Hausdorff surface M=int⁡D2 without boundary and the last-coordinate forgetful map p:Fn(M)→Fn−1(M) with n≥2, every fibre over q′ is homeomorphic to F1(M∖Qq′)=M∖Qq′, the map is locally trivial with that fibre type, and under AC and DC it is a numerable locally trivial bundle, hence a Hurewicz fibration (The Fadell-Neuwirth forgetful map: local triviality, constant fibre, and numerability for configurations in the disk).

[F3]

PBm=π1(Fm(D2),q(m)) for a base configuration of interior points; the inclusion ιF:Fm(int⁡D2)→Fm(D2) induces an isomorphism ι∗F of fundamental groups at every configuration of interior points; PB0 and PB1 are trivial, and for n=1 single-coordinate evaluation gives F1(D2)≅D2 (The pure braid group PBn as the fundamental group of an ordered configuration space, The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[F4]

For a based Serre fibration p:(E,e0)→(B,b0) with fibre F=p−1(b0) the sequence ⋯→π1(F)→i∗π1(E)→p∗π1(B)→∂pπ0(F)→i∗π0(E)→p∗π0(B) is exact, exactness meaning incoming image equals inverse image of the distinguished element; every arrow between groups is a homomorphism, and the last arrow is onto precisely when p(E) meets every path component of B (Long exact sequence of homotopy groups of a fibration).

[F5]

For a set Q of k distinct points of int⁡D2 the complement int⁡D2∖Q has πj=0 for all j≥2, is homotopy equivalent to a wedge of k circles, and its fundamental group at any basepoint is free with a free basis given by the k positively oriented meridian classes of the punctures Q (A finitely punctured open disk has the homotopy type of a finite wedge of circles).

[F6]

For every m≥1 and every base configuration c∈Fm(int⁡D2) one has π2(Fm(int⁡D2),c)=0 (Vanishing π2 for every ordered planar configuration space).

[F7]

Induced maps on fundamental groups are functorial: (g∘f)∗=g∗∘f∗ and (id⁡)∗=id⁡ (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).

Proof

technique · direct
1.1F5F6

Fibre and base computations. The complement Mn−1 is homotopy equivalent to a wedge of n−1 circles by [F5], hence path-connected, so π0(Mn−1) is a one-point set; also π2(Mn−1,qn)=0 and π1(Mn−1,qn) is free with the n−1 positively oriented meridian classes of q1,…,qn−1 as a free basis, all by [F5]. Since n≥2 we have n−1≥1, so [F6] gives π2(Fn−1(int⁡D2),q′)=0.

1.2F3F7

The open-to-closed comparison. Let ιF:Fm(int⁡D2)→Fm(D2) be the inclusion for m=n−1,n and let pD:Fn(D2)→Fn−1(D2) be the closed-disc last-coordinate forgetful map. Both pD and p forget the last coordinate, so pD∘ιF=ιF∘p as maps; by [F7] the induced maps satisfy p∗D∘ι∗F=ι∗F∘p∗. By [F3] the maps ι∗F:π1(Fn(int⁡D2),q)→PBn and ι∗F:π1(Fn−1(int⁡D2),q′)→PBn−1 are isomorphisms onto the groups in the closed-disc convention, so PBn and PBn−1 may be computed in the open-disc model.

1.3A1F1F2

The forgetful fibration and its fibre. By [F1] the Axiom of Choice [A1] yields the Axiom of Dependent Choice, so the choice hypotheses of [F2] are met; by [F2] the last-coordinate map p:Fn(int⁡D2)→Fn−1(int⁡D2), (x1,…,xn)↦(x1,…,xn−1), is a Hurewicz, hence Serre, fibration; over b:=p(q)=q′ its fibre is p−1(q′)=F1(Mn−1)≅Mn−1=int⁡D2∖{q1,…,qn−1}, which contains q because qn∉{q1,…,qn−1}. This use of AC, only to invoke [F2], is the sole choice principle in the proof.

2.1step 1.1step 1.3F4

The exact sequence in the open-disc model. Inserting the computations of step 1.1 into the exact sequence of [F4] for the based Serre fibration p of step 1.3 with e0=q, b0=q′ and fibre Mn−1 gives the exact sequence of groups π2(Fn−1(int⁡D2),q′)→∂π1(Mn−1,qn)→i∗π1(Fn(int⁡D2),q)→p∗π1(Fn−1(int⁡D2),q′)→∂π0(Mn−1). The left term vanishes by step 1.1, so im⁡(i∗)=ker⁡(p∗) is the kernel of p∗ and i∗ is injective; the last term is a one-point set, so the boundary into it is the zero map and exactness at π1(Fn−1(int⁡D2),q′) makes p∗ surjective. Hence 1→π1(Mn−1,qn)→i∗π1(Fn(int⁡D2),q)→p∗π1(Fn−1(int⁡D2),q′)→1 is short exact.

3.1step 1.2step 2.1

Transport to the closed-disc convention. Conjugating the sequence of step 2.1 by the isomorphisms of step 1.2 identifies it with 1→Fn−1→κPBn→φPBn−1→1, where κ=ι∗F∘i∗ is the composite of the fibre inclusion with the open-to-closed isomorphism ι∗F for m=n, and φ=p∗D is the induced map of the closed-disc forgetting map; exactness is preserved by these isomorphisms and φ is the map induced by forgetting the last strand.

4.1step 3.1step 1.1F3

Elementary cases and conclusion. By [F3] the group PB1 is trivial, so for n=2 the quotient in the displayed sequence is trivial and the sequence reads 1→F1→PB2→1→1; the general case n≥2 is step 3.1, so the theorem is proved.

The proof used the published choice-dependent Fadell–Neuwirth fibration only through the AC/DC deduction in step 1.3, and no Artin presentation, group action, or Birman injectivity is used. ∎

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Point pushing is the kernel of forgetting the last disk puncture

Statement

Assume the Axiom of Choice and let n≥2. Write Qn=(q1,…,qn) for the base configuration of Boundary-fixed mapping class group of a punctured disk, and put Qn′:=(q1,…,qn−1), the truncation of Qn. Here PMod⁡(D2,Qn′;∂D2) means the group of path components of the boundary-fixed homeomorphisms fixing these n−1 points individually; Qn′ is not the canonical rank-(n−1) configuration. Put Yn:=int⁡D2∖{q1,…,qn−1} for the disc with the first n−1 punctures removed, and Push⁡n:π1(Yn,qn)→PMod⁡(D2,Qn;∂D2) for the point-pushing homomorphism at the last puncture of Point pushing the last puncture. Further let ψ:PMod⁡(D2,Qn;∂D2)⟶PMod⁡(D2,Qn′;∂D2) be the homomorphism induced on the pointwise stabilisers by forgetting the last marked point, that is, the map that regards a boundary-fixed homeomorphism fixing q1,…,qn as one fixing q1,…,qn−1. Then:

  1. Push⁡n is injective;
  2. its image is exactly the kernel of ψ;
  3. ψ is surjective, so with Fn−1:=π1(Yn,qn), the free group on the n−1 puncture meridians of The Fadell-Neuwirth short exact sequence for pure braids, the sequence 1⟶Fn−1→ Push⁡n PMod⁡(D2,Qn;∂D2)→ ψ PMod⁡(D2,Qn′;∂D2)⟶1 is short exact.

No injectivity of Push⁡n is assumed anywhere in the definition of point pushing; it is proved here from the Fadell-Neuwirth sequence for the ordered configuration spaces.

Facts & Assumptions

Given: the Axiom of Choice, an integer n≥2, the canonical configuration Qn of Boundary-fixed mapping class group of a punctured disk and its truncation Qn′, the punctured disc Yn, the point-pushing homomorphism of Point pushing the last puncture with the ordered lift Lγ(t)=(q1,…,qn−1,γ(t)) of a based loop γ:I→Yn at qn, and the boundary map δ:π1(Cm(int⁡D2),[Qm])→Mod⁡(D2,Qm;∂D2) of Boundary map from point motions.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]

In ZF, AC implies DC and DC implies countable choice, so under [A1] the extension lemma of [F7] is available (AC implies DC implies countable choice).

[F2]

Under AC the forgetting map sits in the short exact sequence 1→Fn−1→κPBn→φPBn−1→1, where Fn−1=π1(int⁡D2∖{q1,…,qn−1},qn) is the fundamental group of the fibre of the last-coordinate forgetful map, free on the n−1 positively oriented meridian classes, κ is induced by the fibre inclusion x↦(q1,…,qn−1,x) transported through the open-to-closed identification, and φ is induced by forgetting the last coordinate (The Fadell-Neuwirth short exact sequence for pure braids).

[F3]

The map Ψmconf:Gmpure→PBm, Ψmconf([β])=(ι∗F[zβ])−1, is a group isomorphism, where zβ is the coordinate path of the braid β and ι∗F is the open-to-closed isomorphism, and for a pure braid zβ(1)=Qm (Pure geometric braids and ordered configuration loops, Geometric braids in the disc with setwise endpoints).

[F4]

The map Ψmmc:=δ∘(ι∗C)−1∘Φ:Gm→Mod⁡(D2,Qm;∂D2) is a group isomorphism, and for every braid class [β]∈Gm and every lift g:I→Homeo⁡+(D2,∂D2) of the raw slice loop S(β) with g(0)=id⁡ one has Ψmmc([β])=[g(1)]. Moreover Ψmmc(Gmpure)=PMod⁡(D2,Qm;∂D2) (Braid group as boundary-fixed punctured-disk mapping classes, Pure braids as pure mapping classes).

[F5]

Point pushing is defined by Push⁡n([γ])=δ([γˉ]) with γˉ=pn∘Lγ, it is a group homomorphism with values in PMod⁡(D2,Qn;∂D2), no injectivity is asserted by the definition, and Ψnmc([Lγ])=Push⁡n([γ])−1; the boundary map δ is the connecting isomorphism of the evaluation fibration (Point pushing the last puncture, Evaluation boundary isomorphism for the disk, Point-motion boundary map is a homomorphism).

[F6]

At the canonical configurations, the pure mapping class group is PMod⁡(D2,Qm;∂D2)=π0(Fm) for the pointwise stabiliser Fm=Homeo⁡+(D2,∂D2;Q^m), two boundary-fixed homeomorphisms fixing each qi lie in the same component exactly when they are isotopic rel ∂D2 fixing each qi for all times, the product is [f][g]=[f∘g], and the canonical map PMod⁡(D2,Qm;∂D2)→Mod⁡(D2,Qm;∂D2) is injective (Pure boundary-fixed mapping classes). For Qn′ we use the same pointwise-stabiliser formula as defined in the Statement; the same path and composition arguments give its group structure.

[F7]

Every based loop of Cm(int⁡D2) at the canonical rank-m configuration [Qm] is path homotopic relative to {0,1} to a based loop whose unique ordered lift from Qm consists of smooth, pairwise collision-free coordinate paths constant near the two time endpoints (Smooth representatives of configuration loops); under countable choice, smooth collision-free paths z1,…,zm:R→int⁡D2 constant on (−∞,0] and on [1,∞) extend to a smooth isotopy Φ:D2×[0,1]→D2 with Φ0=id⁡, every Φs a diffeomorphism fixing ∂D2 pointwise, and Φs(zj(0))=zj(s) (Smooth finite point motions extend to disk isotopies).

[F8]

Induced maps on fundamental groups are functorial and commute with the open-to-closed inclusions: p∗D∘ι∗F=ι∗F∘p∗ for the coordinate-forgetting maps and their open and closed disc versions (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy, The interior-disc and closed-disc configuration spaces are homotopy equivalent, The Fadell-Neuwirth short exact sequence for pure braids).

[F9]

Slicing is a bijection S:Gm→π1(Cm(int⁡D2),[Qm]), so a braid class is determined by its raw slice loop (Geometric braid classes and the unordered configuration fundamental group).

[F10]

On the compact metric domain D2 the compact-open topology on Homeo⁡+(D2,∂D2) is the topology of uniform convergence, and composition of homeomorphisms is continuous for it (Boundary-fixed mapping class group of a punctured disk). The product D2×I is again a nonempty compact metric space, so a jointly continuous family g:D2×I→D2 is uniformly continuous there (Every continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous); writing gs(x):=g(x,s) and measuring the product with a metric for which d((x,s),(x,s′))=∣s−s′∣, uniform continuity gives for every ε>0 a δ>0 with sup⁡x∈D2∥gs(x)−gs′(x)∥2<ε whenever ∣s−s′∣<δ. Hence a jointly continuous family of homeomorphisms gives a continuous path s↦gs in that topology (Boundary-fixed mapping class group of a punctured disk, Every continuous map from a nonempty compact Hausdorff space to a uniform space is uniformly continuous).

Proof

technique · direct
1.1A1F1F2F7

Choice bookkeeping. By [F1] the Axiom of Choice [A1] yields dependent choice and countable choice, so the short exact sequence of [F2] and the extension lemma of [F7] are both available.

1.2F6given

The forgetting homomorphism ψ. Let Fn be the pointwise stabiliser of Qn, and let F′ be the pointwise stabiliser of Qn′, as in [F6]. A homeomorphism fixing q1,…,qn fixes q1,…,qn−1, so the inclusion inc⁡:Fn↪F′ is defined and continuous for the subspace topologies; define ψ:=π0(inc⁡), that is, ψ([f]):=[f] for the class of a homeomorphism f∈Fn read in π0(F′)=PMod⁡(D2,Qn′;∂D2) by [F6]. This is well defined: if f and f′ are joined by a path in Fn, the same path lies in F′ and joins them there. It is a group homomorphism: for [f],[g]∈π0(Fn) one has [f][g]=[f∘g], and inc⁡(f∘g)=inc⁡(f)∘inc⁡(g), so ψ([f][g])=[f∘g]=[f][g]=ψ([f])ψ([g]). Thus ψ is exactly the homomorphism that forgets the last marked point.

1.3F2F3F4F5

An isomorphism from the pure braid group and the identification Push⁡n=Θn∘κ. By [F4] the restriction of Ψnmc to Gnpure is a group isomorphism onto PMod⁡(D2,Qn;∂D2), and by [F3] the map Ψnconf is a group isomorphism Gnpure→PBn; so Θn:=Ψnmc∣Gnpure∘(Ψnconf)−1:PBn⟶PMod⁡(D2,Qn;∂D2) is a group isomorphism. Now let [γ]∈π1(Yn,qn). Its ordered lift Lγ is a pure geometric braid based at Qn: its coordinates are the constant paths at q1,…,qn−1 and the loop γ, they are pairwise distinct and lie in int⁡D2, and Lγ(0)=Qn=Lγ(1), so [Lγ]∈Gnpure. Writing i:Yn→Fn(int⁡D2), x↦(q1,…,qn−1,x) for the fibre inclusion, we have i∘γ=Lγ, so by [F2] κ([γ])=ι∗F(i∗[γ])=ι∗F[Lγ]. The coordinate path of the braid Lγ is Lγ itself, so by [F3] (Ψnconf)−1(κ([γ])−1)=[Lγ], while [F5] gives Ψnmc([Lγ])=Push⁡n([γ])−1. Applying the isomorphism Θn to the inverse of κ([γ]) we therefore get Θn(κ([γ])−1)=Push⁡n([γ])−1,henceΘn(κ([γ]))=Push⁡n([γ]), because a group isomorphism carries inverses to inverses.

1.4F3F4given

Reading Θm off a lifted isotopy. Let m≥1 and let x∈PBm with [β]:=(Ψmconf)−1(x)∈Gmpure and coordinate path z=zβ. Suppose g:I→Homeo⁡+(D2,∂D2) is a lift of the raw slice loop S(β) with g(0)=id⁡ and with gs(qj)=zj(s) for all j and s. Then g is a lift of S(β) with initial value the identity, so [F4] gives Ψmmc([β])=[g(1)], and hence Θm(x)=[g(1)]∈PMod⁡(D2,Qm;∂D2). Moreover g(1)(qj)=zj(1)=qj for every j, because [β] is pure, so g(1)∈Fm is an element of the pointwise stabiliser and [g(1)] is literally a class of π0(Fm).

1.5F3F4F7F8F10step 1.1step 1.3step 1.4

Transport to the truncated configuration. Write C=(c1,…,cn−1) for the canonical rank-(n−1) configuration. The affine motion ηj(t)=(1+t/n)qj+t(hn−1,0),hn−1=1/(4n), carries qj to cj: qj=(2j−n−1)/(4(n+1)) gives ηj(1)=(2j−n)/(4n). The points remain ordered and inside the disc, since each coordinate is a convex combination of its initial and terminal positions. Reparametrize by a smooth nondecreasing function equal to 0 near 0 and 1 near 1, and extend constantly outside I. By [F7] and step 1.1 this smooth separated motion extends to a boundary-fixed disk isotopy with endpoint R satisfying R(qj)=cj for j<n. Conjugation f↦RfR−1 identifies the pointwise stabiliser of Qn′ with that of C, continuously in both directions by [F10]. It induces an isomorphism CR of their component groups. Also R acts coordinatewise on configuration spaces and induces an isomorphism R∗ of their fundamental groups at these basepoints, commuting with the open-to-closed inclusions by [F8]. Define Θ′:=CR−1∘Θn−1∘R∗:π1(Fn−1(D2),Qn′)⟶PMod⁡(D2,Qn′;∂D2), where Θn−1 is the canonical isomorphism of step 1.3. This is an isomorphism. If z′ is any ordered loop at Qn′ lifted by an ambient isotopy g from the identity, then RgR−1 lifts Rz′ from the canonical configuration C. The inverse-slicing formula and step 1.4 give Θ′((ι∗F[z′])−1)=[g1]. This transported formula, rather than a canonical rank-(n−1) identification at Qn′, will be used below.

2.1F2F3F7F8F9F10step 1.1step 1.2step 1.4step 1.5

Naturality at the actual truncation. Let x∈PBn and choose its pure geometric representative β=(Ψnconf)−1(x). By [F7] and [F9] its ordered path z may be taken smooth and constant near the endpoints without changing its class. By step 1.1 and [F7], lift it to a boundary-fixed smooth isotopy g from the identity with gs(qj)=zj(s); this is a continuous path of homeomorphisms by [F10]. Step 1.4 gives Θn(x)=[g1]. The same isotopy lifts the truncated loop z′=(z1,…,zn−1), based at Qn′. By [F3] and [F8] the forgetting map of [F2] satisfies φ(x)=(ι∗F[z′])−1∈π1(Fn−1(D2),Qn′). Step 1.5 therefore gives Θ′(φ(x))=[g1] in the component group of the pointwise stabiliser of Qn′. Step 1.2 identifies this class with ψ(Θn(x)). Thus ψ∘Θn=Θ′∘φ, with every map based at the specified configuration.

3.1F2F4step 1.3step 2.1∎

Exactness of the Birman sequence. By step 1.3, Push⁡n=Θn∘κ with Θn an isomorphism and κ injective by [F2], so Push⁡n is injective: if Push⁡n([γ])=1, then κ([γ])=Θn−1(1)=1 and hence [γ]=1. Its image is Θn(im⁡κ)=Θn(ker⁡φ) by the exactness in [F2]. By step 2.1 and the injectivity of Θ′, Θn−1(ker⁡ψ)=ker⁡(ψ∘Θn)=ker⁡(Θ′∘φ)=ker⁡φ, so Θn(ker⁡φ)=ker⁡ψ and im⁡Push⁡n=ker⁡ψ; this proves claims 1 and 2. Finally ψ∘Θn=Θ′∘φ is the composite of the surjection φ of [F2] with the isomorphism Θ′, hence surjective, and therefore ψ itself is surjective. Inserting these three facts into the sequence displayed in the statement gives a short exact sequence, with Fn−1=π1(Yn,qn) the free group of [F2] on the n−1 puncture meridians.

Remarks

  • The proof never uses the splittings, the section, or any explicit generating family of PBn: it transports the Fadell-Neuwirth short exact sequence of The Fadell-Neuwirth short exact sequence for pure braids through the two braid-to-mapping-class identifications, and the only geometric input beyond those identifications is the smooth representative and extension pair of [F7]. Injectivity of Push⁡n is obtained because the fibre inclusion κ is injective, itself a consequence of π2(Fn−1(int⁡D2))=0.
  • The identification Push⁡n=Θn∘κ is where the two inverse signs cancel: the configuration identification Ψconf and the mapping-class identification Ψmc both invert the raw slicing, so the point push of a loop agrees with the image of the fibre class in PBn rather than with its inverse. Without that check the exact sequence would only be correct up to inversion of the free factor.
  • The Axiom of Choice is used twice: through the Fadell-Neuwirth fibration that supplies [F2], and through countable choice for the smooth motion extension in step 2.1. The evaluation-boundary isomorphism and the smooth extension lemma carry their own choice hypotheses, which [A1] discharges.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

A choice-free continuous section of planar coordinate forgetting

Statement

Let n≥2, write p:Fn(C)→Fn−1(C) and p~:Fn(int⁡D2)→Fn−1(int⁡D2) for the maps forgetting the last coordinate, and let h:C→int⁡D2, h(w)=w/(1+∣w∣), be the radial homeomorphism with inverse h−1(z)=z/(1−∣z∣). Then:

  1. The formula s(z1,…,zn−1):=(z1,…,zn−1, 1+∣z1∣+⋯+∣zn−1∣) defines a continuous section of p, that is p∘s=id⁡Fn−1(C).
  2. Transporting s through the coordinatewise homeomorphisms induced by h yields a continuous section s′=h(n)∘s∘(h−1)(n−1) of p~.
  3. Fix a base configuration q=(q1,…,qn)∈Fn(int⁡D2) and put q′:=(q1,…,qn−1). Then q and s′(q′) both lie in the fibre p~−1(q′), that fibre is path-connected, and any path α in it from q to s′(q′) yields a homomorphism σ:π1(Fn−1(int⁡D2),q′)→π1(Fn(int⁡D2),q) with p~∗∘σ=id⁡, so p~∗ is split surjective on fundamental groups at q.

No choice principle is used.

Facts & Assumptions

Given: an integer n≥2, a base configuration q=(q1,…,qn)∈Fn(int⁡D2) with q′=(q1,…,qn−1), and the radial homeomorphism h(w)=w/(1+∣w∣) with two-sided inverse h−1(z)=z/(1−∣z∣) (A finitely punctured open disk has the homotopy type of a finite wedge of circles).

[F1]

Fm(X)={(x1,…,xm)∈Xm:xi≠xj whenever i≠j} with the subspace topology, and single-coordinate evaluation is a homeomorphism F1(X)≅X (Ordered configuration spaces Fn(X)).

[F2]

The map h:C→int⁡D2, h(w)=w/(1+∣w∣), is a homeomorphism with inverse h−1(z)=z/(1−∣z∣); it preserves arguments and multiplies moduli by the strictly increasing function r↦r/(1+r) (A finitely punctured open disk has the homotopy type of a finite wedge of circles).

[F3]

For a path c:x0→x1 in X the assignment φc([α]):=[(cˉ∗α)∗c] is a group isomorphism π1(X,x0)→π1(X,x1) whose two-sided inverse is φcˉ (Conjugating loop classes by a path is an isomorphism of fundamental groups).

[F4]

Loop classes at a point form a group under first-then-second concatenation, with the constant loop as identity and reversal as inversion (Loop classes form the group π1(X,x0) under concatenation).

Proof

technique · constructive
1.1constructF1given

The plane section. Define s(z1,…,zn−1):=(z1,…,zn−1, 1+∑i<n∣zi∣) on Fn−1(C). The last coordinate is a positive real number and 1+∑i∣zi∣>∣zi∣ for every i, so it differs from each of z1,…,zn−1; the first n−1 coordinates are pairwise distinct because (z1,…,zn−1)∈Fn−1(C) by [F1]. Hence s takes values in Fn(C). The absolute-value and sum operations are continuous, and a tuple of continuous coordinate maps is continuous, so s is continuous; forgetting the last coordinate returns the given tuple, that is p∘s=id⁡.

1.2constructF1given

Complements of finite sets in the disc are path-connected. Let Q⊆int⁡D2 be finite and let x,y∈int⁡D2∖Q. If x=y the constant path joins them, so assume x≠y and choose r with max⁡{∣x∣,∣y∣}<r<1 and r≠∣w∣ for every w∈Q; only finitely many radii are forbidden, so such an r exists, and then the circle Cr={z:∣z∣=r} is disjoint from Q and contains x,y in its interior. For each w∈Q let Rx(w):={x+t(w−x):t≥1} and Ry(w):={y+t(w−y):t≥1} be the rays from x and from y through w extended beyond w; each meets Cr in at most one point, so only finitely many points of Cr are excluded. Choose z∈Cr outside this finite excluded set. If some w∈Q lay on the segment [x,z], then z=x+t(w−x) with t≥1, contradicting the exclusion of z; thus [x,z]∩Q=∅, and likewise [z,y]∩Q=∅. Both segments lie in int⁡D2 because that disc is convex and all three endpoints do, so the concatenation [x,z]∪[z,y] is a path in int⁡D2∖Q from x to y.

1.3F3F4

Conjugation and the constant loop. By [F3] every path c from x0 to x1 gives an isomorphism φc:π1(X,x0)→π1(X,x1) with inverse φcˉ; by [F4] the constant loop at a point represents the identity class, so if c is the constant path at x0 then φc is the identity map of π1(X,x0), since (cˉ∗α)∗c differs from α only by insertions of constant loops at the endpoints.

2.1constructstep 1.1F2

The disc section. Put s′:=h(n)∘s∘(h−1)(n−1) on Fn−1(int⁡D2), where h(k)(u1,…,uk):=(h(u1),…,h(uk)); explicitly s′(v1,…,vn−1)=(v1,…,vn−1, h(1+∑i<n∣ui∣)) with ui=h−1(vi). This is continuous as a composite of continuous maps, and it takes values in Fn(int⁡D2): the last coordinate h(1+∑i∣ui∣) lies in int⁡D2, and it differs from vi=h(ui) because h is injective and 1+∑i∣ui∣=ui is impossible — taking moduli would give 1+∑i∣ui∣=∣ui∣≤∑i∣ui∣. Composing with p~ returns the given tuple, so p~∘s′=id⁡; thus s′ is a continuous section of p~, transported from s as defined.

3.1step 1.2step 1.3step 2.1F3F4discharge-construct

The based splitting. Let F:=p~−1(q′)={(q1,…,qn−1,x):x∈int⁡D2∖{q1,…,qn−1}} be the fibre over q′; it contains q, since qn≠qi for i<n, and it contains s′(q′) by step 2.1. The fibre is homeomorphic to int⁡D2∖{q1,…,qn−1} and hence path-connected by step 1.2 applied to the finite set Q={q1,…,qn−1}. Choose a path α:I→F from q to s′(q′); such a path exists, and choosing it is a single selection, not an instance of AC. Write ι:F→Fn(int⁡D2) for the inclusion and φα:π1(Fn(int⁡D2),q)→π1(Fn(int⁡D2),s′(q′)) for the conjugation isomorphism of [F3], and define σ:=φαˉ∘s∗′:π1(Fn−1(int⁡D2),q′)→π1(Fn(int⁡D2),q), where s∗′ is induced at the basepoint q′ and φαˉ([β])=[(α∗β)∗αˉ]. For [γ]∈π1(Fn−1(int⁡D2),q′), the path p~∘((α∗(s′∘γ))∗αˉ)=(p~∘α)∗(p~∘s′∘γ)∗(p~∘αˉ) has the constant paths p~∘α and p~∘αˉ at q′ as outer factors, because α lies in the fibre over q′, and its middle factor is p~∘s′∘γ=γ by step 2.1; by [F4] and step 1.3 this class equals [γ] in π1(Fn−1(int⁡D2),q′), so p~∗∘σ=id⁡ and p~∗ is split surjective.

The section is explicit, the basepoint adjustment uses one path in one fibre, and no selection over an infinite family is made; the construction is therefore choice-free. ∎

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

The pure braid extension splits as a semidirect product

Statement

Assume the Axiom of Choice and let n≥2, with the notation PBn, PBn−1, Fn−1 and the forgetful homomorphism φ of The Fadell-Neuwirth short exact sequence for pure braids. Then the section of the planar forgetful map from A choice-free continuous section of planar coordinate forgetting, adjusted at the basepoint by a path in the puncture fibre, induces a group homomorphism s:PBn−1⟶PBnwithφ∘s=id⁡PBn−1, and consequently the extension splits: PBn≅Fn−1⋊PBn−1, the semidirect product formed with the action of PBn−1 on the free kernel Fn−1 given by conjugation with the chosen section, g⋅x=s(g) x s(g)−1. The action depends on the chosen section and the path that adjusts it; no trivial action and no direct-product decomposition are asserted.

Facts & Assumptions

Given: the Axiom of Choice, an integer n≥2, a base configuration q=(q1,…,qn)∈Fn(int⁡D2) with q′=(q1,…,qn−1), and the fibre Mn−1=int⁡D2∖{q1,…,qn−1} of the last-coordinate forgetful map.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]
[F2]

Under AC the forgetful map φ:PBn→PBn−1 of the closed-disc convention sits in the short exact sequence 1→Fn−1→κPBn→φPBn−1→1, where κ is induced by the inclusion x↦(q1,…,qn−1,x) of the fibre and φ is induced by forgetting the last coordinate; in the open-disc model these maps are i∗ and p∗ for the fibration p:Fn(int⁡D2)→Fn−1(int⁡D2), and the inclusion ι∗F identifies the two models (The Fadell-Neuwirth short exact sequence for pure braids).

[F3]

For n≥2, every path α in Mn−1 from q to the value s′(q′) of the transported planar section induces by path conjugation a homomorphism σ:π1(Fn−1(int⁡D2),q′)→π1(Fn(int⁡D2),q) with p∗∘σ=id⁡, and the conjugation isomorphism is the one of Conjugating loop classes by a path is an isomorphism of fundamental groups; the construction uses no choice principle (A choice-free continuous section of planar coordinate forgetting).

[F4]

For a short exact sequence 1→N→iG→πH→1: a homomorphic section s:H→G of π exists exactly when the extension splits, exactly when G≅(ker⁡π)⋊H compatibly with the injection and quotient, and for a given section the action is h⋅x=s(h)xs(h)−1 (Splitting lemma for groups: a section, a complement, and a semidirect-product decomposition are equivalent).

[F5]

For a group extension 1→N→E→Q→1 that admits a homomorphic section, the extension is equivalent to 1→N→N⋊Q→Q→1 for the corresponding action (A group extension splits exactly when it has a complement or a compatible semidirect-product model, and a kernel retraction forces a direct product).

[F6]

Induced maps on fundamental groups are functorial, (g∘f)∗=g∗∘f∗, and for the inclusions and forgetful maps of the two models the identity pD∘ιF=ιF∘p of maps holds because both sides forget the last coordinate (Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).

Proof

technique · direct
1.1A1F1

Choice bookkeeping. By [F1] the Axiom of Choice [A1] yields DC, so the short exact sequence of [F2] is available; the explicit section itself is choice-free and AC enters only through that published sequence.

1.2F3

The based section in the open model. Fix a path α in Mn−1 from q to s′(q′), which exists by [F3] and is a single selection, not an instance of AC; by [F3] the resulting homomorphism σ:π1(Fn−1(int⁡D2),q′)→π1(Fn(int⁡D2),q) satisfies p∗∘σ=id⁡.

1.3F2

The short exact sequence. By [F2] the sequence 1→Fn−1→κPBn→φPBn−1→1 is exact, and the isomorphisms ι∗F transport the open-disc maps i∗, p∗ to κ, φ.

1.4F4F5

The splitting criterion. By [F4] a homomorphic section of φ exists exactly when the extension splits, exactly when PBn≅Fn−1⋊PBn−1 compatibly with κ and φ, with action g⋅x=s(g)xs(g)−1 for a given section; by [F5] the same conclusion is the semidirect-product model of the split extension.

1.5F6

Naturality of the transport. Both pD and p forget the last coordinate, so pD∘ιF=ιF∘p as maps; by the functoriality [F6] the induced maps satisfy p∗D∘ι∗F=ι∗F∘p∗ on fundamental groups at configurations of interior points.

2.1step 1.2step 1.3step 1.5

A section for φ. Define s:PBn−1→PBn by s:=ι∗F∘σ∘(ι∗F)−1, where ι∗F is the isomorphism of [F2] at the relevant configurations. Then φ∘s=p∗D∘ι∗F∘σ∘(ι∗F)−1=ι∗F∘p∗∘σ∘(ι∗F)−1=ι∗F∘(ι∗F)−1=id⁡PBn−1, using the naturality of step 1.5 and p∗∘σ=id⁡ from step 1.2; being a composite of group homomorphisms, s is a homomorphism.

3.1step 1.4step 2.1

The semidirect product. Step 2.1 exhibits a homomorphic section of φ, so the criterion of [F4] applies and the extension of [F2] splits with PBn≅Fn−1⋊PBn−1 and action g⋅x=s(g)xs(g)−1. The decomposition is built from the particular section s and the particular path α, both non-canonical: choosing another path or another section changes the action by an inner automorphism of Fn−1 in general, and no trivial action, direct product, or independence-of-choice statement is asserted.

The section is the based version of the explicit planar cross-section, the extension is the published choice-dependent Fadell–Neuwirth sequence, and no claim is made that the splitting is canonical. ∎

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Ordered planar configuration spaces are aspherical

Statement

Assume the Axiom of Choice. For every n≥1, every k≥2 and every base configuration q∈Fn(int⁡D2) one has πk(Fn(int⁡D2),q)=0. The same conclusion holds for Fn(C) and for Fn(D2) under the coordinatewise radial homeomorphism C→int⁡D2 and the published inclusion homotopy equivalence. Consequently the open-disc and plane ordered configuration spaces are K(PBn,1) in the higher-homotopy sense: their fundamental group is PBn in the convention of The pure braid group PBn as the fundamental group of an ordered configuration space and all higher homotopy groups vanish.

Facts & Assumptions

Given: the Axiom of Choice, an integer n≥1, a base configuration q=(q1,…,qn)∈Fn(int⁡D2), and the fibre spaces Mn−1:=int⁡D2∖{q1,…,qn−1} for n≥2.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]
[F2]

For M=int⁡D2 and n≥2 the last-coordinate map p:Fn(int⁡D2)→Fn−1(int⁡D2) is, under AC and DC, a numerable locally trivial bundle with fibre over q′ equal to F1(M∖Qq′)=M∖Qq′, hence a Hurewicz and therefore Serre fibration (The Fadell-Neuwirth forgetful map: local triviality, constant fibre, and numerability for configurations in the disk).

[F3]

For a based Serre fibration p:(E,e0)→(B,b0) with fibre F=p−1(b0) the long exact sequence is exact wherever there is an incoming and outgoing arrow; in particular the segment πk(F)→i∗πk(E)→p∗πk(B)→∂pπk−1(F) is exact for every k≥1 (Long exact sequence of homotopy groups of a fibration).

[F4]

For every finite set Q of distinct points of int⁡D2 the complement int⁡D2∖Q has πj=0 for every j≥2, and int⁡D2 itself is contractible; under the explicit radial homeomorphism the same holds for C minus finitely many points (A finitely punctured open disk has the homotopy type of a finite wedge of circles).

[F5]

For every m≥1 and every base configuration c∈Fm(int⁡D2) one has π2(Fm(int⁡D2),c)=0 (Vanishing π2 for every ordered planar configuration space).

[F6]

The inclusion ιF:Fm(int⁡D2)→Fm(D2) is a homotopy equivalence inducing isomorphisms on all homotopy groups, and the coordinatewise radial map restricts to a homeomorphism Fm(C)→Fm(int⁡D2); homotopy equivalences induce isomorphisms on all πk, k≥1, and based homotopy equivalences may be used to transfer vanishing statements (The interior-disc and closed-disc configuration spaces are homotopy equivalent, Higher homotopy basepoint transport and moving homotopies).

[F7]

PBm=π1(Fm(D2),c)=π1(Fm(int⁡D2),c) for a base configuration c of interior points, by the definition and its displayed inclusion isomorphism (The pure braid group PBn as the fundamental group of an ordered configuration space).

Proof

technique · induction on $n$ for fixed degree $k\ge3$
1.1F4

Fibre degree vanishing. Let Q be any finite set of distinct points of int⁡D2. By [F4] the complement int⁡D2∖Q has πj=0 for every j≥2; in particular, for every k≥3, both groups πk(int⁡D2∖Q) and πk−1(int⁡D2∖Q) vanish.

1.2A1F1F2

The forgetful fibration. By [F1] the Axiom of Choice [A1] yields DC, so for n≥2 the map p:Fn(int⁡D2)→Fn−1(int⁡D2) forgetting the last coordinate is a Hurewicz fibration with fibre Mn−1 over q′, by [F2]; the fibre contains q because qn≠qi for i<n.

1.3baseF4

Base case n=1. For n=1 single-coordinate evaluation gives F1(int⁡D2)≅int⁡D2, which is contractible by [F4]; a contractible space has vanishing πk for every k≥1, so πk(F1(int⁡D2),q)=0 for every k≥3 and every base configuration q.

1.4ih

Induction hypothesis. Fix k≥3, fix n≥2 and assume that πk(Fn−1(int⁡D2),c)=0 for every base configuration c∈Fn−1(int⁡D2).

1.5F5

Degree two. For every m≥1 and every base configuration c∈Fm(int⁡D2) one has π2(Fm(int⁡D2),c)=0 by [F5]; this is the case k=2 and needs no induction.

1.6F6

Transferring vanishing. By [F6] the coordinatewise radial homeomorphism gives a homeomorphism Fm(C)≅Fm(int⁡D2) for every m, and the inclusion Fm(int⁡D2)→Fm(D2) is a homotopy equivalence; both induce isomorphisms on all πk with k≥1, so a vanishing statement transfers across them at corresponding basepoints.

2.1step 1.1step 1.2step 1.4F3

The induction step. Fix k≥3, let q∈Fn(int⁡D2) be an arbitrary base configuration with n≥2 and put q′:=(q1,…,qn−1). By step 1.2 the map p is a based Serre fibration with e0=q, b0=q′ and fibre Mn−1, so the exact segment πk(Mn−1)→i∗πk(Fn(int⁡D2),q)→p∗πk(Fn−1(int⁡D2),q′)→∂πk−1(Mn−1) of [F3] is available; the outer terms πk(Mn−1) and πk−1(Mn−1) vanish by step 1.1, since k≥3 and k−1≥2, and πk(Fn−1(int⁡D2),q′)=0 by the induction hypothesis of step 1.4. Exactness then gives im⁡(i∗)=ker⁡(p∗)=0 and im⁡(p∗)=ker⁡(∂)=0, so p∗ is both injective and zero and therefore πk(Fn(int⁡D2),q)=0.

3.1step 1.3step 2.1discharge-induction

Induction conclusion. Step 1.3 is the base case and step 2.1 proves the successor implication for arbitrary n≥2 and arbitrary base configuration, so for every fixed k≥3 and every n≥1 one has πk(Fn(int⁡D2),q)=0.

4.1step 1.5step 1.6step 3.1F7discharge-induction

All degrees and all models. Combining step 3.1 with step 1.5 covers every k≥2 and every base configuration in the open-disc model; applying step 1.6 gives the same vanishing for Fn(C) and Fn(D2), and [F7] identifies the fundamental group of the open-disc and plane models with PBn, so these spaces are K(PBn,1) in the higher-homotopy sense.

The induction is on the number of strands for each fixed degree k≥3; the case k=2 was proved separately in advance and is not derived from any point-pushing statement. ∎

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Unordered planar configuration spaces are aspherical

Statement

Assume the Axiom of Choice. For every n≥1, every k≥2 and every basepoint b∈Cn(int⁡D2) one has πk(Cn(int⁡D2),b)=0. The same conclusion holds for the unordered configuration spaces Cn(C) and Cn(D2) under the coordinatewise radial homeomorphism and the published unordered inclusion homotopy equivalence. Consequently the open-disc and plane unordered configuration spaces are K(Bnconf,1) in the higher-homotopy sense: their fundamental group is Bnconf in the convention of The configuration braid group Bnconf as the fundamental group of an unordered configuration space and all higher homotopy groups vanish.

Facts & Assumptions

Given: the Axiom of Choice, an integer n≥1, a basepoint b∈Cn(int⁡D2) with a chosen preimage x∈Fn(int⁡D2), and a degree k≥2.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]

For every m≥1, every j≥2 and every base configuration c∈Fm(int⁡D2) one has πj(Fm(int⁡D2),c)=0 (Ordered planar configuration spaces are aspherical).

[F2]

For the surface M=int⁡D2 the quotient map p:Fn(M)→Cn(M) is an n!-sheeted covering map, both Fn(M) and Cn(M) are path-connected, and p is regular; no choice principle is used (Ordered configuration spaces cover the unordered ones regularly with deck group Sn).

[F3]

Let Y be path-connected and locally path-connected and let f:(Y,y0)→(B,b0) be based, with p:(E,e0)→(B,b0) a covering; a based lift of f exists if and only if f∗π1(Y,y0)⊆p∗π1(E,e0) (Lifting criterion for maps from path-connected locally path-connected spaces).

[F4]

Let p:E→B be a covering, H:Y×I→B a homotopy and H~0:Y→E a lift of H(−,0); there is a unique lift H~:Y×I→E extending H~0 (Existence and uniqueness of homotopy lifts through a covering map).

[F5]

For every k≥2 the sphere Sk is simply connected, hence path-connected and locally path-connected (Sn is simply connected for every n≥2, Cubical and spherical models of higher homotopy agree).

[F6]

The unordered inclusion ιC:Cn(int⁡D2)→Cn(D2) is a homotopy equivalence, the coordinatewise radial map restricts to a homeomorphism Cn(C)→Cn(int⁡D2), and homotopy equivalences induce isomorphisms on all homotopy groups in degrees ≥1 (The interior-disc and closed-disc configuration spaces are homotopy equivalent, Higher homotopy groups are functorial and based homotopy invariant).

[F7]

Bnconf=π1(Cn(D2),[q]) for the orbit of a base configuration of interior points, and the inclusion of the open-disc model induces an isomorphism π1(Cn(int⁡D2),[q])→Bnconf (The configuration braid group Bnconf as the fundamental group of an unordered configuration space).

Proof

technique · direct
1.1A1F1

Ordered vanishing. Under the standing assumption [A1], which discharges the Axiom-of-Choice hypothesis of [F1], the ordered result applies: for the chosen preimage x∈Fn(int⁡D2) of b one has πk(Fn(int⁡D2),x)=0 for the degree k≥2; that is, every based map Sk→Fn(int⁡D2) at x is based-homotopic to the constant map.

1.2F2F3F4F5

Covering and lifting tools. By [F2] the quotient p:Fn(int⁡D2)→Cn(int⁡D2) is a covering with both spaces path-connected; by [F5] the sphere Sk is path-connected, locally path-connected and simply connected with π1(Sk,s0)=1 for k≥2; the based lifting criterion [F3] and the homotopy lifting theorem [F4] are therefore available for based maps out of (Sk,s0).

1.3F6

Transferring along the disc models. The coordinatewise radial map gives homeomorphisms Cn(C)≅Cn(int⁡D2), and the unordered inclusion ιC:Cn(int⁡D2)→Cn(D2) is a homotopy equivalence; by [F6] both induce isomorphisms on πj for every j≥1, so vanishing of πk transfers between the three models at corresponding basepoints.

2.1step 1.2F3

Lifting a based sphere. Let u:(Sk,s0)→(Cn(int⁡D2),b) be a based map. Its induced map on π1 is trivial because π1(Sk,s0)=1 by step 1.2, so u∗π1(Sk,s0)={1}⊆p∗π1(Fn(int⁡D2),x) and the lifting criterion [F3] provides a based lift u~:(Sk,s0)→(Fn(int⁡D2),x) with p∘u~=u.

3.1step 1.1step 2.1F4

Nullhomotoping the lift and projecting. By step 1.1 the based class [u~]∈πk(Fn(int⁡D2),x) is trivial, so there is a based homotopy H~:Sk×I→Fn(int⁡D2) from u~ to the constant map at x with H~(s0,t)=x for all t. Then p∘H~:Sk×I→Cn(int⁡D2) is a based homotopy from u=p∘u~ to the constant map at b, because p(x)=b; hence u is nullhomotopic as a based map, and [u]=0 in πk(Cn(int⁡D2),b).

4.1step 3.1

Vanishing for the unordered open-disc model. Since u was an arbitrary based map out of (Sk,s0) with arbitrary basepoint b and arbitrary k≥2, step 3.1 shows that every based class in πk(Cn(int⁡D2),b) is trivial, so πk(Cn(int⁡D2),b)=0.

5.1step 1.3step 4.1F7

The other models and the K(Bnconf,1) reading. By step 1.3 the vanishing of step 4.1 transfers to πk(Cn(C),b′) and πk(Cn(D2),b′′) for arbitrary basepoints, and [F7] identifies the fundamental groups of the open-disc and plane models with Bnconf; hence these spaces have fundamental group Bnconf and vanishing higher homotopy groups, that is, they are K(Bnconf,1) in the higher-homotopy sense.

The proof lifts sphere classes to the ordered configuration space, where they vanish by ordered asphericity, and projects the nullhomotopy; the covering is used through its lifting properties only, and the case k=2 of the ordered input was proved without point pushing. ∎

DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

Standard geometric pure braid generators A_ij

Definition

Fix n∈N and let Q=(q1,…,qn) be the base configuration and σ1,…,σn−1 the positive elementary half twists of The elementary geometric half twist, its support disc, and its opposite, with classes [σi] in the geometric braid group Gn at Q and with [σi]−1=[σi−]. Write ⋆ for first-under-second stacking, so that [γ⋆β]=[γ][β]. For indices 1≤i<j≤n put

Wij:=σj−1⋆σj−2⋆⋯⋆σi+1⋆σi2⋆σi+1−1⋆⋯⋆σj−2−1⋆σj−1−1,

the stacking of the displayed half twists and their opposites in the order written: by the convention of Stacking of geometric braids is a well-defined associative operation on isotopy classes the right factor of each stacking lies in the lower half of the height interval and runs first, so the rightmost factor σj−1−1 is the bottom one and the leftmost factor σj−1 the top one. When j=i+1 both outer blocks are empty and Wi,i+1=σi2. The standard pure braid generators are the classes

Aij:=[Wij]∈Gn(1≤i<j≤n).

The same letters name the corresponding elements of the pure configuration braid group, in the following precise sense.

The generators are pure. The endpoint-permutation homomorphism πgeo:Gn→Sn (written π in The Artin presentation surjects onto the geometric braid group) sends [σr] to the transposition of r and r+1, as computed for the half twists in The elementary geometric half twist, its support disc, and its opposite. Since πgeo(σi2)=id and πgeo is a homomorphism, the outer word cancels its own inverse:

πgeo(Aij)=πgeo(σj−1⋯σi+1)⋅id⋅πgeo(σj−1⋯σi+1)−1=id.

Hence Aij lies in the pure geometric braid subgroup Gnpure=ker⁡πgeo. This uses only that πgeo is a homomorphism and that two half twists of one pair return each of the two strands to its starting point; the intermediate permutation πgeo(σj−1⋯σi+1), which fixes label i and permutes only the labels i+1,…,j, is irrelevant for the computation.

Identification with the configuration group. By Pure geometric braids and ordered configuration loops the map

Ψ:Gnpure⟶PBn,Ψ([β])=(ι∗F[zβ])−1,

is an isomorphism onto the pure configuration braid group, where zβ is the coordinate path of the representative β and ι∗F is induced by the inclusion of the open disc. An element of PBn that equals Ψ(Aij) for some 1≤i<j≤n is again written Aij. In particular, whenever a statement about PBn names Aij, it means this image under the published isomorphism, and the inverse sign in Ψ is part of the definition. Ordering statements about the generators therefore refer to the geometric classes [Wij], or equivalently to their images in PBn.

Convention and scope. The classes [Wij] are finite products of the geometric half twists and their inverses, and every step of the construction is explicit: no choice principle is used. The definition invokes The Artin presentation surjects onto the geometric braid group only to record that the same letters σr may be read as the image of the corresponding letters of the Artin presentation; neither injectivity of that presentation nor completeness of its relations is asserted or used. Nor does the definition assert that the family {Aij} generates PBn, nor that any particular list of relations between the Aij is complete. For n≤1 the index set {1≤i<j≤n} is empty and the family {Aij} is empty; PBn is trivial there.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

The Ain are meridian generators of the forgetful free kernel

Statement

Assume the Axiom of Choice and let n≥2, with the notation PBn, PBn−1, Fn−1, φ and κ of The Fadell-Neuwirth short exact sequence for pure braids, and the standard geometric generators Aij of Standard geometric pure braid generators A_ij. Then, under the identification Fn−1≅ker⁡φ given by κ, the n−1 elements Ψ([A1n]),…,Ψ([An−1,n]) are a free basis of ker⁡φ. There is a compatible system of pairwise interior-disjoint stems from qn to small circles around q1,…,qn−1 such that, if γi is the counterclockwise based meridian of qi along the i-th stem, then Ψ([Ain])=(κ∗[γi])−1(1≤i<n). Thus each displayed element is the clockwise based meridian in the fibre.

Facts & Assumptions

Given: AC, n≥2, the equally spaced base configuration Q=(q1,…,qn), positive half twists σi with supports Ui, the first-under-second stacking convention, the fibre Yn=int⁡D2∖{q1,…,qn−1} based at qn, and the notation Ψ,κ,φ of the cited braid and forgetting maps.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]
[F2]

Under AC the last-coordinate forgetful map gives the short exact sequence 1→Fn−1→κPBn→φPBn−1→1, where Fn−1=π1(Yn,qn), κ is induced by x↦(q1,…,qn−1,x) followed by the open-to-closed configuration isomorphism, and φ is induced by dropping the last coordinate (The Fadell-Neuwirth short exact sequence for pure braids, The Fadell-Neuwirth forgetful map: local triviality, constant fibre, and numerability for configurations in the disk).

[F3]

The space Yn is homotopy equivalent to a wedge of n−1 circles; its fundamental group is free of rank n−1, and it has a counterclockwise meridian free basis for some choice of stems (A finitely punctured open disk has the homotopy type of a finite wedge of circles). The regular-neighborhood argument in step 4.1 establishes the basis property for the particular compatible stems used here.

[F4]

The positive half twist σi is supported in the open disc Ui of radius 3h/2 centered at mi, where qi=mi−(h,0), qi+1=mi+(h,0), and all other base points lie outside Ui; the discs satisfy Ui∩Uj=∅ when ∣i−j∣>1 (The elementary geometric half twist, its support disc, and its opposite).

[F5]

The standard generator is Ain=σn−1⋯σi+1σi2σi+1−1⋯σn−1−1, with the rightmost factor traversed first under first-under-second stacking (Standard geometric pure braid generators A_ij, Stacking of geometric braids is a well-defined associative operation on isotopy classes, The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism).

[F6]

The pure geometric braid group is identified with PBn by Ψ([β])=(ι∗F[zβ])−1, where zβ is the ordered coordinate loop of β (Pure geometric braids and ordered configuration loops).

[F7]

The braid-to-mapping-class isomorphism sends σi to the class of an orientation-preserving homeomorphism Hi supported in Ui and exchanging qi,qi+1 (Braid group as boundary-fixed punctured-disk mapping classes).

[F8]

For a based point-motion loop, the associated point-pushing mapping class is represented by the inverse endpoint of an ambient lift. For the last puncture, the point-pushing map satisfies Θn∘κ=Push⁡n, where Θn:PBn→PMod⁡(D2,Q;∂D2) is the isomorphism induced by the geometric-braid and mapping-class identifications; the evaluation fibration supplies ambient lifts for point motions (Point pushing the last puncture, Boundary map from point motions, Point pushing is the kernel of forgetting the last disk puncture, Evaluation boundary isomorphism for the disk).

[F9]

A braid word giσi2gi−1, with gi=σn−1⋯σi+1, maps under the braid-to-mapping-class homomorphism to hiΨnmc([σi2])hi−1, where hi=Hn−1∘⋯∘Hi+1; the rightmost homeomorphism acts first. This follows from the homomorphism and the ordinary composition law in the boundary-fixed mapping-class group (Braid group as boundary-fixed punctured-disk mapping classes, Boundary-fixed mapping class group of a punctured disk).

[F10]

Every finite polygonal disk admits a piecewise-linear parametrization, and any piecewise-linear boundary homeomorphism extends over it (Finite polygonal disk parametrizations and boundary surgery).

Proof

technique · direct
1.1A1F1F2F3F6

The free kernel to be identified. By [F1] the choice hypothesis [A1] supplies DC, so [F2] gives an injection κ with image ker⁡φ. The fibre Yn has free fundamental group of rank n−1 by [F3]. It remains to identify the individual Ain with a single coherent meridian basis, with the inverse sign from [F6].

1.2F4F7F8

The two-point winding calculation. For any 0<ϵi≤h/10, let Ci={z:∣z−qi∣=ϵi}, and let ci=qi+(ϵi,0) on it. For any simple local stem τi from qi+1 to ci in Ui∖{qi}, let λi be the based loop that follows τi, goes once counterclockwise around Ci, and returns along τˉi. The straight segment is one possible stem. For a pair in Ui=B(mi,R), R=3h/2, write u=(z2−z1)/∣z2−z1∣∈S1, r=∣z2−z1∣>0, and w=uˉ((z1+z2)/2−mi). Then F2(Ui)≅S1×C,C={(w,r)∈C×(0,∞):∣w−r/2∣<R, ∣w+r/2∣<R}. The inverse coordinate map is (u,w,r)↦(mi+u(w−r/2),mi+u(w+r/2)), so the displayed coordinates give a homeomorphism. The condition r>0 and the two inverse images of the convex disk B(0,R) make C convex and nonempty. Hence the winding of u induces an isomorphism π1(F2(Ui))≅Z. During the first positive half twist, the relative vector z2−z1 starts at 2h, follows the upper half of the diamond path to −2h, and its argument increases by π. In the second positive half twist, stacking matches the exchanged endpoints, so the same ordered pair follows the lower half of the diamond from −2h to 2h; its argument increases by another π. Thus the ordered loop of σi2 has relative winding +1. The point motion that fixes qi and moves qi+1 out along the stem to Ci, once counterclockwise around Ci, and back along the stem also has relative winding +1: the outgoing and return stem paths cancel in winding and the circle contributes +1. These two loops therefore have the same class in π1(F2(Ui)). Inserting all other stationary points gives the same equality in the full ordered configuration space, because Ui contains no other base point. By [F7] and the inverse-endpoint definition in [F8], the braid-to-mapping-class isomorphism Ψnmc:Gn→Mod⁡(D2,Q;∂D2) satisfies Ψnmc([σi2])=Push⁡qi+1([λi])−1.

2.1F5F7F8F9step 1.2

Conjugation transports the local point push. Fix radii and local stems satisfying step 1.2. For a marked point p∈Q and a based loop α in int⁡D2∖(Q∖{p}) at p, let Push⁡p([α]) be the mapping class of F1−1, where Ft is an ambient isotopy starting at the identity, fixing the boundary and every point of Q∖{p}, and satisfying Ft(p)=α(t). This class is well defined: it is the inverse-endpoint boundary-map value of the full configuration loop with the other marked points fixed, as in [F8]. It agrees with [F8] when p=qn. If h represents a mapping class preserving Q setwise and taking p to p′, then hFth−1 is an ambient lift of h∘α fixing every other marked point; its endpoint inverse is hF1−1h−1. Therefore, with the paths typed in the respective puncture complements, h Push⁡p([α]) h−1=Push⁡p′([h∘α]). Now put gi=σn−1⋯σi+1 and hi=Hn−1∘⋯∘Hi+1. The rightmost factor acts first: Hi+1 takes qi+1 to qi+2, then Hi+2 takes it to qi+3, and so on, while every Hj fixes qi and the circle Ci. Since ∣mi−qi∣=h and ϵi≤h/10, Ci⊂Ui. For j≥i+2, the supports Uj and Ui are disjoint by [F4]. For j=i+1, the center of Ui+1 is at distance 3h from qi, so every point of Ci is at distance at least 3h−h/10>3h/2 from that center; hence this circle too is outside the support. Thus all the stated fixes are pointwise. In particular hi(qi+1)=qn, hi(qi)=qi, and hi(Ci)=Ci. If τi is the local stem used in step 1.2, put τ^i:=hi∘τi; this is a stem from qn to Ci in Yn. Let γ^i be the based loop following τ^i, going counterclockwise around Ci, and returning along its reverse. The first-under-second word order in [F5] and the mapping-class homomorphism [F9] give the following. Put Θn:=Ψnmc∣Gnpure∘Ψ−1, the isomorphism PBn→PMod⁡(D2,Q;∂D2) of [F8]. The conjugation naturality just proved yields Θn(Ψ([Ain]))=Ψnmc([Ain])=hi Push⁡qi+1([λi])−1hi−1=Push⁡n([γ^i])−1. By [F8], this is Θn((κ∗[γ^i])−1). Injectivity of Θn proves Ψ([Ain])=(κ∗[γ^i])−1 for each i<n.

3.1

A coherent noncrossing system of transported stem classes. For 2≤m≤n and i<m, put hi(m):=Hm−1∘⋯∘Hi+1, with the empty composition for i=m−1, and let τ^i(m):=hi(m)∘τi be the transported stem of step 2.1 at rank m. Here the local stem τ1 is chosen at the base case, and each τm is chosen when the rank-m+1 fan is added; thus the same coherent family is used in steps 1.2 and 2.1. We construct, by induction on m, a fan of embedded arcs η1(m),…,ηm−1(m) whose relative endpoint-fixed homotopy classes are exactly those of τ^1(m),…,τ^m−1(m). At m=2, take C1 of radius h/10 and the straight stem from q2 to c1.

Suppose such a fan has been built at rank m<n. Its stems lie in ⋃j<mUj, and the new support Um is disjoint from all earlier supports except Um−1. Thus its intersections with Um lie in the convex lens L:=Um−1∩Um, which contains no marked point other than the root qm; the adjacent points qm−1,qm+1 lie outside L. Each target circle Ci, i<m, is outside Um: its center qi is at distance (2(m−i)+1)h≥3h from the center of Um, and its radius is at most h/10. Choose finite polygonal representatives of the existing embedded fan, perturbing them jointly so they remain pairwise disjoint away from the root, are in general position with ∂L, and have distinct boundary intersection points. Any portion of an old stem in Um lies in L. Remove each boundary-to-boundary excursion in L by the usual outermost-disk slide: an innermost such subarc cuts off the side not containing qm, a disk in the puncture-free lens with no other stem arc in its interior. Sliding across that disk removes two boundary intersections and preserves the relative class and disjointness; finitely many slides leave no return excursion. The target circles are outside Um. Moreover, the only side of ∂L through which an old stem can continue in the union of the old supports is the ∂Um side into Um−1∖Um; the other side enters the part of Um outside every old support. Thus the remaining initial segment of each old stem runs from qm to one point of ∂Um, and these exit points are distinct.

Replace these initial arcs by a radial fan in L with the same boundary endpoints in the same boundary order. Cutting the lens along the old arcs and this fan gives polygonal disks whose corresponding boundary maps extend over the disks by [F10]. Gluing the extensions gives a homeomorphism supported in L, fixing its boundary and qm, that carries the old initial arcs to the fan. Since L is convex with root qm, the Alexander isotopy centered at qm makes this a homotopy relative to the root and the exits on ∂L. This changes representatives but not the transported stem classes. The re-routing lies in L, which avoids qm+1, and fixes qm. The old fan also avoids qm+1 because it lies in ⋃j<mUj. Since Hm−1(qm)=qm+1, the re-routing and old fan map to paths and a homotopy in the next fiber, which has the new puncture qm removed. The supported map Hm now carries this fan to a fan rooted at qm+1, with exits fixed on ∂Um; it fixes q1,…,qm−1 and takes qm to qm+1, so it carries each transported class at rank m to its specified class at rank m+1.

The image fan cuts Um into sectors whose closures contain qm+1. The point qm lies in one such sector: it is not on the transported fan, since its preimage qm+1 lies outside ⋃j<mUj. Choose 0<ϵm≤h/10 so the closed disk about qm of radius ϵm is contained in that sector and misses the old fan; set Cm={∣z−qm∣=ϵm} and cm=qm+(ϵm,0). In the chosen sector's closure minus the open disk, take a simple arc from qm+1 to cm whose interior lies in the sector outside the closed disk and misses the old fan. This region is path connected: a closed disk contained in the interior of a disk sector removes only an interior disk, leaving a connected annular sector. The arc can be chosen simple by deleting loops from a polygonal path. This is a local stem τm⊂Um∖{qm} meeting Cm only at cm. It misses every older circle Ci because those circles lie outside Um. Adding it to the transported old fan gives a fan rooted at qm+1, with pairwise interior-disjoint stems, and all stems lie in ⋃j≤mUj.

The old circles remain fixed by Hm: for i≤m−2, Ui∩Um=∅; for i=m−1, every point of Cm−1 is within h/10 of qm−1, whose distance from the center of Um is 3h, while Um has radius 3h/2. Consequently the new fan arcs still end at the same ci and represent the classes [hi(m+1)∘τi] for i<m, together with the local class [τm] for i=m. At m=n the resulting disjoint fan stems have exactly the relative homotopy classes of the transported stems hi∘τi in step 2.1, so their based meridian classes are the [γ^i] there. Homotopic stems give homotopic based meridians; the conjugation identity just proved therefore gives Ψ([Ain])=(κ∗[γ^i])−1 for these compatible tree stems, rather than for an unrelated choice of meridians. [F4, F10, step 2.1]

4.1F2F3step 2.1step 3.1

These meridians are a free basis. Let T be the final fan tree formed by the stems from qn to ci. It is an embedded tree whose stems have pairwise disjoint interiors, and it meets each Ci only at ci. Take a closed regular neighborhood N of T∪C1∪⋯∪Cn−1 in Yn. It is a disk with n−1 holes: the tree joins the n−1 disjoint inner circles and has no cycles, so thickening it adds no further hole. Write Bi for its i-th inner boundary and B0 for its outer boundary. The puncture qi lies inside Bi, and Bi is parallel to Ci through an annular collar in N. The part of Yn inside each Bi is a punctured disk and radially deformation retracts onto Bi; the outside complement between B0 and ∂D2 is an annular collar that deformation retracts onto B0. These retractions are the identity on the corresponding boundary circles, so they glue to a deformation retraction of Yn onto N. Choose N as vertex disks and edge strips for the finite polygonal graph; collapsing each strip across its width to its core and each vertex disk onto its incident radial arcs gives a deformation retraction onto T∪C1∪⋯∪Cn−1. Collapsing the tree gives a wedge of n−1 circles. Each counterclockwise loop on Ci is homotopic in its collar in N to the counterclockwise loop on Bi, and the based loop that follows the i-th stem, traverses Ci counterclockwise, and returns therefore follows the corresponding circle summand once. Thus [γ^1],…,[γ^n−1] form a free basis of Fn−1; their inverses form a free basis as well. Since κ identifies this group with ker⁡φ by [F2], steps 2.1 and 3.1 prove both the free-basis assertion and the clockwise sign in the Statement.

5.1F2F6step 1.2step 2.1step 4.1

The sign and conclusion. For n=2, the calculation in step 1.2 says that the raw ordered loop of A12=σ12 has relative winding +1; the published identification [F6] inverts that loop, so its image is the clockwise meridian of winding −1. The same inverse is exactly the inverse-endpoint convention in steps 1.2 and 2.1, and no injectivity of an Artin presentation is used. This completes the proof. ∎

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-02Open item page →

All standard Aij generate PBn

Statement

Assume the Axiom of Choice. For every n≥1 let Q(n)=(q1(n),…,qn(n)) be the canonical base configuration of Geometric braids in the disc with setwise endpoints, so that hn=14(n+1) and qj(n)=((2j−n−1)hn,0). Let Aij∈PBn=π1(Fn(D2),Q(n)) be the standard pure braid generators of Standard geometric pure braid generators A_ij for 1≤i<j≤n. Then PBn=⟨Aij:1≤i<j≤n⟩, the subgroup generated by the classes Aij; for n=1 the family is empty and generates the trivial group PB1. This asserts generation only: no presentation, no completeness of any list of relations, and no statement about the Artin presentation of PBn is claimed. Once the statement is known at the canonical base configuration, a path in Fn(D2) from Q(n) to any other base configuration conjugates it to the corresponding statement there (Conjugating loop classes by a path is an isomorphism of fundamental groups).

Facts & Assumptions

Given: the Axiom of Choice and an integer n≥2 with the canonical base configurations Q(n), Q(n−1) of Geometric braids in the disc with setwise endpoints, the truncated configuration q′=(q1(n),…,qn−1(n))∈Fn−1(D∘), the open-disc configuration spaces Fn(D∘)⊆Fn(D2) and Fn−1(D∘)⊆Fn−1(D2), and the half twists σ1,…,σn−1 at Q(n).

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]
[F2]

PBm=π1(Fm(D2),q(m)) is the pure braid group of the closed-disc convention at the configuration q(m); the inclusion ιF:Fm(D∘)→Fm(D2) induces an isomorphism ι∗F:π1(Fm(D∘),c)→π1(Fm(D2),c) at every configuration c of interior points, PB0 and PB1 are trivial, and for m≥2 the last-coordinate forgetting map φ:PBm→PBm−1 fits into the short exact sequence 1→Fm−1→κPBm→φPBm−1→1 with κ injective, φ surjective and im⁡κ=ker⁡φ, where the base configurations are q∈Fm(int⁡D2) and its truncation q′; under the isomorphism ι∗F the map φ corresponds to the open-disc forgetting map p:(x1,…,xm)↦(x1,…,xm−1) (The pure braid group PBn as the fundamental group of an ordered configuration space, The Fadell-Neuwirth short exact sequence for pure braids, The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[F3]

At the base configuration Q(n) the kernel of the forgetting map φ:PBn→PBn−1 is free with free basis A1n,…,An−1,n, the standard generators of the last column, interpreted through the isomorphism Ψ of [F4] (The Ain are meridian generators of the forgetful free kernel).

[F4]

The standard generators are the classes Aij=Ψ([Wij]) of the words Wij=σj−1⋯σi+1σi2σi+1−1⋯σj−1−1 (first-under-second stacking, empty outer blocks for j=i+1), where Ψ([β])=(ι∗F[zβ])−1 for the coordinate path zβ of a pure geometric braid β; Ψ is an isomorphism Gmpure→PBm, so Aij=ι∗F((aij)−1) for the open-disc class aij=[zWij], and the word identity gives [γ⋆β]=[γ][β] (Standard geometric pure braid generators A_ij, Pure geometric braids and ordered configuration loops, The pure braid group PBn as the fundamental group of an ordered configuration space).

[F5]

For the configuration Q(m) with hm=14(m+1) the half twist σr (1≤r≤m−1) is the motion (σr)r=mr+ρ, (σr)r+1=mr−ρ, all other strands fixed, with midpoint mr=qr+hm and diamond path ρ(m)(t)=hm⋅(2t−1,−2t) for t≤12 and hm⋅(2t−1,2t−2) for t≥12; the opposite half twist σr− replaces ρ by the reflection ρ−(t)=(ρ1(t),−ρ2(t)), and [σr−]=[σr]−1 (The elementary geometric half twist, its support disc, and its opposite).

[F6]

For a path γ from x0 to x1 the radial-shell transport is an isomorphism βγ:πm(X,x1)→πm(X,x0) with inverse transport by γˉ, and in degree one βγ[a]=[γ∗a∗γˉ]; if H is a homotopy of based cubes with basepoint track γ, meaning that every boundary face of the cube is mapped to γ, then [H(−,0)]=βγ[H(−,1)] (that is, f∗=βγg∗ for the corresponding maps). For m=1 the cube model is the loop model of the fundamental group (Higher homotopy basepoint transport and moving homotopies, Higher homotopy group by based cubes).

Proof

technique · induction on $n$
1.1baseF2

Base case. For n=1 the index set {1≤i<j≤1} is empty, and the subgroup generated by the empty family is the trivial group, which equals PB1 by [F2].

1.2ih

Induction hypothesis. Fix n≥2 and assume that the open-disc group π1(Fn−1(D∘),Q(n−1)) is generated by the classes akl(n−1)=[zWkl] of the standard words at Q(n−1), 1≤k<l≤n−1; equivalently, by [F4], that PBn−1 is generated by the classes Akl.

1.3A1F1F2F3F4

Choice, the exact sequence, and the kernel. By [F1] the Axiom of Choice [A1] yields DC, so the short exact sequence of [F2] is available at level n and base configuration Q(n), with truncation q′=(q1(n),…,qn−1(n)): the forgetting map φ:PBn→PBn−1 has im⁡κ=ker⁡φ and is surjective, and under the isomorphism ι∗F it corresponds to the open-disc forgetting map p:Fn(D∘)→Fn−1(D∘), so ker⁡p∗=(ι∗F)−1(ker⁡φ). By [F3] the kernel ker⁡φ is generated by A1n,…,An−1,n, and by [F4] (ι∗F)−1(Ain)=(ain(n))−1; since a subgroup generated by elements equals the one generated by their inverses, ker⁡p∗=⟨a1n(n),…,an−1,n(n)⟩.

1.4F5

The affine comparison of the two configurations. Write hm=14(m+1) for the configurations of [F5], so that hn−1=n+1nhn, and for t∈I define the similarity gt(z):=(1+tn)z+t (hn−1,0) of R2, so that g0=id⁡ and g1 is the scaling z↦n+1nz followed by the translation by (hn−1,0). For 1≤j≤n−1 one computes g1(qj(n))=n+1n(2j−n−1)hn+(hn−1,0)=((2j−n−1)hn−1+hn−1,0)=((2j−n)hn−1,0)=qj(n−1), and the same computation gives g1(mr(n))=mr(n−1) for the midpoints, 1≤r≤n−2. Since the diamond paths of [F5] are ρ(m)=hmρ(1) for the fixed normalised shape ρ(1) given by ρ(1)(t)=(2t−1,−2t) for t≤12 and ρ(1)(t)=(2t−1,2t−2) for t≥12, one gets n+1nρ(n)=hn−1ρ(1)=ρ(n−1). Consequently g1(mr(n)±ρ(n)(s))=g1(mr(n))±n+1nρ(n)(s)=mr(n−1)±ρ(n−1)(s), and the same equality holds for the reflected displacement ρ−; the similarity g1 has real coefficients and therefore commutes with the reflection R(x,y)=(x,−y) that defines σr− in [F5].

2.1step 1.4F4F5

The comparison homotopy. Fix 1≤i<j≤n−1 (there are no such pairs when n=2). Let z=zWij(n) be the coordinate path of the representative of Wij at Q(n) built from the motions of [F5], a loop in Fn(D∘), and put u:=[υ] for the loop υ(s):=(z1(s),…,zn−1(s)) in Fn−1(D∘), so that u=p∗(aij(n)); let ζ be the corresponding coordinate path of Wij at Q(n−1) and v:=[ζ]=aij(n−1). Every strand of the word moves only inside the support discs Ur of the half twists with r≤n−2 and off the last strand, so ∣zk(s)∣≤(n−2)hn+32hn=(n−12)hn for all k,s (the fixed strands are the base points, of norm at most (n−1)hn). Because each factor of the word and each factor of ζ is built from the same normalised diamond paths and the midpoints correspond under g1 by step 1.4, and because g1 respects stacking and time reparametrisation, the identities g1∘σr(n)=σr(n−1), g1∘(σr−)(n)=(σr−)(n−1) for r≤n−2 imply g1(υ(s))=ζ(s) for every s. Define H(s,t):=gt(υ(s)). By step 1.4 each gt is injective, so the n−1 coordinates of H(s,t) are pairwise distinct, and ∣Hk(s,t)∣≤(1+tn)(n−12)hn+t hn−1≤n+1n(n−12)hn+hn−1=n+1/24n<1, so H takes values in Fn−1(D∘) and is continuous; moreover H(−,0)=υ, H(−,1)=ζ, and the path η(t):=gt(q′) satisfies H(0,t)=gt(υ(0))=gt(q′)=η(t)=H(1,t) because υ(0)=υ(1)=q′. Thus H is a homotopy of based 1-cubes from υ to ζ whose boundary value is the path η in Fn−1(D∘) from q′ to Q(n−1).

3.1step 2.1F6

Transporting along the affine path. By step 2.1 the homotopy H has basepoint track η, so the moving-homotopy transport identity of [F6] in degree one gives u=βη(v), that is p∗(aij(n))=βη(aij(n−1)) for every 1≤i<j≤n−1, where βη:π1(Fn−1(D∘),Q(n−1))→π1(Fn−1(D∘),q′) is the isomorphism of [F6].

4.1step 1.2step 3.1F6

The images of the older generators generate the quotient. Let K:=⟨aij(n):1≤i<j≤n⟩≤π1(Fn(D∘),Q(n)) be the subgroup generated by all the raw standard words at level n. Since p∗ is a homomorphism and the index set splits into the cases j≤n−1 and j=n, one has p∗(K)=⟨p∗(aij(n)):1≤i<j≤n−1⟩=⟨βη(aij(n−1)):1≤i<j≤n−1⟩=βη(π1(Fn−1(D∘),Q(n−1))), where the last equality uses that the classes aij(n−1) generate the group by the induction hypothesis of step 1.2 and that βη is an isomorphism; hence p∗(K)=π1(Fn−1(D∘),q′).

5.1step 1.3step 4.1

Lifting generation to level n. By step 1.3 the classes a1n(n),…,an−1,n(n) lie in K and generate ker⁡p∗, so ker⁡p∗⊆K. Let g∈π1(Fn(D∘),Q(n)). By step 4.1 there is h∈K with p∗(h)=p∗(g), hence gh−1∈ker⁡p∗⊆K and therefore g=(gh−1)h∈K. So K=π1(Fn(D∘),Q(n)).

6.1step 1.1step 5.1F2F4discharge-induction

The closed-disc statement and induction conclusion. Applying the isomorphism ι∗F of [F2] to the equality of step 5.1 gives PBn=ι∗F(K)=⟨ι∗F(aij(n))⟩, and by [F4] ι∗F(aij(n))=Aij−1, so PBn=⟨Aij−1:1≤i<j≤n⟩=⟨Aij:1≤i<j≤n⟩, which is the statement at level n; step 1.1 is the base case, so by induction PBn is generated by the standard generators for every n≥1.

The comparison of the two base configurations is carried out by the explicit similarities gt, so no Artin-presentation completeness is used: only the short exact sequence, the free kernel with its standard basis, and the geometric words enter. ∎

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

Pure braid groups are torsion-free

Statement

Assume the Axiom of Choice. For every n≥0 the pure braid group PBn=π1(Fn(D2),q) of The pure braid group PBn as the fundamental group of an ordered configuration space is torsion-free: if g∈PBn and m≥1 satisfy gm=e, then g=e. Equivalently, every nonidentity element of PBn has infinite order.

Facts & Assumptions

Given: the Axiom of Choice and an integer n≥0; the pure braid groups PBn of the closed-disc convention, with the same base configuration q fixed throughout.

[A1]

The Axiom of Choice holds (The Axiom of Choice).

[F1]

PB0 and PB1 are the one-element groups, and the inclusion Fm(int⁡D2)→Fm(D2) induces an isomorphism π1(Fm(int⁡D2),q)→PBm at every configuration of interior points (The pure braid group PBn as the fundamental group of an ordered configuration space).

[F2]

Assume AC and let n≥2. The last-coordinate forgetful map φ:PBn→PBn−1 fits into a short exact sequence 1→Fn−1→κPBn→φPBn−1→1 with κ injective, φ surjective and im⁡κ=ker⁡φ, where Fn−1=π1(int⁡D2∖{q1,…,qn−1},qn) is a free group (The Fadell-Neuwirth short exact sequence for pure braids).

[F3]

Every free group is torsion-free: if G is free, x∈G and m≥1 satisfy xm=e, then x=e (Free groups are torsion-free).

[F4]

In ZF, AC implies DC, so the choice hypothesis of [F2] is available under [A1] (AC implies DC implies countable choice).

Proof

technique · induction on $n$
1.1baseF1

The base cases. By [F1] the groups PB0 and PB1 are one-element groups, so their only element is the identity and is not a nonidentity element of finite order; hence PB0 and PB1 are torsion-free.

1.2F3

The torsion-freeness of the free fibre. By [F3] every free group is torsion-free; in particular this applies to the group Fn−1 of the exact sequence in [F2], so that if x∈Fn−1 and xm is the identity of Fn−1 for some m≥1, then x is the identity.

1.3A1F2F4

The exact sequence used in the successor step. Let n≥2. The Axiom of Choice [A1] holds, so by [F4] the choice hypothesis of [F2] is met and [F2] supplies the short exact sequence 1→Fn−1→κPBn→φPBn−1→1 for the last-coordinate forgetful map φ: the map φ is a surjective homomorphism, κ is an injective homomorphism, and im⁡κ=ker⁡φ. The Axiom of Choice is used only to invoke [F2]; no further choice is made in this proof.

1.4ih

Induction hypothesis. Fix n≥2 and assume that PBn−1 is torsion-free: every y∈PBn−1 with ym=e for some m≥1 equals e.

2.1step 1.3step 1.4step 1.2

The successor step. Let g∈PBn and m≥1 satisfy gm=e, where e denotes the identity of PBn. Since φ is a homomorphism, φ(g)m=φ(gm)=φ(e)=e in PBn−1, so φ(g)=e by the induction hypothesis of step 1.4. Hence g∈ker⁡φ=im⁡κ, and there is x∈Fn−1 with g=κ(x). Then κ(xm)=κ(x)m=gm=e; since κ is injective, xm is the identity of Fn−1, so x is the identity by step 1.2, and therefore g=κ(x)=e. Thus every element of PBn of finite order is the identity, that is, PBn is torsion-free.

3.1step 1.1step 2.1discharge-induction

Induction conclusion. Step 1.1 establishes the statement for n=0 and n=1, and step 2.1 proves the successor implication for every n≥2; by induction on n, PBn is torsion-free for every n≥0.

The argument applies only to the pure braid groups: torsion-freeness of the kernel PBn and finiteness of the quotient Sn of the full braid group Bn are not used to make any claim about torsion in Bn itself. ∎

5 · Examples, counterexamples and false statements

None yet.

Sources