Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Cauchy estimate for dyadic grid reconstruction approximants (γ>0\gamma>0γ>0)

Open
Hairer.dyadic_grid_approx_cauchy

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

hairerreconstructionregularity-structures

Cauchy estimate for the dyadic smooth-grid reconstruction approximants, in the case γ>0\gamma>0γ>0.

Let (Π,Γ)(\Pi,\Gamma)(Π,Γ) be a model for a regularity structure with α=min⁡A<0\alpha=\min A<0α=minA<0, and let f∈Dγf\in\mathcal D^\gammaf∈Dγ with γ>0\gamma>0γ>0. Write RδR_\deltaRδ​ for the smooth-partition approximate reconstruction that pairs each grid germ Πxjf(xj)\Pi_{x_j}f(x_j)Πxj​​f(xj​) against the tensor-product bump weight at anisotropic scale δ\deltaδ (the approximant appearing in the Proved lemma on uniform grid/model comparison).

Then on every compact KKK there is a constant CCC such that for all integers n≤mn\le mn≤m, all x∈Kx\in Kx∈K, and all test functions η∈Bs,0r\eta\in\mathcal B^r_{s,0}η∈Bs,0r​,

∣(R2−n−R2−m)(Ss,x2−mη)∣≤C 2−nγ.\bigl|(R_{2^{-n}}-R_{2^{-m}})(S^{2^{-m}}_{s,x}\eta)\bigr| \le C\,2^{-n\gamma}.​(R2−n​−R2−m​)(Ss,x2−m​η)​≤C2−nγ.

This is the Cauchy input needed to obtain the limiting reconstruction distribution in Hairer's Theorem 3.10 (existence half for γ>0\gamma>0γ>0).

Preamble
import Definitions.Def_Hairer_Model
import Definitions.Def_Hairer_GridWeight
set_option autoImplicit false
open scoped Classical DirectSum BigOperators
noncomputable section
Formal statement
namespace Hairer

/-- Approximate reconstruction pairing at scale `δ`. -/
def approxReconEval {d : ℕ} {A : Set ℝ} {E : A → Type}
    [∀ a : A, NormedAddCommGroup (E a)] [∀ a : A, NormedSpace ℝ (E a)]
    (s : Fin d → ℕ) (δ : ℝ)
    (Pi : Pt d → ModelSpace A E →ₗ[ℝ] Distrib d)
    (f : Pt d → ModelSpace A E) (φ : Pt d → ℝ) : ℝ :=
  ∑ᶠ j : Fin d → ℤ,
    (Pi (gridCentre s δ j) (f (gridCentre s δ j))).eval
      (fun y ↦ gridWeight (fun i ↦ y i / δ ^ s i - (j i : ℝ)) * φ y)

/-- Cauchy estimate for dyadic grid reconstruction approximants (`γ > 0`). -/
theorem dyadic_grid_approx_cauchy
    {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)
    {α : ℝ} (hα : IsLeast A α) (hαneg : α < 0)
    {γ : ℝ} (hγ : 0 < γ)
    {f : Pt d → ModelSpace A E} (hf : IsModelled s γ Gam f)
    (K : Set (Pt d)) (hK : IsCompact K) :
    ∃ C : ℝ, 0 ≤ C ∧ ∀ (n m : ℕ), n ≤ m → ∀ x ∈ K,
      ∀ η : Pt d → ℝ, IsTestBall s r η →
        |approxReconEval s (dyadicScale n) Pi f (scaledTest s (dyadicScale m) x η) -
          approxReconEval s (dyadicScale m) Pi f (scaledTest s (dyadicScale m) x η)| ≤
          C * (dyadicScale n) ^ γ := by
  sorry

end Hairer
Source
M. Hairer, A theory of regularity structures, Invent. Math. 198 (2014), arXiv:1303.5113 (v4), proof of Theorem 3.10 (existence, γ>0) via Prop. 3.25; smooth-grid form aligned with Prove2Me Hairer.uniform_grid_model_comparison

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me