Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section4.Provider.Annular.Ugly

Ugly #

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

The five-term per-cube ("ugly") estimate on the good event #

ABK26, Section 4.1, (e.ugly.estimate.for.J). The manuscript takes the four sensitivity terms of e.ugly.estimate.for.J.pre and collapses every lambda- and gradient-factor against the two good-event budgets

  sigmaBar_{n-2} lambda_{gamma,2}^{-1}(z+cube_n; a_{n-2}) 1_G <= C 3^{gamma(m-n)}
  sigmaBar_{n-2}^{-1} 3^{2n} ||grad(k_L - k_{n-2})||_{W^{1,infty}(z+cube_n)} 1_G
                                                  <= C 3^{s(m-n)/4}

(ABK26, in that order)

together with the running-diffusivity facts

  sigmaBar_k >= (1/2) cstar^{1/2} gamma^{-1/2} 3^{gamma k}   (every k <= m)
  sigmaBar_m^{-1} sigmaBar_{n-2} <= C

(the second is ABK26)

and one mean-zero Poincare step. The result is the printed five-term display.

The two hypotheses this module does NOT discharge #

The five-term shape #

def Algsuperdiff.Section4.Provider.Annular.IsUglyJEstimate (Jval E2 sigDiff L2 gradN gradM cstar gam w wgam C : ℝ) :

The shape of e.ugly.estimate.for.J, with the two displayed weights w = 3^{s(m-n)} and w_gamma = 3^{(s+gamma)(m-n)} left abstract.

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

    The running-diffusivity arithmetic #

    kap is the normalization gamma * kap^2 = cstar, i.e. kap = cstar^{1/2} gamma^{-1/2}, kept squared so that no square root ever appears.

    theorem Algsuperdiff.Section4.Provider.Annular.inv_le_two_mul_inv {kap P sig : ℝ} (hkap0 : 0 < kap) (hP0 : 0 < P) (hlow : 1 / 2 * (kap * P) ≤ sig) :
    sig⁻¹ ≤ 2 * (kap⁻¹ * P⁻¹)

    The inverse form of the sigmaBar lower bound sigmaBar_k >= (1/2) cstar^{1/2} gamma^{-1/2} 3^{gamma k}.

    theorem Algsuperdiff.Section4.Provider.Annular.inv_le_four_mul_inv {kap P sig : ℝ} (hkap0 : 0 < kap) (hP0 : 0 < P) (hlow : 1 / 4 * (kap * P) ≤ sig) :
    sig⁻¹ ≤ 4 * (kap⁻¹ * P⁻¹)

    The inverse form of the relaxed sigmaBar lower bound sigmaBar_k >= (1/4) cstar^{1/2} gamma^{-1/2} 3^{gamma k}, i.e. the shape the Section 3 state delivers at the shifted index k = n-2 once the exponent is moved to 3^{gamma n} (see the module docstring).

    theorem Algsuperdiff.Section4.Provider.Annular.kapInv_sq {kap cstar gam : ℝ} (hkap0 : 0 < kap) (hcstar : 0 < cstar) (hkap : gam * kap ^ 2 = cstar) :
    kap⁻¹ ^ 2 = cstar⁻¹ * gam

    The kap-normalization, squared: (kap^{-1})^2 = cstar^{-1} gamma.

    theorem Algsuperdiff.Section4.Provider.Annular.gamma_pos_of_kap {kap cstar gam : ℝ} (hkap0 : 0 < kap) (hcstar : 0 < cstar) (hkap : gam * kap ^ 2 = cstar) :
    0 < gam

    The kap-normalization forces gamma > 0.

    The four per-term patches #

    theorem Algsuperdiff.Section4.Provider.Annular.uglyPatch1 {Cs Cr A W GF1 E2 muInv : ℝ} (hCs : 0 ≤ Cs) (hE2 : 0 ≤ E2) (hmu0 : 0 ≤ muInv) (hmu : muInv ≤ Cr) (hGF10 : 0 ≤ GF1) (hGF1 : GF1 ≤ (1 + A) ^ 2 * W) :
    Cs * muInv * GF1 * E2 ≤ Cs * (1 + A) ^ 2 * Cr * W * E2

    Patch 1. The first sensitivity term, whose growth factor GF1 is already collapsed against the weight W, becomes the displayed C 3^{s(m-n)} E^2 term.

    theorem Algsuperdiff.Section4.Provider.Annular.uglyPatch3 {Cs cstar gam kap Pm Pn W X sigm : ℝ} (hCs : 0 ≤ Cs) (hcstar : 0 < cstar) (hkap0 : 0 < kap) (hkap : gam * kap ^ 2 = cstar) (hPm0 : 0 < Pm) (hPn0 : 0 < Pn) (hPnPm : Pn ≤ Pm) (hW1 : 1 ≤ W) (hsigm0 : 0 < sigm) (hsigmlow : 1 / 2 * (kap * Pm) ≤ sigm) :
    Cs * sigm⁻¹ ^ 2 * X ^ 2 ≤ 4 * Cs * cstar⁻¹ * gam * W * (Pn⁻¹ * X) ^ 2

    Patch 3. The third sensitivity term Cs sigmaBar_m^{-2} X^2 becomes the displayed gradient-at-n term.

    theorem Algsuperdiff.Section4.Provider.Annular.uglyPatch4 {Cs Cl cstar gam kap Pn Q W X lamInv sign : ℝ} (hCs : 0 ≤ Cs) (hX : 0 ≤ X) (hlamInv : 0 ≤ lamInv) (hcstar : 0 < cstar) (hkap0 : 0 < kap) (hkap : gam * kap ^ 2 = cstar) (hPn0 : 0 < Pn) (hQ2W : Q ^ 2 ≤ W) (hsign0 : 0 < sign) (hsignlow : 1 / 4 * (kap * Pn) ≤ sign) (hlam : sign * lamInv ≤ Cl * Q) :
    Cs * min 1 (X * lamInv) ^ 2 ≤ 16 * Cs * Cl ^ 2 * cstar⁻¹ * gam * W * (Pn⁻¹ * X) ^ 2

    Patch 4. The fourth sensitivity term Cs min{1, X lambda^{-1}}^2 also becomes the displayed gradient-at-n term, by the lambda-budget sigmaBar_{n-2} lambda^{-1} <= Cl 3^{gamma(m-n)}.

    theorem Algsuperdiff.Section4.Provider.Annular.uglyPatch2 {Cs Cl Cr Cp A cstar gam kap Pm Pn Q W Wg GF2 lamInv sigm sign Hsq Lnrm Y : ℝ} (hCs : 0 ≤ Cs) (hHsq : 0 ≤ Hsq) (hlamInv : 0 ≤ lamInv) (hcstar : 0 < cstar) (hkap0 : 0 < kap) (hkap : gam * kap ^ 2 = cstar) (hPm0 : 0 < Pm) (hPn0 : 0 < Pn) (hQ0 : 0 < Q) (hW0 : 0 ≤ W) (hPnPm : Pn ≤ Pm) (hQPn : Q * Pn = Pm) (hWg : W * Q = Wg) (hsigm0 : 0 < sigm) (hsign0 : 0 < sign) (hsigmlow : 1 / 2 * (kap * Pm) ≤ sigm) (hsignlow : 1 / 4 * (kap * Pn) ≤ sign) (hlam : sign * lamInv ≤ Cl * Q) (hratio : sigm⁻¹ * sign ≤ Cr) (hGF20 : 0 ≤ GF2) (hGF2 : Q * GF2 ≤ (1 + A) ^ 2 * W) (hH : Hsq ≤ 2 * Lnrm ^ 2 + 2 * (Cp * Y) ^ 2) :
    Cs * (sigm⁻¹ * sign ^ 2) * lamInv * GF2 * (sign⁻¹ ^ 2 * Hsq + (sigm * sign⁻¹ - 1) ^ 2) ≤ Cs * (1 + A) ^ 2 * Cr * Cl * W * (sigm * sign⁻¹ - 1) ^ 2 + 16 * Cs * (1 + A) ^ 2 * Cl * cstar⁻¹ * gam * W * (Pn⁻¹ * Lnrm) ^ 2 + 16 * Cs * (1 + A) ^ 2 * Cl * Cp ^ 2 * cstar⁻¹ * gam * Wg * (Pm⁻¹ * Y) ^ 2

    Patch 2. The second sensitivity term splits three ways: the sigmaBar-continuity term, the L^2 term, and --- via the Poincare hypothesis hH --- the displayed gradient-at-m term.

    Q * Pn = Pm is the triadic identity 3^{gamma(m-n)} 3^{gamma n} = 3^{gamma m} and W * Q = Wg is 3^{s(m-n)} 3^{gamma(m-n)} = 3^{(s+gamma)(m-n)}.

    The Poincare split #

    theorem Algsuperdiff.Section4.Provider.Annular.poincareSplit {H A B Cp Y : ℝ} (hH0 : 0 ≤ H) (hB0 : 0 ≤ B) (htri : H ≤ A + B) (hpoin : B ≤ Cp * Y) :
    H ^ 2 ≤ 2 * A ^ 2 + 2 * (Cp * Y) ^ 2

    The hH slot of the assembly, produced from the triangle inequality and one mean-zero Poincare bound.

    H is ||k_L - (k_L - k_m)_{cube_m} - k_{n-2}||_{L-underline^2(z+cube_n)}, A is ||k_m - k_{n-2}||_{L-underline^2(z+cube_n)}, and B is the mean-zero fluctuation ||k_L - k_m - (k_L - k_m)_{cube_m}||_{L-underline^2(z+cube_n)}, whose Poincare bound is hpoin (there Y = 3^{2m} Gm).

    The Poincare input itself is proved upstream, not owed here: CoarseGraining's Homogenization.cubeBesovOscillation_two_le_cubeScaleFactor_mul_normalizedW1pSeminorm is exactly ||u - (u)_Q||_{L-underline^2(Q)} <= C(d) 3^{Q.scale} ||grad u||_{L-underline^2(Q)} on a triadic cube, in the volume-normalized convention this slice uses.

    The four-term to five-term assembly #

    theorem Algsuperdiff.Section4.Provider.Annular.uglyJEstimate_core {Cs Cl Cr Cp A C cstar gam kap Pm Pn Q W Wg GF1 GF2 lamInv sigm sign Jval E2 Hsq Lnrm X Y : ℝ} (hCs : 0 ≤ Cs) (hE2 : 0 ≤ E2) (hX : 0 ≤ X) (hHsq : 0 ≤ Hsq) (hlamInv : 0 ≤ lamInv) (hcstar : 0 < cstar) (hkap0 : 0 < kap) (hkap : gam * kap ^ 2 = cstar) (hPm0 : 0 < Pm) (hPn0 : 0 < Pn) (hQ0 : 0 < Q) (hW0 : 0 ≤ W) (hPnPm : Pn ≤ Pm) (hW1 : 1 ≤ W) (hQ2W : Q ^ 2 ≤ W) (hQPn : Q * Pn = Pm) (hWg : W * Q = Wg) (hsigm0 : 0 < sigm) (hsign0 : 0 < sign) (hsigmlow : 1 / 2 * (kap * Pm) ≤ sigm) (hsignlow : 1 / 4 * (kap * Pn) ≤ sign) (hlam : sign * lamInv ≤ Cl * Q) (hratio : sigm⁻¹ * sign ≤ Cr) (hGF10 : 0 ≤ GF1) (hGF1 : GF1 ≤ (1 + A) ^ 2 * W) (hGF20 : 0 ≤ GF2) (hGF2 : Q * GF2 ≤ (1 + A) ^ 2 * W) (hH : Hsq ≤ 2 * Lnrm ^ 2 + 2 * (Cp * Y) ^ 2) (hsens : Jval ≤ Cs * (sigm⁻¹ * sign) * GF1 * E2 + Cs * (sigm⁻¹ * sign ^ 2) * lamInv * GF2 * (sign⁻¹ ^ 2 * Hsq + (sigm * sign⁻¹ - 1) ^ 2) + Cs * sigm⁻¹ ^ 2 * X ^ 2 + Cs * min 1 (X * lamInv) ^ 2) (hC : Cs * (1 + A) ^ 2 * Cr * (1 + Cl) + 16 * Cs * (1 + A) ^ 2 * Cl * (1 + Cp ^ 2) + 4 * Cs * (1 + 4 * Cl ^ 2) ≤ C) :
    IsUglyJEstimate Jval E2 ((sigm * sign⁻¹ - 1) ^ 2) ((Pn⁻¹ * Lnrm) ^ 2) ((Pn⁻¹ * X) ^ 2) ((Pm⁻¹ * Y) ^ 2) cstar gam W Wg C

    e.ugly.estimate.for.J, abstract-weight form.

    The four sensitivity terms hsens of e.ugly.estimate.for.J.pre, collapsed against the two good-event budgets (hlam, and the growth-factor bounds hG/hG which are where the 3^{s(m-n)/4} gradient budget has already been absorbed), the two sigmaBar lower bounds and the sigmaBar ratio, plus the Poincare split hH, give the printed five-term display at the explicit constant C.

    The triadic weights: the growth-factor collapses #

    theorem Algsuperdiff.Section4.Provider.Annular.growthFactor_collapse {A s gam q : ℝ} (hA : 0 ≤ A) (hq : 0 ≤ q) (hs0 : 0 < s) (hs : s ≤ 1 / 2) (hgam0 : 0 ≤ gam) (hgam : gam ≤ 1 / 8) :
    (1 + A * 3 ^ ((s / 4 + gam) * q)) ^ (2 * s / (1 - 4 * gam)) ≤ (1 + A) ^ 2 * 3 ^ (s * q)

    With the lambda- and gradient-budgets already inserted, the first sensitivity growth factor is dominated by (1 + A)^2 3^{s(m-n)}. At the gapped gauge the exponent is 2s/(1 - 4 gamma) and the arithmetic needs s/2 + 6 gamma <= 1, which is what s <= 1/2 and gamma <= 1/8 deliver (with equality at the corner).

    theorem Algsuperdiff.Section4.Provider.Annular.growthFactor_collapse_sigma {A s gam q : ℝ} (hA : 0 ≤ A) (hq : 0 ≤ q) (hs0 : 0 < s) (hs : s ≤ 1 / 2) (hgam0 : 0 ≤ gam) (hgams : 8 * gam ≤ s) :
    3 ^ (gam * q) * (1 + A * 3 ^ ((s / 4 + gam) * q)) ^ (4 * gam / (1 - 4 * gam)) ≤ (1 + A) ^ 2 * 3 ^ (s * q)

    Growth-factor collapse, second exponent. At the gapped gauge the exponent is 4 gamma/(1 - 4 gamma) and the arithmetic needs gamma + 5 s gamma <= s, which is what 8 gamma <= s <= 1/2 delivers with room to spare (the left side is at most (7/16) s).

    e.ugly.estimate.for.J at the manuscript's triadic weights #

    theorem Algsuperdiff.Section4.Provider.Annular.uglyJEstimate_of_sensitivity {s gam cstar kap Cs Cl Cr Cp Ash C mm nn q lamInv sigm sign Jval E2 Hsq Lnrm Gn Gm : ℝ} (hs0 : 0 < s) (hs1 : s ≤ 1 / 2) (hsgam : 8 * gam ≤ s) (hnm : nn ≤ mm) (hq : q = mm - nn) (hCs : 0 ≤ Cs) (hAsh : 0 ≤ Ash) (hE2 : 0 ≤ E2) (hGn : 0 ≤ Gn) (hHsq : 0 ≤ Hsq) (hlamInv : 0 ≤ lamInv) (hcstar : 0 < cstar) (hkap0 : 0 < kap) (hkap : gam * kap ^ 2 = cstar) (hsigm0 : 0 < sigm) (hsign0 : 0 < sign) (hsigmlow : 1 / 2 * (kap * 3 ^ (gam * mm)) ≤ sigm) (hsignlow : 1 / 4 * (kap * 3 ^ (gam * nn)) ≤ sign) (hlam : sign * lamInv ≤ Cl * 3 ^ (gam * q)) (hshell : sign⁻¹ * (3 ^ (2 * nn) * Gn) ≤ Ash * 3 ^ (s / 4 * q)) (hratio : sigm⁻¹ * sign ≤ Cr) (hH : Hsq ≤ 2 * Lnrm ^ 2 + 2 * (Cp * (3 ^ (2 * mm) * Gm)) ^ 2) (hsens : Jval ≤ Cs * (sigm⁻¹ * sign) * (1 + 3 ^ (2 * nn) * Gn * lamInv) ^ (2 * s / (1 - 4 * gam)) * E2 + Cs * (sigm⁻¹ * sign ^ 2) * lamInv * (1 + 3 ^ (2 * nn) * Gn * lamInv) ^ (4 * gam / (1 - 4 * gam)) * (sign⁻¹ ^ 2 * Hsq + (sigm * sign⁻¹ - 1) ^ 2) + Cs * sigm⁻¹ ^ 2 * (3 ^ (2 * nn) * Gn) ^ 2 + Cs * min 1 (3 ^ (2 * nn) * Gn * lamInv) ^ 2) (hC : Cs * (1 + Ash * Cl) ^ 2 * Cr * (1 + Cl) + 16 * Cs * (1 + Ash * Cl) ^ 2 * Cl * (1 + Cp ^ 2) + 4 * Cs * (1 + 4 * Cl ^ 2) ≤ C) :
    IsUglyJEstimate Jval E2 ((sigm * sign⁻¹ - 1) ^ 2) ((3 ^ (-(gam * nn)) * Lnrm) ^ 2) ((3 ^ ((2 - gam) * nn) * Gn) ^ 2) ((3 ^ ((2 - gam) * mm) * Gm) ^ 2) cstar gam (3 ^ (s * q)) (3 ^ ((s + gam) * q)) C

    e.ugly.estimate.for.J, at the printed weights w = 3^{s(m-n)} and w_gamma = 3^{(s+gamma)(m-n)}.

    hlam is the lambda-budget, hshell the G_1 gradient budget, hratio the sigmaBar_m^{-1} sigmaBar_{n-2} <= C, hH the Poincare split, and hsens the four-term pre-estimate.

    The s-window here is the manuscript's [8 gamma, 1/2]. A consumer that feeds hsens from the Section 2.4 anchor (see UglyPre) must further restrict to s <= 1/4; that residual is noted there.