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
Definition
Let and let be a topological space (Ordered configuration spaces , Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). The label permutation action
is a continuous free left action (The symmetric group acts continuously and freely on by permuting labels). Its set of orbits (The orbit and stabilizer of a point in a group action) is the unordered configuration space of points in , written
and it carries the quotient topology of the canonical projection
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 is open exactly when is open in . This projection is a quotient map, hence continuous and surjective, and points of are written .
Basepoint. For a base configuration in the sense of Ordered configuration spaces , the basepoint of is the orbit
and is nonempty exactly when 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. is the quotient of the one-point space by the trivial group , hence is a one-point space. Since is trivial, is a bijective quotient map and hence a homeomorphism: for every open , the equality makes open by the quotient topology. Thus is canonically homeomorphic to by , using the single-coordinate homeomorphism . These are canonical identifications, not literal equalities of the orbit set with the original set.
Elements are -element subsets, as a set. Because the coordinates of a configuration are pairwise distinct, two ordered configurations lie in the same orbit exactly when their underlying sets of coordinates agree: if then the coordinates of are those of in a different order, and conversely, if , then for every label there is exactly one label with , and is a bijection of (Injection, surjection, bijection); composing with the identification of labels with , the permutation takes to : . Hence
is a bijection of sets, the inverse sending an -element subset to the orbit of any enumeration of (The cardinality of a finite set). This identifies the elements of with -element subsets of ; the topology on 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
- Ordered configuration spaces $F_n(X)$
- The symmetric group acts continuously and freely on $F_n(X)$ by permuting labels
- The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection
- The orbit $G\cdot x$ and stabilizer $G_x$ of a point in a group action
- The cardinality $\lvert A\rvert$ of a finite set
- Injection, surjection, bijection
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
Used by
- The ordered-to-unordered two-point quotient is not one-to-one Counterexample
- Endpoint monodromy of an unordered configuration loop as a permutation of the labels Definition
- The configuration braid group Bₙᶜᵒⁿᶠ as the fundamental group of an unordered configuration space Definition
- The two-point unordered cover of the plane and the monodromy of a half turn Example
- Disjoint coordinate neighbourhoods evenly cover the unordered configuration space Lemma
- The interior-disc and closed-disc configuration spaces are homotopy equivalent Lemma
- Ordered configuration spaces cover the unordered ones regularly with deck group Sₙ Theorem
- The configuration braid short exact sequence 1→ PBₙ→ Bₙᶜᵒⁿᶠ→ Sₙ→ 1 Theorem
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
- Juan Gonzalez-Meneses, Basic results on braid groups, sections 1.1 and 1.3, printed pp. 3-6 (standard reference, not scraped)
- Fadell-Neuwirth, Configuration Spaces, section II Theorem 1, printed pp. 111-114 (standard reference, not scraped)