Uniform decomposition of a test function into rescaled test functions
ProvedHairer.testFunction_decomposition_scaledTestA uniform anisotropic partition of unity at scale .
Fix a scaling with , an order , and a test function . Then there are a compact set and a constant , depending only on , and , with the following property. For every there exist finitely many points , reals and functions such that
Here is Hairer's class of test functions supported in the unit ball of the scaled quasi-norm whose derivatives up to order are bounded by , and .
The decomposition is obtained from a smooth partition of unity subordinate to the anisotropic boxes centred at the points of the lattice that meet the support of . There are such boxes, while each piece , rescaled to the unit box, has norm because every derivative taken in the rescaled variable carries a factor ; hence each coefficient is and the total mass stays bounded as .
The statement is the exact quantitative input needed for the uniqueness clause of Hairer's Theorem 3.10: a distribution that is with on all rescaled test functions , uniformly over compact sets, annihilates every test function. Because a distribution here is a plain linear functional on , with no continuity assumed, the decomposition must be an exact finite linear combination rather than an approximation.
import Definitions.Def_Hairer_TestFunctions set_option autoImplicit false open scoped Classical noncomputable section
namespace Hairer
/-- **Anisotropic partition of unity at scale `δ`.**
Every smooth compactly supported test function `φ` on `ℝ^d` can be written, at every
scale `δ ∈ (0,1]`, as a *finite* linear combination
`φ = ∑ᵢ cᵢ · S^δ_{s,xᵢ} ηᵢ`
of rescaled test functions `ηᵢ ∈ B^r_{s,0}` centred at points `xᵢ` of one fixed compact
set, with `∑ᵢ |cᵢ| ≤ M` for a constant `M` depending only on `φ`, `s` and `r`, but not
on `δ`.
The number of terms grows like `δ^{-|s|}` while each coefficient is of size `δ^{|s|}`,
which is exactly what makes the total mass `∑ᵢ|cᵢ|` bounded uniformly in `δ`. -/
theorem testFunction_decomposition_scaledTest
{d : ℕ} {s : Fin d → ℕ} (hs : IsScaling s) (r : ℕ)
{φ : Pt d → ℝ} (hφ : φ ∈ testFunctions d) :
∃ (K : Set (Pt d)) (M : ℝ), IsCompact K ∧
∀ δ : ℝ, 0 < δ → δ ≤ 1 →
∃ (n : ℕ) (x : Fin n → Pt d) (c : Fin n → ℝ) (η : Fin n → (Pt d → ℝ)),
(∀ i, x i ∈ K) ∧ (∀ i, IsTestBall s r (η i)) ∧
(∑ i, |c i|) ≤ M ∧
∀ y : Pt d, φ y = ∑ i, c i * scaledTest s δ (x i) (η i) y := by
sorry
end Hairer