Mgf #
Ported from scottnarmstrong/Superdiffusion at 7f20476385d4af418f110303085ad0740c9eba46. Module imports, support namespace and local option directives adapted for Lean Pool.
Concentration for scale arrays — Step 3 (integer exponential moment) #
This module assembles the per-column exponential-moment bound (e.Zj.mgf.twosided)
E[e^{a Z_j}] ≤ 1 + C₃ (3/λ)^p 3^{-(sp/2) d_j}, a = ⅛ (log 3) sp = mgfRate s p,
from the Step-2 geometric tail (Zj_tail). Because Z_j ≤ m+1 is bounded,
the layer-cake sum is finite; the exponential moment is realized in ℝ≥0∞ as
∫⁻ (ofReal(e^a))^{Z_j}, the exact quantity that enters expZfun.
The proof: pointwise B^{Z} ≤ ∑_{n=0}^{N}(if n ≤ Z then B^n else 0) (single term
domination), integrate to 1 + ∑_{n=1}^{N} B^n P[Z ≥ n], insert the tail, and
sum the resulting geometric series (mgf_series_bound). The constant works out
to C₂(1 + (1-3^{-1/8})⁻¹) ≤ C₃, folding (2·3^{s/4})^p ≤ 3^p.
Step 3 exponential moment (e.Zj.mgf.twosided).
∫⁻ (ofReal(e^a))^{Z_j} ≤ ofReal(1 + C₃(3/λ)^p 3^{-(sp/2)d_j}).