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.
Under choice, every regular second-countable space is metrizable
Statement
Assume the Axiom of Choice. Every regular second-countable space is metrizable.
Facts & Assumptions
Given: A regular space with a countable basis , and the Axiom of Choice.
In a regular space, with open admits open with . (A space is regular if and only if every point has a neighbourhood base of closed neighbourhoods, if and only if open gives an open with )
In a normal space, under DC, disjoint closed sets admit a continuous -valued separator. (Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into , and conversely such a space is normal)
AC selects the separators below and implies DC: choose one successor for each point of an entire relation and iterate that function. (The Axiom of Choice)
Proof
First is normal. Given disjoint closed , enumerate the basis members whose closures avoid as and those whose closures avoid as , padding by empty sets if necessary. By [L1] and the basis property, the first family covers and the second covers . Put and . Each summand is open because only finitely many closed sets are removed. The sets contain respectively. They are disjoint: a point in the th summand of and th summand of would contradict the removal of if , and of if . This proves normality.
For every pair with , [L2] gives a continuous equal to on and on . Use AC to select all these functions, and list them as a sequence , adding zero functions when necessary. For every point and open neighbourhood , choose with , shrink inside using [L1], and choose containing inside that shrinking. Then , so one listed function is at and vanishes outside . This also separates distinct points because makes open.
Define . Each term is at most , so the sum converges. Symmetry and the triangle inequality follow termwise, and step 2.1 gives for . Thus is a metric (including the empty-space case).
For fixed and , choose with . Continuity of the first functions gives an original open neighbourhood of where their weighted differences from their values at sum to less than . Hence . Conversely, for an original open containing , take the index supplied by step 2.1. If , then , so . Thus every original neighbourhood contains a metric ball and every metric ball contains an original neighbourhood at its centre; the topologies coincide. Hence is metrizable.
Depends on
- The Axiom of Choice
- Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into $[0,1]$, and conversely such a space is normal
- A space is regular if and only if every point has a neighbourhood base of closed neighbourhoods, if and only if $x \in U$ open gives an open $V$ with $x \in V \subseteq \overline{V} \subseteq U$
- Second countability: an at most countable basis for the topology
- Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not
Used by
Dependency tree · two levels
40 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
- Encyclopedia of Mathematics, Metrizable space (standard reference, not scraped)