Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem (4.4), p. 29 — Z_n ≤ S_n = Σ_{j=−∞}^n σ_j ⋯ σ_n, and S_n < ∞ a.e. when ν < 1

Proved
SolomonRWRE.DiffEq.proof_4_4_domination

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-difference-equationrandom-products

Let {σj}j∈Z\{\sigma_j\}_{j\in\mathbb Z}{σj​}j∈Z​ be i.i.d. nonnegative random variables with mean ν=E(σ)∈[0,∞]\nu=E(\sigma)\in[0,\infty]ν=E(σ)∈[0,∞], let ZnZ_nZn​ solve (4.1) with σ1,…,σn\sigma_1,\dots,\sigma_nσ1​,…,σn​, and let Sn=∑j=−∞nσj⋯σn∈[0,∞]S_n=\sum_{j=-\infty}^{n}\sigma_j\cdots\sigma_n\in[0,\infty]Sn​=∑j=−∞n​σj​⋯σn​∈[0,∞]. Then:

  1. for every n≥0n\ge0n≥0 and every outcome,
Zn=∑j=1nσj⋯σn ≤ ∑j=−∞nσj⋯σn=Sn;Z_n=\sum_{j=1}^{n}\sigma_j\cdots\sigma_n\ \le\ \sum_{j=-\infty}^{n}\sigma_j\cdots\sigma_n=S_n ;Zn​=j=1∑n​σj​⋯σn​ ≤ j=−∞∑n​σj​⋯σn​=Sn​;
  1. if ν<1\nu<1ν<1, then for every n∈Zn\in\mathbb Zn∈Z, Sn<∞S_n<\inftySn​<∞ almost surely.

The domination replaces ZnZ_nZn​, which is not stationary, by the stationary sequence SnS_nSn​, to which the ergodic theorem applies.

Formalization Note This statement is about a two-sided family (TwoSided), the page's "without loss of generality" coordinate model, not about the one-sided sequence of Theorem (4.4). The mean ν\nuν is that of σ1\sigma_1σ1​.

Preamble
import Mathlib
import Definitions.Def_SolomonRWRE_DiffEq_System
import Definitions.Def_SolomonRWRE_DiffEq_TwoSided

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace SolomonRWRE.DiffEq

/-- **Proof of Theorem (4.4), p. 29** (unnumbered): for a two-sided i.i.d. nonnegative family
`{σ_j}_{j ∈ ℤ}`, `Z_n(σ) = Σ_{j=1}^n σ_j ⋯ σ_n ≤ Σ_{j=−∞}^n σ_j ⋯ σ_n = S_n(σ)`, and
"`S_n` is finite a.e. since `ν < 1`".

**Formalization Note.** This is stated for the `ℤ`-indexed family `IsIIDNonnegZ` (the page's
"without loss of generality" coordinate model), not for the `ℕ`-indexed family of the goal;
`Z` is computed from its restriction to `ℕ` (it uses `σ_1, …, σ_n` only), and
`ν = E(σ_1)` is `nu` of that restriction. The comparison is pathwise in `[0, ∞]`
(`Z_n ≥ 0` there); the finiteness is for every `n ∈ ℤ`. -/
theorem proof_4_4_domination {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (σ : ℤ → Ω → ℝ) (hσ : IsIIDNonnegZ P σ) :
    (∀ (n : ℕ) (ω : Ω), ENNReal.ofReal (Z (fun m : ℕ => σ m) n ω) ≤ S σ n ω) ∧
    (nu P (fun m : ℕ => σ m) < 1 → ∀ n : ℤ, ∀ᵐ ω ∂P, S σ n ω < ⊤) := by sorry

end SolomonRWRE.DiffEq
Source
Solomon, Random Walks in a Random Environment, Ann. Probab. 3(1):1–31 (1975), DOI 10.1214/aop/1176996444, p. 29, proof of Theorem (4.4), third paragraph (unnumbered display and the parenthetical remark after it)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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