Baire Category Theorem
Based on The Bright Side of Mathematics's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.
In a complete metric space X, the intersection of countably many dense open subsets is dense.
Briefing
Baire category theorem turns a topological intuition into a powerful completeness-based guarantee: in a complete metric space, “large” sets remain large even after taking countably many intersections. The version most people remember is that a countable intersection of dense open sets is still dense. That matters because it lets analysts prove that certain “good” properties occur not just once, but densely—often implying existence of objects with highly nontrivial behavior.
In a complete metric space X, the theorem is framed using density and openness. A subset Q is dense in X if its closure equals X, meaning every point of X can be approximated arbitrarily well by points of Q. The classic example is that the rationals Q are dense in the reals R. The Baire claim then adds two ingredients: the sets being intersected must be open and dense, and there must be only countably many of them. Under those conditions, the intersection of all those dense open sets remains dense—so no matter how the approximations are refined step by step, the “limit” set still hits every region of X.
The theorem also has a language built from “smallness.” A set M is nowhere dense if its closure has empty interior; equivalently, M is so thin that even after closing it up, no open ball sits entirely inside it. From there, a meager (first-category) set is a countable union of nowhere dense sets, capturing the idea of being small in a strong, structural sense. The complement idea—sets that are not meager—are called second-category (non-meager). With these definitions, one common formulation says that every non-empty open set in a complete metric space is second category: it cannot be written as a countable union of nowhere dense sets. Completeness is essential; the rationals illustrate failure in incomplete settings because Q can be expressed as a countable union of single points, even though the analogous statement does not hold in complete spaces like R.
A standard application in analysis uses the space C[0,1] of continuous functions with the supremum norm, which forms a complete metric space. The argument proceeds by partitioning C[0,1] into countably many pieces A_j plus a remaining set B. The sets A_j are arranged so that they capture functions that are differentiable at least at one point (in a way that makes each A_j nowhere dense). The leftover set B then consists of functions that are nowhere differentiable—at least in the sense that it contains such functions. Since the whole space C[0,1] is second category, B cannot be meager; in fact, non-meager subsets in this setting are dense. The conclusion is striking: nowhere differentiable continuous functions not only exist, they form a dense (and therefore “typical”) subset of C[0,1].
Overall, Baire category theorem provides an existence proof strategy: instead of constructing an object with a desired property directly, shift the property into the complement of a meager set and use completeness to ensure that the complement is large. That approach generalizes well beyond differentiability questions, making the theorem a staple tool in functional analysis and related fields.
Cornell Notes
Baire category theorem says that in a complete metric space X, countably many “large” sets stay large. The most memorable form: the intersection of countably many dense open sets is dense. Using category language, a set is meager (first category) if it is a countable union of nowhere dense sets; a non-meager set is second category. In a complete metric space, every non-empty open set is second category, so it cannot be meager. This completeness-driven principle is used in analysis to show that continuous functions on [0,1] that are nowhere differentiable exist and are dense in C[0,1] (with the supremum norm), without explicitly constructing such functions.
What does “dense” mean in a metric space, and why does it matter for intersections?
Why must the sets in the “countable intersection” version be both dense and open?
How do “nowhere dense” and “meager” formalize the idea of a set being “small”?
What is the key completeness-based consequence for non-empty open sets?
How does the theorem imply that nowhere differentiable continuous functions are dense in C[0,1]?
Review Questions
- State the dense-open version of Baire category theorem and explain the role of completeness.
- Define nowhere dense and meager sets, then state the second-category version for non-empty open sets in a complete metric space.
- Outline how a countable decomposition of C[0,1] into sets A_j and B leads to the conclusion that nowhere differentiable functions are dense.
Key Points
- 1
In a complete metric space X, the intersection of countably many dense open subsets is dense.
- 2
Density means closure equals the whole space, so every point can be approximated by points from the subset.
- 3
Nowhere dense sets are those whose closures have empty interior, preventing them from containing any open region.
- 4
Meager (first-category) sets are countable unions of nowhere dense sets; second-category sets are those that are not meager.
- 5
In a complete metric space, every non-empty open set is second category, so it cannot be covered by countably many nowhere dense sets.
- 6
A standard application uses C[0,1] with the supremum norm (complete): nowhere differentiable continuous functions form a dense subset.
- 7
Baire category arguments often prove existence by showing the “bad” set is meager and therefore cannot exhaust a complete space or a non-empty open set.