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 -indexed chain).
Let with , and let be a fine cover of by closed nondegenerate intervals (Vitali covers and fine covers on the real line by closed intervals, Lebesgue outer measure on ). Then there is a countable pairwise disjoint subfamily of such that
Moreover, for every there is a finite pairwise disjoint subfamily from such that
Facts & Assumptions
Given: Dependent choice, the set with , and a fine interval cover of .
The symbols are those of the statement.
Proof
Choose an open set with finite length and . Because is fine, every lies in arbitrarily short intervals of , so after shrinking we may restrict to the subfamily which is still a fine cover of . Using dependent choice, choose a sequence in as follows: as long as there exists an interval of disjoint from the previously chosen nonempty intervals, choose 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 and all later terms equal to .
Let . The nonempty intervals are pairwise disjoint and lie in the finite-open set , so If is finite, write and let . If , then the finite union is closed and does not contain , so . Because is a fine cover of , choose with and . Then is disjoint from , contradicting the terminal clause in step 1.1. Therefore . In this finite-termination case the theorem already holds with the finite family , and the finite -version is immediate as well.
It remains to treat the case where is infinite. Then no is empty, because empties persist forever after the first one, so and therefore . Let . Fix and . Since does not lie in the finite union , the distance is positive. Also because there are infinitely many nonempty intervals in the tail. Choose with Then is disjoint from . If were disjoint from every with , then would remain a candidate at every later stage. The half-maximal choice would then give for every , contradicting . So meets some with ; let be the least such index. Then is disjoint from , so it is an admissible candidate at stage , and the half-maximal choice gives . Intersecting intervals with comparable lengths satisfy . Therefore . Since was arbitrary,
By countable subadditivity of outer measure and the interval formula for Lebesgue outer measure, This proves the countable disjoint conclusion in the infinite case. For the finite version, choose so large that and repeat the same estimate with .
Steps 1.1 through 4.1 prove both forms of the theorem.
Depends on
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Lebesgue outer measure on $\mathbb{R}^n$
- Measure zero (a countable cover by intervals of total length below every $\varepsilon$) and content zero (a finite such cover)
- Vitali covers and fine covers on the real line by closed intervals
- Finite and countable subadditivity of measures
- A subset of $\mathbb{R}$ is compact if and only if it is closed and bounded
- A subset of $\mathbb{R}$ has Lebesgue outer measure zero if and only if it has measure zero in the sense of countable closed-interval covers
- Assuming countable choice, Lebesgue outer measure is an outer measure that restricts to elementary volume
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
- Brian S. Thomson, Vitali Coverings and Lebesgue's Differentiation Theorem, Section 4 (standard reference, not scraped)
- A. M. Bruckner, J. B. Bruckner, and B. S. Thomson, Real Analysis, 2nd ed., Mini-Vitali and Vitali covering sections (standard reference, not scraped)