Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A linear reconstruction operator from pointwise existence

Proved
Hairer.reconstruction_operator_of_pointwise

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

analysislinear-algebraregularity-structures

Fix a model map Πx\Pi_xΠx​, a reexpansion map Γxy\Gamma_{xy}Γxy​, a scaling sss, a test order rrr, and real orders α,γ\alpha,\gammaα,γ. Suppose every modelled distribution f∈Dγf\in\mathcal D^\gammaf∈Dγ admits some distribution ξ∈Csα\xi\in\mathcal C_s^\alphaξ∈Csα​ with the local reconstruction estimate

∣⟨ξ−Πxf(x),Ss,xδη⟩∣≤CKδγ.\left|\langle\xi-\Pi_x f(x),S^\delta_{s,x}\eta\rangle\right|\le C_K\delta^\gamma.​⟨ξ−Πx​f(x),Ss,xδ​η⟩​≤CK​δγ.

The bound is uniform for xxx in a compact set KKK, scales 0<δ≤10<\delta\le10<δ≤1, and normalized smooth test functions of order rrr.

Then these reconstructions can be chosen by a single map RRR whose restriction to Dγ\mathcal D^\gammaDγ is linear, with Rf∈CsαRf\in\mathcal C_s^\alphaRf∈Csα​ and the same type of local reconstruction estimate for every fff. No uniqueness or positivity of γ\gammaγ is assumed. This reduces the algebraic choice-of-operator step to pointwise existence, including in the nonpositive-order regime; it does not establish that pointwise existence hypothesis.

Preamble
import Definitions.Def_Hairer_Model

set_option autoImplicit false

noncomputable section
Formal statement
namespace Hairer

theorem reconstruction_operator_of_pointwise
    {d : ℕ} {s : Fin d → ℕ} {α γ : ℝ}
    {A : Set ℝ} {E : A → Type} [∀ a : A, NormedAddCommGroup (E a)]
    [∀ a : A, NormedSpace ℝ (E a)]
    {r : ℕ} {Pi : Pt d → ModelSpace A E →ₗ[ℝ] Distrib d}
    {Gam : Pt d → Pt d → ModelSpace A E ≃ₗ[ℝ] ModelSpace A E}
    (hex : ∀ f : Pt d → ModelSpace A E, IsModelled s γ Gam f →
      ∃ ξ : Distrib d, MemCalpha s α ξ ∧
        ∀ K : Set (Pt d), IsCompact K → ∃ C : ℝ, ∀ x ∈ K,
          ∀ δ : ℝ, 0 < δ → δ ≤ 1 → ∀ η : Pt d → ℝ, IsTestBall s r η →
            |(ξ - Pi x (f x)).eval (scaledTest s δ x η)| ≤ C * δ ^ γ) :
    ∃ R : (Pt d → ModelSpace A E) → Distrib d,
      (∀ f g : Pt d → ModelSpace A E, IsModelled s γ Gam f → IsModelled s γ Gam g →
        R (f + g) = R f + R g) ∧
      (∀ (c : ℝ) (f : Pt d → ModelSpace A E), IsModelled s γ Gam f →
        R (c • f) = c • R f) ∧
      (∀ f : Pt d → ModelSpace A E, IsModelled s γ Gam f →
        MemCalpha s α (R f) ∧
        ∀ K : Set (Pt d), IsCompact K → ∃ C : ℝ, ∀ x ∈ K,
          ∀ δ : ℝ, 0 < δ → δ ≤ 1 → ∀ η : Pt d → ℝ, IsTestBall s r η →
            |(R f - Pi x (f x)).eval (scaledTest s δ x η)| ≤ C * δ ^ γ) := by sorry

end Hairer
Source
Algebraic reduction of the existence-of-operator step in M. Hairer, A theory of regularity structures (2014), Theorem 3.10. Auxiliary result, not a restatement of the full reconstruction theorem.

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