Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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.

The combed geometric decomposition is unique

Statement

Assume AC and n≥2, and work with the abstract Artin group Bn of The braid group by Artin presentation, the words x1,…,xn−1 of The Zariski combing words alpha_i and x_i in the Artin presentation and the published surjection φ ⁣:Bn→Gn of The Artin presentation surjects onto the geometric braid group. Let W1 be a word in x1±1,…,xn−1±1 and W2 a word in σ1±1,…,σn−2±1 such that φ(W1W2) is the trivial geometric braid; such a pair exists for every combed word by Every trivial braid word combs as W_1W_2. Write Ψn ⁣:Gnpure→PBn for the canonical isomorphism of Pure geometric braids and ordered configuration loops, and ρ ⁣:PBn→PBn−1 for the forgetting map of The Fadell-Neuwirth short exact sequence for pure braids. Write Aij∈Gn for the geometric generators of Standard geometric pure braid generators A_ij, and write A~ij:=σj−1⋯σi+1σi2σi+1−1⋯σj−1−1∈Bn for their Artin-word lifts, so φ(A~ij)=Aij. Put P~i:=A~i+1,n⋯A~n−1,n in Bn and Pi:=Ai+1,n⋯An−1,n in Gn, with both empty when i=n−1. Then:

(i) every φ(xi) is a pure braid and φ(xi)=Pi−1 Ain Pi, so that the conjugating element lies in the subgroup generated by the standard generators with larger first index; at the word level this is xi≡P~i−1A~inP~i in Bn. Moreover Ψn(φ(x1)),…,Ψn(φ(xn−1)) form a free basis of the free kernel ker⁡ρ of the forgetting map of The Fadell-Neuwirth short exact sequence for pure braids;

(ii) φ(W1)=1, and W1, as a word in the alphabet x1±1,…,xn−1±1, reduces to the empty word by free cancellations of adjacent inverse pairs xi±1xi∓1 (each of which, after expanding both xi's, is a permitted deletion of σ-pairs);

(iii) φ(W2)=1, and, viewing the same letter word as an element of Bn−1, its geometric image under the rank-(n−1) surjection φn−1 ⁣:Bn−1→Gn−1 is trivial: φn−1(W2)=1∈Gn−1. This asserts triviality of the geometric image, not that W2=1 in Bn−1.

Facts & Assumptions

Given: An integer n≥2, the groups Bn and Gn of The braid group by Artin presentation and The isotopy classes of geometric braids based at Q form a group, and the endpoint permutation is a homomorphism, the words αj,xj of The Zariski combing words alpha_i and x_i in the Artin presentation, words W1 in x1±1,…,xn−1±1 and W2 in σ1±1,…,σn−2±1 with φ(W1W2)=1, the standard pure braid generators Aij of Standard geometric pure braid generators A_ij, and the identifications of The Fadell-Neuwirth short exact sequence for pure braids and Pure geometric braids and ordered configuration loops.

[F1]

In Bn the two Artin relations hold and adjacent inverse σ-pairs may be freely inserted and deleted. For 1≤i<j≤n, set A~ij:=σj−1⋯σi+1σi2σi+1−1⋯σj−1−1∈Bn; its image under φ is the geometric standard generator Aij of Standard geometric pure braid generators A_ij, since φ(σr)=[σr] and φ preserves the displayed stacking product (The braid group by Artin presentation, The Artin presentation surjects onto the geometric braid group, Standard geometric pure braid generators A_ij). The words αj satisfy αj=σj⋯σn−1 and αn=1, and xi=αi+1−1σi2αi+1 (The Zariski combing words alpha_i and x_i in the Artin presentation).

[F2]

Assumption AC, and the published consequences that are used to identify the free kernel: AC implies dependent choice and countable choice (The Axiom of Choice, AC implies DC implies countable choice), so that the Fadell--Neuwirth fibrations of The Fadell-Neuwirth short exact sequence for pure braids are available: forgetting the last strand is a homomorphism ρ ⁣:PBn→PBn−1 with kernel a free group of rank n−1, and under the fiber-inclusion identification the elements Ψn(A1n),…,Ψn(An−1,n) are a free basis of that kernel (The Ain are meridian generators of the forgetful free kernel). Forgetting a strand is realized by the coordinate projection: under the identifications [F3] at ranks n and n−1, a pure braid whose coordinate loop is (Z1,…,Zn) satisfies ρ(Ψn([β]))=(ι∗F[(Z1,…,Zn−1)])−1, with target basepoint (q1,…,qn−1). This follows because coordinate projection commutes with the open-to-closed inclusion and its induced homomorphism preserves inverses.

[F3]

For every rank m≥0, Ψm ⁣:Gmpure=ker⁡πgeo→PBm is an isomorphism, and for a pure braid [β] with coordinate path zβ it is Ψm([β])=(ι∗F[zβ])−1, the inverse of the class of the coordinate loop carried to the closed-disc configuration space; the same sign convention is used at every rank, so the inverse cancels in the comparisons between ranks below. At every interior base configuration the open-to-closed inclusion induces an isomorphism on fundamental groups (The interior-disc and closed-disc configuration spaces are homotopy equivalent). Consequently [β]=1 if and only if [zβ]=1 (Pure geometric braids and ordered configuration loops, Ordered configuration spaces Fn(X), The homomorphism on fundamental groups induced by a pointed continuous map). Moreover πconf(Φ([β]))=πgeo([β]), so a geometric braid is pure exactly when its class lies in PBn under these identifications (The geometric endpoint permutation matches covering monodromy).

[F4]

Geometric conventions. The base configuration is Q=(q1,…,qn) with qj=((2j−n−1)h,0), h=14(n+1), and the (n−1)-strand base configuration is Q(n−1)=(q1′,…,qn−1′) with qj′=((2j−n)h′,0), h′=14n (Geometric braids in the disc with setwise endpoints). The elementary half twist σi acts as mi+ρ(t), mi−ρ(t) on the two points qi,qi+1 and fixes all others, where mi=qi+(h,0) and ρ is the diamond path of size h (The elementary geometric half twist, its support disc, and its opposite); stacking is first-under-second with π(γ⋆β)=π(γ)∘π(β) (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). The two configurations are compared through the similarity A(w):=aw−14(n+1) with a:=nn+1. Since 14(n+1)=1−a4, this is the dilation about c=−14, namely A(w)=c+a(w−c). It satisfies A(Q(n−1))=(q1,…,qn−1); its image A(D∘) is the open disc of radius a centered at A(0)=−14(n+1), whose closure lies in D∘ because a+14(n+1)<1.

[F5]

Moving-homotopy transport: for a path γ ⁣:x0→x1 in a space X and each n≥1 there is a transport isomorphism βγ ⁣:πn(X,x1)→πn(X,x0) depending only on the endpoint-fixed class of γ; if H ⁣:f≃g is a homotopy with basepoint track γ, then f∗=βγ∘g∗. In degree one βγ[a]=[γ∗a∗γˉ] (Higher homotopy basepoint transport and moving homotopies).

Proof

technique · direct
1.1F1

The combing identity, by free cancellation. For 1≤j≤n−1 put δj:=σn−1σn−2⋯σj+1 and γj:=σj+1σj+2⋯σn−1 (empty words for j=n−1); then δj=δj+1σj+1 and γj=σj+1γj+1 as words, and by [F1] the Artin word A~jn=δjσj2δj−1 lifts the geometric generator Ajn, while xj=γj−1σj2γj is the combing word. First, for every j the Artin word Q~j:=A~j,nA~j+1,n⋯A~n−1,n freely reduces to δjσj2γj: this is a downward induction on j, in which both words are σn−12 for j=n−1, and in which the substitution of A~j,n=δjσj2δj−1 and of the reduced form Q~j+1≡δj+1σj+12γj+1 gives Q~j≡δjσj2(δj−1δj+1)σj+12γj+1=δjσj2σj+1−1(δj+1−1δj+1)σj+12γj+1, where the block δj+1−1δj+1 cancels freely to the empty word -- its middle pair σn−1−1σn−1 cancels first, after which the next pair is adjacent, and so on outwards -- leaving δjσj2γj. For 1≤i≤n−2 this gives P~i:=Q~i+1≡δi+1σi+12γi+1, and the inverse word is P~i−1≡γi+1−1σi+1−2δi+1−1; substituting these reduced forms into P~i−1A~inP~i, and using δi+1−1δi≡σi+1 and δi−1δi+1≡σi+1−1 (the same middle-outward cancellation applied to δi=δi+1σi+1), gives P~i−1A~inP~i≡γi+1−1σi+1−2(δi+1−1δi)σi2(δi−1δi+1)σi+12γi+1≡γi+1−1σi+1−1σi2σi+1γi+1=γi−1σi2γi=xi. The remaining index i=n−1 has the empty product P~n−1 and xn−1=A~n−1,n=σn−12, so xn−1=P~n−1−1A~n−1,nP~n−1 holds trivially. No Artin relation is used in this step, only free insertions and deletions. Applying φ gives the stated geometric identity.

1.2F4

The two models of a lower-rank word. Put a:=n/(n+1) and consider the similarity A(w)=aw−hn with hn=14(n+1), so that A(w)=aw−14(n+1). One computes A(qj′)=qj for 1≤j≤n−1, A(mi′)=mi for 1≤i≤n−2 where mi′=qi′+(h′,0) is the (n−1)-strand midpoint, and aρ′(t)=ρ(t) for the two displacement paths, since ah′=h and each diamond-path coordinate is linear in its size. The reflected paths for the negative letters satisfy the same scaling identity. Since A is affine, A(mi′±ρ′(t))=A(mi′)±aρ′(t)=mi±ρ(t). Thus for every 1≤i≤n−2 and both signs, A((σi(n−1))j(t))=(σi(n))j(t)(1≤j≤n−1),A(qj′)=qj, where σi(k) is the elementary half twist of the k-strand model of [F4]. Every lower-rank moving point stays in the support disc Ui′ of the letter currently being run, or is one of the fixed base points. Relative to c:=(−14,0), these base points have radii ∣qj′−c∣=j/(2n)≤(n−1)/(2n), and the support disc Ui′ has center mi′ with ∣mi′−c∣=(2i+1)/(4n) and radius 3/(8n); hence every such path point has radius at most (4n−3)/(8n). This local agreement is all that will be used: A maps the lower standard-generator paths to the corresponding n-strand paths, but it is not used to map arbitrary lower braids into the complement of qn. Consequently, for every word V in σ1±1,…,σn−2±1, if z=(z1,…,zn−1) is its (n−1)-strand coordinate motion and Z=(Z1,…,Zn) its n-strand coordinate motion, then Zj=A∘zj(1≤j≤n−1),Zn≡qn, by induction on its letters: the generator paths agree by the displayed identity, and stacking has the same coupling permutation on {1,…,n−1} in both models and fixes n. Thus φn(V) is represented by (A∘z1,…,A∘zn−1,qn).

2.1F2F3F4F5

The straight-strand extension is a well-defined injective homomorphism. Let c:=(−14,0), a:=n/(n+1), R0:=12−14n and rn:=n/(2(n+1)). For θ∈R let uθ:=(cos⁡θ,sin⁡θ) and let R(θ):=14cos⁡θ+1−116sin⁡2θ, the distance from c to the boundary of D∘ along the ray c+ruθ; in particular R(θ)≥34>R0. Define the strictly increasing radial function λ(r,θ):={ar,0≤r≤R0,aR0+(rn−aR0)r−R0R(θ)−R0,R0≤r<R(θ), and define E(c+ruθ):=c+λ(r,θ)uθ, with E(c):=c. Since aR0<rn, each ray is mapped increasingly onto the ray segment of length rn; thus E is a homeomorphism from D∘ onto the open disk Ln:=B(c,rn). The closure of Ln lies in D∘ because ∥c∥2+rn<34<1, and qn lies on ∂Ln because ∣qn−c∣=n/(2(n+1))=rn. Moreover, E=A whenever ∣w−c∣≤R0. The basepoints satisfy ∣qj′−c∣=j/(2n)≤(n−1)/(2n)<R0, and for n≥3 every lower support disc satisfies max⁡1≤i≤n−2sup⁡w∈Ui′∣w−c∣≤4n−38n<R0 (for n=2 there are no such support discs). Therefore E(Q(n−1))=(q1,…,qn−1), and [F4] with step 1.2 shows that E maps every lower-rank standard-generator path to its corresponding n-strand path. If β∈Gn−1pure with representative coordinate loop z=(z1,…,zn−1), define sˇ(β) to be the class of (E∘z1,…,E∘zn−1,qn). The tuple is a pure n-strand braid: E is injective, its image Ln avoids qn, and the endpoints are E(Q(n−1))=(q1,…,qn−1). Applying E to a braid isotopy preserves pairwise distinctness and avoids qn, so sˇ is well defined on isotopy classes; applying E to the stacking formula shows it is a homomorphism. To prove injectivity, first note that the induced map E∗:π1(Fn−1(D∘),Q(n−1))→π1(Fn−1(D∘),E(Q(n−1))) is injective. Indeed, for 0≤t≤1 let λt(r,θ):=(1−t)r+tλ(r,θ) and Et(c+ruθ):=c+λt(r,θ)uθ. For each t, λt is strictly increasing along every ray and, when r<R(θ), λt(r,θ)<(1−t)R(θ)+trn≤R(θ), so Et is an embedding D∘→D∘, with E0=id⁡ and E1=E. Hence Fn−1(Et) is a homotopy on the ordered configuration space from the identity to Fn−1(E), whose basepoint follows η(t):=Fn−1(Et)(Q(n−1)); by [F5], id⁡∗=βη∘E∗, and since βη is an isomorphism, E∗ is injective. If sˇ(β)=1, [F3] and the coordinate-projection description of [F2] imply E∗[z]=1; injectivity gives [z]=1, and [F3] implies β=1.

2.2F2F3step 1.1

The conjugating identity in the geometric group. Applying φ to the word identity of step 1.1 gives φ(xi)=Pi−1AinPiin Gn, where Pi=Ai+1,n⋯An−1,n is the geometric product defined in the Statement. Each factor Aj,n of Pi and Ain itself lies in the pure subgroup and maps under Ψn into ker⁡ρ by [F2, F3]. Since ker⁡ρ is a subgroup, Ψn(φ(xi)) lies in ker⁡ρ; in particular φ(xi) is pure.

3.1F2F3step 2.1

The straight-strand extensions meet the kernel trivially. By [F2] the forgetting map acts on coordinate loops by dropping the last coordinate. For the straight-strand extension of step 2.1 the coordinate loop is (E∘z1,…,E∘zn−1,qn), whose dropped loop is E∘z. Thus ρ(Ψn(sˇ(β)))=ι∗F(E∗[z])−1 at the basepoint (q1,…,qn−1)=E(Q(n−1)). If γ=Ψn(sˇ(β)) also lies in ker⁡ρ, this class is trivial. The inclusion map ι∗F is injective at that basepoint by [F3], so E∗[z]=1. Injectivity of E∗ (step 2.1) gives [z]=1, and [F3] gives β=1 and γ=1. In particular Ψn(im⁡sˇ)∩ker⁡ρ={1}, which is the uniqueness statement used below.

3.2F2step 2.2

The free basis by the left-inverse argument. Let K:=ker⁡ρ≤PBn be the free kernel, and let F:=F(a1,…,an−1) be the abstract free group. The map ȷ:F→K given by ȷ(aj):=Ψn(Ajn) is an isomorphism by the free-basis clause of [F2]. Write wi:=ai+1ai+2⋯an−1∈F and ti:=wi−1aiwi∈F. By step 2.2 and the homomorphism property of Ψn, ȷ(ti)=Ψn(φ(xi)). First, the elements t1,…,tn−1 generate F: downward induction on i shows ⟨ti,ai+1,…,an−1⟩=⟨ai,…,an−1⟩, because ai=witiwi−1 lies in the left side and ti lies in the right side; at i=n−1 one has wn−1=1 and tn−1=an−1. Second, they are independent: define an endomorphism θ of F by descending recursion on i by θ(ai):=θ(wi)aiθ(wi)−1, where θ(wi) is the image of the word wi under the already defined θ on the generators ai+1,…,an−1 (at i=n−1 this gives θ(an−1)=an−1); this prescription specifies an element θ(ai)∈F for every free generator, hence defines a unique endomorphism θ ⁣:F→F. Then θ(ti)=θ(wi)−1θ(ai)θ(wi)=θ(wi)−1θ(wi)aiθ(wi)−1θ(wi)=ai for every i. If ρ′ ⁣:F→F denotes the homomorphism with ρ′(ai)=ti, then θ(ρ′(ai))=θ(ti)=ai, so θ∘ρ′ is the identity on a free basis, hence θ∘ρ′=id⁡F and ρ′ is injective. Therefore t1,…,tn−1 freely generate F, and applying Ψn−1∘ȷ carries this free basis to the free basis φ(x1),…,φ(xn−1) of Ψn−1(K).

4.1step 2.2step 3.2step 1.2step 2.1step 3.1

The three claims. (i) is step 2.2 together with step 3.2, the free-basis clause of [F2] being what turns Ψn(A1n),…,Ψn(An−1,n) into a basis of the free kernel. For (ii) and (iii), note first that φ(W1) is a product of the pure braids φ(xi) of step 2.2 and that φ(W2)=φ(W1)−1 because φ(W1W2)=1; by (i) the elements φ(x1),…,φ(xn−1) generate ker⁡ρ, so both φ(W1) and φ(W2) lie in the free kernel. The lower-rank word W2 has the same reading in the two models, so the endpoint permutation of its n-strand realization is the identity on the labels 1,…,n−1 (the last strand is fixed) and the permuted labels 1,…,n−1 agree with those of its (n-1)-strand realization; since the permutation of φ(W2) is trivial, the (n-1)-strand realization is a pure braid and step 1.2 identifies φ(W2)=sˇ(φn−1(W2)) in Gnpure. Hence Ψn(φ(W2))∈Ψn(im⁡sˇ)∩ker⁡ρ={1} by step 3.1, so φ(W2)=1; then injectivity of sˇ (step 2.1) gives φn−1(W2)=1, which is (iii), and φ(W1)=φ(W2)−1=1. Finally, since x1,…,xn−1 are carried to a free basis of ker⁡ρ by (i), the homomorphism from the free group on the letters x1,…,xn−1 to Gnpure sending xi↦φ(xi) is injective; a word in this alphabet whose image is φ(W1)=1 is therefore freely trivial, and each cancellation of an adjacent pair xi±1xi∓1 expands, after writing out both expanded words xi±1, into a sequence of permitted deletions of adjacent inverse σ-pairs. This is (ii). ∎

Remarks

  • The load-bearing in-run inputs are the batch-21 items The Fadell-Neuwirth short exact sequence for pure braids, The Ain are meridian generators of the forgetful free kernel and Standard geometric pure braid generators A_ij; steps 2.1 and 3.1 in particular use the convention that the forgetting map is realized by the coordinate projection, which the current statement of The Fadell-Neuwirth short exact sequence for pure braids asserts (the map induced by (x1,…,xn)↦(x1,…,xn−1)); the suppliers' certification remains the owner-held obligation before the item is accepted.
  • The combing identity of step 1.1 is the free-cancellation identity Q~j≡δjσj2γj, hence P~i=Q~i+1≡δi+1σi+12γi+1, and no relation of the Artin presentation is used in it; applying φ gives the geometric conjugation with Pi in step 2.2.
  • The axiom of choice is used only through the batch-21 Fadell--Neuwirth inputs and the identification of the free kernel; the combing identity, the θ argument and the two-model comparison of steps 1.1, 2.1 and 3.1 are choice-free.

Depends on

Used by

Dependency tree · two levels

96 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