Reconstruction existence for gamma > 0 with the C^alpha_s bound stated at the model's test order (B^r version)
OpenHairer.reconstruction_existence_pointwise_pos_brversionExistence half of Hairer's Theorem 3.10 for a positive exponent (B^r-version), stated for one modelled distribution.
Let T=(A,T,G) be a regularity structure, let (Pi,Gamma) be a model for it on R^d with scaling s and test order r, let alpha=min A < 0, and let gamma > 0. Then for every modelled distribution f in D^gamma there exists a distribution xi such that
|<xi, S^delta_{s,x} eta>| <= C delta^alpha, |<(xi-Pi_x f(x)), S^delta_{s,x} eta>| <= C delta^gamma,
the bounds holding, for every compact set K with constants C=C(K,f), uniformly over x in K, delta in (0,1] and all test functions eta in B^r_{s,0} (the model's own test class). The first bound is the C^alpha_s regularity claim stated at the model's test order r: this corrected variant replaces the test class B^{negReg alpha}{s,0} of the original node, which the model hypotheses cannot control (from the hypotheses r >= negReg alpha is provable, so the model only bounds B^r{s,0}).
import Definitions.Def_Hairer_Model set_option autoImplicit false open scoped Classical DirectSum noncomputable section
namespace Hairer
/-- **Theorem 3.10, Hairer 2014 (B^r-version), case `γ > 0`.**
Corrected variant of `Hairer.reconstruction_existence_pointwise_pos`
(`115a07e0-08bf-41e4-9b74-343e158943b8`): the regularity claim is stated
with the model's test order `r` in the test class, i.e. the `C^α_s` bound
holds over `η ∈ B^r_{s,0}` rather than over `η ∈ B^{negReg α}_{s,0}`.
The original is unprovable as stated: from the hypotheses one can prove
`r ≥ negReg α`, so the model hypotheses control `B^r_{s,0} ⊆ B^{negReg α}_{s,0}`,
strictly fewer test functions than the original conclusion requires, and the
reverse inclusion is false in general. With the test class at the model's own
order `r`, the statement is provable by the paper's §3.1 construction. -/
theorem reconstruction_existence_pointwise_pos_brversion
{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) :
∃ ξ : Distrib d,
(∀ K : Set (Pt d), IsCompact K → ∃ C : ℝ, ∀ x ∈ K, ∀ δ : ℝ, 0 < δ → δ ≤ 1 →
∀ η : Pt d → ℝ, IsTestBall s r η →
|ξ.eval (scaledTest s δ x η)| ≤ C * δ ^ α) ∧
∀ 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 * δ ^ γ := by
sorry
end Hairer