DisplayBridge #
Ported from scottnarmstrong/Superdiffusion at 7f20476385d4af418f110303085ad0740c9eba46. Module imports, support namespace and local option directives adapted for Lean Pool.
Binder descriptions below are an informal inventory only, NOT a source certification; certification vocabulary is reserved for frozen source-facing declarations.
The two printed recurrence displays, transported to the integration interface #
ABK26's l.approximate.recurrence.formula (statement, proof) concludes with
the pair of displays e.what.do.we.have. Written at the pair of scales n
and m = n + h, and with the manuscript's (log 3) c_star sum_{k=n+1}^{n+h} 3^{2 gamma k} spelled in the already-proved carrier recurrenceIncrement,
they read
sigmabar_m sigmabar_n^{-1}
<= 1 + recurrenceIncrement c_star gamma n m * (sigmabar_n^{-1})^2
+ E_rec gamma ,
sigmabar_n sigmabar_m^{-1}
<= 1 - recurrenceIncrement c_star gamma n m * (sigmabar_n^{-1})^2
+ F_rec (m - n)^2 (sigmabar_n^{-1})^4 3^{4 gamma m}
+ E_rec gamma ,
with E_rec =^2 |log gamma|^2 and F_rec = C the manuscript's own constants.
The immediately following lemma l.integrate.approx.recurrence is already
available here as
Provider.Diffusivity.RecurrenceIntegration.integrate_approx_recurrence_cstarPlus.
It does not consume the displays in the printed ratio form: its hupper
(e.assump.upper) and hlower (e.assump.lower.modified) binders are the
displays after multiplication by sigmabar_n respectively sigmabar_m, and
its lower binder carries the additive error against sigmabar_n, whereas the
printed lower display carries it against sigmabar_m.
This module performs that transport. The quotient bound is taken from the
induction hypothesis S(m_0, E) alone -- specifically from its first clause
e.shom.h.bounds, through the proved
Provider.Multiscale.sigmaBar_le_four_mul_rpow_mul_sigmaBar -- so the forward
display is not needed to produce it.
What is realized, and at which carrier #
Everything is stated at the genuine running diffusivity
Algsuperdiff.Section3.Annealed.sigmaBar M, at the genuine disorder constant
Algsuperdiff.Section3.Disorder.cstar M, at M.gamma, and against the exact
binder shapes of integrate_approx_recurrence_cstarPlus. No abstract sequence
stands in for sigmabar, and the increment is the proved
recurrenceIncrement, i.e. the manuscript's
(log 3) c_star sum_{k=n+1}^{m} 3^{2 gamma k}.
What is NOT claimed #
l.approximate.recurrence.formula is not proved here, and nothing in this
file asserts it. Its whole analytic content -- the fresh-shell Dirichlet and
Neumann correctors, their Calderon-Zygmund L^8 bounds, the mesoscopic
oscillation estimate, the localized variational split, the good-event
coefficient switch and the two one-sided Jensen legs, -- is untouched.
Supplying them is exactly the missing work. Two further deviations are declared rather than hidden:
- The
m_star_starfloor is dropped. ABK26 supplies the displays only form_star_star <= n, whileintegrate_approx_recurrence_cstarPlusdemands them at every pairn <= m <= m_0. The binders here follow the consumer and impose no lower floor, so they are stronger than what delivers. This deviation is now paid, and the note above is retained only for provenance.ApproximateRecurrence.SubLandmarkDisplaysproves the two binders outright below the landmark, so a caller need supply them only form_star_star <= n. On it the plateau forces every tracked quantity to beO(gamma^2)against a binder slack ofE gamma. Seeintegrate_approx_recurrence_of_landmark_flooredthere, whose proof is a single call to the unchanged engine. - The shell budget is narrower than the source's. ABK26 allows
h <= 6 c_star gamma^{-1}; the consumer's range is(m : real) <= (n : real) + c_star gamma^{-1}. The narrower range is a weaker hypothesis here, so this direction costs nothing; it is recorded because the constant36below is computed on it.
References #
- ABK26,
l.approximate.recurrence.formula, statement,e.what.do.we.have, proof. - ABK26,
l.integrate.approx.recurrence;e.assump.upperande.assump.lower.modified. - ABK26,
d.mathcalS.defande.shom.h.bounds. - ABK26,
c_star <= 1and (the running-diffusivity comparison at constant4).
The two printed displays, transported #
Line 1 of e.what.do.we.have, multiplied by sigmabar_n.
The conclusion is verbatim the hupper binder of
integrate_approx_recurrence_cstarPlus
(e.assump.upper) at E := Erec, s := fun k => (sigmaBar M k : real),
cstar := cstar M and gamma := M.gamma.
Line 2 of e.what.do.we.have, multiplied by sigmabar_m and renormalized
against sigmabar_n.
The conclusion is verbatim the hlower binder of
integrate_approx_recurrence_cstarPlus
(e.assump.lower.modified) at E := K * Erec and F := Frec.
Nothing else changes; in particular the signed increment and the quadratic
h^2 term are untouched.