Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section4.Provider.Regularity.StepSevenEndEmbedding

StepSevenEndEmbedding #

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

t.regularity Step 7d, part two: the oscillation endpoint #

The target #

  3^{-(m'-1)}‖u - (u)_{(z+□_{m'-1})∩□_m}‖_{L²((z+□_{m'-1})∩□_m)} 1_{𝒢(m',z;·,·)}
    ≤ C 3^{-(m'-1)}‖u - (u)_{z'+□_{m'-1}}‖_{L²(z'+□_{m'-1})} 1_{𝒢}     (S44-G)
    ≤ C σ_m^{-1/2} 3^{(1/2)(d+γ)(m-m')}
        ( ν^{1/2}‖∇u‖_{L²(□_m)} + σ_m^{-1/2} 3^{sm}[𝐠]_{H^s(□_m)} ) .

Step one: the window replacement #

The manuscript replaces the truncated window (z+□_{m'-1}) ∩ □_m by the off-grid cube z'+□_{m'-1} "at the cost of a constant C". The inclusion is the Step-7a sandwich (StepSevenSelectionData.upper_sandwich_in); the comparison of the two mean-subtracted L² norms is asserted. It is proved here from two proved facts and one proved geometric input:

The produced constant is therefore the explicit 3^{d/2}, a C(d) exactly as printed. (The sharp constant is 2^{d/2}; the inscribed-cube route gives 3^{d/2}, and the difference is inside C.)

Step two: the embedding, and the summability bridge #

The manuscript's second inequality is e.fractional.Sobolev.embedding composed with e.cg.Poincare.with.rhs.grad.applied. Two independent conditional inputs, both named for what they are:

The scalar carriers #

References #

1. The mean comparison across nested windows #

The mean comparison on nested windows. For S ⊆ T,

  ‖u - (u)_S‖_{L²(S)}  ≤  (|T|/|S|)^{1/2} ‖u - (u)_T‖_{L²(T)} .

The mean on S is replaced by the mean on T for free (the mean minimizes the deviation), and the nested windows then compare at the square root of the volume ratio. This is the inequality the manuscript asserts.

2. The volume ratio of the Step-7a sandwich pair #

The sandwich pair's volume ratio. For z ∈ □_m and k ≤ m, every translate of □_k has volume at most 3^d times that of the truncated window (z+□_k) ∩ □_m — the inscribed cube □_{k-1} of image_add_wellPlacedCentre_subset_truncatedWindow supplies the lower bound.

3. The mean comparison at the Step-7a sandwich #

The Step-7d mean comparison, at the sandwich pair, with the constant made explicit:

  ‖u - (u)_{(z+□_k)∩□_m}‖_{L²((z+□_k)∩□_m)}
    ≤ 3^{d/2} ‖u - (u)_{z'+□_k}‖_{L²(z'+□_k)} .

hST is StepSevenSelectionData.upper_sandwich_in at k = m'-1. The 3^{d/2} is the inscribed-cube constant; the sharp value is 2^{d/2} and the difference is inside C(d).

4. The oscillation endpoint on scalars #

theorem Algsuperdiff.Section4.Provider.Regularity.sqrt_mul_bracket_eq {S g D : ℝ} (hS : 0 ≤ S) :
√S * g + S * D = √S * (g + √S * D)

The bracket identity that turns StepSevenEndPoincare's output shape into the printed Step-7d one: for 0 ≤ S, √S·g + S·D = √S·(g + √S·D).

theorem Algsuperdiff.Section4.Provider.Regularity.stepSevenOscillationEndpoint {Cmean Cemb Cbr Cout Ktr oscTrunc oscLoc besovP1 besov shomMinv gradM dataM : ℝ} (hCmean : 0 ≤ Cmean) (hCemb : 0 ≤ Cemb) (hCbr : 0 ≤ Cbr) (hshomMinv : 0 ≤ shomMinv) (hmean : oscTrunc ≤ Cmean * oscLoc) (hembed : oscLoc ≤ Cemb * besovP1) (hbridge : besovP1 ≤ Cbr * besov) (hpoincare : besov ≤ Cout * Ktr * (√shomMinv * gradM + shomMinv * dataM)) :
oscTrunc ≤ Cmean * Cemb * Cbr * (Cout * Ktr) * (√shomMinv * (gradM + √shomMinv * dataM))

The Step-7d oscillation endpoint, on abstract reals.

The four links of the manuscript's chain:

  oscTrunc ≤ Cmean·oscLoc          (proved above)
  oscLoc   ≤ Cemb ·besovP1         (hembed  — e.fractional.Sobolev.embedding, mean-zero)
  besovP1  ≤ Cbr  ·besov           (hbridge — the summability change)
  besov    ≤ Cout ·Ktr·(√σ_m^{-1}·gradM + σ_m^{-1}·dataM)   (StepSevenEndPoincare)

composed, and the bracket rewritten into the printed σ_m^{-1/2}(ν^{1/2}‖∇u‖_{L²(□_m)} + σ_m^{-1/2}3^{sm}[𝐠]_{H^s(□_m)}).