Proof of Theorem (4.4), p. 29 — lim inf (Z_1 + ⋯ + Z_n)/n ≥ Σ_{k=1}^∞ ν^k a.e. (Fatou)
ProvedSolomonRWRE.DiffEq.proof_4_4_liminffatou-lemmap2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1random-difference-equation
Let be i.i.d. nonnegative random variables with mean and let solve (4.1). Then almost surely
in .
When the right side is , which is the second case of Theorem (4.4); when it equals and gives the lower half of the first case.
Formalization Note No hypothesis on is made, as on the page. The series is written as in , and the averages are mapped to , which loses nothing since .
Preamble
import Mathlib import Definitions.Def_SolomonRWRE_DiffEq_System open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace SolomonRWRE.DiffEq
/-- **Proof of Theorem (4.4), p. 29** (unnumbered): a.e.
`lim inf_{n→∞} (Z_1 + ⋯ + Z_n)/n ≥ Σ_{k=1}^∞ ν^k` (by Fatou's lemma); this proves (4.4) when
`ν ≥ 1`.
**Formalization Note.** In `[0, ∞]`; the series `Σ_{k≥1} ν^k` is the `tsum` of `ν^(k+1)`
over `k : ℕ` (index shift), and equals `∞` when `ν ≥ 1`. No hypothesis on `ν`, as on the
page. -/
theorem proof_4_4_liminf {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
[IsProbabilityMeasure P] (σ : ℕ → Ω → ℝ) (hσ : IsIIDNonneg P σ) :
∀ᵐ ω ∂P, ∑' k : ℕ, nu P σ ^ (k + 1) ≤
liminf (fun n : ℕ => ENNReal.ofReal ((∑ m ∈ Finset.Icc 1 n, Z σ m ω) / n)) atTop := 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), second display (unnumbered)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.