Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic

ShomContinuityArithmetic #

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

The model-free arithmetic layer of shom_continuity #

This module is the arithmetic support of Algsuperdiff/Section3/Provider/Localization/ShomContinuity.lean. The split itself was pure motion: every statement and every proof arrived as the text that stood in ShomContinuity.lean, unchanged apart from private lemma becoming protected theorem. Nothing was strengthened, renamed, added or dropped.

That pass rewrote proof bodies only: all twenty-nine nlinarith closers were replaced by explicit calc chains, monotonicity lemmas (mul_le_mul_of_nonneg_*, pow_le_pow_left₀, one_le_pow₀, le_mul_of_one_le_right) and named factored-nonnegativity haves discharged by linarith only, and every remaining unqualified linarith was given an explicit hypothesis list. The twenty-three statements are byte-identical to the pre-pass text and no declaration was added, renamed or removed; warm own-file elaboration fell from 10.2 s to 3.6 s (interpretation 11.7 s to 2.6 s).

What is here #

Two groups, in the order they stood in the original file.

No renormalization, probabilistic or geometric object occurs anywhere below; no ABKModel, no Annealed.sigmaBar, no scale. The five model-level private lemmas of the continuity route (near_flow_bound, near_recurrence_bound, window_binders, slack_bounds, defect_display) stayed in ShomContinuity.lean and are not duplicated here.

References #

Abstract-real arithmetic #

Every lemma in this section is over abstract reals; none of them contains a Real.rpow, Real.exp or Real.log atom, so the arithmetic tactics never meet a transcendental.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.abs_ratio_defect_le {a b u v : ℝ} (ha : 0 < a) (hb : 0 < b) (hu : 0 ≤ u) (hv : 0 ≤ v) (hab : a ≤ (1 + u) * b) (hba : b ≤ (1 + v) * a) :
|a / b - 1| + |b / a - 1| ≤ 2 * u + 2 * v

Two-sided ratio defect from the two one-sided caps: if a <= (1+u) b and b <= (1+v) a with u, v >= 0, both ratio defects are at most u + v.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.ratio_defect_le_of_relative {a b A B x delta : ℝ} (ha : 0 < a) (hb : 0 < b) (hdelta1 : delta ≤ 1 / 2) (hx0 : 0 ≤ x) (hx1 : x ≤ 1 / 8) (hfa : |a - A| ≤ delta * a) (hfb : |b - B| ≤ delta * b) (hBA : B ≤ A) (hAB : A ≤ (1 + 4 * x) * B) :
|a / b - 1| + |b / a - 1| ≤ 8 * x + 24 * delta

The short-range core of branch (B). Two positive reals a, b approximating two reals A, B with the same relative accuracy delta <= 1/2, whose targets are ordered B <= A <= (1 + 4x) B with 0 <= x <= 1/8, have two-sided ratio defect at most 8x + 24 delta.

This is the arithmetic read off the flow display rather than off the recurrence display: delta is the flow's relative defect and 4x the geometric growth of the target profile across the gap.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.ratio_defect_le_of_caps {sm sn ai qq u : ℝ} (hsm : 0 < sm) (hsn : 0 < sn) (hu0 : 0 ≤ u) (hu : u ≤ 1 / 2) (hai0 : 0 ≤ ai) (hqq0 : 0 ≤ qq) (hup : sm ≤ (1 + u) * sn + ai * sn) (hlo : (1 - u) * sn + ai * sm - qq * sm ≤ sm) :
|sm / sn - 1| + |sn / sm - 1| ≤ 6 * u + 2 * ai + 4 * qq

The two-sided defect from the two recurrence binders (branch (C)), over abstract reals: u is the flat slack, ai the relative increment A_{n,m} shom_n^{-2} and qq the relative quadratic remainder.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.increment_ratio_le {A cs L dmn P T g x sn : ℝ} (hcs : 0 < cs) (hg : 0 < g) (hP : 0 < P) (hT0 : 0 < T) (hT : T ≤ 27) (hL0 : 0 ≤ L) (hL : L ≤ 2) (hdmn : 0 ≤ dmn) (hA : A ≤ cs * L * dmn * (P * T)) (hlow : 1 / 4 * (cs * g⁻¹ * P) ≤ sn ^ 2) (hx : x = g * dmn) :
A * sn⁻¹ ^ 2 ≤ 216 * x

The increment leg of the computation. With P = 3^{2 cgamma n} and T = 3^{2 cgamma (m-n)} <= 27, the lower envelope shom_n^2 >= (1/4) cstar cgamma^{-1} P turns A_{n,m} <= cstar L (m-n) P T into A_{n,m} shom_n^{-2} <= 216 cgamma (m-n).

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.quad_ratio_le {F cs g P T dmn x sn : ℝ} (hcs : 0 < cs) (hg : 0 < g) (hP : 0 < P) (hT0 : 0 < T) (hT : T ≤ 27) (hF : 1 ≤ F) (hdmn : 0 ≤ dmn) (hlow : 1 / 4 * (cs * g⁻¹ * P) ≤ sn ^ 2) (hx : x = g * dmn) (hxcs : x ≤ cs ^ 2 / 2) :
F * dmn ^ 2 * sn⁻¹ ^ 4 * (P * T * (P * T)) ≤ 5832 * F * x

The quadratic leg of the computation. The gate cgamma (m-n) <= cstar^2 / 2 of branch (C) is what converts the quadratic remainder's (cgamma (m-n))^2 cstar^{-2} into a linear cgamma (m-n).

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.growth_from_sq {sm sn t Dm Dn : ℝ} (hsn : 0 < sn) (ht : 1 ≤ t) (hup : sm ^ 2 ≤ 4 * Dm) (hcomp : Dm ≤ t * t * Dn) (hlo : 1 / 4 * Dn ≤ sn ^ 2) :
sm ≤ 4 * t * sn

The growth cap from the squared envelope comparison.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.collapse_of_growth {sm sn t : ℝ} (hsn : 0 < sn) (hgrow : sm ≤ 4 * t * sn) (ht3 : t ≤ 3) :
sm / sn ≤ 12

The short-range collapse of the growth cap.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.profile_growth {nu2 c g x : ℝ} (hnu2 : 0 ≤ nu2) (hc : 0 ≤ c) (hx : 0 ≤ x) (hg : g ≤ 1 + 8 * x) :
nu2 + c * g ≤ (1 + 4 * x) ^ 2 * (nu2 + c)

The geometric growth of the target profile nu^2 + c 3^{2 cgamma k}, once the geometric factor has been linearised.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.defect_le_cstar_sq {sg Ev cs Cf : ℝ} (hE : 1 ≤ Ev) (hgate : Ev ^ 4 * sg ≤ 16) (hcs0 : 0 < cs) (hCf : 1 ≤ Cf) (hCE : 32 * Cf * cs⁻¹ ≤ Ev) :
Cf * cs⁻¹ * Ev * sg ≤ cs ^ 2 / 2

The delta gate. Under 32 Cflow cstar^{-1} <= E, 1 <= Cflow and the E^4 gate, the flow's relative defect is below cstar^2 / 2. This is the sharpening records: it is what removes the manuscript's medium band and keeps the constant dimension-only.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.flat_master {sg Ev : ℝ} (hE : 1 ≤ Ev) (hsg0 : 0 ≤ sg) (hgate : Ev ^ 4 * sg ≤ 16) :
Ev ^ 2 * sg ^ 2 * Ev ≤ 256

The master smallness of the printed flat entry: Es E <= 256 where Es = E^2 sg^2.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.flat_small {Es Ev K c : ℝ} (hE0 : 0 < Ev) (hmaster : Es * Ev ≤ 256) (hK0 : 0 ≤ K) (hc0 : 0 ≤ c) (hKE : 256 * K * c ≤ Ev) :
c * (K * Es) ≤ 1

Any dimension-only multiple of the flat entry is small at a large E.

g <= 1/1024 from the cgamma-gate at E >= 2.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.le_flat {g Ev L : ℝ} (hg0 : 0 ≤ g) (hE : 1 ≤ Ev) (hL : 1 ≤ L) :
g ≤ Ev ^ 2 * (g * L ^ 2)

g <= E^2 (g L^2) when 1 <= E and 1 <= L: the printed entry dominates cgamma itself.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.sq_half_le {cs : ℝ} (hcs0 : 0 < cs) (hcs32 : cs ≤ 3 / 2) :
cs ^ 2 / 2 ≤ cs

cstar^2 / 2 <= cstar in the repository's range cstar <= 3/2.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.flow_regroup {a Cflow Cf ci Ev r q s : ℝ} (h : a ≤ Cflow * ci * Ev * r * q * s) (hCC : Cflow ≤ Cf) (hci : 0 ≤ ci) (hEv : 0 ≤ Ev) (hr : 0 ≤ r) (hq : 0 ≤ q) (hs : 0 ≤ s) :
a ≤ Cf * ci * Ev * (r * q) * s

Regrouping of the flow display at one scale, with the constant enlarged to max 1 Cflow.

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.display_of_far {S Xv t C : ℝ} (hS : S ≤ 8 * t) (hXv : 1 / 8 ≤ Xv) (ht : 1 ≤ t) (hC : 64 ≤ C) :
S ≤ C * min 1 Xv * t

Assembly of the display in the far branch (A).

theorem Algsuperdiff.Section3.Provider.Localization.ShomContinuityArithmetic.display_of_bound {S X t C : ℝ} (hS : S ≤ C * X) (hX0 : 0 ≤ X) (hone : X ≤ 1) (ht : 1 ≤ t) (hC0 : 0 ≤ C) :
S ≤ C * min 1 X * t

Assembly of the display in the near branches (B) and (C), from a bound at the min-entry itself.

Abstract-real core of the exponential's tangent bound. From (1 - u) X <= 1 with 0 <= u <= 1/2, cancel the positive factor 1 - u against (1 - u)(1 + 2u) = 1 + u - 2u^2 >= 1 (X need not be nonnegative). Applied at X := Real.exp (4 z), u := 4 z, it keeps Real.exp out of every nonlinear tactic goal in rpow_three_two_mul_le.

The three transcendental estimates #

Each is a consequence of Real.add_one_le_exp or Real.log_le_sub_one_of_pos; they are isolated here so that no nlinarith ever meets a transcendental. Since the elaboration pass this file contains no nlinarith at all, and every linarith in it is an only-form with an explicit hypothesis list, so no rpow-laden context is preprocessed into products anywhere below. The only nlinarith on the route is in the consumer ShomContinuity.lean, the only-form of near_recurrence_bound on three cstar facts. linarith in the consumer does meet Real.exp, Real.log and Real.rpow, but only as opaque atoms and monomials in them (the earlier unqualified claim, that no arithmetic tactic there sees them in a nonlinear position, was false as stated).

3^{2z} <= 1 + 8z for 0 <= z <= 1/8, from log 3 <= 2 and exp u <= (1-u)^{-1}.

|log g| <= 16 v^{-1} with v = g^{1/16}, written with iterated square roots so that no Real.rpow occurs.

The cgamma-gate at the sharp exponent. Under 1 <= E and cgamma <= E^{-10}, E^4 cgamma^{1/2} |log cgamma| <= 16. Every comparison is an integer power: v := g^{1/16} is four square roots, |log g| <= 16 v^{-1}, sqrt g = v^8, and (E^4 v^7)^{16} = E^{64} g^7 <= E^{64} E^{-70} <= 1.

1 <= |log g| for 0 < g <= 1/3.