Documentation

LeanPool.HighContrastHomogenization.Support.Besov.Localization

Coarse-graining support: Support.Besov.Localization #

Imported from the Apache-2.0 CoarseGraining development at commit c7ddd76c08ade64fed1b8d2ca51be14dfee8deb4.

Localization lemmas for the finite-depth cube Besov package.

This first checkpoint records that the local positive-order quantities attached to a parent cube Q only depend on the function on cubeSet Q. These congruence lemmas are the clean API needed before later descendant-localized and cutoff-localized estimates are added.

theorem HCPolySupport.cubeAverage_congr_on_cubeSet {d : ℕ} {Q : TriadicCube d} {u v : Vec d → ℝ} (h : ∀ x ∈ cubeSet Q, u x = v x) :
theorem HCPolySupport.cubeLpNorm_congr_on_cubeSet {d : ℕ} (Q : TriadicCube d) (p : ENNReal) {u v : Vec d → ℝ} (h : ∀ x ∈ cubeSet Q, u x = v x) :
cubeLpNorm Q p u = cubeLpNorm Q p v
theorem HCPolySupport.cubeProjection_congr_on_cubeSet {d : ℕ} (Q : TriadicCube d) (j : ℕ) {u v : Vec d → ℝ} (h : ∀ x ∈ cubeSet Q, u x = v x) :
theorem HCPolySupport.cubeBesovPartialSeminorm_congr_on_cubeSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (N : ℕ) {u v : Vec d → ℝ} (h : ∀ x ∈ cubeSet Q, u x = v x) :
theorem HCPolySupport.cubeBesovPartialNorm_congr_on_cubeSet {d : ℕ} (Q : TriadicCube d) (s : ℝ) (p q : ENNReal) (N : ℕ) {u v : Vec d → ℝ} (h : ∀ x ∈ cubeSet Q, u x = v x) :