Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1: finite limit almost surely and in mean, with E(ξ) = γ

Proved
KingmanSubadditive.Ergodic.theorem_1

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

ergodic-theorylimit-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1subadditive-ergodic-theorem

Let x=(xst)s<tx=(x_{st})_{s<t}x=(xst​)s<t​ be a subadditive process on a probability space (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P), satisfying S₁, full joint stationarity S₂, and S₃. There is an integrable real random variable ξ\xiξ for which

x0t(ω)t⟶ξ(ω)for P-almost every ω,\frac{x_{0t}(\omega)}{t}\longrightarrow\xi(\omega)\quad\text{for }P\text{-almost every }\omega,tx0t​(ω)​⟶ξ(ω)for P-almost every ω, ∫Ω∣x0tt−ξ∣ dP⟶0,\int_\Omega\left|\frac{x_{0t}}{t}-\xi\right|\,dP\longrightarrow0,∫Ω​​tx0t​​−ξ​dP⟶0,

and

EP(ξ)=γ(x)=inf⁡u≥1EP(x0u)u.E_P(\xi)=\gamma(x)=\inf_{u\ge1}\frac{E_P(x_{0u})}{u}.EP​(ξ)=γ(x)=u≥1inf​uEP​(x0u​)​.

This is Kingman's finite subadditive ergodic theorem. It gives the long-run growth rate even when the shift is not ergodic and the limit is therefore random.

Formalization Note Time is discrete and nonnegative. The limit is real valued; the distinct case allowing a limit of −∞-\infty−∞ is Theorem 2, outside this mission.

Preamble
import Mathlib
import Definitions.Def_KingmanSubadditive_Ergodic_Process
Formal statement
namespace KingmanSubadditive.Ergodic

open MeasureTheory Filter Topology

/-- Kingman, *Subadditive ergodic theory*, Ann. Probab. 1(6):883–899 (1973),
p. 885, Theorem 1, (1.2.1)–(1.2.2). `IsSubadditiveProcess` contains the
§1.1 standing conditions S₁, full joint-law stationarity S₂, and S₃.
The limit is real and integrable; convergence in mean is the `L¹`
conjunct, distinct from almost-sure convergence. -/
theorem theorem_1 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (x : ℕ → ℕ → Ω → ℝ)
    (hx : IsSubadditiveProcess P x) :
    ∃ ξ : Ω → ℝ, Integrable ξ P ∧
      (∀ᵐ ω ∂P, Tendsto (fun t : ℕ => x 0 t ω / (t : ℝ)) atTop (𝓝 (ξ ω))) ∧
      Tendsto (fun t : ℕ => ∫ ω, |x 0 t ω / (t : ℝ) - ξ ω| ∂P) atTop (𝓝 0) ∧
      ∫ ω, ξ ω ∂P = gamma P x := by sorry

end KingmanSubadditive.Ergodic
Source
Kingman, Subadditive ergodic theory, Ann. Probab. 1(6):883–899 (1973), DOI 10.1214/aop/1176996798, p. 885, Theorem 1, (1.2.1)–(1.2.2)
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