Crossing envelope: probability that the negative maximum of a field-interface field exceeds a level on a block
ProvedG26.FI.cross_envThroughout, is a compact convex nonempty body with affine dimension and normalized relative volume (Hausdorff measure of dimension , conditioned on ). On a probability space with sub--algebras , increasing for , the random affine field () has -measurable , , and are -measurable alive events with . Write and . The field interface asks that be a.s. bounded on , that a.s., and that for and , almost surely on ,
Assume holds (nonnegative drift) with . Let , , , , , , and let satisfy . Fix , and . Let be the field frozen at its first crossing after , i.e. at the survival rule . Let bound , and let bound . Then
The negative integral moment of the frozen field satisfies the linear recurrence (G.490) from time onward; Markov's inequality at the deterministic endpoint , applied to the frozen negative maximum, controls the first crossing as in (G.423). Lemma J.11 converts the integral moment into the maximum on . This is the block-crossing bound used for the windows in Lemmas G.22, G.28 and G.29.
Formalization Note Hneg k b B is the particular-solution constant of the negative recurrence; rounds are 0-based.
import Mathlib
import Definitions.Def_IAFTRL_LinEnv
import Definitions.Def_IAFTRL_GIAFTRL
import Definitions.Def_IAFTRL_G26_body
import Definitions.Def_IAFTRL_G26_run
import Definitions.Def_IAFTRL_G26_window
open MeasureTheory ProbabilityTheory Set IAFTRL Matrix J11
open G26
variable {d : ℕ} {Ω : Type*}
variable {D : Set (Fin d → ℝ)} [mΩ : MeasurableSpace Ω] {μ : Measure Ω}
{F : ℕ → MeasurableSpace Ω} {T : ℕ} {V : ℕ → Ω → (Fin d → ℝ)} {c : ℕ → Ω → ℝ}
{J : ℕ → Set Ω} {β : ℕ → ℝ} {B lo hi : ℝ} {m0 : ℕ}theorem G26.FI.cross_env [IsProbabilityMeasure μ] (I : FI D μ F T V c J β B 0 hi m0) (hhi : 0 ≤ hi)
{k : ℕ} (hk : 2 ≤ k) (hjP : rdim D ≤ 4 * k) (hB : 2 ^ 20 * (4 * k : ℝ) ≤ B) {b : ℝ}
(hb : 0 ≤ b) (hβ1 : ∀ n, 1 ≤ β n) (hβb : ∀ n, β n ^ 2 ≤ b ^ 2 * ((n : ℝ) + 1)) {W : ℕ}
(hW : 1 + 1024 * (4 * k : ℝ) ^ 2 / B ≤ W) {v N m : ℕ} (hm0 : m0 ≤ m) (hmN : m ≤ N)
(hN : N ≤ T) {lam ρ : ℝ} (hlam : 1 ≤ lam) (hlρ : lam ≤ ρ) {pA F0 : ℝ}
(hpA : μ.real {ω | ρ < absMax D (frz V (crossA D V c J v lam) N ω)
(frz c (crossA D V c J v lam) N ω)} ≤ pA)
(hF0 : ∫ ω, Ff D (frz V (crossA D V c J v lam)) (frz c (crossA D V c J v lam)) (4 * k) m ω ∂μ
≤ F0) :
μ.real {ω | ∃ s, v ≤ s ∧ s ≤ N ∧ ω ∈ J s ∧ lam < negMax D (V s ω) (c s ω)} ≤
pA + 2 ^ (4 * k) * 4 ^ rdim D * (ρ / lam) ^ rdim D / lam ^ (4 * k) *
(Hneg k b B * ((N : ℝ) + 1) ^ (3 * k) + (((N : ℝ) + 1) / ((m : ℝ) + 1)) ^ W * F0) := by sorry