Alphabeta Math
CorollaryStatement: 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.

Unordered planar configuration spaces are aspherical

Statement

Assume the Axiom of Choice. For every n≥1, every k≥2 and every basepoint b∈Cn(int⁡D2) one has πk(Cn(int⁡D2),b)=0. The same conclusion holds for the unordered configuration spaces Cn(C) and Cn(D2) under the coordinatewise radial homeomorphism and the published unordered inclusion homotopy equivalence. Consequently the open-disc and plane unordered configuration spaces are K(Bnconf,1) in the higher-homotopy sense: their fundamental group is Bnconf in the convention of The configuration braid group Bnconf as the fundamental group of an unordered configuration space and all higher homotopy groups vanish.

Facts & Assumptions

Given: the Axiom of Choice, an integer n≥1, a basepoint b∈Cn(int⁡D2) with a chosen preimage x∈Fn(int⁡D2), and a degree k≥2.

[A1]

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

[F1]

For every m≥1, every j≥2 and every base configuration c∈Fm(int⁡D2) one has πj(Fm(int⁡D2),c)=0 (Ordered planar configuration spaces are aspherical).

[F2]

For the surface M=int⁡D2 the quotient map p:Fn(M)→Cn(M) is an n!-sheeted covering map, both Fn(M) and Cn(M) are path-connected, and p is regular; no choice principle is used (Ordered configuration spaces cover the unordered ones regularly with deck group Sn).

[F3]

Let Y be path-connected and locally path-connected and let f:(Y,y0)→(B,b0) be based, with p:(E,e0)→(B,b0) a covering; a based lift of f exists if and only if f∗π1(Y,y0)⊆p∗π1(E,e0) (Lifting criterion for maps from path-connected locally path-connected spaces).

[F4]

Let p:E→B be a covering, H:Y×I→B a homotopy and H~0:Y→E a lift of H(−,0); there is a unique lift H~:Y×I→E extending H~0 (Existence and uniqueness of homotopy lifts through a covering map).

[F5]

For every k≥2 the sphere Sk is simply connected, hence path-connected and locally path-connected (Sn is simply connected for every n≥2, Cubical and spherical models of higher homotopy agree).

[F6]

The unordered inclusion ιC:Cn(int⁡D2)→Cn(D2) is a homotopy equivalence, the coordinatewise radial map restricts to a homeomorphism Cn(C)→Cn(int⁡D2), and homotopy equivalences induce isomorphisms on all homotopy groups in degrees ≥1 (The interior-disc and closed-disc configuration spaces are homotopy equivalent, Higher homotopy groups are functorial and based homotopy invariant).

[F7]

Bnconf=π1(Cn(D2),[q]) for the orbit of a base configuration of interior points, and the inclusion of the open-disc model induces an isomorphism π1(Cn(int⁡D2),[q])→Bnconf (The configuration braid group Bnconf as the fundamental group of an unordered configuration space).

Proof

technique · direct
1.1A1F1

Ordered vanishing. Under the standing assumption [A1], which discharges the Axiom-of-Choice hypothesis of [F1], the ordered result applies: for the chosen preimage x∈Fn(int⁡D2) of b one has πk(Fn(int⁡D2),x)=0 for the degree k≥2; that is, every based map Sk→Fn(int⁡D2) at x is based-homotopic to the constant map.

1.2F2F3F4F5

Covering and lifting tools. By [F2] the quotient p:Fn(int⁡D2)→Cn(int⁡D2) is a covering with both spaces path-connected; by [F5] the sphere Sk is path-connected, locally path-connected and simply connected with π1(Sk,s0)=1 for k≥2; the based lifting criterion [F3] and the homotopy lifting theorem [F4] are therefore available for based maps out of (Sk,s0).

1.3F6

Transferring along the disc models. The coordinatewise radial map gives homeomorphisms Cn(C)≅Cn(int⁡D2), and the unordered inclusion ιC:Cn(int⁡D2)→Cn(D2) is a homotopy equivalence; by [F6] both induce isomorphisms on πj for every j≥1, so vanishing of πk transfers between the three models at corresponding basepoints.

2.1step 1.2F3

Lifting a based sphere. Let u:(Sk,s0)→(Cn(int⁡D2),b) be a based map. Its induced map on π1 is trivial because π1(Sk,s0)=1 by step 1.2, so u∗π1(Sk,s0)={1}⊆p∗π1(Fn(int⁡D2),x) and the lifting criterion [F3] provides a based lift u~:(Sk,s0)→(Fn(int⁡D2),x) with p∘u~=u.

3.1step 1.1step 2.1F4

Nullhomotoping the lift and projecting. By step 1.1 the based class [u~]∈πk(Fn(int⁡D2),x) is trivial, so there is a based homotopy H~:Sk×I→Fn(int⁡D2) from u~ to the constant map at x with H~(s0,t)=x for all t. Then p∘H~:Sk×I→Cn(int⁡D2) is a based homotopy from u=p∘u~ to the constant map at b, because p(x)=b; hence u is nullhomotopic as a based map, and [u]=0 in πk(Cn(int⁡D2),b).

4.1step 3.1

Vanishing for the unordered open-disc model. Since u was an arbitrary based map out of (Sk,s0) with arbitrary basepoint b and arbitrary k≥2, step 3.1 shows that every based class in πk(Cn(int⁡D2),b) is trivial, so πk(Cn(int⁡D2),b)=0.

5.1step 1.3step 4.1F7

The other models and the K(Bnconf,1) reading. By step 1.3 the vanishing of step 4.1 transfers to πk(Cn(C),b′) and πk(Cn(D2),b′′) for arbitrary basepoints, and [F7] identifies the fundamental groups of the open-disc and plane models with Bnconf; hence these spaces have fundamental group Bnconf and vanishing higher homotopy groups, that is, they are K(Bnconf,1) in the higher-homotopy sense.

The proof lifts sphere classes to the ordered configuration space, where they vanish by ordered asphericity, and projects the nullhomotopy; the covering is used through its lifting properties only, and the case k=2 of the ordered input was proved without point pushing. ∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

79 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