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

Refuted: separability is hereditary

Statement

Separability is hereditary.

Facts & Assumptions

Given: The lower-limit plane P and its antidiagonal A={(x,−x):x∈R}.

[L1]

Products of at most countable sets are at most countable (A product of two at most countable sets is at most countable).

[L2]

The rational numbers are at most countable and dense in the real line, and the real line is uncountable (Q is countably infinite, The rationals embed densely in the reals, R is uncountable (Cantor's nested intervals, 1874)).

[L3]

Separability is the existence of an at most countable dense subset, and a property is hereditary when every subspace has it (Separability: the existence of an at most countable dense subset, Hereditary, open-hereditary and closed-hereditary properties of topological spaces).

Refutation

technique · direct
1.1

The half-open intervals cover R, and if two contain x, then [x,c) lies in their intersection for some c>x; hence [F1] makes them a basis. The rational grid Q×Q is at most countable by [L1] and [L2], and density of Q makes it meet every nonempty basic lower-limit rectangle, so it is dense in P.

L1L2L3F1
1.2

For each x∈R, the basic rectangle [x,x+1)×[−x,−x+1) meets A only in (x,−x); hence A is discrete in its subspace topology.

given
2.1

The map x↦(x,−x) is a bijection from the uncountable set R onto A, so a dense subset of the discrete space A must be all of A and cannot be at most countable.

step 1.2L2L3
3.1

Thus P is separable by step 1.1 but has the nonseparable subspace A by step 2.1, refuting heredity of separability.

step 1.1step 2.1L3∎

Depends on

Used by

Dependency tree · two levels

58 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