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.

✓ 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: 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 is covered by open intervals of total length ε, for every ε>0

Example

Let QR⊆R be the set of rationals (The rationals embed densely in the reals) and let ε>0 be real. Then there is a sequence (Vk)k∈N of open intervals (Intervals of R: the nine order-convex forms, nondegeneracy, and length) with

QR⊆⋃k∈NVkand∑k=0∞length⁡(Vk)=ε.

Explicitly, if e:N→QR is a bijection, one may take Vk:=(e(k)−ε2−k−2, e(k)+ε2−k−2), of length ε2−k−1.

This is Every at most countable subset of 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 is nonetheless covered by open intervals whose lengths add up to a millionth.

Facts & Assumptions

Given: A real ε>0 and the set QR of rationals inside R.

[L5]

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

[L6]

Ordered-field arithmetic: 0<1, so 2>0, 4>0 and ε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:N→QR and put δk:=ε⋅2−k−2, a positive real by [L3] and [L6], and Vk:=(e(k)−δk, e(k)+δk), an open interval of length 2δk=ε2−k−1 by [L2], [L3] and [L6].

givenL1L2L3L6choose
1.2

The family covers QR: every rational is e(k) for some k, and e(k)∈Vk because e(k)−δk<e(k)<e(k)+δk by [L6].

L1L2L6
2.1

The lengths sum to ε: by [L4] the partial sums are ∑k<nε2−k−1=ε2−1∑k<n2−k, and by [L3] the series ∑k2−k converges to 2, so by [L3] and [L4] the series ∑kε2−k−1 converges with sum ε⋅2−1⋅2=ε.

step 1.1L3L4L6
3.1

So the open intervals Vk cover QR with total length exactly ε, as claimed; since ε>0 was arbitrary, this also re-exhibits the nullity of QR given by [L5], the closed intervals [e(k)−δk,e(k)+δ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 Vk is open, so ⋃kVk is an open set containing every rational, hence dense; and its covering intervals have total length ε. Iterating this over a sequence of shrinking ε is exactly the construction of 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 ε⋅2−1, not ε: sequences here start at k=0 and the total ε2−1∑k≥02−k is exactly ε. Copying the classical ε2−k from a 1-indexed source would give total 2ε.

  • What this does not show. It does not show that the union of the Vk 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 Vk, 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 ε) 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] lie in the Cantor set, read off their ternary expansions, with 1/4 worked out

Example

By 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 a real x lies in the Cantor set C exactly when

x  =  Φ(a)  =  ∑k=0∞ak3−k−1for some sequence a with every ak∈{0,2},

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

xdigit sequence Φ−1(x)
00,0,0,0,…
12,2,2,2,…
1/30,2,2,2,…
2/32,0,0,0,…
1/90,0,2,2,2,…
1/40,2,0,2,0,2,…

The last line is the interesting one: the digits of 1/4 alternate for ever, so 1/4 lies in C without being an endpoint of any interval removed in the construction (1/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 C, the set D of {0,2}-valued sequences and the bijection Φ:D→C 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. Write σa for the shifted sequence (σa)k=ak+1.

[L2]

∑k=0∞rk=1/(1−r) for ∣r∣<1; in particular ∑k≥03−k=3⋅2−1 and hence ∑k≥m2⋅3−k−1=3−m; convergent series add and scale termwise, and the tail of a convergent series is again convergent with ∑k≥0tk=t0+∑k≥1tk (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥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 am, Laws of integer exponents).

[L4]

Ordered-field arithmetic: 0<1, so 3>0, 3−1>0, 8>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 a∈D, Φ(a)=a0⋅3−1+3−1Φ(σa): by [L2] the series splits as Φ(a)=a03−1+∑k≥1ak3−k−1, and ∑k≥1ak3−k−1=∑j≥0aj+13−j−2=3−1∑j≥0aj+13−j−1=3−1Φ(σa) by [L2] and [L4].

givenL1L2L4
1.2

The constant and eventually constant sequences. By [L2], Φ(0,0,0,… )=0 and Φ(2,2,2,… )=∑k≥02⋅3−k−1=30=1. Likewise Φ(0,2,2,2,… )=0+∑k≥12⋅3−k−1=3−1=1/3, Φ(2,0,0,… )=2⋅3−1=2/3, and Φ(0,0,2,2,2,… )=∑k≥22⋅3−k−1=3−2=1/9.

L1L2
2.1

The alternating sequence gives 1/4. Let a be the sequence with ak=0 for even k and ak=2 for odd k, so a∈D and σ(σa)=a. Applying step 1.1 twice, Φ(a)=0⋅3−1+3−1Φ(σa) and Φ(σa)=2⋅3−1+3−1Φ(a), so Φ(a)=3−1(2⋅3−1+3−1Φ(a))=2⋅9−1+9−1Φ(a); hence (1−9−1)Φ(a)=2⋅9−1, that is 8⋅9−1Φ(a)=2⋅9−1 and Φ(a)=2⋅8−1=1/4, by [L4].

step 1.1L4
3.1

So all six points of the table lie in C by [L1], with the digit sequences shown, and the sequences are the only ones representing them because Φ is injective by [L1]. The point 1/4 has a digit sequence that is not eventually constant, since it takes both values 0 and 2 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/2, so the set cannot be covered by intervals of total length less than 1/2

Example

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). At stage n exactly 2n open intervals, each of length 4−n−1, are removed, so the lengths removed at that stage total 2n⋅4−n−1=4−1⋅2−n and over all stages they total

∑n=0∞4−1⋅2−n  =  4−1⋅2  =  12.

Correspondingly, no cover of S by intervals has total length below 12: if (ak), (bk) are sequences of reals with ak≤bk, S⊆⋃k[ak,bk] and ∑k<i(bk−ak)≤M for every i, then M≥12 (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 S itself.

Facts & Assumptions

Given: The Smith-Volterra-Cantor set S, the lengths (λn), the gaps gn, the lists (Nn,ℓ(n)) and the removed intervals Mj(n)=(ej(n)+λn+1, ej(n)+gn) 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.

[L3]

If sequences (ak), (bk) with ak≤bk cover S and all partial total lengths are at most M, then M≥2−1; and S 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 ε) and content zero (a finite such cover)).

[L5]

Ordered-field arithmetic: 0<1, so 2>0 and 4>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 n. By [L1] the intervals removed at stage n are the Mj(n) for j<Nn, each of length 4−n−1, so their lengths total ∑j<Nn4−n−1=2n⋅4−n−1, which equals 4−1⋅2−n because 4−n−1=4−1⋅4−n=4−1⋅2−2n and 2n⋅2−2n=2−n by [L1] and [L5].

givenL1L5
2.1

All stages together. The terms 4−12−n are nonnegative, and by [L2] the series ∑n4−12−n converges with sum 4−1⋅2=2−1. So the total length of all the removed intervals is exactly 2−1.

step 1.1L2L5
3.1

The lower bound for covers. [L3] says precisely that a bound M on all the partial total lengths of a cover of S satisfies M≥2−1; so no cover of S by intervals, countable or finite, has total length below 2−1, and in particular S is not null. The two computations fit together: the removed intervals of total length 2−1 and any cover of S of total length M together cover [0,1], so M+2−1≥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/2" is a statement about all covers. Neither says that S has measure 1/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 4−n and not 3−n. For the middle-thirds construction the removed length at stage n is 2n3−n−1, and ∑n2n3−n−1=3−1⋅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/2 is sharp in one direction only. The removed intervals together with a cover of S must reach total length 1, so a cover of S cannot do better than 1/2; whether total length exactly 1/2 is approached by covers of S 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 is uncountable

Example

R is uncountable (Finite, countably infinite, countable, uncountable), by 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: a singleton is nowhere dense, so a listing of R would present 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 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 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.

[L3]

U is open when every point of it has a neighbourhood inside it, F is closed when its complement is open, and Nε(x)=(x−ε,x+ε) contains 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, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L4]

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

[L5]

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

[L6]

Ordered-field arithmetic: 0<1, so 2>0 and 0<ε⋅2−1<ε for ε>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 c∈R the singleton {c} is nowhere dense: it is closed, 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 by [L6], so no neighbourhood of c is contained in {c}. By [L2] it is nowhere dense.

L2L3L6
2.1

Let s:N→R be any function. The sets An:={s(n)} are nowhere dense by step 1.1, so ⋃nAn≠R by [L1]; but ⋃nAn is exactly the image of s, so s is not surjective.

step 1.1L1
3.1

Hence there is no surjection N→R. Since R is nonempty, [L4] gives that R is not at most countable, that is, 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/2 on all of [1/3,2/3], and its values at 1/9, 1/4 and 7/9

Example

Let c be the Cantor function (The Cantor function on [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.

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], defined on the Cantor set through ternary digits and extended constantly across each removed interval prescribes on C, and by the constancy across gaps 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 off C.

Facts & Assumptions

[L3]

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

[L4]

c(t)=γ(t) for t∈C; c is constant on [u,v] whenever u<v, u,v∈C and (u,v)∩C=∅ (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, claims 1 and 4).

[L6]

Ordered-field arithmetic: 0<1, so 2>0, 3>0, 4>0 and 13<23; 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,… ): by [L2] that value is 2⋅3−1+0+∑k≥22⋅3−k−1=23+3−2=23+19=79.

givenL1L2L6
1.2

The value of γ at the alternating sequence. Let b be the {0,1}-valued sequence with bk=0 for even k and bk=1 for odd k, and put B:=∑k≥0bk2−k−1, which converges by [L2]. Splitting off the first term twice as in [L2] gives B=0⋅2−1+2−1B′ with B′:=∑k≥0bk+12−k−1, and B′=1⋅2−1+2−1B, since shifting twice returns b. Hence B=2−1(2−1+2−1B)=4−1+4−1B, so (1−4−1)B=4−1 and B=13 by [L6].

givenL2L6
2.1

The five values of γ. By [L1], [L2] and [L3]: γ(13)=∑k≥12−k−1=2−1; γ(23)=1⋅2−1=2−1; γ(19)=∑k≥22−k−1=2−2=14; γ(14)=B=13 by step 1.2, the halved digits of the alternating ternary sequence being exactly b; and γ(79)=2−1+0+∑k≥22−k−1=12+14=34 by step 1.1.

step 1.1step 1.2L1L2L3L6
3.1

The values of c. All five points lie in C, so c agrees with γ there by [L4]: c(19)=14, c(14)=13, c(79)=34 and c(13)=c(23)=12. Moreover 13<23 by [L6], both lie in C, and (13,23)∩C=∅ by [L5]; so [L4] gives that c is constant on [13,23], with the value c(13)=12.

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 C (The Cantor middle-thirds set as the intersection of the sets Cn obtained by removing open middle thirds) has two properties that sound incompatible and are not:

  1. it is perfect (Perfect subset of R: closed with no isolated points): closed, and every one of its points is a limit of other points of C;
  2. it contains no interval with two distinct endpoints, and consequently every nonempty connected subset of C (Separated sets, disconnection, and connected subset of 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 C contains other points of C, and yet no two points of C are joined by a segment lying in C. (Not "on both sides": C⊆[0,1] and both 0 and 1 lie in C, so the endpoints have points of C 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 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]

C is closed, perfect, contains no interval with two distinct endpoints, and every nonempty connected subset of C 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 C is Φ(a) for a unique {0,2}-valued sequence a, and changing one digit of a produces another point of C (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).

Verification

technique · direct
1.1

C is perfect by claim 3 of [L1]: it is closed, and by [L2] no x∈C admits a real ε>0 with Nε(x)∩C={x}. Concretely, the second point inside Nε(x) is obtained by changing one sufficiently late ternary digit of x, which moves the point by 2⋅3−k−1 ([L4]).

A1L1L2L4
1.2

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

A1L1
2.1

Every nonempty connected E⊆C is a single point: by [L3] such an E is order-convex, so two distinct points u<v of E would give [u,v]⊆E⊆C, contradicting step 1.2; and E 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 has measure zero (FALSE: every nowhere dense subset of R has measure zero).

The witness is the Smith-Volterra-Cantor set S (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): the subset of [0,1] obtained by removing, at stage n, an open interval of length 4−n−1 from the middle of each of the 2n intervals then present. It is nowhere dense (Nowhere dense, meager (first category), residual, and second category subsets of R) and no cover of it by intervals has total length below 2−1, so it is not of measure zero (Measure zero (a countable cover by intervals of total length below every ε) 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 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 has measure zero.

[L1]

S is compact, perfect and nowhere dense, and any bound M on the partial total lengths of a cover of S by intervals satisfies M≥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 it admits 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)).

Counterexample

technique · direct
1.1

S is a nowhere dense subset of R, by claim 3 of [L1].

L1
1.2

S is not null: a cover witnessing nullity at ε:=4−1 would give 4−1≥2−1 by claim 4 of [L1] and [L2], which is false.

L1L2
2.1

So S 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 is dense in R and has measure zero

Statement refuted

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

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

Facts & Assumptions

Counterexample

technique · direct
1.1

QR has measure zero, by [L1].

L1
1.2

QR is not nowhere dense: its closure is R by [L2] and the interior of R is R by [L3], which is not empty.

L2L3
2.1

So QR 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] 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], the rationals of the unit interval (The rationals embed densely in the reals, Intervals of 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 1, because the union of finitely many closed intervals is closed and contains the closure of E, which is all of [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].

[A1]

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

[L3]

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

[L4]

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

Counterexample

technique · direct
1.1

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

L1
1.2

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

L2L3
2.1

So E does not have content zero, since a witness at ε=2−1 would give a finite cover of total length at most 2−1<1; E 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 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=(R∖G)∪G in which R∖G is meager (Nowhere dense, meager (first category), residual, and second category subsets of R) and G has measure zero (Measure zero (a countable cover by intervals of total length below every ε) and content zero (a finite such cover)). So R, which by 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 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 G 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:=⋂n∈NUn,Un:=⋃k∈N(e(k)−2−k−n−2, e(k)+2−k−n−2), where e:N→QR is a bijection onto the rationals (The rationals embed densely in the reals).

Facts & Assumptions

Given: A bijection e:N→QR onto the rationals inside R, the sets Un and G displayed above.

[A1]

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

[L5]

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

[L7]

G is an intersection of a sequence of open sets, so it is Gδ (Fσ and Gδ subsets of R).

[L8]

Ordered-field arithmetic: 0<1, so 2>0 and 2−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 e by [L1]. Each Un is an open set, being a union of open intervals by [L2], and each contains QR, since e(k) lies in the k-th interval by [L8]. Hence each Un is dense by [L1] and [L3], a superset of a dense set being dense.

givenL1L2L3L8choose
2.1

G is null. Let the real ε>0 be given and use [L4] to fix n with 2−n≤ε. The closed intervals Ik:=[ e(k)−2−k−n−2, e(k)+2−k−n−2 ] cover Un, hence cover G⊆Un, and each has length 2−k−n−1=2−n−12−k by [L2], [L4] and [L8]; so every partial total length is ∑k<i2−n−12−k=2−n−1∑k<i2−k≤2−n−1⋅2=2−n≤ε by [L4]. By [L5] the set G has measure zero.

step 1.1L4L5L8
2.2

R∖G is meager. By De Morgan R∖G=⋃n(R∖Un), and each R∖Un is closed by [L2]. Its interior is empty: if Nδ(x)⊆R∖Un for some real δ>0, then Nδ(x) would miss QR⊆Un, contradicting the density of QR given by [L1] and [L3]. So each R∖Un is nowhere dense by [L3], and R∖G is meager.

step 1.1L1L2L3
3.1

So R=(R∖G)∪G with the first piece meager and the second null, which is the failure of [A1]. Moreover G is residual, its complement being meager, and G≠∅: were G empty, R=R∖G would be meager, contradicting [L6]. Thus G is a residual, Gδ set of measure zero by [L7], and R∖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. G is null and residual; R∖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 G is the standard witness for it.

  • G contains all the irrationals that are well approximable by rationals. Membership in Un says that some rational e(k) lies within 2−k−n−2 of the point, so G 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, 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; it enters in step 3.1 to rule out G=∅, which would make the decomposition vacuous. That is also the precise sense in which the example needs the completeness of R.

  • The individual Un are open, dense and of small total cover length, which is Q is covered by open intervals of total length ε, for every ε>0 with ε=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/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 C 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/4. It lies in C, its ternary digit sequence being the alternating sequence (0,2,0,2,… ) (Which points of [0,1] lie in the Cantor set, read off their ternary expansions, with 1/4 worked out), and it is the endpoint of no interval removed in the construction. Here, as everywhere on this page, u is an endpoint of a removed interval means that u∈C and there is v≠u with the open interval between u and v disjoint from C; that is exactly what "the interval between them was removed" says in the vocabulary available. What is shown below is that C meets every interval (x0,x0+δ) and every interval (x0−δ,x0), for every real δ>0, so no such v exists on either side.

Facts & Assumptions

Given: The Cantor set C, the set D of {0,2}-valued sequences and the bijection Φ:D→C 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; the alternating sequence a∈D, with aj=0 for even j and aj=2 for odd j; and x0:=Φ(a).

[A1]

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

[L2]

Geometric tails: ∑j≥m2⋅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 ∑j≥0tj=∑j<mtj+∑j≥mtj (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, Convergent series add and scale termwise, Series, partial sums, convergence and the sum, divergence, and the tail series, Integer powers am, Laws of integer exponents).

[L4]

Ordered-field arithmetic: 0<1, so 3>0 and 3−1>0 and 2⋅3−1<1; 3−p≤3−q whenever q≤p, by induction from 0<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: 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/4 lies in C and has digit sequence a, with a2m=0 and a2m+1=2 for every m∈N. By [L2], for every m one may split Φ(a)=∑j<2maj3−j−1+∑j≥2maj3−j−1, and every tail ∑j≥paj3−j−1 lies between 0 and 3−p.

givenL1L2
2.1

Points of C immediately above x0. For m∈N let b∈D agree with a at every index <2m, have b2m=2, and have bj=0 for j>2m. Writing P:=∑j<2maj3−j−1, step 1.1 and [L2] give Φ(b)=P+2⋅3−2m−1 and Φ(a)=P+0+T with 0≤T≤3−2m−1, so Φ(b)−x0=2⋅3−2m−1−T lies between 3−2m−1 and 2⋅3−2m−1; in particular Φ(b)>x0 and Φ(b)−x0≤2⋅3−2m−1<3−2m≤3−m by [L4]. And Φ(b)∈C by [L1].

step 1.1L1L2L4
2.2

Points of C immediately below x0. For m∈N let d∈D agree with a at every index <2m+1, have d2m+1=0, and have dj=2 for j>2m+1. Writing Q:=∑j<2m+1aj3−j−1, step 1.1 and [L2] give Φ(d)=Q+0+3−2m−2 and Φ(a)=Q+2⋅3−2m−2+T′ with 0≤T′≤3−2m−2, so x0−Φ(d)=3−2m−2+T′ lies between 3−2m−2 and 2⋅3−2m−2; in particular Φ(d)<x0 and x0−Φ(d)<3−2m−1≤3−m by [L4]. And Φ(d)∈C by [L1].

step 1.1L1L2L4
3.1

Let the real δ>0 be given; by [L3] fix m with 3−m<δ. Steps 2.1 and 2.2 then produce points of C in (x0, x0+δ) and in (x0−δ, x0). Consequently, for every v>x0 the interval (x0,v) meets C, and for every u<x0 the interval (u,x0) meets C; so there is no v≠x0 with the open interval between x0 and v disjoint from C, and x0 is the endpoint of no removed interval. Since x0∈C, the claim [A1] fails at x0.

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δ set that is not Fσ

Statement refuted

Refuted claim: Q is a Gδ subset of R (FALSE: Q is a Gδ subset of R); equivalently, by complementation (Fσ and Gδ subsets of R), the irrationals are Fσ.

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

Facts & Assumptions

Given: The set QR of rationals inside R and its complement X=R∖QR.

[A1]

The refuted claim: QR is Gδ, equivalently X is Fσ.

[L1]

QR is Fσ and meager, X is 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, 3).

Counterexample

technique · direct
1.1

X is Gδ and residual, by claim 2 of [L1].

L1
1.2

X is not Fσ: were it Fσ, its complement QR would be Gδ by [L2], which claim 3 of [L1] forbids.

L1L2
2.1

So X is a residual Gδ set that is not Fσ, and it witnesses the failure of [A1] in both of the equivalent formulations.

step 1.1step 1.2A1L2∎

Remarks

Sources