Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 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 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. ∎

Depends on

Used by

Dependency tree · two levels

68 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