Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section4.Provider.ExcessDecay.OffGridStabilitySubadditivity

OffGridStabilitySubadditivity #

Ported from scottnarmstrong/Superdiffusion at 7f20476385d4af418f110303085ad0740c9eba46. Module imports, support namespace and local option directives adapted for Lean Pool.

Countable subadditivity of the response functional #

Then, by subadditivity and (e.bound.one.cube.by.lambdas), |σ_*^{-1}(U;a)| ≤ ∑_{n=-∞}^0 ∑_{z ∈ 𝒢_n(U)} (|□_n| / |U|) |σ_*^{-1}(z+□_n;a)|

for an arbitrary domain U ⊆ □_0 and the greedy family 𝒢_n(U). That is a countably infinite subadditivity over a family of cubes of unboundedly many scales inside an arbitrary domain.

CoarseGraining's subadditivity surface stops strictly short of it. Its public form (Ch02.ResponseSubadditivityAndScalingTheory.responseJ_subadditive) is indexed by a Ch02.DomainPartition, whose triadic_realization field forces

Neither the countability nor the multi-scale family nor the off-grid parent can be expressed there. This module proves the missing inequality directly on CoarseGraining's set-level Homogenization.ResponseJ, for an arbitrary countable a.e. partition of an arbitrary open set, and then specialises it to the maximal-cube family of OffGridStabilityGeometry.lean.

The ingredients used, all public in CoarseGraining #

The one genuinely new step is that the exact finite partition identity CoarseGraining uses (volumeAverage over descendantsAverage) is replaced by the countable hasSum_integral_iUnion, which needs only pairwise disjointness, measurability and an a.e. cover.

Main results #

References #

1. Countable subadditivity of ResponseJ #

theorem Algsuperdiff.Section4.Provider.ExcessDecay.responseJ_le_tsum_of_countable_cover {d : ℕ} {ι : Type} [Countable ι] {V : Set (HCPolySupport.Vec d)} {a : HCPolySupport.CoeffField d} {lam Lam : ℝ} {p q : HCPolySupport.Vec d} (hVopen : IsOpen V) (hVtop : MeasureTheory.volume V < ⊤) (hVpos : (MeasureTheory.volume V).toReal ≠ 0) (hEll : HCPolySupport.IsEllipticFieldOn lam Lam V a) (cell : ι → Set (HCPolySupport.Vec d)) (hopen : ∀ (i : ι), IsOpen (cell i)) (hmeas : ∀ (i : ι), MeasurableSet (cell i)) (hsub : ∀ (i : ι), cell i ⊆ V) (hdisj : Pairwise (Function.onFun Disjoint cell)) (hcelltop : ∀ (i : ι), MeasureTheory.volume (cell i) < ⊤) (hcellpos : ∀ (i : ι), (MeasureTheory.volume (cell i)).toReal ≠ 0) (hcover : MeasureTheory.volume (V \ ⋃ (i : ι), cell i) = 0) (B : ι → ℝ) (hB : ∀ (i : ι), HCPolySupport.ResponseJ (cell i) p q a ≤ B i) (hsummable : Summable fun (i : ι) => (MeasureTheory.volume (cell i)).toReal * B i) :

Countable subadditivity of the response functional.

If the open set V is covered, up to a null set, by countably many pairwise disjoint open subsets cell i, then the response of V is at most the |cell i| / |V|-weighted sum of any majorant of the responses of the cells.

This is the countable, multi-scale, off-grid replacement for CoarseGraining's DomainPartition-indexed subadditivity, whose triadic_realization field forces a finite equal-depth partition of a grid cube.

2. The off-grid specialisation #

The open realizations of the maximal cubes cover the off-grid cube up to a null set: the discarded set is the countable union of the cubes' boundaries.

The printed display, formalized.

For an arbitrary real translate w + □_k of a triadic cube, the response of the off-grid cube is at most the |Q| / |w + □_k|-weighted sum of any majorant of the responses of its maximal grid subcubes. This is |σ_*^{-1}(U)| ≤ ∑_n ∑_{z ∈ 𝒢_n(U)} (|□_n|/|U|) |σ_*^{-1}(z+□_n)| at the level of the response functional itself.

B and its two obligations are conditional A, per the disclosure in the module docstring.