CesaroEngine #
Ported from scottnarmstrong/Superdiffusion at 7f20476385d4af418f110303085ad0740c9eba46. Module imports, support namespace and local option directives adapted for Lean Pool.
The independent-family Cesàro concentration engine #
ABK26, proof of l.minimal.scale.sep.
Each of the paper's three Steps ends, after a deterministic rearrangement, with a
Cesàro average over the window [n, m] of the shape
(m − n + 1)⁻¹ ( a · Σ_{k = n}^{m} X_k(ω) + T(ω) ),
where {X_k} is an independent family with X_k ≤ O_{Γ₂}(K) and E[X_k] ≤ μ₀,
and T is a boundary/tail term with T ≤ O_{Γ₂}(b). The Step's conclusion is
≤ a·μ₀ + O_{Γ₂}( C (a K + b) (m − n + 1)^{-1/2} ).
This module proves that implication for genuinely independent families. Its
r-dependent counterpart — the form Step 1 actually needs, where independence is
weakened to finite-range dependence — is
Algsuperdiff/Probability/ColoredCesaro.lean; the two are deliberately parallel,
and this one is the cheaper route whenever full independence is available.
The route is the paper's own:
integral_le_of_isBigO_gammaSigma—e.moments.OGamma2: aΓ_σtail gives integrability and the first-moment bound∫ X ≤ C_mom(σ) K(the modulus version and the integrability are inCesaroWindow.lean).centered_isBigO_gammaSigma_moment(CesaroWindow.lean) — centeringX ↦ X − E Xcosts only a constant factor in theΓ_σscale.isBigO_cesaroAvg_of_iIndepFun_centered— CoarseGraining's averagedp.concentrationtransported to thecesaroAvg/Finset.Icc n mbookkeeping, with the√N / N = N^{-1/2}rewrite done once and for all.cesaroAvg_isBigO_of_iIndepFun— the headline engine.cesaroAvg_isBigO_of_iIndepFun_with_tail— the engine with the boundary term, absorbed by(m − n + 1)⁻¹ ≤ (m − n + 1)^{-1/2}.
Everything is generic over the sample space: no carrier, no coefficient field and no scale geometry enters.
Main results #
Algsuperdiff.Probability.cesaroEngineConstAlgsuperdiff.Probability.isBigO_cesaroAvg_of_iIndepFun_centeredAlgsuperdiff.Probability.cesaroAvg_isBigO_of_iIndepFunAlgsuperdiff.Probability.cesaroAvg_isBigO_of_iIndepFun_with_tail
References #
- ABK26, Proposition
p.concentration. - ABK26,
e.moments.OGamma2.
Explicit constants #
The Cesàro engine constant: CoarseGraining's centered independent-sum constant
for σ = 2 times the centering cost.
Equations
Instances For
The Cesàro engine constant in the presence of an additive boundary/tail term.
Equations
Instances For
rpow bookkeeping #
(x + 1)^{-1/2} ≤ x^{-1/2} for x > 0 — the little monotonicity fact that
converts the engine's natural (m − n + 1)^{-1/2} envelope into the paper's
(m − n)^{-1/2} envelope.
Moments from Γ_σ tails (e.moments.OGamma2) #
The averaged concentration bound for a centered family #
Averaged p.concentration in cesaroAvg form. For a centered,
independent, Γ₂-controlled family {Y_j}, the Cesàro average over [n, m]
obeys O_{Γ₂}( C · K · (m − n + 1)^{-1/2} ).
The engine #
The Cesàro concentration engine. For an independent family {X_j} with
X_j ≤ O_{Γ₂}(K) and E X_j ≤ μ₀, the Cesàro average over a window [n, m] splits as
μ₀ plus a fluctuation of scale cesaroEngineConst · K · (m − n + 1)^{-1/2}.
This is the shared probabilistic core of Steps 1--3 in the proof of ABK26
l.minimal.scale.sep, in the fully independent regime.
The Cesàro engine with an additive boundary/tail term. This is the exact
shape produced by each of the paper's Steps 1--3 after the deterministic
rearrangement: D ≤ a · avsum X + (m − n + 1)⁻¹ · T with T ≤ O_{Γ₂}(b) gives
D ≤ a μ₀ + O_{Γ₂}( C (aK + b)(m − n + 1)^{-1/2} ).