Alphabeta Math
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 · 14 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 3 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

1 · Prerequisites

2 · Summary

Objective. There are two ways for a subset of 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 0 to 1 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 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σ and Gδ subsets of R adds the two countable classes Fσ and Gδ, which are exchanged by complementation. Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets is the theorem of the page: a countable intersection of dense open subsets of R is dense, so R is not a countable union of nowhere dense sets. Q is Fσ, meager and not Gδ, while the irrationals are Gδ, residual and not Fσ then settles the status of the rationals and the irrationals completely: Q is Fσ and meager and is not Gδ, 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 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 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 needs no choice 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 Choice strengths of Baire category principles 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 ε) 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], the sum of their lengths is at least b−a says that finitely many intervals covering [a,b] have total length at least b−a, by induction on their number; A sequence of intervals covering [a,b] has total length at least b−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], 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 has measure zero covers the k-th point of a listing by an interval of length ε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, 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 Cn obtained by removing open middle thirds builds C from the self-similar recursion Cn+1=13Cn∪(23+13Cn), which is one application of the recursion theorem and needs no bookkeeping of the 2n intervals at stage n. The Cantor set is exactly the set of ∑k≥1ak3−k with every ak∈{0,2}, and this gives a bijection with {0,1}N identifies C with the set of sums ∑kak3−k−1 with every ak∈{0,2}, exhibits the bijection with {0,1}N, and extracts digits from a point of C 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 C 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 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 n≥1, an open middle interval of length 4−n from each of the 2n−1 remaining intervals runs the same shape of construction while removing, at stage n, an interval of fixed length 4−n−1 from each remaining piece, so that the total removed length is only 12. 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. That is the quantitative statement this library can make: no outer measure is defined anywhere here, so nothing is said to have measure 12, and every assertion is about covers and their total lengths.

The Cantor function. The Cantor function on [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 C, reads them in base two, and extends the result to [0,1] by c(x)=sup⁡{γ(t):t∈C, t≤x}; the supremum exists because the values lie in [0,1]. The Cantor function is well defined, satisfies c(x)≤c(y) whenever x≤y, is surjective onto [0,1], and is constant on every interval removed from the Cantor set proves that c extends γ, that c(x)≤c(y) whenever x≤y, that c is onto [0,1], and that c is constant on the closure of every gap of C, every point outside C 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; that measure zero implies content zero, refuted by Q∩[0,1]; that Q is Gδ; 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

Definition

Let A⊆R, with interior A∘ and closure A‾ as in Interior, closure, boundary and exterior of a subset of R.

  • A is nowhere dense when the interior of its closure is empty: (A‾)∘  =  ∅.
  • A is meager, or of the first category, when there is a sequence (An)n∈N of nowhere dense subsets of R with A  =  ⋃n∈NAn.
  • A is of the second category when it is not meager.
  • A is residual (also comeager) when R∖A is meager.

Why a sequence, and why that is the same as "an at most countable union". Sequences here are indexed by N, which contains 0. A finite family A0,…,Am of nowhere dense sets is turned into a sequence by setting An:=∅ for n>m, and ∅ is nowhere dense because ∅‾=∅ has empty interior; the empty family is handled the same way and gives A=∅. 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 A⊆R,

(A‾)∘=∅⟺R∖A‾ is dense in R.

Indeed, by the pointwise description of the interior (Interior, closure, boundary and exterior of a subset of R), (A‾)∘=∅ says that no x∈R admits a real ε>0 with Nε(x)⊆A‾ (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R), that is, that every Nε(x) meets R∖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 x∈R is adherent to R∖A‾, that is, R∖A‾‾=R, which is density (Limit point, isolated point, adherent point, derived set, and dense subset of 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 (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 B⊆A then B‾⊆A‾ and hence (B‾)∘⊆(A‾)∘ (Interior, closure, boundary and exterior of a subset of R), so a subset of a nowhere dense set is nowhere dense. If B⊆A=⋃nAn with each An nowhere dense, then B=⋃n(An∩B) and each An∩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=⋃nAn and M′=⋃nBn with all An and all Bn nowhere dense; fixing one witnessing sequence for M and one for M′ is two instantiations of an existential statement, not a choice principle. Let J:N×N→N be a bijection (N×N≈N) and define a sequence (Cj)j∈N by

CJ(m,n)  :=  {Anm=0,Bnm≠0.

This is a total definition because J is a bijection, every Cj is nowhere dense, and ⋃jCj=M∪M′, since An=CJ(0,n) and Bn=CJ(1,n) and every Cj is one of the An or one of the Bn.

Remarks

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

Fσ and Gδ subsets of R

Definition

Let A⊆R, with open and closed sets as in Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen.

  • A is an Fσ set when there is a sequence (Fn)n∈N of closed subsets of R with A  =  ⋃n∈NFn.
  • A is a Gδ set when there is a sequence (Vn)n∈N of open subsets of R with A  =  ⋂n∈NVn.

The letters are the traditional ones: F for fermé with σ for somme, G for Gebiet with δ for Durchschnitt.

The two classes are exchanged by complementation. A is Fσ if and only if R∖A is Gδ. If A=⋃nFn with each Fn closed, then R∖A=⋂n(R∖Fn) by De Morgan, and each R∖Fn is open by the definition of closedness (Open subset of 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 (every point has a neighbourhood inside it), closed subset (complement open), and clopen.

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

Remarks

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-27 (gpt-5)Open item page →

Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets

Statement

Let (Un)n∈N be a sequence of subsets of R, each open (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen) and dense (Limit point, isolated point, adherent point, derived set, and dense subset of R). Then

⋂n∈NUnis dense in R.

Consequently, if (An)n∈N is a sequence of nowhere dense subsets of R (Nowhere dense, meager (first category), residual, and second category subsets of R), then ⋃n∈NAn≠R: no meager subset of R exhausts R, so R is of the second category in itself.

The selection is canonical, and the proof spends no choice principle. The textbook argument picks a nested interval at every stage in terms of the one before it, which is the axiom of dependent choice. The construction below instead fixes one enumeration e of the rationals (Q is countably infinite, The rationals embed densely in the reals) and, at every stage, takes the interval whose two rational endpoints have least index among those meeting the requirements. The requirements are met by some rational-endpoint interval, which is what the refinement claim of the proof establishes, and the least such index is determined by The well-ordering principle; so the whole recursion is a single application of The recursion theorem to one total map. This is the same least-index device used later in the perfect-set development, transplanted here from perfect sets to dense open sets. What it does not settle is the strength of the theorem for general complete metric spaces; that metamathematical point is recorded separately on the choice ledger for this thread.

Facts & Assumptions

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

[A1]

Each Un is open and dense in R.

[L2]

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

[L4]

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

[L5]

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

[L6]

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

[L7]

Nested interval property: for nonempty closed bounded intervals Ik=[ak,bk] with Ik+1⊆Ik, the intersection ⋂kIk is nonempty (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 0).

[L9]

Proof

technique · constructive
1.1

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

givenL1suffices: one point in each neighbourhood
1.2

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

L4choose
1.3

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

givenconstruct
2.1

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

step 1.3A1L1L2L3L4choose
3.1

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

step 1.2step 2.1L4L5construct
4.1

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

step 1.1step 1.3step 3.1L2L4L6construct
5.1

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

step 3.1step 4.1L2
6.1

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

step 5.1L7choose
7.1

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

step 4.1step 5.1step 6.1
8.1

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

step 1.1step 7.1L1
9.1

For the consequence, let (An) be a sequence of nowhere dense sets and put Un:=R∖An‾, which is open by [L3] and [L8] and dense by [L8]; by step 8.1 the set ⋂nUn is dense, hence nonempty, and any x in it lies outside every An‾ and so outside every An, giving x∉⋃nAn and therefore ⋃nAn≠R. By [L9] the same conclusion covers a union of an at most countable family of nowhere dense sets, so no meager set is all of R.

step 8.1L1L3L8L9discharge-construct∎

Remarks

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 is Fσ, meager and not Gδ, while the irrationals are Gδ, residual and not Fσ

Statement

Write QR for the image of Q in R under the canonical embedding q↦q^ (The rationals embed densely in the reals), the set usually written Q once the identification is made, and put X:=R∖QR for the irrationals. Then:

  1. QR is an Fσ set (Fσ and Gδ subsets of R) and is meager (Nowhere dense, meager (first category), residual, and second category subsets of R);
  2. X is a Gδ set and is residual;
  3. QR is not a Gδ set, and X is not an Fσ set.

Claims 1 and 2 are bookkeeping. Claim 3 is the substance and is exactly where Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets is spent: no argument from the algebra of open and closed sets alone can reach it, since QR and X are interchanged by complementation while Fσ and Gδ are, so any such argument would prove the same thing about both sets and about neither.

Facts & Assumptions

Given: The complete ordered field R, the set QR⊆R of rationals and its complement X=R∖QR.

[L1]

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

[L3]

U is open when every point of it has a neighbourhood inside it, and F is closed when R∖F is open; Nε(x)=(x−ε,x+ε) and x∈Nε(x) (Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L5]

A is Fσ when it is the union of a sequence of closed sets and Gδ when it is the intersection of a sequence of open sets; A is Fσ if and only if R∖A is Gδ (Fσ and Gδ subsets of R).

[L7]

There is a bijection J:N×N→N (N×N≈N).

Proof

technique · contradiction
1.1

For c∈R the singleton {c} is closed and nowhere dense: its complement is open, since x≠c gives N∣x−c∣(x)⊆R∖{c} by [L3]; and its interior is empty, since for every real ε>0 the point c+ε⋅2−1 lies in Nε(c) and differs from c, so no neighbourhood is contained in {c}, whence {c} is a closed set with empty interior and [L4] applies.

L3L4
1.2

By [L1] fix a bijection β:N→Q and put e:=ι∘β with ι(q)=q^, a bijection from N onto QR.

L1choose
2.1

QR=⋃n∈N{e(n)}, since e is onto QR; the sets {e(n)} are closed and nowhere dense by step 1.1, so QR is Fσ by [L5] and meager by [L4]. This is claim 1.

step 1.1step 1.2L4L5
3.1

Put Wn:=R∖{e(n)}, an open set by step 1.1 and [L3]. A real x lies in ⋂nWn exactly when x≠e(n) for every n, that is, exactly when x∉QR, so X=⋂nWn and X is Gδ by [L5]; and R∖X=QR is meager by step 2.1, so X is residual by [L4]. This is claim 2. Each Wn is also dense, since every Nε(x) contains two distinct points and so meets R∖{e(n)}, by [L2] and [L3].

step 1.1step 1.2step 2.1L2L3L4L5
4.1

Suppose, for contradiction, that QR is Gδ, and by [L5] fix a sequence (Vn) of open sets with QR=⋂nVn. Each Vn contains QR, which is dense by [L2], so each Vn is dense by [L2]; and each Wn of step 3.1 is open and dense.

assume-contrastep 3.1L2L5choose
5.1

By [L7] fix a bijection J:N×N→N and define a sequence (Dj) by DJ(m,n):=Vn when m=0 and DJ(m,n):=Wn when m≠0; this is total because J is a bijection, and every Dj is open and dense by step 4.1. Moreover ⋂jDj=(⋂nVn)∩(⋂nWn)=QR∩X=∅, since every Vn and every Wn occurs among the Dj and every Dj is one of them.

step 3.1step 4.1L7
6.1

By [L6] the set ⋂jDj is dense, hence nonempty by [L2] and [L3], contradicting step 5.1. The assumption of step 4.1 is therefore untenable: QR is not Gδ; and X is not Fσ, since R∖X=QR would then be Gδ 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 ε) and content zero (a finite such cover)

Definition

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

  • A has measure zero, equivalently A is null, when for every real ε>0 there are sequences (ak)k∈N and (bk)k∈N of reals with ak≤bk for every k, such that A⊆⋃k∈N[ak,bk]and∑k=0∞(bk−ak) converges with sum ≤ε.
  • A has content zero when for every real ε>0 there are n∈N and reals a0≤b0,…,an≤bn with A⊆⋃j≤n[aj,bj]and∑j=0n(bj−aj)≤ε.

The number bk−ak≥0 is the length of [ak,bk] (Intervals of 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 bk−ak are ≥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,

∑k=0∞(bk−ak) converges with sum≤ε⟺∑k<n(bk−ak)≤ε  for every n∈N,

since a supremum is ≤ε exactly when ε 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 a≤b is contained in [a,b] and has the same length (Intervals of 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) is carried out where it is needed, in A sequence of intervals covering [a,b] has total length at least b−a, so no interval of positive length has measure zero and in For a compact subset of R, measure zero and content zero coincide.

Both notions are inherited by subsets. If B⊆A and A is null, then any cover of A covers B, so B 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] with the degenerate intervals [0,0] for k>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], the sum of their lengths is at least b−a

Statement

Let a,b∈R with a≤b, let n∈N, and let c0≤d0, …, cn≤dn be reals such that

[a,b]  ⊆  ⋃j≤n[cj,dj],

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

∑j=0n(dj−cj)  ≥  b−a.

The same bound holds for a cover by bounded intervals of any of the four bounded forms, since an interval with endpoints c≤d is contained in [c,d] and has the same length d−c (Intervals of 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 b−a cannot cover [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]. Four items on this page rest on it: A sequence of intervals covering [a,b] has total length at least b−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 n∈N let P(n) be the assertion: for all reals a≤b and all reals c0≤d0,…,cn≤dn with [a,b]⊆⋃j≤n[cj,dj], one has ∑j≤n(dj−cj)≥b−a. The lemma is that P(n) holds for every n∈N.

[L1]

[c,d]={ x:c≤x≤d }, its length is d−c≥0 when c≤d, and [a,b] is nonempty exactly when a≤b (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L2]

Finite sums: ∑j≤ntj=∑j<n+1tj with ∑j<0tj=0 and ∑j<m+1tj=∑j<mtj+tm; sums split as ∑j<mtj=∑j<itj+∑j=im−1tj for i≤m, where ∑j=im−1tj=∑l<m−iti+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).

[L4]

Ordered-field arithmetic: 0<1, so 2:=1+1>0 and 0<t⋅2−1<t for t>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) for every n∈N, with P as in the Given, and the argument is an induction on n using [L3].

givenL3induction
1.2

Base, n=0. Let a≤b and [a,b]⊆[c0,d0] with c0≤d0. Then a∈[a,b] and b∈[a,b] by [L1], so c0≤a and b≤d0, whence d0−c0≥b−a by [L4]; and ∑j≤0(dj−cj)=d0−c0 by [L2]. So P(0) holds.

baseL1L2L4
1.3

Induction hypothesis. Fix n∈N and assume P(n).

ihgiven
2.1

The induction step: the two easy cases. Let a≤b and let c0≤d0,…,cn+1≤dn+1 satisfy [a,b]⊆⋃j≤n+1[cj,dj]; write S:=∑j≤n+1(dj−cj), a sum of nonnegative terms by [L1]. If a=b then b−a=0≤S by [L2]. Otherwise a<b; then a∈[a,b] by [L1], so there is i≤n+1 with a∈[ci,di], that is ci≤a≤di, and we fix one such i. If di≥b then di−ci≥b−a by [L4], and di−ci≤S by [L2], so S≥b−a. There remains the case a<b and di<b.

step 1.1L1L2L4choose
3.1

The induction step: the remaining case, where the i-th interval is deleted. Assume a<b and di<b, and define n+1 pairs by (cl′,dl′):=(cl,dl) for l<i and (cl′,dl′):=(cl+1,dl+1) for i≤l≤n; by the splitting law and the index-shift convention of [L2], S′:=∑l≤n(dl′−cl′)=S−(di−ci). Let η be any real with 0<η≤b−di and put c:=di+η, so di<c≤b. Every x∈[c,b] satisfies x≥c>di, hence x∉[ci,di] by [L1], and satisfies a≤di<x≤b, hence x∈[a,b]; so x lies in some [cj,dj] with j≠i, that is in some [cl′,dl′]. Thus [c,b]⊆⋃l≤n[cl′,dl′] with c≤b, and step 1.3 gives S′≥b−c=b−di−η.

step 1.3step 2.1L1L2L4
4.1

Passing to the limiting value of η, and the conclusion. In the case of step 3.1 one has S′≥b−di: were S′<b−di, the real η0:=(b−di−S′)⋅2−1 would satisfy 0<η0<b−di by [L4], so step 3.1 would give S′≥b−di−η0=(b−di+S′)⋅2−1>S′, which is impossible. Hence S=(di−ci)+S′≥(di−a)+(b−di)=b−a by [L4], using ci≤a from step 2.1. Together with the cases settled in step 2.1 this proves P(n+1), so by [L3] P(n) holds for every n∈N.

step 2.1step 3.1L2L3L4discharge-induction∎

Remarks

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

  • Degenerate covering intervals are allowed and cost nothing. A pair with cj=dj contributes the single point cj and the length 0, 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] covers [a,b] with total length exactly b−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] has total length at least b−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] has total length at least b−a, so no interval of positive length has measure zero

Statement

Let a,b∈R with a≤b, let (ak)k∈N and (bk)k∈N be sequences of reals with ak≤bk for every k, and suppose

[a,b]  ⊆  ⋃k∈N[ak,bk].

If M∈R satisfies ∑k<n(bk−ak)≤M for every n∈N, then

M  ≥  b−a.

Consequently, if a<b then no subset of R containing [a,b] has measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)); in particular none of the four bounded intervals [a,b], (a,b), [a,b), (a,b] with a<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], the sum of their lengths is at least b−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 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 a≤b, sequences (ak) and (bk) with ak≤bk for every k and [a,b]⊆⋃k[ak,bk], and a real M with ∑k<n(bk−ak)≤M for every n∈N. Throughout, θ:=2−1.

[L1]

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

[L2]

[c,d]={ x:c≤x≤d } has length d−c≥0 when c≤d; (c,d) is the open interval; a closed bounded interval is bounded (Intervals of R: the nine order-convex forms, nondegeneracy, and length, Lower bound, bounded below, bounded set).

[L4]

A subset of R is compact exactly when it is closed and bounded (A subset of 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 m∈N and members U0,…,Um of the family whose union already contains it (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset).

[L5]

If [a,b]⊆⋃j≤n[cj,dj] with cj≤dj and a≤b, then ∑j≤n(dj−cj)≥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], the sum of their lengths is at least b−a).

[L6]

Powers and the geometric series: θ0=1 and θk+1=θkθ, all θk>0 for θ>0, and ∑k=0∞θk=1/(1−θ)=2 for θ=2−1; a series of nonnegative terms has all its partial sums at most its sum (Integer powers am, For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥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,…,km of naturals has an upper bound K∈N: by induction on m, taking K=0 for the empty case and replacing K by whichever of K and km+1 is the larger, the order of N being total (The principle of mathematical induction, Trichotomy of the order on N, Order on the natural numbers).

[L9]

Ordered-field arithmetic: 0<1, so 2>0 and 0<t⋅2−1<t for t>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<b−a. Since ∑k<0(bk−ak)=0 by [L7], we have M≥0, so b−a>0 and a<b. Put ε:=(b−a−M)⋅2−1, a positive real by [L9].

assume-contragivenL7L9
2.1

For k∈N put δk:=ε⋅4−1⋅θk, a positive real by [L6] and [L9], and Jk:=(ak−δk, bk+δk). Each Jk is an open set by [L3], and [ak,bk]⊆Jk because ak−δk<ak≤x≤bk<bk+δk for x∈[ak,bk], by [L2] and [L9]. Hence [a,b]⊆⋃k[ak,bk]⊆⋃kJk, so { Jk:k∈N } is a family of open sets whose union contains [a,b]. The length of the interval with endpoints ak−δk and bk+δk is (bk−ak)+2δk=(bk−ak)+ε⋅2−1⋅θk, by [L2] and [L9].

step 1.1givenL2L3L6L9
3.1

[a,b] is closed and bounded by [L2] and [L3], hence compact by [L4]; so there are m∈N and members Jk0,…,Jkm of the family with [a,b]⊆Jk0∪⋯∪Jkm. By [L8] fix K∈N with kt≤K for every t≤m; then every Jkt occurs among J0,…,JK, so [a,b]⊆⋃k≤KJk.

step 2.1L2L3L4L8choose
4.1

By [L5], applied to the K+1 intervals Jk with endpoints ak−δk≤bk+δk, one gets ∑k≤K((bk−ak)+ε⋅2−1⋅θk)≥b−a.

step 2.1step 3.1L5
5.1

The left-hand side is at most M+ε: by [L7] it splits as ∑k<K+1(bk−ak)+ε⋅2−1∑k<K+1θk, the first sum is ≤M by hypothesis, and the second is ≤ε⋅2−1⋅2=ε by [L6]. So b−a≤M+ε=(b−a+M)⋅2−1<b−a by [L9], which is impossible; the assumption of step 1.1 is untenable and M≥b−a. For the consequence, let a<b and let A⊇[a,b] be null; taking ε1:=(b−a)⋅2−1>0 in [L1] gives a sequence of closed intervals covering A, hence covering [a,b], with every partial total length ≤ε1, so what has just been proved gives (b−a)⋅2−1≥b−a and hence b−a≤0 by [L9], contradicting a<b. Finally each of (a,b), [a,b), (a,b] and [a,b] with a<b contains [a′,b′] for a′:=a+(b−a)⋅4−1 and b′:=b−(b−a)⋅4−1, which satisfy a<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(bk−ak)≤M says. It is the working form of "the total length is at most M" recorded in Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover): for nonnegative terms, having all partial sums below M is the same as convergence with sum below M. Stating the lemma with partial sums avoids assuming convergence, and the conclusion is therefore also the statement that a cover of [a,b] whose total length diverges is no counterexample.

  • The ε is spent on making the cover open, not on the estimate. Enlarging [ak,bk] to (ak−δk,bk+δk) adds 2δk to the k-th length, and the geometric choice δk=εθk/4 makes the whole added amount at most ε, however many intervals are used. This is the standard device and it recurs in For a compact subset of 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] is covered by countably many intervals of total length below any ε, and by no finite family of total length below 1 (Q∩[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 has measure zero

Statement

Every at most countable set A⊆R (Finite, countably infinite, countable, uncountable) has measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

The cover is explicit: the k-th point of a listing of A is put inside an interval of length ε⋅2−k−1, and the lengths sum to ε by For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges. No choice principle is used: a listing of A is a single object, fixed once (A nonempty set is at most countable iff it is a surjective image of N), and everything after that is a formula in k.

Facts & Assumptions

Given: An at most countable set A⊆R and a real ε>0. Throughout, θ:=2−1.

[L1]

A is null when for every real ε>0 there are sequences (ak), (bk) with ak≤bk, A⊆⋃k[ak,bk], and ∑k<n(bk−ak)≤ε for every n∈N (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

[L2]

[c,d]={ x:c≤x≤d } has length d−c when c≤d, and [c,c]={c} has length 0 (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L4]

Powers and the geometric series: θ0=1, θk+1=θkθ, θk>0, and ∑k=0∞θk=2 for θ=2−1; a series of nonnegative terms has all its partial sums at most its sum (Integer powers am, For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥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 (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L6]

Ordered-field arithmetic: 0<1, so 2>0, 4>0 and t⋅4−1>0 for t>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 be given. If A=∅, the constant sequences ak:=0 and bk:=0 satisfy A⊆⋃k[0,0] vacuously and ∑k<n(bk−ak)=0≤ε for every n by [L5], so the condition of [L1] holds at this ε. Assume from now on that A≠∅ and, by [L3], fix a surjection s:N→A.

givenL1L2L3L5choose
2.1

Put δk:=ε⋅4−1⋅θk, a positive real by [L4] and [L6], and ak:=s(k)−δk, bk:=s(k)+δk; then ak≤bk and s(k)∈[ak,bk] by [L6], so A={ s(k):k∈N }⊆⋃k[ak,bk] by step 1.1. The length of [ak,bk] is bk−ak=2δk=ε⋅2−1⋅θk by [L2] and [L6].

step 1.1L2L4L6
3.1

For every n∈N, ∑k<n(bk−ak)=ε⋅2−1∑k<nθk≤ε⋅2−1⋅2=ε, 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 the sequences of step 2.1 cover A with all partial total lengths at most ε, which by [L1] is exactly the statement that A 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ω)). Let (An)n∈N be a sequence of subsets of R, each of measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)). Then

⋃n∈NAnhas measure zero.

By the padding convention of Measure zero (a countable cover by intervals of total length below every ε) 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 ∅.

The hypothesis ACω is spent at exactly one step, step 2.1 below, where one covering sequence is selected for every An at once. Each An 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)n∈N of null subsets of R and a real ε>0. Throughout, θ:=2−1.

[A1]

The Axiom of Countable Choice: every family (Xn)n∈N of nonempty sets has a function f on N with f(n)∈Xn for every n (The Axiom of Countable Choice (ACω)).

[L1]

A is null when for every real η>0 there are sequences (ak), (bk) with ak≤bk, A⊆⋃k[ak,bk] and ∑k<n(bk−ak)≤η for every n (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

[L2]

There is a bijection J:N×N→N, with inverse J−1 (N×N≈N, Injection, surjection, bijection).

[L3]

Powers and the geometric series: θ0=1, θm+1=θmθ, θm>0, and ∑m=0∞θm=2 for θ=2−1; a series of nonnegative terms has all its partial sums at most its sum (Integer powers am, For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥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, by induction on its length and the totality of the order of N (The principle of mathematical induction, Trichotomy of the order on N, Order on the natural numbers).

[L6]

Ordered-field arithmetic: 0<1, so 2>0 and t⋅2−1>0 for t>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 be given and put εn:=ε⋅θn+1 for n∈N, a positive real by [L3] and [L6]. Let Xn be the set of all pairs of sequences ((ak),(bk)) with ak≤bk for every k, An⊆⋃k[ak,bk] and ∑k<i(bk−ak)≤εn for every i∈N. Each An is null, so each Xn is nonempty by [L1].

givenL1L3L6
2.1

By [A1] fix f with f(n)∈Xn for every n, and write f(n)=((akn)k,(bkn)k). 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×N→N and define sequences (cj) and (dj) by cJ(m,k):=akm and dJ(m,k):=bkm, which is a total definition because J is a bijection; then cj≤dj for every j. Every x∈⋃nAn lies in some Am, hence in some [akm,bkm]=[cJ(m,k),dJ(m,k)] by step 2.1, so ⋃nAn⊆⋃j[cj,dj].

step 2.1L2
4.1

Fix i∈N. The pairs J−1(j) for j<i are finitely many and pairwise distinct, so by [L5] there is N∈N with both coordinates of each of them at most N; since all the terms dj−cj are nonnegative, [L4] gives ∑j<i(dj−cj)≤∑m≤N(∑k≤N(bkm−akm)). For each m≤N the inner sum is ∑k<N+1(bkm−akm)≤εm by step 2.1, so the whole is at most ∑m≤Nε⋅θm+1=ε⋅θ∑m<N+1θm≤ε⋅2−1⋅2=ε, by [L3], [L4] and [L6].

step 3.1L3L4L5L6
5.1

Steps 3.1 and 4.1 exhibit, for the given ε>0, sequences of closed intervals covering ⋃nAn with every partial total length at most ε; since ε>0 was arbitrary, [L1] gives that ⋃nAn 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 A⊆R has content zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)) then A has measure zero.

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

Facts & Assumptions

Given: A set A⊆R of content zero and a real ε>0.

[L1]

A has content zero when for every real η>0 there are n∈N and reals a0≤b0,…,an≤bn with A⊆⋃j≤n[aj,bj] and ∑j≤n(bj−aj)≤η; A is null when for every real η>0 there are sequences with the analogous properties and ∑k<i(bk−ak)≤η for every i∈N (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

[L2]

[c,c]={c} is an interval of length 0, and [c,d] has length d−c≥0 for c≤d (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L3]

Finite sums: ∑k<itk=∑k<n+1tk+∑k=n+1i−1tk for n+1≤i, a sum of nonnegative terms is nonnegative and is monotone in the number of nonnegative terms adjoined, and ∑k<itk≤∑k<n+1tk whenever i≤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 be given; since A has content zero, [L1] supplies n∈N and reals a0≤b0,…,an≤bn with A⊆⋃j≤n[aj,bj] and ∑j≤n(bj−aj)≤ε.

givenL1choose
2.1

Extend the finite list to sequences by putting ak:=0 and bk:=0 for k>n; then ak≤bk for every k∈N, the added intervals [0,0] have length 0 by [L2], and A⊆⋃j≤n[aj,bj]⊆⋃k∈N[ak,bk].

step 1.1L2
3.1

For every i∈N one has ∑k<i(bk−ak)≤ε: all the terms are nonnegative by [L2], so for i≤n+1 the sum is at most ∑k<n+1(bk−ak)=∑j≤n(bj−aj)≤ε by [L3] and step 1.1, and for i>n+1 the sum equals ∑k<n+1(bk−ak) plus a sum of terms all equal to 0, hence is again at most ε, by [L3] and [L4].

step 1.1step 2.1L2L3L4
4.1

So for every real ε>0 there is a sequence of closed intervals covering A with every partial total length at most ε, which by [L1] is exactly the statement that A 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, measure zero and content zero coincide

Statement

Let K⊆R be compact (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset), equivalently closed and bounded (A subset of R is compact if and only if it is closed and bounded). Then

K has measure zero⟺K has content zero

(Measure zero (a countable cover by intervals of total length below every ε) 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 K. The other direction is the one that uses compactness, and it uses it exactly as A sequence of intervals covering [a,b] has total length at least b−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 K⊆R and a real ε>0. Throughout, θ:=2−1.

[L1]

A is null when for every real η>0 there are sequences (ak), (bk) with ak≤bk, A⊆⋃k[ak,bk] and ∑k<i(bk−ak)≤η for every i; A has content zero when the same holds with a finite list (Measure zero (a countable cover by intervals of total length below every ε) 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] has length d−c≥0 for c≤d; (c,d) is the open interval with the same endpoints and is contained in [c,d] (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L5]

K is compact: from every family of open sets whose union contains K, either K=∅ and the empty subfamily covers it, or there are m∈N and members U0,…,Um of the family whose union contains K; compactness is equivalent to being closed and bounded (Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset, A subset of R is compact if and only if it is closed and bounded).

[L6]

Powers and the geometric series: θ0=1, θk+1=θkθ, θk>0, and ∑k=0∞θk=2 for θ=2−1; a series of nonnegative terms has all its partial sums at most its sum (Integer powers am, For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥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, by induction on its length and the totality of the order of N (The principle of mathematical induction, Trichotomy of the order on N, Order on the natural numbers).

[L9]

Ordered-field arithmetic: 0<1, so 2>0, 4>0, 8>0 and t⋅8−1>0 for t>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 K has content zero then K is null by [L2], with no hypothesis on K used. It remains to prove the converse for compact K.

L2suffices: only the forward direction remains
1.2

If K=∅, then for every real ε>0 the single interval [0,0] covers K and has total length 0≤ε, so K has content zero by [L1]. Hence suppose K≠∅ for the rest of the proof.

L1cases
2.1

Assume K is null and let the real ε>0 be given. By [L1] applied with η:=ε⋅2−1>0 fix sequences (ak), (bk) with ak≤bk, K⊆⋃k[ak,bk] and ∑k<i(bk−ak)≤ε⋅2−1 for every i∈N.

step 1.1givenL1L9choose
3.1

Put δk:=ε⋅8−1⋅θk, a positive real by [L6] and [L9], and Jk:=(ak−δk, bk+δk), an open set by [L4] containing [ak,bk] by [L3] and [L9]. Hence { Jk:k∈N } is a family of open sets whose union contains K, and the closed interval [ak−δk, bk+δk] has length (bk−ak)+2δk=(bk−ak)+ε⋅4−1⋅θk by [L3] and [L9].

step 2.1L3L4L6L9
4.1

By [L5] there are m∈N and members Jk0,…,Jkm of that family covering K, and by [L8] there is N∈N with kt≤N for every t≤m; then K⊆⋃k≤NJk⊆⋃k≤N[ak−δk, bk+δk] by [L3].

step 1.2step 3.1L3L5L8choose
5.1

The total length of that finite list is ∑k≤N((bk−ak)+ε⋅4−1θk)=∑k<N+1(bk−ak)+ε⋅4−1∑k<N+1θk≤ε⋅2−1+ε⋅4−1⋅2=ε, by [L7], step 2.1, [L6] and [L9].

step 2.1step 3.1step 4.1L6L7L9
6.1

So for every real ε>0 the finite list of step 4.1 covers K with total length at most ε, which by [L1] is exactly the statement that K 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 Cn obtained by removing open middle thirds

Definition

For S⊆R write

13S  :=  { x⋅3−1:x∈S },23+13S  :=  { 2⋅3−1+x⋅3−1:x∈S },

and let F:P(R)→P(R) be

F(S)  :=  13S ∪ (23+13S).

By the recursion theorem (The recursion theorem), applied to the set P(R), the starting element [0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and the function F, there is a unique family (Cn)n∈N of subsets of R with

C0=[0,1],Cn+1=F(Cn)=13Cn∪(23+13Cn)(n∈N).

The Cantor middle-thirds set is

C  :=  ⋂n∈NCn.

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),

the middle equality because x↦x⋅3−1 is an order isomorphism of R onto itself with inverse x↦3x (Ordered field, Sign rules for products and monotonicity of multiplication), and the last because 0≤x≤1 splits, by totality of the order, into x≤13, 13<x<23 and x≥23. The recursion then performs the same operation inside each of the two scaled copies, which is what "removing the open middle thirds" names.

Every Cn lies in [0,1], by induction on n (The principle of mathematical induction): C0=[0,1]; and if Cn⊆[0,1] then 13Cn⊆[0,13] and 23+13Cn⊆[23,1], so Cn+1⊆[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+1 are disjoint, the first lying in [0,13] and the second in [23,1], and 13<23 (The multiplicative identity is positive).

The family is nested, Cn+1⊆Cn for every n, again by induction. For n=0 this is C1=[0,13]∪[23,1]⊆[0,1]. And F is monotone, in the sense that S⊆T implies F(S)⊆F(T), directly from the displayed description of F; so Cn+1⊆Cn gives Cn+2=F(Cn+1)⊆F(Cn)=Cn+1. Consequently C=⋂nCn⊆Cm for every m, and ⋂nCn+1=⋂nCn=C.

Powers. Here 3−n means (3−1)n, the integer power of Integer powers am, so that 30=1, 3−(n+1)⋅3=3−n and 3−n>0 for every n (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 ∑k≥1ak3−k with every ak∈{0,2}, and this gives a bijection with {0,1}N

Statement

Let D be the set of sequences a:N→{0,2} (Sequences of reals: bounded, eventually, frequently, tails, subsequences), the two values being the real numbers 0 and 2. For a∈D the series ∑k≥0ak3−k−1 converges (Series, partial sums, convergence and the sum, divergence, and the tail series); write

Φ(a)  :=  ∑k=0∞ak3−k−1.

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

  1. Φ(a)∈[0,1] for every a∈D, and C={ Φ(a):a∈D };
  2. Φ is injective, so Φ is a bijection from D onto C (Injection, surjection, bijection);
  3. consequently b↦Φ((2bk)k) is a bijection from {0,1}N, the set of sequences with values in {0,1}, onto C;
  4. C=13C∪(23+13C), and the two sets on the right are disjoint.

On the indexing. The digit ak carries the weight 3−k−1, so the series starts at k=0 with the term a0/3; written with the classical 1-based index it reads ∑k≥1ak3−k, which is the form in the title. Sequences in this library are functions on N and N contains 0 (Sequences of reals: bounded, eventually, frequently, tails, subsequences), so the 0-based form is the one used throughout the proof.

Facts & Assumptions

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

[L1]

The Cantor set: C0=[0,1], Cn+1=13Cn∪(23+13Cn), C=⋂nCn=⋂nCn+1, every Cn⊆[0,1], the two halves of Cn+1 lie in [0,13] and in [23,1] respectively and are disjoint, and 3−n denotes (3−1)n (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L2]

Series: partial sums sn=∑k<ntk, convergence of (sn), the sum as its limit, the tail clause ∑k≥mtk and the identity ∑k<n+1tk=t0+∑j<ntj+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 (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum).

[L5]

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

[L7]

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

[L8]

3−n→0 (For ∣r∣<1 the sequence rk is null, and for ∣r∣>1 the sequence ∣r∣k diverges to +∞); convergence is tested against rational ε>0 and a convergent sequence has exactly one limit (Limits and Cauchy sequences of reals, A sequence has at most one limit); ∣z∣≥0 and ∣z∣=z for z≥0 (Basic properties of the absolute value).

[L9]

Ordered-field arithmetic: 0<1, so 2>0 and 3>0 and 3−1>0, and 3−1<2⋅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

Φ is well defined and takes values in [0,1]. For a∈D every term ak3−k−1 is ≥0 by [L1] and [L9], and for every n the partial sum satisfies ∑k<nak3−k−1≤∑k<n2⋅3−1⋅3−k=2⋅3−1∑k<n3−k≤2⋅3−1⋅3⋅2−1=1, by [L3], [L4] and [L9]. So by [L3] the series converges, its sum Φ(a) satisfies 0≤Φ(a)≤1, and Φ(a)∈[0,1] by [L1].

givenL1L3L4L9
1.2

Shift identity: Φ(a)=a0⋅3−1+3−1Φ(σa) for every a∈D. Indeed by [L2] the partial sums satisfy ∑k<n+1ak3−k−1=a03−1+∑j<naj+13−j−2=a03−1+3−1∑j<naj+13−j−1, using 3−j−2=3−1⋅3−j−1 from [L1] and [L9]; letting n grow and using [L5] and [L2] gives the identity.

givenL1L2L5L9
1.3

Self-similarity of C, claim 4. If y∈C then y∈Cn for every n, so y⋅3−1∈13Cn⊆Cn+1 and 2⋅3−1+y⋅3−1∈23+13Cn⊆Cn+1 for every n, whence both lie in ⋂nCn+1=C by [L1]; this gives the inclusion ⊇. Conversely let x∈C, so x∈Cn+1 for every n. By [L1] the first half of Cn+1 lies in [0,13] and the second in [23,1], and 13<23 by [L9]. If x≤13 then x∉[23,1], so for every n one has x∈13Cn, that is 3x∈Cn; hence 3x∈C and x∈13C. If x>13 then x∉[0,13], so for every n one has x∈23+13Cn, that is 3x−2∈Cn; hence 3x−2∈C and x∈23+13C. Disjointness is [L1] and [L9], since 13C⊆[0,13] and 23+13C⊆[23,1].

L1L9
2.1

Φ(a)∈C for every a∈D. By induction on n ([L6]) the statement "for every a∈D, Φ(a)∈Cn" holds for every n: at n=0 it is step 1.1 and [L1]; and if it holds at n, then for a∈D the value a0 is 0 or 2, so step 1.2 gives Φ(a)=3−1Φ(σa)∈13Cn in the first case and Φ(a)=2⋅3−1+3−1Φ(σa)∈23+13Cn in the second, so Φ(a)∈Cn+1 by [L1]. Hence Φ(a)∈⋂nCn=C.

step 1.1step 1.2L1L6
2.2

The digit recursion. Fix x∈C and let T:R→R be T(y):=3y for y≤3−1 and T(y):=3y−2 for y>3−1, a definition by cases on the total order ([L9]) and so a genuine function. By [L6] there is y:N→R with y0=x and yn+1=T(yn); put an:=0 when yn≤3−1 and an:=2 otherwise, so that a∈D and yn+1=3yn−an for every n. Every yn lies in C, by induction on n: y0=x∈C; and if yn∈C then, by step 1.3, either yn∈13C⊆[0,13] or yn∈23+13C⊆[23,1], and these two cases are exactly yn≤13 and yn>13 by [L9]; in the first yn=z⋅3−1 with z∈C and yn+1=3yn=z∈C, in the second yn=2⋅3−1+z⋅3−1 with z∈C and yn+1=3yn−2=z∈C.

step 1.3L1L6L9
2.3

Φ is injective. Let a,b∈D with a≠b; the set of k with ak≠bk is a nonempty subset of N, so by [L7] it has a least element k, and by symmetry we may take ak=0 and bk=2. By [L5], Φ(b)−Φ(a)=∑j≥0(bj−aj)3−j−1, and the terms with j<k vanish, so by [L2] this equals 2⋅3−k−1+R with R:=∑j≥k+1(bj−aj)3−j−1. Every bj−aj is at least −2, so the series ∑j≥k+1((bj−aj)+2)3−j−1 has nonnegative terms and hence nonnegative sum by [L3], giving R≥−∑j≥k+12⋅3−j−1=−2⋅3−k−2⋅3⋅2−1=−3−k−1 by [L2], [L4], [L5] and [L9]. Therefore Φ(b)−Φ(a)≥2⋅3−k−1−3−k−1=3−k−1>0 and Φ(a)≠Φ(b).

step 1.1L2L3L4L5L7L9
3.1

The value is recovered from the digits. With x, (yn) and a as in step 2.2, put sn:=∑k<nak3−k−1. Then x=sn+3−nyn for every n, by induction on n ([L6]): at n=0 both sides are x, since s0=0 by [L2] and 30=1; and if x=sn+3−nyn then sn+1+3−n−1yn+1=sn+an3−n−1+3−n−1(3yn−an)=sn+3−nyn=x, using [L1], [L2] and [L9].

step 2.2L1L2L6L9
4.1

Hence x=Φ(a), so C⊆Φ[D]. Every yn lies in C⊆[0,1] by step 2.2 and [L1], so 0≤x−sn=3−nyn≤3−n by step 3.1 and [L9]. Given a rational ε>0, [L8] supplies N with 3−n<ε for all n≥N, and then ∣sn−x∣=x−sn≤3−n<ε by [L8]; so sn→x. But sn→Φ(a) by [L2], since (sn) is the sequence of partial sums of the series defining Φ(a), and limits are unique by [L8]; therefore x=Φ(a) with a∈D.

step 2.2step 3.1L1L2L8L9
5.1

By steps 2.1 and 4.1 the image of D under Φ is exactly C, which with step 1.1 is claim 1; step 2.3 is claim 2, so Φ is a surjection from D onto C that is injective, that is, a bijection (Injection, surjection, bijection); the map b↦(2bk)k is a bijection from {0,1}N onto D, with inverse a↦(ak⋅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 C be the Cantor set (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds). Then:

  1. C is closed and bounded, hence compact (A subset of R is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset);
  2. C has content zero, and therefore measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover));
  3. C is perfect (Perfect subset of R: closed with no isolated points);
  4. C is uncountable (Finite, countably infinite, countable, uncountable);
  5. C contains no interval with two distinct endpoints, and is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of R);
  6. every nonempty connected subset of C (Separated sets, disconnection, and connected subset of 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 is connected if and only if it is order-convex, that is, an interval.

Facts & Assumptions

[L1]

C0=[0,1], Cn+1=13Cn∪(23+13Cn), C=⋂nCn⊆Cm for every m, every Cn⊆[0,1], 0∈C, and 3−n=(3−1)n (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds, Intervals of R: the nine order-convex forms, nondegeneracy, and length, Integer powers am, Laws of integer exponents).

[L3]

[c,d] is a closed set and a bounded interval, (c,d) is open, Nε(x)=(x−ε,x+ε), and every open set contains a neighbourhood of each of its points (Intervals of R: the nine order-convex forms, nondegeneracy, and length, Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[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 are open, and dually for closed sets).

[L10]

∣r∣k→0 for ∣r∣<1 (For ∣r∣<1 the sequence rk is null, and for ∣r∣>1 the sequence ∣r∣k diverges to +∞); convergence to 0 is tested against rational ε>0 (Limits and Cauchy sequences of reals); ∣z∣≥0, ∣z∣=z for z≥0, and ∣uv∣=∣u∣∣v∣ (Basic properties of the absolute value).

[L11]

Induction on 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<1, so 2>0, 3>0, 3−1>0 and 0<2⋅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

C is compact, claim 1. First, for λ≠0 and c∈R the set λS+c:={λs+c:s∈S} is closed whenever S is: if x∉λS+c then (x−c)λ−1∉S, so by [L3] there is a real η>0 with Nη((x−c)λ−1)∩S=∅, and every z with ∣z−x∣<∣λ∣η satisfies ∣(z−c)λ−1−(x−c)λ−1∣=∣z−x∣⋅∣λ∣−1<η by [L10] and [L12], hence (z−c)λ−1∉S and z∉λS+c. Now every Cn is closed, by induction on n ([L11]): C0=[0,1] is closed by [L3], and Cn+1 is the union of the two closed sets 13Cn and 23+13Cn, hence closed by [L4]. So C=⋂nCn is closed by [L4], and C⊆[0,1] is bounded by [L1] and [L3]; by [L5] it is compact.

L1L3L4L5L10L11L12
1.2

C has content zero and measure zero, claim 2. By induction on n ([L11]) the following holds for every n: there are m∈N and reals u0≤v0,…,um≤vm with Cn⊆⋃j≤m[uj,vj] and ∑j≤m(vj−uj)=(2⋅3−1)n. At n=0 take the single interval [0,1], of total length 1=(2⋅3−1)0 by [L1]. Given such a list at n, define 2m+2 intervals by [uj3−1, vj3−1] for j≤m and [2⋅3−1+uj−m−13−1, 2⋅3−1+vj−m−13−1] for m<j≤2m+1; they cover 13Cn and 23+13Cn respectively, hence cover Cn+1, and their total length is 3−1(2⋅3−1)n+3−1(2⋅3−1)n=(2⋅3−1)n+1 by [L11] and [L12]. Since 0<2⋅3−1<1 by [L12], [L10] gives, for every real ε>0, an n with (2⋅3−1)n≤ε; as C⊆Cn by [L1], the corresponding finite list covers C with total length at most ε. So C has content zero by [L6], and hence measure zero by [L6].

L1L6L10L11L12
2.1

C is perfect, claim 3. C is closed by step 1.1. Let x∈C and let the real ε>0 be given. By [L2] write x=Φ(a) with a∈D. By [L10] and [L12] fix k∈N with 2⋅3−k−1<ε, and define b∈D by bj:=aj for j≠k and bk:=2−ak, so bk∈{0,2} and b≠a. Then Φ(b)∈C and Φ(b)≠Φ(a) by [L2], while Φ(b)−Φ(a)=∑j≥0(bj−aj)3−j−1=(bk−ak)3−k−1 by [L2], all other terms being 0, so ∣Φ(b)−x∣=2⋅3−k−1<ε by [L10]. Thus Nε(x) contains a point of C other than x, for every ε, so x is not isolated in C; by [L7] C is perfect.

step 1.1L2L7L10L12
2.2

C contains no nondegenerate interval and is nowhere dense, claim 5. By step 1.2 the set C is null, so by [L6] it contains no [u,v] with u<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)⊆C for some real ε>0, then [x−ε⋅2−1, x+ε⋅2−1]⊆Nε(x)⊆C by [L3] and [L12], an interval with distinct endpoints. Since C is closed by step 1.1, it equals its closure, so [L8] gives that C is nowhere dense.

step 1.1step 1.2L3L6L8L12
3.1

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

step 2.1L1L7
3.2

Connected subsets, claim 6. Let E⊆C be connected and nonempty. By [L9] E is order-convex, so if u,v∈E with u<v then [u,v]⊆E⊆C, contradicting step 2.2. Hence no two distinct elements of E exist, and E, 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 n≥1, an open middle interval of length 4−n from each of the 2n−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 with starting element (0,1) and the map (n,t)↦(n+1, (t−4−n−1)⋅2−1)) there is a unique sequence (λn)n∈N of reals with

λ0=1,λn+1=(λn−4−n−1)⋅2−1(n∈N),

powers being those of Integer powers am. Put gn:=λn−λn+1.

The left endpoints. Let F be the set of pairs (N,ℓ) with N∈N, N≥1, and ℓ a function from { j∈N:j<N } to R; such a pair is a finite list of reals of length N. Applying The recursion theorem to N×F, the starting element (0,(1,ℓ(0))) with ℓ0(0):=0, and the map that sends (n,(N,ℓ)) to (n+1,(N+N,ℓ′)) where

ℓj′:=ℓj  (j<N),ℓj′:=ℓj−N+gn  (N≤j<N+N),

gives a unique family (Nn,ℓ(n))n∈N of finite lists, with N0=1, Nn+1=Nn+Nn, and ℓ(n+1) the concatenation of ℓ(n) with its translate by gn. Write ej(n):=ℓj(n).

The sets. For n∈N put

Sn  :=  ⋃j<Nn[ ej(n), ej(n)+λn ],S  :=  ⋂n∈NSn,

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

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

The lengths are positive and shrink. By induction on n: 0<λn+1≤λn⋅2−1 and 2nλn≥2−1. Indeed 2n+1λn+1=2n(λn−4−n−1)=2nλn−4−1⋅2−n by Laws of integer exponents, so by induction 2nλn=1−4−1∑i<n2−i≥1−4−1⋅2=2−1, using ∑i<n2−i≤∑i=0∞2−i=2 (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥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 λn≥2−n−1>0; and λn+1=(λn−4−n−1)⋅2−1≤λn⋅2−1 gives λn≤2−n by a second induction, so the lengths tend to 0.

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

M  =  ( e+λn+1, e+gn ),of length  gn−λn+1  =  λn−2λn+1  =  4−n−1.

In particular λn+1<gn, so M is nonempty, and gn>0, so [e+gn,e+λn]⊆[e,e+λn]. Counting from 1 as in the title: at stage n≥1 an open interval of length 4−n is removed from each of the 2n−1 intervals then present.

The family is nested and lies in [0,1]. Each retained sub-interval is contained in the piece it came from, by the previous paragraph, so Sn+1⊆Sn; and S0=[0,1] since N0=1, e0(0)=0 and λ0=1. Hence S⊆Sm⊆[0,1] for every m.

Remarks

  • What is different from The Cantor middle-thirds set as the intersection of the sets Cn 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 1. Here the removed middle has a fixed length 4−n−1, chosen to shrink faster than the pieces multiply, and the total removed length is only 2−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: S is not of measure zero.

  • Why the construction is written with explicit lists. The set Sn is a union of 2n 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 Nn. 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)) is a single function of n.

  • 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.

  • 0 and 1 belong to S. Both are instances of the general fact that every ej(n) and every ej(n)+λn lies in S, 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=0 and j=0, where e0(0)=0 and e0(0)+λ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 S be the Smith-Volterra-Cantor set (The Smith-Volterra-Cantor set: the same construction removing, at stage n≥1, an open middle interval of length 4−n from each of the 2n−1 remaining intervals). Then:

  1. S is closed and bounded, hence compact (A subset of R is compact if and only if it is closed and bounded);
  2. S is perfect (Perfect subset of R: closed with no isolated points);
  3. S is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of R);
  4. if (ak) and (bk) are sequences of reals with ak≤bk, S⊆⋃k[ak,bk] and ∑k<i(bk−ak)≤M for every i∈N, then M≥2−1.

In particular S does not have measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)): no cover of S by intervals has total length below 2−1, let alone below every positive ε.

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 S is 1/2" is not a statement it can make; what it can state, and what is proved below, is that 2−1 is a lower bound for the total length of every interval cover of S.

Facts & Assumptions

Given: The lengths (λn), the gaps gn=λn−λn+1, the finite lists (Nn,ℓ(n)) with entries ej(n), and the sets Sn, S of The Smith-Volterra-Cantor set: the same construction removing, at stage n≥1, an open middle interval of length 4−n from each of the 2n−1 remaining intervals. For n∈N and j<Nn write Mj(n):=(ej(n)+λn+1, ej(n)+gn) for the open interval removed from the j-th piece at stage n.

[A1]

The negation of claim 4: sequences (ak), (bk) with ak≤bk, S⊆⋃k[ak,bk], all partial sums ∑k<i(bk−ak)≤M, and M<2−1.

[L1]

The construction: N0=1, e0(0)=0, λ0=1, Nn+1=Nn+Nn, ej(n+1)=ej(n) for j<Nn and eNn+j(n+1)=ej(n)+gn for j<Nn; Sn=⋃j<Nn[ej(n),ej(n)+λn]; S=⋂nSn⊆Sm⊆[0,1]; 0<λn+1<gn<λn≤2−n; gn+λn+1=λn; λn−2λn+1=4−n−1; and ∑j<Nnc=2nc for every real c (The Smith-Volterra-Cantor set: the same construction removing, at stage n≥1, an open middle interval of length 4−n from each of the 2n−1 remaining intervals, Intervals of R: the nine order-convex forms, nondegeneracy, and length, Integer powers am, Laws of integer exponents).

[L5]

If [u,v]⊆⋃k[ck,dk] with u≤v, ck≤dk and ∑k<i(dk−ck)≤M′ for every i, then M′≥v−u (A sequence of intervals covering [a,b] has total length at least b−a, so no interval of positive length has measure zero).

[L6]

There is a bijection J:N×N→N (N×N≈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; every nonempty subset of N has a least element; every finite list of naturals has an upper bound in N, the order of N being total (The principle of mathematical induction, The well-ordering principle, Trichotomy of the order on N, Order on the natural numbers).

[L10]

Ordered-field arithmetic: 0<1, so 2>0 and 4>0 and 2−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), (bk) and M as in [A1], so that M<2−1.

assume-contragivenA1choose
1.2

S is compact, claim 1. Each Sn is the union of the finite list of closed sets [ej(n),ej(n)+λn], j<Nn, hence closed by [L2]; so S=⋂nSn is closed by [L2], and S⊆[0,1] is bounded by [L1] and [L2]; by [L3] it is compact.

L1L2L3
1.3

Separation. For every n and all i≠j below Nn one has ∣ei(n)−ej(n)∣>λn, by induction on n ([L9]). At n=0 there is nothing to prove, since N0=1. Assume it at n and let i≠j below Nn+1=Nn+Nn. If both indices are <Nn, or both are ≥Nn, the two entries are ei′(n) and ej′(n) with i′≠j′, possibly both shifted by the same gn, so the difference has absolute value >λn>λn+1 by [L1]. Otherwise the entries are ei′(n) and ej′(n)+gn; if i′=j′ the difference is gn>λn+1 by [L1]; if ei′(n)−ej′(n)>λn then ei′(n)−ej′(n)−gn>λn−gn=λn+1, and if ej′(n)−ei′(n)>λn then ej′(n)+gn−ei′(n)>λn>λn+1, in each case by [L1] and [L10]. Consequently the pieces [ej(n),ej(n)+λn], j<Nn, are pairwise disjoint.

L1L9L10
1.4

Every endpoint lies in S. Fix n and j<Nn. For m≤n one has ej(n) and ej(n)+λn in Sn⊆Sm by [L1]. For m≥n, an induction on m ([L9]) gives indices j′,j′′<Nm with ej′(m)=ej(n) and ej′′(m)+λm=ej(n)+λn: at m=n take j′=j′′=j; and if they exist at m, then ej′(m+1)=ej′(m) works for the left endpoint, while eNm+j′′(m+1)+λm+1=ej′′(m)+gm+λm+1=ej′′(m)+λm works for the right one, by [L1]. So both points lie in every Sm, hence in S.

L1L9
1.5

The complement decomposes over the stages. [0,1]∖S=⋃n(Sn∖Sn+1). The inclusion ⊇ holds because Sn⊆S0=[0,1] and S⊆Sn+1 by [L1]. For ⊆, let x∈[0,1]∖S; then x∈S0 and, S being ⋂mSm, the set of m with x∉Sm is nonempty, so by [L9] it has a least element m0, and m0≥1 since x∈S0. Put n:=m0−1; then x∈Sn by minimality and x∉Sn+1.

L1L9
2.1

The removed pieces. Fix n and j<Nn. By [L1] the pieces [ej(n),ej(n)+λn+1] and [ej(n)+gn, ej(n)+λn] both occur among the pieces of Sn+1, so a point x of [ej(n),ej(n)+λn] outside Sn+1 satisfies λn+1<x−ej(n)<gn, that is x∈Mj(n); hence Sn∖Sn+1⊆⋃j<NnMj(n). Conversely Mj(n)∩Sn+1=∅: a piece of Sn+1 coming from i≠j lies in [ei(n),ei(n)+λn], which is disjoint from [ej(n),ej(n)+λn]⊇Mj(n) by step 1.3, while the two pieces coming from j itself are disjoint from the open interval Mj(n) by [L10]. Finally each Mj(n) has length gn−λn+1=λn−2λn+1=4−n−1, so ∑j<Nn4−n−1=2n⋅4−n−1=4−1⋅2−n by [L1].

step 1.3L1L10
2.2

S is perfect, claim 2. S is closed by step 1.2. Let x∈S and let the real ε>0 be given; by [L1] and [L8] fix n with λn≤2−n<ε. Since x∈Sn there is j<Nn with x∈[ej(n),ej(n)+λn]; the two endpoints of that piece lie in S by step 1.4, are distinct because λn>0, and each is within λn<ε of x by [L10]. So at least one of them is a point of S∩Nε(x) different from x, and x is not isolated in S; by [L4], S is perfect.

step 1.2step 1.4L1L4L8L10
3.1

S is nowhere dense, claim 3. S is closed by step 1.2, so it equals its closure, and by [L4] it suffices that its interior be empty. Suppose Nε(x)⊆S for some x and some real ε>0; fix n with λn≤2−n<ε by [L1] and [L8], and j<Nn with x∈[ej(n),ej(n)+λn]. The point w:=ej(n)+(λn+1+gn)⋅2−1 lies in Mj(n), since λn+1<gn, and hence in [ej(n),ej(n)+λn], so ∣w−x∣≤λn<ε and w∈Nε(x)⊆S⊆Sn+1; but Mj(n)∩Sn+1=∅ by step 2.1, which is impossible. So no neighbourhood is contained in S and S is nowhere dense.

step 1.2step 2.1L1L4L8L10
3.2

A cover of [0,1] built from [A1] and the removed pieces. By [L6] fix a bijection J and define sequences (ci), (di) as follows: for i∈N write (m,t):=J−1(i); if m=0 put (ci,di):=(at,bt); if m≥1 and t<Nm−1 put (ci,di):=(et(m−1)+λm, et(m−1)+gm−1); and otherwise put (ci,di):=(0,0). Then ci≤di for every i by [L1], and ⋃i[ci,di] contains S by [A1] and contains [0,1]∖S by steps 1.5 and 2.1, hence contains [0,1]. For a partial sum, fix i0; the pairs J−1(i) with i<i0 are distinct, so by [L9] there is P bounding both of their coordinates, and since all the terms are nonnegative [L7] gives ∑i<i0(di−ci)≤∑t≤P(bt−at)+∑n≤P∑t<Nn4−n−1≤M+∑n≤P4−12−n≤M+4−1⋅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] and the cover of step 3.2, M+2−1≥1−0=1, so M≥2−1, contradicting step 1.1. Claim 4 therefore holds; and S is not null, since nullity would give, at ε:=4−1, a cover of S with all partial total lengths ≤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], defined on the Cantor set through ternary digits and extended constantly across each removed interval

Definition

Let C be the Cantor set, D the set of sequences with values in {0,2} and Φ:D→C the bijection Φ(a)=∑k≥0ak3−k−1 of The Cantor set is exactly the set of ∑k≥1ak3−k with every ak∈{0,2}, and this gives a bijection with {0,1}N. Since Φ is a bijection it has a two-sided inverse Φ−1:C→D, and that inverse is a single function, determined and not selected (Injection, surjection, bijection).

On the Cantor set. For x∈C write a:=Φ−1(x) and put

γ(x)  :=  ∑k=0∞(ak⋅2−1) 2−k−1.

Each coefficient ak⋅2−1 is 0 or 1, so all the terms are nonnegative and every partial sum is at most ∑k<n2−k−1≤∑k=0∞2−k−1=1 (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges, Integer powers am, Laws of integer exponents); hence the series converges and γ(x)∈[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: the nine order-convex forms, nondegeneracy, and length). In words: γ halves each ternary digit of x and reads the result as a binary expansion.

On all of [0,1]. The Cantor function is c:[0,1]→R,

c(x)  :=  sup⁡{ γ(t):t∈C and t≤x }.

The supremum exists and is a single real number. The set on the right is nonempty, because 0∈C (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds) and 0≤x, and it is bounded above by 1, because γ takes values in [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)≤1, the values of c lie in [0,1].

That c really extends γ, that is, c(t)=γ(t) for every t∈C, is not an observation but a small theorem: it needs γ to be nondecreasing along C. It is claim 1 of The Cantor function is well defined, satisfies c(x)≤c(y) whenever x≤y, is surjective onto [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) whenever x≤y, is surjective onto [0,1], and is constant on every interval removed from the Cantor set

Statement

Let C be the Cantor set, γ:C→[0,1] and c:[0,1]→R as in The Cantor function on [0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval. Then:

  1. c is well defined with values in [0,1], and c(t)=γ(t) for every t∈C, so c extends γ;
  2. c(x)≤c(y) whenever 0≤x≤y≤1;
  3. c is surjective onto [0,1] (Injection, surjection, bijection), and c(0)=0, c(1)=1;
  4. c is constant on [u,v] whenever u<v, u,v∈C and (u,v)∩C=∅; and every x∈[0,1]∖C lies in the open interval of such a pair, so c is constant on a whole neighbourhood of every point of [0,1] outside C.

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 C in the sense of claim 4, as (13,23) 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 C, the set D of {0,2}-valued sequences, the bijection Φ:D→C, and the functions γ and c of The Cantor function on [0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval. For x∈C write Φ−1(x) for its digit sequence.

[L1]

Φ(a)=∑k≥0ak3−k−1 is a bijection from D onto C, with two-sided inverse Φ−1; γ(x)=∑k≥0(ak2−1)2−k−1 for a=Φ−1(x), with values in [0,1]; c(x)=sup⁡{γ(t):t∈C, t≤x}, the supremum of a nonempty set bounded above by 1 and containing γ(0) (The Cantor set is exactly the set of ∑k≥1ak3−k with every ak∈{0,2}, and this gives a bijection with {0,1}N, The Cantor function on [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=0∞rk=1/(1−r) for ∣r∣<1, so ∑k≥m2−k−1=2−m and ∑k≥m2⋅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, ∑k≥0rk=1/(1−r), and for ∣r∣≥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 am, Laws of integer exponents).

[L4]

Suprema: u=sup⁡S exactly when u is an upper bound and for every ε>0 some s∈S has u−ε<s; infima exist for nonempty sets bounded below, and ℓ=inf⁡S exactly when ℓ is a lower bound and for every ε>0 some s∈S has s<ℓ+ε; 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; every nonempty subset of N has a least element (The recursion theorem, The principle of mathematical induction, The well-ordering principle).

[L8]

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

[L9]

Ordered-field arithmetic: 0<1, so 2>0, 3>0 and 2−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 a≠b in D and let k be the least index with ak≠bk, which exists by [L5]; suppose ak=0 and bk=2. Then Φ(b)−Φ(a)=∑j≥0(bj−aj)3−j−1 by [L2], the terms with j<k vanish, and the tail R:=∑j≥k+1(bj−aj)3−j−1 satisfies ∣R∣≤∑j≥k+12⋅3−j−1=3−k−1 by [L2], since ∣bj−aj∣≤2; hence Φ(b)−Φ(a)≥2⋅3−k−1−3−k−1=3−k−1>0. The same computation with the halved digits gives γ(Φ(b))−γ(Φ(a))=2−k−1+R′ with ∣R′∣≤∑j≥k+12−j−1=2−k−1, so γ(Φ(b))≥γ(Φ(a)). Consequently, for s,t∈C with s≤t one has γ(s)≤γ(t): this is trivial if s=t, and otherwise the least index k at which the digit sequences differ must have the digit of t equal to 2, by the first computation applied both ways.

givenL1L2L5L9
1.2

Values at the endpoints. The constant sequence 0ˉ has Φ(0ˉ)=0 and γ(0)=0; the constant sequence 2ˉ has Φ(2ˉ)=∑k≥02⋅3−k−1=1 and γ(1)=∑k≥02−k−1=1, by [L2]. Both 0 and 1 lie in C by [L3].

L1L2L3
2.1

Claims 1 and 2. For x∈[0,1] the set Ax:={γ(t):t∈C, t≤x} is nonempty and bounded above by 1 by [L1], so c(x)=sup⁡Ax exists, is unique and lies in [0,1] by [L1] and [L4]; that is claim 1 apart from the extension property. If 0≤x≤y≤1 then Ax⊆Ay, so c(x)≤c(y) by [L4], which is claim 2. And for t∈C: γ(t)∈At, while γ(t) is an upper bound of At by step 1.1, so γ(t)=sup⁡At=c(t) by [L4].

step 1.1step 1.2L1L4
2.2

The two endpoints of a gap carry the same value of γ. Let u<v with u,v∈C and (u,v)∩C=∅, and put a:=Φ−1(u), b:=Φ−1(v), with k the least index where they differ; by step 1.1 and u<v we have ak=0 and bk=2. If some j>k had aj=0, let a′ agree with a except that aj′=2; then Φ(a′)∈C, Φ(a′)>u by step 1.1, and a′ still differs from b first at k with ak′=0<2=bk, so Φ(a′)<v by step 1.1, putting Φ(a′) in (u,v)∩C, which is empty. Hence aj=2 for every j>k. Symmetrically, if some j>k had bj=2, replacing it by 0 gives b′ with Φ(b′)<v and Φ(b′)>u, again impossible; hence bj=0 for every j>k. Writing P:=∑j<k(aj2−1)2−j−1=∑j<k(bj2−1)2−j−1, [L2] now gives γ(u)=P+0+∑j≥k+12−j−1=P+2−k−1 and γ(v)=P+2−k−1+0=P+2−k−1, so γ(u)=γ(v).

step 1.1L1L2L9
3.1

Claim 4, first half. Let u<v with u,v∈C and (u,v)∩C=∅, and let x∈[u,v]. Every t∈C with t≤x satisfies t≤u or t=v: indeed if t>u then t≤x≤v and t∉(u,v) force t=v. In the first case γ(t)≤γ(u) by step 1.1, and in the second γ(t)=γ(v)=γ(u) by step 2.2. So γ(u) is an upper bound of Ax and belongs to it, whence c(x)=γ(u) by [L4]: c is constant on [u,v], with the value c(u) given by step 2.1.

step 1.1step 2.1step 2.2L4L9
3.2

Claim 3. Let s∈[0,1]. Let T:R→R be T(r):=2r for r<2−1 and T(r):=2r−1 for r≥2−1, a definition by cases on the total order, and by [L5] let (rn) satisfy r0=s and rn+1=T(rn); put βn:=0 when rn<2−1 and βn:=1 otherwise, so rn+1=2rn−βn. An induction ([L5]) gives rn∈[0,1] for every n, since 0≤r<2−1 gives 0≤2r<1 and 2−1≤r≤1 gives 0≤2r−1≤1 by [L9]; a second induction gives s=∑k<nβk2−k−1+2−nrn for every n, the step being ∑k<n+1βk2−k−1+2−n−1rn+1=∑k<nβk2−k−1+βn2−n−1+2−n−1(2rn−βn)=∑k<nβk2−k−1+2−nrn. Hence 0≤s−∑k<nβk2−k−1≤2−n, so by [L6] the partial sums converge to s and s=∑k≥0βk2−k−1. Now a:=(2βk)k lies in D, the point x:=Φ(a) lies in C by [L1], and γ(x)=∑kβk2−k−1=s; by step 2.1, c(x)=γ(x)=s. With step 1.2 and step 2.1 this also gives c(0)=γ(0)=0 and c(1)=γ(1)=1.

step 1.2step 2.1L1L2L5L6L9
4.1

Claim 4, second half. Let x∈[0,1]∖C. The set A:={t∈C:t≤x} is nonempty by [L3] and bounded above by x, so u:=sup⁡A exists by [L4]; by [L4] every Nε(u) meets A⊆C, so u∈C‾=C by [L3], and u≤x with u≠x, so u<x. The set B:={t∈C:t≥x} is nonempty by [L3], since 1∈C and x≤1, and is bounded below by x, so v:=inf⁡B exists by [L4]; likewise v∈C and v>x. If t∈C satisfied u<t<v, then t≤x would put t∈A and force t≤u, while t≥x would put t∈B and force t≥v, and one of the two holds by totality of the order ([L9]); so (u,v)∩C=∅. By step 3.1 the function c is constant on [u,v], and Nδ(x)⊆(u,v) for δ:=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-27Open item page →

Why the nested-interval proof of Baire category in R needs no choice

Remark

What the proof on this page spends. The proof of Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets uses exactly four things: the recursion theorem (The recursion theorem), the well-ordering principle for 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 0), and one fixed enumeration of the rationals (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 k 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ω)), which the neighbouring measure-theoretic results on this page do use.

What the naive proof leaves implicit. The textbook argument says: given the interval produced at stage k, choose an interval inside it meeting Uk+1, and repeat. Each selection depends on the preceding one. The local proof makes no claim about the weakest axiom that would validate that pattern; it removes the issue by replacing every selection with a canonical rule. A fixed enumeration of a dense set is what makes that rule available.

What this does NOT establish. It establishes nothing about the Baire category theorem for arbitrary complete metric spaces. The proof of Baire category in R, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R is not a countable union of nowhere dense sets is a specialised argument using the fixed enumeration of the rationals; it does not supply a canonical dense sequence in a general space. So the correct summary is:

  • the statement proved here, for 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 exact strength of the general statement over ZF waits for the later local weak-choice and model-theoretic development.

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 rather than picking a witness. The same device appears in Every nonempty perfect subset of R is uncountable, and in both places it is the enumeration of 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 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 has measure zero

Statement

False claim: every nowhere dense subset of R (Nowhere dense, meager (first category), residual, and second category subsets of R) has measure zero (Measure zero (a countable cover by intervals of total length below every ε) 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 has measure zero.

[L2]

If sequences (ak), (bk) with ak≤bk cover S and all their partial total lengths are at most M, then M≥2−1; in particular S 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 it has a cover by a sequence of closed intervals with all partial total lengths at most ε (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)).

Refutation

technique · direct
1.1

The set S is a subset of R and is nowhere dense, by [L1].

L1
1.2

S does not have measure zero: a cover witnessing nullity at ε:=4−1 would have all partial total lengths at most 4−1, and [L2] then forces 4−1≥2−1, which is false.

L2L3
2.1

So S is a nowhere dense subset of R that does not have measure zero, and the claim [A1] fails at S; 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 of measure zero is nowhere dense

Statement

False claim: every subset of R of measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)) is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of 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 ε and still have every real as an adherent point, and Q does exactly that.

Facts & Assumptions

Given: The set QR⊆R of rationals, that is the image of Q under the canonical embedding (The rationals embed densely in the reals).

[A1]

The false claim: every subset of R of measure zero is nowhere dense.

[L2]

Every at most countable subset of R has measure zero (Every at most countable subset of R has measure zero).

Refutation

technique · direct
1.1

QR has measure zero, being at most countable by [L1] and hence null by [L2].

L1L2
1.2

QR is not nowhere dense: its closure is R by [L3], and the interior of R is R itself by [L4], since R is an open subset of R; so the interior of the closure is R≠∅.

L3L4
2.1

So QR is a subset of 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 ε) 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, 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 1.

Facts & Assumptions

Given: The set E:=QR∩[0,1], where QR is the image of Q in R (The rationals embed densely in the reals).

[A1]

The false claim: every subset of R of measure zero has content zero.

[L4]

If [a,b]⊆⋃j≤n[cj,dj] with a≤b and cj≤dj, then ∑j≤n(dj−cj)≥b−a (If finitely many intervals cover a closed bounded interval [a,b], the sum of their lengths is at least b−a).

[L5]

A has content zero when for every real ε>0 it has a finite cover by closed intervals of total length at most ε (Measure zero (a countable cover by intervals of total length below every ε) 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<1, so 2>0 and 2−1>0 and 2−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

E has measure zero by [L1], and E⊆[0,1] is bounded.

L1
1.2

Every x∈[0,1] is adherent to E: given a real ε>0, put p:=max⁡{0, x−ε} and q:=min⁡{1, x+ε}, which exist by [L6]. Then p<q: indeed p≤x≤q by [L7] and 0≤x≤1, while p=x would need x≤0 hence x=0<min⁡{1,ε}=q, and q=x would need x≥1 hence x=1>max⁡{0,1−ε}=p, and otherwise p<x<q. By [L2] there is a rational strictly between p and q; it lies in [0,1] because 0≤p and q≤1, and within ε of x because x−ε≤p and q≤x+ε. So Nε(x)∩E≠∅.

L2L6L7
2.1

Let n∈N and c0≤d0,…,cn≤dn be any finite family of closed intervals with E⊆⋃j≤n[cj,dj]. The union ⋃j≤n[cj,dj] is a closed set by [L3], and it contains E, hence contains E‾ by [L3]; by step 1.2 every point of [0,1] lies in E‾, so [0,1]⊆⋃j≤n[cj,dj] and [L4] gives ∑j≤n(dj−cj)≥1.

step 1.2L3L4
3.1

So no finite family of closed intervals covers E with total length at most 2−1<1, and E does not have content zero by [L5] and [L7]; yet E has measure zero by step 1.1. The claim [A1] therefore fails at E 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 is a Gδ subset of R

Statement

False claim: Q, that is the set QR of rationals inside R (The rationals embed densely in the reals), is a Gδ set (Fσ and Gδ subsets of R): there is a sequence (Vn) of open subsets of R with QR=⋂nVn.

The claim looks plausible by symmetry. QR is Fσ, being a countable union of singletons; the irrationals are Gδ, 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 QR⊆R of rationals.

[A1]

The false claim: QR is a Gδ subset of R.

[L1]

QR is Fσ and meager, the irrationals are Gδ and residual, and QR is not Gδ (Q is Fσ, meager and not Gδ, while the irrationals are Gδ, residual and not Fσ, claims 1, 2 and 3).

Refutation

technique · direct
1.1

By claim 3 of [L1], QR is not a Gδ subset of 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 with each Vn open, every Vn would contain the dense set QR and so be dense; adjoining the dense open sets R∖{q}, one for each rational q, would produce an at most countable family of dense open sets whose intersection is QR minus every rational, that is ∅, 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 C (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds) is at most countable (Finite, countably infinite, countable, uncountable), because it is obtained from [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] says nothing about the cardinality of the remainder. And the endpoints do not exhaust C: the point 1/4 belongs to C and is the endpoint of no removed interval, as the remarks below record.

Facts & Assumptions

Refutation

technique · direct
1.1

C 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↦{ k∈N:bk=1 } is a bijection from {0,1}N onto P(N), its inverse sending a set to its indicator sequence, so composing with [L2] gives a bijection from C onto P(N). If C were at most countable it would be nonempty and admit a surjection N→C by [L4], and composing with that bijection would give a surjection N→P(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.

step 1.1step 1.2A1∎

Remarks

Sources