Uniform normalized test representation of grid overlaps
ProvedHairer.grid_overlap_decomposition_scaledTestanalysisregularity-structures
Let be a tuple of nonnegative integer weights, , and a derivative order. Write , where and is the smooth transition from zero to one. Fix a smooth compactly supported test function .
There is a constant such that, for every , every tuple of coarse widths , and every pair of integer grid indices , there is a normalized test satisfying
The constant is independent of the scales and grid indices. This gives the normalized test representation needed to estimate individual overlaps when comparing local reconstruction approximations. It does not assert summability of their total contribution or existence of a reconstruction.
Preamble
import Definitions.Def_Hairer_TestFunctions set_option autoImplicit false noncomputable section
Formal statement
namespace Hairer
theorem grid_overlap_decomposition_scaledTest {d : ℕ} (s : Fin d → ℕ) (r : ℕ)
{φ : Pt d → ℝ} (hφ : φ ∈ testFunctions d) :
let W : Pt d → ℝ := fun z ↦ ∏ i,
(Real.smoothTransition (z i + 1) - Real.smoothTransition (z i))
∃ C : ℝ, 0 < C ∧ ∀ (δ : ℝ), 0 < δ → δ ≤ 1 →
∀ (c : Fin d → ℝ), (∀ i, δ ^ s i ≤ c i) →
∀ (j k : Fin d → ℤ), ∃ η : Pt d → ℝ, IsTestBall s r η ∧
∀ y : Pt d,
W (fun i ↦ y i / δ ^ s i - (j i : ℝ)) *
W (fun i ↦ y i / c i - (k i : ℝ)) * φ y =
(C * δ ^ (scaleDim s : ℝ)) *
scaledTest s δ (fun i ↦ δ ^ s i * (j i : ℝ)) η y := by sorry
end Hairer
Source
Auxiliary lemma for the smooth partition approach to Hairer reconstruction. Uses the tensor-product smooth bump from the accepted test-function decomposition.