While this submission is a draft, it cannot be used by other submissions.

Kingman's subadditive ergodic theorem

Lax606786.KingmanTheorem · concepts/Lax606786/KingmanTheorem.lean · lax-606786

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    Let σ\sigma be an ergodic measure-preserving transformation of a probability space (Ω,μ)(\Omega, \mu) and (fn)(f_n) a subadditive family over σ\sigma with f1+f_1^+ integrable. Let LμL_\mu denote the lower integral. Then there is a constant C∈[−∞,∞)C \in [-\infty, \infty) with

    C=lim⁡nLμ(fn/n)=inf⁡n≥1Lμ(fn/n)C = \lim_n L_\mu(f_n/n) = \inf_{n \ge 1} L_\mu(f_n/n)

    such that 1nfn(ω)→C\tfrac1n f_n(\omega) \to C for μ\mu-a.e. ω\omega. Limits are taken in the extended reals. When the fnf_n are integrable, Lμ(fn/n)=1n∫fn dμL_\mu(f_n/n) = \tfrac1n \int f_n \, d\mu.

    The theorem is due to Kingman (1968); the proof follows Steele (1989).

    Concept map
    3 concepts; 1 descendant hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    In the paper

    • page 6 of this submission's paper

    Lean source view on GitLab

    1import Lax606786.SubadditiveFamilies
    2import Lax606786.LowerIntegrals
    3import Mathlib.Dynamics.Ergodic.Ergodic
    4import Mathlib.MeasureTheory.Function.L1Space.Integrable
    5
    6/-!
    7---
    8title: Kingman's subadditive ergodic theorem
    9type: theorem
    10---
    11Let σ\sigma be an ergodic measure-preserving transformation of a probability space
    12(Ω,μ)(\Omega, \mu) and (fn)(f_n) a subadditive family over σ\sigma with f1+f_1^+ integrable. Let LμL_\mu
    13denote the lower integral. Then there is a constant C∈[−∞,∞)C \in [-\infty, \infty) with
    14C=lim⁡nLμ(fn/n)=inf⁡n≥1Lμ(fn/n)C = \lim_n L_\mu(f_n/n) = \inf_{n \ge 1} L_\mu(f_n/n)
    15such that 1nfn(ω)→C\tfrac1n f_n(\omega) \to C for μ\mu-a.e. ω\omega. Limits are taken in the extended
    16reals. When the fnf_n are integrable, Lμ(fn/n)=1n∫fn dμL_\mu(f_n/n) = \tfrac1n \int f_n \, d\mu.
    17
    18The theorem is due to Kingman (1968); the proof follows Steele (1989).
    19-/
    20
    21namespace Lax606786.KingmanTheorem
    22
    23open MeasureTheory Filter Topology
    24open Lax606786.SubadditiveFamilies Lax606786.LowerIntegrals
    25
    26variable {Ω : Type*} [MeasurableSpace Ω]
    27
    28/-- Kingman's theorem: `f_n / n` converges almost everywhere to the constant
    29`C = lim L_μ(f_n / n) = inf L_μ(f_n / n) ∈ [-∞, ∞)`. -/
    30axiom kingman (μ : Measure Ω) [IsProbabilityMeasure μ] (σ : Ω → Ω) (hσ : Ergodic σ μ)
    31 (f : ℕ → Ω → ℝ) (hf : IsSubadditiveFamily σ f)
    32 (h1 : Integrable (fun ω => max (f 1 ω) 0) μ) :
    33 ∃ C : EReal, C < ⊤ ∧
    34 (∀ᵐ ω ∂μ, Tendsto (fun n => (f n ω / n : EReal)) atTop (𝓝 C)) ∧
    35 (∀ n : ℕ, 1 ≤ n → C ≤ lowerIntegral μ (fun ω => f n ω / n)) ∧
    36 Tendsto (fun n : ℕ => lowerIntegral μ (fun ω => f n ω / n)) atTop (𝓝 C)
    37
    38end Lax606786.KingmanTheorem
    39
    Show Proof

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…