Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-27
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 interior-disc and closed-disc configuration spaces are homotopy equivalent

Statement

Write D2:={ z∈C:∣z∣≤1 },int⁡D2:={ z∈C:∣z∣<1 } for the closed unit disc and its interior in C; the topological interior of D2 in C is exactly int⁡D2 (step 1.1), so the notation is accurate. For n∈N write Fn(D2), Fn(int⁡D2) for the ordered configuration spaces and Cn(D2), Cn(int⁡D2) for the unordered ones (Ordered configuration spaces Fn(X), Unordered configuration spaces Cn(X)), with quotient maps pX:Fn(X)→Cn(X). Let ιF:Fn(int⁡D2)→Fn(D2) be the inclusion and let ιC:Cn(int⁡D2)→Cn(D2) be the map induced by ιF on the orbit quotients (constructed in step 3.2). Put ρF(x1,…,xn):=(x12,…,xn2),Ht(x1,…,xn):=((1−t2)x1,…,(1−t2)xn)(t∈I), for x∈Fn(D2). Then for every n∈N:

  1. H is a homotopy from id⁡Fn(D2) to the composite ιF∘ρF, and the restriction of H to Fn(int⁡D2)×I is a homotopy from id⁡Fn(int⁡D2) to ρF∘ιF; hence ιF is a homotopy equivalence (Homotopy equivalences, homotopy inverses and spaces of the same homotopy type) with homotopy inverse ρF.
  2. H descends to a homotopy HC:Cn(D2)×I→Cn(D2) from id⁡Cn(D2) to ιC∘ρC, where ρC is the map induced by ρF (step 4.2); likewise the descended homotopy restricted to Cn(int⁡D2) exhibits ρC∘ιC≃id⁡Cn(int⁡D2) (step 6.1). Hence ιC is a homotopy equivalence with homotopy inverse ρC, and the two equivalences are compatible with the quotient maps: pD2∘Ht=HtC∘pD2,pint⁡D2∘ρF=ρC∘pD2,ιC∘pint⁡D2=pD2∘ιF.
  3. For every q∈Fn(int⁡D2) the induced homomorphisms of fundamental groups (The homomorphism on fundamental groups induced by a pointed continuous map) ι∗F:π1(Fn(int⁡D2),q)→π1(Fn(D2),q),ι∗C:π1(Cn(int⁡D2),[q])→π1(Cn(D2),[q]) are isomorphisms. In particular the closed-disc and open-disc models compute the same fundamental groups at every configuration of interior points, so no boundary basepoint change is needed when a later result is stated on either model.

The case n=0 is included: F0 and C0 of either space are one-point spaces, and the assertions are the trivial ones.

Facts & Assumptions

Given: A natural number n, the closed unit disc D2={z∈C:∣z∣≤1} and the open disc int⁡D2={z∈C:∣z∣<1}, the unit interval I=[0,1], and the four configuration spaces of the statement with the maps ιF,ιC,ρF,H,pX.

[F1]

Points of Fn(X) are the tuples (x1,…,xn)∈Xn with xi≠xj for i≠j, carrying the subspace topology of the product Xn; F0(X) is a one-point space, F1(X) is canonically homeomorphic to X by single-coordinate evaluation, and the label i names the coordinate of index i−1 under the identification κ(i)=i−1 of {1,…,n} with n={0,…,n−1} (Ordered configuration spaces Fn(X)).

[L2]

Cn(X)=Fn(X)/Sn carries the quotient topology of the canonical projection pX:Fn(X)→Cn(X), which is a quotient map; two tuples lie in the same orbit exactly when they differ by a permutation of coordinates, and the basepoint of Cn(X) at q∈Fn(X) is the orbit [q] (Unordered configuration spaces Cn(X)). The formula (σ⋅x)i=xσ−1(i−1)+1 defines a continuous action of Sn on Fn(X), by homeomorphisms of Fn(X), and this action is free (The symmetric group acts continuously and freely on Fn(X) by permuting labels).

[L3]

A homotopy from f to g is a continuous map H:X×I→Y with H(⋅,0)=f and H(⋅,1)=g, and f:X→Y is a homotopy equivalence when there is a continuous g:Y→X with g∘f≃id⁡X and f∘g≃id⁡Y (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints, Homotopy equivalences, homotopy inverses and spaces of the same homotopy type).

[L4]

C is a field (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)) and its modulus satisfies ∣z∣≥0, ∣z∣=0⟺z=0, ∣zw∣=∣z∣∣w∣ and ∣z+w∣≤∣z∣+∣w∣ for all z,w (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive); the metric of the plane is dC(z,w)=∣z−w∣ (The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane).

[L5]

The open balls B(z,ε)={w:dC(z,w)<ε} are a basis of the metric topology, so a subset of C is open exactly when every point of it has a ball around it contained in the set (Open ball, closed ball and sphere in a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement); scalar multiplication C×C→C, (λ,z)↦λz, is continuous (Vector addition and scalar multiplication are continuous in a normed space); a map into a product space is continuous exactly when all its components are (A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice); composites and restrictions of continuous maps are continuous, and a function is continuous as soon as its restrictions to the members of a finite closed cover are continuous (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous, Continuity of a map of topological spaces at a point and globally); open boxes form a basis of the product topology (The product set ∏i∈IXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), and finite unions of open sets are open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L7]

The product [α][β]=[α∗β] traverses α first and β second, and makes π1(X,x0) a group whose identity is the class of the constant loop cx0 and in which [α]−1=[αˉ] (Based loops and the fundamental group, Loop classes form the group π1(X,x0) under concatenation). Concatenation of paths respects path homotopy rel endpoints, is associative up to such homotopy, absorbs constant paths, and λ∗λˉ is nullhomotopic rel endpoints; a path c from x0 to x1 gives by [α]↦[cˉ∗α∗c] an isomorphism π1(X,x0)≅π1(X,x1) (Conjugating loop classes by a path is an isomorphism of fundamental groups).

[L8]

A bijective group homomorphism is a group isomorphism (Group isomorphisms, automorphisms and the set Aut⁡(G)); for continuous f the assignment f∗([α])=[f∘α] is a well-defined group homomorphism and (g∘f)∗=g∗∘f∗ (The homomorphism on fundamental groups induced by a pointed continuous map, Induced fundamental-group maps are well defined, functorial and invariant under based homotopy).

Proof

technique · direct
1.1

The interior of D2 is int⁡D2. By [L4] the ball of radius ε about z is {w:∣w−z∣<ε}. If ∣z∣<1, put ε:=1−∣z∣>0; then every w with ∣w−z∣<ε has ∣w∣≤∣w−z∣+∣z∣<ε+∣z∣=1, so the ball lies in D2, and by [L5] z is an interior point. If ∣z∣=1 and ε>0, the point w:=(1+ε/2)z has ∣w−z∣=(ε/2)∣z∣=ε/2<ε but ∣w∣=1+ε/2>1, so it lies outside D2 and no ball about z is contained in D2. If ∣z∣>1 then z∉D2. Hence the interior of D2 in C is exactly {z:∣z∣<1}.

L4L5
1.2

Scaling by λ∈(0,1] preserves configurations. Let λ∈(0,1], let m∈N and let x∈Fm(D2) or x∈Fm(int⁡D2) according to the case, and put λx:=(λx1,…,λxm). Then ∣λxi∣=∣λ∣ ∣xi∣=λ∣xi∣≤∣xi∣≤1, with ∣λxi∣≤∣xi∣<1 when all ∣xi∣<1; and λxi=λxj implies xi=λ−1λxi=λ−1λxj=xj because λ≠0. So λx∈Fm(D2), and λx∈Fm(int⁡D2) whenever x∈Fm(int⁡D2).

F1L4
1.3

The quotient projection is open. Let V⊆Fm(X) be open. A tuple x lies in pX−1(pX(V)) exactly when x=σ⋅v for some σ∈Sm and v∈V, so pX−1(pX(V))=⋃σ∈Smσ(V). Each σ(V) is open because σ acts by a homeomorphism of Fm(X) ([L2]), so this finite union is open by [L5]; hence pX(V) is open in the quotient topology (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). Thus pX is an open map.

L2L5
1.4

Moving-basepoint lemma. Let Y be a space, let c:I→Y be continuous and let G:I×I→Y be continuous with G(0,u)=G(1,u)=c(u) for every u∈I; write G0(s):=G(s,0) and G1(s):=G(s,1), loops at c(0) and c(1). Then G0∗c≃c∗G1 rel endpoints. Indeed, put A(s):=(2s,0) for s≤12 and A(s):=(1,2s−1) for s≥12, and B(s):=(0,2s) for s≤12 and B(s):=(2s−1,1) for s≥12; on each of the two closed halves a single continuous formula is given, and at s=12 both formulas for A give (1,0) and both formulas for B give (0,1), so by the finite closed pasting of [L5] A and B are continuous paths in I×I with A(0)=B(0)=(0,0) and A(1)=B(1)=(1,1). Put Pt(s):=(1−t)A(s)+tB(s) for (s,t)∈I×I, a continuous map into I×I. Then (s,t)↦G(Pt(s)) is continuous, for each t it is a path from G(0,0)=c(0) to G(1,1)=c(1), and G∘P0=G∘A=G0∗c, G∘P1=G∘B=c∗G1, because for s≤12 one has G(A(s))=G(2s,0)=G0(2s) and G(B(s))=G(0,2s)=c(2s), while for s≥12 one has G(A(s))=G(1,2s−1)=c(2s−1) and G(B(s))=G(2s−1,1)=G1(2s−1). So G∘P is a path homotopy rel endpoints from G0∗c to c∗G1.

L3L5
2.1

The scaling map and the homotopy are well defined. Put λ(t):=1−t/2 for t∈I; then 1/2≤λ(t)≤1, so λ(t)∈(0,1], and λ(0)=1, λ(1)=1/2. Define Ht(x):=(λ(t)x1,…,λ(t)xn) and ρF:=H1. By step 1.2, Ht maps Fn(D2) into itself and Fn(int⁡D2) into itself, so H1=ρF is a well-defined map Fn(D2)→Fn(int⁡D2) and H0=id⁡Fn(D2). Consequently H1=ιF∘ρF as maps Fn(D2)→Fn(D2), and the restriction of H to Fn(int⁡D2)×I is a homotopy within Fn(int⁡D2) from id⁡Fn(int⁡D2) to ρF∘ιF.

step 1.2F1algebra
3.1

Joint continuity of H. The map (x,t)↦(λ(t),xi) from Fn(D2)×I to C×C is continuous: its first component is the composite of the projection to I with the affine map t↦1−t/2, its second the composite of the projection to Fn(D2) with the i-th coordinate projection of the product Cn. Hence (x,t)↦λ(t)xi is continuous as a composite with scalar multiplication [L5], so (x,t)↦Ht(x) is continuous into the product Cn by the component criterion and, since its values lie in the subspace, into Fn(D2); the restricted map Fn(int⁡D2)×I→Fn(int⁡D2) is continuous for the same reason. Thus H and its restriction are continuous homotopies.

F1L5step 2.1
3.2

Equivariance and the induced map ιC. For σ∈Sn, x∈Fn(D2), t∈I and every label i one has (Ht(σ⋅x))i=λ(t)(σ⋅x)i=λ(t)xσ−1(i−1)+1=(σ⋅Ht(x))i, so Ht(σ⋅x)=σ⋅Ht(x); with t=1 this gives ρF(σ⋅x)=σ⋅ρF(x). Hence pD2∘ιF is constant on the fibres of pint⁡D2, and since it is continuous, [L6] factors it uniquely through a continuous ιC with ιC∘pint⁡D2=pD2∘ιF, sending the orbit of x to the same orbit viewed in Fn(D2); ιC is injective because two orbits of Fn(int⁡D2) that coincide as subsets of Fn(D2) are equal. It is also open onto its image: for V⊆Cn(int⁡D2) open, W:=pint⁡D2−1(V) is open, Fn(int⁡D2)=(int⁡D2)n∩Fn(D2) is open in Fn(D2), and the saturated set ⋃σ∈Snσ(W)=pD2−1(ιC(V)) is open in Fn(D2), so ιC(V) is open in Cn(D2); a continuous injective open map is a homeomorphism onto its image.

F1L2L5L6step 2.1
3.3

Injectivity for the ordered spaces. Let δ be a loop in Fn(int⁡D2) at q with [ιF∘δ] trivial, and let F:I×I→Fn(D2) with F(s,0)=ιF(δ(s)), F(s,1)=q and F(0,u)=F(1,u)=q be the nullhomotopy rel endpoints. Then ρF∘F is a nullhomotopy rel endpoints of ρF∘δ in Fn(int⁡D2), so [ρF∘δ]=1. Apply step 1.4 to G(s,u):=Hu(δ(s)), which by step 2.1 takes values in Fn(int⁡D2) and satisfies G(0,u)=G(1,u)=c(u) for c(u)=Hu(q): it gives δ∗c≃c∗(ρF∘δ) rel endpoints. Since ρF∘δ is nullhomotopic, [L7] gives c∗(ρF∘δ)≃c and hence δ∗c≃c; right-concatenating with cˉ and using that c∗cˉ is nullhomotopic with constants absorbed, δ≃δ∗(c∗cˉ)≃c∗cˉ≃cq. So [δ]=1 and ι∗F is injective.

step 1.4step 2.1L7L8
4.1

Claim 1. By steps 2.1 and 3.1, H is a homotopy from id⁡Fn(D2)=H0 to H1=ιF∘ρF, and its restriction to Fn(int⁡D2)×I is a homotopy from id⁡Fn(int⁡D2) to ρF∘ιF; equivalently ιF∘ρF≃id⁡Fn(D2) and ρF∘ιF≃id⁡Fn(int⁡D2). By [L3], ιF is a homotopy equivalence with homotopy inverse ρF.

step 2.1step 3.1L3
4.2

The descended scaling map ρC. Since ρF is continuous and Sn-equivariant by step 3.2, the continuous composite pint⁡D2∘ρF is constant on the fibres of pD2: equivariance makes the images of orbit representatives belong to the same target orbit. By [L6] this composite factors uniquely through a continuous map ρC:Cn(D2)→Cn(int⁡D2) with pint⁡D2∘ρF=ρC∘pD2.

L6step 3.2
4.3

Surjectivity for the ordered spaces. Let γ be a loop in Fn(D2) at q∈Fn(int⁡D2) and put c(u):=Hu(q) for u∈I. By steps 2.1 and 3.1, c is a path in Fn(int⁡D2) from q to ρF(q) and G(s,u):=Hu(γ(s)) is a continuous map I×I→Fn(D2) with G(0,u)=G(1,u)=c(u), G0=γ and G1=ρF∘γ, so step 1.4 gives γ∗c≃c∗(ρF∘γ) rel endpoints. Then η:=c∗(ρF∘γ)∗cˉ is a loop in Fn(int⁡D2) at q, and right-concatenating that homotopy with cˉ, using [L7] that concatenation respects path homotopy and that c∗cˉ is nullhomotopic with constants absorbed, gives γ≃c∗(ρF∘γ)∗cˉ=ιF∘η rel endpoints. Hence [γ]=ι∗F([η]) by [L8] and ι∗F is surjective.

step 1.4step 2.1step 3.1L7L8
5.1

The descended homotopy HC. Put q:=pD2×id⁡I:Fn(D2)×I→Cn(D2)×I. This q is continuous and surjective, and it is a quotient map: if O⊆Fn(D2)×I is open and (x,t)∈O, the box basis [L5] gives a box U×J⊆O with x∈U and t∈J, and by step 1.3 pD2(U) is open, so the box pD2(U)×J is an open subset of q(O) containing q(x,t), since any (y,t′) in it equals q(x′,t′) for some x′∈U. Hence q(O) is open. The formula HC(y,t):=pD2(Ht(x)) for x∈pD2−1(y) is well defined by the equivariance of H (step 3.2), and HC∘q=pD2∘H is continuous, so [L6] makes HC:Cn(D2)×I→Cn(D2) continuous. It satisfies H0C=id⁡Cn(D2), pD2∘Ht=HtC∘pD2, and H1C=ιC∘ρC, the last because on classes H1C([x])=[H1(x)]=[ρF(x)]=ιC(ρC([x])) by steps 3.2 and 4.2.

L5L6step 1.3step 3.2step 4.2
5.2

Claim 3 for the ordered spaces. Let q∈Fn(int⁡D2) and let ι∗F be the induced homomorphism of [L8]. If n=0 then F0(int⁡D2) and F0(D2) are one-point spaces, all their loops are constant, so both fundamental groups are one-element groups and ι∗F is a bijection. If n≥1, steps 4.3 and 3.3 exhibit ι∗F as surjective and injective. In both cases [L8] makes ι∗F a group isomorphism.

step 4.3step 3.3L8
6.1

The restricted homotopy on Cn(int⁡D2). Define K:Cn(int⁡D2)×I→Cn(int⁡D2) by letting K(y,t) be the orbit in Fn(int⁡D2) of Ht(x) for any x∈pint⁡D2−1(y); this is well defined by step 3.2 and its values lie in Cn(int⁡D2) because Ht maps Fn(int⁡D2) into itself (step 2.1). By the embedding property of step 3.2, K is continuous if and only if ιC∘K is, and ιC∘K(y,t)=HtC(ιC(y)) is the composite of the continuous map ιC×id⁡I with the continuous HC of step 5.1; so K is continuous, with K0=id⁡Cn(int⁡D2) and K1=ρC∘ιC.

step 2.1step 3.2step 5.1
7.1

Claim 2. Steps 5.1 and 6.1 give ιC∘ρC=H1C≃H0C=id⁡Cn(D2) and ρC∘ιC=K1≃K0=id⁡Cn(int⁡D2), so by [L3] ιC is a homotopy equivalence with homotopy inverse ρC, and the three compatibility identities of the statement hold by steps 3.2, 4.2 and 5.1.

step 3.2step 4.2step 5.1step 6.1L3
7.2

Claim 3 for the unordered spaces. Let y:=[q]∈Cn(int⁡D2) and let γ be a loop in Cn(D2) at y. Put c(u):=HuC(y) and G(s,u):=HuC(γ(s)); by steps 5.1 and 6.1 these are continuous, G(0,u)=G(1,u)=c(u), G0=γ and G1=ρC∘γ because H1C=ιC∘ρC, and c is a path in Cn(int⁡D2) from y to ρC(y). Step 1.4 gives γ∗c≃c∗(ρC∘γ), and η:=c∗(ρC∘γ)∗cˉ is a loop in Cn(int⁡D2) at y with ιC∘η≃γ, so ι∗C is surjective. For injectivity let δ be a loop in Cn(int⁡D2) at y with ι∗C([δ])=1, witnessed by a nullhomotopy F of ιC∘δ; then ρC∘F nullhomotopes ρC∘δ, and step 1.4 applied to G(s,u):=Ku(δ(s)) of step 6.1 gives δ∗c≃c∗(ρC∘δ)≃c, whence δ≃cq by the same cancellation as in step 3.3. So ι∗C is injective, and for n=0 both groups are one-element as in step 5.2. By [L8], ι∗C is an isomorphism.

step 1.4step 5.1step 6.1step 3.3step 5.2L7L8
8.1

Conclusion. Claim 1 is step 4.1, claim 2 is step 7.1 and claim 3 is steps 5.2 and 7.2, so all the assertions of the statement hold.

step 4.1step 7.1step 5.2step 7.2∎

Depends on

Used by

Dependency tree · two levels

80 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