Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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.

R/Q carries the indiscrete topology, although R is metrizable and the quotient has more than one point

Statement refuted

Refuted: that a quotient of a metrizable space must be Hausdorff. Here the quotient of R collapses to the indiscrete topology and, because it has more than one point, is not Hausdorff (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).

Witness. Give R its usual topology (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), identify Q with its canonical copy in R (The rationals as equivalence classes of pairs of integers), and set

x∼y:⟺x−y∈Q,

an equivalence relation. Let R:=R/Q carry the quotient topology with canonical projection q (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 the only open subsets of R are ∅ and R: the topology of R is the indiscrete one (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Moreover R has more than one point, since R has an irrational number (The irrationals are uncountable), so this is not the degenerate one-point case.

Facts & Assumptions

Given: R with its usual topology; the relation ∼; the quotient R=R/Q with projection q; and a nonempty open V⊆R.

[A1]

q is a surjection, V⊆R is open exactly when q−1[V] is open in R, and q−1[V] is saturated: x∈q−1[V] and y−x∈Q imply y∈q−1[V] (The quotient topology of a surjection, quotient maps, saturated sets, and the quotient of a space by an equivalence relation with its canonical projection).

[L2]

Strictly between any two reals lies a rational (The rationals embed densely in the reals); equivalently Q is dense in R and meets every nonempty open subset (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

[L3]

The set of irrationals is uncountable, hence nonempty (The irrationals are uncountable, The rationals as equivalence classes of pairs of integers).

Counterexample

technique · direct
1.1

Let V⊆R be open and nonempty, and put G:=q−1[V], which is open in R by [A1] and nonempty, q being surjective.

A1
2.1

By [L1] there are a<b with (a,b)⊆G.

step 1.1L1
3.1

Let y∈R be arbitrary. By [L2] there is a rational t with a−y<t<b−y, so y+t∈(a,b).

step 2.1L2
4.1

By step 2.1 and step 3.1 the point y+t lies in G, and (y+t)−y=t∈Q, so y∈G by the saturation clause of [A1]. As y was arbitrary, G=R and hence V=q[G]=R, q being surjective.

step 2.1step 3.1A1
5.1

So the only open subsets of R are ∅ and R, which is the indiscrete topology by [A2].

step 4.1A2
6.1

By [L3] there is an irrational α, and α−0=α∉Q, so q(α)≠q(0) and R has at least two points; with step 5.1 the quotient of the metrizable space R is a space with more than one point carrying the indiscrete topology, which is not Hausdorff, no two distinct points having disjoint open neighbourhoods.

step 5.1A2L3∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

69 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