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

Uniqueness of the Oseledets decomposition

Lax606786.OseledetsUniqueness · concepts/Lax606786/OseledetsUniqueness.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

    Let L\mathcal{L} be a cocycle on a separable Banach space XX. Any two Oseledets decompositions (L,λ,m,E,V,Π)(L, \lambda, m, E, V, \Pi) and (L′,λ′,m′,E′,V′,Π′)(L', \lambda', m', E', V', \Pi') of L\mathcal{L} agree. They have L=L′L = L', λi=λi′\lambda_i = \lambda'_i for 1≤i≤L1 \le i \le L, and mi=mi′m_i = m'_i for 1≤i<L1 \le i < L. For every 1≤i<L1 \le i < L and almost every ω\omega,

    Ei(ω)=Ei′(ω),Vi+1(ω)=Vi+1′(ω),Πi+1(ω)=Πi+1′(ω).E_i(\omega) = E'_i(\omega), \qquad V_{i+1}(\omega) = V'_{i+1}(\omega), \qquad \Pi_{i+1}(\omega) = \Pi'_{i+1}(\omega).

    Nothing is asserted at other indices, where the definition constrains nothing.

    Concept map
    7 concepts
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A
    Evidence

    Each proof establishes this claim relative to its assumptions.

    Lean source view on GitLab

    1import Lax606786.OseledetsDecompositions
    2
    3/-!
    4---
    5title: Uniqueness of the Oseledets decomposition
    6type: theorem
    7---
    8Let L\mathcal{L} be a cocycle on a separable Banach space XX.
    9Any two Oseledets decompositions (L,λ,m,E,V,Π)(L, \lambda, m, E, V, \Pi) and
    10(L′,λ′,m′,E′,V′,Π′)(L', \lambda', m', E', V', \Pi') of L\mathcal{L} agree. They have L=L′L = L',
    11λi=λi′\lambda_i = \lambda'_i for 1≤i≤L1 \le i \le L, and mi=mi′m_i = m'_i for 1≤i<L1 \le i < L. For every
    121≤i<L1 \le i < L and
    13almost every ω\omega,
    14Ei(ω)=Ei′(ω),Vi+1(ω)=Vi+1′(ω),Πi+1(ω)=Πi+1′(ω).E_i(\omega) = E'_i(\omega), \qquad V_{i+1}(\omega) = V'_{i+1}(\omega), \qquad \Pi_{i+1}(\omega) = \Pi'_{i+1}(\omega).
    15
    16Nothing is asserted at other indices, where the definition constrains nothing.
    17-/
    18
    19namespace Lax606786.OseledetsUniqueness
    20
    21open MeasureTheory Filter TopologicalSpace
    22open Lax606786.BanachGrassmannian Lax606786.OperatorStatistics Lax606786.ExtendedLog
    23 Lax606786.Cocycles Lax606786.OseledetsDecompositions
    24
    25/-- Any two Oseledets decompositions of a cocycle agree, on every index the decomposition
    26theorem constrains. -/
    27axiom isOseledetsDecomposition_unique {Ω X : Type*} [MeasurableSpace Ω] [StandardBorelSpace Ω]
    28 [NormedAddCommGroup X] [NormedSpace ℝ X] [MeasurableSpace X]
    29 (R : Cocycle Ω X) [SeparableSpace X] [BorelSpace X] [CompleteSpace X]
    30 {L L' : ℕ∞} {lam lam' : ℕ → EReal} {m m' : ℕ → ℕ+}
    31 {E : ∀ i : ℕ, 1 ≤ i → (i : ℕ∞) < L → Ω → GrassmannianFin X (m i)}
    32 {E' : ∀ i : ℕ, 1 ≤ i → (i : ℕ∞) < L' → Ω → GrassmannianFin X (m' i)}
    33 {V V' : ℕ → Ω → Submodule ℝ X} {P P' : ℕ → Ω → X →L[ℝ] X}
    34 (h : IsOseledetsDecomposition R L lam m E V P)
    35 (h' : IsOseledetsDecomposition R L' lam' m' E' V' P') :
    36 L = L' ∧ (∀ i : ℕ, 1 ≤ i → (i : ℕ∞) ≤ L → lam i = lam' i) ∧
    37 ∀ (i : ℕ) (h₁ : 1 ≤ i) (h₂ : (i : ℕ∞) < L) (h₂' : (i : ℕ∞) < L'),
    38 m i = m' i ∧ ∀ᵐ ω ∂(R.μ),
    39 ((E i h₁ h₂ ω).1 : Submodule ℝ X) = ((E' i h₁ h₂' ω).1 : Submodule ℝ X) ∧
    40 V (i + 1) ω = V' (i + 1) ω ∧ P (i + 1) ω = P' (i + 1) ω
    41
    42end Lax606786.OseledetsUniqueness
    43
    Show 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…