In a general [topological space](/page/Topology), the topology can be extraordinarily large --- the collection of open sets may have cardinality far exceeding that of the underlying set. This abundance creates serious obstacles. When we attempt to extract convergent subsequences, construct countable approximations, or reduce open covers to manageable subcovers, we need the topology itself to be "small" in a precise sense. The question is: *what condition on a topology ensures that the entire open-set structure is governed by a countable amount of data?*

The answer is **second countability**: the existence of a countable base for the topology. A base is a collection of open sets from which every open set can be reconstructed by taking unions, so a countable base means that every open set in the space --- no matter how complicated --- is a union of sets drawn from a single countable family. This is a far-reaching constraint. It forces the space to be [separable](/page/Separable%20Space) (admit a countable dense subset), [Lindelof](/page/Lindel%C3%B6f%20Space) (every open cover has a countable subcover), and --- when combined with regularity --- [metrizable](/page/Metrizable%20Space) (by the Urysohn Metrization Theorem). In the metrizable setting, second countability, separability, and the Lindelof property are all equivalent, but in general topology they diverge, and second countability is the strongest of the three.

The importance of second countability is most visible in two areas. First, in the theory of [metrizable spaces](/page/Metrizable%20Space), second countability is the countability axiom that appears in the Urysohn Metrization Theorem --- the first and most widely used sufficient condition for metrizability. A topological space that is regular and second-countable embeds into the Hilbert cube $[0,1]^{\mathbb{N}}$, and is therefore metrizable. Second, in the definition of [Polish spaces](/page/Polish%20Space), which form the natural setting for descriptive set theory and probability, a Polish space is by definition a separable, completely metrizable space --- and in the metrizable setting, separability is equivalent to second countability. The entire apparatus of Borel complexity theory, regular conditional distributions, and the Kuratowski isomorphism theorem rests on this countability condition.

[example: The Sorgenfrey Line --- Separable but Not Second-Countable] The distinction between separability and second countability is most sharply illustrated by the **Sorgenfrey line** $\mathbb{R}_\ell$: the real line equipped with the lower limit topology, whose basic open sets are the half-open intervals $[a, b)$ for $a < b$. **Separability.** The rationals $\mathbb{Q}$ form a countable dense subset: for any $x \in \mathbb{R}$ and $\varepsilon > 0$, the basic open set $[x, x + \varepsilon)$ contains a rational number (by density of $\mathbb{Q}$ in $\mathbb{R}$). Therefore $\mathbb{R}_\ell$ is separable. **Failure of second countability.** Suppose for contradiction that $\mathcal{B} = \{B_1, B_2, \ldots\}$ is a countable base for $\mathbb{R}_\ell$. For each $x \in \mathbb{R}$, the set $[x, x+1)$ is open, so there exists $B_{n(x)} \in \mathcal{B}$ with $x \in B_{n(x)} \subset [x, x+1)$. In particular, $\inf B_{n(x)} = x$ (since $B_{n(x)} \subset [x, x+1)$ forces $\inf B_{n(x)} \ge x$, while $x \in B_{n(x)}$ gives $\inf B_{n(x)} \le x$). If $x \neq y$, then $\inf B_{n(x)} \neq \inf B_{n(y)}$, so $B_{n(x)} \neq B_{n(y)}$, whence $n(x) \neq n(y)$. The map $x \mapsto n(x)$ is an injection from $\mathbb{R}$ (uncountable) into $\mathbb{N}$ (countable), which is impossible. This example shows that a space can have a countable dense subset (controlling the "point-level complexity") while its topology is too rich to be generated by any countable family of open sets (its "open-set complexity" is uncountable). Second countability is strictly stronger than separability. [/example]

## Definition

The Sorgenfrey line example exposes a gap between two levels of "countable control." Having a countable dense subset tells us that the *points* of the space are accessible via countable approximation, but it says nothing about the *open sets* --- the topology may require uncountably many "building blocks" that no countable collection can replace. To close this gap, we need a condition that bounds the complexity of the open-set structure itself, not just the point set. The right condition turns out to be simple: require that a countable subcollection of open sets suffices to generate the entire topology via unions.

Recall that a **base** (or **basis**) for a topology $\tau$ on a set $X$ is a subcollection $\mathcal{B} \subset \tau$ such that every open set $G \in \tau$ can be written as a union of members of $\mathcal{B}$. Equivalently, $\mathcal{B}$ is a base if and only if for every $G \in \tau$ and every $x \in G$, there exists $B \in \mathcal{B}$ with $x \in B \subset G$.

[definition: Second-Countable Space] A [topological space](/page/Topology) $(X, \tau)$ is **second-countable** (also called **second axiom of countability**) if it admits a countable base for its topology. That is, there exists a countable collection $\mathcal{B} = \{B_1, B_2, \ldots\} \subset \tau$ such that every open set $G \in \tau$ is a union of members of $\mathcal{B}$: \begin{align*} G = \bigcup \{B \in \mathcal{B} : B \subset G\}. \end{align*} [/definition]

The "second" in "second-countable" distinguishes this property from **first countability**, which requires only that each point $x \in X$ have a countable neighbourhood base --- a countable collection $\{U_1, U_2, \ldots\}$ of open sets containing $x$ such that every open set containing $x$ includes some $U_n$. Every second-countable space is first-countable (restrict the countable base to those members containing $x$), but the converse fails: the Sorgenfrey line is first-countable (the sets $\{[x, x + 1/n)\}_{n=1}^\infty$ form a countable neighbourhood base at $x$) but not second-countable, as shown above.

Second countability depends on the topology, not on the underlying set. The same set $\mathbb{R}$ is second-countable in the Euclidean topology (with base $\{(p, q) : p, q \in \mathbb{Q}, \, p < q\}$) and not second-countable in the lower limit topology (as demonstrated above) or the discrete topology (where any base must contain all singletons, which is uncountable).

[example: Second Countability of $\mathbb{R}^n$] Euclidean space $\mathbb{R}^n$ with the standard topology is second-countable. A countable base is the collection of open balls with rational centres and rational radii: \begin{align*} \mathcal{B} = \{B(q, r) : q \in \mathbb{Q}^n, \, r \in \mathbb{Q}, \, r > 0\}. \end{align*} This is countable as a subset of $\mathbb{Q}^n \times \mathbb{Q}_{>0}$, which is a countable product of countable sets. To verify it is a base: let $G \subset \mathbb{R}^n$ be open and $x \in G$. There exists $\varepsilon > 0$ with $B(x, \varepsilon) \subset G$. Choose $q \in \mathbb{Q}^n$ with $|x - q| < \varepsilon/3$ and $r \in \mathbb{Q}$ with $\varepsilon/3 < r < \varepsilon/2$. Then $x \in B(q, r)$ (since $|x - q| < \varepsilon/3 < r$) and $B(q, r) \subset B(x, \varepsilon) \subset G$ (since for $y \in B(q, r)$, $|y - x| \le |y - q| + |q - x| < r + \varepsilon/3 < \varepsilon/2 + \varepsilon/3 < \varepsilon$). [/example]

## Separability and the Lindelof Property

Having defined second countability as a condition on the open sets, we face two immediate questions: does controlling the open-set structure force a countable dense subset to exist? And does it force open covers to admit countable subcovers? Both answers are affirmative, and neither requires any additional hypotheses beyond second countability itself.

### From Second Countability to Separability

The first consequence is that every second-countable space is [separable](/page/Separable%20Space). If a topology can be generated by countably many open sets, then countably many "sample points" --- one from each basis element --- already approximate the entire space.

[quotetheorem:1067]

The construction is straightforward: let $\mathcal{B} = \{B_1, B_2, \ldots\}$ be a countable base for $\tau$. For each nonempty $B_n$, choose a point $d_n \in B_n$ (by the Axiom of Choice, or more precisely by countable choice). The set $D = \{d_n : B_n \neq \varnothing\}$ is countable. To verify density: let $G \in \tau$ be nonempty. Then $G$ contains some $B_n$ (since $\mathcal{B}$ is a base), so $d_n \in D \cap G$. Since every nonempty open set meets $D$, we have $\overline{D} = X$.

The converse fails in general topological spaces --- the Sorgenfrey line is the canonical counterexample (separable but not second-countable). The construction above produces a dense subset but gives no control over its algebraic or topological structure: the set $D$ is not in general a subgroup, a subring, or a sublattice of $X$, even when $X$ carries such structure. The converse does hold in metrizable spaces, a fact of central importance discussed in the section on equivalence in metrizable spaces below.

### From Second Countability to the Lindelof Property

The second consequence is more surprising and more powerful: every second-countable space is **Lindelof** --- every open cover admits a countable subcover. This is a strong property that sits between compactness (finite subcovers) and the trivial observation that every cover is a subcover of itself.