Baire category and complete spaces
Use nested complete-space constructions to show that countably many nowhere dense obstructions cannot exhaust an open region.
On this page
The question for today
What you’ll understand
- Distinguish nowhere dense, meager, dense, and residual subsets.
- Explain the shrinking-ball proof of Baire's theorem with completeness at the decisive step.
- Apply Baire's theorem without treating category as probability or measure.
A dense set meets every open region, but two dense sets can still be disjoint. The rational and irrational numbers give a familiar example. Baire's theorem identifies an important stronger situation: in a complete metric space, a countable intersection of dense open sets remains dense. It converts many individually avoidable closed obstructions into a simultaneous avoidance statement. The conclusion is an existence theorem about topology, rather than a numerical algorithm or a claim that a randomly sampled point has any particular probability.
Define smallness by the absence of interior after closure
A set is nowhere dense when its closure has empty interior. This is stronger than merely having empty interior: the rationals have empty interior in the real line, but their closure is the whole line, so they are not nowhere dense. A singleton in the real line is nowhere dense because it is closed and contains no interval. A set is meager if it is a countable union of nowhere dense sets. Thus the rationals are meager, even though they are dense. These examples show that density and category-smallness answer different questions.
The complement of a meager set is called residual or comeager. A residual set can be described as containing a countable intersection of dense open sets: replace each nowhere dense set by its closure and take complements. Some authors use generic to mean residual, so the intended definition should be stated. Category is not cardinality or measure. For example, a countable dense set can be topologically small, while a closed nowhere dense set can still have positive Lebesgue measure. No probability law is part of the definition of category.
Completeness makes simultaneous avoidance possible
Let X be a complete metric space and U_n a sequence of open dense subsets. To show their intersection is dense, start inside any nonempty open region W. Choose a nonempty closed ball of positive radius contained in W intersected with U_1, with radius at most one half. Inside its open interior choose a smaller closed ball contained also in U_2, with radius at most one quarter. Continue, nesting the closed balls and choosing radii tending to zero. Openness gives room for each ball, while density ensures there is a point at which to place it.
The centers form a Cauchy sequence because all late centers lie in any fixed earlier ball and those ball diameters tend to zero. Completeness supplies a limit in X. Each earlier ball is closed, so that limit lies in every ball and hence in W and every U_n. This proves density of the intersection. The limit argument uses neither compactness of the balls nor local compactness of X. In a general complete metric space, closed bounded balls need not be compact, but their shrinking nested structure is sufficient here.
Use the theorem in the correct direction
Equivalently, a nonempty complete metric space cannot be a countable union of nowhere dense subsets, and no nonempty open subset is meager in that space. The ambient qualification matters. The rational numbers with usual distance are a countable union of their singletons, each nowhere dense relative to the rationals, and the whole rational space is nonempty open in itself. It is therefore not a Baire space and cannot be complete. This is an application of the theorem's contrapositive, not a claim that every incomplete metric space must fail the Baire property.
On the real line, enumerate the rationals q_n. Every complement of a singleton {q_n} is open dense. Their intersection is the irrational numbers, so Baire gives another proof that the irrationals are dense. The theorem ensures a point survives countably many closed nowhere dense exclusions even when a drawing shows only finitely many. It does not directly handle an uncountable intersection: intersecting the complements of all real singletons gives the empty set. Countability is a working part of the construction, because one obstruction is addressed at each step of a sequence.
Work it through
Use completeness to rule out an enumeration
Give a Baire-category proof that the real numbers cannot be listed as r_1,r_2,r_3,... .
Assume such a list exhausts the real line. For each n, the singleton {r_n} is closed and has empty interior in the real line, since every open interval contains points different from r_n.
Each singleton is therefore nowhere dense. The assumed enumeration expresses the entire nonempty real line as a countable union of nowhere dense subsets.
The usual real metric is complete, so Baire's theorem forbids that union from being the whole space. The enumeration assumption is false.
The real line is uncountable. The proof uses completeness plus the fact that real singletons are nowhere dense; it is not a replacement for checking those assumptions in other spaces.
The living notebook
Explore the model
Interactive lab · optimization
Shrinking distances illustrate one step of the proof
Set eta=0.5 and nonzero initial x in the exact scalar iteration. Observe geometrically shrinking distances, then predict a radius controlling the future tail. This illustrates the Cauchy estimate used for nested ball centers, but it does not display dense open sets, choose avoiding balls, or prove Baire's theorem visually.
- Position x0
- 2
- Objective x²/2
- 2
- Iteration behavior
- Stable step
Gradient descent on f(x) = x²/2: xₙ = (1 − η)ⁿx₀. Playback advances two discrete iterations per second. Values outside |x| ≤ 4 are explicitly reported. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forGeometric shrinking supplies a Cauchy estimate; completeness is what turns it into a point surviving all countably many stages.
Pause & reason
Check your understanding
Your turn
Try it yourself
For rational numbers q_n in an enumeration, let U_n be the real line with q_n removed. Identify the intersection of all U_n and explain which parts of Baire's theorem apply. Would the same conclusion hold for an arbitrary uncountable family?
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Check openness and density one set at a time. Then compare with removing every real number, one singleton at a time.
Compare with the solution
Each U_n is open because its removed singleton is closed, and dense because removing one point leaves a point in every nonempty interval. Their countable intersection consists exactly of irrational numbers. Completeness of the real line and Baire's theorem show that this intersection is dense. An arbitrary uncountable version is false: the family of complements of all real singletons consists of open dense sets but has empty intersection. The theorem's countable indexing is indispensable.
Keep the idea
Take it with you
- Nowhere dense concerns the interior of the closure; empty interior alone is weaker.
- In a complete metric space, countably many dense open requirements can hold simultaneously in every nonempty open region.
- Category is a topological notion of smallness, and neither probability nor an uncountable-intersection guarantee follows from Baire's theorem.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.