Find your next learning step
Urysohn metrisation uses a countable base, which is powerful but excludes many perfectly good metric spaces. Nagata-Smirnov replaces global countability with a base that is a countable union of locally finite families. Local finiteness says that near each point only finitely many sets from one layer can interfere. That controlled overlap is enough to assemble continuous coordinates and recover a metric.
Open the chapter contents · Topology root · Gold Standard of Education · How X Works
Chapter contents
Choose the route closest to the decision, or read from Chapter 1. The chapters remain open; these grouped routes are a navigable index.
Route 1 · Define the decision
Route 2 · Work the ledgers
Route 3 · Transfer the method
Route 4 · Check limits and evidence
Route 5 · Ask and continue
CHAPTER 1 OF 12 · DEFINE THE DECISION
1. State the theorem with conventions visible
The Nagata-Smirnov metrisation theorem says that a space is metrizable if and only if it is regular and has a countably locally finite base. Under conventions where regularity does not include T1, add the required T1 separation explicitly.
Countably locally finite means the base can be written B=⋃n Bn, with each Bn locally finite. It does not mean that the whole base or each layer is countable.
CHAPTER 2 OF 12 · DEFINE THE DECISION
2. Understand local finiteness at a point
A family A is locally finite if every point has a neighbourhood meeting only finitely many members of A. This is stronger than point-finite: a point may belong to finitely many sets while every neighbourhood still meets infinitely many.
Local finiteness allows closure and union operations to behave cleanly. In particular, the closure of a union of a locally finite family equals the union of the closures.
CHAPTER 3 OF 12 · WORK THE LEDGERS
3. Work a real-line layer example
For each positive integer n, let Bn contain intervals ((k−1)/2ⁿ,(k+1)/2ⁿ) for all integers k. At a fixed scale n, any small neighbourhood meets only finitely many such intervals.
| Layer | Interval radius | Centres | Local overlap |
|---|---|---|---|
| B1 | 1/2 | k/2 | Finite near every point |
| B2 | 1/4 | k/4 | Finite near every point |
| Bn | 1/2ⁿ | k/2ⁿ | Finite near every point |
The union over n is a base for the usual real-line topology. The example displays the theorem’s key pattern: controlled overlap at each scale.
CHAPTER 4 OF 12 · WORK THE LEDGERS
4. Compare local, point and global counts
A locally finite layer may be uncountable on a large space. The theorem needs countably many layers, not countably many base elements.
| Property | What is finite or countable | What it controls |
|---|---|---|
| Second countable | All base elements form one countable set | Global enumeration |
| Point-finite | Sets containing each point are finite | Membership only |
| Locally finite | Sets meeting some neighbourhood are finite | Nearby interference |
| Countably locally finite | Base is a countable union of local layers | Multi-scale construction |
This distinction explains why Nagata-Smirnov covers an uncountable discrete metric space: the family of all singleton sets is one locally finite base layer, although it is uncountable.
CHAPTER 5 OF 12 · WORK THE LEDGERS
5. Derive normality from the layered base
Regularity shrinks a basic neighbourhood around each point. Within a locally finite layer, closures can be combined without accumulating uncontrolled boundary points. Across countably many layers, one builds nested open approximations to closed sets.
The proof uses this structure to obtain normality and the separating functions needed for coordinates. Normality is a derived step, not an omitted hypothesis.
CHAPTER 6 OF 12 · TRANSFER THE METHOD
6. Build bounded separating coordinates
For selected base elements U whose closures sit inside larger base elements V, construct continuous functions that are positive on a chosen closed part and zero outside V. Scale functions in layer n so their amplitudes shrink with n.
Local finiteness ensures that taking suprema or combining functions within one layer does not create uncontrolled discontinuity near a point. Shrinking amplitudes controls the countable tail.
CHAPTER 7 OF 12 · TRANSFER THE METHOD
7. Assemble a metric from functions
A separating family of bounded continuous functions can define a pseudometric through a weighted sum or supremum of coordinate differences. The base construction guarantees that distinct points are separated and that coordinate neighbourhoods recover the original topology.
The proof therefore has two obligations: the formula must be a metric, and its open sets must agree with the given topology. Verifying only point separation is not enough.
CHAPTER 8 OF 12 · TRANSFER THE METHOD
8. Connect with Urysohn metrisation
The Urysohn metrisation guide uses a countable base and a countable cube. A second-countable regular space automatically fits the broader Nagata-Smirnov framework because a countable family is a countable union of finite, hence locally finite, layers.
Use Urysohn’s lemma and separating closed sets for the function-building engine.
CHAPTER 9 OF 12 · CHECK LIMITS AND EVIDENCE
9. Know the limits and common misconceptions
A countable union of arbitrary families is not enough; each layer must be locally finite. A point-finite base is also not automatically a substitute, because nearby sets can still accumulate around a point.
The theorem is a characterization of topologies, not a unique recipe for physical distance. Compatible metrics can differ greatly in boundedness, completeness and numerical geometry.
CHAPTER 10 OF 12 · CHECK LIMITS AND EVIDENCE
10. Use a proof and source checklist
State the separation convention, display the layered base, verify local finiteness, derive the required separation functions, prove point separation and prove that the generated metric topology equals the original topology.
The University of Chicago paper Nagata-Smirnov Metrization Theorem gives a direct proof. Its companion Exploration of the Metrizability of Topological Spaces develops locally finite refinements, normality and the coordinate construction.
CHAPTER 11 OF 12 · ASK AND CONTINUE
11. Frequently asked questions
Must every locally finite layer be finite?
No. It may be infinite or uncountable; only finitely many members may meet a suitable neighbourhood of each point.
Does metrizable imply second countable?
No. An uncountable discrete space is metrizable but not second countable.
Does the theorem guarantee completeness?
No. Metrizability gives a compatible metric, not necessarily a complete one.
CHAPTER 12 OF 12 · ASK AND CONTINUE
12. Continue with a changed-space check
Take an uncountable discrete space. Use the singleton base as one locally finite layer, verify regularity and recover the discrete metric. Then explain why the same example lies outside the second-countable Urysohn theorem without contradicting it.
Continue through the Topology root, the Gold Standard of Education and the How X Works hub.
Top · Contents · Previous · How X Works