A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.
A space is second-countable if it has a countable basis (stronger condition) and first-countable if each point has a countable neighborhood basis. Second-countable spaces are separable (have a countable dense subset) and metrizable. These countability conditions bridge topology and metrizability, ensuring that sequences suffice to characterize convergence.
From your work on bases for topologies, you know that a basis is a collection of open sets that generates the topology — every open set is a union of basis elements. Countability axioms ask a natural question: how many basis elements do you really need? The answer turns out to have deep structural consequences.
Second countability means the space has a countable basis — a single collection {B₁, B₂, B₃, ...} that generates the entire topology. The canonical example is ℝ with the standard topology: the collection of open intervals with rational endpoints, {(p,q) : p,q ∈ ℚ}, is countable and forms a basis. More generally, ℝⁿ is second-countable. Second countability is a global condition — it says the entire topology can be described using only countably many "building blocks."
First countability is the local version: each point x has a countable neighborhood basis — a countable collection of open sets containing x such that every open set containing x contains some member of the collection. Every metric space is first-countable: the balls B(x, 1/n) for n = 1, 2, 3, ... form a countable neighborhood basis at x. First countability is strictly weaker than second countability — there exist first-countable spaces that are not second-countable (uncountable discrete spaces). The key reward of first countability is that sequences suffice to characterize all topological properties: in a first-countable space, x is in the closure of A if and only if some sequence in A converges to x, and continuity can be checked using sequences alone. Without first countability, you need nets or filters — strictly more general tools.
The implications of second countability cascade. Every second-countable space is first-countable (take the sub-collection of basis elements containing x). Every second-countable space is separable: choose one point from each basis element to get a countable dense subset (this works because any open set contains a basis element, which contains your chosen point). Separability does not imply second-countability in general, but for metrizable spaces the two are equivalent. This equivalence is why the Urysohn metrization theorem — that every regular second-countable space is metrizable — is so powerful: second countability is a clean topological condition that, combined with mild separation, is strong enough to guarantee a metric exists. As you move toward metrization theorems, you will see these countability conditions acting as the precise combinatorial handle that makes the geometry of metric spaces recoverable from abstract topological axioms.