Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-27
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Used by

Dependency tree · two levels

29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources