How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Baire category in , by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so is not a countable union of nowhere dense sets
Statement
Let be a sequence of subsets of , each open (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen) and dense (Limit point, isolated point, adherent point, derived set, and dense subset of ). Then
Consequently, if is a sequence of nowhere dense subsets of (Nowhere dense, meager (first category), residual, and second category subsets of ), then : no meager subset of exhausts , so is of the second category in itself.
The selection is canonical, and the proof spends no choice principle. The textbook argument picks a nested interval at every stage in terms of the one before it, which is the axiom of dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain). The construction below instead fixes one enumeration of the rationals ( is countably infinite, The rationals embed densely in the reals) and, at every stage, takes the interval whose two rational endpoints have least index among those meeting the requirements. The requirements are met by some rational-endpoint interval, which is what the refinement claim of the proof establishes, and the least such index is determined by The well-ordering principle; so the whole recursion is a single application of The recursion theorem to one total map. This is the device of Every nonempty perfect subset of is uncountable, transplanted from perfect sets to dense open sets. What it does not settle is the strength of the theorem for general complete metric spaces, which is recorded separately in Why the nested-interval proof of Baire category in needs no choice, while the general complete-metric statement does.
Facts & Assumptions
Given: A sequence of dense open subsets of . Write for the image of in under . A pair is called good when , and denotes the set of good pairs.
Each is open and dense in .
is dense when , and is exactly the set of points every neighbourhood of which meets ; so is dense if and only if for every and every real (Limit point, isolated point, adherent point, derived set, and dense subset of , The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, The -neighbourhood and the punctured -neighbourhood of a point of ).
is open when every admits a real with ; ; every open interval is an open set, and is a closed bounded interval, nonempty when (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The -neighbourhood and the punctured -neighbourhood of a point of , Intervals of : the nine order-convex forms, nondegeneracy, and length).
The intersection of two open subsets of is open, and the complement of a closed set is open (Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen).
( is countably infinite, Equinumerous sets, and ); is injective with image , and strictly between any two reals lies an element of (The rationals embed densely in the reals); a composition of bijections is a bijection (Injection, surjection, bijection).
Every nonempty subset of has a least element (The well-ordering principle).
Recursion: for a set , an element and a function there is with and (The recursion theorem).
Nested interval property: for nonempty closed bounded intervals with , the intersection is nonempty (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to ).
is nowhere dense exactly when is dense; is a closed set containing (Nowhere dense, meager (first category), residual, and second category subsets of , Interior, closure, boundary and exterior of a subset of , The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points).
An at most countable family may always be presented as a sequence indexed by (Finite, countably infinite, countable, uncountable, Nowhere dense, meager (first category), residual, and second category subsets of ).
Proof
Fix and a real ; by [L1] it suffices to produce a point of lying in , since and are then arbitrary.
By [L4] fix a bijection and put , where , so that is a bijection from onto .
Recall the terminology of the Given: a pair of elements of is good when , and is the set of good pairs.
Refinement claim. For every good and every there is a good with . To see it, note first that is nonempty, since [L4] supplies an element of strictly between and , and that is open by [L2]; fix and, by [L2], a real with . Since is dense, [A1] and [L1] give , so , and that set is open by [A1], [L2] and [L3], so there is a real with . By [L4] fix with . Then , so is good, and every satisfies , whence and ; thus .
Successor rule. For let be the least natural for which some natural makes good with , and let be the least natural with that property for that ; put . The set of eligible is nonempty by step 2.1 applied with , since is onto by step 1.2, so both minima exist by [L5] and is a total function defined without any selection.
The recursion. By [L4] fix with ; then is good and, as in step 2.1, by [L2]. Apply [L6] with , seed and map to get with and ; an induction on shows that the first coordinate of is , so write , every being good.
Write , a nonempty closed bounded interval by [L2]. The rule of step 3.1 gives, for every , that ; in particular the family is nested and .
By [L7] applied to the nested family of nonempty closed bounded intervals, ; fix in it.
For every one has by steps 5.1 and 6.1, so ; and by steps 4.1 and 6.1. So meets .
Since and the real were arbitrary, every neighbourhood of every point of meets , so that set is dense by [L1].
For the consequence, let be a sequence of nowhere dense sets and put , which is open by [L3] and [L8] and dense by [L8]; by step 8.1 the set is dense, hence nonempty, and any in it lies outside every and so outside every , giving and therefore . By [L9] the same conclusion covers a union of an at most countable family of nowhere dense sets, so no meager set is all of .
Remarks
-
What "dense" is doing at each end. Density of the is used exactly once, in the refinement claim, to find a point of inside a given open interval; openness is used exactly once, immediately after, to fit a whole closed interval with rational endpoints around that point. Neither hypothesis can be dropped. Without openness the conclusion fails: the family consisting of together with all the sets for is an at most countable family of dense sets, all but the first of them open, and its intersection is empty. Without density it fails too, for the constant sequence has intersection , which is not dense in .
-
Only nonemptiness of the nested intersection is used. The construction does not force the interval lengths to and does not need to: claim 1 of A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to already produces a point, and one point is all the argument wants. That is why no Archimedean step appears anywhere above.
-
The consequence is the form used downstream. Applying it to the sequence of singletons of a supposed enumeration of reproves that is uncountable (Baire category gives a third proof that is uncountable ↗); applying it to a supposed presentation of as a set is what shows that no such presentation exists ( is , meager and not , while the irrationals are , residual and not ).
-
Category is not measure. The intersection produced above is dense but may be very small in the sense of Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover); indeed decomposes as a meager set together with a set of measure zero ( is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions ↗), so this theorem says nothing whatever about size in measure.
Depends on
- Nowhere dense, meager (first category), residual, and second category subsets of $\mathbb{R}$
- A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to $0$
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Open subset of $\mathbb{R}$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen
- Limit point, isolated point, adherent point, derived set, and dense subset of $\mathbb{R}$
- The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points
- Interior, closure, boundary and exterior of a subset of $\mathbb{R}$
- Finite, countably infinite, countable, uncountable
- Equinumerous sets, $A \approx B$ and $A \preceq B$
- Injection, surjection, bijection
- $\mathbb{Q}$ is countably infinite
- The rationals embed densely in the reals
- The well-ordering principle
- The recursion theorem
- Arbitrary unions and finite intersections of open subsets of $\mathbb{R}$ are open, and dually for closed sets
- The $\varepsilon$-neighbourhood and the punctured $\varepsilon$-neighbourhood of a point of $\mathbb{R}$
Used by
- ℚ is F_σ, meager and not G_δ, while the irrationals are G_δ, residual and not F_σ Corollary
- ℝ is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions Counterexample
- The irrationals form a residual G_δ set that is not F_σ Counterexample
- Baire category gives a third proof that ℝ is uncountable Example
- FALSE: ℚ is a G_δ subset of ℝ False statement
- Baire category inside a closed bounded interval: if [a,b] with a < b is covered by a sequence of closed sets, then one of them contains a nondegenerate closed subinterval of [a,b]; no choice principle is used Lemma
- Why the nested-interval proof of Baire category in ℝ needs no choice, while the general complete-metric statement does Remark
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 122 results over 34 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Baire category theorem (Wikipedia) (standard reference, not scraped)
- Nested intervals (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (Exercise 22) and Ch. 2 (standard reference, not scraped)
- Baire theorem (Encyclopedia of Mathematics) (standard reference, not scraped)
- E. Zakon, Mathematical Analysis, §6.8: Baire Categories (standard reference, not scraped)