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 balls , , form a countable neighbourhood base at , so every metric space is first countable
Statement
Let be a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric) and let . For a natural write for the inverse of the canonical natural , a positive real, and put
Then:
- is at most countable (Finite, countably infinite, countable, uncountable).
- Every is an open subset of containing .
- For every open with there is with .
The two names used in the title are introduced by this statement, not cited from elsewhere. A family of open sets each containing , such that every open set containing contains a member of the family, is a neighbourhood base at ; a space in which every point has an at most countable neighbourhood base is first countable. Claims 1 to 3 say that is an at most countable neighbourhood base at , so every metric space is first countable.
Facts & Assumptions
Given: A metric space , a point , and for each natural the ball .
Canonical naturals: for (Canonical naturals are positive and strictly increasing), hence is invertible with (Inverses of positives are positive, and reciprocation reverses order); and contains , so runs over exactly the naturals as runs over (The natural numbers (von Neumann)).
Balls are open and every ball contains its centre (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, Open ball, closed ball and sphere in a metric space); and whenever (Open ball, closed ball and sphere in a metric space).
Open sets: is open when every point of has a ball around it inside (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).
Reciprocal Archimedean property: for every real there is a natural with (For every in a complete ordered field there is a natural with , Every complete ordered field is Archimedean).
Countability: a nonempty set admitting a surjection from is at most countable (A nonempty set is at most countable iff it is a surjective image of , Finite, countably infinite, countable, uncountable, Equinumerous sets, and , Injection, surjection, bijection).
Proof
For every natural the real is defined and positive, so is a legitimate ball of positive radius.
Let be open with , and fix a real with ; then fix a natural with .
Each is open and contains , which is claim 2.
The map given by is well defined by step 1.1 and is surjective, because every member of is for some and for the natural with ; moreover is nonempty, containing .
By step 1.2 and monotonicity of balls in the radius, , which is claim 3.
By [L5] applied to the surjection of step 2.2, the nonempty set is at most countable, which is claim 1.
Claims 1, 2 and 3 hold by steps 3.1, 2.1 and 2.3, so is an at most countable neighbourhood base at and is first countable.
Remarks
- The family can be finite, and that is not a defect. In a discrete metric space for every , so every is the single point and is a one-element family. "At most countable" in this library includes finite (Finite, countably infinite, countable, uncountable), which is exactly why claim 1 is stated in that form and not as "countably infinite".
- Only the reciprocal form of the Archimedean property is used, in step 1.2, and it is the form recorded as For every in a complete ordered field there is a natural with precisely so that the inversion never has to be redone inside a proof.
- This is what makes sequences sufficient in metric spaces. First countability is the hypothesis under which closure can be described by sequences rather than by nets, and it is used in exactly that way by A point lies in the closure of iff some sequence in converges to it, and a set is closed iff it is sequentially closed.
Depends on
- Open ball, closed ball and sphere in a metric space
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Every complete ordered field is Archimedean
- Inverses of positives are positive, and reciprocation reverses order
- The natural numbers $\mathbb{N}$ (von Neumann)
- Finite, countably infinite, countable, uncountable
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- A nonempty set is at most countable iff it is a surjective image of $\mathbb{N}$
- Canonical naturals are positive and strictly increasing
- Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Injection, surjection, bijection
Used by
- Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure Definition
- Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not Definition
- Assuming the Ultrafilter Lemma and Countable Choice, an uncountable Cantor cube is compact Hausdorff and uniformizable but not first countable, hence not metrizable Example
- A point lies in the closure of A iff some sequence in A converges to it, and a set is closed iff it is sequentially closed Theorem
- A uniform limit of continuous functions is continuous, so C(X,Y) is closed in Y^X under the uniform metric Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 69 results over 20 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
- First-countable space (Wikipedia) (standard reference, not scraped)
- Neighbourhood system (Wikipedia) (standard reference, not scraped)
- J. Munkres, Topology, 2nd ed., §30 (standard reference, not scraped)