Vitali covering theorem

Layer 0 — Mathematicsin the measure-theory subtree

Every Vitali cover of E ⊆ ℝⁿ (a family of closed balls containing arbitrarily small balls around each x ∈ E) has a countable disjoint subcollection whose union covers E up to a null set. Proof by the 3r-greedy selection argument.

Related concepts

Explore Vitali covering theorem on the interactive knowledge graph →