Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section4.Provider.Proportion.SmallWaves

SmallWaves #

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

Step 2 of l.ratio.of.good.scales.for.k: the small-waves lane #

This module realizes the 𝒢₁b half of l.ratio.of.good.scales.for.k: the genuinely two-index Appendix-D array X_{m,k}, its reduction of the second 𝒢₁ condition, and the resulting proportion tail e.small.waves.scale.counting.

The array really is two-index, and that is not a problem here #

The gap in e.Xmk.pedant.bound, paid explicitly #

The graph records that the lattice-max penalty ≍ C(d)(m-k)^{1/σ} grows with m - k and is absorbed by nothing displayed except the discount, so the printed uniform constant implicitly consumes sup_j (1+j)3^{-sj/8} ≍ Cs^{-1} — one power of s^{-1} beyond the s^{-2} shown. Here that absorption is SmallWavesArith.rpow_mul_penalty_sq_le, and the resulting uniform amplitude is smallWaveScale, explicitly 8 s^{-1}(1 + 2d log 3) times the squared atom amplitude.

References #

0. A Γ_σ tail for the identically zero observable #

1. The 𝒢₁b score field: the lattice maximum at scale k inside □_m #

The 𝒢₁b score field: 3^{(2-γ)k} max_{z ∈ 3^kℤ^d ∩ □_m} ‖j_k‖_{W^{2,∞}(z+□_k)}, as the 0-floored maximum over the explicit lattice Finset.

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

    The score field reads exactly one shell — the (J1) input of the independence hypothesis, at the genuinely two-index shape.

    e.maxy.bound at the 𝒢₁b lattice cube. The per-centre Γ₂ tail of atomG1b, lifted through the maximum at the machine-computed union-bound penalty (1 + d(m-k+1) log 3)^{1/2}.

    2. The two-index Appendix-D array #

    The 𝒢₁b Appendix-D array, genuinely two-index: X_{m,k} = 3^{-s(m-k)/8}(3^{(2-γ)k}max_{z ∈ 3^kℤ^d ∩ □_m}‖j_k‖_{W^{2,∞}(z+□_k)})² for k ≤ m, and 0 otherwise.

    Equations
    Instances For

      The uniform Γ₁ amplitude of the two-index array: the squared atom amplitude, times the 8 s^{-1}(1 + 2d log 3) produced by absorbing the growing lattice-max penalty into the discount.

      Equations
      Instances For

        e.Xmk.pedant.bound, in tail form, with the accounting made explicit. Every entry of the two-index array has a Γ₁ upper tail at the uniform amplitude smallWaveScale d s. The three inputs are: the per-centre Γ₂ tail of atomG1b, the union-bound penalty over the growing lattice cube, and e.powerofGammasigma (squaring moves σ = 2 to σ = 1).

        3. The reduction of the second 𝒢₁ condition #

        The inner block of 𝒢₁b at one scale is below the squared score field.

        theorem Algsuperdiff.Section4.Provider.Proportion.eventG1b_lhs_le_rowGE {d : ℕ} (M : Section3.ABKModel d) {s : ℝ} (hs0 : 0 < s) (hs1 : s ≤ 1) (m : ℤ) (omega : Section3.Cutoff.CutoffSample d) :
        ∑' (n : { n : ℤ // n ≤ m }), ENNReal.ofReal (Real.rpow 3 (-(1 / 4) * s * ↑(m - ↑n))) * ∑ k ∈ Finset.Icc (↑n - 1) m, (ENNReal.ofReal (Real.rpow 3 ((2 - M.gamma) * ↑k)) * ⨆ (v : ↑(Support.latticeCubeSet d k m)), ENNReal.ofReal (Support.shellW2InfNormAt (Support.triadicLatticePoint k ↑v) k (↑omega k))) ^ 2 ≤ ENNReal.ofReal (g1bConst s) * rowGE (arrayG1b M s) (s / 8) m omega

        The 𝒢₁b reduction, against the honest two-index array. The left side of the second 𝒢₁ condition at row m is at most g1bConst s times the Appendix-D row sum of arrayG1b at rate s/8. Two steps: the interchange (an identity in ℝ≥0∞) and the geometric partial weight (the manuscript's 4s^{-1}).

        theorem Algsuperdiff.Section4.Provider.Proportion.lt_rowGE_of_notMem_eventG1b {d : ℕ} (M : Section3.ABKModel d) {s T : ℝ} (hs0 : 0 < s) (hs1 : s ≤ 1) (m : ℤ) {omega : Section3.Cutoff.CutoffSample d} (hnot : omega ∉ eventG1b M m s T) :
        ENNReal.ofReal (T ^ 2 / g1bConst s) < rowGE (arrayG1b M s) (s / 8) m omega

        Off the lane's good event the ℝ≥0∞ row exceeds the scaled threshold.