Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10.3, p. 28 — if Z_n → τ with Z_n > 0 and X_n/Z_n →p λ > 0, then X_n →p λτ

Proved
RecMarkovGraph.IndepLB.lemma_10_3

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

convergence-in-probabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1slutsky

Let (Zn)(Z_n)(Zn​) be a sequence of positive reals converging to τ\tauτ, and let X1,X2,…X_1,X_2,\dotsX1​,X2​,… be random variables on one probability space such that Xn/Zn→λX_n/Z_n\to\lambdaXn​/Zn​→λ in probability for some constant λ>0\lambda>0λ>0. Then Xn→λτX_n\to\lambda\tauXn​→λτ in probability: for every ε>0\varepsilon>0ε>0,

lim⁡n→∞P{∣Xn−λτ∣≤ε}=1.\lim_{n\to\infty}\mathbb P\{|X_n-\lambda\tau|\le\varepsilon\}=1 .n→∞lim​P{∣Xn​−λτ∣≤ε}=1.

This special case of Slutsky's theorem converts the concentration of Sn/ESnS_n/\mathbb E S_nSn​/ESn​ into that of Sn/log⁡nS_n/\log nSn​/logn.

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
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me