Vitali covering lemma
DeGiorgi.vitali_covering_lemma
Project documentation
Vitali covering lemma (5r-covering): from any family of balls, one can extract a disjoint subfamily such that the 5× enlargements cover the union, and every original ball meets a selected ball of at least half its radius.
Exact Lean statement
theorem vitali_covering_lemma
{ι : Type*} {x : ι → E} {r : ι → ℝ}
(hr_pos : ∀ i, 0 < r i)
(hr_bdd : BddAbove (Set.range r))
(hfin : (⋃ i, Metric.ball (x i) (r i)).Nonempty) :
∃ S : Set ι, S.Countable ∧
(∀ i ∈ S, ∀ j ∈ S, i ≠ j →
Disjoint (Metric.ball (x i) (r i)) (Metric.ball (x j) (r j))) ∧
(∀ i, ∃ j ∈ S,
(Metric.ball (x i) (r i) ∩ Metric.ball (x j) (r j)).Nonempty ∧ r i ≤ 2 * r j) ∧
(⋃ i, Metric.ball (x i) (r i)) ⊆ ⋃ i ∈ S, Metric.ball (x i) (5 * r i)Formal artifact
Lean source
theorem vitali_covering_lemma {ι : Type*} {x : ι → E} {r : ι → ℝ} (hr_pos : ∀ i, 0 < r i) (hr_bdd : BddAbove (Set.range r)) (hfin : (⋃ i, Metric.ball (x i) (r i)).Nonempty) : ∃ S : Set ι, S.Countable ∧ (∀ i ∈ S, ∀ j ∈ S, i ≠ j → Disjoint (Metric.ball (x i) (r i)) (Metric.ball (x j) (r j))) ∧ (∀ i, ∃ j ∈ S, (Metric.ball (x i) (r i) ∩ Metric.ball (x j) (r j)).Nonempty ∧ r i ≤ 2 * r j) ∧ (⋃ i, Metric.ball (x i) (r i)) ⊆ ⋃ i ∈ S, Metric.ball (x i) (5 * r i) := by classical let _ := hfin let t : Set ι := Set.univ obtain ⟨R, hR⟩ := hr_bdd rcases Vitali.exists_disjoint_subfamily_covering_enlargement (fun i => Metric.ball (x i) (r i)) t r 2 (by norm_num) (fun i _ => (hr_pos i).le) R (by intro i hi exact hR (Set.mem_range_self i)) (fun i _ => nonempty_ball.2 (hr_pos i)) with ⟨S, _, hS_disj, hS_hit⟩ have hS_ball_disj : S.PairwiseDisjoint (fun i => Metric.ball (x i) (r i)) := by exact hS_disj have hS_count : S.Countable := by exact hS_ball_disj.countable_of_isOpen (fun i _ => isOpen_ball) (fun i _ => nonempty_ball.2 (hr_pos i)) refine ⟨S, hS_count, ?_, ?_, ?_⟩ · intro i hi j hj hij exact hS_ball_disj hi hj hij · intro i rcases hS_hit i (by simp [t]) with ⟨j, hjS, hij, hrad⟩ exact ⟨j, hjS, hij, hrad⟩ · intro y hy rcases Set.mem_iUnion.1 hy with ⟨i, hyi⟩ rcases hS_hit i (by simp [t]) with ⟨j, hjS, hij, hrad⟩ refine Set.mem_iUnion.2 ⟨j, Set.mem_iUnion.2 ⟨hjS, ?_⟩⟩ rcases hij with ⟨z, hzi, hzj⟩ have hyj : dist y (x j) < 5 * r j := by calc dist y (x j) ≤ dist y (x i) + dist (x i) z + dist z (x j) := dist_triangle4 y (x i) z (x j) _ < r i + r i + r j := by have h1 : dist y (x i) < r i := by simpa [Metric.mem_ball] using hyi have h2 : dist (x i) z < r i := by rw [dist_comm]; simpa [Metric.mem_ball] using hzi have h3 : dist z (x j) < r j := by simpa [Metric.mem_ball] using hzj linarith _ ≤ 5 * r j := by linarith exact hyj- Project
- DeGiorgi
- License
- Apache-2.0
- Commit
- 4c1b3077d378
- Source
- DeGiorgi/Oscillation/BMO.lean:437-487
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Ae eq of tendsto e Lp Norm sub
BareFunction.ae_eq_of_tendsto_eLpNorm_sub
Plain-language statement
Lp limit uniqueness: if f_n → g₁ and f_n → g₂ in eLpNorm, then g₁ =ᵐ g₂.
Source project: DeGiorgi
Person-level attribution pending.
E Lp Norm pi le sum component
BareFunction.eLpNorm_pi_le_sum_component
Plain-language statement
Vector eLpNorm ≤ sum of component eLpNorms for Pi-valued functions. Uses eLpNorm_mono_real for the pointwise bound together with eLpNorm_sum_le for ℝ-valued functions, avoiding Pi instance synthesis.
Source project: DeGiorgi
Person-level attribution pending.
Mem Lp of tendsto e Lp Norm
BareFunction.memLp_of_tendsto_eLpNorm
Plain-language statement
If f n → g in eLpNorm and each f n ∈ Lp, then g ∈ Lp, provided g is AEStronglyMeasurable. Avoids the Lp type entirely. The key observation: eLpNorm (f n - g) → 0 means eLpNorm (f N - g) < 1 for some N. Then eLpNorm g ≤ eLpNorm (f N - g) + eLpNorm (f N) < ∞.
Source project: DeGiorgi
Person-level attribution pending.