Theorem 1.6.5 — the extremal characterization of continuous ergodic flows
ProvedPalmQueueing.Ergodic.extremal_flowergodic-theorypalm-calculuspoint-processprobability
Theorem 1.6.5 (Extremal property of ergodic flows). is ergodic if and only if there exists no decomposition
where and are, for all , -invariant probabilities on , with .
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: and must be invariant under every , not under one map. A probability invariant under a single 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.