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.
Vitali covering lemma for Euclidean balls with fivefold dilates
Statement
For a ball , write .
-
Let be a finite family of Euclidean balls in . Then there is a pairwise disjoint subfamily such that Consequently, under the Axiom of Countable Choice,
-
Let be a countable family of Euclidean balls whose radii are bounded above. Then there is a finite or countably infinite index set such that is pairwise disjoint and
The two geometric covering assertions require no choice principle. Countable choice is used only for the displayed Lebesgue-measure consequence.
Facts & Assumptions
Given: A family of Euclidean balls in .
The Euclidean balls are the sets . (Open ball, closed ball and sphere in a metric space)
Under countable choice, Lebesgue measure scales by under dilation by and is translation invariant. Since , this gives . (The Axiom of Countable Choice (), For a nonzero real , dilation by multiplies Lebesgue outer measure by , and reflection in the origin preserves it, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation)
Ordinary recursion defines a unique sequence from a fixed successor rule; stage-dependent rules are obtained by carrying the stage as part of the state. (The recursion theorem)
Proof
If the finite family is empty, use the empty subfamily. Otherwise retain a ball of maximal radius, breaking ties by least index. Repeat among the remaining balls disjoint from every retained ball, and stop when none remain. There are at most selections. The retained balls are pairwise disjoint by construction, and the tie rule makes every selection determined.
For the countable family, fix a positive upper bound for its radii. Let for ; these partition the positive radii. Given the retained indices in earlier classes, inspect and retain exactly when and its ball is disjoint from every earlier retained ball. Inner recursion on and outer recursion on define this rule by [L3], taking the union of each inner sequence before the next class. Every decision is determined, so there is no countable choice of balls. The retained subfamily is pairwise disjoint.
In the finite family, a chosen ball lies in its own fivefold dilate. For an unchosen , take the first chosen ball meeting it. At that stage was eligible, so . For and , the centre distance satisfies . Hence . Thus every original ball lies in a chosen fivefold dilate.
Let be any original ball that was not chosen in the countable construction, and let . When the algorithm inspected , some previously chosen ball already met ; otherwise would have been retained. If with , then If instead , then both balls lie in the same dyadic class, so In either case, Choose and . Then so again . Let be the set of retained indices. This set is finite or countably infinite, and chosen balls are also contained in their own fivefold dilates; hence
For the measure consequence, assume countable choice as required by [L2]. Finite subadditivity and the established inclusion give . This is the only use of countable choice in this proof.
Steps 3.1 and 2.2 prove the finite and countable forms.
Depends on
- Open ball, closed ball and sphere in a metric space
- For a nonzero real $c$, dilation by $c$ multiplies Lebesgue outer measure by $|c|^n$, and reflection in the origin preserves it
- Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The recursion theorem
Used by
Dependency tree · two levels
38 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
- Terence Tao, An Introduction to Measure Theory, Lemma 1.6.22 (standard reference, not scraped)
- Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, 2nd ed., Lemma 3.15 (standard reference, not scraped)