Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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.

FALSE: a totally disconnected space carries the discrete topology

Statement

Facts & Assumptions

Given: R with its usual topology and the subspace Q=QR⊆R.

[A2]

The subspace topology is transitive: for E⊆Q⊆R the topology E inherits from Q is the one it inherits from R (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).

[A3]

Both Q and R∖Q are dense in R: every nonempty open interval of R contains a rational and an irrational (Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable, ℚ is dense in every Archimedean ordered field).

[A6]

The component of a point is the largest connected subset containing it, and a space is totally disconnected when every component is a singleton, equivalently when every connected subset has at most one point (Connected components, quasicomponents, and totally disconnected spaces).

Refutation

technique · contradiction
1.1

Suppose, for contradiction, that the claim holds: every totally disconnected space carries the discrete topology.

assume-contra
1.2

Let E⊆Q be connected as a subspace of Q. By [A2] the space E is the same whether E is regarded as a subspace of Q or of R, so E is a connected subset of R and hence order-convex by [A1].

A1A2
1.3

The singleton {q} is not open in Q for any q∈Q: an open set of Q containing q is a trace U∩Q with U open in R, so it contains (q−r,q+r)∩Q for some r>0 by [A4], and that set contains a rational other than q, since (q,q+r) is a nonempty open interval and meets Q by [A3].

A3A4
2.1

E has at most one point: if p,q∈E with p<q then order-convexity from step 1.2 puts every real of [p,q] in E⊆Q, whereas (p,q) contains an irrational by [A3]. So every connected subset of Q has at most one point, and Q is totally disconnected by [A6].

step 1.2A3A6
3.1

Applying the supposed claim of step 1.1 to Q makes its topology discrete, so every singleton {q} is open in Q by [A5].

step 1.1step 2.1A5
4.1

This contradicts step 1.3. So the claim is false.

step 1.3step 3.1discharge-contradiction∎

Remarks

  • What separates the two notions. Total disconnectedness forbids large connected pieces; discreteness demands that each point be isolated. In Q every point is a limit of other points, so nothing is isolated, and yet no two points can be joined inside Q by an order-convex set, because the irrationals block every interval. Both facts hold simultaneously, and step 1.3 and step 2.1 are exactly the two of them.

  • The witness is not exotic. No construction is needed: Q with its usual topology is the standard example, and the only inputs are the density of the rationals and of the irrationals ([A3]) together with the classification of the connected subsets of the line ([A1]).

  • A second, non-countable witness exists. The set of irrationals, and the Cantor set, are totally disconnected and not discrete for the same reason. The Cantor set case is already recorded elsewhere in the library as The Cantor set contains no interval of positive length yet has no isolated point, so every connected subset of it is a single point, which proves that every connected subset of it is a single point while no point of it is isolated.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

75 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