Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-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.

A set of content zero has measure zero

Statement

If ARA \subseteq \mathbb{R} has content zero (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)) then AA has measure zero.

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

Facts & Assumptions

Given: A set ARA \subseteq \mathbb{R} of content zero and a real ε>0\varepsilon > 0.

[L1]

AA has content zero when for every real η>0\eta > 0 there are nNn \in \mathbb{N} and reals a0b0,,anbna_0 \le b_0, \dots, a_n \le b_n with Ajn[aj,bj]A \subseteq \bigcup_{j \le n}[a_j,b_j] and jn(bjaj)η\sum_{j \le n}(b_j - a_j) \le \eta; AA is null when for every real η>0\eta > 0 there are sequences with the analogous properties and k<i(bkak)η\sum_{k<i}(b_k - a_k) \le \eta for every iNi \in \mathbb{N} (Measure zero (a countable cover by intervals of total length below every ε\varepsilon) and content zero (a finite such cover)).

[L2]

[c,c]={c}[c,c] = \{c\} is an interval of length 00, and [c,d][c,d] has length dc0d - c \ge 0 for cdc \le d (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L3]

Finite sums: k<itk=k<n+1tk+k=n+1i1tk\sum_{k<i} t_k = \sum_{k<n+1} t_k + \sum_{k=n+1}^{i-1} t_k for n+1in + 1 \le i, a sum of nonnegative terms is nonnegative and is monotone in the number of nonnegative terms adjoined, and k<itkk<n+1tk\sum_{k<i} t_k \le \sum_{k<n+1} t_k whenever in+1i \le n+1 and the terms are nonnegative (Finite sums and finite products, by recursion, Laws of finite sums and finite products, Series, partial sums, convergence and the sum, divergence, and the tail series).

[L4]

Ordered-field arithmetic: adding a nonnegative quantity does not decrease a value, and the order is transitive (Order is preserved by adding a constant and by adding inequalities, Ordered field, Complete ordered field (least-upper-bound property)). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

Let the real ε>0\varepsilon > 0 be given; since AA has content zero, [L1] supplies nNn \in \mathbb{N} and reals a0b0,,anbna_0 \le b_0, \dots, a_n \le b_n with Ajn[aj,bj]A \subseteq \bigcup_{j \le n}[a_j,b_j] and jn(bjaj)ε\sum_{j \le n}(b_j - a_j) \le \varepsilon.

givenL1choose
2.1

Extend the finite list to sequences by putting ak:=0a_k := 0 and bk:=0b_k := 0 for k>nk > n; then akbka_k \le b_k for every kNk \in \mathbb{N}, the added intervals [0,0][0,0] have length 00 by [L2], and Ajn[aj,bj]kN[ak,bk]A \subseteq \bigcup_{j \le n}[a_j,b_j] \subseteq \bigcup_{k \in \mathbb{N}}[a_k,b_k].

step 1.1L2
3.1

For every iNi \in \mathbb{N} one has k<i(bkak)ε\sum_{k<i}(b_k - a_k) \le \varepsilon: all the terms are nonnegative by [L2], so for in+1i \le n+1 the sum is at most k<n+1(bkak)=jn(bjaj)ε\sum_{k<n+1}(b_k - a_k) = \sum_{j \le n}(b_j - a_j) \le \varepsilon by [L3] and step 1.1, and for i>n+1i > n+1 the sum equals k<n+1(bkak)\sum_{k<n+1}(b_k - a_k) plus a sum of terms all equal to 00, hence is again at most ε\varepsilon, by [L3] and [L4].

step 1.1step 2.1L2L3L4
4.1

So for every real ε>0\varepsilon > 0 there is a sequence of closed intervals covering AA with every partial total length at most ε\varepsilon, which by [L1] is exactly the statement that AA has measure zero.

step 2.1step 3.1L1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 54 results over 14 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