Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniform adjacent-grid estimate on rescaled tests

Proved
Hairer.uniform_scaled_grid_increment_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). Using the tensor-product smooth-transition partition at scale δ\deltaδ, define

Rδφ=∑j⟨Fxjδ,ψjδφ⟩.R_\delta\varphi=\sum_j\langle F_{x_j^\delta},\psi_j^\delta\varphi\rangle.Rδ​φ=j∑​⟨Fxjδ​​,ψjδ​φ⟩.

For every compact set KKK, there exists C≥0C\ge0C≥0 such that

∣(Rδ−R2δ)(Ss,xρη)∣≤Cδγ\left|(R_\delta-R_{2\delta})(S^\rho_{s,x}\eta)\right|\le C\delta^\gamma​(Rδ​−R2δ​)(Ss,xρ​η)​≤Cδγ

for every x∈Kx\in Kx∈K, every normalized test η∈Bs,0r\eta\in B^r_{s,0}η∈Bs,0r​, and every pair of scales satisfying 0<δ≤ρ≤10<\delta\le\rho\le10<δ≤ρ≤1 and δ≤1/4\delta\le1/4δ≤1/4. The constant is independent of the test, its centre in KKK, and both scales. The estimate holds for every real γ\gammaγ.

For positive γ\gammaγ, this estimate controls the dyadic tail uniformly over rescaled tests. It strengthens convergence on each fixed test and supplies the fine-scale part of the local reconstruction argument.

Preamble
import Definitions.Def_Hairer_Model
open BigOperators Hairer
noncomputable section
Formal statement
theorem Hairer.uniform_scaled_grid_increment_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) :
    let W : Pt d → ℝ := fun z ↦
      ∏ i, (Real.smoothTransition (z i + 1) - Real.smoothTransition (z i))
    let X := fun (δ : ℝ) (j : Fin d → ℤ) (i : Fin d) ↦ δ ^ s i * (j i : ℝ)
    let R := fun (δ : ℝ) (φ : Pt d → ℝ) ↦ ∑ᶠ j : Fin d → ℤ,
      (Pi (X δ j) (f (X δ j))).eval
        (fun y ↦ W (fun i ↦ y i / δ ^ s i - (j i : ℝ)) * φ y)
    ∃ C : ℝ, 0 ≤ C ∧ ∀ x ∈ K, ∀ ρ : ℝ, 0 < ρ → ρ ≤ 1 →
      ∀ η : Pt d → ℝ, IsTestBall s r η →
      ∀ δ : ℝ, 0 < δ → δ ≤ ρ → δ ≤ 1 / 4 →
      |R δ (scaledTest s ρ x η) -
        R (2 * δ)
          (scaledTest s ρ x η)| ≤ C * δ ^ γ := by sorry
Source
Auxiliary estimate for the construction in M. Hairer, A theory of regularity structures (2014), Theorem 3.10. The explicit smooth-transition grid and its uniform adjacent-scale estimate 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