Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.6.5 — the extremal characterization of continuous ergodic flows

Proved
PalmQueueing.Ergodic.extremal_flow

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

ergodic-theorypalm-calculuspoint-processprobability

Theorem 1.6.5 (Extremal property of ergodic flows). (P,{θt})(P,\{\theta_t\})(P,{θt​}) is ergodic if and only if there exists no decomposition

P=β1P1+β2P2,β1+β2=1, β1>0, β2>0,(1.6.6)P = \beta_1 P_1 + \beta_2 P_2, \qquad \beta_1 + \beta_2 = 1, \ \beta_1 > 0, \ \beta_2 > 0, \tag{1.6.6}P=β1​P1​+β2​P2​,β1​+β2​=1, β1​>0, β2​>0,(1.6.6)

where P1P_1P1​ and P2P_2P2​ are, for all t∈Rt \in \mathbb{R}t∈R, θt\theta_tθt​-invariant probabilities on Ω\OmegaΩ, with P1≠P2P_1 \ne P_2P1​=P2​.

The continuous-time counterpart of Theorem 1.6.3, quoted from the same source (Cornfeld, Fomin and Sinai (1981)).

The difference from the discrete case is in the quantifier and it is not cosmetic: P1P_1P1​ and P2P_2P2​ must be invariant under every θt\theta_tθt​, not under one map. A probability invariant under a single θt0\theta_{t_0}θt0​​ need not be invariant under the flow.

Preamble
import Mathlib
import Definitions.Def_PalmQueueing_Ergodic_DiscreteFlow
Formal statement
/-!
# Theorem 1.6.5: the extremal characterization of continuous ergodic flows (§1.6.1, p.50)
-/

namespace PalmQueueing.Ergodic

open MeasureTheory
open PalmQueueing.Palm

variable {Ω : Type*} [MeasurableSpace Ω]

/-- **Theorem 1.6.5 (Extremal property of ergodic flows)** (p.50). `(P, {θ_t})` is ergodic if and
only if there exists **no** decomposition

`(1.6.6)  P = β₁P₁ + β₂P₂,  β₁ + β₂ = 1, β₁ > 0, β₂ > 0`,

where `P₁` and `P₂` are, for all `t ∈ ℝ`, `θ_t`-invariant probabilities on `Ω`, with `P₁ ≠ P₂`.

The continuous-time counterpart of Theorem 1.6.3, quoted from the same source (Cornfeld, Fomin and
Sinai (1981)).

The difference from the discrete case is in the quantifier, and it is not cosmetic: `P₁` and `P₂`
must be invariant under **every** `θ_t`, not under one map. A probability invariant under a single
`θ_{t₀}` need not be invariant under the flow. -/
theorem extremal_flow (P : Measure Ω) [IsProbabilityMeasure P]
    (θ : Flow Ω) (hinv : θ.Invariant P) :
    IsErgodicFlow θ P ↔ ¬ HasFlowInvariantDecomposition θ P := by sorry

end PalmQueueing.Ergodic
Source
Baccelli & Bremaud, Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences, 2nd ed., Springer 2003, p. 50, Theorem 1.6.5
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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