Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Ordered and Unordered Configuration Spaces — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Two ordered points in the plane: centre and difference coordinates

Example

Let F2(C)={(z1,z2)∈C2:z1≠z2} be the ordered configuration space of two points of the plane, carrying the subspace topology of C2 (Ordered configuration spaces Fn(X)), and write C×:=C∖{0} for the punctured plane with the subspace topology of C. Then

Φ:F2(C)⟶C×C×,Φ(z1,z2):=(z1+z22, z2−z1),

is a homeomorphism (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological), with inverse

Ψ:C×C×⟶F2(C),Ψ(c,w):=(c−w2, c+w2).

Consequently F2(C)≅C×C×. The first coordinate of Φ is the midpoint, or centre, of the two points and the second is their oriented difference; the difference coordinate vanishes exactly when the two points collide, so C×C× is precisely what the collision-free condition cuts out of C×C.

Facts & Assumptions

Given: The ordered configuration space F2(C) of the plane with the subspace topology of C2=C×C, the punctured plane C×=C∖{0} with the subspace topology of C, and the maps Φ and Ψ of the statement.

[F1]

F2(C)={(z1,z2)∈C2:z1≠z2} is a subspace of the product C2, and a subset of F2(C) is open exactly when it is the trace of an open subset of C2; a map g:Z→F2(C) from a space Z is continuous if and only if its composite with the inclusion into C2 is continuous; restrictions of continuous maps to subspaces are continuous (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, 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).

[F2]

C is a field containing the embedded copy of R, every complex number has a unique form a+bi with a,b∈R, addition and multiplication obey the coordinate formulas, and every nonzero complex number a+bi has the inverse (a−bi)/(a2+b2); the field laws therefore hold, 2:=1+1≠0 has the inverse 12, and from z2−z1=0 one gets z2=z1 (C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2), The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i).

[L3]

The modulus satisfies ∣z∣≥0, ∣z∣=0⇔z=0, ∣zw∣=∣z∣ ∣w∣ and ∣z+w∣≤∣z∣+∣w∣ for all z,w∈C, so ∣αz1+βz2∣≤∣α∣ ∣z1∣+∣β∣ ∣z2∣ for all scalars α,β (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive, Real and imaginary parts, complex conjugation, and modulus).

[L4]

The topology of C is the metric topology of dC(z,w)=∣z−w∣, the open balls B(z,r)={w:dC(z,w)<r} form a basis of it, and a subset of C is open exactly when every point of it has a ball around it inside the set (The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane, Open ball, closed ball and sphere in a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). The boxes U×V with U,V open are a basis of the product topology on C2, and for the finite index set {0,1} the box topology and the product topology coincide (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).

Verification

technique · direct
1.1

Φ is well defined. Let (z1,z2)∈F2(C), so z1≠z2. If z2−z1=0 then adding z1 gives z2=z1 by [F2], a contradiction; hence z2−z1≠0 and Φ(z1,z2)∈C×C×.

F1F2
1.2

Ψ is well defined. Let (c,w)∈C×C×, so w≠0. The two coordinates of Ψ(c,w) differ by (c+w2)−(c−w2)=w≠0, hence are distinct, and Ψ(c,w)∈F2(C).

F1F2
1.3

Linear combinations on the plane are continuous. Let α,β∈C and consider L:C2→C, L(z1,z2):=αz1+βz2. Let x=(x1,x2)∈C2 and ε>0, and put δ:=ε/(1+∣α∣+∣β∣)>0, a positive real. If ∣zk−xk∣<δ for k=1,2, that is, if z lies in the basic open box B(x1,δ)×B(x2,δ) of [L4], then by [L3] ∣L(z)−L(x)∣≤∣α∣ ∣z1−x1∣+∣β∣ ∣z2−x2∣<(∣α∣+∣β∣) δ≤ε, with strict inequality ∣L(z)−L(x)∣<ε in every case: if ∣α∣+∣β∣=0 then L(z)−L(x)=0<ε, and otherwise (∣α∣+∣β∣)δ=ε (∣α∣+∣β∣)/(1+∣α∣+∣β∣)<ε. Hence the preimage of the ball B(L(x),ε) contains the box B(x1,δ)×B(x2,δ) around x, and since balls form a basis of the topology of C and boxes a basis of the topology of C2 [L4], L is continuous by [L5].

L3L4L5algebra
2.1

Φ and Ψ are mutually inverse, so Φ is a bijection. Let (z1,z2)∈F2(C) and put c:=z1+z22, w:=z2−z1. By the field laws of [F2] and 2⋅12=1, c−w2=z1+z2−(z2−z1)2=2z12=z1,c+w2=z1+z2+(z2−z1)2=2z22=z2, so Ψ(Φ(z1,z2))=(z1,z2). Conversely, for (c,w)∈C×C× the first coordinate of Φ(Ψ(c,w)) is (c−w2)+(c+w2)2=c and the second is (c+w2)−(c−w2)=w, so Φ(Ψ(c,w))=(c,w). Thus Φ has the two-sided inverse Ψ and is a bijection.

F2step 1.1step 1.2
2.2

Φ is continuous. The two components of Φ are the restrictions to the subspace F2(C)⊆C2 of the continuous maps L12,12(z1,z2)=z1+z22 and L−1,1(z1,z2)=z2−z1 of step 1.3, hence are continuous by [F1]. The second of them takes all its values in the subspace C×⊆C by step 1.1, so it is a continuous map F2(C)→C× by the subspace criterion of [F1]; therefore Φ, whose target is the product C×C×, is continuous by the product criterion of [L5].

F1L5step 1.1step 1.3
2.3

Ψ is continuous. The target F2(C) is a subspace of C2, so by the subspace criterion of [F1] it suffices to show that the composite H:C×C×→C2, H(c,w)=(c−w2,c+w2), is continuous. By the product criterion of [L5] it suffices that the two components L1,−12(c,w)=c−w2 and L1,12(c,w)=c+w2 be continuous as maps into C. The domain C×C× is a subspace of C2: by [L4] its basic open sets are the boxes U×(V∩C×) with U,V open in C, and these are exactly the traces (U×V)∩(C×C×) of the boxes U×V on C2, so the two topologies coincide. Hence continuity of the components follows from the continuity of L1,∓12 on C2 in step 1.3 together with the restriction clause of [F1].

F1L4L5step 1.3
3.1

Conclusion. By step 2.1 and step 1.2 the map Φ is a bijection F2(C)→C×C× with inverse Ψ; by steps 2.2 and 2.3 both Φ and Ψ are continuous. Hence Φ is a homeomorphism and F2(C)≅C×C×, as claimed. No choice principle was used.

step 2.1step 2.2step 2.3F1∎
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-09-27Open item page →

The two-point unordered cover of the plane and the monodromy of a half turn

Example

Fix an ordered configuration q∈F2(C) and let (c0,w0):=Φ(q)=(q1+q22, q2−q1) be its centre and difference coordinates, so that w0∈C×=C∖{0} (Two ordered points in the plane: centre and difference coordinates). Let S2 act on F2(C) by coordinate permutation (The symmetric group acts continuously and freely on Fn(X) by permuting labels), let τ∈S2 be the nonidentity permutation (The finite symmetric group Sn, one-line notation, and cycle notation), let p:F2(C)→C2(C) be the quotient map onto the unordered configuration space with [q]=p(q) (Unordered configuration spaces Cn(X)), and put Q:={{w,−w}:w∈C×},ρ:C×→Q,ρ(w):={w,−w}, with Q carrying the quotient topology of the surjection ρ and the notation Q=C×/{±1} (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection). Then:

  1. The transposition in centre and difference coordinates. Writing c,w for the two components of Φ, one has Φ(τ⋅x)=(c(x),−w(x)) for every x∈F2(C): the coordinate permutation swaps the two points, leaves the centre fixed and replaces the difference by its negative.
  2. The unordered space of two points. The map Φˉ:C2(C)⟶C×Q,Φˉ([x]):=(c(x),ρ(w(x))), is a well-defined continuous bijection whose inverse Ψˉ:C×Q⟶C2(C),Ψˉ(c,ρ(w)):=[Ψ(c,w)], is also continuous; hence C2(C)≅C×(C×/{±1}) (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).
  3. Nontrivial endpoint monodromy of the half turn. On the unit interval I=[0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length) let γ:I→C× be the polygonal half turn γ(t):={(1−2t)+2t i,0≤t≤12,−(2t−1)+(2−2t)i,12≤t≤1, which runs from 1 through the quarter turn i to −1 and never vanishes, and let α:I⟶C2(C),α(t):=Ψˉ(c0,ρ(w0 γ(t)))=[Ψ(c0, w0 γ(t))], which is a based loop at [q] because ρ(w0)=ρ(−w0). Then t↦Ψ(c0,w0γ(t)) is the unique lift of α through p starting at q, and its endpoint is Ψ(c0,−w0)=τ⋅q; equivalently the monodromy element q⋅[α] of the covering is τ⋅q and the unique permutation σα∈S2 defined here by q⋅[α]=σα⋅q is the transposition τ. So the half turn of the difference coordinate has nontrivial endpoint monodromy, and in particular the covering p:F2(C)→C2(C) is not trivial.

Facts & Assumptions

Given: A base configuration q∈F2(C) with coordinates (c0,w0)=Φ(q), the transposition τ∈S2, the quotient map p:F2(C)→C2(C), the set Q={{w,−w}:w∈C×} with the quotient topology of ρ(w)={w,−w}, and the maps Φ,Ψ of Two ordered points in the plane: centre and difference coordinates.

[F1]

Φ:F2(C)→C×C×, Φ(z1,z2)=((z1+z2)/2, z2−z1) is a homeomorphism with inverse Ψ(c,w)=(c−w2, c+w2); its components x↦c(x) and x↦w(x) are continuous, and w(x)≠0 for every x∈F2(C) (Two ordered points in the plane: centre and difference coordinates).

[F2]

The formula (σ⋅x)i=xσ−1(i−1)+1 defines a continuous free left action of S2 on F2(C), and S2={id⁡,τ} with τ(0)=1, τ(1)=0 and τ−1=τ (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 the canonical projection p, p(x)=S2⋅x=[x]; p is a quotient map, hence continuous and surjective, its fibres are the orbits, the fibre over [q] is exactly {id⁡⋅q,τ⋅q}, and the basepoint is [q] (Unordered configuration spaces Cn(X), 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 symmetric group acts continuously and freely on Fn(X) by permuting labels).

[F4]

Quotient topology: for a surjection ρ:C×→Q, a subset V⊆Q is open exactly when ρ−1(V) is open in C×; a subset A⊆C× is saturated when A=ρ−1[ρ[A]], and then ρ[A] is open as soon as A is; a map k out of Q into a space is continuous if and only if k∘ρ is continuous (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection, Characteristic properties: a map into a space with the initial topology is continuous iff every composite with the defining family is, a map out of a space with the final topology is continuous iff every composite with the defining family is, and the two topologies are respectively the coarsest and the finest making that family continuous).

[F6]

The modulus satisfies ∣z∣≥0, ∣z∣=0⇔z=0, ∣zw∣=∣z∣ ∣w∣ and ∣z+w∣≤∣z∣+∣w∣, and for u=a+bi with real a,b one has uu‾=a2+b2; the real numbers 2, −1, 12 are complex numbers by the embedding, 2⋅12=1, and a sum of two squares of real numbers vanishes only when both vanish (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive, Real and imaginary parts, complex conjugation, and modulus, C=R[x]/(x2+1) is a field, every element is uniquely a+bi, and every nonzero element has inverse (a−bi)/(a2+b2)).

[F7]

Continuity criteria and assembly: a map into a product is continuous if and only if its components are; a map is continuous as soon as its restrictions to the two closed halves of a finite closed cover are; restrictions of continuous maps to subspaces are continuous, and for a subset S⊆C the inclusion S↪C of the subspace is the restriction of the identity and hence continuous; boxes of open sets form a basis of the product topology, and balls form a basis of the topology of C, so a map is continuous when preimages of the members of a basis of its target are open (A map into a product is continuous iff each of its components is; the projections are continuous and open; and each projection is surjective when every factor is nonempty, which for an infinite index set uses the Axiom of Choice, Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous, 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, 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, Continuity of a map of topological spaces at a point and globally, For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A‾)⊆f(A)‾, Open ball, closed ball and sphere in a metric space, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).

[F8]

C is a metric space with dC(z,w)=∣z−w∣, hence a Hausdorff space (The Euclidean metric, convergence, Cauchy sequences, and continuity on the complex plane, Distinct points of a metric space have disjoint balls around them); for the Hausdorff space X=C and n=2, Disjoint coordinate neighbourhoods evenly cover the unordered configuration space gives that the quotient map p is evenly covered at every point of C2(C) with 2!=2 sheets, and since p is a continuous surjection, p is a covering map (Covering maps, evenly covered neighbourhoods, fibres, sheets, and trivial coverings).

[F9]

For a covering and a path in the base, every point of the fibre over its initial point is the starting point of exactly one lift; the endpoint of the unique lift of a based loop beginning at a point e of the fibre defines the monodromy element e⋅[α] (Existence and uniqueness of path lifts through a covering map, The monodromy right action on a covering fibre and its equivalent left-action convention).

Verification

technique · direct
1.1

The transposition acts by (c,w)↦(c,−w). Let x=(x1,x2)∈F2(C). By [F2] one has (τ⋅x)1=xτ−1(0)+1=x2 and (τ⋅x)2=xτ−1(1)+1=x1, so τ⋅x=(x2,x1). Hence c(τ⋅x)=x2+x12=x1+x22=c(x),w(τ⋅x)=x1−x2=−(x2−x1)=−w(x), using the field laws of [F5]. This is claim 1.

F1F2F5
1.2

Φˉ is continuous. The composite Φˉ∘p:F2(C)→C×Q has components p1(x)=c(x) and p2(x)=ρ(w(x)): the first is continuous by [F1], and the second is the composite of the continuous w of [F1] with the quotient map ρ, which is continuous by [F4]. Hence Φˉ∘p is continuous by the product criterion [F7], and therefore Φˉ is continuous by the characteristic property of the quotient map p [F3] (equivalently, [F4] applied to the final topology of p).

F1F3F4F7
1.3

The half turn γ is a continuous path in C× from 1 to −1. On the closed interval [0,12] the map γ(t)=(1−2t)+2t i is built from the continuous inclusion t↦t of [0,12] into C (the restriction of the identity, [F7]) by the continuous operations of multiplication by the constants ∓2 and i and of addition, so it is continuous by [F5] and [F7]; the same holds on [12,1] for γ(t)=−(2t−1)+(2−2t)i. At t=12 both formulas give i, and [0,12]∪[12,1]=I is a finite closed cover, so γ is continuous by [F7]. For 0≤t≤12 one has γ(t)=u(t) with u(t)=(1−2t)+2t i, whose real and imaginary parts are 1−2t and 2t, so u(t)u(t)‾=(1−2t)2+(2t)2 by [F6]; this is a sum of two squares of real numbers vanishing only if 1−2t=0 and 2t=0 simultaneously, which is impossible, so γ(t)≠0. For 12≤t≤1 the same computation with the real and imaginary parts −(2t−1) and 2−2t gives ∣γ(t)∣2=(2t−1)2+(2−2t)2≠0. Finally γ(0)=1 and γ(1)=−1.

F5F6F7
2.1

Φˉ and Ψˉ are well defined and mutually inverse. If x and τ⋅x are representatives of the same orbit, then by step 1.1 their coordinates are (c(x),w(x)) and (c(x),−w(x)), and ρ(−w(x))={w(x),−w(x)}=ρ(w(x)); since p is the orbit map [F3], Φˉ is well defined. Likewise, if w′=±w then by step 1.1 and [F1] Ψ(c,−w)=τ⋅Ψ(c,w), so Ψ(c,w) and Ψ(c,w′) lie in the same orbit and Ψˉ is well defined. Moreover Ψˉ(Φˉ([x]))=[Ψ(c(x),w(x))]=[x] and Φˉ(Ψˉ(c,ρ(w)))=Φˉ([Ψ(c,w)])=(c,ρ(w)) by [F1] and the definition of Φˉ. So Φˉ is a bijection with inverse Ψˉ.

step 1.1F1F3F4
3.1

Ψˉ is continuous. The quotient map ρ is open: for an open O⊆C×, its saturation ρ−1(ρ(O))=O∪(−O) is open, since multiplication by −1 is a homeomorphism by [F5]; hence ρ(O) is open by [F4]. It follows that Q0:=id⁡C×ρ:C×C×→C×Q is an open continuous surjection: on each basic open box it has the open image U×ρ(O), and every open set is a union of such boxes by [F7]. An open continuous surjection is a quotient map. The continuous map p∘Ψ:C×C×→C2(C) is constant on the fibres of Q0 by step 2.1. Therefore it factors continuously through Q0 by the quotient characteristic property [F4], and its factor is exactly Ψˉ.

step 2.1F1F3F4F5F7
4.1

Claim 2. Steps 1.2, 2.1 and 3.1 exhibit Φˉ as a continuous bijection with continuous inverse Ψˉ, that is, a homeomorphism; hence C2(C)≅C×(C×/{±1}).

step 2.1step 1.2step 3.1
4.2

α is a based loop at [q] and α~ is a lift. The map t↦w0γ(t) is continuous as a product of continuous complex-valued maps [F5, F7] and takes values in C×: ∣w0γ(t)∣=∣w0∣ ∣γ(t)∣≠0 by [F6] and step 1.3. Hence t↦(c0,ρ(w0γ(t))) is continuous into C×Q by the product criterion [F7], and composing with the continuous Ψˉ of step 3.1 gives that α is continuous. Since ρ(w0)={w0,−w0}=ρ(−w0), one has α(0)=Ψˉ(c0,ρ(w0))=Ψˉ(c0,ρ(−w0))=α(1), and α(0)=Φˉ−1((c0,ρ(w0)))=[q] because Φˉ([q])=(c0,ρ(w0)) by [F1] and step 2.1. So α is a based loop at [q]. The path α~(t):=Ψ(c0,w0γ(t)) is continuous into F2(C) by [F1], starts at Ψ(c0,w0)=q, and satisfies p∘α~=α because p(Ψ(c,w))=Ψˉ(c,ρ(w)) for all w∈C× by the definition of Ψˉ in step 2.1.

step 2.1step 3.1step 1.3F1F5F6F7
5.1

The endpoint of the lift is τ⋅q, so the monodromy is nontrivial. By [F8] p is a covering map, so [F9] gives a unique lift of the path α starting at q; by step 4.2 the path α~ is such a lift, hence it is that unique lift. Its endpoint is α~(1)=Ψ(c0,w0γ(1))=Ψ(c0,−w0) by step 1.3, and by [F1] Ψ(c0,−w0)=(c0+w02, c0−w02),q=Ψ(c0,w0)=(c0−w02, c0+w02), so α~(1)=(q2,q1)=τ⋅q by step 1.1; equivalently q⋅[α]=τ⋅q in the sense of [F9], and the permutation σα with α~(1)=σα⋅q is τ. Since the action is free and τ≠id⁡, one has τ⋅q≠q by [F2], so the monodromy is nontrivial: the half turn of the difference coordinate does not lift to a loop in F2(C). The deck transformation τ carries the lift starting at q to the lift starting at τ⋅q and carries its endpoint τ⋅q to q. Thus the monodromy transposes both points of the fibre and fixes neither. A trivial two-sheeted covering has identity monodromy around every loop, so this covering is not trivial.

step 1.1step 1.3step 4.2F1F2F8F9
6.1

Conclusion. Claim 1 is step 1.1, claim 2 is step 4.1, and claim 3 is steps 1.3, 4.2 and 5.1: the transposition acts on centre and difference coordinates by (c,w)↦(c,−w), the unordered space of two points is homeomorphic to C×(C×/{±1}) through Φˉ, and the half turn of the difference coordinate is a based loop at [q] with nontrivial endpoint monodromy τ. No choice principle was used.

step 1.1step 4.1step 5.1∎
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-09-27Open item page →

Collisions destroy freeness of the coordinate permutation action

Statement refuted

The following over-generalisation is false. Let n≥2, let X be a nonempty topological space, and let Sn act on the full product Xn=∏k<nX (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) by the coordinate permutation formula

(σ⋅x)i:=xσ−1(i−1)+1(1≤i≤n),

the formula by which Sn acts on the collision-free subspace Fn(X)⊆Xn (The symmetric group acts continuously and freely on Fn(X) by permuting labels). Refuted claim: this action on Xn is free (A free group action has no nonidentity element fixing a point). It is not: for n≥2 and every nonempty X some nonidentity permutation fixes a tuple whose coordinates are not pairwise distinct, whereas the restricted action on Fn(X) is free precisely because collisions have been removed. No claim is made here about the boundary cases n≤1, where Sn is trivial and the action is free for trivial reasons.

Facts & Assumptions

Given: A natural number n≥2, a nonempty topological space X, the product Xn with the product topology, and an element x∈X.

[F1]

For n∈N the product Xn=∏k<nX has as its points the functions n→X, displayed as tuples (x1,…,xn) where the label i names the coordinate of index i−1; the collision-free subspace is Fn(X)={(x1,…,xn)∈Xn:xi≠xj for i≠j}, and for Xn no distinctness is required (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, Ordered configuration spaces Fn(X)).

[F2]

Sn=Sym⁡(n) is a group under composition with (στ)(k)=σ(τ(k)) for k∈n and (στ)−1=τ−1σ−1, and the formula (σ⋅x)i=xσ−1(i−1)+1 defines a continuous free left action of Sn on Fn(X); in particular σ⋅x=x for x∈Fn(X) forces σ=id⁡ (Sym⁡(X) is a group under composition, and it is non-abelian whenever X has at least three distinct elements, The finite symmetric group Sn, one-line notation, and cycle notation, Left group actions, transitive actions, and faithful actions, A free group action has no nonidentity element fixing a point, The symmetric group acts continuously and freely on Fn(X) by permuting labels).

[F3]

For n≥2 the symmetric group Sn contains nonidentity elements: the transposition τ defined by τ(0)=1, τ(1)=0 and τ(k)=k for k∈n∖{0,1} satisfies τ≠id⁡, and cycle notation records it as (0 1) (The finite symmetric group Sn, one-line notation, and cycle notation, Sym⁡(X) is a group under composition, and it is non-abelian whenever X has at least three distinct elements).

[F4]

A left action is free when g⋅x=x implies g=e; a single tuple with a nonidentity stabiliser therefore refutes freeness (A free group action has no nonidentity element fixing a point, Left group actions, transitive actions, and faithful actions). Nonemptiness of X means exactly that some element x∈X exists, and exhibiting one element requires no choice principle.

[F5]

Two elements of a product are equal exactly when they agree in every coordinate; the constant tuple (x,…,x)∈Xn has all its coordinates equal to 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).

Refutation

technique · direct
1.1

The formula defines a left action on the whole product. For σ∈Sn and y∈Xn the tuple σ⋅y with (σ⋅y)i=yσ−1(i−1)+1 is well defined in Xn, because σ−1(i−1)+1 is a label for every i by [F2]; and the formal verification of id⁡⋅y=y and (στ)⋅y=σ⋅(τ⋅y) for σ,τ∈Sn is the reindexing computation of [F2], which never uses the distinctness of coordinates, so it applies to all of Xn. Hence [F3] and [F4] apply to this action.

F1F2
1.2

The collision witness. Fix an element x∈X, which exists by [F4], and put a:=(x,x,…,x)∈Xn, the tuple with ai=x for every label i; its coordinates collide, and a∉Fn(X) when n≥2 because a1=a2. So a is a point of Xn to which the freeness conclusion of [F2] does not apply.

F1F4F5
2.1

The transposition fixes a. By step 1.1 the tuple τ⋅a∈Xn is defined, and for every label i one has (τ⋅a)i=aτ−1(i−1)+1=x=ai, because all coordinates of a equal x; hence τ⋅a=a by [F5].

step 1.1F2F5
3.1

Freeness fails. The transposition τ is not the identity by [F3], yet it fixes the point a of Xn by step 2.1. Therefore the action of Sn on Xn is not free, in the sense of the definition in [F4].

step 2.1F3F4
4.1

Conclusion. The claim stated in the refuted statement is false for every n≥2 and every nonempty X, with the explicit witness a=(x,…,x) fixed by the transposition τ=(0 1). The contrast with [F2] is exactly the removal of the collision diagonals: freeness of the coordinate permutation action is a property of Fn(X), not of the full product Xn.

step 1.2step 3.1F2∎
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-09-27Open item page →

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∎

Sources