Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-27 (gpt-5)
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 R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets

Statement

Let (Un)n∈N be a sequence of subsets of R, each open (Open subset of R (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 R). Then

⋂n∈NUnis dense in R.

Consequently, if (An)n∈N is a sequence of nowhere dense subsets of R (Nowhere dense, meager (first category), residual, and second category subsets of R), then ⋃n∈NAn≠R: no meager subset of R exhausts R, so R 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 construction below instead fixes one enumeration e of the rationals (Q 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 same least-index device used later in the perfect-set development, transplanted here from perfect sets to dense open sets. What it does not settle is the strength of the theorem for general complete metric spaces; that metamathematical point is recorded separately on the choice ledger for this thread.

Facts & Assumptions

Given: A sequence (Un)n∈N of dense open subsets of R. Write QR for the image of Q in R under q↦q^. A pair (p,q)∈QR×QR is called good when p<q, and G denotes the set of good pairs.

[A1]

Each Un is open and dense in R.

[L2]

U is open when every x∈U admits a real ε>0 with Nε(x)⊆U; Nε(x)=(x−ε,x+ε); every open interval (p,q) is an open set, and [p,q] is a closed bounded interval, nonempty when p≤q (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L4]

Q≈N (Q is countably infinite, Equinumerous sets, A≈B and A⪯B); q↦q^ is injective with image QR, and strictly between any two reals lies an element of QR (The rationals embed densely in the reals); a composition of bijections is a bijection (Injection, surjection, bijection).

[L5]

Every nonempty subset of N has a least element (The well-ordering principle).

[L6]

Recursion: for a set Y, an element y0∈Y and a function T:Y→Y there is h:N→Y with h(0)=y0 and h(σ(k))=T(h(k)) (The recursion theorem).

[L7]

Nested interval property: for nonempty closed bounded intervals Ik=[ak,bk] with Ik+1⊆Ik, the intersection ⋂kIk 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 0).

[L9]

Proof

technique · constructive
1.1

Fix x0∈R and a real ε0>0; by [L1] it suffices to produce a point of ⋂nUn lying in Nε0(x0), since x0 and ε0 are then arbitrary.

givenL1suffices: one point in each neighbourhood
1.2

By [L4] fix a bijection β:N→Q and put e:=ι∘β, where ι(q)=q^, so that e is a bijection from N onto QR.

L4choose
1.3

Recall the terminology of the Given: a pair (p,q) of elements of QR is good when p<q, and G is the set of good pairs.

givenconstruct
2.1

Refinement claim. For every good (p,q) and every n∈N there is a good (p′,q′) with [p′,q′]⊆(p,q)∩Un. To see it, note first that (p,q) is nonempty, since [L4] supplies an element of QR strictly between p and q, and that (p,q) is open by [L2]; fix y1∈(p,q) and, by [L2], a real ρ1>0 with Nρ1(y1)⊆(p,q). Since Un is dense, [A1] and [L1] give y∈Nρ1(y1)∩Un, so y∈(p,q)∩Un, and that set is open by [A1], [L2] and [L3], so there is a real ρ>0 with Nρ(y)⊆(p,q)∩Un. By [L4] fix p′,q′∈QR with y−ρ<p′<y<q′<y+ρ. Then p′<q′, so (p′,q′) is good, and every t∈[p′,q′] satisfies y−ρ<p′≤t≤q′<y+ρ, whence ∣t−y∣<ρ and t∈Nρ(y); thus [p′,q′]⊆Nρ(y)⊆(p,q)∩Un.

step 1.3A1L1L2L3L4choose
3.1

Successor rule. For (k,(p,q))∈N×G let m be the least natural for which some natural j makes (e(m),e(j)) good with [e(m),e(j)]⊆(p,q)∩Uk, and let j be the least natural with that property for that m; put T(k,(p,q)):=(σ(k),(e(m),e(j))). The set of eligible m is nonempty by step 2.1 applied with n=k, since e is onto QR by step 1.2, so both minima exist by [L5] and T:N×G→N×G is a total function defined without any selection.

step 1.2step 2.1L4L5construct
4.1

The recursion. By [L4] fix p0,q0∈QR with x0−ε0<p0<x0<q0<x0+ε0; then (p0,q0) is good and, as in step 2.1, [p0,q0]⊆Nε0(x0) by [L2]. Apply [L6] with Y=N×G, seed (0,(p0,q0)) and map T to get h:N→N×G with h(0)=(0,(p0,q0)) and h(σ(k))=T(h(k)); an induction on k shows that the first coordinate of h(k) is k, so write h(k)=(k,(pk,qk)), every (pk,qk) being good.

step 1.1step 1.3step 3.1L2L4L6construct
5.1

Write Ik:=[pk,qk], a nonempty closed bounded interval by [L2]. The rule of step 3.1 gives, for every k∈N, that Ik+1⊆(pk,qk)∩Uk⊆Ik; in particular the family (Ik) is nested and Ik+1⊆Uk.

step 3.1step 4.1L2
6.1

By [L7] applied to the nested family (Ik) of nonempty closed bounded intervals, ⋂kIk≠∅; fix x in it.

step 5.1L7choose
7.1

For every n∈N one has x∈In+1⊆Un by steps 5.1 and 6.1, so x∈⋂nUn; and x∈I0⊆Nε0(x0) by steps 4.1 and 6.1. So Nε0(x0) meets ⋂nUn.

step 4.1step 5.1step 6.1
8.1

Since x0∈R and the real ε0>0 were arbitrary, every neighbourhood of every point of R meets ⋂nUn, so that set is dense by [L1].

step 1.1step 7.1L1
9.1

For the consequence, let (An) be a sequence of nowhere dense sets and put Un:=R∖An‾, which is open by [L3] and [L8] and dense by [L8]; by step 8.1 the set ⋂nUn is dense, hence nonempty, and any x in it lies outside every An‾ and so outside every An, giving x∉⋃nAn and therefore ⋃nAn≠R. 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 R.

step 8.1L1L3L8L9discharge-construct∎

Remarks

Depends on

Used by

Dependency tree · two levels

66 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources