Uniform normalized test representation of grid overlaps
OpenHairer.grid_overlap_decompositionLet 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.
Retired: this entry placed local definitions in its preamble, which the platform does not support. The mathematically equivalent replacement is Hairer.grid_overlap_decomposition_scaledTest.
import Definitions.Def_Hairer_TestFunctions
set_option autoImplicit false
noncomputable section
namespace HairerAux
open Hairer
def chi (t : ℝ) : ℝ := Real.smoothTransition (t + 1) - Real.smoothTransition t
def bumpBox {d : ℕ} (z : Pt d) : ℝ := ∏ i, chi (z i)
end HairerAux
open HairerAux
namespace Hairer
theorem grid_overlap_decomposition {d : ℕ} (s : Fin d → ℕ) (r : ℕ)
{φ : Pt d → ℝ} (hφ : φ ∈ testFunctions d) :
∃ 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,
bumpBox (fun i ↦ y i / δ ^ s i - (j i : ℝ)) *
bumpBox (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