Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.6.3 — the extremal characterization of discrete ergodic flows

Proved
PalmQueueing.Ergodic.extremal_discrete

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

ergodic-theorypalm-calculuspoint-processprobability

Theorem 1.6.3 (Extremal properties of ergodic flows). (PN0,θ)(P^0_N, \theta)(PN0​,θ) is ergodic if and only if there exists no decomposition

PN0=α1Q1+α2Q2,α1+α2=1, α1>0, α2>0,(1.6.4)P^0_N = \alpha_1 Q_1 + \alpha_2 Q_2, \qquad \alpha_1 + \alpha_2 = 1, \ \alpha_1 > 0, \ \alpha_2 > 0, \tag{1.6.4}PN0​=α1​Q1​+α2​Q2​,α1​+α2​=1, α1​>0, α2​>0,(1.6.4)

where Q1Q_1Q1​ and Q2Q_2Q2​ are θ\thetaθ-invariant probabilities with Q1≠Q2Q_1 \ne Q_2Q1​=Q2​.

Ergodicity is an extremality property: the ergodic invariant measures are exactly the extreme points of the convex set of invariant probabilities. That is what makes "ergodic" the right notion of indecomposability and why the ergodic decomposition theorem looks the way it does.

The book quotes this rather than proving it: "For a proof, see Billingsley (1965), pp. 38-39."

Stated as an equivalence whose right-hand side is a negation — the absence of a decomposition. Stating only that an ergodic flow admits no decomposition would drop the half used in practice.

Formalization Note. A discrete flow is, by the book's definition on p.46, "a bijective and measurable map from Ω\OmegaΩ to itself, which preserves P0P^0P0"; the statement carries Function.Bijective θ alongside Mathlib's Ergodic θ P0 (measure preserving and pre-ergodic).

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

namespace PalmQueueing.Ergodic

open MeasureTheory
open PalmQueueing.Palm

variable {Ω : Type*} [MeasurableSpace Ω]

/-- **Theorem 1.6.3 (Extremal properties of ergodic flows)** (p.48). `(P⁰_N, θ)` is ergodic if and
only if there exists **no** decomposition

`(1.6.4)  P⁰_N = α₁Q₁ + α₂Q₂,  α₁ + α₂ = 1, α₁ > 0, α₂ > 0`,

where `Q₁` and `Q₂` are `θ`-invariant probabilities with `Q₁ ≠ Q₂`.

Ergodicity is an **extremality** property: the ergodic invariant measures are exactly the extreme
points of the convex set of invariant probabilities. That is what makes "ergodic" the right notion
of indecomposability, and it is why the ergodic decomposition theorem looks the way it does.

The book quotes this result rather than proving it: "For a proof, see Billingsley (1965),
pp. 38-39."

The statement is an equivalence, and its right-hand side is a **negation** — the absence of a
decomposition. Stating only that an ergodic flow admits no decomposition would drop the half that
is used in practice.

`hbij` is the book's definition of a discrete flow (p.46). -/
theorem extremal_discrete (P0 : Measure Ω) [IsProbabilityMeasure P0]
    (θ : Ω → Ω) (hθ : Measurable θ) (hbij : Function.Bijective θ) (hinv : Measure.map θ P0 = P0) :
    Ergodic θ P0 ↔ ¬ HasInvariantDecomposition θ P0 := by sorry

end PalmQueueing.Ergodic
Source
Baccelli & Bremaud, Elements of Queueing Theory: Palm Martingale Calculus and Stochastic Recurrences, 2nd ed., Springer 2003, p. 48, Theorem 1.6.3
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