Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

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

Depends on

Used by

Dependency tree · two levels

105 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources