Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(1.4.8) — the integer-time skeleton converges almost surely and in mean

Proved
KingmanSubadditive.Continuous.skeleton_limit

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

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

Let xxx satisfy the hypotheses of Theorem 4, and let γ\gammaγ be its continuous-time mean rate. There is an integrable real random variable ξ\xiξ such that

x0nn⟶ξalmost surely and in L1(P),E(ξ)=γ,\frac{x_{0n}}{n}\longrightarrow\xi\quad\text{almost surely and in }L^1(P), \qquad E(\xi)=\gamma,nx0n​​⟶ξalmost surely and in L1(P),E(ξ)=γ,

as the positive integers nnn tend to infinity. This is the result for the integer-time skeleton that Theorem 4 extends to all real times.

Formalization Note The value of the sequence at n=0n=0n=0 is irrelevant to the limit; the statement is about the real-time process sampled at integer times, not a general discrete subadditive theorem.

Preamble
import Mathlib
import Definitions.Def_KingmanSubadditive_Continuous_Process
Formal statement
namespace KingmanSubadditive.Continuous

open MeasureTheory Filter Topology

/-- Kingman, §1.4, proof of Theorem 4, (1.4.8), p. 889. This is the
integer-time skeleton of the continuous process, using the continuous
γ from (1.4.1), not a general restatement of Theorem 1. -/
theorem skeleton_limit {S : Type*} [MeasurableSpace S]
    (P : Measure S) [IsProbabilityMeasure P]
    (x : ℝ → ℝ → S → ℝ)
    (hproc : IsProcess P x) (hsep : IsSeparable P x)
    (a b : ℝ) (ha : 0 ≤ a) (hab : a < b)
    (hosc : FiniteOscillation P x (Set.Icc a b)) :
    ∃ ξ : S → ℝ, Integrable ξ P ∧
      (∀ᵐ ω ∂P, Tendsto (fun n : ℕ => x 0 n ω / (n : ℝ)) atTop (𝓝 (ξ ω))) ∧
      Tendsto (fun n : ℕ => ∫ ω, |x 0 n ω / (n : ℝ) - ξ ω| ∂P)
        atTop (𝓝 0) ∧
      (∫ ω, ξ ω ∂P) = gamma P x := by sorry

end KingmanSubadditive.Continuous
Source
Kingman, Subadditive ergodic theory, Ann. Probab. 1(6):883–899 (1973), DOI 10.1214/aop/1176996798, p. 889, §1.4, proof of Theorem 4, (1.4.8)
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