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:
fderiv_convolution_apply_basisVec—∂_i(w ⋆ ψ) = (∇w)_i ⋆ ψ, the weak gradient swap(S2);fderiv_boxRegularization_apply—∇W_n(x) v = Σ_i v_i ((∇w)_i ⋆ ψ)_{x+□_n}, i.e. the gradient of the sliding average is the sliding average of the gradient, by the box-kernel identity ofHomMollifyPairing.
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 #
- ABK26, Theorem B Step 3.
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.
- compactSupport : HasCompactSupport ψ
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
The regularization is the convolution of the box kernel with the mollification.
3. The gradient of the mollification #
The mollification of a locally integrable function by a mollifier density is smooth.
The mollification of a compactly supported function has compact support.
∂_i (w ⋆ ψ) = (∇w)_i ⋆ ψ — the weak gradient swap in derivative
form.
4. The gradient of the regularization #
Every vector is the sum of its coordinates times the basis vectors.
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}.
The regularization is differentiable everywhere.
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.