Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)audited 2026-07-27 rests on unproved material
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.

Rests on 1 statement not proved in this library. Every dependency marked below is recorded with a citation but is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Why the nested-interval proof of Baire category in R\mathbb{R} needs no choice, while the general complete-metric statement does

Remark

What the proof on this page spends. The proof of 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 uses exactly four things: the recursion theorem (The recursion theorem), the well-ordering principle for N\mathbb{N} (The well-ordering principle), the nested interval property (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), and one fixed enumeration of the rationals (Q\mathbb{Q} is countably infinite, The rationals embed densely in the reals). None of these is a choice principle. The enumeration is a single object, fixed once by one instantiation of an existential statement; the interval used at stage kk is the one whose two rational endpoints have least index among those meeting the requirements, and "least" is determined by The well-ordering principle; so the successor rule is a function, and the whole construction is one application of The recursion theorem to it. In particular the proof does not use countable choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)), which the neighbouring measure-theoretic results on this page do use.

What the naive proof would spend, and why. The textbook argument says: given the interval produced at stage kk, choose an interval inside it meeting Uk+1U_{k+1}, and repeat. Each choice is made from a nonempty set that depends on the previous choice, and it is made infinitely often. That pattern is not countable choice, which selects from a family fixed in advance; it 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). Replacing the choice by a canonical rule is the only edit the argument needs, and fixing an enumeration of a dense set in advance is what makes a canonical rule available.

What this does NOT establish. It establishes nothing about the Baire category theorem for complete metric spaces in general. That statement is genuinely stronger, and how much stronger is recorded, with references and without proof, in The Baire category theorem is four inequivalent statements over ZF : over ZF the metric version is equivalent to dependent choice, whereas its restriction to spaces with a countable dense subset is a theorem of ZF, "a fixed countable dense set removes every choice from the construction". The proof of 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 is precisely that restricted argument, specialised to R\mathbb{R} with the rationals as the countable dense set. So the correct summary is:

  • the statement proved here, for R\mathbb{R}, needs no choice principle;
  • the general metric statement is not proved here at all, and is not a corollary of what is proved here;
  • the strength of that general statement over ZF is quoted from the literature in The Baire category theorem is four inequivalent statements over ZF , which this library does not prove.

Why the distinction is worth a separate item. The two statements are routinely called by the same name, and a reader who has seen "Baire needs dependent choice" may reasonably suspect the proof above of hiding an appeal to it. It does not, and the place to look is the successor rule: it takes a minimum over N×N\mathbb{N} \times \mathbb{N} rather than picking a witness. The same device appears in Every nonempty perfect subset of R\mathbb{R} is uncountable, and in both places it is the enumeration of Q\mathbb{Q} that pays for it.

A note on the surrounding page. Choice is not avoided everywhere here. A countable union of measure-zero sets has measure zero, by countable choice spends countable choice at one clearly marked step, and says so; Every at most countable subset of R\mathbb{R} has measure zero and The Cantor set is compact, perfect, uncountable, nowhere dense and of measure zero, and it contains no interval of positive length, so its only nonempty connected subsets are single points spend none. The page is arranged so that each appeal is visible where it happens rather than absorbed into a general convention.

Depends on

Used by

Nothing in the library uses this result yet.

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