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.

✓ 3 results · all verified · 1 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 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Pure Braids, Fadell–Neuwirth, and Asphericity — Examples

1 · Prerequisites

2 · Summary

These four entries make the companion page concrete in the two lowest ranks, identify the standard generators geometrically, and delimit what the configuration braid extension can prove on its own. Each entry works at the canonical base configuration of the geometric-braids pages, with hn=14(n+1), and inherits the Axiom-of-Choice bookkeeping of the statement it consumes.

The first example computes the rank-two group. In the short exact sequence 1→F1→PB2→PB1→1 the quotient PB1 is trivial, so the fibre inclusion is an isomorphism: PB2 is free on one meridian class, hence infinite cyclic, generated by A12 as well as by its inverse. In the inverse-slicing identification Ψ the positive generator A12 is the clockwise meridian of the first puncture, of winding −1 relative to the counterclockwise spine basis; the example also notes that this agrees with the general torsion-freeness theorem in rank two.

The second example computes rank three and the splitting in action. The kernel of the forgetting homomorphism φ:PB3→PB2 is free on A13,A23, while PB2 is infinite cyclic. Its generator is the canonical two-strand A12 transported to the truncated base configuration Q′=(−1/8,0), where it is the image of A12∈PB3 under forgetting. With the far-right continuous section of the companion page, adjusted at the basepoint along a path in the puncture fibre so that it fixes the third point on a small representative of A12, the split extension reads PB3≅⟨A13,A23⟩⋊⟨A12⟩≅F2⋊Z. For the section chosen, and writing w:=A13A23, the action of the positive generator on the free kernel is conjugation x↦w−1xw, computed directly; no direct-product decomposition and no centre statement is claimed.

The third example matches the standard generators with point pushing. For 1≤i<j≤n the ordered slice of the word Wij is braid-isotopic to the motion in which only the j-th marked point moves, once counterclockwise around the i-th puncture along a standard meridian stem and back, the other strands returning to their base points; the base case is the explicit two-strand computation of the sibling pair, transported into the support disc of the full twist, and the inductive step slides the outer half twists off the excursion across the collar. Inverting the slicing, the class Aij in PBn is the clockwise meridian class of the fibre, and the braid–mapping-class isomorphism Θn=Ψnmc∘(Ψnconf)−1 of the companion page carries it to the point push of the j-th point clockwise around the i-th puncture; after relabelling the j-th point as the terminal coordinate, this is exactly the instance of Push⁡n computed in the sibling pair. Both inversions — the one in the configuration identification and the inverse-endpoint convention of the point-pushing definition — are displayed, and no injectivity of Push⁡n is used.

The counterexample isolates the invalid inference that the configuration braid sequence 1→PBn→Bnconf→Sn→1 would prove Bnconf torsion-free merely because its kernel is torsion-free and its quotient is finite. The abstract witness is 1→Z→Z×Z/2→Z/2→1: the kernel is torsion-free, the quotient has order two, and the middle group contains the element (0,[1]2) of order two, since [1]2≠[0]2 while 2[1]2=[0]2. The example makes no claim about torsion in the genuine braid group; it shows only that torsion-freeness needs the finer Fadell–Neuwirth argument of the companion page.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

The two-strand pure braid group is infinite cyclic

Example

Assume the Axiom of Choice and let Q(2)=(q1,q2) be the canonical base configuration of Geometric braids in the disc with setwise endpoints, so that PB2=π1(F2(D2),Q(2)) in the convention of The pure braid group PBn as the fundamental group of an ordered configuration space. Then PB2≅Z, generated by the geometrically positive two-strand full twist A12=σ12 of Standard geometric pure braid generators A_ij. Under the inverse-slicing identification of The Ain are meridian generators of the forgetful free kernel, the generator A12 corresponds to the clockwise meridian of q1 inside the once-punctured disc fibre, that is to the inverse of the counterclockwise meridian class; relative to the counterclockwise spine basis its winding is −1. The group PB2 is infinite cyclic and, in particular, torsion-free.

Facts & Assumptions

Given: the Axiom of Choice, the canonical base configuration Q(2)=(q1,q2) of interior points of the disc, and the truncation notation of The Fadell-Neuwirth short exact sequence for pure braids.

[A1]

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

[F1]
[F2]

Assume AC and let n≥2. With the base configuration Q(n) and its truncation q′, the forgetting map φ:PBn→PBn−1 sits in the short exact sequence 1→Fn−1→κPBn→φPBn−1→1 with κ injective, φ surjective and im⁡κ=ker⁡φ, and PB1 is trivial; here Fn−1=π1(int⁡D2∖{q1,…,qn−1},qn) is free on the n−1 positively oriented meridian classes of the punctures q1,…,qn−1 (The Fadell-Neuwirth short exact sequence for pure braids).

[F3]

Assume AC and let n≥2. Under the identification Fn−1≅ker⁡φ given by κ, the elements A1n,…,An−1,n of Standard geometric pure braid generators A_ij are a free basis of ker⁡φ, and the i-th of them corresponds to the clockwise meridian of the i-th puncture, the inverse of the counterclockwise spine-basis class (The Ain are meridian generators of the forgetful free kernel).

[F4]

The free group on X={γ1} has the reduced-word model, in which each element has a unique reduced word in γ1±1 (Reduced words form the free group on an alphabet). Since there is only one generator, a reduced word contains only γ1 or only γ1−1, so every element is uniquely γ1k for some k∈Z.

[F5]

Assume AC. For every n≥0 the pure braid group PBn is torsion-free (Pure braid groups are torsion-free).

Verification

technique · direct
1.1A1F1F2

The choice deduction and the exact sequence at n=2. By [F1] the Axiom of Choice [A1] yields DC, so the sequence of [F2] is available at n=2: 1→F1→κPB2→φPB1→1 with κ injective, im⁡κ=ker⁡φ, and F1=π1(int⁡D2∖{q1},q2). Since PB1 is trivial by [F2], φ has trivial codomain, so ker⁡φ=PB2 and im⁡κ=PB2: the map κ is a group isomorphism F1→PB2.

1.2F2F3

The fibre and its meridian basis. By [F2] the fibre group F1=π1(int⁡D2∖{q1},q2) is free on the single positively oriented meridian class of q1, written γ1, and by the case n=2 of [F3] the corresponding generator A12 corresponds under κ to the inverse class γ1−1, the clockwise meridian; that is, κ(γ1−1)=A12 and κ(γ1)=A12−1.

2.1step 1.1step 1.2F2F4

PB2 is infinite cyclic. By [F2] and [F4], every element of the free group F1 on {γ1} is uniquely γ1k for k∈Z. Concatenation followed by free reduction adds exponents, so ν:F1→(Z,+), ν(γ1k)=k, is a group isomorphism. Composing the negation automorphism k↦−k of Z with ν−1 and then with κ of step 1.1 gives the isomorphism Z→PB2, k↦κ(γ1−k)=A12k, by step 1.2. Thus PB2 is infinite cyclic, generated by A12, and its inverse sends A12 to 1, as claimed.

3.1step 1.2step 2.1F5

The winding sign and torsion-freeness. By step 1.2 the generator A12 corresponds under κ to γ1−1, the clockwise meridian of q1, while the counterclockwise spine-basis class is γ1 itself; the identification of step 1.2 therefore assigns to A12 the winding −1 relative to the counterclockwise basis, as claimed. The isomorphism in step 2.1 shows that PB2 is infinite cyclic and generated by A12; it is torsion-free by the general theorem [F5].

∎

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-02Open item page →

PB_3 as F_2 by Z, with its section action

Example

Assume the Axiom of Choice and let, with the standard pure braid generators of Standard geometric pure braid generators A_ij for n=3,

a:=A12,b:=A13,c:=A23∈PB3.

Then ⟨b,c⟩ is the kernel of the forgetting homomorphism φ:PB3→PB2, it is free on b,c, and PB2=⟨a⟩ is infinite cyclic. With the far-right section of A choice-free continuous section of planar coordinate forgetting — adjusted at the basepoint along a path in the fibre, so that on a small representative of a it fixes the third point — the extension splits and

PB3≅⟨b,c⟩⋊⟨a⟩≅F2⋊Z.

Writing w:=bc, the action of the positive generator a on the free kernel is

x⟼w−1xw(x∈F2),

for this section and the first-under-second convention. This does not assert a direct-product decomposition.

Facts & Assumptions

Given: the Axiom of Choice, the canonical base configuration Q=(q1,q2,q3) of The elementary geometric half twist, its support disc, and its opposite, so that h=116, q1=−18, q2=0 and q3=18; the half twists σ1,σ2 and the geometric braid group G3 of The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism; the open and closed ordered configuration spaces F3(int⁡D2)⊆F3(D2) and F2(int⁡D2)⊆F2(D2) at the base configurations Q and Q′:=(q1,q2); the pure braid groups PB3, PB2 and the forgetting homomorphism φ:PB3→PB2 of The Fadell-Neuwirth short exact sequence for pure braids.

[A1]

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

[F1]
[F2]

The standard generators are Aij=[Wij] with Wij=σj−1⋯σi+1σi2σi+1−1⋯σj−1−1 under first-under-second stacking, and the same letters denote their images under the isomorphism Ψ in PBn; for n=3 this gives A12=[σ12], A13=[σ2σ12σ2−1] and A23=[σ22] (Standard geometric pure braid generators A_ij).

[F3]

The geometric three strand relation holds: [σ1][σ2][σ1]=[σ2][σ1][σ2] in G3 (The geometric three strand braid relation).

[F4]

G3 is a group with product induced by stacking, [γ][β]=[γ⋆β], and the classes [σ1],[σ2] generate G3; the endpoint permutation πgeo:G3→S3 is a homomorphism with πgeo([σi]) the transposition of i and i+1, and G3pure=ker⁡πgeo (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, The Artin presentation surjects onto the geometric braid group, The elementary geometric half twist, its support disc, and its opposite).

[F5]

The map Ψ:Gnpure→PBn, Ψ([β])=(ι∗F[zβ])−1, is a group isomorphism, where zβ is the coordinate path of β and ι∗F is the open-to-closed isomorphism on fundamental groups of configuration spaces (Pure geometric braids and ordered configuration loops, The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[F6]

Under AC the sequence 1→F2→κPB3→φPB2→1 is short exact with im⁡κ=ker⁡φ, and under the identification of κ the elements A13,A23 are a free basis of ker⁡φ, each represented by the clockwise meridian of the corresponding puncture (The Fadell-Neuwirth short exact sequence for pure braids, The Ain are meridian generators of the forgetful free kernel).

[F7]

At the canonical two-point configuration Q(2)=(−1/12,1/12), PB2 is infinite cyclic generated by A12(2) (The two-strand pure braid group is infinite cyclic). Here the quotient is instead PB2=π1(F2(D2),Q′), with Q′=(−1/8,0). The path η(r)=((1+r/3)q1+r/12,(1+r/3)q2+r/12) runs from Q′ to Q(2). Basepoint transport gives an isomorphism τ:π1(F2(D2),Q(2))→π1(F2(D2),Q′), τ([ℓ])=[η∗ℓ∗ηˉ] (Conjugating loop classes by a path is an isomorphism of fundamental groups, Higher homotopy basepoint transport and moving homotopies). Write a′:=τ(A12(2)) for the quotient generator; occurrences of a in the cyclic quotient factor of the Example mean a′. Step 1.3 checks that forgetting sends a∈PB3 to a′, using the actual coordinate-forgetting map of The Fadell-Neuwirth short exact sequence for pure braids.

[F8]

The extension of [F6] splits: there is a homomorphic section s:PB2→PB3 of φ, and then PB3≅F2⋊PB2 compatibly with κ and φ, the action of h∈PB2 on the free kernel being h⋅x=s(h)xs(h)−1; the section is the based version of the far-right explicit section, and for a section the action depends on that section (The pure braid extension splits as a semidirect product, Splitting lemma for groups: a section, a complement, and a semidirect-product decomposition are equivalent).

[F9]

The far-right section of the planar forgetful map is s(z1,…,zn−1)=(z1,…,zn−1,1+∣z1∣+⋯+∣zn−1∣) for Fn(C)→Fn−1(C), transported to the disc by the radial homeomorphism h(w)=w/(1+∣w∣) with inverse h−1(z)=z/(1−∣z∣); fixing a base configuration q and a path α in the fibre from q to s′(q′), the formula σ([β])=[(α∗(s′∘β))∗αˉ] defines a homomorphism σ:π1(Fn−1(int⁡D2),q′)→π1(Fn(int⁡D2),q) with p~∗∘σ=id⁡, and the section s of [F8] is ι∗F∘σ∘(ι∗F)−1 (A choice-free continuous section of planar coordinate forgetting).

[F10]

For i=1,2 the support disc of σi is Ui=B(mi,32h) with m1=−116 and m2=116; the two strands of the braid σ12 stay in U1 at every time, and U1⊆B(0,52h)=B(0,532), while q3=18∉U1∪{q1,q2} and the real interval [18,3764] is disjoint from U1∪{q1,q2} (The elementary geometric half twist, its support disc, and its opposite).

Verification

technique · direct
1.1A1F1F2F6F8

Choice bookkeeping and the standing identifications. By [F1] the Axiom of Choice [A1] yields DC, so the short exact sequence and the splitting of [F6] and [F8] are available. Throughout, a,b,c denote the elements of PB3 named in the statement, that is a=Ψ([σ12]), b=Ψ([σ2σ12σ2−1]) and c=Ψ([σ22]), The quotient generator is a′=τ(A12(2)) of [F7]; only the letter a is reused for that cyclic factor, and b,c remain kernel elements in PB3.

1.2F2F3F4F5

The product abc is central. Put s:=[σ1] and t:=[σ2] in G3. By [F2] the geometric classes of the three words are s2, ts2t−1 and t2, so in the group G3 of [F4] the bracketing is immaterial and s2⋅ts2t−1⋅t2=s2ts2t=s(sts)st=s(tst)st=(st)3, where the middle step uses the relation tst=sts of [F3]; put Δ:=sts. The same relation gives Δ=tst, hence Δs=tΔ and Δt=sΔ, and therefore Δ2s=Δ(tΔ)=(Δt)Δ=(sΔ)Δ=sΔ2,Δ2t=Δ(sΔ)=(Δs)Δ=(tΔ)Δ=tΔ2. So Δ2 commutes with s and t; since s and t generate G3 by [F4], Δ2 is central in G3. Also πgeo(Δ2)=πgeo(st)3=id because πgeo(st) is a product of the two distinct transpositions (1 2) and (2 3), a three-cycle whose cube is the identity; hence Δ2∈G3pure and z:=Ψ([Δ2]) is defined. By [F5] the map Ψ is a homomorphism, so with the identification of [F2] abc=Ψ([σ12])Ψ([σ2σ12σ2−1])Ψ([σ22])=Ψ([σ12σ2σ12σ2−1⋅σ22])=Ψ([Δ2])=z. Since Ψ is an isomorphism onto PB3 and Δ2 is central in G3, the element z=abc is central in PB3.

1.3F5F6F7F10

Forgetting and the transported quotient generator. Let z=(z1,z2) be the two moving coordinates of the rank-three word σ12, a loop at Q′. Then φ(a)=(ι∗F[z])−1 by [F5] and the naturality of coordinate forgetting in [F6]. Define gr(v)=(1+r/3)v+r/12 and H(t,r)=(gr(z1(t)),gr(z2(t))). The map gr is injective, so these coordinates stay distinct. By [F10], ∣zi(t)∣≤5/32, whence ∣gr(zi(t))∣≤(4/3)(5/32)+1/12=7/24<1. Thus H is a homotopy through ordered configurations with basepoint track η from [F7]. At r=1 the midpoint −1/16 is sent to 0, while the relative diamond displacement ρ is multiplied by 4/3, changing its scale from 1/16 to 1/12. Therefore H(−,1) is exactly the raw coordinate loop of the canonical rank-two full twist. The moving-basepoint identity of [F7], and its compatibility with open-to-closed inclusions, give ι∗F[z]=τ(ι∗F[zσ12(2)]). Since τ preserves inverses, φ(a)=τ(A12(2))=a′. By [F7], a′ generates this quotient PB2≅Z.

2.1step 1.2

The conjugation by a is conjugation by w−1. Put w:=bc∈ker⁡φ. By step 1.2, abc=z with z central, so a=z(bc)−1=zw−1, and for every x∈PB3, in particular for every x∈ker⁡φ, axa−1=zw−1xwz−1=w−1xw.

2.2F5F8F9F10step 1.3

The far-right section sends a′ to a. Write z2(t)=(z1(t),z2(t)) for the coordinate path of σ12 in F2(int⁡D2), a loop at Q′ whose two entries lie in U1 for every t by [F10], and put ui(t):=h−1(zi(t)), so that the far-right lift of [F9] is ς(t):=(z1(t),z2(t), h(1+∣u1(t)∣+∣u2(t)∣)), a loop at s′(Q′) in F3(int⁡D2). Since ∣zi(t)∣≤532 by [F10], we have ∣ui(t)∣≤527 and, because r↦r1+r is increasing on [0,∞), h(1+∣u1(t)∣+∣u2(t)∣)∈[12,3764], an interval in the positive real axis. The value of the far-right section at Q′ is s′(Q′)=(q1,q2,815): here h−1(q1)=(−1/8)/(7/8)=−17 and h−1(q2)=0, so the third coordinate is h(1+17)=h(87)=815. Let α(t):=(q1, q2, 18+t(815−18)) be the path in the fibre from Q to s′(Q′), whose third coordinate runs along the real interval [18,815]; this interval, and likewise [12,3764], is contained in [18,3764], which is disjoint from U1∪{q1,q2} by [F10]. By [F9] the section of [F8] is built from σ=φαˉ∘s∗′ with σ([z2])=[(α∗ς)∗αˉ], and we claim this class is the class of the third-strand-fixed loop ω0(t):=(z1(t),z2(t),q3) in π1(F3(int⁡D2),Q). To see this, let v:I→R denote the third coordinate path of γ:=(α∗ς)∗αˉ, so that v(0)=v(1)=q3, v takes values in [18,3764], and v coincides with the third coordinate of α on the first quarter, with h(1+∣u1∣+∣u2∣) on the second quarter and with the reversed third coordinate of α on the last half. Let ψ0 be the map that is 0 on [0,14], 4t−1 on [14,12] and 1 on [12,1], and put ψr(t):=(1−r)ψ0(t)+rt for (r,t)∈I×I. Then G(r,t):=(z1(ψr(t)), z2(ψr(t)), (1−r)v(t)+rq3) is continuous, lies in F3(int⁡D2) pointwise: each ψr(t) lies in [0,1], so both zi(ψr(t)) lie in U1 and are distinct, while the third coordinate is a convex combination of two points of [18,3764] and therefore also lies in that interval, which is disjoint from U1∪{q1,q2} by [F10]; moreover ψr(0)=0, ψr(1)=1 and v(0)=v(1)=q3, so G(r,0)=G(r,1)=Q for every r. Finally G(0,t)=γ(t) and G(1,t)=ω0(t). Hence G is a path homotopy relative to {0,1} from γ to ω0 and σ([z2])=[ω0]. Now (ι∗F)−1(a′)=[z2]−1 in π1(F2(int⁡D2),Q′): by [F5] the element a′=φ(a)∈PB2 is (ι∗F[z2])−1 and ι∗F is an isomorphism. Since σ is a homomorphism, σ([z2]−1)=[ω0]−1, and since the element a=A12 of PB3 is by [F5] the class (ι∗F[ω0])−1 (the coordinate path of the braid σ12 in G3 is ω0), the section s of [F9] satisfies s(a′)=ι∗F(σ((ι∗F)−1(a′)))=ι∗F([ω0]−1)=a.

3.1F6F8step 1.3step 2.1step 2.2∎

The action and the semidirect product. By step 2.2 the section of [F8] satisfies s(a′)=a, and by step 2.1 axa−1=w−1xw for every x in the free kernel ker⁡φ=⟨b,c⟩ of [F6]. Since the action of the section is h⋅x=s(h)xs(h)−1 by [F8], the positive generator a′ of PB2=⟨a′⟩≅Z of step 1.3 acts by x↦w−1xw. The splitting of [F8] therefore exhibits PB3≅⟨b,c⟩⋊⟨a⟩≅F2⋊Z with that action. The action is conjugation by the element w−1 of the free kernel, so it depends on the normalised section, no triviality of the action is claimed, and no direct-product decomposition is asserted.

Remarks

  • The computation of step 1.2 is a direct rank-three calculation inside G3: the full twist Δ2=(st)3 is written as the product of the three standard generators a,b,c, and centrality of that product is read off the single braid relation. The later centre theorem for PBn is not used, and neither is any Artin-presentation injectivity: only the surjectivity of The Artin presentation surjects onto the geometric braid group enters, through the generation of G3 by s and t.
  • The section used above is the normalised far-right section: the fibre path is the straight segment from q3 to s′(Q′)3 on the positive real axis, and on the small representative σ12 of a the far-right lift is homotopic to the loop with constant third coordinate, which is why s(a′)=a. Any other section s′ of φ has s′(a′)=k a for some k∈ker⁡φ, so its action is x↦k (w−1xw) k−1, an inner automorphism of the free kernel; the displayed formula is the one for this section, and clearing it of the normalisation would require a separate conjugation bookkeeping.
  • The action is by an inner automorphism of the free kernel, because w∈⟨b,c⟩ itself. This example nevertheless asserts only the semidirect-product decomposition with the action of the chosen section; the classical direct-product decomposition PB3≅F2×Z is not derived here.
ExampleConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-10-02Open item page →

Standard Aij as point pushes after relabeling

Example

Assume the Axiom of Choice, let n≥2 and 1≤i<j≤n, and use the base configuration Q=(q1,…,qn) and positive half twists of The elementary geometric half twist, its support disc, and its opposite. The standard pure braid Aij∈PBn is the image of the geometric word Wij of Standard geometric pure braid generators A_ij. Put Y(j):=int⁡D2∖{qk:k≠j}. For a based loop γ of Y(j) at qj, let Mj(γ)(t):=(q1,…,qj−1,γ(t),qj+1,…,qn)∈Fn(int⁡D2). This is the ordered motion in which only the j-th point moves.

Choose the compatible family of local meridian circles and stems constructed by the puncture-avoiding fan argument in the proof of The Ain are meridian generators of the forgetful free kernel. Thus, for each r<n, take 0<ϵr≤hn/10, let Cr={z:∣z−qr∣=ϵr} and cr=qr+(ϵr,0), and use the local stem τr from qr+1 to cr selected in that compatible family, inside Ur∖{qr}. For i<j, let hi,j:=Hj−1∘⋯∘Hi+1, where Hs represents the positive half twist σs and the empty composition for j=i+1 is the identity. The associated meridian stem from qj to Ci is hi,j∘τi; let γi,jcw be the based loop that follows this stem, traverses Ci clockwise once, and returns along the reverse stem. These are the compatible standard meridian stems obtained by transporting the adjacent local stem through the successive half twists. Then:

  1. Point push. For every 1≤i<j≤n, Aij=ι∗F[Mj(γi,jcw)]∈PBn. Thus the positive standard generator is the class of the motion that holds the other n−1 labelled points fixed and moves the j-th point clockwise once around qi along the stated stem.
  2. Relabeled form. Let ρ∈Sn satisfy ρ(j)=n, ρ(k)=k−1 for j<k≤n, and ρ(k)=k for k<j. The coordinate permutation (Rx)k:=xρ−1(k) gives homeomorphisms R∘ and RD on the open and closed ordered configuration spaces, respectively. It takes Q to Qρ=(q1,…,qj−1,qj+1,…,qn,qj). Put Yρ:=int⁡D2∖{qk:k≠j}, and define the open terminal-coordinate inclusion κ~ρ:π1(Yρ,qj)⟶π1(Fn(int⁡D2),Qρ),[γ]⟼[(q1,…,qj−1,qj+1,…,qn,γ)]. With ι∗F,ρ the open-to-closed map at basepoint Qρ, set κρ:=ι∗F,ρ∘κ~ρ. Then R∗D(Aij)=κρ([γi,jcw])∈π1(Fn(D2),Qρ), the loop class in which the last coordinate moves clockwise around qi and all other coordinates remain fixed.
  3. Terminal mapping-class sign. For i<n, Θn(Ain)=Push⁡n([γi,ncw]),Θn:=Ψnmc∘(Ψnconf)−1, where Θn is the isomorphism of Point pushing is the kernel of forgetting the last disk puncture. The inverse-endpoint convention in Point pushing the last puncture makes the clockwise fibre meridian correspond to the positive generator. The raw ordered slice of the positive standard word runs counterclockwise; the configuration identification inverts that slice.

Facts & Assumptions

Given: AC, n≥2, 1≤i<j≤n, the base configuration Q, the half twists σ1,…,σn−1 and their supports U1,…,Un−1, the words Wij, and the maps in the statement.

[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]

The Statement of The Ain are meridian generators of the forgetful free kernel says that, under AC, the last-coordinate fibre inclusion κ identifies Fm−1 with the kernel of forgetting PBm→PBm−1, and the m−1 configuration-group images Ψ([A1m]),…,Ψ([Am−1,m]) of the standard geometric classes form a free basis. For the compatible stem family constructed in its proof, if [λr] is the counterclockwise meridian class in the fibre, then Ψ([Arm])=(κ∗[λr])−1. Here [Arm]=[Wrm] is the geometric braid class and, by [F3], its configuration-group image is the element denoted Arm in this example; κ∗[λ] is the closed-disc image of the open fibre loop. The supplier Statement makes this last-column assertion; its proof also supplies the local winding and conjugation arguments used below for arbitrary j. It does not assert that the whole word motion is braid-isotopic to a one-coordinate motion.

[F3]

The standard generators are Ars=Ψnconf([Wrs]), where Wrs=σs−1⋯σr+1σr2σr+1−1⋯σs−1−1. The rightmost factor is the bottom one, [γ⋆β]=[γ][β], and Ψnconf([β])=(ι∗F[zβ])−1 for the ordered coordinate loop zβ (Standard geometric pure braid generators A_ij, Pure geometric braids and ordered configuration loops).

[F4]

The positive half twist σr exchanges qr,qr+1, is supported in Ur=B(mr,3hn/2), and fixes every other base point; Ur∩Us=∅ when ∣r−s∣>1. Here the base points are equally spaced by 2hn, so the center of Ur+1 is distance 3hn from qr (The elementary geometric half twist, its support disc, and its opposite).

[F5]

Geometric braids form a group under stacking, with the right factor running first; coordinate paths of pure braids are loops in Fn(int⁡D2), and reversed braid paths represent inverse classes (The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, Stacking of geometric braids is a well-defined associative operation on isotopy classes).

[F6]

Coordinate permutations act by homeomorphisms on both Fn(int⁡D2) and Fn(D2), and the open-to-closed inclusions commute with these permutations (The symmetric group acts continuously and freely on Fn(X) by permuting labels, The interior-disc and closed-disc configuration spaces are homotopy equivalent).

[F7]

The maps Ψnconf:Gnpure→PBn and Ψnmc:Gn→Mod⁡(D2,Q;∂D2) are group isomorphisms, with Ψnconf([β])=(ι∗F[zβ])−1 and, for the raw unordered slice S(β), Ψnmc([β])=δ([S(β)]−1); on a half twist, Ψnmc([σr])=[Hr], where Hr is orientation-preserving, supported in Ur, and exchanges qr,qr+1 (Pure geometric braids and ordered configuration loops, Braid group as boundary-fixed punctured-disk mapping classes).

[F8]

The point-pushing map for the last puncture is Push⁡n([γ])=δ([γˉ]), where γˉ is the unordered loop of the ordered motion that moves only qn and δ is the inverse-endpoint boundary map. The braid-to-mapping-class map sends that raw geometric motion to δ([γˉ]−1)=Push⁡n([γ])−1 (Point pushing the last puncture, Boundary map from point motions).

[F9]

Under AC, Θn=Ψnmc∣Gnpure∘(Ψnconf)−1 is an isomorphism and Θn∘κ=Push⁡n for the terminal-coordinate fibre inclusion (Point pushing is the kernel of forgetting the last disk puncture).

[F10]

Fn(X) is the space of pairwise distinct tuples in Xn, PBn=π1(Fn(D2),Q), and ι∗F:π1(Fn(int⁡D2),Q)→PBn is an isomorphism (Ordered configuration spaces Fn(X), 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).

[F11]

The local two-point winding computation in the proof of The Ain are meridian generators of the forgetful free kernel identifies F2(Ur)≅S1×C with C convex and shows that the raw coordinate loop of σr2 has relative winding +1, equal to a counterclockwise local meridian motion of qr+1 around qr. By the inverse-endpoint convention, Ψnmc([σr2])=Push⁡qr+1([λrccw])−1=Push⁡qr+1([λrcw]). The proof's conjugation argument establishes, for any mapping class h taking a marked point p to p′, the typed naturality hPush⁡p([α])h−1=Push⁡p′([h∘α]), where α is a loop in the complement of Q∖{p} based at p and h∘α is based at p′ in the complement of Q∖{p′}. There Push⁡p is the inverse endpoint of an ambient lift of this single-point motion; for p=qn it agrees with [F8].

Verification

technique · direct

Choice bookkeeping. AC supplies DC and countable choice, so the cited fibre exact sequence, braid identifications, and point-pushing identifications are available. [A1, F1, F2, F7, F9]

1.1A1F1F2F7F9

The choice hypothesis discharges the cited fibration and mapping-class identifications.

Terminal fibre case. Fix i<n and let [λiccw] be the counterclockwise based meridian class in the last-coordinate fibre at qn from [F2]. Write [λicw]=[λiccw]−1. The standard generator in PBn is Ain=Ψnconf([Win]); applying Ψnconf to Ain again would be ill-typed. The source formula and the fact that the fibre inclusion is a homomorphism give Ain=(κ∗[λiccw])−1=κ∗[λicw]=ι∗F[Mn(λicw)]. This proves the terminal instance of claim 1. [F2, F3, F10]

2.1step 1.1F2F3F10

Thus the terminal generator is the closed-disc image of the clockwise last-coordinate meridian.

A point-motion loop maps to its point push. Let p=qj and let γ be any based loop in Y(j) at qj. By the geometric-braid/configuration identification [F3] and the open-to-closed map [F10], the ordered loop Mj(γ) defines a pure geometric braid βγ whose unordered slice is γˉ. Its inverse braid βγ−1 has coordinate loop class [Mj(γ)]−1 and unordered slice class [γˉ]−1. The braid/configuration and braid/mapping-class maps [F7] therefore give Ψnconf(βγ−1)=(ι∗F[Mj(γ)]−1)−1=ι∗F[Mj(γ)],Ψnmc(βγ−1)=δ(([γˉ]−1)−1)=δ([γˉ]). For any marked point qj, the inverse-endpoint point-motion map constructed in the kernel lemma's proof is Push⁡qj([γ])=δ([γˉ]); for j=n this agrees with [F8]. Thus Θn(ι∗F[Mj(γ)])=Ψnmc(βγ−1)=Push⁡qj([γ]). This identity will compare classes by the isomorphism Θn and uses no fibre-inclusion injectivity. [F3, F7, F8, F10, F11]

2.2step 1.1F3F7F8F10F11

For every marked point, the image under Θn of its one-coordinate motion is the corresponding point push.

Transport the adjacent point push. Fix i<j. Choose the local circle Ci and stem τi from the statement, and let λicw be the loop following τi, once clockwise around Ci, and back. Put gi,j:=[σj−1]⋯[σi+1]∈Gn and let hi,j=Hj−1∘⋯∘Hi+1 be its mapping-class representative, with the rightmost map acting first. Hence hi,j(qi+1)=qj and hi,j(qi)=qi. It fixes Ci pointwise: each support Ur for r≥i+2 is disjoint from Ui, while every point of Ci is at distance at least 3hn−ϵi≥2.9hn>3hn/2 from the center of Ui+1. Thus hi,j∘τi is a stem from qj to Ci, and hi,j∘λicw=γi,jcw. The path avoids all punctures other than its basepoint because hi,j permutes Q and sends the omitted point qi+1 to qj. The word identity [F3], first-under-second product, and the local winding and typed naturality in [F11] now give Θn(Aij)=Ψnmc([Wij])=hi,jΨnmc([σi2])hi,j−1=hi,jPush⁡qi+1([λicw])hi,j−1=Push⁡qj([γi,jcw]). For j=i+1, hi,j is the identity and this is exactly the local winding case. [F3, F7, F11]

2.3step 1.1F3F4F5F7F11

The conjugated geometric generator has the point-push image along the transported standard stem.

Point-push claim for every pair. By step 2.2, the image under Θn of the one-coordinate motion along γi,jcw is Push⁡qj([γi,jcw]). By step 2.3, this equals Θn(Aij). Since Θn is an isomorphism by [F9], it is injective, and therefore Aij=ι∗F[Mj(γi,jcw)]. This proves claim 1 without an isotopy assertion about the full word motion. [F9, step 2.2, step 2.3]

3.1F9step 2.2step 2.3

Equality under Θn proves the point-push statement for every pair.

Relabeled form and open-to-closed maps. Let Mnρ(γ)=(q1,…,qj−1,qj+1,…,qn,γ) be the open ordered loop based at Qρ. Pointwise, R∘∘Mj(γ)=Mnρ(γ). The coordinate-permutation square commutes with the open-to-closed inclusions, so R∗D(ι∗F[Mj(γ)])=ι∗F,ρ[Mnρ(γ)]=κρ([γ]). Apply this identity to the loop from the point-push claim to obtain R∗D(Aij)=κρ([γi,jcw]). This is the relabeled terminal-coordinate form. The argument uses functoriality only and asserts no injectivity of κ~ρ or κρ. [F6, F10, step 3.1]

4.1F6F10step 3.1

The coordinate permutation carries the proven open motion to the stated closed-disc terminal-coordinate class.

Terminal mapping-class sign. For i<n, the fibre formula and [F9] give Θn(Ain)=Θn(κ∗[λicw])=Push⁡n([λicw]). The source formula [F2] identifies the configuration-group image of [Win] as (κ∗[λiccw])−1, while [F3] identifies the same image as (ι∗F[zWin])−1 for the raw ordered coordinate loop. Equating and inverting gives ι∗F[zWin]=κ∗[λiccw]: the raw ordered slice is counterclockwise in the fibre. The configuration identification inverts it, so Ain=κ∗[λicw]. The inverse-endpoint convention then gives exactly the clockwise point push. [F2, F3, F8, F9, step 2.1]

5.1F2F3F8F9step 2.1∎

This proves the terminal mapping-class sign in claim 3 with the positive generator clockwise.

Remarks

  • The stem for Aij is the image of the adjacent local stem under the actual mapping-class representative Hj−1∘⋯∘Hi+1. This specifies the compatible meridian path and preserves its clockwise orientation.
  • The relabeling is a coordinate-permutation homeomorphism from basepoint Q to Qρ. The open terminal-coordinate map and its closed-disc composite have distinct codomains; only the latter is denoted κρ in the statement.
  • The example identifies standard generators and makes no new generation or presentation claim. The proof uses the local two-point winding and typed point-push conjugation already proved in The Ain are meridian generators of the forgetful free kernel.
CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02Open item page →

The short exact sequence to Sn does not prove Bn torsion-free

Statement refuted

Let 1→K→G→Q→1 be a short exact sequence of groups with K torsion-free and Q finite. Then G is torsion-free. In particular the configuration braid short exact sequence 1→PBn→Bnconf→Sn→1, whose kernel PBn is torsion-free and whose quotient Sn is finite, would by itself show that Bnconf is torsion-free.

Facts & Assumptions

Given: the Axiom of Choice, an integer n≥0, the groups (Z,+,0) and (Z/2,+), and their external direct product Z×(Z/2).

[A1]

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

[F1]

Assume AC. Then PBn is torsion-free for every n≥0: if g∈PBn and gm=e for some m≥1, then g=e (Pure braid groups are torsion-free). AC is used only for this citation (AC implies DC implies countable choice).

[F2]

For every n≥0 the sequence 1→PBn→p∗Bnconf→πSn→1 of the configuration groups is short exact: p∗ is injective, π is surjective and im⁡p∗=ker⁡π (The configuration braid short exact sequence 1→PBn→Bnconf→Sn→1); moreover ∣Sn∣=n!, so Sn is finite (The Lehmer code gives ∣Sn∣=n! again).

[F3]

(Z,+,⋅,0,1) is a commutative ring and a totally ordered ring: the order is total and compatible with addition, so x≤y implies x+z≤y+z, and exactly one of x<y, x=y, y<x holds for all integers (The integers form a commutative ring, The integers form a totally ordered ring).

[F4]

(Z/2,+,[0]2) is an abelian group with [a]2+[b]2=[a+b]2 (For every natural n, (Z/n,+) is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold). Its exactly two classes are [0]2 and [1]2 (For n≥1, every class in Z/n has one representative r with 0≤r<n, so ∣Z/n∣=n; while Z/0 is in bijection with Z, The congruence class [a]n and the quotient set Z/n), so [1]2≠[0]2 and [1]2+[1]2=[2]2=[0]2; hence it has order 2 and is generated by [1]2.

[F5]

For any groups G,H the componentwise operation (g,h)(g′,h′)=(gg′,hh′) makes G×H a group with identity (eG,eH), and the coordinate projections are group homomorphisms (The external direct product G×H with componentwise multiplication, G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections).

[F6]

In a group, g0=e and gk+1=gk⋅g for natural powers, and g has finite order k≥1 exactly when k is the least positive integer with gk=e (Powers gn: natural exponents in a monoid and integer exponents in a group, with g0=e, The order ∣G∣ of a finite group and the order ord⁡(g) of an element, with ord⁡(g)=∞ when no positive power of g is the identity).

Counterexample

technique · direct
1.1F3F4

The two factors. By [F3] the additive group (Z,+,0) is a group, and by [F4] (Z/2,+) is an abelian group of order 2 with [1]2≠[0]2 and [1]2+[1]2=[2]2=[0]2.

1.2F3F6

Z is torsion-free. Let a∈Z with a≠0 and let m≥1. By trichotomy [F3] either a>0 or −a>0; assume a>0, the other case being symmetric with m(−a)=−(ma). Since 0<a and the order is compatible with addition, a<a+a=2a and inductively ka<(k+1)a for every k≥1: if ka>0 then (k+1)a=ka+a>ka>0. Hence ma>0 for every m≥1, so ma≠0; an element a of finite additive order would have ma=0 for some m≥1, so no nonzero element of Z has finite order and (Z,+,0) is torsion-free.

2.1step 1.2F4F5

The sequence 1→Z→Z×(Z/2)→Z/2→1. By [F5] the set G:=Z×(Z/2) with componentwise addition is a group with identity eG=(0,[0]2), and the second-coordinate projection π:G→Z/2 is a group homomorphism; it is surjective because π(a,[b]2)=[b]2 for every [b]2. Its kernel is K:={(a,[0]2):a∈Z}, and the first-coordinate map K→Z, (a,[0]2)↦a, is a group isomorphism; hence K is torsion-free by step 1.2, and G/K≅Z/2 has order 2 by [F4], so the quotient is finite. Thus 1→K→G→πZ/2→1 is a short exact sequence with torsion-free kernel and finite quotient.

3.1step 2.1F4F5F6

The middle group has an element of order two. Put g:=(0,[1]2)∈G. Using the componentwise operation of [F5] and the addition of [F4], g2=(0+0, [1]2+[1]2)=(0,[2]2)=(0,[0]2)=eG, while g≠eG because [1]2≠[0]2. By [F6] the element g has order 2, so G is not torsion-free although K is torsion-free and G/K is finite. This refutes the general implication of the statement: a torsion-free kernel and a finite quotient do not force the middle group to be torsion-free.

4.1A1step 2.1step 3.1F1F2

The braid reading. Under the standing assumption [A1], which discharges the Axiom-of-Choice hypothesis that [F1] attaches to its own citation, the configuration braid sequence of [F2] has the two abstract features used above: its kernel PBn is torsion-free by [F1], and its quotient Sn is finite by [F2]. Since the general implication fails already for the infinite cyclic kernel Z and the two-element quotient Z/2 of step 2.1, those two features alone cannot establish torsion-freeness of Bnconf; only a finer argument about the specific groups can do that. This counterexample makes no claim that Bnconf itself has torsion.

∎

Sources