Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform dyadic grid-overlap sum for model germs

Proved
Hairer.dyadic_grid_germ_sum_bound

by Robertboy18 · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisregularity-structures

Let fff be a modelled distribution of regularity γ\gammaγ for a regularity structure and model, and write Fx=Πxf(x)F_x=\Pi_xf(x)Fx​=Πx​f(x). Fix a compact set KKK and a smooth compactly supported test function φ\varphiφ. For the tensor-product smooth-transition grid weights ψjδ\psi_j^\deltaψjδ​ with centres xjδx_j^\deltaxjδ​, there exists C≥0C\ge0C≥0 such that

∑j∈S∑k∈T∣⟨Fxjδ−Fxk2δ,ψjδψk2δφ⟩∣≤Cδγ\sum_{j\in S}\sum_{k\in T} \left|\left\langle F_{x_j^\delta}-F_{x_k^{2\delta}}, \psi_j^\delta\psi_k^{2\delta}\varphi\right\rangle\right| \le C\delta^\gammaj∈S∑​k∈T∑​​⟨Fxjδ​​−Fxk2δ​​,ψjδ​ψk2δ​φ⟩​≤Cδγ

for every 0<δ≤1/40<\delta\le1/40<δ≤1/4 and every pair of finite index sets S,TS,TS,T whose selected centres lie in KKK. The constant is independent of the scale and index sets. The estimate holds for every real γ\gammaγ.

For positive regularity, this bound is summable along dyadic scales and supplies a quantitative ingredient for constructing the reconstruction operator. It is an auxiliary estimate, not a statement of the full reconstruction theorem.

Preamble
import Definitions.Def_Hairer_Model
open BigOperators Hairer
noncomputable section
Formal statement
theorem Hairer.dyadic_grid_germ_sum_bound
    {d : ℕ} {s : Fin d → ℕ} (hs : IsScaling s) {γ : ℝ}
    {A : Set ℝ} {E : A → Type} [∀ a : A, NormedAddCommGroup (E a)]
    [∀ a : A, NormedSpace ℝ (E a)]
    {G : Subgroup (ModelSpace A E ≃ₗ[ℝ] ModelSpace A E)} {one : ModelSpace A E}
    (hT : IsRegularityStructure A E G one)
    {r : ℕ} {Pi : Pt d → ModelSpace A E →ₗ[ℝ] Distrib d}
    {Gam : Pt d → Pt d → ModelSpace A E ≃ₗ[ℝ] ModelSpace A E}
    (hmod : IsModel s r G Pi Gam)
    {f : Pt d → ModelSpace A E} (hf : IsModelled s γ Gam f)
    (K : Set (Pt d)) (hK : IsCompact K) (φ : Pt d → ℝ) (hφ : φ ∈ testFunctions d) :
    let W : Pt d → ℝ := fun z ↦
      ∏ i, (Real.smoothTransition (z i + 1) - Real.smoothTransition (z i))
    let ψ := fun (δ : ℝ) (j : Fin d → ℤ) (y : Pt d) ↦
      W (fun i ↦ y i / δ ^ s i - (j i : ℝ))
    let X := fun (δ : ℝ) (j : Fin d → ℤ) (i : Fin d) ↦ δ ^ s i * (j i : ℝ)
    ∃ C : ℝ, 0 ≤ C ∧ ∀ δ : ℝ, 0 < δ → δ ≤ 1 / 4 →
      ∀ S T : Finset (Fin d → ℤ),
      (∀ j ∈ S, X δ j ∈ K) →
      (∀ k ∈ T, X (2 * δ) k ∈ K) →
      ∑ j ∈ S, ∑ k ∈ T,
        |(Pi (X δ j) (f (X δ j)) -
          Pi (X (2 * δ) k) (f (X (2 * δ) k))).eval
          (fun y ↦ ψ δ j y * ψ (2 * δ) k y * φ y)|
        ≤ C * δ ^ γ := by sorry
Source
Auxiliary grid estimate for the reconstruction argument in M. Hairer, A theory of regularity structures (2014), Theorem 3.10; the explicit smooth-transition partition and finite-sum formulation are part of this formalization.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me