Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 SS be the Smith-Volterra-Cantor set (The Smith-Volterra-Cantor set: the same construction removing, at stage n1n \ge 1, an open middle interval of length 4n4^{-n} from each of the 2n12^{n-1} remaining intervals). Then:

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

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

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

Facts & Assumptions

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

[A1]

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

[L1]

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

[L2]

[c,d][c,d] is a closed set, (c,d)(c,d) is open, Nε(x)=(xε,x+ε)N_\varepsilon(x) = (x-\varepsilon,x+\varepsilon), a closed bounded interval is bounded, finite unions of closed sets are closed and an intersection of a nonempty family of closed sets is closed (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length, Open subset of R\mathbb{R} (every point has a neighbourhood inside it), closed subset (complement open), and clopen, The ε\varepsilon-neighbourhood and the punctured ε\varepsilon-neighbourhood of a point of R\mathbb{R}, Lower bound, bounded below, bounded set, Arbitrary unions and finite intersections of open subsets of R\mathbb{R} are open, and dually for closed sets).

[L5]

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

[L6]

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

[L7]

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

[L9]

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

[L10]

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

Proof

technique · contradiction
1.1

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

assume-contragivenA1choose
1.2

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

L1L2L3
1.3

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

L1L9L10
1.4

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

L1L9
1.5

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

L1L9
2.1

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

step 1.3L1L10
2.2

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

step 1.2step 1.4L1L4L8L10
3.1

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

step 1.2step 2.1L1L4L8L10
3.2

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

step 1.1step 1.5step 2.1A1L1L6L7L8L9
4.1

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

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

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 146 results over 33 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources