Alphabeta Math
Pipeline-generated
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.

✓ 10 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Ordered and Unordered Configuration Spaces

1 · Prerequisites

2 · Summary

Deleted collision diagonals are what make the coordinate permutation action free, and the orbit quotient of that action is the unordered configuration space: the ordered projection is then an n!-sheeted regular covering whose deck group is the symmetric group, so the endpoint ordering of a lifted loop defines the endpoint monodromy and the configuration braid groups sit in a short exact sequence 1 -> PB_n -> B_n^conf -> S_n -> 1, proved directly from covering theory and explicit adjacent half twists. The closed-disc and interior-disc models are compared by an explicit equivariant radial homotopy so that the group defined on the closed disc agrees with the boundaryless model used later. The page closes with the Fadell-Neuwirth forgetful map: point-moving bump homeomorphisms trivialise it over each base configuration with fibre the configuration space of the punctured manifold, the fibre type is constant by connectedness without any choice principle, and for the planar disc the numerable bundle and hence the Hurewicz fibration are obtained under the Axiom of Choice and Dependent Choice. The closed disc's manifold-with-boundary structure is supplied locally as a lemma, and the basepoint-change isomorphism used by the group definitions is proved locally on this page rather than imported from an examples page.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Ordered configuration spaces Fn(X)

Definition

Let n∈N, so that n={0,1,…,n−1} is the set of its predecessors (The natural numbers N (von Neumann)), and let X be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). Write

Xn:=∏k<nX

for the n-fold product, carrying 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 display its points as (x1,…,xn): the label i∈{1,…,n} names the coordinate of index i−1 in the sense of that definition. The ordered configuration space of n points in X is the subspace

Fn(X):={ (x1,…,xn)∈Xn  :  xi≠xj whenever i≠j }

with the subspace topology inherited from Xn (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). Equivalently

Fn(X)=Xn∖⋃i≠j{(x1,…,xn)∈Xn:xi=xj},

since a tuple lies in Fn(X) exactly when its entries are pairwise distinct: the collision diagonals xi=xj, i≠j, are removed from the product. Points of Fn(X) are called ordered configurations of n points in X.

The label set. The labels 1,…,n are part of the data, and throughout this page they are identified with the set n={0,1,…,n−1} by the bijection κ(i):=i−1. It is through κ that the symmetric group Sn=Sym⁡(n) acts on Fn(X), in The symmetric group acts continuously and freely on Fn(X) by permuting labels.

Elementary cases. For n=0 the product X0 is a one-point space (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 the defining condition is vacuous, so

F0(X)={ the empty tuple }

for every X, including X=∅. For n=1 there is no pair i≠j, so single-coordinate evaluation (x1)↦x1 is a canonical homeomorphism F1(X)≅X. For n≥2 and any X one has

Fn(X)≠∅⟺X has at least n distinct points.

if X has at least n points, an injection {1,…,n}→X is exactly a tuple of pairwise distinct points of X, and conversely such a tuple displays n distinct points. In particular Fn(X)=∅ when X is empty and n≥1.

Based configurations. A base configuration in Fn(X) is a point q=(q1,…,qn) of Fn(X). Such a q is fixed once and for all only when Fn(X) is nonempty; when n≥1, Fn(X)≠∅, and X is infinite, Fn(X) is infinite: from any one configuration, keep coordinates 2,…,n fixed and vary the first coordinate among the infinitely many points of X∖{q2,…,qn}. The choice of q is part of the data of every construction below. All base configurations on this page are chosen in the ordered space Fn(X); the corresponding basepoint of the unordered quotient is its orbit (Unordered configuration spaces Cn(X)).

Separation of distinct coordinates. If X is Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not) and q∈Fn(X), then the finitely many points q1,…,qn are pairwise distinct, and for each pair i≠j Hausdorffness supplies disjoint open sets separating qi from qj; a finite intersection over the finitely many pairs j≠i therefore gives, for every i, an open neighbourhood Ui of qi with Ui∩Uj=∅ whenever i≠j. This is used in Disjoint coordinate neighbourhoods evenly cover the unordered configuration space.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

The symmetric group acts continuously and freely on Fn(X) by permuting labels

Statement

Let n∈N and let X be a topological space (Ordered configuration spaces Fn(X)). Give Sn the discrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies) and Fn(X) the subspace topology of its definition. Then

Sn×Fn(X)⟶Fn(X),(σ,x)⟼σ⋅x,(σ⋅x)i:=xσ−1(i−1)+1(1≤i≤n),

is a continuous left action of Sn on Fn(X), and it is free (A free group action has no nonidentity element fixing a point): σ⋅x=x forces σ=id⁡. The cases n=0 and n=1 are included, S0 and S1 being the trivial group, and so is the case Fn(X)=∅, where the action is continuous and free vacuously.

Facts & Assumptions

Given: A natural number n, a topological space X, the ordered configuration space Fn(X) with its label convention, and the symmetric group Sn acting on the label set {1,…,n} through κ(i)=i−1.

[F1]

Points of Fn(X) are the tuples (x1,…,xn)∈Xn with xi≠xj for i≠j, carrying the subspace topology, 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]

Sn=Sym⁡(n) is a group under composition, with (στ)(i)=σ(τ(i)) for i∈n, so that (στ)−1=τ−1σ−1 (Sym⁡(X) is a group under composition, and it is non-abelian whenever X has at least three distinct elements, The finite symmetric group Sn, one-line notation, and cycle notation).

[L3]

A left action of a group G on a set X is a map (g,x)↦g⋅x with e⋅x=x and (gh)⋅x=g⋅(h⋅x), and it is free when g⋅x=x implies g=e (Left group actions, transitive actions, and faithful actions, A free group action has no nonidentity element fixing a point).

[L5]

A function on a space is continuous if its restriction to each member of an open cover is continuous, and composites and restrictions of continuous maps 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).

[L6]

A set with the discrete topology has every subset open, and a finite group such as Sn carries the discrete topology here (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

Proof

technique · direct
1.1

The formula is well defined: for i∈{1,…,n} the index σ−1(i−1) lies in n, so σ−1(i−1)+1 is a label of {1,…,n}, and the resulting tuple in Xn has the coordinates of x reindexed along the bijection σ−1∘κ: writing y(k):=xk+1 for k∈n, its i-th coordinate is y(σ−1(κ(i))). A reindexing of pairwise distinct coordinates is again pairwise distinct, so σ⋅x∈Fn(X).

F1L2algebra
1.2

The assignment is a left action. The identity of Sn gives (id⁡⋅x)i=xi−1+1=xi, so id⁡⋅x=x; and for σ,τ∈Sn and every label i, ((στ)⋅x)i=x(στ)−1(i−1)+1=xτ−1(σ−1(i−1))+1=(τ⋅x)σ−1(i−1)+1=(σ⋅(τ⋅x))i, using (στ)−1=τ−1σ−1 and the composition convention (στ)(k)=σ(τ(k)). Since coordinates determine a tuple, (στ)⋅x=σ⋅(τ⋅x).

F1L2L3algebra
1.3

Each slice map x↦σ⋅x is continuous: its i-th component is the map x↦xσ−1(i−1)+1, the composite of the coordinate projection πσ−1(i−1) ⁣:Xn→X with the inclusion Fn(X)↪Xn, and both are continuous; the characteristic property of the product therefore gives continuity of the slice map into Xn, and its values lie in Fn(X), so it is continuous into Fn(X).

F1L4L5
1.4

The action is free. Suppose σ⋅x=x for some σ∈Sn and x∈Fn(X), and put y(k):=xk+1 for k∈n. Comparing coordinates gives y(σ−1(k))=y(k) for every k∈n, and replacing k by σ(k) gives y(k)=y(σ(k)) for every k. The coordinates of x are pairwise distinct, so y is injective, hence σ(k)=k for every k∈n and σ=id⁡. Thus no nonidentity element fixes a point of Fn(X).

F1L2L3algebra
2.1

The action map Sn×Fn(X)→Fn(X) is continuous. Since Sn is discrete, each {σ}×Fn(X) is open in the product and these sets cover it; the restriction of the action map to {σ}×Fn(X) is, after the evident identification with Fn(X), the continuous slice map of step 1.3. Continuity is local on an open cover, so the action map is continuous.

step 1.3L5L6
3.1

Steps 1.2 and 2.1 give a continuous left action and step 1.4 gives freeness in the sense of the definition, which is the assertion.

step 1.2step 2.1step 1.4L3∎
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

Unordered configuration spaces Cn(X)

Definition

Let n∈N and let X be a topological space (Ordered configuration spaces Fn(X), Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). The label permutation action

Sn×Fn(X)⟶Fn(X),(σ,x)⟼σ⋅x,(σ⋅x)i=xσ−1(i−1)+1,

is a continuous free left action (The symmetric group acts continuously and freely on Fn(X) by permuting labels). Its set of orbits Sn⋅x={σ⋅x:σ∈Sn} (The orbit G⋅x and stabilizer Gx of a point in a group action) is the unordered configuration space of n points in X, written

Cn(X):=Fn(X)/Sn={Sn⋅x:x∈Fn(X)},

and it carries the quotient topology of the canonical projection

pn:Fn(X)⟶Cn(X),pn(x):=Sn⋅x,

in the sense of The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection: a subset V⊆Cn(X) is open exactly when pn−1(V) is open in Fn(X). This projection is a quotient map, hence continuous and surjective, and points of Cn(X) are written [x]:=pn(x).

Basepoint. For a base configuration q∈Fn(X) in the sense of Ordered configuration spaces Fn(X), the basepoint of Cn(X) is the orbit

[q]=pn(q)=Sn⋅q,

and Cn(X) is nonempty exactly when Fn(X) is, in which case a basepoint can be fixed. The unordered space is based by the orbit of the ordered base configuration, and this is the basepoint used in every later construction on this page.

Elementary cases. C0(X) is the quotient of the one-point space F0(X) by the trivial group S0, hence is a one-point space. Since S1 is trivial, p1:F1(X)→C1(X) is a bijective quotient map and hence a homeomorphism: for every open U⊆F1(X), the equality p1−1(p1(U))=U makes p1(U) open by the quotient topology. Thus C1(X) is canonically homeomorphic to X by [(x)]↦x, using the single-coordinate homeomorphism F1(X)→X. These are canonical identifications, not literal equalities of the orbit set with the original set.

Elements are n-element subsets, as a set. Because the coordinates of a configuration are pairwise distinct, two ordered configurations x,y∈Fn(X) lie in the same orbit exactly when their underlying sets of coordinates agree: if y=σ⋅x then the coordinates of y are those of x in a different order, and conversely, if {x1,…,xn}={y1,…,yn}, then for every label i there is exactly one label σ(i) with yi=xσ(i), and i↦σ(i) is a bijection of {1,…,n} (Injection, surjection, bijection); composing with the identification κ(i)=i−1 of labels with n, the permutation τ=κ∘σ−1∘κ−1∈Sn takes x to y: (τ⋅x)i=xτ−1(i−1)+1=xσ(i)=yi. Hence

Cn(X)⟶{ S⊆X:S has exactly n elements },[x]⟼{x1,…,xn},

is a bijection of sets, the inverse sending an n-element subset S to the orbit of any enumeration of S (The cardinality ∣A∣ of a finite set). This identifies the elements of Cn(X) with n-element subsets of X; the topology on Cn(X) is the quotient topology displayed above, and no topology on a set of subsets is asserted here. In particular the quotient topology is not defined through any metric or hyperspace structure.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

Conjugating loop classes by a path is an isomorphism of fundamental groups

Statement

Let X be a topological space, let x0,x1∈X and let c:I→X be a path in X from x0 to x1 (Paths, path-connected spaces and path components). Write cˉ(s):=c(1−s) for the reversed path and let ∗ denote the first-then-second concatenation of composable paths of Paths, path-connected spaces and path components, so that for every based loop α:I→X at x0 (Based loops and the fundamental group) the concatenation cˉ∗α∗c is a loop at x1; the bracketing of that triple product is immaterial up to path homotopy rel endpoints by step 1.2 below, and the bracket (cˉ∗α)∗c is used throughout. Then:

  1. The assignment φc:π1(X,x0)⟶π1(X,x1),φc([α]):=[(cˉ∗α)∗c], is well defined: if α≃α′ rel endpoints (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints), then (cˉ∗α)∗c≃(cˉ∗α′)∗c rel endpoints.
  2. φc is a group isomorphism (Group isomorphisms, automorphisms and the set Aut⁡(G)), and its two-sided inverse is φcˉ:π1(X,x1)⟶π1(X,x0),φcˉ([β]):=[(c∗β)∗cˉ].

Consequently π1(X,x0)≅π1(X,x1) whenever a path from x0 to x1 exists, that is, whenever x0 and x1 lie in the same path component of X; the isomorphism depends on the chosen path, and no claim is made that it is independent of that choice.

Facts & Assumptions

Given: A topological space X, points x0,x1∈X and a path c:I→X from x0 to x1.

[F1]

A path in X from x to y is a continuous map γ:I→X with γ(0)=x and γ(1)=y; its reversal is γˉ(t)=γ(1−t) and joins y to x; composable paths concatenate by traversing each at double speed, and the constant path at a point x is continuous (Paths, path-connected spaces and path components).

[F2]

Based loops at x0 are paths α:I→X with α(0)=x0=α(1), and π1(X,x0) is their set of path-homotopy classes rel endpoints; the product [α][β]=[α∗β] traverses α first and β second, is well defined, 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).

[L3]

A path homotopy relative to the endpoints from α to α′ is a continuous H:I×I→X with H(s,0)=α(s), H(s,1)=α′(s), H(0,t)=α(0) and H(1,t)=α(1), and this relation is an equivalence relation on paths with fixed endpoints (Homotopies of continuous maps, homotopies relative to a subspace, and path homotopies relative to the endpoints, Homotopy relative to a fixed subspace, and path homotopy relative to endpoints, are equivalence relations).

[L4]

A map is continuous when its restrictions to the members of a finite closed cover are continuous and agree on overlaps; composites and restrictions of continuous maps are continuous (Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous).

[L5]

A bijective group homomorphism is a group isomorphism (Group isomorphisms, automorphisms and the set Aut⁡(G)).

Proof

technique · direct
1.1

Concatenation respects path homotopy rel endpoints. Let α≃α′ rel endpoints by H and β≃β′ rel endpoints by K, where α(1)=β(0) and α′(1)=β′(0) so that both concatenations are defined. Put G(s,t):=H(2s,t) for 0≤s≤12 and G(s,t):=K(2s−1,t) for 12≤s≤1. At s=12 the two formulas give H(1,t)=α(1) and K(0,t)=β(0) by the rel-endpoints condition, and these agree because the middle endpoints agree; hence G is a well-defined function on I×I. The two closed sets [0,12]×I and [12,1]×I cover I×I, and on each of them G is a composite of H or K with the continuous affine map (s,t)↦(2s,t) or (s,t)↦(2s−1,t), so [L4] makes G continuous. Finally G(s,0)=α∗β(s), G(s,1)=α′∗β′(s), G(0,t)=α(0)=α′(0) and G(1,t)=β(1)=β′(1), so G is a path homotopy α∗β≃α′∗β′ rel endpoints. A constant homotopy on one factor is the case β=β′, K(s,t):=β(s), so the same statement applies when only one of the two factors is deformed.

F1L3L4
1.2

Reparametrisation does not change the class. Let λ:I→X be a path and let φ:I→I be continuous with φ(0)=0 and φ(1)=1. Then H(s,t):=λ((1−t)φ(s)+ts) is continuous because the argument is obtained from the continuous maps s↦φ(s), s↦s and t↦t by products, sums and the continuous inclusion of I in R, and it satisfies H(s,0)=λ(φ(s)), H(s,1)=λ(s), H(0,t)=λ(0) and H(1,t)=λ(1): the last two because φ(0)=0 and φ(1)=1. So λ∘φ≃λ rel endpoints. Consequently the two bracketings of a triple concatenation of composable paths are reparametrisations of one another, so they are path-homotopic rel endpoints, and for a path λ from x to y the concatenations λ∗cy and cx∗λ with the constant paths at the endpoints are reparametrisations of λ, so both are path-homotopic to λ rel endpoints. Hence constant factors may be inserted and deleted inside a larger concatenation up to path homotopy rel endpoints.

F1L3L4
1.3

A path cancels its reversal. Let λ:I→X be a path from x to y and put H(s,t):=λ(2s(1−t)) for 0≤s≤12 and H(s,t):=λ(2(1−s)(1−t)) for 12≤s≤1. At s=12 both formulas give λ(1−t), and the two closed pieces cover I×I, so [L4] makes H continuous. One has H(s,0)=λ∗λˉ(s), H(s,1)=λ(0)=x, and H(0,t)=λ(0)=x=H(1,t), so H is a path homotopy λ∗λˉ≃cx rel endpoints, where cx is the constant path at the initial point. Applying the same statement to the reversed path λˉ, whose reversal is λ, gives λˉ∗λ≃cy rel endpoints.

F1L3L4
2.1

Well-definedness of φc. By [F1] the path cˉ joins x1 to x0 and the concatenation (cˉ∗α)∗c is a loop at x1 for every based loop α at x0, so the formula of the statement defines a function on the set of based loops. Let α≃α′ rel endpoints. Step 1.1 applied to the pair α≃α′ and the constant homotopy of cˉ gives cˉ∗α≃cˉ∗α′ rel endpoints, and step 1.1 applied again to that homotopy and the constant homotopy of c gives (cˉ∗α)∗c≃(cˉ∗α′)∗c rel endpoints. Both are loops at x1, so their classes in π1(X,x1) coincide by [F2], and φc is independent of the representative of [α].

step 1.1F1F2L3
2.2

φc is a homomorphism. Let α,β be based loops at x0. Then, using the product formula of [F2] and the bracketing freedom of step 1.2, φc([α])φc([β])=[(cˉ∗α∗c)∗(cˉ∗β∗c)]≃[(cˉ∗α)∗(c∗cˉ)∗(β∗c)]≃[(cˉ∗α)∗(β∗c)]≃[cˉ∗(α∗β)∗c]=φc([α][β]), where the second reduction replaces the loop c∗cˉ at x0 by a constant path using step 1.3 and deletes that constant factor using step 1.2, and where each replacement is licensed inside the ambient concatenation by step 1.1. Hence φc is a group homomorphism.

step 1.1step 1.2step 1.3F2
3.1

φcˉ is a two-sided inverse. The assignment φcˉ([β]):=[(c∗β)∗cˉ] is well defined by the argument of step 2.1 with c replaced by cˉ, and it maps π1(X,x1) to π1(X,x0). For a based loop α at x0 one has φcˉ(φc([α]))=[c∗((cˉ∗α)∗c)∗cˉ]; reassociating by step 1.2 and applying step 1.1 to insert the pairs, this class equals [(c∗cˉ)∗α∗(c∗cˉ)], and since c∗cˉ is homotopic to the constant path at x0 by step 1.3, deleting both constant factors with step 1.2 gives [α]. Symmetrically, for a based loop β at x1 one has φc(φcˉ([β]))=[cˉ∗((c∗β)∗cˉ)∗c]≃[(cˉ∗c)∗β∗(cˉ∗c)]=[β] by the same two steps, because cˉ∗c is homotopic to the constant path at x1 by step 1.3. So the two composites are the identities.

step 1.1step 1.2step 1.3step 2.1F2
4.1

Conclusion. Steps 2.1, 2.2 and 3.1 exhibit φc as a well-defined group homomorphism with a two-sided inverse, hence a bijection, and [L5] makes it a group isomorphism. The final assertion follows because a path from x0 to x1 exists exactly when the two points lie in the same path component of X by [F1].

step 2.1step 2.2step 3.1F1L5∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

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∎
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Disjoint coordinate neighbourhoods evenly cover the unordered configuration space

Statement

Let X be a Hausdorff space (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not), let n∈N and let q=(q1,…,qn)∈Fn(X) be an ordered configuration, with quotient map p:Fn(X)→Cn(X) onto the unordered configuration space (Unordered configuration spaces Cn(X)). Then there are pairwise disjoint open sets U1,…,Un⊆X with qi∈Ui for every label i, and for such a choice, with U:=(∏i=1nUi)∩Fn(X),V:=p(U)⊆Cn(X), the following hold:

  1. V is an open neighbourhood of the orbit [q] in Cn(X);
  2. p−1(V) is the disjoint union of the open sets σ(U), σ∈Sn, and for each σ the restriction p∣σ(U):σ(U)→V is a homeomorphism (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

Consequently V is evenly covered by p with exactly n! sheets (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings), namely the sets σ(U). For n=0 the space F0(X) is a point, S0 is the trivial group, C0(X) is a point, and p is the unique homeomorphism between these one-point spaces, so C0(X) is evenly covered at its only point with 0!=1 sheet; no hypothesis on X is used. Nothing here assumes that X is connected, locally compact or a manifold: only the Hausdorff separation of the finitely many points q1,…,qn enters.

Facts & Assumptions

Given: A Hausdorff space X, a natural number n, an ordered configuration q∈Fn(X) with quotient map p:Fn(X)→Cn(X).

[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 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}. If X is Hausdorff and q∈Fn(X), then for every label i there is an open neighbourhood Ui of qi with Ui∩Uj=∅ whenever i≠j (Ordered configuration spaces Fn(X)).

[L3]

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

[L4]

The formula (σ⋅x)i=xσ−1(i−1)+1 defines a continuous action of Sn on Fn(X) by homeomorphisms of Fn(X), with inverse action of σ−1 (The symmetric group acts continuously and freely on Fn(X) by permuting labels, Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

[L7]

A continuous bijection that is an open map is a homeomorphism, and a composite of homeomorphisms is a homeomorphism (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological, Continuity of a map of topological spaces at a point and globally).

[L8]

∣Sn∣=n! (The Lehmer code gives ∣Sn∣=n! again); a map is bijective when it is injective and surjective (Injection, surjection, bijection). A set V is evenly covered by p when p−1(V) is a disjoint union of open sets, called sheets, each mapped homeomorphically onto V by p, and V is then an evenly covered neighbourhood (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).

Proof

technique · direct
1.1

Disjoint coordinate neighbourhoods exist. Since X is Hausdorff and q∈Fn(X) has pairwise distinct coordinates, [F1] supplies, for every label i∈{1,…,n}, an open neighbourhood Ui of qi with Ui∩Uj=∅ for i≠j.

F1L2
1.2

The case n=0. By [L3], F0(X) and C0(X) are one-point spaces and p is their unique homeomorphism; its only fibre has 0!=1 element and the single point of C0(X) is evenly covered by the single sheet F0(X).

L3L7L8
1.3

The set U and its translates. With U:=(∏i=1nUi)∩Fn(X), the set ∏i=1nUi is open in Xn and U is open in Fn(X) by [L5]; moreover q∈U, because qi∈Ui for every i and q∈Fn(X). For σ∈Sn the translate σ(U)={σ⋅x:x∈U} is open in Fn(X), being the image of the open set U under the homeomorphism x↦σ⋅x of [L4].

L4L5F1
2.1

The translates are disjoint and cover the preimage of V. Suppose x∈σ(U)∩τ(U) for σ,τ∈Sn. Writing x=σ⋅u=τ⋅u′ with u,u′∈U, the coordinate formula of [F1] gives, for every label k, the element xk=uσ−1(k−1)+1=uτ−1(k−1)+1′ of Uσ−1(k−1)+1∩Uτ−1(k−1)+1; by step 1.1 the sets Ui are pairwise disjoint, so σ−1(k−1)+1=τ−1(k−1)+1 for every k, that is σ=τ. Hence the translates σ(U) are pairwise disjoint. A tuple x∈Fn(X) lies in p−1(p(U)) exactly when p(x)=p(u) for some u∈U, that is, by [L3], exactly when x=σ⋅u for some σ∈Sn and u∈U; therefore p−1(V)=⋃σ∈Snσ(U), and this union is disjoint.

step 1.1F1L3
3.1

V is an open neighbourhood of [q]. By step 2.1, p−1(V) is a finite union of open sets, hence open in Fn(X) by [L5], so V is open in Cn(X) by [L6]. It contains p(q)=[q] because q∈U by step 1.3.

step 1.3step 2.1L5L6
4.1

p∣U:U→V is a homeomorphism. The restriction is continuous, and it is injective: if p(u)=p(u′) for u,u′∈U, then u′∈U∩σ(U) for some σ by step 2.1, so u′=u by the disjointness proved there. It is surjective onto V=p(U) by definition. Finally it is open: for A⊆U open, p−1(p(A))=⋃σ∈Snσ(A) is a finite union of images of A under the homeomorphisms of [L4], hence open in Fn(X), so p(A) is open in Cn(X) by [L6] and therefore in V. By [L7], p∣U is a homeomorphism onto V.

step 2.1step 3.1L4L6L7
5.1

Every translate maps homeomorphically onto V. Let σ∈Sn and let hσ(x):=σ⋅x be the homeomorphism of Fn(X) given by [L4], which maps U onto σ(U). For y=σ⋅u∈σ(U) with u∈U one has p(y)=p(σ⋅u)=p(u), since orbits are permuted by σ; hence p∣σ(U)=p∣U∘(hσ∣U)−1 is a composite of homeomorphisms and therefore a homeomorphism onto V by [L7].

step 4.1L4L7
6.1

Conclusion. By steps 1.1, 1.3, 2.1 and 5.1, the open neighbourhood V of [q] has preimage p−1(V) equal to the disjoint union of the open sets σ(U), σ∈Sn, each of which is carried homeomorphically onto V by p; by [L8] and ∣Sn∣=n! these are exactly n! sheets, so V is evenly covered. The case n=0 is step 1.2.

step 1.1step 1.2step 1.3step 2.1step 5.1L8∎
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

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∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-sol)audited 2026-09-27Open item page →

The closed disk D2 is a connected Hausdorff topological 2-manifold with boundary

Statement

Let D2={z∈C:∣z∣≤1} carry the subspace topology of the metric topology of C (The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane) and let H2={(x,y)∈R2:y≥0} be the Euclidean upper half-space (Euclidean upper half-space and its boundary), identified with {z∈C:Im⁡z≥0} through x+iy↦(x,y) (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i). Then D2 is nonempty and connected, it is Hausdorff and second countable, and it is a topological 2-manifold with boundary (Topological manifolds with boundary): every point of D2 has a neighbourhood in D2 homeomorphic to a relatively open subset of H2. Concretely, for ∣z∣<1 the translation ψ(w):=w+2i maps the open neighbourhood D2∩B(z,12(1−∣z∣)) of z in D2 homeomorphically onto an open subset of R2 contained in the open upper half-plane; and for ∣q∣=1 the map φq(w):=i(q−w)q+w, defined on the open neighbourhood Vq:=D2∩{w∈C:∣w−q∣<1} of q in D2, is a homeomorphism of Vq onto an open subset of H2 containing 0, with inverse u↦q(i−u)/(i+u).

Facts & Assumptions

Given: The closed disk D2⊆C with the subspace topology, and the half-space H2⊆R2.

[F2]

Hausdorffness and second countability are hereditary properties, so every subspace of a Hausdorff, second countable space has both properties; a subspace carries the subspace topology (T0, T1, and Hausdorffness are hereditary, Second countability is hereditary, 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).

[F3]

Modulus is definite, multiplicative and subadditive: ∣zw∣=∣z∣∣w∣, ∣z+w∣≤∣z∣+∣w∣ and ∣z∣=0 only for z=0 (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive); complex addition, multiplication and the maps w↦w+c 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).

[F5]

For a metric space, balls B(z,r) and the metric topology are as in Open ball, closed ball and sphere in a metric space and 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; continuity of maps between metric spaces is the ε-δ condition of Continuity of a map between metric spaces, at a point and globally, in the ε-δ form. A homeomorphism is a continuous bijection with continuous inverse, and the restriction of a homeomorphism to an open subset is a homeomorphism onto its image (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

[F6]

A topological n-manifold with boundary is a Hausdorff, second countable space in which every point has a neighbourhood homeomorphic to a relatively open subset of Hn (Topological manifolds with boundary); under the identification C=R2 used in [F1], the half-space H2 corresponds to {z∈C:Im⁡z≥0}, because z=x+iy has coordinates (x,y) (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i, Euclidean upper half-space and its boundary).

Proof

technique · direct
1.1

The ambient plane and its subspaces. By [F1] the metric topology of C is the Euclidean topology of R2 under x+iy↦(x,y); R2 is Hausdorff and second countable with the countable basis of rational open boxes. Since D2⊆C carries the subspace topology, [F2] makes D2 Hausdorff and second countable.

F1F2
1.2

D2 is nonempty, convex and connected. Clearly 0∈D2. If z,w∈D2 and t∈[0,1], then ∣(1−t)z+tw∣≤(1−t)∣z∣+t∣w∣≤1 by multiplicativity and subadditivity of the modulus in [F3], so D2 is convex; it is a nonempty convex subset of R2 in the sense of [F4], hence contractible, hence path-connected, hence connected.

F3F4
1.3

Interior charts. Let z∈C with ∣z∣<1 and put r:=12(1−∣z∣)>0. If ∣w−z∣<r then ∣w∣≤∣z∣+∣w−z∣<∣z∣+r<1 by [F3], so B(z,r)⊆D2 and U:=D2∩B(z,r)=B(z,r) is an open neighbourhood of z in D2 that is open in C as well. The translation ψ(w):=w+2i is continuous with continuous inverse u↦u−2i by [F3], hence a homeomorphism of C; its restriction to U is therefore a homeomorphism of U onto the open set ψ(U)⊆R2, and for w∈U one has Im⁡w≥−∣w∣>−1 and hence Im⁡ψ(w)=Im⁡w+2>1>0, so ψ(U) lies in the open upper half-plane and is in particular a relatively open subset of H2 containing ψ(z).

F3F5F6
1.4

The two-sided inverse of the boundary formula. Let q∈C with ∣q∣=1, put φq(w):=i(q−w)/(q+w) for w≠−q, and put ψ(u):=q(i−u)/(i+u) for u≠−i. Both are defined on the sets where they are used below, because ∣q−(−q)∣=2>1 gives −q∉Vq and because ∣i+u∣≥Im⁡u+1≥1>0 whenever Im⁡u≥0. For u≠−i, i(q−ψ(u))q+ψ(u)=i(1−i−ui+u)1+i−ui+u=i (i+u)−(i−u)i+u(i+u)+(i−u)i+u=i⋅2u2i=u, so φq∘ψ=id⁡ on C∖{−i}, in particular on {Im⁡u≥0}, and for w≠−q, ψ(φq(w))=q(i−i(q−w)q+w)i+i(q−w)q+w=q i 2wq+wi 2qq+w=w, so ψ∘φq=id⁡ on C∖{−q}, which contains Vq. Hence φq and ψ are mutually inverse bijections between C∖{−q} and C∖{−i}, and in particular φq is injective on D2∖{−q}.

F3F6algebra
2.1

Which points of the plane are carried into the half-space. Let w∈D2∖{−q} and multiply numerator and denominator of φq(w) by qˉ+wˉ, which is the conjugate of q+w: using qqˉ=∣q∣2=1, wwˉ=∣w∣2 and s−sˉ=2iIm⁡s for s:=qwˉ gives φq(w)=i(q−w)(qˉ+wˉ)∣q+w∣2=i(∣q∣2+qwˉ−wqˉ−∣w∣2)∣q+w∣2=i(1−∣w∣2+2iIm⁡(qwˉ))∣q+w∣2, so Im⁡φq(w)=(1−∣w∣2)/∣q+w∣2, which is ≥0 exactly when ∣w∣≤1: thus φq maps D2∖{−q} into the closed upper half-plane {Im⁡u≥0}. Conversely, if Im⁡u≥0 then ∣ψ(u)∣2=∣i−u∣2∣i+u∣2=(Re⁡u)2+(1−Im⁡u)2(Re⁡u)2+(1+Im⁡u)2≤1, because the last inequality is equivalent to (1−Im⁡u)2≤(1+Im⁡u)2, that is to −2Im⁡u≤2Im⁡u. Hence ψ maps {Im⁡u≥0} into D2. Since φq∘ψ is the identity by step 1.4, φq is surjective onto {Im⁡u≥0} and ψ is injective; by step 1.4, φq is also injective. So φq:D2∖{−q}→{Im⁡u≥0} is a bijection with inverse ψ.

step 1.4F3F6algebra
3.1

φq and ψ are continuous, hence homeomorphisms. For w,w0∈D2∖{−q} expansion gives φq(w)−φq(w0)=i(q−w)(q+w0)−i(q−w0)(q+w)(q+w)(q+w0)=2iq(w0−w)(q+w)(q+w0), so by multiplicativity of the modulus and ∣i∣=∣q∣=1, ∣φq(w)−φq(w0)∣=2∣w−w0∣∣q+w∣ ∣q+w0∣. Let δ:=∣q+w0∣>0 and suppose ∣w−w0∣≤δ/2; then ∣q+w∣≥∣q+w0∣−∣w−w0∣≥δ/2 by subadditivity, so ∣φq(w)−φq(w0)∣≤4∣w−w0∣/δ2, which is <ε as soon as ∣w−w0∣<min⁡(δ/2,εδ2/4). This is the ε-δ condition of [F5] for continuity of φq at w0. The same expansion with i in place of q and u's in place of w's gives ∣ψ(u)−ψ(u0)∣=2∣u−u0∣/(∣i+u∣∣i+u0∣), and ∣i+u0∣≥1 for Im⁡u0≥0, so ψ is continuous on the closed upper half-plane as well. By step 2.1 and [F5], φq is a homeomorphism of D2∖{−q} onto {Im⁡u≥0}; consequently φq(Vq) is a relatively open subset of H2 by [F6], because Vq is open in D2 and hence in D2∖{−q}, and it contains φq(q)=0.

F3F5F6step 1.4step 2.1
4.1

Conclusion. Step 3.1 shows that for ∣q∣=1 the restriction of φq to the neighbourhood Vq of q in D2 is a homeomorphism onto a relatively open subset of H2 containing 0, and step 1.3 provides the corresponding chart at every point with ∣z∣<1. Step 1.2 shows D2 is nonempty and connected and step 1.1 shows it is Hausdorff and second countable, so every point of D2 has a neighbourhood homeomorphic to a relatively open subset of H2: by [F6], D2 is a topological 2-manifold with boundary, as claimed.

step 1.1step 1.2step 1.3step 3.1F5F6∎
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

The pure braid group PBn as the fundamental group of an ordered configuration space

Definition

Fix n∈N and a base configuration q=(q1,…,qn), an ordered n-tuple of pairwise distinct points of the open unit disc int⁡D2={z∈C:∣z∣<1}, so that q∈Fn(int⁡D2)⊆Fn(D2),D2={z∈C:∣z∣≤1} in the notation of The interior-disc and closed-disc configuration spaces are homotopy equivalent and Ordered configuration spaces Fn(X). The pure configuration braid group on n strands is the fundamental group (Based loops and the fundamental group)

PBn:=π1(Fn(D2),q),

the group of based-loop classes at q in the ordered configuration space of the closed disc, with the first-then-second loop product.

The open-disc model. The inclusion Fn(int⁡D2)→Fn(D2) induces an isomorphism π1(Fn(int⁡D2),q)⟶π1(Fn(D2),q) of fundamental groups at the same base configuration q (The homomorphism on fundamental groups induced by a pointed continuous map); this is claim 3 of The interior-disc and closed-disc configuration spaces are homotopy equivalent. The isomorphism is canonical — it is induced by the inclusion and involves no choice — so on this page and its consumers PBn may be computed from either the closed-disc or the open-disc ordered configuration space. The closed-disc model is the one that matches the geometrically drawn braids, and the open-disc model is the one to which the forgetful fibrations for boundaryless manifolds apply; both give the same group by the displayed isomorphism.

The basepoint. The configuration q is part of the data defining PBn, and all groups on this page use the same q. Different choices of base configuration give isomorphic groups: Fn(D2) is path-connected for every n (claim 2 of Ordered configuration spaces cover the unordered ones regularly with deck group Sn), and a path between base configurations conjugates loop classes and induces an isomorphism (Conjugating loop classes by a path is an isomorphism of fundamental groups). No particular such isomorphism is fixed here. For n=0 the space F0(D2) is a point, so PB0 is the one-element group; for n=1 single-coordinate evaluation gives F1(D2)≅D2 and PB1 is trivial.

Scope. This is the configuration-space definition of the pure braid group, stated before any comparison with geometric strands or with the Artin presentation: no presentation of PBn is asserted here. The description by geometric braids and the Artin presentation, and the configuration braid short exact sequence relating PBn to the unordered configuration braid group, belong to the later items on braids, which consume this definition.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-27Open item page →

The configuration braid group Bnconf as the fundamental group of an unordered configuration space

Definition

Fix n∈N and the same base configuration q=(q1,…,qn) of pairwise distinct points of int⁡D2 that is used in The pure braid group PBn as the fundamental group of an ordered configuration space, with D2 the closed unit disc. Write p:Fn(D2)→Cn(D2) for the quotient of the ordered by the unordered configuration space, so that p(q)=[q] is the orbit of q (Unordered configuration spaces Cn(X)). The configuration braid group on n strands is the fundamental group (Based loops and the fundamental group)

Bnconf:=π1(Cn(D2),[q]),

the group of based-loop classes at the orbit [q] in the unordered configuration space of the closed disc, with the first-then-second loop product.

The open-disc model. The inclusion-induced map ιC:Cn(int⁡D2)→Cn(D2) of The interior-disc and closed-disc configuration spaces are homotopy equivalent induces an isomorphism π1(Cn(int⁡D2),[q])⟶π1(Cn(D2),[q]) at the same basepoint (claim 3 of that lemma, The homomorphism on fundamental groups induced by a pointed continuous map), so Bnconf may be computed from either disc model exactly as PBn may. Both groups in this definition and in The pure braid group PBn as the fundamental group of an ordered configuration space are taken at the basepoints [q] and q coming from the same tuple q, which is what makes the comparison map of the configuration braid short exact sequence, proved in a later item on this page, a map of based fundamental groups.

The basepoint. Since Fn(D2)→Cn(D2) is surjective every basepoint of Cn(D2) is an orbit, and since Cn(D2) is path-connected (claim 2 of Ordered configuration spaces cover the unordered ones regularly with deck group Sn) the groups at different orbits are isomorphic by conjugation along a path (Conjugating loop classes by a path is an isomorphism of fundamental groups); no particular isomorphism is fixed. For n=0 the space C0(D2) is a point and B0conf is the one-element group.

The superscript. The decoration conf records that the group is defined here through configuration spaces, and it is retained until the later geometric identification of Bnconf with the braid group given by strand diagrams and with its Artin presentation. No such identification and no presentation is asserted on this page; neither is any identification of Bnconf with a group of self-homeomorphisms of the disc.

DefinitionDefinition: Literature-sourcedProof: Not applicableprecheck passaudited 2026-09-27Open item page →

Endpoint monodromy of an unordered configuration loop as a permutation of the labels

Definition

Fix n∈N and the base configuration q=(q1,…,qn) of pairwise distinct points of int⁡D2 used in The pure braid group PBn as the fundamental group of an ordered configuration space and The configuration braid group Bnconf as the fundamental group of an unordered configuration space, and let p:Fn(D2)⟶Cn(D2) be the quotient map, which is an n!-sheeted covering with deck group Sn acting by coordinate permutations (Ordered configuration spaces cover the unordered ones regularly with deck group Sn, Disjoint coordinate neighbourhoods evenly cover the unordered configuration space); the theorem applies to M=D2 because the closed disk is a nonempty connected Hausdorff topological 2-manifold with boundary (The closed disk D2 is a connected Hausdorff topological 2-manifold with boundary).

Now let α:I→Cn(D2) be a based loop at the orbit [q], that is α(0)=[q]=α(1) (Based loops and the fundamental group). By the path-lifting property of a covering (Existence and uniqueness of path lifts through a covering map) there is a unique path α~:I⟶Fn(D2),α~(0)=q,p∘α~=α. Its endpoint α~(1) lies in the fibre p−1([q]), which is exactly the orbit Sn⋅q={σ⋅q:σ∈Sn} (Unordered configuration spaces Cn(X)); since the action is free, there is a unique permutation σα∈Sn with α~(1)=σα⋅q. The endpoint monodromy of α is π([α]):=σα∈Sn.

The label form and the inverse. Equivalently, reading the endpoint tuple position by position, define eα∈Sn by α~(1)i=qeα(i)(1≤i≤n), so that the point standing at position i at the end of the lifted motion is the one that carried label eα(i) at the start. Comparing with the coordinate formula (σ⋅q)i=qσ−1(i−1)+1 of The symmetric group acts continuously and freely on Fn(X) by permuting labels gives eα=σα−1,equivalentlyπ([α])=eα−1. The naive endpoint record e is an antihomomorphism for the library's first-then-second loop product, eαβ=eβ∘eα, as verified in step 3.1 below; the inversion in the definition of π is exactly what turns it into the group homomorphism that the next results need.

Relation to the published monodromy action. For the right action e⋅[α] of the fundamental group on the fibre recorded in The monodromy right action on a covering fibre and its equivalent left-action convention one has q⋅[α]=α~(1)=σα⋅q=π([α])⋅q. Thus π([α]) is the unique permutation σ satisfying q⋅[α]=σ⋅q: the endpoint monodromy is the published covering monodromy, translated into the coordinate-permutation labels of Fn(D2). The corresponding left-action element of The monodromy right action on a covering fibre and its equivalent left-action convention is [α]⋅q=π([α])−1⋅q.

Scope and trivial cases. The map π is the homomorphism π:Bnconf=π1(Cn(D2),[q])⟶Sn whose image records the permutation of the labels effected by a loop; it is the last arrow of the configuration braid short exact sequence proved in The configuration braid short exact sequence 1→PBn→Bnconf→Sn→1. For n≤1 the group Sn is trivial, so π is the trivial homomorphism; the case n=0 concerns the one-point space C0(D2).

Facts & Assumptions

Given: A natural number n, the base configuration q∈Fn(int⁡D2), the covering p:Fn(D2)→Cn(D2), and a based loop α:I→Cn(D2) at [q].

[F1]

Points of Fn(X) are tuples (x1,…,xn) of pairwise distinct points, with F0(X) a one-point space and labels identified with n={0,…,n−1} by κ(i)=i−1 (Ordered configuration spaces Fn(X)).

[L2]

Cn(X)=Fn(X)/Sn with the quotient topology of p, which is a covering map here; two tuples have the same image exactly when they differ by a permutation of coordinates, and the fibre p−1([q]) is the orbit Sn⋅q (Unordered configuration spaces Cn(X), Ordered configuration spaces cover the unordered ones regularly with deck group Sn). The closed disk D2⊆C is nonempty, connected, Hausdorff and a topological 2-manifold with boundary, so that theorem applies with M=D2 and d=2≥2, and p:Fn(D2)→Cn(D2) is an n!-sheeted covering whose deck group Sn acts by coordinate permutations (The closed disk D2 is a connected Hausdorff topological 2-manifold with boundary).

[L3]

The action (σ⋅x)i=xσ−1(i−1)+1 is a continuous, free left action of Sn on Fn(X), so α~(1)=σ⋅q determines σ uniquely and the action law (στ)⋅x=σ⋅(τ⋅x) holds (The symmetric group acts continuously and freely on Fn(X) by permuting labels, Group and abelian group).

[L4]

For a covering p and a path α in the base there is a unique lift with a prescribed starting point, and the endpoints of lifts of path-homotopic paths with the same initial point coincide (Existence and uniqueness of path lifts through a covering map, The endpoint of a lifted path depends only on its endpoint-fixed homotopy class).

[L5]

The monodromy e⋅[α] is the endpoint of the unique lift of α beginning at e, and with the first-then-second product [α][β]=[α∗β] it is a right action, so e⋅([α][β])=(e⋅[α])⋅[β] (The monodromy right action on a covering fibre and its equivalent left-action convention, Based loops and the fundamental group).

[L6]

Loop classes at a point form a group under [α][β]=[α∗β] (Loop classes form the group π1(X,x0) under concatenation), and a homomorphism of groups is a map preserving products (Monoid homomorphism and group homomorphism).

Proof

technique · direct
1.1

The lift and its endpoint permutation. By [L4] the lift α~ with α~(0)=q exists and is unique. Its endpoint satisfies p(α~(1))=α(1)=[q], so α~(1)∈p−1([q])=Sn⋅q by [L2]; thus there is σα∈Sn with α~(1)=σα⋅q, and it is unique by freeness in [L3]. So eα and σα are related by α~(1)i=qσα−1(i−1)+1 by the coordinate formula of [L3], that is eα(i)=σα−1(i−1)+1, which is eα=σα−1 under the label identification of [F1].

F1L2L3L4
2.1

Independence of the representative. Let α′≃α rel endpoints be another based loop at [q]. A path homotopy rel endpoints from α to α′ lifts, by [L4], to a homotopy of paths from α~ to the lift of α′ starting at q, keeping the starting point fixed; in particular the two lifts have the same endpoint, so σα′=σα by uniqueness in step 1.1. Hence π([α]):=σα is well defined on classes.

step 1.1L4
2.2

The endpoint permutation is multiplicative. Let α,β be based loops at [q] and let α~,β~ be their lifts starting at q. The path s↦σα⋅β~(s) is a path in Fn(D2) starting at σα⋅q=α~(1) and covering β, because p(σα⋅x)=p(x) for every x by [L2]; by uniqueness of lifts in [L4] it is the lift of β beginning at α~(1). Therefore the concatenation s↦α~(2s) for s≤12 and s↦σα⋅β~(2s−1) for s≥12 is a path in Fn(D2) starting at q and covering α∗β — the two pieces agree at s=12 at the point α~(1) — so by uniqueness it is the lift of α∗β starting at q. Its endpoint is σα⋅β~(1)=σα⋅(σβ⋅q)=(σασβ)⋅q by the action law of [L3]. Hence σαβ=σασβ, that is π([α][β])=π([α])π([β]) by [L5] and [L6].

step 1.1L2L3L4L5L6
2.3

Relation to the published monodromy. By [L5] and step 1.1, q⋅[α] is the endpoint of the lift of α beginning at q, namely σα⋅q=π([α])⋅q; since the action is free by [L3], π([α]) is the unique σ with q⋅[α]=σ⋅q.

step 1.1L3L5
3.1

The label form is an antihomomorphism. For based loops α,β at [q], step 1.1 gives eαβ=σαβ−1 and eα=σα−1, eβ=σβ−1; by step 2.2 and the group law (σασβ)−1=σβ−1σα−1 of [L3], eαβ=σβ−1σα−1=eβ∘eα in the composition convention of Sn. Thus the endpoint record e reverses the order of the product, while π=e−1 does not.

step 1.1step 2.2L3
4.1

Conclusion. Steps 1.1, 2.1 and 2.2 show that π([α])=σα=eα−1 is a well-defined group homomorphism Bnconf→Sn, step 3.1 records that the label form e itself is an antihomomorphism, and step 2.3 identifies π with the published covering monodromy at the element q. For n≤1, Sn is trivial and π is trivially a homomorphism.

step 1.1step 2.1step 2.2step 3.1step 2.3L6∎
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

The configuration braid short exact sequence 1→PBn→Bnconf→Sn→1

Statement

Let n∈N, let q∈Fn(int⁡D2) be the base configuration used in The pure braid group PBn as the fundamental group of an ordered configuration space and The configuration braid group Bnconf as the fundamental group of an unordered configuration space (for n=0 this is the empty tuple, the unique point of F0(D2)), and let p:Fn(D2)→Cn(D2) be the quotient map of Unordered configuration spaces Cn(X). Write PBn=π1(Fn(D2),q),Bnconf=π1(Cn(D2),[q]) for the two configuration groups carried by the same q, and let π:Bnconf→Sn be the endpoint monodromy of Endpoint monodromy of an unordered configuration loop as a permutation of the labels: for a based loop α at [q] with lift α~ starting at q, π([α])=σα is the unique permutation with α~(1)=σα⋅q. Then the sequence of groups and homomorphisms 1⟶PBn⟶p∗Bnconf⟶πSn⟶1 is a short exact sequence in the sense of Group extensions, sections, complements, and split extensions: the left arrow is the unique homomorphism from the one-element group 1, the middle arrow p∗ is induced by p on fundamental groups, and p∗ is injective,π is surjective,im⁡p∗=ker⁡π.

This holds for every n≥0, including n=0 and n=1 where Sn is the trivial group. The two groups use the same base configuration q and the map p of Unordered configuration spaces Cn(X), so the middle arrow is a map between fundamental groups at q and at its orbit [q]; no splitting of the sequence is asserted, and neither PBn nor Bnconf is here identified with a presentation or with a group of strand diagrams.

Facts & Assumptions

Given: A natural number n, the base configuration q∈Fn(int⁡D2)⊆Fn(D2), the quotient map p:Fn(D2)→Cn(D2), the groups PBn and Bnconf at q and [q], and the endpoint monodromy π:Bnconf→Sn.

[F1]

PBn=π1(Fn(D2),q) and Bnconf=π1(Cn(D2),[q]), both with the first-then-second loop product, and the labels 1,…,n are identified with n={0,…,n−1} by κ(i)=i−1; F0(D2) and C0(D2) are one-point spaces, and single-coordinate evaluation and the orbit map give canonical homeomorphisms F1(D2)≅D2≅C1(D2) (The pure braid group PBn as the fundamental group of an ordered configuration space, The configuration braid group Bnconf as the fundamental group of an unordered configuration space, Ordered configuration spaces Fn(X), Unordered configuration spaces Cn(X), Based loops and the fundamental group).

[F2]

For a based loop α at [q] with lift α~ starting at q, one has α~(1)=σα⋅q for a unique σα∈Sn, and π([α])=σα defines a group homomorphism π:Bnconf→Sn (Endpoint monodromy of an unordered configuration loop as a permutation of the labels, Monoid homomorphism and group homomorphism).

[L3]

D2 is nonempty, connected, Hausdorff and a topological 2-manifold with boundary, so Ordered configuration spaces cover the unordered ones regularly with deck group Sn applies with M=D2 and d=2≥2: p is a covering map, Fn(D2) and Cn(D2) are path-connected, and every fibre of p has n! elements (The closed disk D2 is a connected Hausdorff topological 2-manifold with boundary, Unordered configuration spaces Cn(X)).

[L4]

For a covering and a path in the base, every point of the fibre over its initial point is the starting point of exactly one lift (Existence and uniqueness of path lifts through a covering map).

[L5]

The formula (σ⋅x)i=xσ−1(i−1)+1 defines a free continuous left action of Sn on Fn(X) by homeomorphisms, p(σ⋅x)=p(x) for x∈Fn(D2), and p−1([q])=Sn⋅q; in particular σ⋅q=q only for the identity σ (The symmetric group acts continuously and freely on Fn(X) by permuting labels, Unordered configuration spaces Cn(X)).

[L6]

p∗ is a well-defined group homomorphism π1(Fn(D2),q)→π1(Cn(D2),[q]) with p∗([γ])=[p∘γ], and it is injective because p is a covering map (The homomorphism on fundamental groups induced by a pointed continuous map, Induced fundamental-group maps are well defined, functorial and invariant under based homotopy, A covering map induces an injective homomorphism on fundamental groups).

[L7]

A diagram 1→N→G→H→1 of groups and homomorphisms is a short exact sequence when the first map is injective, the last is surjective and the image of the first equals the kernel of the last (Group extensions, sections, complements, and split extensions); the image of a group homomorphism is a subgroup of its target, and a homomorphism is surjective exactly when its image is the whole target (The kernel and image of a group homomorphism, The image of a group homomorphism is a subgroup and its kernel is a normal subgroup).

[L8]

For a set T⊆Sn the subgroup ⟨T⟩ is the smallest subgroup containing T, and Sn is generated by the adjacent transpositions sj, 1≤j<n; for n=0,1 the empty set generates the trivial group Sn (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, The adjacent transpositions (1 2),(2 3),…,(n−1 n) generate Sn, The symmetric group Sym⁡(X): the bijections of a set X under composition).

[L9]

Under the label identification of [F1], the adjacent transposition sj=(j j+1) exchanges the labels j and j+1 and fixes the others, so that sj⋅x is the tuple x with its j-th and (j+1)-st entries exchanged (The adjacent transpositions (1 2),(2 3),…,(n−1 n) generate Sn, The symmetric group acts continuously and freely on Fn(X) by permuting labels).

[L10]

Addition and multiplication of complex numbers and the affine maps z↦z+c and z↦λz are continuous, and ∣z+w∣≤∣z∣+∣w∣, ∣λz∣=∣λ∣ ∣z∣ (Vector addition and scalar multiplication are continuous in a normed space, The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane, Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[L11]

If X={x0} is a one-point space then every loop at x0 has the constant value x0, so π1(X,x0) has exactly one element, the class of the constant loop (Based loops and the fundamental group).

Proof

technique · direct
1.1

The quotient is a covering and p∗ is injective. By [L3] the map p:Fn(D2)→Cn(D2) is a covering map; by [L6] the induced map p∗:π1(Fn(D2),q)→π1(Cn(D2),[q]), p∗([γ])=[p∘γ], is a well-defined group homomorphism and is injective. Under [F1] this is a homomorphism p∗:PBn→Bnconf.

F1L3L6
1.2

The kernel of π lies in the image of p∗. Let [α]∈Bnconf with π([α])=e, and let α~ be the lift of α starting at q; by the definition of π in [F2] one has α~(1)=σα⋅q=π([α])⋅q=e⋅q=q. So α~ is a loop at q in Fn(D2), and [L6] gives p∗[α~]=[p∘α~]=[α]. Hence ker⁡π⊆im⁡p∗.

F2L4L6
1.3

A model configuration with explicit distances. Assume n≥2 and put qj′:=2j−n−12n for 1≤j≤n, and for 1≤i<n put ui:=qi′+qi+1′2=2i−n2n, w:=12n and η:=w2. Then qj+1′−qj′=1n and ∣qj′∣≤n−12n<1 for all j, so q′=(q1′,…,qn′)∈Fn(int⁡D2); moreover qi′=ui−w and qi+1′=ui+w, and ∣qj′−ui∣=∣2j−2i−1∣2n≥3w for every j∉{i,i+1}.

F1L10algebra
2.1

The first arrow is injective with image the kernel of p∗. The left arrow is the unique homomorphism 1→PBn from the one-element group; its image consists of the identity ePBn alone, so it is injective, and since p∗ is injective by step 1.1 its kernel is {ePBn}, which is exactly that image.

step 1.1L7
2.2

The image of p∗ lies in the kernel of π. Let [γ]∈PBn with γ:I→Fn(D2) a loop at q; then α:=p∘γ is a loop at [q], since p(γ(0))=[q]=p(γ(1)). The path γ satisfies p∘γ=α and γ(0)=q, so by [L4] it is the unique lift of α starting at q. By [F2] the endpoint of that lift is σα⋅q for the permutation π([α])=σα, that is σα⋅q=γ(1)=q; freeness of the action by [L5] gives σα=e, so π(p∗[γ])=π([α])=e. Hence im⁡p∗⊆ker⁡π.

step 1.1F2L4L5
2.3

A swap move at the model configuration. Assume n≥2 and fix i with 1≤i<n, keeping the notation of step 1.3. Define paths ai,bi:I→C by the two-part formulas ai(t)=ui−w(1−2t)+2tη i and bi(t)=ui+w(1−2t)−2tη i for 0≤t≤12, and ai(t)=ui+w(2t−1)+2(1−t)η i and bi(t)=ui−w(2t−1)−2(1−t)η i for 12≤t≤1, and let x(i)(t):=(x1(t),…,xn(t)) be the tuple with xi(t):=ai(t), xi+1(t):=bi(t) and xj(t):=qj′ for j∉{i,i+1}. The two parts of each formula agree at t=12, so ai and bi are continuous by [L10], and ai(0)=qi′, ai(1)=qi+1′, bi(0)=qi+1′, bi(1)=qi′.

step 1.3F1L10
3.1

Exactness at Bnconf. Steps 2.2 and 1.2 together give im⁡p∗=ker⁡π.

step 2.2step 1.2
3.2

The tuples x(i)(t) are collision-free. With the notation of step 2.3, one has Im⁡ai(t)=2tη≥0 for 0≤t≤12 and Im⁡ai(t)=2(1−t)η≥0 for 12≤t≤1, while Im⁡bi(t)=−2tη≤0 and Im⁡bi(t)=−2(1−t)η≤0 on the same intervals; equality holds only at t=0 and t=1, where ai(0)=qi′≠qi+1′=bi(0) and ai(1)=qi+1′≠qi′=bi(1) by step 1.3. Hence ai(t)≠bi(t) for every t. For j∉{i,i+1} one has ∣Re⁡ai(t)−ui∣≤w and Re⁡qj′−ui real with ∣Re⁡qj′−ui∣=∣qj′−ui∣≥3w by step 1.3, so ai(t)≠qj′, and the same argument gives bi(t)≠qj′; finally ∣ai(t)∣≤∣ui∣+w+η≤n−22n+12n+14n<1 and likewise for bi, while ∣qj′∣<1, so every coordinate lies in int⁡D2. Thus x(i)(t)∈Fn(int⁡D2) for every t.

step 1.3step 2.3L10algebra
4.1

A loop at [q] with monodromy si. Assume n≥2 and fix i. By step 3.2 the formula βi:=p∘x(i) defines a continuous loop in Cn(D2) at [q′], because x(i)(0)=q′ and x(i)(1)=si⋅q′ is the tuple q′ with its i-th and (i+1)-st entries exchanged by [L9], whence p(x(i)(1))=[si⋅q′]=[q′] by [L5]. By [L3] Fn(D2) is path-connected, so there is a path γ:I→Fn(D2) with γ(0)=q and γ(1)=q′; define αi:I→Cn(D2) by αi(t):=(p∘γ)(3t) for 0≤t≤13, αi(t):=βi(3t−1) for 13≤t≤23 and αi(t):=(p∘γ)(3−3t) for 23≤t≤1. Then αi is a loop at [q], and the path α~i given by α~i(t):=γ(3t), α~i(t):=x(i)(3t−1), α~i(t):=si⋅γ(3−3t) on the same three intervals is a lift of αi starting at q: it is continuous, takes values in Fn(D2) by [L5], and p(α~i(t))=αi(t) on each piece, since p(si⋅y)=p(y). By [L4] it is the lift of αi starting at q, so its endpoint is α~i(1)=si⋅γ(0)=si⋅q, and therefore π([αi])=si by [F2].

step 1.3step 3.2F2L3L4L5L9
5.1

The endpoint monodromy is surjective. Let n≥2 and let T:={s1,…,sn−1}⊆Sn. Step 4.1 exhibits for each sj∈T a class in Bnconf with π-image sj, so T⊆im⁡π, and im⁡π is a subgroup of Sn by [L7]; since ⟨T⟩ is the smallest subgroup containing T by [L8], it follows that Sn=⟨T⟩⊆im⁡π, so im⁡π=Sn and π is surjective by [L7]. For n=0,1 the group Sn is trivial by [L8], so π is surjective there as well, its image being a subgroup of a one-element group. Hence π is surjective for every n≥0.

step 4.1L7L8
6.1

Conclusion. Step 1.1 shows that p∗ is an injective homomorphism PBn→Bnconf, step 2.1 that the left arrow from the one-element group is injective with image ker⁡p∗, step 3.1 that im⁡p∗=ker⁡π, and step 5.1 that π is surjective. By the definition of a short exact sequence in [L7], the displayed sequence is short exact for every n≥0, including the one-point cases n=0, where F0(D2) and C0(D2) are one-point spaces so that PB0 and B0conf are one-element groups by [F1] and [L11].

step 1.1step 2.1step 3.1step 5.1F1L7L11∎
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Forgetting the last n points is locally trivial with fibre Fn of the punctured manifold

Statement

Let M be a Hausdorff topological d-manifold without boundary (Topological manifolds without boundary: Hausdorff, second-countable, and locally Euclidean spaces) with d≥2, let m,n≥1, and let π:Fm+n(M)⟶Fm(M),π(x1,…,xm+n):=(x1,…,xm) be the map forgetting the last n points of an ordered configuration (Ordered configuration spaces Fn(X)). Let q=(q1,…,qm)∈Fm(M) be a base configuration and put Q:={q1,…,qm}, with M∖Q carrying the subspace topology of M and Fn(M∖Q) the ordered configuration space of the punctured manifold (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).

Then there exist an open neighbourhood U⊆Fm(M) of q and a homeomorphism Φ:U×Fn(M∖Q)⟶π−1(U),π∘Φ=pr⁡1, of the product of U with the fibre Fn(M∖Q) onto the part of Fm+n(M) lying over U. The homeomorphism is of the point-moving form Φ(x,y)=(x1,…,xm,hx(y1),…,hx(yn)), where x↦hx is a family of homeomorphisms of M with hx(qj)=xj for 1≤j≤m and with (x,y)↦hx(y) and (x,y)↦hx−1(y) jointly continuous. In particular π is locally trivial at every base configuration, the fibre π−1(x) over x∈U is homeomorphic to Fn(M∖Q), and this chart has the single fibre Fn(M∖Q) over all of U.

Facts & Assumptions

Given: A Hausdorff topological d-manifold M without boundary with d≥2, integers m,n≥1, the projection π:Fm+n(M)→Fm(M), and a base configuration q=(q1,…,qm)∈Fm(M) with Q={q1,…,qm}.

[F1]

Points of Fk(X) are the tuples of pairwise distinct points of X, with the subspace topology of Xk, and Fk(X)⊆Xk; a base configuration is such a tuple (Ordered configuration spaces Fn(X), 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). For x∈Fm+n(M) the first m coordinates form a point of Fm(M), so π is well defined.

[L2]

Every point p of M has an open neighbourhood V and a homeomorphism ϕ:V→O onto an open subset O of Rd, and homeomorphisms are continuous bijections with continuous inverses (Topological manifolds without boundary: Hausdorff, second-countable, and locally Euclidean spaces, Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological, Continuity of a map of topological spaces at a point and globally).

[L4]

A map f:X→X of a nonempty complete metric space with d(f(u),f(v))≤c d(u,v) for all u,v and a constant c<1 (Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction) has exactly one fixed point (A contraction of a nonempty complete metric space into itself has exactly one fixed point, the limit of the iterates from any starting point).

[L7]

M is Hausdorff, so finitely many distinct points of M have pairwise disjoint open neighbourhoods, and a finite intersection of open sets is open; consequently M∖Q is open in M (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).

[L8]

Vector addition and scalar multiplication of Rd are continuous, so (u,z)↦z+cu is continuous for fixed scalars and z↦∥z∥ is continuous (Vector addition and scalar multiplication are continuous in a normed space, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms, Continuity of a map of topological spaces at a point and globally).

Proof

technique · direct
1.1

Chart data. By [L2] and [L7] there are charts ϕj:Vj→Oj with qj∈Vj, Oj⊆Rd open, ϕj(qj)=0, and the Vj pairwise disjoint (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not); m choices are made and no infinite selection occurs. Shrinking Vj if necessary to the inverse image of an open ball, we may suppose Bˉ(0,4ρj)⊆Oj for some ρj>0. Put Sj:=ϕj−1(B(0,2ρj))⊆Vj and Wj:=ϕj−1(B(0,ρj))⊆Sj, and finally U:={x∈Fm(M):xj∈Wj for all j}, which is Fm(M)∩(W1×⋯×Wm) and hence open in Fm(M) with q∈U.

F1L2L3L7
1.2

The bump function. Fix j and put b(z):=max⁡(0,1−∥z∥/(2ρj)) for z∈Rd. Then 0≤b≤1, b(0)=1, b(z)=0 for ∥z∥≥2ρj, b is continuous by [L5] and [L8], and b is Lipschitz with constant 1/(2ρj): for z,z′∈Rd one has ∣b(z)−b(z′)∣≤∣∥z∥−∥z′∥∣/(2ρj)≤∥z−z′∥/(2ρj) by [L3].

L3L5L8
2.1

The radial mover of the coordinate space. Fix j, let b be as in step 1.2 and let u∈Rd with ∥u∥≤ρj; put θu(z):=z+b(z)u. Then: θu is continuous with ∥θu(z)−z∥≤∥u∥ and θu(z)=z whenever ∥z∥≥2ρj; θu is injective, since ∥θu(z)−θu(z′)∥≥∥z−z′∥−∣b(z)−b(z′)∣ ∥u∥≥(1−∥u∥2ρj)∥z−z′∥≥12∥z−z′∥; and θu is surjective, because for w∈Rd the map T(y):=w−b(y)u satisfies ∥T(y)−T(y′)∥≤∥u∥2ρj∥y−y′∥≤12∥y−y′∥ and Rd is complete, so by [L4] it has a fixed point y=T(y), which says exactly θu(y)=w. Hence θu is a bijection of Rd fixing the complement of B(0,2ρj), and θu(0)=u.

step 1.2L3L4L5
3.1

The inverse family and its Lipschitz estimate. With the notation of step 2.1, let y:=θu−1(w) and y′:=θu′−1(w′) for ∥u∥,∥u′∥≤ρj. Since y=w−b(y)u and y′=w′−b(y′)u′, the triangle inequality and the Lipschitz bound of step 1.2 give ∥y−y′∥≤∥w−w′∥+∥u∥2ρj∥y−y′∥+∥u−u′∥≤∥w−w′∥+12∥y−y′∥+∥u−u′∥, hence ∥θu−1(w)−θu′−1(w′)∥≤2(∥u−u′∥+∥w−w′∥). In particular each θu−1 is continuous, so θu is a homeomorphism of Rd by step 2.1, and (u,w)↦θu−1(w) is continuous on {u:∥u∥≤ρj}×Rd. Moreover θu−1(w)=w−b(θu−1(w))u, so ∥θu−1(w)−w∥≤∥u∥≤ρj, and θu−1(w)=w whenever ∥w∥≥2ρj; consequently θu−1 maps B(0,3ρj) into B(0,4ρj)⊆Oj.

step 1.2step 2.1L3L8algebra
4.1

Point-moving homeomorphisms of M. Fix j and x∈U, and put uj:=ϕj(xj). Since θj,uj is a bijection fixing the complement of B(0,2ρj) pointwise, it carries that ball onto itself; its inverse has the same property. Set Kj:=ϕj−1(Bˉ(0,2ρj)). By [L9], Kj is compact and closed in M, and Kj⊂Vj. On the open cover Vj,M∖Kj define hj,x by ϕj−1θj,ujϕj on Vj and by the identity on M∖Kj. The chart formula is defined on all of Vj: it preserves the ball and fixes every point of Oj outside it. The two formulas agree on Vj∖Kj, where θj,uj is the identity, so [L5] gives continuity. Replacing θj,uj by its inverse gives a continuous map hj,x′ on the same cover. Both maps preserve Vj, their chart formulas are mutually inverse, and outside Vj both are the identity; hence they are inverse homeomorphisms of M. Moreover hj,x(qj)=xj, the map fixes M∖Sj pointwise, and it fixes qk for k≠j.

step 1.1step 2.1step 3.1L2L5L9
5.1

Joint continuity of the point-moving family. On U×Vj the formula (x,y)↦ϕj−1(θj,ϕj(xj)(ϕj(y))) is jointly continuous by the continuity of the chart, coordinate projections, and the vector operations in θj,u(z)=z+bj(z)u. On U×(M∖Kj) the formula is (x,y)↦y. These open sets cover U×M and the formulas agree on their overlap by step 4.1. Thus [L5] proves joint continuity of (x,y)↦hj,x(y). The inverse family is jointly continuous by the identical open-cover argument using the estimate of step 3.1.

step 4.1step 3.1F1L2L5L6L8
6.1

The family hx and its inverse. For x∈U put hx:=h1,x∘h2,x∘⋯∘hm,x and hx−1:=hm,x′∘⋯∘h2,x′∘h1,x′. Each factor is a homeomorphism of M supported in the pairwise disjoint open sets Vj, so the factors commute and the two displayed composites are inverse to each other; hence hx is a homeomorphism of M for every x∈U. Moreover hx(qj)=xj for every j, because every factor with index k≠j fixes qj∈Vj⊆M∖Vk by step 4.1. By step 5.1 and [L5] the maps (x,y)↦hx(y) and (x,y)↦hx−1(y) are continuous on U×M. Since hx carries the finite set Q bijectively onto {x1,…,xm}, it restricts to a bijection M∖Q→M∖{x1,…,xm}, and hence induces a bijection Fn(M∖Q)→Fn(M∖{x1,…,xm}) by acting on coordinates.

step 4.1step 5.1F1L5
7.1

The trivialization is well defined. Define Φ(x,y):=(x1,…,xm,hx(y1),…,hx(yn)) for x∈U and y∈Fn(M∖Q). The m+n displayed points are pairwise distinct: the xj are pairwise distinct and so are the hx(yk) by step 6.1, while hx(yk)≠xj=hx(qj) because yk≠qj for y∈Fn(M∖Q). Hence Φ takes values in Fm+n(M), and π(Φ(x,y))=x by construction, so Φ maps U×Fn(M∖Q) into π−1(U)⊆Fm+n(M) and π∘Φ=pr⁡1 holds there.

step 6.1F1
7.2

Φ is continuous. The first m components of Φ are the projections of x, which are continuous by [L6]; the k-th forgotten coordinate is (x,y)↦hx(yk), the composite of the continuous map (x,y)↦(x,yk) with the jointly continuous map (x,y)↦hx(y) of step 6.1; the domain is the subspace U×Fn(M∖Q)⊆U×Mn, and restrictions of continuous maps are continuous. Hence Φ is continuous as a map into the subspace Fm+n(M) of Mm+n by [L6].

step 6.1F1L6
8.1

The inverse trivialization. For (x,z)∈π−1(U), that is x∈U and z∈Fn(M∖{x1,…,xm}), put Ψ(x,z):=(x,hx−1(z1),…,hx−1(zn)), where the first component is the base point x and the second the n-tuple of inverse images. Since hx−1 is injective and zk≠xj=hx(qj) for all k,j, the points hx−1(zk) are pairwise distinct and all outside Q, so Ψ takes values in U×Fn(M∖Q); it is continuous by step 6.1 and [L6] exactly as in step 7.2, and Ψ(Φ(x,y))=(x,y), Φ(Ψ(x,z))=(x,z) because hx−1 inverts hx.

step 6.1step 7.1step 7.2L6
9.1

Conclusion. By steps 7.1, 7.2 and 8.1 the map Φ:U×Fn(M∖Q)→π−1(U) is a continuous bijection with continuous inverse, hence a homeomorphism, and π∘Φ=pr⁡1; restricting Φ to {x}×Fn(M∖Q) exhibits the fibre π−1(x) over any x∈U as homeomorphic to Fn(M∖Q). This is precisely a local trivialization of π at the base configuration q with fibre Fn(M∖Q), and since q was arbitrary the map is locally trivial at every base configuration. The construction used only finitely many choices of charts and radii, so no choice principle is used.

step 7.1step 7.2step 8.1step 6.1L5∎
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-27Open item page →

The Fadell-Neuwirth forgetful map: local triviality, constant fibre, and numerability for configurations in the disk

Statement

Let M be a nonempty connected Hausdorff topological d-manifold without boundary (Topological manifolds without boundary: Hausdorff, second-countable, and locally Euclidean spaces) with d≥2, let m,n≥1, and let π:Fm+n(M)⟶Fm(M),π(x1,…,xm+n):=(x1,…,xm) forget the last n points (Ordered configuration spaces Fn(X)). Write Qq′:={q1′,…,qm′} for the underlying set of a configuration q′∈Fm(M). Then:

  1. Local triviality, with the fibre of the configuration. For every base configuration q′ there are an open neighbourhood U⊆Fm(M) of q′ and a homeomorphism U×Fn(M∖Qq′)→π−1(U) over U, and the fibre π−1(q′) is homeomorphic to Fn(M∖Qq′) (Forgetting the last n points is locally trivial with fibre Fn of the punctured manifold).
  2. The fibre type is constant. For all q′,q′′∈Fm(M) the spaces Fn(M∖Qq′) and Fn(M∖Qq′′) are homeomorphic; this uses the connectedness of Fm(M) and no choice principle.
  3. Fixed fibre and numerability for configurations in the disk. Fix q∈Fm(M) and F:=Fn(M∖Qq). Assume the Axiom of Choice. Then there are an open cover of Fm(M) and trivializations of π over its members with the single fibre F, so that π is a locally trivial fibre bundle with fibre F in the sense of Locally trivial fiber bundle; the Axiom of Choice is used here to select, for each base point, a trivialization carrying the fibre Fn(M∖Qq′) of part 1 onto the fixed F. If moreover M=int⁡D2, so that the base is a metric space, then under AC and the Axiom of Dependent Choice the displayed locally trivial bundle is numerable and, by the published numerable-bundle theorem, is a Hurewicz fibration (Hurewicz and serre fibrations).

No global metric, paracompactness, or second countability of M beyond its manifold structure is used in parts 1 and 2, and the only choice principles used anywhere are the ones declared in part 3.

Facts & Assumptions

Given: A nonempty connected Hausdorff topological d-manifold M without boundary with d≥2, integers m,n≥1, the forgetful map π:Fm+n(M)→Fm(M), and configurations q,q′,q′′∈Fm(M).

[F1]

For a topological space X, Fk(X) is the space of k-tuples of pairwise distinct points of X with the subspace topology of Xk, so that Fm(M)⊆Mm carries the subspace topology (Ordered configuration spaces Fn(X), 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); the projection π drops the last n coordinates. It is well defined on Fm+n(M), and for x∈Fm(M) its fibre is π−1(x)={x}×Fn(M∖{x1,…,xm}), since the last n coordinates of a point of Fm+n(M) must be distinct from each other and from x1,…,xm.

[L2]

Local triviality. For every base configuration q′∈Fm(M) there are an open neighbourhood U⊆Fm(M) of q′ and a homeomorphism Φ:U×Fn(M∖Qq′)→π−1(U) with π∘Φ=pr⁡1; the restriction of Φ to {x}×Fn(M∖Qq′) is a homeomorphism onto π−1(x) for each x∈U, and no choice principle is used (Forgetting the last n points is locally trivial with fibre Fn of the punctured manifold, Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological, 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).

[L3]

M connected, nonempty, of dimension d≥2, implies Fm(M) path-connected, hence connected (Ordered configuration spaces cover the unordered ones regularly with deck group Sn, Every path-connected space is connected, and every path component lies inside a component, Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets). A subset of a connected space that is nonempty, open and closed is the whole space, since otherwise it and its complement would be a separation; and the complement of a closed set is open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L4]

A locally trivial fibre bundle with fibre F is a continuous map p:E→B together with an open cover (Ui) of B and homeomorphisms p−1(Ui)→Ui×F over Ui; it is numerable when there is additionally a locally finite partition of unity (ρi) with closed support contained in Ui (Locally trivial fiber bundle, Locally finite partitions of unity and subordination to an open cover). A Hurewicz fibration has the homotopy lifting property for all spaces (Hurewicz and serre fibrations).

[L6]

Under AC and DC, every open cover of a metric space admits a locally finite partition of unity subordinate to it (Under choice and dependent choice, metric open covers admit locally finite subordinate partitions of unity); and under AC every numerable fibre bundle with its charts and support-subordinate partition is a Hurewicz fibration (Numerable fiber bundles are hurewicz fibrations). AC is the statement that every family of nonempty sets has a choice function, and DC is the dependent choice principle (The Axiom of Choice, The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[L7]

The closed and open unit discs are related by an explicit radial homotopy equivalence, and int⁡D2={z∈C:∣z∣<1}, so the interior disc is a boundaryless surface (The interior-disc and closed-disc configuration spaces are homotopy equivalent, Topological manifolds without boundary: Hausdorff, second-countable, and locally Euclidean spaces).

Proof

technique · direct
1.1

Part 1 is the local-triviality lemma. Fix a base configuration q′. By [L2] there are an open neighbourhood U of q′ and a homeomorphism Φ:U×Fn(M∖Qq′)→π−1(U) over U; for x∈U the restriction of Φ maps {x}×Fn(M∖Qq′) homeomorphically onto π−1(x). Hence π is locally trivial at q′ with that fibre, which is claim 1 of the statement for this q′; as q′ was arbitrary, claim 1 holds.

F1L2
1.2

The set of configurations with fibre homeomorphic to a fixed one is open and closed. Fix q∈Fm(M), put F:=Fn(M∖Qq) and S:={q′∈Fm(M):Fn(M∖Qq′) is homeomorphic to F}. Let q′∈Fm(M) and let U be a neighbourhood of q′ as in [L2]; for every x∈U the fibre π−1(x) is homeomorphic to Fn(M∖Qq′) by [L2] and also, by applying [L2] at the configuration x, homeomorphic to Fn(M∖Qx); so Fn(M∖Qx) is homeomorphic to Fn(M∖Qq′) for every x∈U. Consequently q′∈S implies U⊆S, and q′∉S implies U∩S=∅; that is, S and its complement are open in Fm(M).

F1L2
1.3

The disk base is a metric space. Suppose M=int⁡D2. By [L7] this is a boundaryless surface, and Fm(int⁡D2) is a subspace of (int⁡D2)m, hence of Cm with the product topology; by [L5] the max-metric on Cm induces that product topology and its restriction to the subspace Fm(int⁡D2) is a metric inducing the subspace topology. So in the disk case the base of π is a metric space.

F1L5L7
2.1

Claim 2. The configuration q lies in S, so S≠∅. By step 1.2 the set S⊆Fm(M) is open and closed, and by [L3] the space Fm(M) is connected; a nonempty open and closed subset of a connected space is the whole space by [L3], so S=Fm(M). Hence Fn(M∖Qq′)≅Fn(M∖Qq′′) for all q′,q′′, which is claim 2; no choice was used, since the argument only used the local trivializing neighbourhoods and connectedness.

step 1.2L3
3.1

Fixed fibre and the numerable data, under AC. Assume AC, fix q∈Fm(M) and put F:=Fn(M∖Qq). For every base point q′, step 2.1 provides a homeomorphism αq′:F→Fn(M∖Qq′), and [L2] provides a trivialization Φq′:Uq′×Fn(M∖Qq′)→π−1(Uq′) over an open neighbourhood Uq′ of q′; composing with id⁡Uq′×αq′ gives trivializations of π over the open cover {Uq′}q′∈Fm(M), all with the single fibre F. The family of these trivializations has nonempty value set at each index q′, so AC supplies a choice of one for every q′; with that choice and the open cover {Uq′}, the map π is a locally trivial fibre bundle with fibre F in the sense of [L4]. This is the only use of AC in the general case.

step 2.1L2L4L6
4.1

The configuration bundle in the disk is numerable, hence a Hurewicz fibration. Assume AC and DC and M=int⁡D2. By step 1.3 the base is a metric space, so by [L6] the open cover of step 3.1 admits a locally finite partition of unity (ρq′) with closed support contained in Uq′. Together with the trivializations of step 3.1 this is numerating data for π in the sense of [L4], so the bundle is numerable; by the numerable-bundle theorem of [L6], which assumes AC, it is a Hurewicz fibration. DC was used only through the partition-of-unity corollary.

step 1.3step 3.1L4L6
5.1

Conclusion. Step 1.1 proves claim 1, step 2.1 proves claim 2, and steps 3.1 and 4.1 prove claim 3, including the numerable and Hurewicz conclusions for M=int⁡D2 under AC and DC. No structure on M beyond the boundaryless manifold structure and no choice principle beyond those declared was used.

step 1.1step 2.1step 3.1step 4.1∎

5 · Examples, counterexamples and false statements

None yet.

Sources