OAI/Probability/SLE/Gauge/ActualRibbonIteration.lean
4 declarations, 0 contain sorry, 0 declared as axioms
Iteration along the actual global integer fronts. Previous successes supply admissibility; no independence or deterministic completion bound is required on failed samples.
- def
OAI.SLEExactGauge.ribbonIntegerFrontline 20 - lemma
OAI.SLEExactGauge.ribbonIntegerFront_monotoneline 23 - def
OAI.SLEExactGauge.actualRibbonSuccessline 30 - theorem
OAI.SLEExactGauge.actual_ribbon_successes_lower_boundline 37Source documentation
Actual fronts turn the quantitative step estimate into a product lower bound for the exact physical passage-and-mass events.
theorem actual_ribbon_successes_lower_bound {Ω : Type*} [mΩ : MeasurableSpace Ω] (μ : Measure Ω) (ℱ : Filtration ℝ≥0 mΩ) (γ : Ω → ℝ≥0 → ℂ) (ha : Adapted ℱ (fun t ω => γ ω t)) (hc : ∀ ω, Continuous (γ ω)) (g : C(ℂ, ℝ)) (hg0 : ∀ ω, g (γ ω 0) = 0) (P : ℂ → ℂ) (hemb : Topology.IsClosedEmbedding (fun z : closedRibbon => P z)) (ε κ v c : ℝ) (q : ℝ≥0∞) (hstep : ∀ (n : ℕ) (A : Set Ω), MeasurableSet[(ribbonFrontStop_stopping ℱ g γ ha hc ((n : ℝ) + 1)).measurableSpace] A → A ⊆ GoodRibbonPrefix γ (ribbonIntegerFront g γ n) P ε → q * μ A ≤ μ (A ∩ actualRibbonSuccess γ g P ε κ v c n)) : ∀ N : ℕ, q ^ N * μ (GoodRibbonPrefix γ (ribbonIntegerFront g γ 0) P ε) ≤ μ (GoodRibbonPrefix γ (ribbonIntegerFront g γ 0) P ε ∩ …Mentions: OAI.SLEExactGauge.ribbonFrontStop_stopping, OAI.SLEExactGauge.GoodRibbonPrefix, OAI.SLEExactGauge.ribbonIntegerFront, OAI.SLEExactGauge.actualRibbonSuccess