Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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\mathbb{R}, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R\mathbb{R} is not a countable union of nowhere dense sets

Statement

Let (Un)nN(U_n)_{n \in \mathbb{N}} be a sequence of subsets of R\mathbb{R}, each open (Open subset of R\mathbb{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\mathbb{R}). Then

nNUnis dense in R.\bigcap_{n \in \mathbb{N}} U_n \quad \text{is dense in } \mathbb{R}.

Consequently, if (An)nN(A_n)_{n \in \mathbb{N}} is a sequence of nowhere dense subsets of R\mathbb{R} (Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R}), then nNAnR\bigcup_{n \in \mathbb{N}} A_n \ne \mathbb{R}: no meager subset of R\mathbb{R} exhausts R\mathbb{R}, so R\mathbb{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 axiom of dependent choice: a relation in which every element is related to something admits an N\mathbb{N}-indexed chain). The construction below instead fixes one enumeration ee of the rationals (Q\mathbb{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 device of Every nonempty perfect subset of R\mathbb{R} 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 R\mathbb{R} needs no choice, while the general complete-metric statement does.

Facts & Assumptions

Given: A sequence (Un)nN(U_n)_{n \in \mathbb{N}} of dense open subsets of R\mathbb{R}. Write QR\mathbb{Q}_{\mathbb{R}} for the image of Q\mathbb{Q} in R\mathbb{R} under qq^q \mapsto \hat q. A pair (p,q)QR×QR(p,q) \in \mathbb{Q}_{\mathbb{R}} \times \mathbb{Q}_{\mathbb{R}} is called good when p<qp < q, and GG denotes the set of good pairs.

[A1]

Each UnU_n is open and dense in R\mathbb{R}.

[L1]

ARA \subseteq \mathbb{R} is dense when A=R\overline{A} = \mathbb{R}, and A\overline{A} is exactly the set of points every neighbourhood of which meets AA; so AA is dense if and only if Nε(x)AN_\varepsilon(x) \cap A \ne \varnothing for every xRx \in \mathbb{R} and every real ε>0\varepsilon > 0 (Limit point, isolated point, adherent point, derived set, and dense subset of R\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, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L2]

UU is open when every xUx \in U admits a real ε>0\varepsilon > 0 with Nε(x)UN_\varepsilon(x) \subseteq U; Nε(x)=(xε,x+ε)N_\varepsilon(x) = (x - \varepsilon, x + \varepsilon); every open interval (p,q)(p,q) is an open set, and [p,q][p,q] is a closed bounded interval, nonempty when pqp \le q (Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L4]

QN\mathbb{Q} \approx \mathbb{N} (Q\mathbb{Q} is countably infinite, Equinumerous sets, ABA \approx B and ABA \preceq B); qq^q \mapsto \hat q is injective with image QR\mathbb{Q}_{\mathbb{R}}, and strictly between any two reals lies an element of QR\mathbb{Q}_{\mathbb{R}} (The rationals embed densely in the reals); a composition of bijections is a bijection (Injection, surjection, bijection).

[L5]

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

[L6]

Recursion: for a set YY, an element y0Yy_0 \in Y and a function T:YYT : Y \to Y there is h:NYh : \mathbb{N} \to Y with h(0)=y0h(0) = y_0 and h(σ(k))=T(h(k))h(\sigma(k)) = T(h(k)) (The recursion theorem).

[L7]

Nested interval property: for nonempty closed bounded intervals Ik=[ak,bk]I_k = [a_k,b_k] with Ik+1IkI_{k+1} \subseteq I_k, the intersection kIk\bigcap_k I_k 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 00).

[L9]

Proof

technique · constructive
1.1

Fix x0Rx_0 \in \mathbb{R} and a real ε0>0\varepsilon_0 > 0; by [L1] it suffices to produce a point of nUn\bigcap_n U_n lying in Nε0(x0)N_{\varepsilon_0}(x_0), since x0x_0 and ε0\varepsilon_0 are then arbitrary.

givenL1suffices: one point in each neighbourhood
1.2

By [L4] fix a bijection β:NQ\beta : \mathbb{N} \to \mathbb{Q} and put e:=ιβe := \iota \circ \beta, where ι(q)=q^\iota(q) = \hat q, so that ee is a bijection from N\mathbb{N} onto QR\mathbb{Q}_{\mathbb{R}}.

L4choose
1.3

Recall the terminology of the Given: a pair (p,q)(p,q) of elements of QR\mathbb{Q}_{\mathbb{R}} is good when p<qp < q, and GG is the set of good pairs.

givenconstruct
2.1

Refinement claim. For every good (p,q)(p,q) and every nNn \in \mathbb{N} there is a good (p,q)(p',q') with [p,q](p,q)Un[p',q'] \subseteq (p,q) \cap U_n. To see it, note first that (p,q)(p,q) is nonempty, since [L4] supplies an element of QR\mathbb{Q}_{\mathbb{R}} strictly between pp and qq, and that (p,q)(p,q) is open by [L2]; fix y1(p,q)y_1 \in (p,q) and, by [L2], a real ρ1>0\rho_1 > 0 with Nρ1(y1)(p,q)N_{\rho_1}(y_1) \subseteq (p,q). Since UnU_n is dense, [A1] and [L1] give yNρ1(y1)Uny \in N_{\rho_1}(y_1) \cap U_n, so y(p,q)Uny \in (p,q) \cap U_n, and that set is open by [A1], [L2] and [L3], so there is a real ρ>0\rho > 0 with Nρ(y)(p,q)UnN_\rho(y) \subseteq (p,q) \cap U_n. By [L4] fix p,qQRp', q' \in \mathbb{Q}_{\mathbb{R}} with yρ<p<y<q<y+ρy - \rho < p' < y < q' < y + \rho. Then p<qp' < q', so (p,q)(p',q') is good, and every t[p,q]t \in [p',q'] satisfies yρ<ptq<y+ρy - \rho < p' \le t \le q' < y + \rho, whence ty<ρ|t - y| < \rho and tNρ(y)t \in N_\rho(y); thus [p,q]Nρ(y)(p,q)Un[p',q'] \subseteq N_\rho(y) \subseteq (p,q) \cap U_n.

step 1.3A1L1L2L3L4choose
3.1

Successor rule. For (k,(p,q))N×G(k, (p,q)) \in \mathbb{N} \times G let mm be the least natural for which some natural jj makes (e(m),e(j))(e(m), e(j)) good with [e(m),e(j)](p,q)Uk[e(m), e(j)] \subseteq (p,q) \cap U_k, and let jj be the least natural with that property for that mm; put T(k,(p,q)):=(σ(k),(e(m),e(j)))T(k,(p,q)) := (\sigma(k), (e(m), e(j))). The set of eligible mm is nonempty by step 2.1 applied with n=kn = k, since ee is onto QR\mathbb{Q}_{\mathbb{R}} by step 1.2, so both minima exist by [L5] and T:N×GN×GT : \mathbb{N} \times G \to \mathbb{N} \times G is a total function defined without any selection.

step 1.2step 2.1L4L5construct
4.1

The recursion. By [L4] fix p0,q0QRp_0, q_0 \in \mathbb{Q}_{\mathbb{R}} with x0ε0<p0<x0<q0<x0+ε0x_0 - \varepsilon_0 < p_0 < x_0 < q_0 < x_0 + \varepsilon_0; then (p0,q0)(p_0,q_0) is good and, as in step 2.1, [p0,q0]Nε0(x0)[p_0,q_0] \subseteq N_{\varepsilon_0}(x_0) by [L2]. Apply [L6] with Y=N×GY = \mathbb{N} \times G, seed (0,(p0,q0))(0,(p_0,q_0)) and map TT to get h:NN×Gh : \mathbb{N} \to \mathbb{N} \times G with h(0)=(0,(p0,q0))h(0) = (0,(p_0,q_0)) and h(σ(k))=T(h(k))h(\sigma(k)) = T(h(k)); an induction on kk shows that the first coordinate of h(k)h(k) is kk, so write h(k)=(k,(pk,qk))h(k) = (k,(p_k,q_k)), every (pk,qk)(p_k,q_k) being good.

step 1.1step 1.3step 3.1L2L4L6construct
5.1

Write Ik:=[pk,qk]I_k := [p_k, q_k], a nonempty closed bounded interval by [L2]. The rule of step 3.1 gives, for every kNk \in \mathbb{N}, that Ik+1(pk,qk)UkIkI_{k+1} \subseteq (p_k,q_k) \cap U_k \subseteq I_k; in particular the family (Ik)(I_k) is nested and Ik+1UkI_{k+1} \subseteq U_k.

step 3.1step 4.1L2
6.1

By [L7] applied to the nested family (Ik)(I_k) of nonempty closed bounded intervals, kIk\bigcap_{k} I_k \ne \varnothing; fix xx in it.

step 5.1L7choose
7.1

For every nNn \in \mathbb{N} one has xIn+1Unx \in I_{n+1} \subseteq U_n by steps 5.1 and 6.1, so xnUnx \in \bigcap_n U_n; and xI0Nε0(x0)x \in I_0 \subseteq N_{\varepsilon_0}(x_0) by steps 4.1 and 6.1. So Nε0(x0)N_{\varepsilon_0}(x_0) meets nUn\bigcap_n U_n.

step 4.1step 5.1step 6.1
8.1

Since x0Rx_0 \in \mathbb{R} and the real ε0>0\varepsilon_0 > 0 were arbitrary, every neighbourhood of every point of R\mathbb{R} meets nUn\bigcap_n U_n, so that set is dense by [L1].

step 1.1step 7.1L1
9.1

For the consequence, let (An)(A_n) be a sequence of nowhere dense sets and put Un:=RAnU_n := \mathbb{R} \setminus \overline{A_n}, which is open by [L3] and [L8] and dense by [L8]; by step 8.1 the set nUn\bigcap_n U_n is dense, hence nonempty, and any xx in it lies outside every An\overline{A_n} and so outside every AnA_n, giving xnAnx \notin \bigcup_n A_n and therefore nAnR\bigcup_n A_n \ne \mathbb{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\mathbb{R}.

step 8.1L1L3L8L9discharge-construct

Remarks

Depends on

Used by

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