Documentation

LeanPool.HighContrastHomogenization.Support.Deterministic.CoarsePoincare.Setup.UniformBounds

Coarse-graining support: Support.Deterministic.CoarsePoincare.Setup.UniformBounds #

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

theorem HCPolySupport.summable_exponentOne_maxDescendantBBlockNorm_of_cubeEllipticity {d : ℕ} [NeZero d] (Q : TriadicCube d) (a : CoeffField d) (s : ℝ) {lam Lam : ℝ} (hs : 0 < s) (hEll : IsEllipticFieldOn lam Lam (cubeSet Q) a) (hOrigin : OpenCubeOriginEllipticRecoveryExistence lam Lam) :
Summable fun (n : ℕ) => geometricWeight s 1 n * (maxDescendantBBlockNormAtScale Q (Q.scale - ↑n) a).rpow (1 / 2)
theorem HCPolySupport.cubeAverage_nonneg_of_nonneg_on {d : ℕ} {Q : TriadicCube d} {f : Vec d → ℝ} (hf : ∀ x ∈ cubeSet Q, 0 ≤ f x) :
theorem HCPolySupport.cubeAverage_eq_of_eq_on_cubeSet {d : ℕ} {Q : TriadicCube d} {f g : Vec d → ℝ} (hfg : ∀ x ∈ cubeSet Q, f x = g x) :
theorem HCPolySupport.cubeAverageVec_eq_of_eq_on_cubeSet {d : ℕ} {Q : TriadicCube d} {f g : Vec d → Vec d} (hfg : ∀ x ∈ cubeSet Q, f x = g x) :