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 and its antidiagonal .
Products of at most countable sets are at most countable (A product of two at most countable sets is at most countable).
The rational numbers are at most countable and dense in the real line, and the real line is uncountable ( is countably infinite, The rationals embed densely in the reals, is uncountable (Cantor's nested intervals, 1874)).
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).
The half-open intervals , , satisfy the basis criterion, and products of their members form a basis for the product topology (Intervals of : the nine order-convex forms, nondegeneracy, and length, A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis, The product set of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).
Refutation
The half-open intervals cover , and if two contain , then lies in their intersection for some ; hence [F1] makes them a basis. The rational grid is at most countable by [L1] and [L2], and density of makes it meet every nonempty basic lower-limit rectangle, so it is dense in .
For each , the basic rectangle meets only in ; hence is discrete in its subspace topology.
The map is a bijection from the uncountable set onto , so a dense subset of the discrete space must be all of and cannot be at most countable.
Thus is separable by step 1.1 but has the nonseparable subspace by step 2.1, refuting heredity of separability.
Depends on
- Separability: the existence of an at most countable dense subset
- The product set $\prod_{i \in I} X_i$ of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space
- 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
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis
- $\mathbb{Q}$ is countably infinite
- The rationals embed densely in the reals
- $\mathbb{R}$ is uncountable (Cantor's nested intervals, 1874)
- A product of two at most countable sets is at most countable
- Hereditary, open-hereditary and closed-hereditary properties of topological spaces
Used by
- Assuming choice, a separable space with a nonseparable subspace: the lower-limit plane and its antidiagonal Counterexample
- Assuming choice, the lower-limit plane is first countable, separable, and ccc, but not second countable or Lindelöf Example
- Implication, preservation, counterexample, and choice ledger for the countability axioms Remark
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
- UCR General Topology Notes (standard reference, not scraped)
- Sorgenfrey plane (Wikipedia) (standard reference, not scraped)