While this submission is a draft, it cannot be used by other submissions.

Elementary identities for iterates of a cocycle

Lax606786.CocycleIterates · concepts/Lax606786/CocycleIterates.lean · lax-606786

proven

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Theorem

    The following elementary identities hold for a cocycle L\mathcal{L} over (Ω,σ,μ)(\Omega, \sigma, \mu), along forward and backward orbits; they are used throughout.

    • Lω(1)=Lω\mathcal{L}^{(1)}_\omega = \mathcal{L}_\omega and Lω(m+n)=Lσnω(m)Lω(n)\mathcal{L}^{(m+n)}_\omega = \mathcal{L}^{(m)}_{\sigma^n\omega} \mathcal{L}^{(n)}_\omega (the cocycle law), in particular Lω(n+1)=Lσω(n)Lω\mathcal{L}^{(n+1)}_\omega = \mathcal{L}^{(n)}_{\sigma\omega}\mathcal{L}_\omega;
    • σjσ−(j+n)ω=σ−nω\sigma^j \sigma^{-(j+n)}\omega = \sigma^{-n}\omega;
    • if EE is a family of mm-dimensional subspaces with LσkωE(σkω)=E(σk+1ω)\mathcal{L}_{\sigma^k\omega}E(\sigma^k\omega) = E(\sigma^{k+1}\omega) for every kk, then Lω(n)E(ω)=E(σnω)\mathcal{L}^{(n)}_\omega E(\omega) = E(\sigma^n\omega) for every nn;
    • if (yn)(y_n) is a backward history at ω\omega, that is Lσ−(n+1)ω yn+1=yn\mathcal{L}_{\sigma^{-(n+1)}\omega}\, y_{n+1} = y_n for all nn, then Lσ−nω(n) yn=y0\mathcal{L}^{(n)}_{\sigma^{-n}\omega}\, y_n = y_0;
    • if subspaces W(ζ)W(\zeta) satisfy Lσ−(m+1)ωW(σ−(m+1)ω)⊆W(σ−mω)\mathcal{L}_{\sigma^{-(m+1)}\omega} W(\sigma^{-(m+1)}\omega) \subseteq W(\sigma^{-m}\omega) for all mm, then Lσ−nω(n)W(σ−nω)⊆W(ω)\mathcal{L}^{(n)}_{\sigma^{-n}\omega} W(\sigma^{-n}\omega) \subseteq W(\omega);
    • an almost-everywhere property holds almost everywhere at every point of the backward orbit.
    Concept map
    6 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    This concept declares 8 statements. Each proof establishes one of them relative to its assumptions.

    3 iterate_history proven

    6 iterate_sigma_symm_iterate proven

    7 iterate_succ_left proven

    8 map_iterate_of_equivariant proven

    Lean source view on GitLab

    1import Lax606786.Cocycles
    2import Lax606786.BanachGrassmannian
    3
    4/-!
    5---
    6title: Elementary identities for iterates of a cocycle
    7type: theorem
    8---
    9The following elementary identities hold for a cocycle L\mathcal{L} over (Ω,σ,μ)(\Omega, \sigma, \mu),
    10along forward and backward orbits; they are used throughout.
    11
    12- Lω(1)=Lω\mathcal{L}^{(1)}_\omega = \mathcal{L}_\omega and
    13 Lω(m+n)=Lσnω(m)Lω(n)\mathcal{L}^{(m+n)}_\omega = \mathcal{L}^{(m)}_{\sigma^n\omega} \mathcal{L}^{(n)}_\omega (the
    14 cocycle law), in particular
    15 Lω(n+1)=Lσω(n)Lω\mathcal{L}^{(n+1)}_\omega = \mathcal{L}^{(n)}_{\sigma\omega}\mathcal{L}_\omega;
    16- σjσ−(j+n)ω=σ−nω\sigma^j \sigma^{-(j+n)}\omega = \sigma^{-n}\omega;
    17- if EE is a family of mm-dimensional subspaces with
    18 LσkωE(σkω)=E(σk+1ω)\mathcal{L}_{\sigma^k\omega}E(\sigma^k\omega) = E(\sigma^{k+1}\omega) for every kk, then
    19 Lω(n)E(ω)=E(σnω)\mathcal{L}^{(n)}_\omega E(\omega) = E(\sigma^n\omega) for every nn;
    20- if (yn)(y_n) is a backward history at ω\omega, that is
    21 Lσ−(n+1)ω yn+1=yn\mathcal{L}_{\sigma^{-(n+1)}\omega}\, y_{n+1} = y_n for all nn, then
    22 Lσ−nω(n) yn=y0\mathcal{L}^{(n)}_{\sigma^{-n}\omega}\, y_n = y_0;
    23- if subspaces W(ζ)W(\zeta) satisfy Lσ−(m+1)ωW(σ−(m+1)ω)⊆W(σ−mω)\mathcal{L}_{\sigma^{-(m+1)}\omega} W(\sigma^{-(m+1)}\omega) \subseteq W(\sigma^{-m}\omega)
    24 for all mm, then
    25 Lσ−nω(n)W(σ−nω)⊆W(ω)\mathcal{L}^{(n)}_{\sigma^{-n}\omega} W(\sigma^{-n}\omega) \subseteq W(\omega);
    26- an almost-everywhere property holds almost everywhere at every point of the backward orbit.
    27-/
    28
    29namespace Lax606786.CocycleIterates
    30
    31open MeasureTheory
    32open Lax606786.Cocycles Lax606786.BanachGrassmannian
    33
    34variable {Ω X : Type*} [MeasurableSpace Ω] [StandardBorelSpace Ω]
    35 [NormedAddCommGroup X] [NormedSpace ℝ X] [MeasurableSpace X]
    36
    37/-- `𝓛^{(1)}_ω = 𝓛_ω`. -/
    38axiom iterate_one (R : Cocycle Ω X) (ω : Ω) : R.iterate 1 ω = R.L ω
    39
    40/-- The cocycle law `𝓛^{(m+n)}_ω = 𝓛^{(m)}_{σⁿω} ∘ 𝓛^{(n)}_ω`. -/
    41axiom iterate_add (R : Cocycle Ω X) (m n : ℕ) (ω : Ω) :
    42 R.iterate (m + n) ω = (R.iterate m (R.σ^[n] ω)).comp (R.iterate n ω)
    43
    44/-- `𝓛^{(n+1)}_ω = 𝓛^{(n)}_{σω} ∘ 𝓛_ω`. -/
    45axiom iterate_succ_left (R : Cocycle Ω X) (n : ℕ) (ω : Ω) :
    46 R.iterate (n + 1) ω = (R.iterate n (R.σ ω)).comp (R.L ω)
    47
    48/-- `σ^j σ^{-(j+n)} ω = σ^{-n} ω`. -/
    49axiom iterate_sigma_symm_iterate (R : Cocycle Ω X) (j n : ℕ) (ω : Ω) :
    50 (R.σ : Ω → Ω)^[j] ((R.σ.symm : Ω → Ω)^[j + n] ω) = (R.σ.symm : Ω → Ω)^[n] ω
    51
    52/-- An equivariant family is carried along by the iterates. -/
    53axiom map_iterate_of_equivariant (R : Cocycle Ω X) {m : ℕ} [NeZero m]
    54 (E : Ω → GrassmannianFin X m) (ω : Ω)
    55 (h : ∀ k : ℕ, Submodule.map (R.L (R.σ^[k] ω) : X →ₗ[ℝ] X)
    56 ((E (R.σ^[k] ω)).1 : Submodule ℝ X) = ((E (R.σ^[k + 1] ω)).1 : Submodule ℝ X))
    57 (n : ℕ) :
    58 Submodule.map (R.iterate n ω : X →ₗ[ℝ] X) ((E ω).1 : Submodule ℝ X)
    59 = ((E (R.σ^[n] ω)).1 : Submodule ℝ X)
    60
    61/-- A backward history is carried back to its start by the iterates. -/
    62axiom iterate_history (R : Cocycle Ω X) (ω : Ω) {y : ℕ → X}
    63 (hyL : ∀ n : ℕ, R.L ((R.σ.symm : Ω → Ω)^[n + 1] ω) (y (n + 1)) = y n) (n : ℕ) :
    64 R.iterate n ((R.σ.symm : Ω → Ω)^[n] ω) (y n) = y 0
    65
    66/-- A family invariant along the backward orbit is carried forward by the iterates. -/
    67axiom iterate_mem_of_backward (R : Cocycle Ω X) (ω : Ω) (W : Ω → Submodule ℝ X)
    68 (hW : ∀ m : ℕ, ∀ x ∈ W ((R.σ.symm : Ω → Ω)^[m + 1] ω),
    69 R.L ((R.σ.symm : Ω → Ω)^[m + 1] ω) x ∈ W ((R.σ.symm : Ω → Ω)^[m] ω)) :
    70 ∀ n : ℕ, ∀ x ∈ W ((R.σ.symm : Ω → Ω)^[n] ω),
    71 R.iterate n ((R.σ.symm : Ω → Ω)^[n] ω) x ∈ W ω
    72
    73/-- An a.e. property holds a.e. at every point of the backward orbit. -/
    74axiom ae_forall_iterate_symm (R : Cocycle Ω X) {p : Ω → Prop} (hp : ∀ᵐ ω ∂(R.μ), p ω) :
    75 ∀ᵐ ω ∂(R.μ), ∀ k : ℕ, p ((R.σ.symm : Ω → Ω)^[k] ω)
    76
    77end Lax606786.CocycleIterates
    78
    Show ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow ProofShow Proof
    Builds on
    Used by

    none

    From Mathlib

    none

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…