DiscreteCompounding #
Ported from scottnarmstrong/Superdiffusion at 7f20476385d4af418f110303085ad0740c9eba46. Module imports, support namespace and local option directives adapted for Lean Pool.
Discrete compounding arithmetic for the Section 2.4 sensitivity estimates #
The manuscript's Section 2.4 sensitivity proofs are written as differential
inequalities in the segment parameter t for a + t h. The aggregate
coarse-grained quantities lambda_{s,q}^{-1} and Lambda_{s,q} are infinite
weighted aggregates of finite maxima of one-cube observables, so they are
not classically differentiable in t, and no such regularity may be
assumed. Every t-derivative step of the source is therefore replaced here
by a purely discrete compounding argument along the path a + (k/N) h, k = 0, …, N.
This module contains only the gauge-free real-analysis arithmetic behind that replacement:
riccati_step_le— the discrete replacement for integrating the Riccati inequalityy' ≤ K y²obtained at the self-referential gauge(s,q) = (3/8,2), giving the source'sy 0 / (1 - K * y 0)bound;mul_sqrt_mul_sqrt_le_young,absorb_sqrt_self_bound,self_bound_le_closed— the Young-inequality absorption turningM ≤ J + c √E √M + r M(withrsmall) into a closed bound, which is the arithmetic content of the display of ABK26.
Elementary exponential comparisons #
The discrete Riccati step #
At the self-referential gauge (s,q) = (3/8,2) the per-step ratio itself
involves the current value, so the compounding above is not directly available.
The source integrates the resulting Riccati inequality; the discrete analogue
below is exact and needs no differentiability.
Discrete integration of the Riccati inequality
y (k+1) ≤ (1 + (K/N) y k) y k. This is the discrete form of the source's
bound y 0 / (1 - K y 0).
Young absorption of a self-referential bound #
The closed form of the absorption step.
Under the smallness condition r ≤ 1/4 and for 0 < δ ≤ 1, a self-referential
bound M ≤ J + c √E √M + r M yields
M ≤ (1 + δ + 2 r) J + 2 δ⁻¹ c² E.