Documentation

TauCeti.Probability.Exchangeability.PathSpace.ContractableLaw

Contractable laws on path space #

This file adds the path-law formulation of contractability, also called spreadability: a measure on ℕ → α is invariant under every strictly increasing reindexing of time. The process-level predicate Contractable μ X remains the main stochastic-process API; ContractableLaw names the equivalent path-space viewpoint needed by the de Finetti factorization and path-space dynamics.

This is the contractability analogue of ExchangeableLaw. It realizes the Exchangeability roadmap's Layer 0 request for the characterization of contractability by strictly increasing maps ℕ → ℕ, with finite-dimensional marginal consequences. The process-level ↔ path-law bridges live in TauCeti.Probability.Exchangeability.PathSpace.Law.Bridge, which imports this file and Contractability; no Mathlib infrastructure is vendored.

A measure on one-sided path space is contractable, or spreadable, if it is invariant under every strictly increasing reindexing of the time coordinate.

Equations
Instances For
    theorem TauCeti.Probability.ContractableLaw.intro {α : Type u_2} [MeasurableSpace α] {ρ : MeasureTheory.Measure (ℕ → α)} (h : ∀ (φ : ℕ → ℕ), StrictMono φ → MeasureTheory.Measure.map (fun (x : ℕ → α) (k : ℕ) => x (φ k)) ρ = ρ) :

    Constructor for ContractableLaw from the defining map invariance.

    @[simp]
    theorem TauCeti.Probability.contractableLaw_iff {α : Type u_2} [MeasurableSpace α] {ρ : MeasureTheory.Measure (ℕ → α)} :
    ContractableLaw ρ ↔ ∀ (φ : ℕ → ℕ), StrictMono φ → MeasureTheory.Measure.map (fun (x : ℕ → α) (k : ℕ) => x (φ k)) ρ = ρ

    Simp normal form for ContractableLaw.

    theorem TauCeti.Probability.ContractableLaw.map_reindex {α : Type u_2} [MeasurableSpace α] {ρ : MeasureTheory.Measure (ℕ → α)} (hρ : ContractableLaw ρ) {φ : ℕ → ℕ} (hφ : StrictMono φ) :
    MeasureTheory.Measure.map (fun (x : ℕ → α) (k : ℕ) => x (φ k)) ρ = ρ

    The defining invariance of a contractable path law.

    theorem TauCeti.Probability.ContractableLaw.measurePreserving_reindex {α : Type u_2} [MeasurableSpace α] {ρ : MeasureTheory.Measure (ℕ → α)} (hρ : ContractableLaw ρ) {φ : ℕ → ℕ} (hφ : StrictMono φ) :
    MeasureTheory.MeasurePreserving (fun (x : ℕ → α) (k : ℕ) => x (φ k)) ρ ρ

    A strictly increasing time reindexing preserves a contractable path law.

    Path-law contractability is equivalently measure preservation by every strictly increasing time reindexing.

    theorem TauCeti.Probability.ContractableLaw.map_prefixProj_of_strictMono {α : Type u_2} [MeasurableSpace α] {ρ : MeasureTheory.Measure (ℕ → α)} (hρ : ContractableLaw ρ) {n : ℕ} {k : Fin n → ℕ} (hk : StrictMono k) :
    MeasureTheory.Measure.map (fun (x : ℕ → α) (i : Fin n) => x (k i)) ρ = MeasureTheory.Measure.map (prefixProj α n) ρ

    The finite marginal of a contractable path law along any strictly increasing selection k : Fin n → ℕ equals its first-n prefix marginal.

    For finite path laws, contractability is equivalently invariance of every finite-dimensional marginal under strictly increasing finite selections.

    A contractable path law is preserved by the one-sided shift.

    Every iterate of the one-sided shift preserves a contractable path law.

    The one-sided shift leaves a contractable path law unchanged.

    Iterating the one-sided shift leaves a contractable path law unchanged.