Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-05
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 Vitali covering theorem for fine covers on the real line

Statement

Assume dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

Let ER with λ(E)<, and let V be a fine cover of E by closed nondegenerate intervals (Vitali covers and fine covers on the real line by closed intervals, Lebesgue outer measure on Rn). Then there is a countable pairwise disjoint subfamily (In)n1 of V such that

λ ⁣(En1In)=0.

Moreover, for every ε>0 there is a finite pairwise disjoint subfamily I1,,IN from V such that

λ ⁣(En=1NIn)<ε.

Facts & Assumptions

Given: Dependent choice, the set ER with λ(E)<, and a fine interval cover V of E.

[A1]

The symbols are those of the statement.

Proof

technique · direct
1.1

Choose an open set UE with finite length and λ(U)<λ(E)+1. Because V is fine, every xE lies in arbitrarily short intervals of V, so after shrinking we may restrict to the subfamily VU:={IV:IU}, which is still a fine cover of E. Using dependent choice, choose a sequence (In)n1 in VU{} as follows: as long as there exists an interval of VU disjoint from the previously chosen nonempty intervals, choose In disjoint from those earlier nonempty intervals and with length at least half the supremum of the lengths of all such candidates; once no disjoint candidate remains, set In= and all later terms equal to .

givenchoose
2.1

Let M:={n1:In}. The nonempty intervals (In)nM are pairwise disjoint and lie in the finite-open set U, so nMInλ(U)<. If M is finite, write M={1,,N} and let R:=En=1NIn. If xR, then the finite union n=1NIn is closed and does not contain x, so d:=dist(x,n=1NIn)>0. Because VU is a fine cover of E, choose JVU with xJ and J<d. Then J is disjoint from I1,,IN, contradicting the terminal clause in step 1.1. Therefore R=. In this finite-termination case the theorem already holds with the finite family I1,,IN, and the finite ε-version is immediate as well.

step 1.1algebra
2.2

It remains to treat the case where M is infinite. Then no In is empty, because empties persist forever after the first one, so n1In< and therefore In0. Let R:=En1In. Fix xR and m1. Since x does not lie in the finite union I1Im1, the distance dm:=dist ⁣(x,n=1m1In) is positive. Also sm:=supnmIn>0, because there are infinitely many nonempty intervals in the tail. Choose JVU with xJ,J<min(dm,sm). Then J is disjoint from I1,,Im1. If J were disjoint from every In with nm, then J would remain a candidate at every later stage. The half-maximal choice would then give J2In for every nm, contradicting In0. So J meets some In with nm; let n be the least such index. Then J is disjoint from I1,,In1, so it is an admissible candidate at stage n, and the half-maximal choice gives J2In. Intersecting intervals with comparable lengths satisfy J5In. Therefore xnm5In. Since m was arbitrary, Rm1nm5In.

step 1.1algebra
3.1

By countable subadditivity of outer measure and the interval formula for Lebesgue outer measure, λ(R)infm1λ ⁣(nm5In)infm15nmIn=0. This proves the countable disjoint conclusion in the infinite case. For the finite version, choose N so large that 5n>NIn<ε and repeat the same estimate with RN:=En=1NIn.

step 2.2algebra
4.1

Steps 1.1 through 4.1 prove both forms of the theorem.

step 1.1step 2.1step 2.2step 3.1

Depends on

Used by

Dependency tree · two levels

37 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