Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section4.Provider.Homogenization.HomMollifyLipschitz

HomMollifyLipschitz #

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

Theorem B, §4.5, Step 3c: the scale-n Lipschitz estimate (L) #

What this module proves #

The regularization family of this file is

  W_n:= (w ⋆ ψ)_{· + □_n}    (mollify by `ψ`, then slide the scale-`n` box)

(boxRegularization). Its gradient is computed twice — once for each convolution factor — and each computation is one of the swaps of HomMollifySwap:

Feeding the averaging swap (S1) and the kernel pairing into the second display gives the gradient bound

  ‖∇W_n(x)‖ ≤ d · A · 3^{-ns}

(norm_fderiv_boxRegularization_le), and the mean value inequality on the convex set Vec d turns it into the obligation

  (L)   |W_n(x) - W_n(y)| ≤ (d · A) · 3^{-ns} · ‖x - y‖.

Where the dimensional constant comes from #

The pairing itself costs nothing (HomMollifyPairing, constant 1). The factor d is the only dimensional loss in the whole chain, and it is the sup-norm duality: on Vec d = Fin d → ℝ with the supremum norm, a linear functional v ↦ Σ_i g_i v_i has operator norm Σ_i |g_i| ≤ d · max_i |g_i|, and the gauge controls the maximum. So C(d) = d exactly, and the constant 8 composes to 8 d A.

References #

1. The mollifier profile #

A mollifier density: a smooth, compactly supported probability density on Vec d. Convolving with it is the smoothing step of the regularization.

Instances For

    2. The regularization family #

    The scale-n regularization of w: mollify by ψ, then take the sliding scale-n box average.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      3. The gradient of the mollification #

      4. The gradient of the regularization #

      Every vector is the sum of its coordinates times the basis vectors.

      theorem Algsuperdiff.Section4.Provider.Homogenization.boxAverage_finset_sum {d : ℕ} {n : ℤ} {x : HCPolySupport.Vec d} (c : Fin d → ℝ) (h : Fin d → HCPolySupport.Vec d → ℝ) (hint : ∀ (i : Fin d), MeasureTheory.IntegrableOn (h i) (boxSet n x) MeasureTheory.volume) :
      (boxAverage n x fun (a : HCPolySupport.Vec d) => ∑ i : Fin d, c i * h i a) = ∑ i : Fin d, c i * boxAverage n x (h i)

      The box average is linear over a finite combination of integrable functions.

      The gradient of the regularization. For every direction v,

        ∇W_n(x) v = Σ_i v_i · ((∇w)_i ⋆ ψ)_{x+□_n}.
      

      5. The gradient bound and (L) #

      The gradient bound. Under the translate-uniform gauge of order -s on ∇w, the scale-n regularization has gradient bounded by d · A · 3^{-ns} everywhere.

      The dimensional factor d is the sup-norm duality on Vec d and is the only dimensional loss in the chain; the pairing itself costs nothing.

      (L), the Lipschitz obligation.

      The scale-n regularization of w is Lipschitz with constant d · A · 3^{-ns}, exactly the shape HomLiftTelescope.holderSeminormBoundOn_of_increments consumes.