Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-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 antidiagonal {(x,−x)} is an uncountable discrete subspace of the Sorgenfrey plane, so having a countable dense subset is not a hereditary property

Statement refuted

Refuted: that the property "has a countable dense subset" is hereditary (Hereditary, open-hereditary and closed-hereditary properties of topological spaces, Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

Witness. In the Sorgenfrey plane S×S (The Sorgenfrey plane: the product of two half-open-interval lines has the rectangles [a,b)×[c,d) as a basis and Q×Q as a countable dense subset), which has the countable dense subset Q×Q, take the antidiagonal

L  :=  { (x,−x):x∈R }

with the subspace topology (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). Then:

  1. L is discrete: for every x, the basic rectangle [x, x+1)×[−x, −x+1) meets L exactly in {(x,−x)}, so every singleton of L is open in L and the subspace topology is the discrete one (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
  2. L is uncountable (Finite, countably infinite, countable, uncountable), being in bijection with R (R is uncountable (Cantor's nested intervals, 1874)).
  3. The only dense subset of L is L itself, since in a discrete space every subset is closed. So L has no countable dense subset, although the space it sits inside has one.

The word separable is not used: it is not defined at this point in the reading order, and the three claims above say in full what it would abbreviate.

Facts & Assumptions

Given: The Sorgenfrey plane S×S with the rectangles [a,b)×[c,d) as a basis, the antidiagonal L with the subspace topology, and a subset D⊆L.

[A1]

The rectangles [a,b)×[c,d) with a<b and c<d form a basis for S×S, and Q×Q is a countable dense subset of it (The Sorgenfrey plane: the product of two half-open-interval lines has the rectangles [a,b)×[c,d) as a basis and Q×Q as a countable dense subset).

[A2]

The open sets of L are the traces B∩L with B open in S×S, and a basis of them is the family of traces of basic open sets (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).

[L1]
[L3]

R is uncountable: there is no surjection N→R (R is uncountable (Cantor's nested intervals, 1874), Finite, countably infinite, countable, uncountable). A nonempty at most countable set admits a surjection from N (A nonempty set is at most countable iff it is a surjective image of N), and a composite of surjections is a surjection (Injection, surjection, bijection).

Counterexample

technique · direct
1.1

For x∈R put Bx:=[x, x+1)×[−x, −x+1), a basic open set of S×S containing (x,−x), by [A1] and [L1].

A1L1
1.2

The map φ:R→L, φ(x):=(x,−x), is a surjection, every point of L being of that form.

given
2.1

Bx∩L={(x,−x)}: a point of L is (t,−t), and it lies in Bx exactly when x≤t<x+1 and −x≤−t<−x+1; the second pair of inequalities says x−1<t≤x, and together with x≤t this forces t=x.

step 1.1L1
2.2

L is uncountable: if L were at most countable then, being nonempty, it would admit a surjection N→L by [L3]; composing that with the surjection L→R, (x,−x)↦x, would give a surjection N→R, contradicting [L3]. This is claim 2.

step 1.2L3
3.1

By steps 1.1 and 2.1 with [A2], every singleton {(x,−x)} is open in L; hence every subset of L is a union of singletons and so is open, and the subspace topology on L is the discrete one. This is claim 1.

step 1.1step 2.1A2A3
4.1

By step 3.1 and [A3] every subset of L is closed in L, so D‾=D for every D⊆L, and D is dense in L exactly when D=L by [L2]. With step 2.2 the only dense subset of L is uncountable, so L has no countable dense subset. This is claim 3.

step 3.1step 2.2A3L2
5.1

By [A1] the space S×S has a countable dense subset and by step 4.1 its subspace L has none, so the property "has a countable dense subset" is not hereditary, which refutes the claim.

step 4.1A1∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

53 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