Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section3.Provider.Diffusivity.ApproximateRecurrence.PrincipalResponseComposeAssembly

PrincipalResponseComposeAssembly #

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

Provider: the assembly of e.lower.bound.principal.one #

Target display, e.lower.bound.principal.one, in ABK26 (block):

  avsum_{z in 3^n Zd cap cu_K} E[ P_z . bfA_m(z+cu_n) P_z ]
    <= (1 + C E^2 |log cgamma|^2 cgamma)
         avsum_z E[ G_{-(h)_{z+cu_n}} P_z . bfAhom_{m-h} G_{-(h)_{z+cu_n}} P_z ]
       + cgamma^6 .

The manuscript derives it in one sentence: "Combining the above two displays with e.lower.bound.principal.one.pre leads to e.lower.bound.principal.one." The three inputs of that sentence are

This module performs exactly that combination.

What is supplied and what is assumed #

Other divergences #

Binders #

Every theorem below is conditional except descendantsAverage_add_real, which is an unconditional identity. None of them is a frozen declaration. What the caller must supply, plainly:

hgood and hbad are \labeled displays of the manuscript, supplied elsewhere; every step between them and the target display is performed here rather than assumed.

Module boundary #

This module does not import or consume Provider.BadEvents.BadEventLemmaUmbrella. The bad-event half enters only as the abstract binder hbad, so the transitional umbrella consumption described in PrincipalResponseComposeBadEvent is confined to that single file and does not leak here.

References #

Grid arithmetic #

A uniform per-cube bound with a constant factor passes to the grid average.

: this statement holds only under the propositions supplied by its binders; it is a provider A, not a source-facing frozen declaration.

The fold, with its excess pinned #

theorem Algsuperdiff.Section3.Provider.Diffusivity.ApproximateRecurrence.principalResponse_fold_exact {total good bad cubeEnergy limEnergy delta kappa budget : ℝ} (hsplit : total = good + bad) (hgood : good ≤ (1 + delta) * cubeEnergy + budget / 2) (hbad : bad ≤ budget / 2) (hcube : cubeEnergy ≤ (1 + kappa) * limEnergy) (hdelta0 : 0 ≤ delta) :
total ≤ (1 + delta) * (1 + kappa) * limEnergy + budget

The combination, with the product left exact.

Splitting the energy over the good and bad events, applying the good-event display at factor 1 + delta, the bad-event budget, and the cube-to-limit step at factor 1 + kappa, one gets the target with the exact product (1 + delta)(1 + kappa). Nothing is absorbed: a formalization must name its constants, and this statement names them.

: this statement holds only under the propositions supplied by its binders; it is a provider A, not a source-facing frozen declaration.

theorem Algsuperdiff.Section3.Provider.Diffusivity.ApproximateRecurrence.one_add_mul_one_add_le_one_add_three_mul {delta kappa : ℝ} (hdelta0 : 0 ≤ delta) (hdelta : delta ≤ kappa) (hdelta1 : delta ≤ 1) :
(1 + delta) * (1 + kappa) ≤ 1 + 3 * kappa

The rename, at the visible price C -> 3C. If the good-event excess delta is below the cube-to-limit budget kappa and below 1, the exact product collapses into a single factor with the constant tripled.

: this statement holds only under the propositions supplied by its binders; it is a provider A, not a source-facing frozen declaration.

theorem Algsuperdiff.Section3.Provider.Diffusivity.ApproximateRecurrence.principalResponse_fold_renamed {total good bad cubeEnergy limEnergy delta kappa budget : ℝ} (hsplit : total = good + bad) (hgood : good ≤ (1 + delta) * cubeEnergy + budget / 2) (hbad : bad ≤ budget / 2) (hcube : cubeEnergy ≤ (1 + kappa) * limEnergy) (hdelta0 : 0 ≤ delta) (hdelta : delta ≤ kappa) (hdelta1 : delta ≤ 1) (hlim0 : 0 ≤ limEnergy) :
total ≤ (1 + 3 * kappa) * limEnergy + budget

The combination in the manuscript's printed shape, with the constant renamed rather than silently reused.

: this statement holds only under the propositions supplied by its binders; it is a provider A, not a source-facing frozen declaration.

The indicator split #

theorem Algsuperdiff.Section3.Provider.Diffusivity.ApproximateRecurrence.integral_indicator_split {Omega : Type u_1} {mOmega : MeasurableSpace Omega} {mu : MeasureTheory.Measure Omega} {f : Omega → ℝ} {Ebad : Set Omega} (h1 : MeasureTheory.Integrable (fun (omega : Omega) => f omega * Ebadᶜ.indicator (fun (x : Omega) => 1) omega) mu) (h2 : MeasureTheory.Integrable (fun (omega : Omega) => f omega * Ebad.indicator (fun (x : Omega) => 1) omega) mu) :
∫ (omega : Omega), f omega ∂mu = ∫ (omega : Omega), f omega * Ebadᶜ.indicator (fun (x : Omega) => 1) omega ∂mu + ∫ (omega : Omega), f omega * Ebad.indicator (fun (x : Omega) => 1) omega ∂mu

The good/bad split of the energy under the expectation, against.

: this statement holds only under the propositions supplied by its binders; it is a provider A, not a source-facing frozen declaration.

Leg (v) at the grid #

theorem Algsuperdiff.Section3.Provider.Diffusivity.ApproximateRecurrence.descendantsAverage_integral_annealedCubeBlockQuadratic_le {d : ℕ} {Omega : Type u_1} {mOmega : MeasurableSpace Omega} {mu : MeasureTheory.Measure Omega} [NeZero d] (M : ABKModel d) (L n : ℤ) {Ev : HCPolySupport.BlockVec d} (hEv : HCPolySupport.blockVecDot Ev Ev = 1) (Q : HCPolySupport.TriadicCube d) (j : ℕ) (W : HCPolySupport.TriadicCube d → Omega → HCPolySupport.BlockVec d) (hcubeInt : ∀ R ∈ HCPolySupport.descendantsAtDepth Q j, MeasureTheory.Integrable (fun (omega : Omega) => HCPolySupport.blockVecDot (W R omega) (HCPolySupport.blockMatVecMul (HCPolySupport.Book.Ch04.annealedBlockMatrixAtScale (Cutoff.coefficientCutoffLaw M L) n) (W R omega))) mu) (hlimInt : ∀ R ∈ HCPolySupport.descendantsAtDepth Q j, MeasureTheory.Integrable (fun (omega : Omega) => HCPolySupport.blockVecDot (W R omega) (HCPolySupport.blockMatVecMul (HCPolySupport.Book.Ch02.blockDiag (↑(Annealed.sigmaBar M L) • 1) ((↑(Annealed.sigmaBar M L))⁻¹ • 1)) (W R omega))) mu) :

e.use.also.for.the.upper.bound integrated and grid-averaged. The proved Loewner domination of the finite-cube annealed matrix by (1 + delta) times the infinite-volume one, with delta the defect, passes through the expectation and the grid average.

: this statement holds only under the propositions supplied by its binders; it is a provider A, not a source-facing frozen declaration.

The target display #

The printed switch budget^{2K} E^2 |log cgamma|^2 cgamma, with the proved absolute constant and the scale-gap factor both visible. This is the quantity the manuscript writes as^2 |log cgamma|^2 cgamma.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem Algsuperdiff.Section3.Provider.Diffusivity.ApproximateRecurrence.descendantsAverage_integral_principalEnergy_le_annealedLimit {d : ℕ} {Omega : Type u_1} {mOmega : MeasurableSpace Omega} {mu : MeasureTheory.Measure Omega} [NeZero d] (M : ABKModel d) {m0 L n : ℤ} {Ec : { E : ℝ // 1 ≤ E }} (hS : Frozen.Section3.inductionState M m0 Ec) (hL : L ≤ m0) (hn : n ≤ L) (hE6 : 6 ≤ ↑Ec) (hgamE : M.gamma ≤ (↑Ec ^ 5)⁻¹) (hsw : |Real.log M.gamma|⁻¹ ∈ Set.Icc (8 * M.gamma) 1) {Ev : HCPolySupport.BlockVec d} (hEv : HCPolySupport.blockVecDot Ev Ev = 1) {K : ℝ} (hgapK : |Real.log M.gamma|⁻¹ * ↑(L - n).toNat ≤ K) (Q : HCPolySupport.TriadicCube d) (j : ℕ) (energy : HCPolySupport.TriadicCube d → Omega → ℝ) (W : HCPolySupport.TriadicCube d → Omega → HCPolySupport.BlockVec d) {Ebad : HCPolySupport.TriadicCube d → Set Omega} (hgoodInt : ∀ R ∈ HCPolySupport.descendantsAtDepth Q j, MeasureTheory.Integrable (fun (omega : Omega) => energy R omega * (Ebad R)ᶜ.indicator (fun (x : Omega) => 1) omega) mu) (hbadInt : ∀ R ∈ HCPolySupport.descendantsAtDepth Q j, MeasureTheory.Integrable (fun (omega : Omega) => energy R omega * (Ebad R).indicator (fun (x : Omega) => 1) omega) mu) (hcubeInt : ∀ R ∈ HCPolySupport.descendantsAtDepth Q j, MeasureTheory.Integrable (fun (omega : Omega) => HCPolySupport.blockVecDot (W R omega) (HCPolySupport.blockMatVecMul (HCPolySupport.Book.Ch04.annealedBlockMatrixAtScale (Cutoff.coefficientCutoffLaw M L) n) (W R omega))) mu) (hlimInt : ∀ R ∈ HCPolySupport.descendantsAtDepth Q j, MeasureTheory.Integrable (fun (omega : Omega) => HCPolySupport.blockVecDot (W R omega) (HCPolySupport.blockMatVecMul (HCPolySupport.Book.Ch02.blockDiag (↑(Annealed.sigmaBar M L) • 1) ((↑(Annealed.sigmaBar M L))⁻¹ • 1)) (W R omega))) mu) (hgood : (HCPolySupport.descendantsAverage Q j fun (R : HCPolySupport.TriadicCube d) => ∫ (omega : Omega), energy R omega * (Ebad R)ᶜ.indicator (fun (x : Omega) => 1) omega ∂mu) ≤ ((1 + M.gamma ^ 6) * HCPolySupport.descendantsAverage Q j fun (R : HCPolySupport.TriadicCube d) => ∫ (omega : Omega), HCPolySupport.blockVecDot (W R omega) (HCPolySupport.blockMatVecMul (HCPolySupport.Book.Ch04.annealedBlockMatrixAtScale (Cutoff.coefficientCutoffLaw M L) n) (W R omega)) ∂mu) + M.gamma ^ 6 / 2) (hbad : (HCPolySupport.descendantsAverage Q j fun (R : HCPolySupport.TriadicCube d) => ∫ (omega : Omega), energy R omega * (Ebad R).indicator (fun (x : Omega) => 1) omega ∂mu) ≤ M.gamma ^ 6 / 2) (hrename : M.gamma ^ 6 ≤ principalResponseSwitchBudget M Ec K) :

    e.lower.bound.principal.one, assembled.

    At the field index L (the manuscript's m - h), the cube scale n, the localization cube Q and depth j, for every energy observable energy and every gauged doubled load W:

      avsum_R E[ energy_R ]
        <= (1 + 3 principalResponseSwitchBudget)
             avsum_R E[ W_R . bfAhom_L W_R ]
           + cgamma^6 ,
    

    given the good-event display e.lower.bound.principal.one.pre (hgood), the bad-event budget (hbad), and the rename gate hrename. The passage from bfAhom_L(cu_n) to bfAhom_L -- the manuscript's third input, e.use.also.for.the.upper.bound -- is not assumed: it is produced from the proved leg (v) and its budget.

    The bad event is indexed by the grid cube, Ebad : TriadicCube d → Set Omega, as the manuscript's own Q_z are: each cube of the depth-j grid carries its own event, and the split below is performed cube by cube. Taking Ebad constant recovers the single-event reading, so nothing is lost by the indexing.

    hgood and hbad are named binders: they are the manuscript's own two \labeled displays, and this theorem asserts nothing about their satisfiability.

    The statement therefore holds only under the propositions supplied by its binders; it is a conditional result, not a frozen declaration.