Documentation

Oseledets.Lyapunov.ForwardV

The measurable Λ-spectral filtration V #

This module constructs the measurable spectral filtration of the Oseledets limit operator Λ x = oseledetsLimit A T x and discharges its global measurability through the projector/range bridge measurableSubspace_range_of_measurable (Oseledets/Lyapunov/ForwardMeasurable.lean).

Main results #

Implementation notes #

The projector/range bridge consumes a measurable family of self-adjoint idempotent matrices P x, and requires those two algebraic facts to hold globally (for every x), not merely almost everywhere. Two obstructions are resolved here, and the residual measurability obligation is taken as a hypothesis.

Everywhere a genuine projector #

  1. Λ need not be self-adjoint off the a.e.-full convergence set. The named limit oseledetsLimit A T x is only known to be Hermitian almost everywhere. It is sanitized to a genuinely-everywhere-self-adjoint matrix lambdaHat A T x, equal to Λ x on the (measurable) Hermitian set and to the (self-adjoint) identity off it. Measurability is preserved because the Hermitian set is the equalizer of two measurable matrix-valued maps.

  2. A continuous gap function does not give an idempotent CFC. For a genuine orthogonal projector the 0/1-valued indicator Set.indicator (Set.Iic t) 1 is used: being 0/1-valued it satisfies g² = g on any finite spectrum, so cfc g (lambdaHat A T x) is self-adjoint (cfc_predicate) and idempotent (cfc_mul + cfc_congr) for every x.

Indicator-CFC measurability #

The remaining genuine obligation is Measurable (fun x => slowProjector t x), i.e. measurability of x ↦ cfc (Set.indicator (Set.Iic t) 1) (lambdaHat A T x). The indicator is discontinuous, so the continuous-CFC measurability crux measurable_cfc_continuous does not apply, and the polynomial bypass measurable_cfc_eqOn_polynomial would need a single polynomial agreeing with the indicator on the spectrum of every lambdaHat A T x — which requires global control of the spectra that is not available here. This module therefore takes that measurability as an explicit hypothesis (measurable_slowProjector) and discharges everything else: the sanitization and its properties, the everywhere self-adjointness and idempotence of the indicator-CFC, and the bridge application reduced to exactly that one measurability goal.

Step 1 — sanitize Λ to be self-adjoint everywhere #

noncomputable def Oseledets.lambdaHat {X : Type u_1} {d : } (A : XMatrix (Fin d) (Fin d) ) (T : XX) (x : X) :
Matrix (Fin d) (Fin d)

Sanitized Oseledets limit. Equal to oseledetsLimit A T x on the Hermitian set and to the identity matrix off it. This is genuinely (everywhere) self-adjoint, while remaining measurable and agreeing with the named limit Λ wherever the latter is Hermitian (in particular a.e.).

Equations
Instances For
    theorem Oseledets.measurable_conjTranspose {X : Type u_1} {T : XX} {d : } [MeasurableSpace X] [NeZero d] {A : XMatrix (Fin d) (Fin d) } (hAmeas : Measurable A) (hTmeas : Measurable T) :
    Measurable fun (x : X) => (oseledetsLimit A T x).conjTranspose

    The conjugate-transpose of a measurable matrix family is measurable (entrywise the star of a transposed measurable entry; over , star = id).

    theorem Oseledets.measurableSet_isHermitian_oseledetsLimit {X : Type u_1} {T : XX} {d : } [MeasurableSpace X] [NeZero d] {A : XMatrix (Fin d) (Fin d) } (hAmeas : Measurable A) (hTmeas : Measurable T) :

    The Hermitian set is measurable. {x | (oseledetsLimit A T x).IsHermitian} is the equalizer {x | (Λ x)ᴴ = Λ x} of the two measurable matrix-valued maps x ↦ (Λ x)ᴴ and x ↦ Λ x; equalizers of measurable maps into a metrizable space are measurable (measurableSet_eq_fun).

    theorem Oseledets.measurable_lambdaHat {X : Type u_1} {T : XX} {d : } [MeasurableSpace X] [NeZero d] {A : XMatrix (Fin d) (Fin d) } (hAmeas : Measurable A) (hTmeas : Measurable T) :

    Sanitization is measurable. lambdaHat A T is a measurable family: it is the piecewise combination of two measurable matrix maps (Λ and the constant 1) over the measurable Hermitian set.

    theorem Oseledets.lambdaHat_isSelfAdjoint {X : Type u_1} {d : } (A : XMatrix (Fin d) (Fin d) ) (T : XX) (x : X) :

    Sanitization is everywhere self-adjoint. On the Hermitian set lambdaHat A T x = Λ x is self-adjoint (Matrix.isHermitian_iff_isSelfAdjoint); off it lambdaHat A T x = 1 is self-adjoint (isSelfAdjoint_one).

    Step 2 — the indicator-CFC is everywhere a genuine projector #

    noncomputable def Oseledets.slowProjector {X : Type u_1} {d : } (A : XMatrix (Fin d) (Fin d) ) (T : XX) (t : ) (x : X) :
    Matrix (Fin d) (Fin d)

    Slow (sublevel) band projector. The continuous functional calculus of the 0/1-valued indicator of (-∞, t] applied to the sanitized limit lambdaHat A T x. Being a CFC of a real-valued function it is self-adjoint for every x, and being cut by a 0/1-valued indicator it is idempotent for every x — a genuine orthogonal projector at every point.

    Equations
    Instances For
      theorem Oseledets.slowProjector_isSelfAdjoint {X : Type u_1} {d : } (A : XMatrix (Fin d) (Fin d) ) (T : XX) (t : ) (x : X) :

      The slow projector is self-adjoint for every x (a CFC of a real-valued function is always self-adjoint).

      theorem Oseledets.slowProjector_mul_self {X : Type u_1} {d : } (A : XMatrix (Fin d) (Fin d) ) (T : XX) (t : ) (x : X) :
      slowProjector A T t x * slowProjector A T t x = slowProjector A T t x

      The slow projector is idempotent for every x. The 0/1-valued indicator satisfies g² = g on any set, in particular on the (finite) spectrum of lambdaHat A T x; the continuity hypothesis of cfc_mul holds since any function is continuous on the finite spectrum. Hence cfc g (lambdaHat …) is idempotent, a genuine orthogonal projector at every point.

      Step 3 — the spectral filtration and the bridge application #

      noncomputable def Oseledets.vslow {X : Type u_1} {d : } (A : XMatrix (Fin d) (Fin d) ) (T : XX) (t : ) (x : X) :

      The slow (sublevel) spectral filtration. For each cutoff t, the family of range subspaces of the slow band projector. By construction slowProjector A T t x is, for every x, a self-adjoint idempotent matrix, so range (toEuclideanCLM (slowProjector …)) is exactly the kind of family the projector/range bridge consumes.

      Equations
      Instances For
        theorem Oseledets.measurableSubspace_vslow_of_measurable_slowProjector {X : Type u_1} {d : } [MeasurableSpace X] (A : XMatrix (Fin d) (Fin d) ) (T : XX) (t : ) (hP : Measurable fun (x : X) => slowProjector A T t x) :
        MeasurableSubspace fun (x : X) => vslow A T t x

        The bridge application (reduced to the one measurability goal). Given measurability of the indicator-CFC family x ↦ slowProjector A T t x, the spectral filtration vslow A T t is a MeasurableSubspace. The two algebraic hypotheses of the bridge (measurableSubspace_range_of_measurable) — self-adjointness and idempotence everywhere — are the discharged slowProjector_isSelfAdjoint and slowProjector_mul_self.

        theorem Oseledets.measurableSubspace_vslow {X : Type u_1} {d : } [MeasurableSpace X] (A : XMatrix (Fin d) (Fin d) ) (T : XX) (t : ) (measurable_slowProjector : Measurable fun (x : X) => slowProjector A T t x) :
        MeasurableSubspace fun (x : X) => vslow A T t x

        Measurability of the slow spectral filtration. Under the single isolated measurability hypothesis on the indicator-CFC family, vslow A T t is a MeasurableSubspace: the sanitization, the everywhere self-adjointness and idempotence of the slow projector, and the projector/range bridge reduce the measurability of the filtration to exactly this hypothesis.