Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passaudited 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.

The ordered-to-unordered two-point quotient is not one-to-one

Statement refuted

Let F2(C) be the ordered configuration space of two points of the plane and let

p:F2(C)⟶C2(C)=F2(C)/S2,p(x):=S2⋅x=[x],

be the quotient map onto the unordered configuration space (Unordered configuration spaces Cn(X), Ordered configuration spaces Fn(X)). Refuted claim: the natural quotient map p is injective, hence a homeomorphism onto C2(C) (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological). It is not injective: for distinct points z1≠z2 of C the two ordered configurations (z1,z2) and (z2,z1) are distinct points of F2(C) with the same image under p, because they lie in one S2-orbit. The claim refuted concerns the natural quotient map only: it is not asserted, and it does not follow, that F2(C) and C2(C) are never abstractly homeomorphic by some other map, and the example makes no statement about that question.

Facts & Assumptions

Given: The ordered configuration space F2(C) with (0,1),(1,0)∈F2(C), the unordered configuration space C2(C) with its quotient map p, and the nonidentity transposition τ∈S2 of the coordinate permutation action.

[F1]

F2(C)={(z1,z2)∈C2:z1≠z2} with the subspace topology, so (0,1) and (1,0) both lie in F2(C); two tuples in C2 are equal exactly when they agree in every coordinate, so (0,1)≠(1,0) because 0≠1 in the field C (Ordered configuration spaces Fn(X), 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, C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2), Field).

[F2]

The formula (σ⋅x)i=xσ−1(i−1)+1 defines a continuous free left action of S2 on F2(C); the nonidentity permutation τ with τ(0)=1, τ(1)=0 acts by τ⋅(z1,z2)=(z2,z1) (The symmetric group acts continuously and freely on Fn(X) by permuting labels, The finite symmetric group Sn, one-line notation, and cycle notation).

[F3]

C2(C)=F2(C)/S2={S2⋅x:x∈F2(C)} is the set of orbits with the quotient topology of p(x)=S2⋅x=[x]; p is a quotient map, hence continuous and surjective, and p(x)=p(y) exactly when x and y lie in the same orbit S2⋅x=S2⋅y (Unordered configuration spaces Cn(X), Ordered configuration spaces Fn(X)).

[F4]

A function is injective when f(x)=f(y) implies x=y, 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

technique · direct
1.1

Two distinct ordered configurations. The tuples x:=(0,1) and y:=(1,0) lie in F2(C), since 0≠1; they are distinct, because they differ in the first coordinate and coordinates determine an element of the product C2; explicitly x1=0≠1=y1.

F1
1.2

One orbit. By [F2] the transposition acts by τ⋅x=τ⋅(0,1)=(1,0)=y, so x and y lie in the same S2-orbit S2⋅x; note S2={id⁡,τ}, so this is the whole orbit of x.

F2
2.1

Equal images, unequal points. By step 1.2 the two points x,y lie in one orbit, so by [F3] their images agree: p(x)=p(y); but x≠y by step 1.1. Hence p is not injective, in the sense of [F4].

step 1.1step 1.2F3F4
3.1

The map is not a homeomorphism, and the scope of the refutation. A homeomorphism of C2(C) with domain F2(C) would be a bijection and hence injective by [F4]; since p is not injective by step 2.1, the natural quotient map p 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 F2(C) and C2(C) is untouched by this witness, and no assertion about it is made here.

step 2.1F4∎

Depends on

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