Mini-Vitali covering theorem
Statement
Work with the covering relation and the premeasure . A family is a full cover of when for each there is with whenever and , and a fine cover of when for each and each some has . Write for the supremum of over packings, that is over finite or countable subfamilies of with pairwise nonoverlapping intervals.
Mini-Vitali covering theorem. For the following are equivalent, and each says that has Lebesgue measure zero:
- for every there is an open with ;
- for every there is a full cover of with ;
- for every there is a fine cover of with .
Remarks
Not proved in this library. It is recorded with citations and used in no proof here.
What would prove it. Two elementary covering lemmas about finite families of compact intervals, then a compactness argument; Bruckner, Bruckner and Thomson give it in Section 3.10 as the cheap precursor to the full theorem. It is genuinely easier than Vitali covering theorem ‡, because it is the same assertion restricted to null sets: the full theorem says for the measures generated by covers and by packings, and the mini version says only that the three vanish together.
Which page it serves. The same pages as the full theorem, and it is the piece that a first pass at a measure track should prove first: it already yields the Lebesgue differentiation theorem for monotone functions (Lebesgue's differentiation theorem for monotone functions ‡) by the growth lemma route, without the full covering theorem.
Why it is deferred at all, given that the elementary null sets are in scope. The statement is about Lebesgue measure zero, which this library does have in the elementary covering sense, but its content is the equivalence with the full and fine cover formulations, and those are the language of the measure track. Nothing on the topology of page or the Riemann integral page currently needs them, so there is no loss; a future measure page will state and prove this before anything else.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 1 result over 1 level. 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
- A. M. Bruckner, J. B. Bruckner and B. S. Thomson, Real Analysis, 2nd ed. (2008), Theorem 3.39 (Mini-Vitali Covering Theorem), Section 3.10 (standard reference, not scraped)
- B. S. Thomson, Vitali coverings and Lebesgue's differentiation theorem, Real Anal. Exchange 29 (2003/04) 957-973 (standard reference, not scraped)