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.

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.

Depends on

Used by

Dependency tree · two levels

24 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