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.

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. ∎

Depends on

Used by

Dependency tree · two levels

69 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