Lemma 10.3, p. 28 — if Z_n → τ with Z_n > 0 and X_n/Z_n →p λ > 0, then X_n →p λτ
ProvedRecMarkovGraph.IndepLB.lemma_10_3convergence-in-probabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1slutsky
Let be a sequence of positive reals converging to , and let be random variables on one probability space such that in probability for some constant . Then in probability: for every ,
This special case of Slutsky's theorem converts the concentration of into that of .
Differences from the source:
- encoding: →p (convergence in probability, p. 4); random variables → ∀ ε > 0, Tendsto (fun n => P{|· − c| ≤ ε}) atTop (𝓝 1); Measurable (X n); λ is named lam; reason: the paper's own definition; λ is reserved in Lean
Preamble
import Mathlib import Definitions.Def_RecMarkovGraph_IndepLB_Model
Formal statement
namespace RecMarkovGraph.IndepLB
open MeasureTheory Filter Topology
theorem lemma_10_3 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
(X : ℕ → Ω → ℝ) (hXm : ∀ n, Measurable (X n)) (Z : ℕ → ℝ) (hZ : ∀ n, 0 < Z n)
(τ : ℝ) (hZτ : Tendsto Z atTop (𝓝 τ)) (lam : ℝ) (hlam : 0 < lam)
(hconv : ∀ ε : ℝ, 0 < ε →
Tendsto (fun n => P.real {ω | |X n ω / Z n - lam| ≤ ε}) atTop (𝓝 1)) :
∀ ε : ℝ, 0 < ε →
Tendsto (fun n => P.real {ω | |X n ω - lam * τ| ≤ ε}) atTop (𝓝 1) := by sorry
end RecMarkovGraph.IndepLB
Source
Gupte, Zhu, Large independent sets in recursive Markov random graphs, arXiv:2207.04514v4, p. 28, Lemma 10.3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.