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.
The ordered-to-unordered two-point quotient is not one-to-one
Statement refuted
Let be the ordered configuration space of two points of the plane and let
be the quotient map onto the unordered configuration space (Unordered configuration spaces , Ordered configuration spaces ). Refuted claim: the natural quotient map is injective, hence a homeomorphism onto (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological). It is not injective: for distinct points of the two ordered configurations and are distinct points of with the same image under , because they lie in one -orbit. The claim refuted concerns the natural quotient map only: it is not asserted, and it does not follow, that and are never abstractly homeomorphic by some other map, and the example makes no statement about that question.
Facts & Assumptions
Given: The ordered configuration space with , the unordered configuration space with its quotient map , and the nonidentity transposition of the coordinate permutation action.
with the subspace topology, so and both lie in ; two tuples in are equal exactly when they agree in every coordinate, so because in the field (Ordered configuration spaces , The product set 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, is a field, every element is uniquely , and every nonzero element has inverse , Field).
The formula defines a continuous free left action of on ; the nonidentity permutation with , acts by (The symmetric group acts continuously and freely on by permuting labels, The finite symmetric group , one-line notation, and cycle notation).
is the set of orbits with the quotient topology of ; is a quotient map, hence continuous and surjective, and exactly when and lie in the same orbit (Unordered configuration spaces , Ordered configuration spaces ).
A function is injective when implies , and a homeomorphism is by definition a continuous bijection with continuous inverse; in particular a homeomorphism is injective, so a map that is not injective is not a bijection and not a homeomorphism (Injection, surjection, bijection, Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).
Refutation
Two distinct ordered configurations. The tuples and lie in , since ; they are distinct, because they differ in the first coordinate and coordinates determine an element of the product ; explicitly .
One orbit. By [F2] the transposition acts by , so and lie in the same -orbit ; note , so this is the whole orbit of .
Equal images, unequal points. By step 1.2 the two points lie in one orbit, so by [F3] their images agree: ; but by step 1.1. Hence is not injective, in the sense of [F4].
The map is not a homeomorphism, and the scope of the refutation. A homeomorphism of with domain would be a bijection and hence injective by [F4]; since is not injective by step 2.1, the natural quotient map is not a homeomorphism. This refutes only the identification of the quotient map with a homeomorphism; the abstract question whether some other continuous bijection with continuous inverse exists between and is untouched by this witness, and no assertion about it is made here.
Depends on
- Unordered configuration spaces $C_n(X)$
- Ordered configuration spaces $F_n(X)$
- The symmetric group acts continuously and freely on $F_n(X)$ by permuting labels
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- The product set $\prod_{i \in I} X_i$ 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
- $\mathbb C=\mathbb R[x]/(x^2+1)$ is a field, every element is uniquely $a+bi$, and every nonzero element has inverse $(a-bi)/(a^2+b^2)$
- Field
- Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological
- Injection, surjection, bijection
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
37 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 González-Meneses, Basic results on braid groups, §§1.1–1.3 and 2.1, printed pp. 3–6, 11–13 (standard reference, not scraped)