Documentation

Oseledets.Entropy.FactorMap

Factor maps and invariant sub-σ-algebras #

A factor map (or morphism of measure-preserving systems) from a system (α, T, μ) to a system (β, S, ν) is a measure-preserving map π : α → β that intertwines the two dynamics, π ∘ T = S ∘ π. This file packages that data as Oseledets.Entropy.IsFactorMap and proves the basic correspondence between factor maps and invariant sub-σ-algebras of the source: the σ-algebra comap π 𝓑 pulled back from the target is invariant under T, in the sense that pulling it back once more along T only shrinks it (comap T (comap π 𝓑) ≤ comap π 𝓑). This is exactly the hypothesis comap T 𝒜 ≤ 𝒜 consumed by the Kolmogorov–Sinai entropy machinery, so the lemma feeds a factor system into the conditional-entropy / relative-entropy toolbox.

Design note: the intertwining is an everywhere equality #

The defining intertwining relation is stated as the honest pointwise equality π ∘ T = S ∘ π, not merely the almost-everywhere relation π ∘ T =ᵐ[μ] S ∘ π. This is deliberate and mathematically standard (Walters, Ch. 4: a factor map is a morphism of dynamical systems, hence genuinely commutes with the dynamics). It is also necessary for the correspondence lemma: MeasurableSpace.comap is an everywhere construction on preimages, and an almost-everywhere equality of functions does not in general yield equality of the comap σ-algebras. With the everywhere identity, the key lemma is a clean rewrite by MeasurableSpace.comap_comp followed by MeasurableSpace.comap_mono.

A second, equally standard part of the morphism data is that the target dynamics S is itself measurable; this is what supplies the σ-algebra contraction comap S 𝓑 ≤ 𝓑 driving the correspondence lemma.

Main definitions #

Main results #

References #

def Oseledets.Entropy.IsFactorMap {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] (π : αβ) (T : αα) (S : ββ) (μ : MeasureTheory.Measure α) (ν : MeasureTheory.Measure β) :

π : α → β is a factor map from the measure-preserving system (α, T, μ) to the system (β, S, ν) when it pushes μ forward to ν, the target dynamics S is measurable, and π intertwines the dynamics, π ∘ T = S ∘ π.

The intertwining is required as an everywhere equality (not only =ᵐ[μ]): a factor map is a morphism of dynamical systems, and the everywhere identity is what makes the pulled-back σ-algebra genuinely invariant. Measurability of S is part of the data of a morphism of measurable dynamical systems and is exactly what makes comap S 𝓑 ≤ 𝓑, the contraction used in the correspondence lemma below.

Equations
Instances For
    theorem Oseledets.Entropy.IsFactorMap.invariant_comap {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] {μ : MeasureTheory.Measure α} {ν : MeasureTheory.Measure β} {T : αα} {S : ββ} {π : αβ} (h : IsFactorMap π T S μ ν) :

    The σ-algebra comap π 𝓑 pulled back from the target along a factor map is invariant under the source dynamics T: pulling it back once more along T only shrinks it. This is precisely the comap T 𝒜 ≤ 𝒜 hypothesis required by the Kolmogorov–Sinai entropy machinery.

    The proof rewrites comap T (comap π 𝓑) = comap (π ∘ T) 𝓑 = comap (S ∘ π) 𝓑 = comap π (comap S 𝓑) using the everywhere intertwining π ∘ T = S ∘ π, then applies comap_mono to the contraction comap S 𝓑 ≤ 𝓑, which is the measurability of S.

    theorem Oseledets.Entropy.IsFactorMap.measurable_comap_le {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] {μ : MeasureTheory.Measure α} {ν : MeasureTheory.Measure β} {T : αα} {S : ββ} {π : αβ} (h : IsFactorMap π T S μ ν) :
    MeasurableSpace.comap π inst✝ inst✝¹

    The pulled-back σ-algebra comap π 𝓑 of a factor map is a genuine sub-σ-algebra of the source measurable structure, since the measure-preserving π is in particular measurable.