Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck 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 PP and its antidiagonal A={(x,x):xR}A=\{(x,-x):x\in\mathbb 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\mathbb{Q} is countably infinite, The rationals embed densely in the reals, R\mathbb{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\mathbb R, and if two contain xx, then [x,c)[x,c) lies in their intersection for some c>xc>x; hence [F1] makes them a basis. The rational grid Q×Q\mathbb Q\times\mathbb Q is at most countable by [L1] and [L2], and density of Q\mathbb Q makes it meet every nonempty basic lower-limit rectangle, so it is dense in PP.

L1L2L3F1
1.2

For each xRx\in\mathbb R, the basic rectangle [x,x+1)×[x,x+1)[x,x+1)\times[-x,-x+1) meets AA only in (x,x)(x,-x); hence AA is discrete in its subspace topology.

given
2.1

The map x(x,x)x\mapsto(x,-x) is a bijection from the uncountable set R\mathbb R onto AA, so a dense subset of the discrete space AA must be all of AA and cannot be at most countable.

step 1.2L2L3
3.1

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

step 1.1step 2.1L3

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 113 results over 25 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources