Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Ordered configuration spaces cover the unordered ones regularly with deck group Sn

Statement

Let M be a nonempty connected Hausdorff topological d-manifold with boundary, possibly empty boundary, in the sense of Topological manifolds with boundary, of dimension d≥2, and let n∈N. Write p:Fn(M)→Cn(M) for the quotient map from the ordered to the unordered configuration space (Ordered configuration spaces Fn(X), Unordered configuration spaces Cn(X)). Then:

  1. p is a covering map in the sense of Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings; every fibre of p has exactly n! elements, so p is an n!-sheeted covering, and each point of Cn(M) has an evenly covered neighbourhood of the form supplied by Disjoint coordinate neighbourhoods evenly cover the unordered configuration space.
  2. Fn(M) is path-connected, and so is Cn(M); in particular Fn(M) is connected and is a connected covering space of Cn(M).
  3. The deck group Deck⁡(p) (Deck transformations and the deck-transformation group of a covering) is isomorphic to Sn: the map σ↦τσ, τσ(x):=σ⋅x, is an isomorphism of groups from Sn onto Deck⁡(p), where Sn acts on Fn(M) by permuting the labels 1,…,n (The symmetric group acts continuously and freely on Fn(X) by permuting labels).
  4. p is a regular covering in the sense of Regular coverings: its deck group acts transitively on every fibre.

For n=0 the spaces F0(M) and C0(M) are one-point spaces and p is their unique homeomorphism, so the assertions hold with 0!=1. No choice principle, paracompactness or second countability beyond the manifold definition is used.

Facts & Assumptions

Given: A natural number n, a nonempty connected Hausdorff topological d-manifold M with boundary, d≥2, its configuration spaces and the quotient map p:Fn(M)→Cn(M).

[F1]

Points of Fn(X) are the tuples (x1,…,xn)∈Xn with xi≠xj for i≠j, carrying the subspace topology; F0(X) is a one-point space, F1(X) is canonically homeomorphic to X by single-coordinate evaluation, and Fn(X)≠∅ exactly when X has at least n distinct points (Ordered configuration spaces Fn(X)).

[L2]

Cn(X)=Fn(X)/Sn carries the quotient topology of the canonical projection p, which is a quotient map; two tuples have the same image exactly when they differ by a permutation of coordinates; for n=0 both spaces are one-point spaces and p is their unique homeomorphism (Unordered configuration spaces Cn(X)).

[L3]

The formula (σ⋅x)i=xσ−1(i−1)+1 defines a continuous free action of Sn on Fn(X) by homeomorphisms, and the orbit of x is {σ⋅x:σ∈Sn} (The symmetric group acts continuously and freely on Fn(X) by permuting labels, The orbit G⋅x and stabilizer Gx of a point in a group action); ∣Sn∣=n! (The Lehmer code gives ∣Sn∣=n! again).

[L4]

For X Hausdorff and q∈Fn(X), the quotient map is evenly covered at [q] by n! sheets of the form σ(U) for pairwise disjoint open coordinate neighbourhoods Ui of the qi (Disjoint coordinate neighbourhoods evenly cover the unordered configuration space). A covering map is a continuous surjection admitting such evenly covered neighbourhoods, and an n!-sheeted covering is one whose fibres all have n! elements (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).

[L5]

M is a Hausdorff second-countable space in which every point has a neighbourhood homeomorphic to a relatively open subset of the upper half-space Hd={x∈Rd:xd≥0} (Topological manifolds with boundary, Euclidean upper half-space and its boundary); M is nonempty and connected (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).

[L6]

A relatively open subset of Hd is Hd∩O for some open O⊆Rd, and the balls B(c,ε) form a basis of the metric topology of Rd, so for c∈O there is ε>0 with B(c,ε)∩Hd⊆Hd∩O (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, 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). The ball B(c,ε) is convex, and the half-space Hd is convex; segments t↦(1−t)a+tb are continuous because scalar multiplication and addition of Rd are continuous (Vector addition and scalar multiplication are continuous in a normed space, Continuity of a map of topological spaces at a point and globally).

[L8]

In a Hausdorff space X the complement of a point is open, hence every finite subset is closed and the complement of a finite subset is open; this uses only the definition of the Hausdorff condition and the axioms of a topology (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L9]

A deck transformation of a covering p is a homeomorphism h of the total space with p∘h=p; on a connected total space two deck transformations agreeing at one point are equal (Deck transformations and the deck-transformation group of a covering, On a connected covering space, a deck transformation is determined by one point and the deck action is free).

[L10]

A covering p:E→B with path-connected total space is regular when its deck group acts transitively on every fibre (Regular coverings).

Proof

technique · direct
1.1

Punctured relative balls are path-connected. Let d≥2, c∈Hd, ε>0 and R:=(B(c,ε)∩Hd)∖{c}. The set B(c,ε)∩Hd is convex by [L6], so segments between its points stay in it and are continuous paths; write e1:=(1,0,…,0) and ed:=(0,…,0,1), whose last coordinates are 0 and 1 respectively, so that c+λei∈R for 0<λ<ε and i∈{1,d}, and R≠∅. Let u∈R, ρ:=∣u−c∣∈(0,ε) and qi:=c+ρei∈R. The segment [u,qi] contains c only if u−c is a negative multiple of ei, which can happen for at most one of i∈{1,d} because e1 and ed are not parallel; choose i with c∉[u,qi], so [u,qi]⊆R joins u to qi. The segment [qi,c+(ε/2)ei] lies in R, since all its points are of the form c+λei with λ>0. The segment [c+(ε/2)e1,c+(ε/2)ed] lies in R, since a point of it equals c only if (1−t)(ε/2)e1+t(ε/2)ed=0, which forces t=0 and t=1 simultaneously as e1,ed are linearly independent. Hence any two points of R are joined by a polygonal path in R, so R is path-connected.

L6
1.2

Local form of M. Let s∈M and let O⊆M be open with s∈O. By [L5] there are an open U⊆M containing s and a homeomorphism ψ of U onto a relatively open V⊆Hd. Replacing U by U∩O, which still contains s, we may suppose U⊆O. By [L6] there is ε>0 with B(ψ(s),ε)∩Hd⊆V; set W:=ψ−1(B(ψ(s),ε)∩Hd), an open neighbourhood of s with W⊆O, homeomorphic to the relative ball B(ψ(s),ε)∩Hd.

L5L6
1.3

p is an n!-sheeted covering. Let y∈Cn(M); by [L2] there is q∈Fn(M) with p(q)=y, and [L4] makes p evenly covered at y with n! sheets. Hence p is a covering map, and the fibre p−1(y) meets each of the n! sheets in exactly one point, because on each sheet p restricts to a homeomorphism; so every fibre has exactly n! elements.

L2L4
2.1

M is infinite. Apply step 1.2 with O:=M and some s∈M, obtaining W≅B(ψ(s),ε)∩Hd. By step 1.1 the set W∖{s}, which corresponds to the punctured relative ball at ψ(s), is nonempty and path-connected, so M has at least two points. If M were finite, then for y≠s the sets {y} are closed by [L8], so {s} and M∖{s} would be disjoint nonempty open sets covering M, a separation of the connected space M by [L5]; hence M is infinite.

step 1.1step 1.2L5L7L8
2.2

M is locally path-connected. Let s∈M and let O be a neighbourhood of s. Step 1.2 gives a neighbourhood W of s with W⊆O homeomorphic to a relative ball B(ψ(s),ε)∩Hd, which is path-connected by [L6]. A homeomorphism carries paths to paths, so W is path-connected: the path-connected open sets form a neighbourhood basis of s.

step 1.2L6
3.1

M is path-connected. It is connected and locally path-connected by [L5] and step 2.2, so [L7] makes it path-connected.

step 2.2L5L7
4.1

Complements of finite sets are path-connected. Let S⊆M be finite. Step 2.1 makes M infinite, so M∖S≠∅; indeed M∖S cannot be finite, for then M=(M∖S)∪S would be a union of two finite sets. For each x∈M∖S, steps 1.2 and 2.2 give a path-connected open neighbourhood Wx⊆M∖S of x, since M∖S is open by [L8]. Thus each path component P of M∖S is open in M: every x∈P has such a Wx⊆P. No simultaneous choice of the neighbourhoods is required. For each of the finitely many s∈S apply steps 1.1 and 1.2 with O:=M∖(S∖{s}), which is open by [L8]: this gives an open neighbourhood Ws of s with Ws⊆O and Ws∖{s} path-connected, hence contained in a single path component P(s) of M∖S. For each path component P of M∖S define AP:=P∪{s∈S:P(s)=P}. It is open in M: P is open, and for each added point s the open set Ws lies in AP, since Ws∖{s}⊆P. The sets AP are pairwise disjoint and cover M, because each point of M∖S belongs to exactly one path component and each s∈S has exactly one assigned component P(s). If there were two or more components, choose one P; then AP and the union of all AQ for Q≠P would be disjoint nonempty open sets covering M, contradicting connectedness by [L5]. Hence M∖S is path-connected.

step 1.2step 2.1step 2.2step 3.1L5L7L8
5.1

Fn(M) is path-connected. Let x=(x1,…,xn) and y=(y1,…,yn) be points of Fn(M) with n≥1, and let S:={x1,…,xn,y1,…,yn}, a finite set; by steps 2.1 and 4.1 the complement M∖S is infinite, so choose distinct points z1,…,zn∈M∖S and put z:=(z1,…,zn)∈Fn(M). For k=1,…,n the set M∖{xk+1,…,xn,z1,…,zk−1} is path-connected by step 4.1, and both xk and zk lie in it, so there is a path in it from xk to zk; replacing the k-th coordinate by that path while keeping the other coordinates fixed gives a path in Fn(M) from (z1,…,zk−1,xk,…,xn) to (z1,…,zk,xk+1,…,xn), because every value of the moving coordinate avoids the finitely many fixed coordinates and the fixed coordinates are pairwise distinct. Concatenating these n paths yields a path from x to z, and the same construction with the roles of x and y exchanged yields a path from y to z; reversing the latter and concatenating gives a path in Fn(M) from x to y. For n=0, F0(M) is a one-point space by [F1].

step 2.1step 4.1F1
6.1

Cn(M) is path-connected. p is continuous and surjective, so for points p(x),p(y)∈Cn(M) a path in Fn(M) from x to y, which exists by step 5.1, composes with p to a path in Cn(M) joining them.

step 5.1L2
6.2

Deck group. For σ∈Sn the map τσ(x):=σ⋅x is a homeomorphism of Fn(M) by [L3], and p∘τσ=p because σ⋅x lies in the orbit of x; hence τσ∈Deck⁡(p) by [L9]. The assignment σ↦τσ is a group homomorphism, since τσρ(x)=(σρ)⋅x=σ⋅(ρ⋅x)=τσ(τρ(x)) by the left-action law [L3], and it is injective: if τσ=τρ then σ⋅x=ρ⋅x for every x, so ρ−1σ fixes a point of Fn(M), which is nonempty by step 5.1 and [F1], and freeness gives ρ−1σ=id⁡. By step 5.1 the total space is connected, so by [L9] a deck transformation is determined by its value at a point; since every deck transformation permutes the fibre over p(x), evaluation at any x∈Fn(M) injects Deck⁡(p) into that fibre, so ∣Deck⁡(p)∣≤n! by step 1.3, while the injective homomorphism exhibits n!=∣Sn∣ deck transformations. Therefore σ↦τσ is a bijective homomorphism, hence by [L11] an isomorphism Sn≅Deck⁡(p).

step 5.1step 1.3F1L3L9L11
7.1

Regularity. Let y∈Cn(M) and let x,x′∈p−1(y). By [L2] there is σ∈Sn with x′=σ⋅x=τσ(x), so the deck group acts transitively on the fibre; since Fn(M) is path-connected by step 5.1, [L10] makes p a regular covering.

step 5.1step 6.2L2L10
8.1

Conclusion. Claim 1 is step 1.3, claim 2 is steps 5.1 and 6.1 together with [L7], claim 3 is step 6.2 and claim 4 is step 7.1; the case n=0 is [L2] and [F1].

step 5.1step 6.1step 1.3step 6.2step 7.1F1L2L7∎

Depends on

Used by

Dependency tree · two levels

82 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