Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1, proof of Theorem (1.7), p. 5 — if α_n = 1 (α_n = 0) with positive probability but α_n > 0 (α_n < 1) for all n, case (i) (case (ii)) holds

Proved
SolomonRWRE.Recurrence.proof_1_7_boundary

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-environmentrandom-walktransience

Let (Xn)(X_n)(Xn​) be the random walk in the i.i.d. random environment α=(αn)n∈Z\alpha=(\alpha_n)_{n\in\mathbb Z}α=(αn​)n∈Z​, with σn=(1−αn)/αn\sigma_n=(1-\alpha_n)/\alpha_nσn​=(1−αn​)/αn​ and ρn=σ1⋯σn\rho_n=\sigma_1\cdots\sigma_nρn​=σ1​⋯σn​.

  1. If P(α0=1)>0P(\alpha_0=1)>0P(α0​=1)>0 and αn>0\alpha_n>0αn​>0 for all nnn, then case (i) of Theorem (1.7) holds:
∑n=1∞1nP(ρn>1)<∞andlim⁡n→∞Xn=∞  almost surely.\sum_{n=1}^\infty\frac1nP(\rho_n>1)<\infty\qquad\text{and}\qquad\lim_{n\to\infty}X_n=\infty\ \text{ almost surely.}n=1∑∞​n1​P(ρn​>1)<∞andn→∞lim​Xn​=∞  almost surely.
  1. If P(α0=0)>0P(\alpha_0=0)>0P(α0​=0)>0 and αn<1\alpha_n<1αn​<1 for all nnn, then case (ii) holds:
∑n=1∞1nP(ρn<1)<∞andlim⁡n→∞Xn=−∞  almost surely.\sum_{n=1}^\infty\frac1nP(\rho_n<1)<\infty\qquad\text{and}\qquad\lim_{n\to\infty}X_n=-\infty\ \text{ almost surely.}n=1∑∞​n1​P(ρn​<1)<∞andn→∞lim​Xn​=−∞  almost surely.

These are the boundary cases of Theorem (1.7) in which σn\sigma_nσn​ takes the value 000 or ∞\infty∞ with positive probability, which the paper treats separately from the case 0<αn<10<\alpha_n<10<αn​<1.

Formalization Note "Case (i) holds" is read as both the hypothesis and the conclusion of Theorem (1.7)(i). The nondegeneracy hypothesis is inherited from Theorem (1.7).

Preamble
import Mathlib
import Definitions.Def_SolomonRWRE_Recurrence_Model

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal
Formal statement
namespace SolomonRWRE.Recurrence

/-- Solomon, *Random Walks in a Random Environment*, Ann. Probab. 3(1) (1975), §1, proof of
Theorem (1.7), p. 5, first paragraph: "If `α_n = 1`, (`α_n = 0`), with positive probability, but
`α_n > 0`, (`α_n < 1`), for all `n`, then it is clear that case (i), (case ii), holds."

**Formalization Note.** "Case (i) holds" is stated as both the hypothesis of Theorem (1.7)(i),
`Σ n⁻¹ P(ρ_n > 1) < ∞`, and its conclusion `X_n → ∞` a.e.; symmetrically for case (ii).
"With positive probability" is stated for `α_0` (the `α_n` are identically distributed), and
"for all `n`" for every outcome. The nondegeneracy hypothesis is inherited from
Theorem (1.7). -/
theorem proof_1_7_boundary {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (α : ℤ → Ω → ℝ) (X : ℕ → Ω → ℤ) (hRW : IsRWRE P α X)
    (hnd : ¬ ∃ c : ℝ, ∀ᵐ ω ∂P, α 0 ω = c) :
    ((0 < P {ω | α 0 ω = 1} ∧ ∀ n ω, 0 < α n ω) →
        seriesGt P α ≠ ∞ ∧ ∀ᵐ ω ∂P, Tendsto (fun n => X n ω) atTop atTop) ∧
    ((0 < P {ω | α 0 ω = 0} ∧ ∀ n ω, α n ω < 1) →
        seriesLt P α ≠ ∞ ∧ ∀ᵐ ω ∂P, Tendsto (fun n => X n ω) atTop atBot) := by sorry

end SolomonRWRE.Recurrence
Source
Solomon, Random Walks in a Random Environment, Ann. Probab. 3(1):1–31 (1975), DOI 10.1214/aop/1176996444, p. 5, §1, proof of Theorem (1.7), first paragraph
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