Alphabeta Math
Session-authored (Fable 5 assisted)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

12 results · all verified · 9 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\mathbb{R}: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

Q\mathbb{Q} is covered by open intervals of total length ε\varepsilon, for every ε>0\varepsilon > 0

Example

Let QRR\mathbb{Q}_{\mathbb{R}} \subseteq \mathbb{R} be the set of rationals (The rationals embed densely in the reals) and let ε>0\varepsilon > 0 be real. Then there is a sequence (Vk)kN(V_k)_{k \in \mathbb{N}} of open intervals (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) with

QRkNVkandk=0length(Vk)=ε.\mathbb{Q}_{\mathbb{R}} \subseteq \bigcup_{k \in \mathbb{N}} V_k \qquad \text{and} \qquad \sum_{k=0}^{\infty} \operatorname{length}(V_k) = \varepsilon .

Explicitly, if e:NQRe : \mathbb{N} \to \mathbb{Q}_{\mathbb{R}} is a bijection, one may take Vk:=(e(k)ε2k2, e(k)+ε2k2)V_k := \big(e(k) - \varepsilon 2^{-k-2},\ e(k) + \varepsilon 2^{-k-2}\big), of length ε2k1\varepsilon 2^{-k-1}.

This is Every at most countable subset of R\mathbb{R} has measure zero made concrete for the most familiar countable set, and it is the computation that makes measure zero look paradoxical: a set that meets every interval of R\mathbb{R} is nonetheless covered by open intervals whose lengths add up to a millionth.

Facts & Assumptions

Given: A real ε>0\varepsilon > 0 and the set QR\mathbb{Q}_{\mathbb{R}} of rationals inside R\mathbb{R}.

[L1]

QN\mathbb{Q} \approx \mathbb{N} and qq^q \mapsto \hat q is injective with image QR\mathbb{Q}_{\mathbb{R}}, so there is a bijection e:NQRe : \mathbb{N} \to \mathbb{Q}_{\mathbb{R}} (Q\mathbb{Q} is countably infinite, The rationals embed densely in the reals, Equinumerous sets, ABA \approx B and ABA \preceq B, Finite, countably infinite, countable, uncountable, A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}).

[L5]

Every at most countable subset of R\mathbb{R} has measure zero, and nullity means a cover by closed intervals whose partial total lengths stay below ε\varepsilon (Every at most countable subset of R\mathbb{R} has measure zero, Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L6]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0, 4>04 > 0 and ε2k2>0\varepsilon 2^{-k-2} > 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.

Verification

technique · direct
1.1

By [L1] fix a bijection e:NQRe : \mathbb{N} \to \mathbb{Q}_{\mathbb{R}} and put δk:=ε2k2\delta_k := \varepsilon \cdot 2^{-k-2}, a positive real by [L3] and [L6], and Vk:=(e(k)δk, e(k)+δk)V_k := (e(k) - \delta_k,\ e(k) + \delta_k), an open interval of length 2δk=ε2k12\delta_k = \varepsilon 2^{-k-1} by [L2], [L3] and [L6].

givenL1L2L3L6choose
1.2

The family covers QR\mathbb{Q}_{\mathbb{R}}: every rational is e(k)e(k) for some kk, and e(k)Vke(k) \in V_k because e(k)δk<e(k)<e(k)+δke(k) - \delta_k < e(k) < e(k) + \delta_k by [L6].

L1L2L6
2.1

The lengths sum to ε\varepsilon: by [L4] the partial sums are k<nε2k1=ε21k<n2k\sum_{k<n}\varepsilon 2^{-k-1} = \varepsilon 2^{-1}\sum_{k<n}2^{-k}, and by [L3] the series k2k\sum_k 2^{-k} converges to 22, so by [L3] and [L4] the series kε2k1\sum_k \varepsilon 2^{-k-1} converges with sum ε212=ε\varepsilon \cdot 2^{-1} \cdot 2 = \varepsilon.

step 1.1L3L4L6
3.1

So the open intervals VkV_k cover QR\mathbb{Q}_{\mathbb{R}} with total length exactly ε\varepsilon, as claimed; since ε>0\varepsilon > 0 was arbitrary, this also re-exhibits the nullity of QR\mathbb{Q}_{\mathbb{R}} given by [L5], the closed intervals [e(k)δk,e(k)+δk][e(k) - \delta_k, e(k) + \delta_k] having the same lengths.

step 1.1step 1.2step 2.1L5

Remarks

  • The union is a dense open set of arbitrarily small total length. Each VkV_k is open, so kVk\bigcup_k V_k is an open set containing every rational, hence dense; and its covering intervals have total length ε\varepsilon. Iterating this over a sequence of shrinking ε\varepsilon is exactly the construction of R\mathbb{R} is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions, where the intersection of countably many such open sets turns out to be null and residual at the same time.

  • Indexing. The first interval has length ε21\varepsilon \cdot 2^{-1}, not ε\varepsilon: sequences here start at k=0k = 0 and the total ε21k02k\varepsilon 2^{-1} \sum_{k \ge 0} 2^{-k} is exactly ε\varepsilon. Copying the classical ε2k\varepsilon 2^{-k} from a 11-indexed source would give total 2ε2\varepsilon.

  • What this does not show. It does not show that the union of the VkV_k is small: that union is an open set containing a dense set, and one may not conclude anything about its own total length from the lengths of the VkV_k, since they overlap heavily. The correct statement is about the cover, not the union, and that is why Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover) is phrased in terms of covers throughout.

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

Which points of [0,1][0,1] lie in the Cantor set, read off their ternary expansions, with 1/41/4 worked out

Example

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

x  =  Φ(a)  =  k=0ak3k1for some sequence a with every ak{0,2},x \;=\; \Phi(a) \;=\; \sum_{k=0}^{\infty} a_k 3^{-k-1} \qquad \text{for some sequence } a \text{ with every } a_k \in \{0,2\},

and that sequence is then unique. The membership test is therefore: xx has a ternary expansion using only the digits 00 and 22. Six points are worked out here.

xxdigit sequence Φ1(x)\Phi^{-1}(x)
000,0,0,0,0,0,0,0,\dots
112,2,2,2,2,2,2,2,\dots
1/31/30,2,2,2,0,2,2,2,\dots
2/32/32,0,0,0,2,0,0,0,\dots
1/91/90,0,2,2,2,0,0,2,2,2,\dots
1/41/40,2,0,2,0,2,0,2,0,2,0,2,\dots

The last line is the interesting one: the digits of 1/41/4 alternate for ever, so 1/41/4 lies in CC without being an endpoint of any interval removed in the construction (1/41/4 lies in the Cantor set and is the endpoint of no removed interval, so the endpoints do not exhaust it).

Facts & Assumptions

Given: The Cantor set CC, the set DD of {0,2}\{0,2\}-valued sequences and the bijection Φ:DC\Phi : D \to C of The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}. Write σa\sigma a for the shifted sequence (σa)k=ak+1(\sigma a)_k = a_{k+1}.

[L2]

k=0rk=1/(1r)\sum_{k=0}^{\infty} r^{k} = 1/(1-r) for r<1|r| < 1; in particular k03k=321\sum_{k \ge 0} 3^{-k} = 3 \cdot 2^{-1} and hence km23k1=3m\sum_{k \ge m} 2 \cdot 3^{-k-1} = 3^{-m}; convergent series add and scale termwise, and the tail of a convergent series is again convergent with k0tk=t0+k1tk\sum_{k \ge 0} t_k = t_0 + \sum_{k \ge 1} t_k (For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Convergent series add and scale termwise, 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, Integer powers ama^m, Laws of integer exponents).

[L4]

Ordered-field arithmetic: 0<10 < 1, so 3>03 > 0, 31>03^{-1} > 0, 8>08 > 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.

Verification

technique · direct
1.1

The shift identity. For aDa \in D, Φ(a)=a031+31Φ(σa)\Phi(a) = a_0 \cdot 3^{-1} + 3^{-1}\Phi(\sigma a): by [L2] the series splits as Φ(a)=a031+k1ak3k1\Phi(a) = a_0 3^{-1} + \sum_{k \ge 1} a_k 3^{-k-1}, and k1ak3k1=j0aj+13j2=31j0aj+13j1=31Φ(σa)\sum_{k \ge 1}a_k 3^{-k-1} = \sum_{j \ge 0} a_{j+1} 3^{-j-2} = 3^{-1}\sum_{j \ge 0}a_{j+1}3^{-j-1} = 3^{-1}\Phi(\sigma a) by [L2] and [L4].

givenL1L2L4
1.2

The constant and eventually constant sequences. By [L2], Φ(0,0,0,)=0\Phi(0,0,0,\dots) = 0 and Φ(2,2,2,)=k023k1=30=1\Phi(2,2,2,\dots) = \sum_{k \ge 0}2 \cdot 3^{-k-1} = 3^{0} = 1. Likewise Φ(0,2,2,2,)=0+k123k1=31=1/3\Phi(0,2,2,2,\dots) = 0 + \sum_{k \ge 1}2\cdot3^{-k-1} = 3^{-1} = 1/3, Φ(2,0,0,)=231=2/3\Phi(2,0,0,\dots) = 2 \cdot 3^{-1} = 2/3, and Φ(0,0,2,2,2,)=k223k1=32=1/9\Phi(0,0,2,2,2,\dots) = \sum_{k \ge 2}2 \cdot 3^{-k-1} = 3^{-2} = 1/9.

L1L2
2.1

The alternating sequence gives 1/41/4. Let aa be the sequence with ak=0a_k = 0 for even kk and ak=2a_k = 2 for odd kk, so aDa \in D and σ(σa)=a\sigma(\sigma a) = a. Applying step 1.1 twice, Φ(a)=031+31Φ(σa)\Phi(a) = 0 \cdot 3^{-1} + 3^{-1}\Phi(\sigma a) and Φ(σa)=231+31Φ(a)\Phi(\sigma a) = 2 \cdot 3^{-1} + 3^{-1}\Phi(a), so Φ(a)=31(231+31Φ(a))=291+91Φ(a)\Phi(a) = 3^{-1}\big(2 \cdot 3^{-1} + 3^{-1}\Phi(a)\big) = 2 \cdot 9^{-1} + 9^{-1}\Phi(a); hence (191)Φ(a)=291(1 - 9^{-1})\Phi(a) = 2 \cdot 9^{-1}, that is 891Φ(a)=2918 \cdot 9^{-1}\Phi(a) = 2 \cdot 9^{-1} and Φ(a)=281=1/4\Phi(a) = 2 \cdot 8^{-1} = 1/4, by [L4].

step 1.1L4
3.1

So all six points of the table lie in CC by [L1], with the digit sequences shown, and the sequences are the only ones representing them because Φ\Phi is injective by [L1]. The point 1/41/4 has a digit sequence that is not eventually constant, since it takes both values 00 and 22 at arbitrarily large indices.

step 1.2step 2.1L1

Remarks

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

The intervals removed from the Smith-Volterra-Cantor set have total length 1/21/2, so the set cannot be covered by intervals of total length less than 1/21/2

Example

Let SS be the Smith-Volterra-Cantor set (The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals). At stage nn exactly 2n2^n open intervals, each of length 4n14^{-n-1}, are removed, so the lengths removed at that stage total 2n4n1=412n2^{n} \cdot 4^{-n-1} = 4^{-1} \cdot 2^{-n} and over all stages they total

n=0412n  =  412  =  12.\sum_{n=0}^{\infty} 4^{-1} \cdot 2^{-n} \;=\; 4^{-1} \cdot 2 \;=\; \tfrac12 .

Correspondingly, no cover of SS by intervals has total length below 12\tfrac12: if (ak)(a_k), (bk)(b_k) are sequences of reals with akbka_k \le b_k, Sk[ak,bk]S \subseteq \bigcup_k [a_k,b_k] and k<i(bkak)M\sum_{k<i}(b_k - a_k) \le M for every ii, then M12M \ge \tfrac12 (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero).

The two numbers are the two halves of the unit interval's length, and the second is what "the set has positive measure" means in the vocabulary available here: this library defines no outer measure, so the assertion is about covers and their total lengths, never about a number attached to SS itself.

Facts & Assumptions

Given: The Smith-Volterra-Cantor set SS, the lengths (λn)(\lambda_n), the gaps gng_n, the lists (Nn,(n))(N_n, \ell^{(n)}) and the removed intervals Mj(n)=(ej(n)+λn+1, ej(n)+gn)M^{(n)}_j = (e^{(n)}_j + \lambda_{n+1},\ e^{(n)}_j + g_n) of The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals.

[L1]

Each Mj(n)M^{(n)}_j has length gnλn+1=λn2λn+1=4n1g_n - \lambda_{n+1} = \lambda_n - 2\lambda_{n+1} = 4^{-n-1}, and j<Nnc=2nc\sum_{j<N_n} c = 2^{n}c for every real cc (The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Integer powers ama^m, Laws of integer exponents).

[L3]

If sequences (ak)(a_k), (bk)(b_k) with akbka_k \le b_k cover SS and all partial total lengths are at most MM, then M21M \ge 2^{-1}; and SS is not null (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero, claim 4, Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L5]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0 and 4>04 > 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.

Verification

technique · direct
1.1

Stage nn. By [L1] the intervals removed at stage nn are the Mj(n)M^{(n)}_j for j<Nnj < N_n, each of length 4n14^{-n-1}, so their lengths total j<Nn4n1=2n4n1\sum_{j<N_n} 4^{-n-1} = 2^{n} \cdot 4^{-n-1}, which equals 412n4^{-1} \cdot 2^{-n} because 4n1=414n=4122n4^{-n-1} = 4^{-1} \cdot 4^{-n} = 4^{-1} \cdot 2^{-2n} and 2n22n=2n2^{n} \cdot 2^{-2n} = 2^{-n} by [L1] and [L5].

givenL1L5
2.1

All stages together. The terms 412n4^{-1}2^{-n} are nonnegative, and by [L2] the series n412n\sum_n 4^{-1}2^{-n} converges with sum 412=214^{-1} \cdot 2 = 2^{-1}. So the total length of all the removed intervals is exactly 212^{-1}.

step 1.1L2L5
3.1

The lower bound for covers. [L3] says precisely that a bound MM on all the partial total lengths of a cover of SS satisfies M21M \ge 2^{-1}; so no cover of SS by intervals, countable or finite, has total length below 212^{-1}, and in particular SS is not null. The two computations fit together: the removed intervals of total length 212^{-1} and any cover of SS of total length MM together cover [0,1][0,1], so M+211M + 2^{-1} \ge 1 by [L4], which is the same bound.

step 2.1L3L4

Remarks

  • What the numbers do and do not say. "Total length of the removed intervals" is a sum of lengths of an explicit family, and "no cover below 1/21/2" is a statement about all covers. Neither says that SS has measure 1/21/2: that would require an outer measure, which is not defined at this point in the reading order. The pair of statements is nevertheless the exact content of the classical assertion.

  • Why 4n4^{-n} and not 3n3^{-n}. For the middle-thirds construction the removed length at stage nn is 2n3n12^{n}3^{-n-1}, and n2n3n1=313=1\sum_n 2^{n}3^{-n-1} = 3^{-1} \cdot 3 = 1, so everything is removed in the sense of total length and the Cantor set is null (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). Here the removed pieces shrink faster than they multiply and only half the length goes.

  • The bound 1/21/2 is sharp in one direction only. The removed intervals together with a cover of SS must reach total length 11, so a cover of SS cannot do better than 1/21/2; whether total length exactly 1/21/2 is approached by covers of SS is a question about outer measure and is not asked here.

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

Baire category gives a third proof that R\mathbb{R} is uncountable

Example

R\mathbb{R} is uncountable (Finite, countably infinite, countable, uncountable), by Baire category in R\mathbb{R}, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R\mathbb{R} is not a countable union of nowhere dense sets: a singleton is nowhere dense, so a listing of R\mathbb{R} would present R\mathbb{R} as a countable union of nowhere dense sets, which the Baire theorem forbids.

This is the third proof of the fact in this library. The first is Cantor's nested-interval argument of 1874 (R\mathbb{R} is uncountable (Cantor's nested intervals, 1874)); the second is the perfect-set theorem applied to a closed interval (Every nonempty perfect subset of R\mathbb{R} is uncountable); this one isolates what the first two have in common, namely completeness used through nested intervals, and packages it once.

Facts & Assumptions

Given: The complete ordered field R\mathbb{R}.

[L1]

If (An)nN(A_n)_{n \in \mathbb{N}} is a sequence of nowhere dense subsets of R\mathbb{R} then nAnR\bigcup_n A_n \ne \mathbb{R} (Baire category in R\mathbb{R}, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R\mathbb{R} is not a countable union of nowhere dense sets).

[L3]

UU is open when every point of it has a neighbourhood inside it, FF is closed when its complement is open, and Nε(x)=(xε,x+ε)N_\varepsilon(x) = (x - \varepsilon, x + \varepsilon) contains xx (Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L4]

A nonempty at most countable set admits a surjection from N\mathbb{N}, and uncountable means not at most countable (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}, Finite, countably infinite, countable, uncountable, Injection, surjection, bijection).

[L5]

R\mathbb{R} is uncountable, by Cantor's nested-interval argument (R\mathbb{R} is uncountable (Cantor's nested intervals, 1874)).

[L6]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0 and 0<ε21<ε0 < \varepsilon \cdot 2^{-1} < \varepsilon for ε>0\varepsilon > 0 (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.

Verification

technique · direct
1.1

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

L2L3L6
2.1

Let s:NRs : \mathbb{N} \to \mathbb{R} be any function. The sets An:={s(n)}A_n := \{s(n)\} are nowhere dense by step 1.1, so nAnR\bigcup_n A_n \ne \mathbb{R} by [L1]; but nAn\bigcup_n A_n is exactly the image of ss, so ss is not surjective.

step 1.1L1
3.1

Hence there is no surjection NR\mathbb{N} \to \mathbb{R}. Since R\mathbb{R} is nonempty, [L4] gives that R\mathbb{R} is not at most countable, that is, R\mathbb{R} is uncountable, which is [L5] reproved along an independent route.

step 2.1L4L5

Remarks

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

The Cantor function takes the value 1/21/2 on all of [1/3,2/3][1/3, 2/3], and its values at 1/91/9, 1/41/4 and 7/97/9

Example

Let cc be the Cantor function (The Cantor function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval). Then

c(x)=12  for every x[13,23],c(19)=14,c(14)=13,c(79)=34.c(x) = \tfrac12 \ \text{ for every } x \in [\tfrac13, \tfrac23], \qquad c(\tfrac19) = \tfrac14, \qquad c(\tfrac14) = \tfrac13, \qquad c(\tfrac79) = \tfrac34 .

Each value is computed by halving the ternary digits and reading the result in base two, which is what The Cantor function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval prescribes on CC, and by the constancy across gaps of The Cantor function is well defined, satisfies c(x)c(y)c(x) \le c(y) whenever xyx \le y, is surjective onto [0,1][0,1], and is constant on every interval removed from the Cantor set off CC.

Facts & Assumptions

[L1]

Φ(a)=k0ak3k1\Phi(a) = \sum_{k \ge 0}a_k3^{-k-1} is a bijection from the {0,2}\{0,2\}-valued sequences onto CC, and γ(Φ(a))=k0(ak21)2k1\gamma(\Phi(a)) = \sum_{k \ge 0}(a_k 2^{-1})2^{-k-1} (The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}, The Cantor function on [0,1][0,1], defined on the Cantor set through ternary digits and extended constantly across each removed interval, Series, partial sums, convergence and the sum, divergence, and the tail series).

[L2]

Geometric tails: km23k1=3m\sum_{k \ge m} 2 \cdot 3^{-k-1} = 3^{-m} and km2k1=2m\sum_{k \ge m} 2^{-k-1} = 2^{-m}; convergent series add and scale termwise, and k0tk=t0+k1tk\sum_{k \ge 0}t_k = t_0 + \sum_{k \ge 1}t_k (For r<1|r| < 1, k0rk=1/(1r)\sum_{k \ge 0} r^k = 1/(1-r), and for r1|r| \ge 1 the series diverges, Convergent series add and scale termwise, 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, Integer powers ama^m, Laws of integer exponents).

[L3]

Digit sequences: 13=Φ(0,2,2,2,)\tfrac13 = \Phi(0,2,2,2,\dots), 23=Φ(2,0,0,0,)\tfrac23 = \Phi(2,0,0,0,\dots), 19=Φ(0,0,2,2,2,)\tfrac19 = \Phi(0,0,2,2,2,\dots) and 14=Φ(0,2,0,2,)\tfrac14 = \Phi(0,2,0,2,\dots), the alternating sequence (Which points of [0,1][0,1] lie in the Cantor set, read off their ternary expansions, with 1/41/4 worked out).

[L4]

c(t)=γ(t)c(t) = \gamma(t) for tCt \in C; cc is constant on [u,v][u,v] whenever u<vu < v, u,vCu,v \in C and (u,v)C=(u,v) \cap C = \varnothing (The Cantor function is well defined, satisfies c(x)c(y)c(x) \le c(y) whenever xyx \le y, is surjective onto [0,1][0,1], and is constant on every interval removed from the Cantor set, claims 1 and 4).

[L6]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0, 3>03 > 0, 4>04 > 0 and 13<23\tfrac13 < \tfrac23; 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.

Verification

technique · direct
1.1

One more digit sequence. 79=Φ(2,0,2,2,2,)\tfrac79 = \Phi(2,0,2,2,2,\dots): by [L2] that value is 231+0+k223k1=23+32=23+19=792 \cdot 3^{-1} + 0 + \sum_{k \ge 2} 2 \cdot 3^{-k-1} = \tfrac23 + 3^{-2} = \tfrac23 + \tfrac19 = \tfrac79.

givenL1L2L6
1.2

The value of γ\gamma at the alternating sequence. Let bb be the {0,1}\{0,1\}-valued sequence with bk=0b_k = 0 for even kk and bk=1b_k = 1 for odd kk, and put B:=k0bk2k1B := \sum_{k \ge 0} b_k 2^{-k-1}, which converges by [L2]. Splitting off the first term twice as in [L2] gives B=021+21BB = 0 \cdot 2^{-1} + 2^{-1}B' with B:=k0bk+12k1B' := \sum_{k \ge 0}b_{k+1}2^{-k-1}, and B=121+21BB' = 1 \cdot 2^{-1} + 2^{-1}B, since shifting twice returns bb. Hence B=21(21+21B)=41+41BB = 2^{-1}(2^{-1} + 2^{-1}B) = 4^{-1} + 4^{-1}B, so (141)B=41(1 - 4^{-1})B = 4^{-1} and B=13B = \tfrac13 by [L6].

givenL2L6
2.1

The five values of γ\gamma. By [L1], [L2] and [L3]: γ(13)=k12k1=21\gamma(\tfrac13) = \sum_{k \ge 1}2^{-k-1} = 2^{-1}; γ(23)=121=21\gamma(\tfrac23) = 1 \cdot 2^{-1} = 2^{-1}; γ(19)=k22k1=22=14\gamma(\tfrac19) = \sum_{k \ge 2}2^{-k-1} = 2^{-2} = \tfrac14; γ(14)=B=13\gamma(\tfrac14) = B = \tfrac13 by step 1.2, the halved digits of the alternating ternary sequence being exactly bb; and γ(79)=21+0+k22k1=12+14=34\gamma(\tfrac79) = 2^{-1} + 0 + \sum_{k \ge 2}2^{-k-1} = \tfrac12 + \tfrac14 = \tfrac34 by step 1.1.

step 1.1step 1.2L1L2L3L6
3.1

The values of cc. All five points lie in CC, so cc agrees with γ\gamma there by [L4]: c(19)=14c(\tfrac19) = \tfrac14, c(14)=13c(\tfrac14) = \tfrac13, c(79)=34c(\tfrac79) = \tfrac34 and c(13)=c(23)=12c(\tfrac13) = c(\tfrac23) = \tfrac12. Moreover 13<23\tfrac13 < \tfrac23 by [L6], both lie in CC, and (13,23)C=(\tfrac13,\tfrac23) \cap C = \varnothing by [L5]; so [L4] gives that cc is constant on [13,23][\tfrac13,\tfrac23], with the value c(13)=12c(\tfrac13) = \tfrac12.

step 2.1L1L3L4L5L6

Remarks

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

The Cantor set contains no interval of positive length yet has no isolated point, so every connected subset of it is a single point

Example

The Cantor set CC (The Cantor middle-thirds set as the intersection of the sets CnC_n obtained by removing open middle thirds) has two properties that sound incompatible and are not:

  1. it is perfect (Perfect subset of R\mathbb{R}: closed with no isolated points): closed, and every one of its points is a limit of other points of CC;
  2. it contains no interval with two distinct endpoints, and consequently every nonempty connected subset of CC (Separated sets, disconnection, and connected subset of R\mathbb{R}) is a single point.

Both are claims of 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; this item spells out what they say together and why they do not conflict. A set can be clustered everywhere and nowhere thick: every neighbourhood of a point of CC contains other points of CC, and yet no two points of CC are joined by a segment lying in CC. (Not "on both sides": C[0,1]C \subseteq [0,1] and both 00 and 11 lie in CC, so the endpoints have points of CC approaching them from one side only. Having no isolated point is the claim, and it does not require approach from both sides.)

On the phrase "totally disconnected". That is the usual name for property 2, and no definition of it exists at this point in the reading order; the phrase appears here only as a gloss, never as the claim. What is asserted is exactly property 2 as displayed, obtained from A subset of R\mathbb{R} is connected if and only if it is order-convex, that is, an interval.

Facts & Assumptions

[A1]

Nothing is assumed beyond the results cited; the item records a consequence of them.

[L1]

CC is closed, perfect, contains no interval with two distinct endpoints, and every nonempty connected subset of CC is a single point (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, claims 1, 3, 5, 6).

[L4]

Every point of CC is Φ(a)\Phi(a) for a unique {0,2}\{0,2\}-valued sequence aa, and changing one digit of aa produces another point of CC (The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}).

Verification

technique · direct
1.1

CC is perfect by claim 3 of [L1]: it is closed, and by [L2] no xCx \in C admits a real ε>0\varepsilon > 0 with Nε(x)C={x}N_\varepsilon(x) \cap C = \{x\}. Concretely, the second point inside Nε(x)N_\varepsilon(x) is obtained by changing one sufficiently late ternary digit of xx, which moves the point by 23k12 \cdot 3^{-k-1} ([L4]).

A1L1L2L4
1.2

CC contains no interval [u,v][u,v] with u<vu < v, by claim 5 of [L1]; this is where the measure-zero property of CC is spent, a null set containing no such interval.

A1L1
2.1

Every nonempty connected ECE \subseteq C is a single point: by [L3] such an EE is order-convex, so two distinct points u<vu < v of EE would give [u,v]EC[u,v] \subseteq E \subseteq C, contradicting step 1.2; and EE is nonempty. This is claim 6 of [L1].

step 1.2L1L3

Remarks

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

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

Statement refuted

Refuted claim: every nowhere dense subset of R\mathbb{R} has measure zero (FALSE: every nowhere dense subset of R\mathbb{R} has measure zero).

The witness is the Smith-Volterra-Cantor set SS (The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals): the subset of [0,1][0,1] obtained by removing, at stage nn, an open interval of length 4n14^{-n-1} from the middle of each of the 2n2^{n} intervals then present. It is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R}) and no cover of it by intervals has total length below 212^{-1}, so it is not of measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)). This item records the witness and says what makes it work; the refutation is carried out in full in FALSE: every nowhere dense subset of R\mathbb{R} has measure zero and The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero.

Facts & Assumptions

[A1]

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

[L1]

SS is compact, perfect and nowhere dense, and any bound MM on the partial total lengths of a cover of SS by intervals satisfies M21M \ge 2^{-1} (The Smith-Volterra-Cantor set is compact, perfect and nowhere dense, and does not have measure zero, claims 1 to 4).

[L2]

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

Counterexample

technique · direct
1.1

SS is a nowhere dense subset of R\mathbb{R}, by claim 3 of [L1].

L1
1.2

SS is not null: a cover witnessing nullity at ε:=41\varepsilon := 4^{-1} would give 41214^{-1} \ge 2^{-1} by claim 4 of [L1] and [L2], which is false.

L1L2
2.1

So SS witnesses the failure of [A1].

step 1.1step 1.2A1

Remarks

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

Q\mathbb{Q} is dense in R\mathbb{R} and has measure zero

Statement refuted

Refuted claim: every subset of R\mathbb{R} of measure zero is nowhere dense (FALSE: every subset of R\mathbb{R} of measure zero is nowhere dense).

The witness is QR\mathbb{Q}_{\mathbb{R}}, the set of rationals inside R\mathbb{R} (The rationals embed densely in the reals). It is at most countable, hence null (Every at most countable subset of R\mathbb{R} has measure zero), and it is dense, so its closure is R\mathbb{R} and the interior of that closure is R\mathbb{R}, as far from empty as possible. The refutation is carried out in full in FALSE: every subset of R\mathbb{R} of measure zero is nowhere dense; this item records the witness and the explicit cover.

Facts & Assumptions

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

[A1]

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

[L2]

QR\mathbb{Q}_{\mathbb{R}} is dense: QR=R\overline{\mathbb{Q}_{\mathbb{R}}} = \mathbb{R} (Both Q\mathbb{Q} and RQ\mathbb{R} \setminus \mathbb{Q} are dense in R\mathbb{R}, and every nonempty open subset of R\mathbb{R} is uncountable).

Counterexample

technique · direct
1.1

QR\mathbb{Q}_{\mathbb{R}} has measure zero, by [L1].

L1
1.2

QR\mathbb{Q}_{\mathbb{R}} is not nowhere dense: its closure is R\mathbb{R} by [L2] and the interior of R\mathbb{R} is R\mathbb{R} by [L3], which is not empty.

L2L3
2.1

So QR\mathbb{Q}_{\mathbb{R}} witnesses the failure of [A1].

step 1.1step 1.2A1

Remarks

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

Q[0,1]\mathbb{Q} \cap [0,1] has measure zero and not content zero, although it is bounded

Statement refuted

Refuted claim: every set of measure zero has content zero (FALSE: every set of measure zero has content zero).

The witness is E:=QR[0,1]E := \mathbb{Q}_{\mathbb{R}} \cap [0,1], the rationals of the unit interval (The rationals embed densely in the reals, Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). It is at most countable, hence null; it is bounded; and every finite family of intervals covering it has total length at least 11, because the union of finitely many closed intervals is closed and contains the closure of EE, which is all of [0,1][0,1]. The refutation is carried out in full in FALSE: every set of measure zero has content zero; this item records the witness and says what makes it work.

Facts & Assumptions

Given: The set E=QR[0,1]E = \mathbb{Q}_{\mathbb{R}} \cap [0,1].

[A1]

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

[L3]

A finite family of closed intervals covering [0,1][0,1] has total length at least 11 (If finitely many intervals cover a closed bounded interval [a,b][a,b], the sum of their lengths is at least bab - a).

[L4]

Content zero means a finite cover of total length below every positive ε\varepsilon; on compact sets content zero and measure zero coincide (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover), For a compact subset of R\mathbb{R}, measure zero and content zero coincide).

Counterexample

technique · direct
1.1

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

L1
1.2

Any finite family of closed intervals covering EE has total length at least 11: its union is closed by [L2] and contains EE, hence contains [0,1][0,1] by [L2], and [L3] applies.

L2L3
2.1

So EE does not have content zero, since a witness at ε=21\varepsilon = 2^{-1} would give a finite cover of total length at most 21<12^{-1} < 1; EE therefore witnesses the failure of [A1].

step 1.1step 1.2A1L4

Remarks

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

R\mathbb{R} is the union of a meager set and a set of measure zero, so smallness of category and smallness of measure are independent notions

Statement refuted

Refuted claim: meagreness and measure zero are comparable notions of smallness, so that a set small in one sense is small, or at least not co-small, in the other.

The witness is a decomposition R=(RG)G\mathbb{R} = (\mathbb{R} \setminus G) \cup G in which RG\mathbb{R} \setminus G is meager (Nowhere dense, meager (first category), residual, and second category subsets of R\mathbb{R}) and GG has measure zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)). So R\mathbb{R}, which by Baire category in R\mathbb{R}, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R\mathbb{R} is not a countable union of nowhere dense sets is not meager, splits into two pieces each of which is negligible, one in the sense of category and one in the sense of measure. In particular GG is residual and null at the same time, and its complement is meager and, being the complement of a null set, in no sense small in measure.

The set is G:=nNUn,Un:=kN(e(k)2kn2, e(k)+2kn2),G := \bigcap_{n \in \mathbb{N}} U_n, \qquad U_n := \bigcup_{k \in \mathbb{N}} \big(e(k) - 2^{-k-n-2},\ e(k) + 2^{-k-n-2}\big), where e:NQRe : \mathbb{N} \to \mathbb{Q}_{\mathbb{R}} is a bijection onto the rationals (The rationals embed densely in the reals).

Facts & Assumptions

Given: A bijection e:NQRe : \mathbb{N} \to \mathbb{Q}_{\mathbb{R}} onto the rationals inside R\mathbb{R}, the sets UnU_n and GG displayed above.

[A1]

The refuted claim: a meager set and a set of measure zero cannot together exhaust R\mathbb{R}, meagreness and nullity being comparable notions of smallness.

[L5]

Nullity: AA is null when for every real ε>0\varepsilon > 0 there is a sequence of closed intervals covering AA with all partial total lengths at most ε\varepsilon; every at most countable set is null (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover), Every at most countable subset of R\mathbb{R} has measure zero).

[L7]

GG is an intersection of a sequence of open sets, so it is GδG_\delta (FσF_\sigma and GδG_\delta subsets of R\mathbb{R}).

[L8]

Ordered-field arithmetic: 0<10 < 1, so 2>02 > 0 and 2kn2>02^{-k-n-2} > 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.

Counterexample

technique · direct
1.1

Fix ee by [L1]. Each UnU_n is an open set, being a union of open intervals by [L2], and each contains QR\mathbb{Q}_{\mathbb{R}}, since e(k)e(k) lies in the kk-th interval by [L8]. Hence each UnU_n is dense by [L1] and [L3], a superset of a dense set being dense.

givenL1L2L3L8choose
2.1

GG is null. Let the real ε>0\varepsilon > 0 be given and use [L4] to fix nn with 2nε2^{-n} \le \varepsilon. The closed intervals Ik:=[e(k)2kn2, e(k)+2kn2]I_k := [\,e(k) - 2^{-k-n-2},\ e(k) + 2^{-k-n-2}\,] cover UnU_n, hence cover GUnG \subseteq U_n, and each has length 2kn1=2n12k2^{-k-n-1} = 2^{-n-1}2^{-k} by [L2], [L4] and [L8]; so every partial total length is k<i2n12k=2n1k<i2k2n12=2nε\sum_{k<i}2^{-n-1}2^{-k} = 2^{-n-1}\sum_{k<i}2^{-k} \le 2^{-n-1} \cdot 2 = 2^{-n} \le \varepsilon by [L4]. By [L5] the set GG has measure zero.

step 1.1L4L5L8
2.2

RG\mathbb{R} \setminus G is meager. By De Morgan RG=n(RUn)\mathbb{R} \setminus G = \bigcup_n (\mathbb{R} \setminus U_n), and each RUn\mathbb{R} \setminus U_n is closed by [L2]. Its interior is empty: if Nδ(x)RUnN_\delta(x) \subseteq \mathbb{R} \setminus U_n for some real δ>0\delta > 0, then Nδ(x)N_\delta(x) would miss QRUn\mathbb{Q}_{\mathbb{R}} \subseteq U_n, contradicting the density of QR\mathbb{Q}_{\mathbb{R}} given by [L1] and [L3]. So each RUn\mathbb{R} \setminus U_n is nowhere dense by [L3], and RG\mathbb{R} \setminus G is meager.

step 1.1L1L2L3
3.1

So R=(RG)G\mathbb{R} = (\mathbb{R} \setminus G) \cup G with the first piece meager and the second null, which is the failure of [A1]. Moreover GG is residual, its complement being meager, and GG \ne \varnothing: were GG empty, R=RG\mathbb{R} = \mathbb{R} \setminus G would be meager, contradicting [L6]. Thus GG is a residual, GδG_\delta set of measure zero by [L7], and RG\mathbb{R} \setminus G is a meager set whose complement is null.

step 2.1step 2.2A1L3L6L7

Remarks

  • Both pieces are as small as their notion allows, and they are complementary. GG is null and residual; RG\mathbb{R} \setminus G is meager and its complement is null. So no implication holds between "meager" and "null" in either direction, and neither can be strengthened to a statement about the complement. This is the standard duality between measure and category, and GG is the standard witness for it.

  • GG contains all the irrationals that are well approximable by rationals. Membership in UnU_n says that some rational e(k)e(k) lies within 2kn22^{-k-n-2} of the point, so GG is a set of points approximable by rationals at every accuracy of that shape. Nothing on this page needs that reading; it is recorded because it is what makes the example natural rather than contrived.

  • Baire is used only once, and only for nonemptiness. Steps 2.1 and 2.2 are independent of Baire category in R\mathbb{R}, by nested intervals with canonically chosen rational endpoints: a countable intersection of dense open sets is dense, so R\mathbb{R} is not a countable union of nowhere dense sets; it enters in step 3.1 to rule out G=G = \varnothing, which would make the decomposition vacuous. That is also the precise sense in which the example needs the completeness of R\mathbb{R}.

  • The individual UnU_n are open, dense and of small total cover length, which is Q\mathbb{Q} is covered by open intervals of total length ε\varepsilon, for every ε>0\varepsilon > 0 with ε=2n\varepsilon = 2^{-n}; the example is that construction iterated and intersected.

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

1/41/4 lies in the Cantor set and is the endpoint of no removed interval, so the endpoints do not exhaust it

Statement refuted

Refuted claim: the Cantor set CC consists of the endpoints of the removed intervals and is therefore at most countable (FALSE: the Cantor set is countable because only countably many intervals were removed).

The witness is x0:=1/4x_0 := 1/4. It lies in CC, its ternary digit sequence being the alternating sequence (0,2,0,2,)(0,2,0,2,\dots) (Which points of [0,1][0,1] lie in the Cantor set, read off their ternary expansions, with 1/41/4 worked out), and it is the endpoint of no interval removed in the construction. Here, as everywhere on this page, uu is an endpoint of a removed interval means that uCu \in C and there is vuv \ne u with the open interval between uu and vv disjoint from CC; that is exactly what "the interval between them was removed" says in the vocabulary available. What is shown below is that CC meets every interval (x0,x0+δ)(x_0, x_0 + \delta) and every interval (x0δ,x0)(x_0 - \delta, x_0), for every real δ>0\delta > 0, so no such vv exists on either side.

Facts & Assumptions

Given: The Cantor set CC, the set DD of {0,2}\{0,2\}-valued sequences and the bijection Φ:DC\Phi : D \to C of The Cantor set is exactly the set of k1ak3k\sum_{k \ge 1} a_k 3^{-k} with every ak{0,2}a_k \in \{0,2\}, and this gives a bijection with {0,1}N\{0,1\}^{\mathbb{N}}; the alternating sequence aDa \in D, with aj=0a_j = 0 for even jj and aj=2a_j = 2 for odd jj; and x0:=Φ(a)x_0 := \Phi(a).

[A1]

The refuted claim: every point of CC is an endpoint of a removed interval, so CC is at most countable.

[L2]

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

[L4]

Ordered-field arithmetic: 0<10 < 1, so 3>03 > 0 and 31>03^{-1} > 0 and 231<12 \cdot 3^{-1} < 1; 3p3q3^{-p} \le 3^{-q} whenever qpq \le p, by induction from 0<31<10 < 3^{-1} < 1; 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), Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). 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.

Counterexample

technique · direct
1.1

By [L1] the point x0=1/4x_0 = 1/4 lies in CC and has digit sequence aa, with a2m=0a_{2m} = 0 and a2m+1=2a_{2m+1} = 2 for every mNm \in \mathbb{N}. By [L2], for every mm one may split Φ(a)=j<2maj3j1+j2maj3j1\Phi(a) = \sum_{j<2m}a_j3^{-j-1} + \sum_{j \ge 2m}a_j3^{-j-1}, and every tail jpaj3j1\sum_{j \ge p}a_j3^{-j-1} lies between 00 and 3p3^{-p}.

givenL1L2
2.1

Points of CC immediately above x0x_0. For mNm \in \mathbb{N} let bDb \in D agree with aa at every index <2m< 2m, have b2m=2b_{2m} = 2, and have bj=0b_j = 0 for j>2mj > 2m. Writing P:=j<2maj3j1P := \sum_{j<2m}a_j3^{-j-1}, step 1.1 and [L2] give Φ(b)=P+232m1\Phi(b) = P + 2 \cdot 3^{-2m-1} and Φ(a)=P+0+T\Phi(a) = P + 0 + T with 0T32m10 \le T \le 3^{-2m-1}, so Φ(b)x0=232m1T\Phi(b) - x_0 = 2 \cdot 3^{-2m-1} - T lies between 32m13^{-2m-1} and 232m12 \cdot 3^{-2m-1}; in particular Φ(b)>x0\Phi(b) > x_0 and Φ(b)x0232m1<32m3m\Phi(b) - x_0 \le 2 \cdot 3^{-2m-1} < 3^{-2m} \le 3^{-m} by [L4]. And Φ(b)C\Phi(b) \in C by [L1].

step 1.1L1L2L4
2.2

Points of CC immediately below x0x_0. For mNm \in \mathbb{N} let dDd \in D agree with aa at every index <2m+1< 2m+1, have d2m+1=0d_{2m+1} = 0, and have dj=2d_j = 2 for j>2m+1j > 2m+1. Writing Q:=j<2m+1aj3j1Q := \sum_{j<2m+1}a_j3^{-j-1}, step 1.1 and [L2] give Φ(d)=Q+0+32m2\Phi(d) = Q + 0 + 3^{-2m-2} and Φ(a)=Q+232m2+T\Phi(a) = Q + 2 \cdot 3^{-2m-2} + T' with 0T32m20 \le T' \le 3^{-2m-2}, so x0Φ(d)=32m2+Tx_0 - \Phi(d) = 3^{-2m-2} + T' lies between 32m23^{-2m-2} and 232m22 \cdot 3^{-2m-2}; in particular Φ(d)<x0\Phi(d) < x_0 and x0Φ(d)<32m13mx_0 - \Phi(d) < 3^{-2m-1} \le 3^{-m} by [L4]. And Φ(d)C\Phi(d) \in C by [L1].

step 1.1L1L2L4
3.1

Let the real δ>0\delta > 0 be given; by [L3] fix mm with 3m<δ3^{-m} < \delta. Steps 2.1 and 2.2 then produce points of CC in (x0, x0+δ)(x_0,\ x_0 + \delta) and in (x0δ, x0)(x_0 - \delta,\ x_0). Consequently, for every v>x0v > x_0 the interval (x0,v)(x_0, v) meets CC, and for every u<x0u < x_0 the interval (u,x0)(u, x_0) meets CC; so there is no vx0v \ne x_0 with the open interval between x0x_0 and vv disjoint from CC, and x0x_0 is the endpoint of no removed interval. Since x0Cx_0 \in C, the claim [A1] fails at x0x_0.

step 2.1step 2.2A1L1L3L4

Remarks

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)Open item page →

The irrationals form a residual GδG_\delta set that is not FσF_\sigma

Statement refuted

Refuted claim: Q\mathbb{Q} is a GδG_\delta subset of R\mathbb{R} (FALSE: Q\mathbb{Q} is a GδG_\delta subset of R\mathbb{R}); equivalently, by complementation (FσF_\sigma and GδG_\delta subsets of R\mathbb{R}), the irrationals are FσF_\sigma.

The witness is the set X:=RQRX := \mathbb{R} \setminus \mathbb{Q}_{\mathbb{R}} of irrationals (The rationals embed densely in the reals). It is GδG_\delta, being n(R{e(n)})\bigcap_n (\mathbb{R} \setminus \{e(n)\}) for any enumeration ee of the rationals, and it is residual, its complement being a countable union of singletons; but it is not FσF_\sigma, and that is the failure of the refuted claim. The refutation is carried out in full in Q\mathbb{Q} is FσF_\sigma, meager and not GδG_\delta, while the irrationals are GδG_\delta, residual and not FσF_\sigma; this item records the witness and the three properties that make it the right one.

Facts & Assumptions

Given: The set QR\mathbb{Q}_{\mathbb{R}} of rationals inside R\mathbb{R} and its complement X=RQRX = \mathbb{R} \setminus \mathbb{Q}_{\mathbb{R}}.

[A1]

The refuted claim: QR\mathbb{Q}_{\mathbb{R}} is GδG_\delta, equivalently XX is FσF_\sigma.

[L1]

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

Counterexample

technique · direct
1.1

XX is GδG_\delta and residual, by claim 2 of [L1].

L1
1.2

XX is not FσF_\sigma: were it FσF_\sigma, its complement QR\mathbb{Q}_{\mathbb{R}} would be GδG_\delta by [L2], which claim 3 of [L1] forbids.

L1L2
2.1

So XX is a residual GδG_\delta set that is not FσF_\sigma, and it witnesses the failure of [A1] in both of the equivalent formulations.

step 1.1step 1.2A1L2

Remarks

Sources