Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

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 Aij 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 Aij, 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 the strand count
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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

76 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources