Alphabeta Math
Session-authored (Fable 5 assisted)
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.

17 results · all verified · 15 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Cantor Set, Baire Category, and Measure Zero in R\mathbb{R}

1 · Prerequisites

2 · Summary

Objective. There are two ways for a subset of R\mathbb{R} to be small, and they are unrelated. A set is small in category when it is a countable union of sets whose closures contain no interval; it is small in measure when it can be covered by intervals of total length below every positive bound. This page defines both, proves the one theorem that makes the first notion non-trivial (Baire), proves the one lemma that makes the second notion non-trivial (no interval of positive length is null), and then builds the two sets that separate them: the Cantor middle-thirds set, which is small in both senses and yet uncountable, and the Smith-Volterra-Cantor set, which is small in category and not in measure. It also builds the Cantor function, which climbs from 00 to 11 while doing all of its climbing on a set of measure zero, and it closes with a remark on the choice cost of Baire and with five false statements.

Category. Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R} fixes nowhere dense as "the interior of the closure is empty", records the working equivalent that the complement of the closure is dense, and builds meager, residual and second category on top of it; FσF_\sigma and GδG_\delta subsets of R\mathbb{R} adds the two countable classes FσF_\sigma and GδG_\delta, which are exchanged by complementation. 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 the theorem of the page: a countable intersection of dense open subsets of R\mathbb{R} is dense, so R\mathbb{R} is not a countable union of nowhere dense sets. Q\mathbb{Q} is FσF_\sigma, meager and not GδG_\delta, while the irrationals are GδG_\delta, residual and not FσF_\sigma then settles the status of the rationals and the irrationals completely: Q\mathbb{Q} is FσF_\sigma and meager and is not GδG_\delta, and dually for the irrationals. That last failure is the first genuinely hard fact on the page and is exactly where Baire is spent.

The proof of Baire spends no choice, and the page says so precisely. The textbook argument picks a nested interval at each stage in terms of the previous one, which is dependent choice. The proof here fixes one enumeration of Q\mathbb{Q} and, at every stage, takes the interval whose two rational endpoints have least index among those meeting the requirements, exactly the canonical selection of Every nonempty perfect subset of R\mathbb{R} is uncountable; the recursion is then a single application of The recursion theorem to a total map. Why the nested-interval proof of Baire category in R\mathbb{R} needs no choice, while the general complete-metric statement does states what that does and does not establish, and it is careful about the difference: nothing here bears on the Baire theorem for general complete metric spaces, whose strength over ZF is a quoted external result recorded in The Baire category theorem is four inequivalent statements over ZF and not proved in this library. That remark is the one item on the page resting on unproved material, and it is marked accordingly.

Measure. Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover) defines both notions by covers of intervals, countable for measure zero and finite for content zero, and records the working form in which only the partial sums of the lengths have to be checked. Two lemmas carry the whole quantitative content. If finitely many intervals cover a closed bounded interval [a,b][a,b], the sum of their lengths is at least bab - a says that finitely many intervals covering [a,b][a,b] have total length at least bab - a, by induction on their number; A sequence of intervals covering [a,b][a,b] has total length at least bab - a, so no interval of positive length has measure zero upgrades this to countable covers, using an enlargement to open intervals and the compactness of [a,b][a,b], and it is what forbids a null set from containing an interval of positive length. Without those two nothing on the measure side means anything: on this page 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, The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero and FALSE: every set of measure zero has content zero all rest on one or the other, and none of them is provable without them.

What is null and what is not. Every at most countable subset of R\mathbb{R} has measure zero covers the kk-th point of a listing by an interval of length ε2k1\varepsilon 2^{-k-1} and uses no choice at all. A countable union of measure-zero sets has measure zero, by countable choice does use countable choice, at exactly one step, to pick one cover for each of the given sets, and the item marks the step. A set of content zero has measure zero is the trivial direction between the two notions, and For a compact subset of R\mathbb{R}, measure zero and content zero coincide shows they agree on compact sets, which is the only case in which content zero is used on this pair of pages.

The Cantor set. The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds builds CC from the self-similar recursion Cn+1=13Cn(23+13Cn)C_{n+1} = \tfrac13 C_n \cup (\tfrac23 + \tfrac13 C_n), which is one application of the recursion theorem and needs no bookkeeping of the 2n2^n intervals at stage nn. The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}} identifies CC with the set of sums kak3k1\sum_k a_k 3^{-k-1} with every ak{0,2}a_k \in \{0,2\}, exhibits the bijection with {0,1}N\{0,1\}^{\mathbb{N}}, and extracts digits from a point of CC by a canonical recursion rather than by choosing them. 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 then collects what CC is: compact, of content zero and hence null, perfect, uncountable, nowhere dense, containing no interval with two distinct endpoints, and therefore having only single points as nonempty connected subsets. The phrase totally disconnected appears in no statement or title on this pair, since nothing in the reading order defines it; it survives only in the identifier of the companion item that works the property out, where it is a gloss; what is proved is the statement about connected subsets, via A subset of R\mathbb{R} is connected if and only if it is order-convex, that is, an interval.

The Smith-Volterra-Cantor set. The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals runs the same shape of construction while removing, at stage nn, an interval of fixed length 4n14^{-n-1} from each remaining piece, so that the total removed length is only 12\tfrac12. The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero proves it compact, perfect and nowhere dense, and proves that no cover of it by intervals has total length below 12\tfrac12. That is the quantitative statement this library can make: no outer measure is defined anywhere here, so nothing is said to have measure 12\tfrac12, and every assertion is about covers and their total lengths.

The Cantor function. The Cantor function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval halves the ternary digits of a point of CC, reads them in base two, and extends the result to [0,1][0,1] by c(x)=sup{γ(t):tC, tx}c(x) = \sup\{\gamma(t) : t \in C,\ t \le x\}; the supremum exists because the values lie in [0,1][0,1]. The Cantor function is well defined, satisfies c(x)c(y)c(x) \le c(y) whenever xyx \le y, is surjective onto [0,1][0,1], and is constant on every interval removed from the Cantor set proves that cc extends γ\gamma, that c(x)c(y)c(x) \le c(y) whenever xyx \le y, that cc is onto [0,1][0,1], and that cc is constant on the closure of every gap of CC, every point outside CC lying in such a gap. Nothing is claimed about continuity: no definition of continuity for a real function is available at this point in the reading order, so no statement about it, in either direction, appears anywhere on this page.

Five false statements close the page, each with a witness on the companion page: that nowhere dense implies measure zero, refuted by the Smith-Volterra-Cantor set; that measure zero implies nowhere dense, refuted by Q\mathbb{Q}; that measure zero implies content zero, refuted by Q[0,1]\mathbb{Q} \cap [0,1]; that Q\mathbb{Q} is GδG_\delta; and that the Cantor set is countable because only countably many intervals were removed. Read together they say that the two smallness notions of this page are independent in every direction, and that neither is a statement about cardinality.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R}

Definition

Let ARA \subseteq \mathbb{R}, with interior AA^{\circ} and closure A\overline{A} as in Interior, closure, boundary and exterior of a subset of R\mathbb{R}.

  • AA is nowhere dense when the interior of its closure is empty: (A)  =  .\big(\overline{A}\big)^{\circ} \;=\; \varnothing .
  • AA is meager, or of the first category, when there is a sequence (An)nN(A_n)_{n \in \mathbb{N}} of nowhere dense subsets of R\mathbb{R} with A  =  nNAn.A \;=\; \bigcup_{n \in \mathbb{N}} A_n .
  • AA is of the second category when it is not meager.
  • AA is residual (also comeager) when RA\mathbb{R} \setminus A is meager.

Why a sequence, and why that is the same as "an at most countable union". Sequences here are indexed by N\mathbb{N}, which contains 00. A finite family A0,,AmA_0, \dots, A_m of nowhere dense sets is turned into a sequence by setting An:=A_n := \varnothing for n>mn > m, and \varnothing is nowhere dense because =\overline{\varnothing} = \varnothing has empty interior; the empty family is handled the same way and gives A=A = \varnothing. So "a union of an at most countable family of nowhere dense sets" (Finite, countably infinite, countable, uncountable) and the displayed condition define the same class, and the sequence form is used below because it carries an explicit index and needs no case split.

Nowhere dense means exactly that the complement of the closure is dense. For ARA \subseteq \mathbb{R},

(A)=RA is dense in R.\big(\overline{A}\big)^{\circ} = \varnothing \quad \Longleftrightarrow \quad \mathbb{R} \setminus \overline{A} \text{ is dense in } \mathbb{R} .

Indeed, by the pointwise description of the interior (Interior, closure, boundary and exterior of a subset of R\mathbb{R}), (A)=(\overline{A})^{\circ} = \varnothing says that no xRx \in \mathbb{R} admits a real ε>0\varepsilon > 0 with Nε(x)AN_\varepsilon(x) \subseteq \overline{A} (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}), that is, that every Nε(x)N_\varepsilon(x) meets RA\mathbb{R} \setminus \overline{A}. By claim 1 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 that says precisely that every xRx \in \mathbb{R} is adherent to RA\mathbb{R} \setminus \overline{A}, that is, RA=R\overline{\mathbb{R} \setminus \overline{A}} = \mathbb{R}, which is density (Limit point, isolated point, adherent point, derived set, and dense subset of R\mathbb{R}).

A closed set is nowhere dense exactly when its interior is empty, since a closed set equals its own closure (claim 4 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, Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen). This is the form in which nowhere density is verified nearly every time below. (The phrase almost everywhere is avoided throughout this pair: it is a measure-theoretic term, and the only measure notion defined here is measure zero.)

Both classes are closed downwards. If BAB \subseteq A then BA\overline{B} \subseteq \overline{A} and hence (B)(A)(\overline{B})^{\circ} \subseteq (\overline{A})^{\circ} (Interior, closure, boundary and exterior of a subset of R\mathbb{R}), so a subset of a nowhere dense set is nowhere dense. If BA=nAnB \subseteq A = \bigcup_n A_n with each AnA_n nowhere dense, then B=n(AnB)B = \bigcup_n (A_n \cap B) and each AnBA_n \cap B is nowhere dense by the previous sentence, so a subset of a meager set is meager.

A union of two meager sets is meager. Let M=nAnM = \bigcup_n A_n and M=nBnM' = \bigcup_n B_n with all AnA_n and all BnB_n nowhere dense; fixing one witnessing sequence for MM and one for MM' is two instantiations of an existential statement, not a choice principle. Let J:N×NNJ : \mathbb{N} \times \mathbb{N} \to \mathbb{N} be a bijection (N×NN\mathbb{N} \times \mathbb{N} \approx \mathbb{N}) and define a sequence (Cj)jN(C_j)_{j \in \mathbb{N}} by

CJ(m,n)  :=  {Anm=0,Bnm0.C_{J(m,n)} \;:=\; \begin{cases} A_n & m = 0, \\ B_n & m \ne 0. \end{cases}

This is a total definition because JJ is a bijection, every CjC_j is nowhere dense, and jCj=MM\bigcup_j C_j = M \cup M', since An=CJ(0,n)A_n = C_{J(0,n)} and Bn=CJ(1,n)B_n = C_{J(1,n)} and every CjC_j is one of the AnA_n or one of the BnB_n.

Remarks

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

FσF_\sigma and GδG_\delta subsets of R\mathbb{R}

Definition

Let ARA \subseteq \mathbb{R}, with open and closed sets as in Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen.

  • AA is an FσF_\sigma set when there is a sequence (Fn)nN(F_n)_{n \in \mathbb{N}} of closed subsets of R\mathbb{R} with A  =  nNFn.A \;=\; \bigcup_{n \in \mathbb{N}} F_n .
  • AA is a GδG_\delta set when there is a sequence (Vn)nN(V_n)_{n \in \mathbb{N}} of open subsets of R\mathbb{R} with A  =  nNVn.A \;=\; \bigcap_{n \in \mathbb{N}} V_n .

The letters are the traditional ones: FF for fermé with σ\sigma for somme, GG for Gebiet with δ\delta for Durchschnitt.

The two classes are exchanged by complementation. AA is FσF_\sigma if and only if RA\mathbb{R} \setminus A is GδG_\delta. If A=nFnA = \bigcup_n F_n with each FnF_n closed, then RA=n(RFn)\mathbb{R} \setminus A = \bigcap_n (\mathbb{R} \setminus F_n) by De Morgan, and each RFn\mathbb{R} \setminus F_n is open by the definition of closedness (Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen); the converse is the same computation read backwards, using that the complement of an open set is closed, which is again Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen.

Every closed set is FσF_\sigma and every open set is GδG_\delta, by the constant sequence Fn:=AF_n := A, respectively Vn:=AV_n := A. As with Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R}, an at most countable family (Finite, countably infinite, countable, uncountable) may always be presented as a sequence: a finite list F0,,FmF_0, \dots, F_m of closed sets is extended by Fn:=FmF_n := F_m for n>mn > m, and a finite list of open sets likewise, so nothing is lost by indexing over N\mathbb{N}.

Remarks

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

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

CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Q\mathbb{Q} is FσF_\sigma, meager and not GδG_\delta, while the irrationals are GδG_\delta, residual and not FσF_\sigma

Statement

Write QR\mathbb{Q}_{\mathbb{R}} for the image of Q\mathbb{Q} in R\mathbb{R} under the canonical embedding qq^q \mapsto \hat q (The rationals embed densely in the reals), the set usually written Q\mathbb{Q} once the identification is made, and put X:=RQRX := \mathbb{R} \setminus \mathbb{Q}_{\mathbb{R}} for the irrationals. Then:

  1. QR\mathbb{Q}_{\mathbb{R}} is an FσF_\sigma set (FσF_\sigma and GδG_\delta subsets of R\mathbb{R}) and is meager (Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R});
  2. XX is a GδG_\delta set and is residual;
  3. QR\mathbb{Q}_{\mathbb{R}} is not a GδG_\delta set, and XX is not an FσF_\sigma set.

Claims 1 and 2 are bookkeeping. Claim 3 is the substance and is exactly where 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 spent: no argument from the algebra of open and closed sets alone can reach it, since QR\mathbb{Q}_{\mathbb{R}} and XX are interchanged by complementation while FσF_\sigma and GδG_\delta are, so any such argument would prove the same thing about both sets and about neither.

Facts & Assumptions

Given: The complete ordered field R\mathbb{R}, the set QRR\mathbb{Q}_{\mathbb{R}} \subseteq \mathbb{R} of rationals and its complement X=RQRX = \mathbb{R} \setminus \mathbb{Q}_{\mathbb{R}}.

[L1]

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}} (The rationals embed densely in the reals), and a composition of bijections is a bijection (Injection, surjection, bijection).

[L3]

UU is open when every point of it has a neighbourhood inside it, and FF is closed when RF\mathbb{R} \setminus F is open; Nε(x)=(xε,x+ε)N_\varepsilon(x) = (x - \varepsilon, x + \varepsilon) and xNε(x)x \in N_\varepsilon(x) (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}).

[L5]

AA is FσF_\sigma when it is the union of a sequence of closed sets and GδG_\delta when it is the intersection of a sequence of open sets; AA is FσF_\sigma if and only if RA\mathbb{R} \setminus A is GδG_\delta (FσF_\sigma and GδG_\delta subsets of R\mathbb{R}).

[L7]

There is a bijection J:N×NNJ : \mathbb{N} \times \mathbb{N} \to \mathbb{N} (N×NN\mathbb{N} \times \mathbb{N} \approx \mathbb{N}).

Proof

technique · contradiction
1.1

For cRc \in \mathbb{R} the singleton {c}\{c\} is closed and nowhere dense: its complement is open, since xcx \ne c gives Nxc(x)R{c}N_{|x-c|}(x) \subseteq \mathbb{R} \setminus \{c\} by [L3]; and its interior is empty, since for every real ε>0\varepsilon > 0 the point c+ε21c + \varepsilon \cdot 2^{-1} lies in Nε(c)N_\varepsilon(c) and differs from cc, so no neighbourhood is contained in {c}\{c\}, whence {c}\{c\} is a closed set with empty interior and [L4] applies.

L3L4
1.2

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

L1choose
2.1

QR=nN{e(n)}\mathbb{Q}_{\mathbb{R}} = \bigcup_{n \in \mathbb{N}} \{e(n)\}, since ee is onto QR\mathbb{Q}_{\mathbb{R}}; the sets {e(n)}\{e(n)\} are closed and nowhere dense by step 1.1, so QR\mathbb{Q}_{\mathbb{R}} is FσF_\sigma by [L5] and meager by [L4]. This is claim 1.

step 1.1step 1.2L4L5
3.1

Put Wn:=R{e(n)}W_n := \mathbb{R} \setminus \{e(n)\}, an open set by step 1.1 and [L3]. A real xx lies in nWn\bigcap_n W_n exactly when xe(n)x \ne e(n) for every nn, that is, exactly when xQRx \notin \mathbb{Q}_{\mathbb{R}}, so X=nWnX = \bigcap_n W_n and XX is GδG_\delta by [L5]; and RX=QR\mathbb{R} \setminus X = \mathbb{Q}_{\mathbb{R}} is meager by step 2.1, so XX is residual by [L4]. This is claim 2. Each WnW_n is also dense, since every Nε(x)N_\varepsilon(x) contains two distinct points and so meets R{e(n)}\mathbb{R} \setminus \{e(n)\}, by [L2] and [L3].

step 1.1step 1.2step 2.1L2L3L4L5
4.1

Suppose, for contradiction, that QR\mathbb{Q}_{\mathbb{R}} is GδG_\delta, and by [L5] fix a sequence (Vn)(V_n) of open sets with QR=nVn\mathbb{Q}_{\mathbb{R}} = \bigcap_n V_n. Each VnV_n contains QR\mathbb{Q}_{\mathbb{R}}, which is dense by [L2], so each VnV_n is dense by [L2]; and each WnW_n of step 3.1 is open and dense.

assume-contrastep 3.1L2L5choose
5.1

By [L7] fix a bijection J:N×NNJ : \mathbb{N} \times \mathbb{N} \to \mathbb{N} and define a sequence (Dj)(D_j) by DJ(m,n):=VnD_{J(m,n)} := V_n when m=0m = 0 and DJ(m,n):=WnD_{J(m,n)} := W_n when m0m \ne 0; this is total because JJ is a bijection, and every DjD_j is open and dense by step 4.1. Moreover jDj=(nVn)(nWn)=QRX=\bigcap_j D_j = \big(\bigcap_n V_n\big) \cap \big(\bigcap_n W_n\big) = \mathbb{Q}_{\mathbb{R}} \cap X = \varnothing, since every VnV_n and every WnW_n occurs among the DjD_j and every DjD_j is one of them.

step 3.1step 4.1L7
6.1

By [L6] the set jDj\bigcap_j D_j is dense, hence nonempty by [L2] and [L3], contradicting step 5.1. The assumption of step 4.1 is therefore untenable: QR\mathbb{Q}_{\mathbb{R}} is not GδG_\delta; and XX is not FσF_\sigma, since RX=QR\mathbb{R} \setminus X = \mathbb{Q}_{\mathbb{R}} would then be GδG_\delta by [L5]. This is claim 3.

step 4.1step 5.1L2L3L5L6discharge-contradiction

Remarks

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)

Definition

Throughout, R\mathbb{R} is the complete ordered field (Complete ordered field (least-upper-bound property)), intervals and their lengths are as in Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, and a sequence is a function on N\mathbb{N}, which contains 00. Let ARA \subseteq \mathbb{R}.

  • AA has measure zero, equivalently AA is null, when for every real ε>0\varepsilon > 0 there are sequences (ak)kN(a_k)_{k \in \mathbb{N}} and (bk)kN(b_k)_{k \in \mathbb{N}} of reals with akbka_k \le b_k for every kk, such that AkN[ak,bk]andk=0(bkak) converges with sum ε.A \subseteq \bigcup_{k \in \mathbb{N}} [a_k, b_k] \qquad \text{and} \qquad \sum_{k=0}^{\infty} (b_k - a_k) \text{ converges with sum } \le \varepsilon .
  • AA has content zero when for every real ε>0\varepsilon > 0 there are nNn \in \mathbb{N} and reals a0b0,,anbna_0 \le b_0, \dots, a_n \le b_n with Ajn[aj,bj]andj=0n(bjaj)ε.A \subseteq \bigcup_{j \le n} [a_j, b_j] \qquad \text{and} \qquad \sum_{j=0}^{n} (b_j - a_j) \le \varepsilon .

The number bkak0b_k - a_k \ge 0 is the length of [ak,bk][a_k,b_k] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length), and the sums are the series and the finite sums of Series, partial sums, convergence and the sum, divergence, and the tail series and Finite sums and finite products, by recursion.

Working form: only the partial sums have to be checked. All the terms bkakb_k - a_k are 0\ge 0, so by claim 2 of A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum the series converges exactly when its partial sums are bounded above, and its sum is then their supremum. Consequently, for a fixed ε>0\varepsilon > 0,

k=0(bkak) converges with sumεk<n(bkak)ε  for every nN,\sum_{k=0}^{\infty}(b_k - a_k) \text{ converges with sum} \le \varepsilon \quad \Longleftrightarrow \quad \sum_{k<n} (b_k - a_k) \le \varepsilon \ \text{ for every } n \in \mathbb{N},

since a supremum is ε\le \varepsilon exactly when ε\varepsilon is an upper bound of the set it is the supremum of (Complete ordered field (least-upper-bound property)). Every verification of nullity below checks the right-hand condition.

Closed intervals lose nothing. A bounded interval with endpoints aba \le b is contained in [a,b][a,b] and has the same length (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length), so a cover by intervals of any of the four bounded forms yields a cover by closed intervals with the same lengths. The definition is therefore stated with closed intervals once and for all. Covers by open intervals are a genuinely different demand, and passing to one costs a little extra length: the enlargement [ak,bk](akδk, bk+δk)[a_k,b_k] \subseteq (a_k - \delta_k,\ b_k + \delta_k) is carried out where it is needed, in A sequence of intervals covering [a,b][a,b] has total length at least bab - a, so no interval of positive length has measure zero and in For a compact subset of R\mathbb{R}, measure zero and content zero coincide.

Both notions are inherited by subsets. If BAB \subseteq A and AA is null, then any cover of AA covers BB, so BB is null; the same sentence with finite covers shows a subset of a set of content zero has content zero.

A finite cover is a countable cover, so content zero implies measure zero. Padding the list [a0,b0],,[an,bn][a_0,b_0], \dots, [a_n,b_n] with the degenerate intervals [0,0][0,0] for k>nk > n leaves the total length unchanged, by the splitting law for finite sums (Laws of finite sums and finite products). This is recorded as a lemma with its proof, A set of content zero has measure zero, because it is cited on its own.

Remarks

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

If finitely many intervals cover a closed bounded interval [a,b][a,b], the sum of their lengths is at least bab - a

Statement

Let a,bRa, b \in \mathbb{R} with aba \le b, let nNn \in \mathbb{N}, and let c0d0, , cndnc_0 \le d_0, \ \dots, \ c_n \le d_n be reals such that

[a,b]    jn[cj,dj],[a,b] \;\subseteq\; \bigcup_{j \le n} [c_j, d_j] ,

the intervals being those of Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length. Then

j=0n(djcj)    ba.\sum_{j=0}^{n} (d_j - c_j) \;\ge\; b - a .

The same bound holds for a cover by bounded intervals of any of the four bounded forms, since an interval with endpoints cdc \le d is contained in [c,d][c,d] and has the same length dcd - c (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length); replacing each covering interval by the closed interval on its endpoints changes no length and only enlarges the union. In particular a finite family of intervals of total length strictly below bab - a cannot cover [a,b][a,b], which is the form in which this lemma is used throughout the page.

This is the one quantitative fact underlying everything about measure zero here. Without it nothing forbids a set of measure zero from being all of [0,1][0,1]. Four items on this page rest on it: A sequence of intervals covering [a,b][a,b] has total length at least bab - a, so no interval of positive length has measure zero directly, and through that lemma 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, The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero and FALSE: every set of measure zero has content zero. Two of the worked items on the companion page rest on it as well.

Facts & Assumptions

Given: For nNn \in \mathbb{N} let P(n)P(n) be the assertion: for all reals aba \le b and all reals c0d0,,cndnc_0 \le d_0, \dots, c_n \le d_n with [a,b]jn[cj,dj][a,b] \subseteq \bigcup_{j \le n}[c_j,d_j], one has jn(djcj)ba\sum_{j \le n}(d_j - c_j) \ge b - a. The lemma is that P(n)P(n) holds for every nNn \in \mathbb{N}.

[L1]

[c,d]={x:cxd}[c,d] = \{\, x : c \le x \le d \,\}, its length is dc0d - c \ge 0 when cdc \le d, and [a,b][a,b] is nonempty exactly when aba \le b (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L2]

Finite sums: jntj=j<n+1tj\sum_{j \le n} t_j = \sum_{j < n+1} t_j with j<0tj=0\sum_{j<0} t_j = 0 and j<m+1tj=j<mtj+tm\sum_{j<m+1} t_j = \sum_{j<m} t_j + t_m; sums split as j<mtj=j<itj+j=im1tj\sum_{j<m} t_j = \sum_{j<i} t_j + \sum_{j=i}^{m-1} t_j for imi \le m, where j=im1tj=l<miti+l\sum_{j=i}^{m-1} t_j = \sum_{l < m-i} t_{i+l}; a sum of nonnegative terms is nonnegative, and each single term is at most the whole sum (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L3]

Induction on N\mathbb{N} (The principle of mathematical induction).

[L4]

Ordered-field arithmetic: 0<10 < 1, so 2:=1+1>02 := 1 + 1 > 0 and 0<t21<t0 < t \cdot 2^{-1} < t for t>0t > 0; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · induction
1.1

The assertion to be proved is P(n)P(n) for every nNn \in \mathbb{N}, with PP as in the Given, and the argument is an induction on nn using [L3].

givenL3induction
1.2

Base, n=0n = 0. Let aba \le b and [a,b][c0,d0][a,b] \subseteq [c_0,d_0] with c0d0c_0 \le d_0. Then a[a,b]a \in [a,b] and b[a,b]b \in [a,b] by [L1], so c0ac_0 \le a and bd0b \le d_0, whence d0c0bad_0 - c_0 \ge b - a by [L4]; and j0(djcj)=d0c0\sum_{j \le 0}(d_j - c_j) = d_0 - c_0 by [L2]. So P(0)P(0) holds.

baseL1L2L4
1.3

Induction hypothesis. Fix nNn \in \mathbb{N} and assume P(n)P(n).

ihgiven
2.1

The induction step: the two easy cases. Let aba \le b and let c0d0,,cn+1dn+1c_0 \le d_0, \dots, c_{n+1} \le d_{n+1} satisfy [a,b]jn+1[cj,dj][a,b] \subseteq \bigcup_{j \le n+1}[c_j,d_j]; write S:=jn+1(djcj)S := \sum_{j \le n+1}(d_j - c_j), a sum of nonnegative terms by [L1]. If a=ba = b then ba=0Sb - a = 0 \le S by [L2]. Otherwise a<ba < b; then a[a,b]a \in [a,b] by [L1], so there is in+1i \le n+1 with a[ci,di]a \in [c_i,d_i], that is ciadic_i \le a \le d_i, and we fix one such ii. If dibd_i \ge b then dicibad_i - c_i \ge b - a by [L4], and diciSd_i - c_i \le S by [L2], so SbaS \ge b - a. There remains the case a<ba < b and di<bd_i < b.

step 1.1L1L2L4choose
3.1

The induction step: the remaining case, where the ii-th interval is deleted. Assume a<ba < b and di<bd_i < b, and define n+1n+1 pairs by (cl,dl):=(cl,dl)(c'_l, d'_l) := (c_l, d_l) for l<il < i and (cl,dl):=(cl+1,dl+1)(c'_l, d'_l) := (c_{l+1}, d_{l+1}) for ilni \le l \le n; by the splitting law and the index-shift convention of [L2], S:=ln(dlcl)=S(dici)S' := \sum_{l \le n}(d'_l - c'_l) = S - (d_i - c_i). Let η\eta be any real with 0<ηbdi0 < \eta \le b - d_i and put c:=di+ηc := d_i + \eta, so di<cbd_i < c \le b. Every x[c,b]x \in [c,b] satisfies xc>dix \ge c > d_i, hence x[ci,di]x \notin [c_i,d_i] by [L1], and satisfies adi<xba \le d_i < x \le b, hence x[a,b]x \in [a,b]; so xx lies in some [cj,dj][c_j,d_j] with jij \ne i, that is in some [cl,dl][c'_l,d'_l]. Thus [c,b]ln[cl,dl][c,b] \subseteq \bigcup_{l \le n}[c'_l,d'_l] with cbc \le b, and step 1.3 gives Sbc=bdiηS' \ge b - c = b - d_i - \eta.

step 1.3step 2.1L1L2L4
4.1

Passing to the limiting value of η\eta, and the conclusion. In the case of step 3.1 one has SbdiS' \ge b - d_i: were S<bdiS' < b - d_i, the real η0:=(bdiS)21\eta_0 := (b - d_i - S') \cdot 2^{-1} would satisfy 0<η0<bdi0 < \eta_0 < b - d_i by [L4], so step 3.1 would give Sbdiη0=(bdi+S)21>SS' \ge b - d_i - \eta_0 = (b - d_i + S') \cdot 2^{-1} > S', which is impossible. Hence S=(dici)+S(dia)+(bdi)=baS = (d_i - c_i) + S' \ge (d_i - a) + (b - d_i) = b - a by [L4], using ciac_i \le a from step 2.1. Together with the cases settled in step 2.1 this proves P(n+1)P(n+1), so by [L3] P(n)P(n) holds for every nNn \in \mathbb{N}.

step 2.1step 3.1L2L3L4discharge-induction

Remarks

  • Why the argument does not simply take [di,b][d_i, b]. The point did_i itself may be covered by the deleted interval and by nothing else, so the remaining intervals need not cover [di,b][d_i,b]. They do cover [di+η,b][d_i + \eta,\, b] for every positive η\eta, and that is enough: the bound bdiηb - d_i - \eta holds for all such η\eta, and step 4.1 removes the η\eta. Every attempt to shortcut this step by taking a closed left endpoint at did_i is false as stated.

  • Degenerate covering intervals are allowed and cost nothing. A pair with cj=djc_j = d_j contributes the single point cjc_j and the length 00, so a list may always be padded to a longer one, which is what A set of content zero has measure zero does.

  • The bound is sharp. The single interval [a,b][a,b] covers [a,b][a,b] with total length exactly bab - a, and no cover does better.

  • This is not the Heine-Borel theorem, and it does not use it. The lemma is a statement about finitely many intervals and is proved by counting alone; compactness enters only when a countable cover has to be reduced to a finite one, which is what A sequence of intervals covering [a,b][a,b] has total length at least bab - a, so no interval of positive length has measure zero does with it.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

A sequence of intervals covering [a,b][a,b] has total length at least bab - a, so no interval of positive length has measure zero

Statement

Let a,bRa, b \in \mathbb{R} with aba \le b, let (ak)kN(a_k)_{k \in \mathbb{N}} and (bk)kN(b_k)_{k \in \mathbb{N}} be sequences of reals with akbka_k \le b_k for every kk, and suppose

[a,b]    kN[ak,bk].[a,b] \;\subseteq\; \bigcup_{k \in \mathbb{N}} [a_k, b_k] .

If MRM \in \mathbb{R} satisfies k<n(bkak)M\sum_{k < n} (b_k - a_k) \le M for every nNn \in \mathbb{N}, then

M    ba.M \;\ge\; b - a .

Consequently, if a<ba < b then no subset of R\mathbb{R} containing [a,b][a,b] has measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)); in particular none of the four bounded intervals [a,b][a,b], (a,b)(a,b), [a,b)[a,b), (a,b](a,b] with a<ba < b has measure zero, so measure zero is not a vacuous notion.

This is the countable strengthening of If finitely many intervals cover a closed bounded interval [a,b][a,b], the sum of their lengths is at least bab - a, and it is what compactness is spent on: the countable cover is enlarged to an open one at an arbitrarily small cost in total length, and A subset of R\mathbb{R} is compact if and only if it is closed and bounded reduces it to a finite cover, where the finite lemma applies.

Facts & Assumptions

Given: Reals aba \le b, sequences (ak)(a_k) and (bk)(b_k) with akbka_k \le b_k for every kk and [a,b]k[ak,bk][a,b] \subseteq \bigcup_k [a_k,b_k], and a real MM with k<n(bkak)M\sum_{k<n}(b_k - a_k) \le M for every nNn \in \mathbb{N}. Throughout, θ:=21\theta := 2^{-1}.

[L1]

Measure zero: AA is null when for every real ε>0\varepsilon > 0 there is a sequence of closed intervals covering AA all of whose partial total lengths are ε\le \varepsilon; a subset of a null set is null (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L2]

[c,d]={x:cxd}[c,d] = \{\, x : c \le x \le d \,\} has length dc0d - c \ge 0 when cdc \le d; (c,d)(c,d) is the open interval; a closed bounded interval is bounded (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Lower bound, bounded below, bounded set).

[L4]

A subset of R\mathbb{R} is compact exactly when it is closed and bounded (A subset of R\mathbb{R} is compact if and only if it is closed and bounded); from every family of open sets whose union contains a compact set, either the set is empty and the empty subfamily covers it, or one can extract mNm \in \mathbb{N} and members U0,,UmU_0, \dots, U_m of the family whose union already contains it (Open cover, subcover, compact subset of R\mathbb{R} (every open cover has a finite subcover), and sequentially compact subset).

[L5]

If [a,b]jn[cj,dj][a,b] \subseteq \bigcup_{j \le n}[c_j,d_j] with cjdjc_j \le d_j and aba \le b, then jn(djcj)ba\sum_{j \le n}(d_j - c_j) \ge b - a; the same holds for covering intervals of any bounded form with those endpoints (If finitely many intervals cover a closed bounded interval [a,b][a,b], the sum of their lengths is at least bab - a).

[L6]

Powers and the geometric series: θ0=1\theta^0 = 1 and θk+1=θkθ\theta^{k+1} = \theta^k \theta, all θk>0\theta^k > 0 for θ>0\theta > 0, and k=0θk=1/(1θ)=2\sum_{k=0}^{\infty} \theta^k = 1/(1-\theta) = 2 for θ=21\theta = 2^{-1}; a series of nonnegative terms has all its partial sums at most its sum (Integer powers ama^m, For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[L7]

Finite sums: additivity, scaling by a constant, splitting, and monotonicity in the terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L8]

Every finite list k0,,kmk_0, \dots, k_m of naturals has an upper bound KNK \in \mathbb{N}: by induction on mm, taking K=0K = 0 for the empty case and replacing KK by whichever of KK and km+1k_{m+1} is the larger, the order of N\mathbb{N} being total (The principle of mathematical induction, Trichotomy of the order on N\mathbb{N}, Order on the natural numbers).

[L9]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0 and 0<t21<t0 < t \cdot 2^{-1} < t for t>0t > 0; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · contradiction
1.1

Suppose, for contradiction, that M<baM < b - a. Since k<0(bkak)=0\sum_{k<0}(b_k - a_k) = 0 by [L7], we have M0M \ge 0, so ba>0b - a > 0 and a<ba < b. Put ε:=(baM)21\varepsilon := (b - a - M) \cdot 2^{-1}, a positive real by [L9].

assume-contragivenL7L9
2.1

For kNk \in \mathbb{N} put δk:=ε41θk\delta_k := \varepsilon \cdot 4^{-1} \cdot \theta^{k}, a positive real by [L6] and [L9], and Jk:=(akδk, bk+δk)J_k := (a_k - \delta_k,\ b_k + \delta_k). Each JkJ_k is an open set by [L3], and [ak,bk]Jk[a_k,b_k] \subseteq J_k because akδk<akxbk<bk+δka_k - \delta_k < a_k \le x \le b_k < b_k + \delta_k for x[ak,bk]x \in [a_k,b_k], by [L2] and [L9]. Hence [a,b]k[ak,bk]kJk[a,b] \subseteq \bigcup_k [a_k,b_k] \subseteq \bigcup_k J_k, so {Jk:kN}\{\, J_k : k \in \mathbb{N} \,\} is a family of open sets whose union contains [a,b][a,b]. The length of the interval with endpoints akδka_k - \delta_k and bk+δkb_k + \delta_k is (bkak)+2δk=(bkak)+ε21θk(b_k - a_k) + 2\delta_k = (b_k - a_k) + \varepsilon \cdot 2^{-1} \cdot \theta^{k}, by [L2] and [L9].

step 1.1givenL2L3L6L9
3.1

[a,b][a,b] is closed and bounded by [L2] and [L3], hence compact by [L4]; so there are mNm \in \mathbb{N} and members Jk0,,JkmJ_{k_0}, \dots, J_{k_m} of the family with [a,b]Jk0Jkm[a,b] \subseteq J_{k_0} \cup \dots \cup J_{k_m}. By [L8] fix KNK \in \mathbb{N} with ktKk_t \le K for every tmt \le m; then every JktJ_{k_t} occurs among J0,,JKJ_0, \dots, J_K, so [a,b]kKJk[a,b] \subseteq \bigcup_{k \le K} J_k.

step 2.1L2L3L4L8choose
4.1

By [L5], applied to the K+1K+1 intervals JkJ_k with endpoints akδkbk+δka_k - \delta_k \le b_k + \delta_k, one gets kK((bkak)+ε21θk)ba\sum_{k \le K} \big( (b_k - a_k) + \varepsilon \cdot 2^{-1} \cdot \theta^{k} \big) \ge b - a.

step 2.1step 3.1L5
5.1

The left-hand side is at most M+εM + \varepsilon: by [L7] it splits as k<K+1(bkak)+ε21k<K+1θk\sum_{k < K+1}(b_k - a_k) + \varepsilon \cdot 2^{-1} \sum_{k < K+1} \theta^{k}, the first sum is M\le M by hypothesis, and the second is ε212=ε\le \varepsilon \cdot 2^{-1} \cdot 2 = \varepsilon by [L6]. So baM+ε=(ba+M)21<bab - a \le M + \varepsilon = (b - a + M) \cdot 2^{-1} < b - a by [L9], which is impossible; the assumption of step 1.1 is untenable and MbaM \ge b - a. For the consequence, let a<ba < b and let A[a,b]A \supseteq [a,b] be null; taking ε1:=(ba)21>0\varepsilon_1 := (b-a) \cdot 2^{-1} > 0 in [L1] gives a sequence of closed intervals covering AA, hence covering [a,b][a,b], with every partial total length ε1\le \varepsilon_1, so what has just been proved gives (ba)21ba(b-a) \cdot 2^{-1} \ge b - a and hence ba0b - a \le 0 by [L9], contradicting a<ba < b. Finally each of (a,b)(a,b), [a,b)[a,b), (a,b](a,b] and [a,b][a,b] with a<ba < b contains [a,b][a', b'] for a:=a+(ba)41a' := a + (b-a) \cdot 4^{-1} and b:=b(ba)41b' := b - (b-a) \cdot 4^{-1}, which satisfy a<a<b<ba < a' < b' < b by [L9], so none of them is null.

step 1.1step 2.1step 4.1givenL1L6L7L9discharge-contradiction

Remarks

  • What the hypothesis k<n(bkak)M\sum_{k<n}(b_k - a_k) \le M says. It is the working form of "the total length is at most MM" recorded in Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover): for nonnegative terms, having all partial sums below MM is the same as convergence with sum below MM. Stating the lemma with partial sums avoids assuming convergence, and the conclusion is therefore also the statement that a cover of [a,b][a,b] whose total length diverges is no counterexample.

  • The ε\varepsilon is spent on making the cover open, not on the estimate. Enlarging [ak,bk][a_k,b_k] to (akδk,bk+δk)(a_k - \delta_k, b_k + \delta_k) adds 2δk2\delta_k to the kk-th length, and the geometric choice δk=εθk/4\delta_k = \varepsilon \theta^k/4 makes the whole added amount at most ε\varepsilon, however many intervals are used. This is the standard device and it recurs in For a compact subset of R\mathbb{R}, measure zero and content zero coincide.

  • Compactness is not optional here. Without it the finite lemma cannot be reached, and the countable statement is genuinely stronger than the finite one: Q[0,1]\mathbb{Q} \cap [0,1] is covered by countably many intervals of total length below any ε\varepsilon, and by no finite family of total length below 11 (Q[0,1]\mathbb{Q} \cap [0,1] has measure zero and not content zero, although it is bounded ).

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

Every at most countable subset of R\mathbb{R} has measure zero

Statement

Every at most countable set ARA \subseteq \mathbb{R} (Finite, countably infinite, countable, uncountable) has measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

The cover is explicit: the kk-th point of a listing of AA is put inside an interval of length ε2k1\varepsilon \cdot 2^{-k-1}, and the lengths sum to ε\varepsilon by For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges. No choice principle is used: a listing of AA is a single object, fixed once (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}), and everything after that is a formula in kk.

Facts & Assumptions

Given: An at most countable set ARA \subseteq \mathbb{R} and a real ε>0\varepsilon > 0. Throughout, θ:=21\theta := 2^{-1}.

[L1]

AA is null when for every real ε>0\varepsilon > 0 there are sequences (ak)(a_k), (bk)(b_k) with akbka_k \le b_k, Ak[ak,bk]A \subseteq \bigcup_k [a_k,b_k], and k<n(bkak)ε\sum_{k<n}(b_k - a_k) \le \varepsilon for every nNn \in \mathbb{N} (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L2]

[c,d]={x:cxd}[c,d] = \{\, x : c \le x \le d \,\} has length dcd - c when cdc \le d, and [c,c]={c}[c,c] = \{c\} has length 00 (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L3]

A nonempty at most countable set admits a surjection s:NAs : \mathbb{N} \to A (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}, Finite, countably infinite, countable, uncountable).

[L4]

Powers and the geometric series: θ0=1\theta^0 = 1, θk+1=θkθ\theta^{k+1} = \theta^k\theta, θk>0\theta^k > 0, and k=0θk=2\sum_{k=0}^{\infty}\theta^k = 2 for θ=21\theta = 2^{-1}; a series of nonnegative terms has all its partial sums at most its sum (Integer powers ama^m, For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[L5]

Finite sums: scaling by a constant, and k<n0=0\sum_{k<n} 0 = 0 (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L6]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0, 4>04 > 0 and t41>0t \cdot 4^{-1} > 0 for t>0t > 0; adding a constant and multiplying by a positive preserve an inequality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

Let the real ε>0\varepsilon > 0 be given. If A=A = \varnothing, the constant sequences ak:=0a_k := 0 and bk:=0b_k := 0 satisfy Ak[0,0]A \subseteq \bigcup_k [0,0] vacuously and k<n(bkak)=0ε\sum_{k<n}(b_k - a_k) = 0 \le \varepsilon for every nn by [L5], so the condition of [L1] holds at this ε\varepsilon. Assume from now on that AA \ne \varnothing and, by [L3], fix a surjection s:NAs : \mathbb{N} \to A.

givenL1L2L3L5choose
2.1

Put δk:=ε41θk\delta_k := \varepsilon \cdot 4^{-1} \cdot \theta^{k}, a positive real by [L4] and [L6], and ak:=s(k)δka_k := s(k) - \delta_k, bk:=s(k)+δkb_k := s(k) + \delta_k; then akbka_k \le b_k and s(k)[ak,bk]s(k) \in [a_k,b_k] by [L6], so A={s(k):kN}k[ak,bk]A = \{\, s(k) : k \in \mathbb{N} \,\} \subseteq \bigcup_k [a_k, b_k] by step 1.1. The length of [ak,bk][a_k,b_k] is bkak=2δk=ε21θkb_k - a_k = 2\delta_k = \varepsilon \cdot 2^{-1} \cdot \theta^{k} by [L2] and [L6].

step 1.1L2L4L6
3.1

For every nNn \in \mathbb{N}, k<n(bkak)=ε21k<nθkε212=ε\sum_{k<n}(b_k - a_k) = \varepsilon \cdot 2^{-1} \sum_{k<n}\theta^{k} \le \varepsilon \cdot 2^{-1} \cdot 2 = \varepsilon, using scaling from [L5] and the bound on the partial sums of the geometric series from [L4].

step 2.1L4L5L6
4.1

So for every real ε>0\varepsilon > 0 the sequences of step 2.1 cover AA with all partial total lengths at most ε\varepsilon, which by [L1] is exactly the statement that AA has measure zero; the empty case was settled in step 1.1.

step 1.1step 2.1step 3.1L1

Remarks

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

A countable union of measure-zero sets has measure zero, by countable choice

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)). Let (An)nN(A_n)_{n \in \mathbb{N}} be a sequence of subsets of R\mathbb{R}, each of measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)). Then

nNAnhas measure zero.\bigcup_{n \in \mathbb{N}} A_n \quad \text{has measure zero.}

By the padding convention of Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover) and Finite, countably infinite, countable, uncountable the same conclusion covers the union of an at most countable family of null sets, a finite family being extended by copies of \varnothing.

The hypothesis ACω\mathrm{AC}_\omega is spent at exactly one step, step 2.1 below, where one covering sequence is selected for every AnA_n at once. Each AnA_n has many such covers and nullity provides no rule for singling one out. Nothing else in the proof selects anything: the diagonal enumeration and the estimate are formulas.

Facts & Assumptions

Given: A sequence (An)nN(A_n)_{n \in \mathbb{N}} of null subsets of R\mathbb{R} and a real ε>0\varepsilon > 0. Throughout, θ:=21\theta := 2^{-1}.

[A1]

The Axiom of Countable Choice: every family (Xn)nN(X_n)_{n \in \mathbb{N}} of nonempty sets has a function ff on N\mathbb{N} with f(n)Xnf(n) \in X_n for every nn (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L1]

AA is null when for every real η>0\eta > 0 there are sequences (ak)(a_k), (bk)(b_k) with akbka_k \le b_k, Ak[ak,bk]A \subseteq \bigcup_k[a_k,b_k] and k<n(bkak)η\sum_{k<n}(b_k - a_k) \le \eta for every nn (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L2]

There is a bijection J:N×NNJ : \mathbb{N} \times \mathbb{N} \to \mathbb{N}, with inverse J1J^{-1} (N×NN\mathbb{N} \times \mathbb{N} \approx \mathbb{N}, Injection, surjection, bijection).

[L3]

Powers and the geometric series: θ0=1\theta^0 = 1, θm+1=θmθ\theta^{m+1} = \theta^m \theta, θm>0\theta^m > 0, and m=0θm=2\sum_{m=0}^{\infty}\theta^m = 2 for θ=21\theta = 2^{-1}; a series of nonnegative terms has all its partial sums at most its sum (Integer powers ama^m, For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[L4]

Finite sums: additivity, scaling, splitting and monotonicity in the terms; a sum of nonnegative terms is nonnegative and does not decrease when further nonnegative terms are adjoined, so a sum of finitely many nonnegative terms indexed injectively inside a finite rectangle is at most the sum over the whole rectangle (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L5]

Every finite list of naturals has an upper bound in N\mathbb{N}, by induction on its length and the totality of the order of N\mathbb{N} (The principle of mathematical induction, Trichotomy of the order on N\mathbb{N}, Order on the natural numbers).

[L6]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0 and t21>0t \cdot 2^{-1} > 0 for t>0t > 0; adding a constant and multiplying by a positive preserve an inequality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

Let the real ε>0\varepsilon > 0 be given and put εn:=εθn+1\varepsilon_n := \varepsilon \cdot \theta^{n+1} for nNn \in \mathbb{N}, a positive real by [L3] and [L6]. Let XnX_n be the set of all pairs of sequences ((ak),(bk))\big((a_k),(b_k)\big) with akbka_k \le b_k for every kk, Ank[ak,bk]A_n \subseteq \bigcup_k [a_k,b_k] and k<i(bkak)εn\sum_{k<i}(b_k - a_k) \le \varepsilon_n for every iNi \in \mathbb{N}. Each AnA_n is null, so each XnX_n is nonempty by [L1].

givenL1L3L6
2.1

By [A1] fix ff with f(n)Xnf(n) \in X_n for every nn, and write f(n)=((akn)k,(bkn)k)f(n) = \big((a^n_k)_k, (b^n_k)_k\big). This is the one and only application of countable choice in the proof.

step 1.1A1choose
3.1

By [L2] fix a bijection J:N×NNJ : \mathbb{N} \times \mathbb{N} \to \mathbb{N} and define sequences (cj)(c_j) and (dj)(d_j) by cJ(m,k):=akmc_{J(m,k)} := a^m_k and dJ(m,k):=bkmd_{J(m,k)} := b^m_k, which is a total definition because JJ is a bijection; then cjdjc_j \le d_j for every jj. Every xnAnx \in \bigcup_n A_n lies in some AmA_m, hence in some [akm,bkm]=[cJ(m,k),dJ(m,k)][a^m_k, b^m_k] = [c_{J(m,k)}, d_{J(m,k)}] by step 2.1, so nAnj[cj,dj]\bigcup_n A_n \subseteq \bigcup_j [c_j, d_j].

step 2.1L2
4.1

Fix iNi \in \mathbb{N}. The pairs J1(j)J^{-1}(j) for j<ij < i are finitely many and pairwise distinct, so by [L5] there is NNN \in \mathbb{N} with both coordinates of each of them at most NN; since all the terms djcjd_j - c_j are nonnegative, [L4] gives j<i(djcj)mN(kN(bkmakm))\sum_{j<i}(d_j - c_j) \le \sum_{m \le N}\Big(\sum_{k \le N}(b^m_k - a^m_k)\Big). For each mNm \le N the inner sum is k<N+1(bkmakm)εm\sum_{k < N+1}(b^m_k - a^m_k) \le \varepsilon_m by step 2.1, so the whole is at most mNεθm+1=εθm<N+1θmε212=ε\sum_{m \le N} \varepsilon \cdot \theta^{m+1} = \varepsilon \cdot \theta \sum_{m<N+1}\theta^{m} \le \varepsilon \cdot 2^{-1} \cdot 2 = \varepsilon, by [L3], [L4] and [L6].

step 3.1L3L4L5L6
5.1

Steps 3.1 and 4.1 exhibit, for the given ε>0\varepsilon > 0, sequences of closed intervals covering nAn\bigcup_n A_n with every partial total length at most ε\varepsilon; since ε>0\varepsilon > 0 was arbitrary, [L1] gives that nAn\bigcup_n A_n has measure zero.

step 1.1step 3.1step 4.1L1

Remarks

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

A set of content zero has measure zero

Statement

If ARA \subseteq \mathbb{R} has content zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)) then AA has measure zero.

The converse is false in general, and true for compact sets (For a compact subset of R\mathbb{R}, measure zero and content zero coincide); the witness for its failure is named in the remarks below.

Facts & Assumptions

Given: A set ARA \subseteq \mathbb{R} of content zero and a real ε>0\varepsilon > 0.

[L1]

AA has content zero when for every real η>0\eta > 0 there are nNn \in \mathbb{N} and reals a0b0,,anbna_0 \le b_0, \dots, a_n \le b_n with Ajn[aj,bj]A \subseteq \bigcup_{j \le n}[a_j,b_j] and jn(bjaj)η\sum_{j \le n}(b_j - a_j) \le \eta; AA is null when for every real η>0\eta > 0 there are sequences with the analogous properties and k<i(bkak)η\sum_{k<i}(b_k - a_k) \le \eta for every iNi \in \mathbb{N} (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L2]

[c,c]={c}[c,c] = \{c\} is an interval of length 00, and [c,d][c,d] has length dc0d - c \ge 0 for cdc \le d (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L3]

Finite sums: k<itk=k<n+1tk+k=n+1i1tk\sum_{k<i} t_k = \sum_{k<n+1} t_k + \sum_{k=n+1}^{i-1} t_k for n+1in + 1 \le i, a sum of nonnegative terms is nonnegative and is monotone in the number of nonnegative terms adjoined, and k<itkk<n+1tk\sum_{k<i} t_k \le \sum_{k<n+1} t_k whenever in+1i \le n+1 and the terms are nonnegative (Finite sums and finite products, by recursion, Laws of finite sums and finite products, Series, partial sums, convergence and the sum, divergence, and the tail series).

[L4]

Ordered-field arithmetic: adding a nonnegative quantity does not decrease a value, and the order is transitive (Order is preserved by adding a constant and by adding inequalities, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

Let the real ε>0\varepsilon > 0 be given; since AA has content zero, [L1] supplies nNn \in \mathbb{N} and reals a0b0,,anbna_0 \le b_0, \dots, a_n \le b_n with Ajn[aj,bj]A \subseteq \bigcup_{j \le n}[a_j,b_j] and jn(bjaj)ε\sum_{j \le n}(b_j - a_j) \le \varepsilon.

givenL1choose
2.1

Extend the finite list to sequences by putting ak:=0a_k := 0 and bk:=0b_k := 0 for k>nk > n; then akbka_k \le b_k for every kNk \in \mathbb{N}, the added intervals [0,0][0,0] have length 00 by [L2], and Ajn[aj,bj]kN[ak,bk]A \subseteq \bigcup_{j \le n}[a_j,b_j] \subseteq \bigcup_{k \in \mathbb{N}}[a_k,b_k].

step 1.1L2
3.1

For every iNi \in \mathbb{N} one has k<i(bkak)ε\sum_{k<i}(b_k - a_k) \le \varepsilon: all the terms are nonnegative by [L2], so for in+1i \le n+1 the sum is at most k<n+1(bkak)=jn(bjaj)ε\sum_{k<n+1}(b_k - a_k) = \sum_{j \le n}(b_j - a_j) \le \varepsilon by [L3] and step 1.1, and for i>n+1i > n+1 the sum equals k<n+1(bkak)\sum_{k<n+1}(b_k - a_k) plus a sum of terms all equal to 00, hence is again at most ε\varepsilon, by [L3] and [L4].

step 1.1step 2.1L2L3L4
4.1

So for every real ε>0\varepsilon > 0 there is a sequence of closed intervals covering AA with every partial total length at most ε\varepsilon, which by [L1] is exactly the statement that AA has measure zero.

step 2.1step 3.1L1

Remarks

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

For a compact subset of R\mathbb{R}, measure zero and content zero coincide

Statement

Let KRK \subseteq \mathbb{R} be compact (Open cover, subcover, compact subset of R\mathbb{R} (every open cover has a finite subcover), and sequentially compact subset), equivalently closed and bounded (A subset of R\mathbb{R} is compact if and only if it is closed and bounded). Then

K has measure zeroK has content zeroK \text{ has measure zero} \quad \Longleftrightarrow \quad K \text{ has content zero}

(Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

The implication from content zero to measure zero is A set of content zero has measure zero and needs no hypothesis on KK. The other direction is the one that uses compactness, and it uses it exactly as A sequence of intervals covering [a,b][a,b] has total length at least bab - a, so no interval of positive length has measure zero does: a countable cover is enlarged to an open cover at an arbitrarily small cost in total length, and compactness reduces the open cover to a finite one.

Facts & Assumptions

Given: A compact set KRK \subseteq \mathbb{R} and a real ε>0\varepsilon > 0. Throughout, θ:=21\theta := 2^{-1}.

[L1]

AA is null when for every real η>0\eta > 0 there are sequences (ak)(a_k), (bk)(b_k) with akbka_k \le b_k, Ak[ak,bk]A \subseteq \bigcup_k[a_k,b_k] and k<i(bkak)η\sum_{k<i}(b_k - a_k) \le \eta for every ii; AA has content zero when the same holds with a finite list (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L2]

A set of content zero is null (A set of content zero has measure zero).

[L3]

[c,d][c,d] has length dc0d - c \ge 0 for cdc \le d; (c,d)(c,d) is the open interval with the same endpoints and is contained in [c,d][c,d] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L5]

KK is compact: from every family of open sets whose union contains KK, either K=K = \varnothing and the empty subfamily covers it, or there are mNm \in \mathbb{N} and members U0,,UmU_0, \dots, U_m of the family whose union contains KK; compactness is equivalent to being closed and bounded (Open cover, subcover, compact subset of R\mathbb{R} (every open cover has a finite subcover), and sequentially compact subset, A subset of R\mathbb{R} is compact if and only if it is closed and bounded).

[L6]

Powers and the geometric series: θ0=1\theta^0 = 1, θk+1=θkθ\theta^{k+1} = \theta^k\theta, θk>0\theta^k > 0, and k=0θk=2\sum_{k=0}^{\infty}\theta^k = 2 for θ=21\theta = 2^{-1}; a series of nonnegative terms has all its partial sums at most its sum (Integer powers ama^m, For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Series, partial sums, convergence and the sum, divergence, and the tail series, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[L7]

Finite sums: additivity, scaling, splitting and monotonicity in the terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L8]

Every finite list of naturals has an upper bound in N\mathbb{N}, by induction on its length and the totality of the order of N\mathbb{N} (The principle of mathematical induction, Trichotomy of the order on N\mathbb{N}, Order on the natural numbers).

[L9]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0, 4>04 > 0, 8>08 > 0 and t81>0t \cdot 8^{-1} > 0 for t>0t > 0; adding a constant and multiplying by a positive preserve an inequality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

One direction is immediate: if KK has content zero then KK is null by [L2], with no hypothesis on KK used. It remains to prove the converse for compact KK.

L2suffices: only the forward direction remains
1.2

If K=K = \varnothing, then for every real ε>0\varepsilon > 0 the single interval [0,0][0,0] covers KK and has total length 0ε0 \le \varepsilon, so KK has content zero by [L1]. Hence suppose KK \ne \varnothing for the rest of the proof.

L1cases
2.1

Assume KK is null and let the real ε>0\varepsilon > 0 be given. By [L1] applied with η:=ε21>0\eta := \varepsilon \cdot 2^{-1} > 0 fix sequences (ak)(a_k), (bk)(b_k) with akbka_k \le b_k, Kk[ak,bk]K \subseteq \bigcup_k [a_k,b_k] and k<i(bkak)ε21\sum_{k<i}(b_k - a_k) \le \varepsilon \cdot 2^{-1} for every iNi \in \mathbb{N}.

step 1.1givenL1L9choose
3.1

Put δk:=ε81θk\delta_k := \varepsilon \cdot 8^{-1} \cdot \theta^{k}, a positive real by [L6] and [L9], and Jk:=(akδk, bk+δk)J_k := (a_k - \delta_k,\ b_k + \delta_k), an open set by [L4] containing [ak,bk][a_k,b_k] by [L3] and [L9]. Hence {Jk:kN}\{\, J_k : k \in \mathbb{N} \,\} is a family of open sets whose union contains KK, and the closed interval [akδk, bk+δk][a_k - \delta_k,\ b_k + \delta_k] has length (bkak)+2δk=(bkak)+ε41θk(b_k - a_k) + 2\delta_k = (b_k - a_k) + \varepsilon \cdot 4^{-1} \cdot \theta^{k} by [L3] and [L9].

step 2.1L3L4L6L9
4.1

By [L5] there are mNm \in \mathbb{N} and members Jk0,,JkmJ_{k_0}, \dots, J_{k_m} of that family covering KK, and by [L8] there is NNN \in \mathbb{N} with ktNk_t \le N for every tmt \le m; then KkNJkkN[akδk, bk+δk]K \subseteq \bigcup_{k \le N} J_k \subseteq \bigcup_{k \le N}[a_k - \delta_k,\ b_k + \delta_k] by [L3].

step 1.2step 3.1L3L5L8choose
5.1

The total length of that finite list is kN((bkak)+ε41θk)=k<N+1(bkak)+ε41k<N+1θkε21+ε412=ε\sum_{k \le N}\big((b_k - a_k) + \varepsilon \cdot 4^{-1}\theta^{k}\big) = \sum_{k<N+1}(b_k - a_k) + \varepsilon \cdot 4^{-1}\sum_{k<N+1}\theta^{k} \le \varepsilon \cdot 2^{-1} + \varepsilon \cdot 4^{-1} \cdot 2 = \varepsilon, by [L7], step 2.1, [L6] and [L9].

step 2.1step 3.1step 4.1L6L7L9
6.1

So for every real ε>0\varepsilon > 0 the finite list of step 4.1 covers KK with total length at most ε\varepsilon, which by [L1] is exactly the statement that KK has content zero; together with step 1.1 the two notions coincide on compact sets.

step 1.1step 1.2step 4.1step 5.1L1

Remarks

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds

Definition

For SRS \subseteq \mathbb{R} write

13S  :=  {x31:xS},23+13S  :=  {231+x31:xS},\tfrac{1}{3} S \;:=\; \{\, x \cdot 3^{-1} : x \in S \,\}, \qquad \tfrac{2}{3} + \tfrac{1}{3} S \;:=\; \{\, 2 \cdot 3^{-1} + x \cdot 3^{-1} : x \in S \,\},

and let F:P(R)P(R)F : \mathcal{P}(\mathbb{R}) \to \mathcal{P}(\mathbb{R}) be

F(S)  :=  13S  (23+13S).F(S) \;:=\; \tfrac{1}{3} S \ \cup \ \big(\tfrac{2}{3} + \tfrac{1}{3} S\big).

By the recursion theorem (The recursion theorem), applied to the set P(R)\mathcal{P}(\mathbb{R}), the starting element [0,1][0,1] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) and the function FF, there is a unique family (Cn)nN(C_n)_{n \in \mathbb{N}} of subsets of R\mathbb{R} with

C0=[0,1],Cn+1=F(Cn)=13Cn(23+13Cn)(nN).C_0 = [0,1], \qquad C_{n+1} = F(C_n) = \tfrac{1}{3}C_n \cup \big(\tfrac{2}{3} + \tfrac{1}{3}C_n\big) \quad (n \in \mathbb{N}).

The Cantor middle-thirds set is

C  :=  nNCn.C \;:=\; \bigcap_{n \in \mathbb{N}} C_n .

The first step really is the removal of the open middle third. Directly from the clauses,

C1  =  13[0,1](23+13[0,1])  =  [0,13][23,1]  =  [0,1](13,23),C_1 \;=\; \tfrac{1}{3}[0,1] \cup \big(\tfrac{2}{3} + \tfrac{1}{3}[0,1]\big) \;=\; [0, \tfrac13] \cup [\tfrac23, 1] \;=\; [0,1] \setminus (\tfrac13, \tfrac23),

the middle equality because xx31x \mapsto x \cdot 3^{-1} is an order isomorphism of R\mathbb{R} onto itself with inverse x3xx \mapsto 3x (Ordered field, Sign rules for products and monotonicity of multiplication), and the last because 0x10 \le x \le 1 splits, by totality of the order, into x13x \le \tfrac13, 13<x<23\tfrac13 < x < \tfrac23 and x23x \ge \tfrac23. The recursion then performs the same operation inside each of the two scaled copies, which is what "removing the open middle thirds" names.

Every CnC_n lies in [0,1][0,1], by induction on nn (The principle of mathematical induction): C0=[0,1]C_0 = [0,1]; and if Cn[0,1]C_n \subseteq [0,1] then 13Cn[0,13]\tfrac13 C_n \subseteq [0,\tfrac13] and 23+13Cn[23,1]\tfrac23 + \tfrac13 C_n \subseteq [\tfrac23, 1], so Cn+1[0,1]C_{n+1} \subseteq [0,1] (Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication). The same computation shows that the two halves of Cn+1C_{n+1} are disjoint, the first lying in [0,13][0,\tfrac13] and the second in [23,1][\tfrac23,1], and 13<23\tfrac13 < \tfrac23 (The multiplicative identity is positive).

The family is nested, Cn+1CnC_{n+1} \subseteq C_n for every nn, again by induction. For n=0n = 0 this is C1=[0,13][23,1][0,1]C_1 = [0,\tfrac13] \cup [\tfrac23,1] \subseteq [0,1]. And FF is monotone, in the sense that STS \subseteq T implies F(S)F(T)F(S) \subseteq F(T), directly from the displayed description of FF; so Cn+1CnC_{n+1} \subseteq C_n gives Cn+2=F(Cn+1)F(Cn)=Cn+1C_{n+2} = F(C_{n+1}) \subseteq F(C_n) = C_{n+1}. Consequently C=nCnCmC = \bigcap_n C_n \subseteq C_m for every mm, and nCn+1=nCn=C\bigcap_n C_{n+1} = \bigcap_n C_n = C.

Powers. Here 3n3^{-n} means (31)n(3^{-1})^n, the integer power of Integer powers ama^m, so that 30=13^{0} = 1, 3(n+1)3=3n3^{-(n+1)} \cdot 3 = 3^{-n} and 3n>03^{-n} > 0 for every nn (Laws of integer exponents, Complete ordered field (least-upper-bound property)).

Remarks

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}

Statement

Let DD be the set of sequences a:N{0,2}a : \mathbb{N} \to \{0,2\} (Sequences of reals: bounded, eventually, frequently, tails, subsequences), the two values being the real numbers 00 and 22. For aDa \in D the series k0ak3k1\sum_{k \ge 0} a_k 3^{-k-1} converges (Series, partial sums, convergence and the sum, divergence, and the tail series); write

Φ(a)  :=  k=0ak3k1.\Phi(a) \;:=\; \sum_{k=0}^{\infty} a_k 3^{-k-1} .

Then, with CC and (Cn)(C_n) as in The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds:

  1. Φ(a)[0,1]\Phi(a) \in [0,1] for every aDa \in D, and C={Φ(a):aD}C = \{\, \Phi(a) : a \in D \,\};
  2. Φ\Phi is injective, so Φ\Phi is a bijection from DD onto CC (Injection, surjection, bijection);
  3. consequently bΦ((2bk)k)b \mapsto \Phi\big((2 b_k)_k\big) is a bijection from {0,1}N\{0,1\}^{\mathbb{N}}, the set of sequences with values in {0,1}\{0,1\}, onto CC;
  4. C=13C(23+13C)C = \tfrac13 C \cup \big(\tfrac23 + \tfrac13 C\big), and the two sets on the right are disjoint.

On the indexing. The digit aka_k carries the weight 3k13^{-k-1}, so the series starts at k=0k = 0 with the term a0/3a_0/3; written with the classical 11-based index it reads k1ak3k\sum_{k \ge 1} a_k 3^{-k}, which is the form in the title. Sequences in this library are functions on N\mathbb{N} and N\mathbb{N} contains 00 (Sequences of reals: bounded, eventually, frequently, tails, subsequences), so the 00-based form is the one used throughout the proof.

Facts & Assumptions

Given: The sets CnC_n and CC of The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds, the set DD of sequences with values in {0,2}\{0,2\}, and for aDa \in D the shifted sequence σa\sigma a defined by (σa)k:=ak+1(\sigma a)_k := a_{k+1}, which again lies in DD.

[L1]

The Cantor set: C0=[0,1]C_0 = [0,1], Cn+1=13Cn(23+13Cn)C_{n+1} = \tfrac13 C_n \cup (\tfrac23 + \tfrac13 C_n), C=nCn=nCn+1C = \bigcap_n C_n = \bigcap_n C_{n+1}, every Cn[0,1]C_n \subseteq [0,1], the two halves of Cn+1C_{n+1} lie in [0,13][0,\tfrac13] and in [23,1][\tfrac23,1] respectively and are disjoint, and 3n3^{-n} denotes (31)n(3^{-1})^n (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L2]

Series: partial sums sn=k<ntks_n = \sum_{k<n} t_k, convergence of (sn)(s_n), the sum as its limit, the tail clause kmtk\sum_{k \ge m} t_k and the identity k<n+1tk=t0+j<ntj+1\sum_{k<n+1} t_k = t_0 + \sum_{j<n} t_{j+1} (Series, partial sums, convergence and the sum, divergence, and the tail series, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L3]

A series of nonnegative terms converges exactly when its partial sums are bounded above, its sum is then their supremum, every partial sum is at most the sum, and a convergent series of nonnegative terms has sum 0\ge 0 (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[L4]

k=03k=1/(131)=321\sum_{k=0}^{\infty} 3^{-k} = 1/(1 - 3^{-1}) = 3 \cdot 2^{-1} (For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Integer powers ama^m, Laws of integer exponents).

[L5]

Convergent series add and scale termwise (Convergent series add and scale termwise).

[L6]

Recursion and induction on N\mathbb{N} (The recursion theorem, The principle of mathematical induction).

[L7]

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

[L8]

3n03^{-n} \to 0 (For r<1|r| < 1 the sequence rkr^k is null, and for r>1|r| > 1 the sequence rk|r|^k diverges to ++\infty); convergence is tested against rational ε>0\varepsilon > 0 and a convergent sequence has exactly one limit (Limits and Cauchy sequences of reals, A sequence has at most one limit); z0|z| \ge 0 and z=z|z| = z for z0z \ge 0 (Basic properties of the absolute value).

[L9]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0 and 3>03 > 0 and 31>03^{-1} > 0, and 31<2313^{-1} < 2 \cdot 3^{-1}; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

Φ\Phi is well defined and takes values in [0,1][0,1]. For aDa \in D every term ak3k1a_k 3^{-k-1} is 0\ge 0 by [L1] and [L9], and for every nn the partial sum satisfies k<nak3k1k<n2313k=231k<n3k231321=1\sum_{k<n} a_k 3^{-k-1} \le \sum_{k<n} 2 \cdot 3^{-1} \cdot 3^{-k} = 2 \cdot 3^{-1} \sum_{k<n} 3^{-k} \le 2 \cdot 3^{-1} \cdot 3 \cdot 2^{-1} = 1, by [L3], [L4] and [L9]. So by [L3] the series converges, its sum Φ(a)\Phi(a) satisfies 0Φ(a)10 \le \Phi(a) \le 1, and Φ(a)[0,1]\Phi(a) \in [0,1] by [L1].

givenL1L3L4L9
1.2

Shift identity: Φ(a)=a031+31Φ(σa)\Phi(a) = a_0 \cdot 3^{-1} + 3^{-1}\Phi(\sigma a) for every aDa \in D. Indeed by [L2] the partial sums satisfy k<n+1ak3k1=a031+j<naj+13j2=a031+31j<naj+13j1\sum_{k<n+1} a_k 3^{-k-1} = a_0 3^{-1} + \sum_{j<n} a_{j+1} 3^{-j-2} = a_0 3^{-1} + 3^{-1}\sum_{j<n} a_{j+1}3^{-j-1}, using 3j2=313j13^{-j-2} = 3^{-1}\cdot 3^{-j-1} from [L1] and [L9]; letting nn grow and using [L5] and [L2] gives the identity.

givenL1L2L5L9
1.3

Self-similarity of CC, claim 4. If yCy \in C then yCny \in C_n for every nn, so y3113CnCn+1y \cdot 3^{-1} \in \tfrac13 C_n \subseteq C_{n+1} and 231+y3123+13CnCn+12 \cdot 3^{-1} + y \cdot 3^{-1} \in \tfrac23 + \tfrac13 C_n \subseteq C_{n+1} for every nn, whence both lie in nCn+1=C\bigcap_n C_{n+1} = C by [L1]; this gives the inclusion \supseteq. Conversely let xCx \in C, so xCn+1x \in C_{n+1} for every nn. By [L1] the first half of Cn+1C_{n+1} lies in [0,13][0,\tfrac13] and the second in [23,1][\tfrac23,1], and 13<23\tfrac13 < \tfrac23 by [L9]. If x13x \le \tfrac13 then x[23,1]x \notin [\tfrac23,1], so for every nn one has x13Cnx \in \tfrac13 C_n, that is 3xCn3x \in C_n; hence 3xC3x \in C and x13Cx \in \tfrac13 C. If x>13x > \tfrac13 then x[0,13]x \notin [0,\tfrac13], so for every nn one has x23+13Cnx \in \tfrac23 + \tfrac13 C_n, that is 3x2Cn3x - 2 \in C_n; hence 3x2C3x - 2 \in C and x23+13Cx \in \tfrac23 + \tfrac13 C. Disjointness is [L1] and [L9], since 13C[0,13]\tfrac13 C \subseteq [0,\tfrac13] and 23+13C[23,1]\tfrac23 + \tfrac13 C \subseteq [\tfrac23,1].

L1L9
2.1

Φ(a)C\Phi(a) \in C for every aDa \in D. By induction on nn ([L6]) the statement "for every aDa \in D, Φ(a)Cn\Phi(a) \in C_n" holds for every nn: at n=0n = 0 it is step 1.1 and [L1]; and if it holds at nn, then for aDa \in D the value a0a_0 is 00 or 22, so step 1.2 gives Φ(a)=31Φ(σa)13Cn\Phi(a) = 3^{-1}\Phi(\sigma a) \in \tfrac13 C_n in the first case and Φ(a)=231+31Φ(σa)23+13Cn\Phi(a) = 2 \cdot 3^{-1} + 3^{-1}\Phi(\sigma a) \in \tfrac23 + \tfrac13 C_n in the second, so Φ(a)Cn+1\Phi(a) \in C_{n+1} by [L1]. Hence Φ(a)nCn=C\Phi(a) \in \bigcap_n C_n = C.

step 1.1step 1.2L1L6
2.2

The digit recursion. Fix xCx \in C and let T:RRT : \mathbb{R} \to \mathbb{R} be T(y):=3yT(y) := 3y for y31y \le 3^{-1} and T(y):=3y2T(y) := 3y - 2 for y>31y > 3^{-1}, a definition by cases on the total order ([L9]) and so a genuine function. By [L6] there is y:NRy : \mathbb{N} \to \mathbb{R} with y0=xy_0 = x and yn+1=T(yn)y_{n+1} = T(y_n); put an:=0a_n := 0 when yn31y_n \le 3^{-1} and an:=2a_n := 2 otherwise, so that aDa \in D and yn+1=3ynany_{n+1} = 3 y_n - a_n for every nn. Every yny_n lies in CC, by induction on nn: y0=xCy_0 = x \in C; and if ynCy_n \in C then, by step 1.3, either yn13C[0,13]y_n \in \tfrac13 C \subseteq [0,\tfrac13] or yn23+13C[23,1]y_n \in \tfrac23 + \tfrac13 C \subseteq [\tfrac23,1], and these two cases are exactly yn13y_n \le \tfrac13 and yn>13y_n > \tfrac13 by [L9]; in the first yn=z31y_n = z \cdot 3^{-1} with zCz \in C and yn+1=3yn=zCy_{n+1} = 3y_n = z \in C, in the second yn=231+z31y_n = 2 \cdot 3^{-1} + z \cdot 3^{-1} with zCz \in C and yn+1=3yn2=zCy_{n+1} = 3y_n - 2 = z \in C.

step 1.3L1L6L9
2.3

Φ\Phi is injective. Let a,bDa, b \in D with aba \ne b; the set of kk with akbka_k \ne b_k is a nonempty subset of N\mathbb{N}, so by [L7] it has a least element kk, and by symmetry we may take ak=0a_k = 0 and bk=2b_k = 2. By [L5], Φ(b)Φ(a)=j0(bjaj)3j1\Phi(b) - \Phi(a) = \sum_{j \ge 0}(b_j - a_j)3^{-j-1}, and the terms with j<kj < k vanish, so by [L2] this equals 23k1+R2 \cdot 3^{-k-1} + R with R:=jk+1(bjaj)3j1R := \sum_{j \ge k+1}(b_j - a_j)3^{-j-1}. Every bjajb_j - a_j is at least 2-2, so the series jk+1((bjaj)+2)3j1\sum_{j \ge k+1}\big((b_j - a_j) + 2\big)3^{-j-1} has nonnegative terms and hence nonnegative sum by [L3], giving Rjk+123j1=23k2321=3k1R \ge -\sum_{j \ge k+1} 2 \cdot 3^{-j-1} = -2 \cdot 3^{-k-2} \cdot 3 \cdot 2^{-1} = -3^{-k-1} by [L2], [L4], [L5] and [L9]. Therefore Φ(b)Φ(a)23k13k1=3k1>0\Phi(b) - \Phi(a) \ge 2 \cdot 3^{-k-1} - 3^{-k-1} = 3^{-k-1} > 0 and Φ(a)Φ(b)\Phi(a) \ne \Phi(b).

step 1.1L2L3L4L5L7L9
3.1

The value is recovered from the digits. With xx, (yn)(y_n) and aa as in step 2.2, put sn:=k<nak3k1s_n := \sum_{k<n} a_k 3^{-k-1}. Then x=sn+3nynx = s_n + 3^{-n} y_n for every nn, by induction on nn ([L6]): at n=0n = 0 both sides are xx, since s0=0s_0 = 0 by [L2] and 30=13^{0} = 1; and if x=sn+3nynx = s_n + 3^{-n}y_n then sn+1+3n1yn+1=sn+an3n1+3n1(3ynan)=sn+3nyn=xs_{n+1} + 3^{-n-1}y_{n+1} = s_n + a_n 3^{-n-1} + 3^{-n-1}(3y_n - a_n) = s_n + 3^{-n}y_n = x, using [L1], [L2] and [L9].

step 2.2L1L2L6L9
4.1

Hence x=Φ(a)x = \Phi(a), so CΦ[D]C \subseteq \Phi[D]. Every yny_n lies in C[0,1]C \subseteq [0,1] by step 2.2 and [L1], so 0xsn=3nyn3n0 \le x - s_n = 3^{-n}y_n \le 3^{-n} by step 3.1 and [L9]. Given a rational ε>0\varepsilon > 0, [L8] supplies NN with 3n<ε3^{-n} < \varepsilon for all nNn \ge N, and then snx=xsn3n<ε|s_n - x| = x - s_n \le 3^{-n} < \varepsilon by [L8]; so snxs_n \to x. But snΦ(a)s_n \to \Phi(a) by [L2], since (sn)(s_n) is the sequence of partial sums of the series defining Φ(a)\Phi(a), and limits are unique by [L8]; therefore x=Φ(a)x = \Phi(a) with aDa \in D.

step 2.2step 3.1L1L2L8L9
5.1

By steps 2.1 and 4.1 the image of DD under Φ\Phi is exactly CC, which with step 1.1 is claim 1; step 2.3 is claim 2, so Φ\Phi is a surjection from DD onto CC that is injective, that is, a bijection (Injection, surjection, bijection); the map b(2bk)kb \mapsto (2b_k)_k is a bijection from {0,1}N\{0,1\}^{\mathbb{N}} onto DD, with inverse a(ak21)ka \mapsto (a_k \cdot 2^{-1})_k by [L9], and a composition of bijections is a bijection, which is claim 3; and step 1.3 is claim 4.

step 1.1step 1.3step 2.1step 2.3step 4.1L9

Remarks

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

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

Statement

Let CC be the Cantor set (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds). Then:

  1. CC is closed and bounded, hence compact (A subset of R\mathbb{R} is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of R\mathbb{R} (every open cover has a finite subcover), and sequentially compact subset);
  2. CC has content zero, and therefore measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover));
  3. CC is perfect (Perfect subset of R\mathbb{R}: closed with no isolated points);
  4. CC is uncountable (Finite, countably infinite, countable, uncountable);
  5. CC contains no interval with two distinct endpoints, and is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R});
  6. every nonempty connected subset of CC (Separated sets, disconnection, and connected subset of R\mathbb{R}) is a single point.

Claim 6 is what the phrase "totally disconnected" names elsewhere; that phrase is not used here, because no definition of total disconnectedness exists at this point in the reading order. What is proved is exactly the displayed statement, and it is obtained from claim 5 through A subset of R\mathbb{R} is connected if and only if it is order-convex, that is, an interval.

Facts & Assumptions

[L1]

C0=[0,1]C_0 = [0,1], Cn+1=13Cn(23+13Cn)C_{n+1} = \tfrac13 C_n \cup (\tfrac23 + \tfrac13 C_n), C=nCnCmC = \bigcap_n C_n \subseteq C_m for every mm, every Cn[0,1]C_n \subseteq [0,1], 0C0 \in C, and 3n=(31)n3^{-n} = (3^{-1})^n (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Integer powers ama^m, Laws of integer exponents).

[L3]

[c,d][c,d] is a closed set and a bounded interval, (c,d)(c,d) is open, Nε(x)=(xε,x+ε)N_\varepsilon(x) = (x-\varepsilon, x+\varepsilon), and every open set contains a neighbourhood of each of its points (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, 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}).

[L4]

Finite unions of closed sets are closed, and an intersection of a nonempty family of closed sets is closed (Arbitrary unions and finite intersections of open subsets of R\mathbb{R} are open, and dually for closed sets).

[L10]

rk0|r|^k \to 0 for r<1|r| < 1 (For r<1|r| < 1 the sequence rkr^k is null, and for r>1|r| > 1 the sequence rk|r|^k diverges to ++\infty); convergence to 00 is tested against rational ε>0\varepsilon > 0 (Limits and Cauchy sequences of reals); z0|z| \ge 0, z=z|z| = z for z0z \ge 0, and uv=uv|uv| = |u||v| (Basic properties of the absolute value).

[L11]

Induction on N\mathbb{N} (The principle of mathematical induction); finite sums split, scale and are monotone in their terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L12]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0, 3>03 > 0, 31>03^{-1} > 0 and 0<231<10 < 2 \cdot 3^{-1} < 1; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

CC is compact, claim 1. First, for λ0\lambda \ne 0 and cRc \in \mathbb{R} the set λS+c:={λs+c:sS}\lambda S + c := \{\lambda s + c : s \in S\} is closed whenever SS is: if xλS+cx \notin \lambda S + c then (xc)λ1S(x - c)\lambda^{-1} \notin S, so by [L3] there is a real η>0\eta > 0 with Nη((xc)λ1)S=N_\eta((x-c)\lambda^{-1}) \cap S = \varnothing, and every zz with zx<λη|z - x| < |\lambda|\eta satisfies (zc)λ1(xc)λ1=zxλ1<η|(z-c)\lambda^{-1} - (x-c)\lambda^{-1}| = |z-x| \cdot |\lambda|^{-1} < \eta by [L10] and [L12], hence (zc)λ1S(z-c)\lambda^{-1} \notin S and zλS+cz \notin \lambda S + c. Now every CnC_n is closed, by induction on nn ([L11]): C0=[0,1]C_0 = [0,1] is closed by [L3], and Cn+1C_{n+1} is the union of the two closed sets 13Cn\tfrac13 C_n and 23+13Cn\tfrac23 + \tfrac13 C_n, hence closed by [L4]. So C=nCnC = \bigcap_n C_n is closed by [L4], and C[0,1]C \subseteq [0,1] is bounded by [L1] and [L3]; by [L5] it is compact.

L1L3L4L5L10L11L12
1.2

CC has content zero and measure zero, claim 2. By induction on nn ([L11]) the following holds for every nn: there are mNm \in \mathbb{N} and reals u0v0,,umvmu_0 \le v_0, \dots, u_m \le v_m with Cnjm[uj,vj]C_n \subseteq \bigcup_{j \le m}[u_j,v_j] and jm(vjuj)=(231)n\sum_{j \le m}(v_j - u_j) = (2 \cdot 3^{-1})^{n}. At n=0n = 0 take the single interval [0,1][0,1], of total length 1=(231)01 = (2 \cdot 3^{-1})^0 by [L1]. Given such a list at nn, define 2m+22m + 2 intervals by [uj31,vj31][u_j 3^{-1},\, v_j 3^{-1}] for jmj \le m and [231+ujm131,231+vjm131][2 \cdot 3^{-1} + u_{j-m-1}3^{-1},\, 2 \cdot 3^{-1} + v_{j-m-1}3^{-1}] for m<j2m+1m < j \le 2m+1; they cover 13Cn\tfrac13 C_n and 23+13Cn\tfrac23 + \tfrac13 C_n respectively, hence cover Cn+1C_{n+1}, and their total length is 31(231)n+31(231)n=(231)n+13^{-1}(2 \cdot 3^{-1})^{n} + 3^{-1}(2 \cdot 3^{-1})^{n} = (2 \cdot 3^{-1})^{n+1} by [L11] and [L12]. Since 0<231<10 < 2 \cdot 3^{-1} < 1 by [L12], [L10] gives, for every real ε>0\varepsilon > 0, an nn with (231)nε(2 \cdot 3^{-1})^{n} \le \varepsilon; as CCnC \subseteq C_n by [L1], the corresponding finite list covers CC with total length at most ε\varepsilon. So CC has content zero by [L6], and hence measure zero by [L6].

L1L6L10L11L12
2.1

CC is perfect, claim 3. CC is closed by step 1.1. Let xCx \in C and let the real ε>0\varepsilon > 0 be given. By [L2] write x=Φ(a)x = \Phi(a) with aDa \in D. By [L10] and [L12] fix kNk \in \mathbb{N} with 23k1<ε2 \cdot 3^{-k-1} < \varepsilon, and define bDb \in D by bj:=ajb_j := a_j for jkj \ne k and bk:=2akb_k := 2 - a_k, so bk{0,2}b_k \in \{0,2\} and bab \ne a. Then Φ(b)C\Phi(b) \in C and Φ(b)Φ(a)\Phi(b) \ne \Phi(a) by [L2], while Φ(b)Φ(a)=j0(bjaj)3j1=(bkak)3k1\Phi(b) - \Phi(a) = \sum_{j \ge 0}(b_j - a_j)3^{-j-1} = (b_k - a_k)3^{-k-1} by [L2], all other terms being 00, so Φ(b)x=23k1<ε|\Phi(b) - x| = 2 \cdot 3^{-k-1} < \varepsilon by [L10]. Thus Nε(x)N_\varepsilon(x) contains a point of CC other than xx, for every ε\varepsilon, so xx is not isolated in CC; by [L7] CC is perfect.

step 1.1L2L7L10L12
2.2

CC contains no nondegenerate interval and is nowhere dense, claim 5. By step 1.2 the set CC is null, so by [L6] it contains no [u,v][u,v] with u<vu < v; in particular it contains no interval of any of the four bounded forms with distinct endpoints, since such an interval contains a closed one with distinct endpoints by [L6] and [L12]. Its interior is therefore empty: if Nε(x)CN_\varepsilon(x) \subseteq C for some real ε>0\varepsilon > 0, then [xε21,x+ε21]Nε(x)C[x - \varepsilon \cdot 2^{-1},\, x + \varepsilon \cdot 2^{-1}] \subseteq N_\varepsilon(x) \subseteq C by [L3] and [L12], an interval with distinct endpoints. Since CC is closed by step 1.1, it equals its closure, so [L8] gives that CC is nowhere dense.

step 1.1step 1.2L3L6L8L12
3.1

CC is uncountable, claim 4. CC is nonempty, since 0C0 \in C by [L1], and perfect by step 2.1, so [L7] applies.

step 2.1L1L7
3.2

Connected subsets, claim 6. Let ECE \subseteq C be connected and nonempty. By [L9] EE is order-convex, so if u,vEu, v \in E with u<vu < v then [u,v]EC[u,v] \subseteq E \subseteq C, contradicting step 2.2. Hence no two distinct elements of EE exist, and EE, being nonempty, is a single point.

step 2.2L9L12
4.1

Claims 1 to 6 are steps 1.1, 1.2, 2.1, 3.1, 2.2 and 3.2 respectively, so all six hold.

step 1.1step 1.2step 2.1step 2.2step 3.1step 3.2

Remarks

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals

Definition

The lengths. By the recursion theorem in the index-carrying form used by Finite sums and finite products, by recursion (The recursion theorem, applied to N×R\mathbb{N} \times \mathbb{R} with starting element (0,1)(0,1) and the map (n,t)(n+1,(t4n1)21)(n,t) \mapsto (n+1,\, (t - 4^{-n-1}) \cdot 2^{-1})) there is a unique sequence (λn)nN(\lambda_n)_{n \in \mathbb{N}} of reals with

λ0=1,λn+1=(λn4n1)21(nN),\lambda_0 = 1, \qquad \lambda_{n+1} = (\lambda_n - 4^{-n-1}) \cdot 2^{-1} \quad (n \in \mathbb{N}),

powers being those of Integer powers ama^m. Put gn:=λnλn+1g_n := \lambda_n - \lambda_{n+1}.

The left endpoints. Let F\mathcal{F} be the set of pairs (N,)(N, \ell) with NNN \in \mathbb{N}, N1N \ge 1, and \ell a function from {jN:j<N}\{\, j \in \mathbb{N} : j < N \,\} to R\mathbb{R}; such a pair is a finite list of reals of length NN. Applying The recursion theorem to N×F\mathbb{N} \times \mathcal{F}, the starting element (0,(1,(0)))(0, (1, \ell^{(0)})) with 0(0):=0\ell^{(0)}_0 := 0, and the map that sends (n,(N,))(n, (N,\ell)) to (n+1,(N+N,))(n+1, (N + N, \ell')) where

j:=j  (j<N),j:=jN+gn  (Nj<N+N),\ell'_j := \ell_j \ \ (j < N), \qquad \ell'_j := \ell_{j - N} + g_n \ \ (N \le j < N + N),

gives a unique family (Nn,(n))nN(N_n, \ell^{(n)})_{n \in \mathbb{N}} of finite lists, with N0=1N_0 = 1, Nn+1=Nn+NnN_{n+1} = N_n + N_n, and (n+1)\ell^{(n+1)} the concatenation of (n)\ell^{(n)} with its translate by gng_n. Write ej(n):=j(n)e^{(n)}_j := \ell^{(n)}_j.

The sets. For nNn \in \mathbb{N} put

Sn  :=  j<Nn[ej(n), ej(n)+λn],S  :=  nNSn,S_n \;:=\; \bigcup_{j < N_n} \big[\, e^{(n)}_j,\ e^{(n)}_j + \lambda_n \,\big], \qquad S \;:=\; \bigcap_{n \in \mathbb{N}} S_n ,

the intervals being those of Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length. SS is the Smith-Volterra-Cantor set, also called the fat Cantor set.

Counting. For every nn and every real cc one has j<Nnc=2nc\sum_{j < N_n} c = 2^{n} c, by induction on nn (The principle of mathematical induction): at n=0n = 0 both sides are cc; and j<Nn+Nnc=j<Nnc+j<Nnc=2nc+2nc=2n+1c\sum_{j<N_n + N_n} c = \sum_{j<N_n} c + \sum_{j<N_n} c = 2^{n}c + 2^{n}c = 2^{n+1}c, by the splitting law (Laws of finite sums and finite products, Finite sums and finite products, by recursion) and 2n+1=2n2=2n+2n2^{n+1} = 2^{n} \cdot 2 = 2^{n} + 2^{n} (Integer powers ama^m, Ordered field). So stage nn has "2n2^n intervals" in exactly this sense, and no separate arithmetic of natural-number exponents is needed.

The lengths are positive and shrink. By induction on nn: 0<λn+1λn210 < \lambda_{n+1} \le \lambda_n \cdot 2^{-1} and 2nλn212^{n}\lambda_n \ge 2^{-1}. Indeed 2n+1λn+1=2n(λn4n1)=2nλn412n2^{n+1}\lambda_{n+1} = 2^{n}(\lambda_n - 4^{-n-1}) = 2^{n}\lambda_n - 4^{-1} \cdot 2^{-n} by Laws of integer exponents, so by induction 2nλn=141i<n2i1412=212^{n}\lambda_n = 1 - 4^{-1}\sum_{i<n} 2^{-i} \ge 1 - 4^{-1} \cdot 2 = 2^{-1}, using i<n2ii=02i=2\sum_{i<n}2^{-i} \le \sum_{i=0}^{\infty} 2^{-i} = 2 (For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Series, partial sums, convergence and the sum, divergence, and the tail series). Hence λn2n1>0\lambda_n \ge 2^{-n-1} > 0; and λn+1=(λn4n1)21λn21\lambda_{n+1} = (\lambda_n - 4^{-n-1})\cdot 2^{-1} \le \lambda_n \cdot 2^{-1} gives λn2n\lambda_n \le 2^{-n} by a second induction, so the lengths tend to 00.

Each stage removes an open middle interval of length 4n14^{-n-1}. From the recursion, the two sub-intervals of [e,e+λn][e,\, e + \lambda_n] retained at stage n+1n+1 are [e,e+λn+1][e,\, e + \lambda_{n+1}] and [e+gn,e+gn+λn+1]=[e+gn,e+λn][e + g_n,\, e + g_n + \lambda_{n+1}] = [e + g_n,\, e + \lambda_n], so what is dropped from that piece is the open interval

M  =  (e+λn+1, e+gn),of length  gnλn+1  =  λn2λn+1  =  4n1.M \;=\; \big(\, e + \lambda_{n+1},\ e + g_n \,\big), \qquad \text{of length } \ g_n - \lambda_{n+1} \;=\; \lambda_n - 2\lambda_{n+1} \;=\; 4^{-n-1} .

In particular λn+1<gn\lambda_{n+1} < g_n, so MM is nonempty, and gn>0g_n > 0, so [e+gn,e+λn][e,e+λn][e + g_n, e + \lambda_n] \subseteq [e, e+\lambda_n]. Counting from 11 as in the title: at stage n1n \ge 1 an open interval of length 4n4^{-n} is removed from each of the 2n12^{n-1} intervals then present.

The family is nested and lies in [0,1][0,1]. Each retained sub-interval is contained in the piece it came from, by the previous paragraph, so Sn+1SnS_{n+1} \subseteq S_n; and S0=[0,1]S_0 = [0, 1] since N0=1N_0 = 1, e0(0)=0e^{(0)}_0 = 0 and λ0=1\lambda_0 = 1. Hence SSm[0,1]S \subseteq S_m \subseteq [0,1] for every mm.

Remarks

  • What is different from The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds. There the removed middle is a fixed proportion of each piece, so the construction is self-similar and the total removed length is 11. Here the removed middle has a fixed length 4n14^{-n-1}, chosen to shrink faster than the pieces multiply, and the total removed length is only 212^{-1}. Everything topological survives the change: the set is still compact, perfect and nowhere dense (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero). Everything metric fails: SS is not of measure zero.

  • Why the construction is written with explicit lists. The set SnS_n is a union of 2n2^n intervals, and both the estimate of the removed length and the finite covers used later need those intervals as a list, indexed by naturals below NnN_n. Building the list by recursion, rather than asserting its existence at each stage, is also what keeps the construction free of any choice: (Nn,(n))(N_n, \ell^{(n)}) is a single function of nn.

  • The name. The set was described by Smith in 1875, by Volterra in 1881 and by Cantor in 1883; "fat Cantor set" is the informal name, and the two names are used interchangeably below.

  • 00 and 11 belong to SS. Both are instances of the general fact that every ej(n)e^{(n)}_j and every ej(n)+λne^{(n)}_j + \lambda_n lies in SS, proved where it is used, in The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero: take n=0n = 0 and j=0j = 0, where e0(0)=0e^{(0)}_0 = 0 and e0(0)+λ0=1e^{(0)}_0 + \lambda_0 = 1.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero

Statement

Let SS be the Smith-Volterra-Cantor set (The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals). Then:

  1. SS is closed and bounded, hence compact (A subset of R\mathbb{R} is compact if and only if it is closed and bounded);
  2. SS is perfect (Perfect subset of R\mathbb{R}: closed with no isolated points);
  3. SS is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R});
  4. if (ak)(a_k) and (bk)(b_k) are sequences of reals with akbka_k \le b_k, Sk[ak,bk]S \subseteq \bigcup_k [a_k,b_k] and k<i(bkak)M\sum_{k<i}(b_k - a_k) \le M for every iNi \in \mathbb{N}, then M21M \ge 2^{-1}.

In particular SS does not have measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)): no cover of SS by intervals has total length below 212^{-1}, let alone below every positive ε\varepsilon.

Claim 4 is the quantitative form, and it is what claim 4 of the title asserts in the only vocabulary available here. This library defines no outer measure, so "the measure of SS is 1/21/2" is not a statement it can make; what it can state, and what is proved below, is that 212^{-1} is a lower bound for the total length of every interval cover of SS.

Facts & Assumptions

Given: The lengths (λn)(\lambda_n), the gaps gn=λnλn+1g_n = \lambda_n - \lambda_{n+1}, the finite lists (Nn,(n))(N_n, \ell^{(n)}) with entries ej(n)e^{(n)}_j, and the sets SnS_n, SS of The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals. For nNn \in \mathbb{N} and j<Nnj < N_n write Mj(n):=(ej(n)+λn+1, ej(n)+gn)M^{(n)}_j := \big(e^{(n)}_j + \lambda_{n+1},\ e^{(n)}_j + g_n\big) for the open interval removed from the jj-th piece at stage nn.

[A1]

The negation of claim 4: sequences (ak)(a_k), (bk)(b_k) with akbka_k \le b_k, Sk[ak,bk]S \subseteq \bigcup_k [a_k,b_k], all partial sums k<i(bkak)M\sum_{k<i}(b_k - a_k) \le M, and M<21M < 2^{-1}.

[L1]

The construction: N0=1N_0 = 1, e0(0)=0e^{(0)}_0 = 0, λ0=1\lambda_0 = 1, Nn+1=Nn+NnN_{n+1} = N_n + N_n, ej(n+1)=ej(n)e^{(n+1)}_j = e^{(n)}_j for j<Nnj < N_n and eNn+j(n+1)=ej(n)+gne^{(n+1)}_{N_n + j} = e^{(n)}_j + g_n for j<Nnj < N_n; Sn=j<Nn[ej(n),ej(n)+λn]S_n = \bigcup_{j<N_n}[e^{(n)}_j, e^{(n)}_j + \lambda_n]; S=nSnSm[0,1]S = \bigcap_n S_n \subseteq S_m \subseteq [0,1]; 0<λn+1<gn<λn2n0 < \lambda_{n+1} < g_n < \lambda_n \le 2^{-n}; gn+λn+1=λng_n + \lambda_{n+1} = \lambda_n; λn2λn+1=4n1\lambda_n - 2\lambda_{n+1} = 4^{-n-1}; and j<Nnc=2nc\sum_{j<N_n} c = 2^{n}c for every real cc (The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Integer powers ama^m, Laws of integer exponents).

[L2]

[c,d][c,d] is a closed set, (c,d)(c,d) is open, Nε(x)=(xε,x+ε)N_\varepsilon(x) = (x-\varepsilon,x+\varepsilon), a closed bounded interval is bounded, finite unions of closed sets are closed and an intersection of a nonempty family of closed sets is closed (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, 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}, Lower bound, bounded below, bounded set, Arbitrary unions and finite intersections of open subsets of R\mathbb{R} are open, and dually for closed sets).

[L5]

If [u,v]k[ck,dk][u,v] \subseteq \bigcup_k [c_k,d_k] with uvu \le v, ckdkc_k \le d_k and k<i(dkck)M\sum_{k<i}(d_k - c_k) \le M' for every ii, then MvuM' \ge v - u (A sequence of intervals covering [a,b][a,b] has total length at least bab - a, so no interval of positive length has measure zero).

[L6]

There is a bijection J:N×NNJ : \mathbb{N} \times \mathbb{N} \to \mathbb{N} (N×NN\mathbb{N} \times \mathbb{N} \approx \mathbb{N}, Injection, surjection, bijection).

[L7]

Finite sums: splitting, scaling, monotonicity in the terms; a finite sum of nonnegative terms indexed injectively inside a finite rectangle is at most the sum over the rectangle (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L9]

Induction on N\mathbb{N}; every nonempty subset of N\mathbb{N} has a least element; every finite list of naturals has an upper bound in N\mathbb{N}, the order of N\mathbb{N} being total (The principle of mathematical induction, The well-ordering principle, Trichotomy of the order on N\mathbb{N}, Order on the natural numbers).

[L10]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0 and 4>04 > 0 and 21>02^{-1} > 0; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · contradiction
1.1

Suppose, for contradiction, that claim 4 fails, and fix (ak)(a_k), (bk)(b_k) and MM as in [A1], so that M<21M < 2^{-1}.

assume-contragivenA1choose
1.2

SS is compact, claim 1. Each SnS_n is the union of the finite list of closed sets [ej(n),ej(n)+λn][e^{(n)}_j, e^{(n)}_j + \lambda_n], j<Nnj < N_n, hence closed by [L2]; so S=nSnS = \bigcap_n S_n is closed by [L2], and S[0,1]S \subseteq [0,1] is bounded by [L1] and [L2]; by [L3] it is compact.

L1L2L3
1.3

Separation. For every nn and all iji \ne j below NnN_n one has ei(n)ej(n)>λn|e^{(n)}_i - e^{(n)}_j| > \lambda_n, by induction on nn ([L9]). At n=0n = 0 there is nothing to prove, since N0=1N_0 = 1. Assume it at nn and let iji \ne j below Nn+1=Nn+NnN_{n+1} = N_n + N_n. If both indices are <Nn< N_n, or both are Nn\ge N_n, the two entries are ei(n)e^{(n)}_{i'} and ej(n)e^{(n)}_{j'} with iji' \ne j', possibly both shifted by the same gng_n, so the difference has absolute value >λn>λn+1> \lambda_n > \lambda_{n+1} by [L1]. Otherwise the entries are ei(n)e^{(n)}_{i'} and ej(n)+gne^{(n)}_{j'} + g_n; if i=ji' = j' the difference is gn>λn+1g_n > \lambda_{n+1} by [L1]; if ei(n)ej(n)>λne^{(n)}_{i'} - e^{(n)}_{j'} > \lambda_n then ei(n)ej(n)gn>λngn=λn+1e^{(n)}_{i'} - e^{(n)}_{j'} - g_n > \lambda_n - g_n = \lambda_{n+1}, and if ej(n)ei(n)>λne^{(n)}_{j'} - e^{(n)}_{i'} > \lambda_n then ej(n)+gnei(n)>λn>λn+1e^{(n)}_{j'} + g_n - e^{(n)}_{i'} > \lambda_n > \lambda_{n+1}, in each case by [L1] and [L10]. Consequently the pieces [ej(n),ej(n)+λn][e^{(n)}_j, e^{(n)}_j + \lambda_n], j<Nnj < N_n, are pairwise disjoint.

L1L9L10
1.4

Every endpoint lies in SS. Fix nn and j<Nnj < N_n. For mnm \le n one has ej(n)e^{(n)}_j and ej(n)+λne^{(n)}_j + \lambda_n in SnSmS_n \subseteq S_m by [L1]. For mnm \ge n, an induction on mm ([L9]) gives indices j,j<Nmj', j'' < N_m with ej(m)=ej(n)e^{(m)}_{j'} = e^{(n)}_j and ej(m)+λm=ej(n)+λne^{(m)}_{j''} + \lambda_m = e^{(n)}_j + \lambda_n: at m=nm = n take j=j=jj' = j'' = j; and if they exist at mm, then ej(m+1)=ej(m)e^{(m+1)}_{j'} = e^{(m)}_{j'} works for the left endpoint, while eNm+j(m+1)+λm+1=ej(m)+gm+λm+1=ej(m)+λme^{(m+1)}_{N_m + j''} + \lambda_{m+1} = e^{(m)}_{j''} + g_m + \lambda_{m+1} = e^{(m)}_{j''} + \lambda_m works for the right one, by [L1]. So both points lie in every SmS_m, hence in SS.

L1L9
1.5

The complement decomposes over the stages. [0,1]S=n(SnSn+1)[0,1] \setminus S = \bigcup_{n}(S_n \setminus S_{n+1}). The inclusion \supseteq holds because SnS0=[0,1]S_n \subseteq S_0 = [0,1] and SSn+1S \subseteq S_{n+1} by [L1]. For \subseteq, let x[0,1]Sx \in [0,1] \setminus S; then xS0x \in S_0 and, SS being mSm\bigcap_m S_m, the set of mm with xSmx \notin S_m is nonempty, so by [L9] it has a least element m0m_0, and m01m_0 \ge 1 since xS0x \in S_0. Put n:=m01n := m_0 - 1; then xSnx \in S_n by minimality and xSn+1x \notin S_{n+1}.

L1L9
2.1

The removed pieces. Fix nn and j<Nnj < N_n. By [L1] the pieces [ej(n),ej(n)+λn+1][e^{(n)}_j, e^{(n)}_j + \lambda_{n+1}] and [ej(n)+gn, ej(n)+λn][e^{(n)}_j + g_n,\ e^{(n)}_j + \lambda_n] both occur among the pieces of Sn+1S_{n+1}, so a point xx of [ej(n),ej(n)+λn][e^{(n)}_j, e^{(n)}_j + \lambda_n] outside Sn+1S_{n+1} satisfies λn+1<xej(n)<gn\lambda_{n+1} < x - e^{(n)}_j < g_n, that is xMj(n)x \in M^{(n)}_j; hence SnSn+1j<NnMj(n)S_n \setminus S_{n+1} \subseteq \bigcup_{j<N_n} M^{(n)}_j. Conversely Mj(n)Sn+1=M^{(n)}_j \cap S_{n+1} = \varnothing: a piece of Sn+1S_{n+1} coming from iji \ne j lies in [ei(n),ei(n)+λn][e^{(n)}_i, e^{(n)}_i + \lambda_n], which is disjoint from [ej(n),ej(n)+λn]Mj(n)[e^{(n)}_j, e^{(n)}_j + \lambda_n] \supseteq M^{(n)}_j by step 1.3, while the two pieces coming from jj itself are disjoint from the open interval Mj(n)M^{(n)}_j by [L10]. Finally each Mj(n)M^{(n)}_j has length gnλn+1=λn2λn+1=4n1g_n - \lambda_{n+1} = \lambda_n - 2\lambda_{n+1} = 4^{-n-1}, so j<Nn4n1=2n4n1=412n\sum_{j<N_n} 4^{-n-1} = 2^{n} \cdot 4^{-n-1} = 4^{-1} \cdot 2^{-n} by [L1].

step 1.3L1L10
2.2

SS is perfect, claim 2. SS is closed by step 1.2. Let xSx \in S and let the real ε>0\varepsilon > 0 be given; by [L1] and [L8] fix nn with λn2n<ε\lambda_n \le 2^{-n} < \varepsilon. Since xSnx \in S_n there is j<Nnj < N_n with x[ej(n),ej(n)+λn]x \in [e^{(n)}_j, e^{(n)}_j + \lambda_n]; the two endpoints of that piece lie in SS by step 1.4, are distinct because λn>0\lambda_n > 0, and each is within λn<ε\lambda_n < \varepsilon of xx by [L10]. So at least one of them is a point of SNε(x)S \cap N_\varepsilon(x) different from xx, and xx is not isolated in SS; by [L4], SS is perfect.

step 1.2step 1.4L1L4L8L10
3.1

SS is nowhere dense, claim 3. SS is closed by step 1.2, so it equals its closure, and by [L4] it suffices that its interior be empty. Suppose Nε(x)SN_\varepsilon(x) \subseteq S for some xx and some real ε>0\varepsilon > 0; fix nn with λn2n<ε\lambda_n \le 2^{-n} < \varepsilon by [L1] and [L8], and j<Nnj < N_n with x[ej(n),ej(n)+λn]x \in [e^{(n)}_j, e^{(n)}_j + \lambda_n]. The point w:=ej(n)+(λn+1+gn)21w := e^{(n)}_j + (\lambda_{n+1} + g_n) \cdot 2^{-1} lies in Mj(n)M^{(n)}_j, since λn+1<gn\lambda_{n+1} < g_n, and hence in [ej(n),ej(n)+λn][e^{(n)}_j, e^{(n)}_j + \lambda_n], so wxλn<ε|w - x| \le \lambda_n < \varepsilon and wNε(x)SSn+1w \in N_\varepsilon(x) \subseteq S \subseteq S_{n+1}; but Mj(n)Sn+1=M^{(n)}_j \cap S_{n+1} = \varnothing by step 2.1, which is impossible. So no neighbourhood is contained in SS and SS is nowhere dense.

step 1.2step 2.1L1L4L8L10
3.2

A cover of [0,1][0,1] built from [A1] and the removed pieces. By [L6] fix a bijection JJ and define sequences (ci)(c_i), (di)(d_i) as follows: for iNi \in \mathbb{N} write (m,t):=J1(i)(m, t) := J^{-1}(i); if m=0m = 0 put (ci,di):=(at,bt)(c_i, d_i) := (a_t, b_t); if m1m \ge 1 and t<Nm1t < N_{m-1} put (ci,di):=(et(m1)+λm, et(m1)+gm1)(c_i,d_i) := \big(e^{(m-1)}_t + \lambda_{m}, \ e^{(m-1)}_t + g_{m-1}\big); and otherwise put (ci,di):=(0,0)(c_i,d_i) := (0,0). Then cidic_i \le d_i for every ii by [L1], and i[ci,di]\bigcup_i [c_i,d_i] contains SS by [A1] and contains [0,1]S[0,1] \setminus S by steps 1.5 and 2.1, hence contains [0,1][0,1]. For a partial sum, fix i0i_0; the pairs J1(i)J^{-1}(i) with i<i0i < i_0 are distinct, so by [L9] there is PP bounding both of their coordinates, and since all the terms are nonnegative [L7] gives i<i0(dici)tP(btat)+nPt<Nn4n1M+nP412nM+412=M+21\sum_{i<i_0}(d_i - c_i) \le \sum_{t \le P}(b_t - a_t) + \sum_{n \le P}\sum_{t < N_n} 4^{-n-1} \le M + \sum_{n\le P} 4^{-1}2^{-n} \le M + 4^{-1} \cdot 2 = M + 2^{-1}, using [A1], step 2.1, [L7] and [L8].

step 1.1step 1.5step 2.1A1L1L6L7L8L9
4.1

By [L5] applied to [0,1][0,1] and the cover of step 3.2, M+2110=1M + 2^{-1} \ge 1 - 0 = 1, so M21M \ge 2^{-1}, contradicting step 1.1. Claim 4 therefore holds; and SS is not null, since nullity would give, at ε:=41\varepsilon := 4^{-1}, a cover of SS with all partial total lengths 41<21\le 4^{-1} < 2^{-1}, which claim 4 forbids. With steps 1.2, 2.2 and 3.1 all four claims are proved.

step 1.1step 1.2step 2.2step 3.1step 3.2L5L10discharge-contradiction

Remarks

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The Cantor function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval

Definition

Let CC be the Cantor set, DD the set of sequences with values in {0,2}\{0,2\} and Φ:DC\Phi : D \to C the bijection Φ(a)=k0ak3k1\Phi(a) = \sum_{k \ge 0} a_k 3^{-k-1} of The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}. Since Φ\Phi is a bijection it has a two-sided inverse Φ1:CD\Phi^{-1} : C \to D, and that inverse is a single function, determined and not selected (Injection, surjection, bijection).

On the Cantor set. For xCx \in C write a:=Φ1(x)a := \Phi^{-1}(x) and put

γ(x)  :=  k=0(ak21)2k1.\gamma(x) \;:=\; \sum_{k=0}^{\infty} \big(a_k \cdot 2^{-1}\big)\, 2^{-k-1} .

Each coefficient ak21a_k \cdot 2^{-1} is 00 or 11, so all the terms are nonnegative and every partial sum is at most k<n2k1k=02k1=1\sum_{k<n} 2^{-k-1} \le \sum_{k=0}^{\infty} 2^{-k-1} = 1 (For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Integer powers ama^m, Laws of integer exponents); hence the series converges and γ(x)[0,1]\gamma(x) \in [0,1] (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Series, partial sums, convergence and the sum, divergence, and the tail series, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). In words: γ\gamma halves each ternary digit of xx and reads the result as a binary expansion.

On all of [0,1][0,1]. The Cantor function is c:[0,1]Rc : [0,1] \to \mathbb{R},

c(x)  :=  sup{γ(t):tC and tx}.c(x) \;:=\; \sup\{\, \gamma(t) : t \in C \text{ and } t \le x \,\} .

The supremum exists and is a single real number. The set on the right is nonempty, because 0C0 \in C (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds) and 0x0 \le x, and it is bounded above by 11, because γ\gamma takes values in [0,1][0,1]; so it has a least upper bound by completeness (Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set), and that bound is unique (Suprema and infima are unique). Since 0γ(0)c(x)10 \le \gamma(0) \le c(x) \le 1, the values of cc lie in [0,1][0,1].

That cc really extends γ\gamma, that is, c(t)=γ(t)c(t) = \gamma(t) for every tCt \in C, is not an observation but a small theorem: it needs γ\gamma to be nondecreasing along CC. It is claim 1 of The Cantor function is well defined, satisfies c(x)c(y)c(x) \le c(y) whenever xyx \le y, is surjective onto [0,1][0,1], and is constant on every interval removed from the Cantor set , recorded in this item's justified_by, and until it is proved the two symbols are kept apart.

Remarks

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The Cantor function is well defined, satisfies c(x)c(y)c(x) \le c(y) whenever xyx \le y, is surjective onto [0,1][0,1], and is constant on every interval removed from the Cantor set

Statement

Let CC be the Cantor set, γ:C[0,1]\gamma : C \to [0,1] and c:[0,1]Rc : [0,1] \to \mathbb{R} as in The Cantor function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval. Then:

  1. cc is well defined with values in [0,1][0,1], and c(t)=γ(t)c(t) = \gamma(t) for every tCt \in C, so cc extends γ\gamma;
  2. c(x)c(y)c(x) \le c(y) whenever 0xy10 \le x \le y \le 1;
  3. cc is surjective onto [0,1][0,1] (Injection, surjection, bijection), and c(0)=0c(0) = 0, c(1)=1c(1) = 1;
  4. cc is constant on [u,v][u,v] whenever u<vu < v, u,vCu, v \in C and (u,v)C=(u,v) \cap C = \varnothing; and every x[0,1]Cx \in [0,1] \setminus C lies in the open interval of such a pair, so cc is constant on a whole neighbourhood of every point of [0,1][0,1] outside CC.

Claim 2 is what "monotone" names for a function; that word is not used here, because Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences is about sequences and no definition of a monotone function is available at this point in the reading order. Claim 4 is what "constant on every interval removed in the construction" means: the removed intervals are gaps of CC in the sense of claim 4, as (13,23)(\tfrac13, \tfrac23) illustrates. No claim whatever is made here about continuity, for which no definition is available at this point in the reading order.

Facts & Assumptions

Given: The Cantor set CC, the set DD of {0,2}\{0,2\}-valued sequences, the bijection Φ:DC\Phi : D \to C, and the functions γ\gamma and cc of The Cantor function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval. For xCx \in C write Φ1(x)\Phi^{-1}(x) for its digit sequence.

[L1]

Φ(a)=k0ak3k1\Phi(a) = \sum_{k \ge 0} a_k 3^{-k-1} is a bijection from DD onto CC, with two-sided inverse Φ1\Phi^{-1}; γ(x)=k0(ak21)2k1\gamma(x) = \sum_{k \ge 0}(a_k 2^{-1})2^{-k-1} for a=Φ1(x)a = \Phi^{-1}(x), with values in [0,1][0,1]; c(x)=sup{γ(t):tC, tx}c(x) = \sup\{\gamma(t) : t \in C,\ t \le x\}, the supremum of a nonempty set bounded above by 11 and containing γ(0)\gamma(0) (The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}, The Cantor function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval, Injection, surjection, bijection, Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set, Suprema and infima are unique).

[L2]

k=0rk=1/(1r)\sum_{k=0}^{\infty} r^{k} = 1/(1-r) for r<1|r|<1, so km2k1=2m\sum_{k \ge m} 2^{-k-1} = 2^{-m} and km23k1=3m\sum_{k \ge m} 2 \cdot 3^{-k-1} = 3^{-m}; convergent series add and scale termwise; a series of nonnegative terms has nonnegative sum and all partial sums at most the sum (For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Convergent series add and scale termwise, A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Series, partial sums, convergence and the sum, divergence, and the tail series, Integer powers ama^m, Laws of integer exponents).

[L4]

Suprema: u=supSu = \sup S exactly when uu is an upper bound and for every ε>0\varepsilon > 0 some sSs \in S has uε<su - \varepsilon < s; infima exist for nonempty sets bounded below, and =infS\ell = \inf S exactly when \ell is a lower bound and for every ε>0\varepsilon > 0 some sSs \in S has s<+εs < \ell + \varepsilon; both are unique; a supremum is monotone in the set, since an upper bound of a larger set bounds a smaller one (Epsilon characterisation of the supremum, Epsilon characterisation of the infimum, Every nonempty set bounded below has an infimum, Greatest lower bound (infimum), Suprema and infima are unique, Complete ordered field (least-upper-bound property), Lower bound, bounded below, bounded set).

[L5]

Recursion and induction on N\mathbb{N}; every nonempty subset of N\mathbb{N} has a least element (The recursion theorem, The principle of mathematical induction, The well-ordering principle).

[L6]

2n02^{-n} \to 0; convergence is tested against rational ε>0\varepsilon > 0; a convergent sequence has exactly one limit; z0|z| \ge 0 and z=z|z| = z for z0z \ge 0 (For r<1|r| < 1 the sequence rkr^k is null, and for r>1|r| > 1 the sequence rk|r|^k diverges to ++\infty, Limits and Cauchy sequences of reals, A sequence has at most one limit, Sequences of reals: bounded, eventually, frequently, tails, subsequences, Basic properties of the absolute value).

[L8]

[u,v][u,v] and (u,v)(u,v) are the intervals of Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, and Nε(x)=(xε,x+ε)N_\varepsilon(x) = (x-\varepsilon,x+\varepsilon) (The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}).

[L9]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0, 3>03 > 0 and 21>02^{-1} > 0; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

Comparison of two digit sequences. Let aba \ne b in DD and let kk be the least index with akbka_k \ne b_k, which exists by [L5]; suppose ak=0a_k = 0 and bk=2b_k = 2. Then Φ(b)Φ(a)=j0(bjaj)3j1\Phi(b) - \Phi(a) = \sum_{j \ge 0}(b_j - a_j)3^{-j-1} by [L2], the terms with j<kj < k vanish, and the tail R:=jk+1(bjaj)3j1R := \sum_{j \ge k+1}(b_j - a_j)3^{-j-1} satisfies Rjk+123j1=3k1|R| \le \sum_{j \ge k+1} 2 \cdot 3^{-j-1} = 3^{-k-1} by [L2], since bjaj2|b_j - a_j| \le 2; hence Φ(b)Φ(a)23k13k1=3k1>0\Phi(b) - \Phi(a) \ge 2 \cdot 3^{-k-1} - 3^{-k-1} = 3^{-k-1} > 0. The same computation with the halved digits gives γ(Φ(b))γ(Φ(a))=2k1+R\gamma(\Phi(b)) - \gamma(\Phi(a)) = 2^{-k-1} + R' with Rjk+12j1=2k1|R'| \le \sum_{j \ge k+1} 2^{-j-1} = 2^{-k-1}, so γ(Φ(b))γ(Φ(a))\gamma(\Phi(b)) \ge \gamma(\Phi(a)). Consequently, for s,tCs, t \in C with sts \le t one has γ(s)γ(t)\gamma(s) \le \gamma(t): this is trivial if s=ts = t, and otherwise the least index kk at which the digit sequences differ must have the digit of tt equal to 22, by the first computation applied both ways.

givenL1L2L5L9
1.2

Values at the endpoints. The constant sequence 0ˉ\bar 0 has Φ(0ˉ)=0\Phi(\bar 0) = 0 and γ(0)=0\gamma(0) = 0; the constant sequence 2ˉ\bar 2 has Φ(2ˉ)=k023k1=1\Phi(\bar 2) = \sum_{k \ge 0} 2 \cdot 3^{-k-1} = 1 and γ(1)=k02k1=1\gamma(1) = \sum_{k \ge 0} 2^{-k-1} = 1, by [L2]. Both 00 and 11 lie in CC by [L3].

L1L2L3
2.1

Claims 1 and 2. For x[0,1]x \in [0,1] the set Ax:={γ(t):tC, tx}A_x := \{\gamma(t) : t \in C,\ t \le x\} is nonempty and bounded above by 11 by [L1], so c(x)=supAxc(x) = \sup A_x exists, is unique and lies in [0,1][0,1] by [L1] and [L4]; that is claim 1 apart from the extension property. If 0xy10 \le x \le y \le 1 then AxAyA_x \subseteq A_y, so c(x)c(y)c(x) \le c(y) by [L4], which is claim 2. And for tCt \in C: γ(t)At\gamma(t) \in A_t, while γ(t)\gamma(t) is an upper bound of AtA_t by step 1.1, so γ(t)=supAt=c(t)\gamma(t) = \sup A_t = c(t) by [L4].

step 1.1step 1.2L1L4
2.2

The two endpoints of a gap carry the same value of γ\gamma. Let u<vu < v with u,vCu, v \in C and (u,v)C=(u,v) \cap C = \varnothing, and put a:=Φ1(u)a := \Phi^{-1}(u), b:=Φ1(v)b := \Phi^{-1}(v), with kk the least index where they differ; by step 1.1 and u<vu < v we have ak=0a_k = 0 and bk=2b_k = 2. If some j>kj > k had aj=0a_j = 0, let aa' agree with aa except that aj=2a'_j = 2; then Φ(a)C\Phi(a') \in C, Φ(a)>u\Phi(a') > u by step 1.1, and aa' still differs from bb first at kk with ak=0<2=bka'_k = 0 < 2 = b_k, so Φ(a)<v\Phi(a') < v by step 1.1, putting Φ(a)\Phi(a') in (u,v)C(u,v) \cap C, which is empty. Hence aj=2a_j = 2 for every j>kj > k. Symmetrically, if some j>kj > k had bj=2b_j = 2, replacing it by 00 gives bb' with Φ(b)<v\Phi(b') < v and Φ(b)>u\Phi(b') > u, again impossible; hence bj=0b_j = 0 for every j>kj > k. Writing P:=j<k(aj21)2j1=j<k(bj21)2j1P := \sum_{j<k}(a_j 2^{-1})2^{-j-1} = \sum_{j<k}(b_j 2^{-1})2^{-j-1}, [L2] now gives γ(u)=P+0+jk+12j1=P+2k1\gamma(u) = P + 0 + \sum_{j \ge k+1} 2^{-j-1} = P + 2^{-k-1} and γ(v)=P+2k1+0=P+2k1\gamma(v) = P + 2^{-k-1} + 0 = P + 2^{-k-1}, so γ(u)=γ(v)\gamma(u) = \gamma(v).

step 1.1L1L2L9
3.1

Claim 4, first half. Let u<vu < v with u,vCu,v \in C and (u,v)C=(u,v) \cap C = \varnothing, and let x[u,v]x \in [u,v]. Every tCt \in C with txt \le x satisfies tut \le u or t=vt = v: indeed if t>ut > u then txvt \le x \le v and t(u,v)t \notin (u,v) force t=vt = v. In the first case γ(t)γ(u)\gamma(t) \le \gamma(u) by step 1.1, and in the second γ(t)=γ(v)=γ(u)\gamma(t) = \gamma(v) = \gamma(u) by step 2.2. So γ(u)\gamma(u) is an upper bound of AxA_x and belongs to it, whence c(x)=γ(u)c(x) = \gamma(u) by [L4]: cc is constant on [u,v][u,v], with the value c(u)c(u) given by step 2.1.

step 1.1step 2.1step 2.2L4L9
3.2

Claim 3. Let s[0,1]s \in [0,1]. Let T:RRT : \mathbb{R} \to \mathbb{R} be T(r):=2rT(r) := 2r for r<21r < 2^{-1} and T(r):=2r1T(r) := 2r - 1 for r21r \ge 2^{-1}, a definition by cases on the total order, and by [L5] let (rn)(r_n) satisfy r0=sr_0 = s and rn+1=T(rn)r_{n+1} = T(r_n); put βn:=0\beta_n := 0 when rn<21r_n < 2^{-1} and βn:=1\beta_n := 1 otherwise, so rn+1=2rnβnr_{n+1} = 2r_n - \beta_n. An induction ([L5]) gives rn[0,1]r_n \in [0,1] for every nn, since 0r<210 \le r < 2^{-1} gives 02r<10 \le 2r < 1 and 21r12^{-1} \le r \le 1 gives 02r110 \le 2r - 1 \le 1 by [L9]; a second induction gives s=k<nβk2k1+2nrns = \sum_{k<n}\beta_k 2^{-k-1} + 2^{-n} r_n for every nn, the step being k<n+1βk2k1+2n1rn+1=k<nβk2k1+βn2n1+2n1(2rnβn)=k<nβk2k1+2nrn\sum_{k<n+1}\beta_k2^{-k-1} + 2^{-n-1}r_{n+1} = \sum_{k<n}\beta_k2^{-k-1} + \beta_n 2^{-n-1} + 2^{-n-1}(2r_n - \beta_n) = \sum_{k<n}\beta_k2^{-k-1} + 2^{-n}r_n. Hence 0sk<nβk2k12n0 \le s - \sum_{k<n}\beta_k2^{-k-1} \le 2^{-n}, so by [L6] the partial sums converge to ss and s=k0βk2k1s = \sum_{k \ge 0}\beta_k 2^{-k-1}. Now a:=(2βk)ka := (2\beta_k)_k lies in DD, the point x:=Φ(a)x := \Phi(a) lies in CC by [L1], and γ(x)=kβk2k1=s\gamma(x) = \sum_k \beta_k 2^{-k-1} = s; by step 2.1, c(x)=γ(x)=sc(x) = \gamma(x) = s. With step 1.2 and step 2.1 this also gives c(0)=γ(0)=0c(0) = \gamma(0) = 0 and c(1)=γ(1)=1c(1) = \gamma(1) = 1.

step 1.2step 2.1L1L2L5L6L9
4.1

Claim 4, second half. Let x[0,1]Cx \in [0,1] \setminus C. The set A:={tC:tx}A := \{t \in C : t \le x\} is nonempty by [L3] and bounded above by xx, so u:=supAu := \sup A exists by [L4]; by [L4] every Nε(u)N_\varepsilon(u) meets ACA \subseteq C, so uC=Cu \in \overline{C} = C by [L3], and uxu \le x with uxu \ne x, so u<xu < x. The set B:={tC:tx}B := \{t \in C : t \ge x\} is nonempty by [L3], since 1C1 \in C and x1x \le 1, and is bounded below by xx, so v:=infBv := \inf B exists by [L4]; likewise vCv \in C and v>xv > x. If tCt \in C satisfied u<t<vu < t < v, then txt \le x would put tAt \in A and force tut \le u, while txt \ge x would put tBt \in B and force tvt \ge v, and one of the two holds by totality of the order ([L9]); so (u,v)C=(u,v) \cap C = \varnothing. By step 3.1 the function cc is constant on [u,v][u,v], and Nδ(x)(u,v)N_\delta(x) \subseteq (u,v) for δ:=min{xu, vx}>0\delta := \min\{x - u,\ v - x\} > 0 by [L7], [L8] and [L9].

step 3.1L3L4L7L8L9
5.1

Claims 1 and 2 are step 2.1, claim 3 is step 3.2, and claim 4 is steps 3.1 and 4.1 together; so all four hold.

step 2.1step 3.1step 3.2step 4.1

Remarks

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27 rests on unproved materialOpen item page →
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.

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

FALSE: every nowhere dense subset of R\mathbb{R} has measure zero

Statement

False claim: every nowhere dense subset of R\mathbb{R} (Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R}) has measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

The claim is tempting because a nowhere dense set is topologically thin: its closure contains no interval at all, so it is "full of holes" everywhere. The error is to read that as a statement about total length. Holes may be plentiful and short at the same time, and the Smith-Volterra-Cantor set is built precisely so that they are.

Facts & Assumptions

[A1]

The false claim: every nowhere dense subset of R\mathbb{R} has measure zero.

[L2]

If sequences (ak)(a_k), (bk)(b_k) with akbka_k \le b_k cover SS and all their partial total lengths are at most MM, then M21M \ge 2^{-1}; in particular SS does not have measure zero (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero, claim 4).

[L3]

A set is null when for every real ε>0\varepsilon > 0 it has a cover by a sequence of closed intervals with all partial total lengths at most ε\varepsilon (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

Refutation

technique · direct
1.1

The set SS is a subset of R\mathbb{R} and is nowhere dense, by [L1].

L1
1.2

SS does not have measure zero: a cover witnessing nullity at ε:=41\varepsilon := 4^{-1} would have all partial total lengths at most 414^{-1}, and [L2] then forces 41214^{-1} \ge 2^{-1}, which is false.

L2L3
2.1

So SS is a nowhere dense subset of R\mathbb{R} that does not have measure zero, and the claim [A1] fails at SS; the claim is therefore false.

step 1.1step 1.2A1

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

FALSE: every subset of R\mathbb{R} of measure zero is nowhere dense

Statement

False claim: every subset of R\mathbb{R} of measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)) is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R}).

The claim confuses two different smallness conditions. Measure zero constrains the total length of a cover; nowhere density constrains the closure. A set may be covered by intervals of total length below any ε\varepsilon and still have every real as an adherent point, and Q\mathbb{Q} does exactly that.

Facts & Assumptions

Given: The set QRR\mathbb{Q}_{\mathbb{R}} \subseteq \mathbb{R} of rationals, that is the image of Q\mathbb{Q} under the canonical embedding (The rationals embed densely in the reals).

[A1]

The false claim: every subset of R\mathbb{R} of measure zero is nowhere dense.

[L1]

QN\mathbb{Q} \approx \mathbb{N}, so QR\mathbb{Q}_{\mathbb{R}} is at most countable (Q\mathbb{Q} is countably infinite, Finite, countably infinite, countable, uncountable, The rationals embed densely in the reals).

[L2]

Every at most countable subset of R\mathbb{R} has measure zero (Every at most countable subset of R\mathbb{R} has measure zero).

Refutation

technique · direct
1.1

QR\mathbb{Q}_{\mathbb{R}} has measure zero, being at most countable by [L1] and hence null by [L2].

L1L2
1.2

QR\mathbb{Q}_{\mathbb{R}} is not nowhere dense: its closure is R\mathbb{R} by [L3], and the interior of R\mathbb{R} is R\mathbb{R} itself by [L4], since R\mathbb{R} is an open subset of R\mathbb{R}; so the interior of the closure is R\mathbb{R} \ne \varnothing.

L3L4
2.1

So QR\mathbb{Q}_{\mathbb{R}} is a subset of R\mathbb{R} of measure zero that is not nowhere dense, and the claim [A1] fails at it; the claim is therefore false.

step 1.1step 1.2A1

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

FALSE: every set of measure zero has content zero

Statement

False claim: every set of measure zero has content zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

The converse is true and is A set of content zero has measure zero; the two notions do coincide for compact sets (For a compact subset of R\mathbb{R}, measure zero and content zero coincide). The claim above drops the compactness, and boundedness alone is not a substitute: the witness below is a bounded set of measure zero with no finite cover by intervals of total length less than 11.

Facts & Assumptions

Given: The set E:=QR[0,1]E := \mathbb{Q}_{\mathbb{R}} \cap [0,1], where QR\mathbb{Q}_{\mathbb{R}} is the image of Q\mathbb{Q} in R\mathbb{R} (The rationals embed densely in the reals).

[A1]

The false claim: every subset of R\mathbb{R} of measure zero has content zero.

[L4]

If [a,b]jn[cj,dj][a,b] \subseteq \bigcup_{j \le n}[c_j,d_j] with aba \le b and cjdjc_j \le d_j, then jn(djcj)ba\sum_{j \le n}(d_j - c_j) \ge b - a (If finitely many intervals cover a closed bounded interval [a,b][a,b], the sum of their lengths is at least bab - a).

[L5]

AA has content zero when for every real ε>0\varepsilon > 0 it has a finite cover by closed intervals of total length at most ε\varepsilon (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L6]

Every nonempty finite set of reals has a maximum and a minimum (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L7]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0 and 21>02^{-1} > 0 and 21<12^{-1} < 1; adding a constant and multiplying by a positive preserve an inequality; the order is total and transitive (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Refutation

technique · direct
1.1

EE has measure zero by [L1], and E[0,1]E \subseteq [0,1] is bounded.

L1
1.2

Every x[0,1]x \in [0,1] is adherent to EE: given a real ε>0\varepsilon > 0, put p:=max{0, xε}p := \max\{0,\ x - \varepsilon\} and q:=min{1, x+ε}q := \min\{1,\ x + \varepsilon\}, which exist by [L6]. Then p<qp < q: indeed pxqp \le x \le q by [L7] and 0x10 \le x \le 1, while p=xp = x would need x0x \le 0 hence x=0<min{1,ε}=qx = 0 < \min\{1,\varepsilon\} = q, and q=xq = x would need x1x \ge 1 hence x=1>max{0,1ε}=px = 1 > \max\{0, 1-\varepsilon\} = p, and otherwise p<x<qp < x < q. By [L2] there is a rational strictly between pp and qq; it lies in [0,1][0,1] because 0p0 \le p and q1q \le 1, and within ε\varepsilon of xx because xεpx - \varepsilon \le p and qx+εq \le x + \varepsilon. So Nε(x)EN_\varepsilon(x) \cap E \ne \varnothing.

L2L6L7
2.1

Let nNn \in \mathbb{N} and c0d0,,cndnc_0 \le d_0, \dots, c_n \le d_n be any finite family of closed intervals with Ejn[cj,dj]E \subseteq \bigcup_{j \le n}[c_j,d_j]. The union jn[cj,dj]\bigcup_{j\le n}[c_j,d_j] is a closed set by [L3], and it contains EE, hence contains E\overline{E} by [L3]; by step 1.2 every point of [0,1][0,1] lies in E\overline{E}, so [0,1]jn[cj,dj][0,1] \subseteq \bigcup_{j \le n}[c_j,d_j] and [L4] gives jn(djcj)1\sum_{j \le n}(d_j - c_j) \ge 1.

step 1.2L3L4
3.1

So no finite family of closed intervals covers EE with total length at most 21<12^{-1} < 1, and EE does not have content zero by [L5] and [L7]; yet EE has measure zero by step 1.1. The claim [A1] therefore fails at EE and is false.

step 1.1step 2.1A1L5L7

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

FALSE: Q\mathbb{Q} is a GδG_\delta subset of R\mathbb{R}

Statement

False claim: Q\mathbb{Q}, that is the set QR\mathbb{Q}_{\mathbb{R}} of rationals inside R\mathbb{R} (The rationals embed densely in the reals), is a GδG_\delta set (FσF_\sigma and GδG_\delta subsets of R\mathbb{R}): there is a sequence (Vn)(V_n) of open subsets of R\mathbb{R} with QR=nVn\mathbb{Q}_{\mathbb{R}} = \bigcap_n V_n.

The claim looks plausible by symmetry. QR\mathbb{Q}_{\mathbb{R}} is FσF_\sigma, being a countable union of singletons; the irrationals are GδG_\delta, being a countable intersection of complements of singletons; and the two classes are exchanged by complementation. So one expects each set to belong to both classes. It does not: the symmetry between the two classes says nothing about a single set, and the obstruction is the Baire category theorem.

Facts & Assumptions

Given: The set QRR\mathbb{Q}_{\mathbb{R}} \subseteq \mathbb{R} of rationals.

[A1]

The false claim: QR\mathbb{Q}_{\mathbb{R}} is a GδG_\delta subset of R\mathbb{R}.

[L1]

QR\mathbb{Q}_{\mathbb{R}} is FσF_\sigma and meager, the irrationals are GδG_\delta and residual, and QR\mathbb{Q}_{\mathbb{R}} is not GδG_\delta (Q\mathbb{Q} is FσF_\sigma, meager and not GδG_\delta, while the irrationals are GδG_\delta, residual and not FσF_\sigma, claims 1, 2 and 3).

Refutation

technique · direct
1.1

By claim 3 of [L1], QR\mathbb{Q}_{\mathbb{R}} is not a GδG_\delta subset of R\mathbb{R}, which is the direct negation of [A1].

A1L1L2
1.2

The reason, recorded here so that the refutation is not merely a pointer: were QR=nVn\mathbb{Q}_{\mathbb{R}} = \bigcap_n V_n with each VnV_n open, every VnV_n would contain the dense set QR\mathbb{Q}_{\mathbb{R}} and so be dense; adjoining the dense open sets R{q}\mathbb{R} \setminus \{q\}, one for each rational qq, would produce an at most countable family of dense open sets whose intersection is QR\mathbb{Q}_{\mathbb{R}} minus every rational, that is \varnothing, contradicting [L3].

L1L2L3
2.1

So [A1] is false, and the refutation is carried out in full in [L1].

step 1.1step 1.2A1

Remarks

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

FALSE: the Cantor set is countable because only countably many intervals were removed

Statement

False claim: the Cantor set CC (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds) is at most countable (Finite, countably infinite, countable, uncountable), because it is obtained from [0,1][0,1] by removing at most countably many intervals, and what survives such a removal is the at most countable set of their endpoints.

The claim rests on two inferences and both fail. The count of removed intervals itself is correct, and it is irrelevant: removing an at most countable family of intervals from [0,1][0,1] says nothing about the cardinality of the remainder. And the endpoints do not exhaust CC: the point 1/41/4 belongs to CC and is the endpoint of no removed interval, as the remarks below record.

Facts & Assumptions

Refutation

technique · direct
1.1

CC is uncountable by [L1], which is the direct negation of [A1].

A1L1L4
1.2

A second and independent refutation, which does not go through perfect sets: the map b{kN:bk=1}b \mapsto \{\, k \in \mathbb{N} : b_k = 1 \,\} is a bijection from {0,1}N\{0,1\}^{\mathbb{N}} onto P(N)\mathcal{P}(\mathbb{N}), its inverse sending a set to its indicator sequence, so composing with [L2] gives a bijection from CC onto P(N)\mathcal{P}(\mathbb{N}). If CC were at most countable it would be nonempty and admit a surjection NC\mathbb{N} \to C by [L4], and composing with that bijection would give a surjection NP(N)\mathbb{N} \to \mathcal{P}(\mathbb{N}), contradicting [L3].

L2L3L4
2.1

So the claim [A1] is false. The premise about the removed intervals is not what fails; it is the inference from it, and step 1.2 shows why no counting of removed intervals could have settled the question: the surviving set is in bijection with the power set of N\mathbb{N}.

step 1.1step 1.2A1

Remarks

Sources