Documentation

Oseledets.Lyapunov.Extensions.SingularRankMeasurable

Measurability of the singular rank data #

For the singular (non-invertible) multiplicative ergodic theorem the Oseledets decomposition degenerates to a measurable filtration ℝ^d = V₁(x) ⊃ V₂(x) ⊃ ⋯ ⊃ {0} whose strata carry the dimension data of the flag (Quas, Multiplicative Ergodic Theorems and Applications, lecture notes, Universidade de São Paulo, 2013, Theorem 2 — the non-invertible Oseledets theorem after Oseledec [12] and Raghunathan [13]: the filtration is measurable and its dimensions are the multiplicities m_j). A prerequisite for assembling that measurable flag is that the dimension data of the cocycle — the rank of each matrix product, and the level sets of that rank — depend measurably on the base point x.

This file supplies the determinantal building blocks of that measurability.

The crux for the full rank function x ↦ (A x).rank is the determinantal characterisation of rank: r ≤ (A x).rank iff some r × r minor of A x has nonzero determinant, which would express each level set as a finite union of the measurable sets {x | minor-det ≠ 0}. That equivalence (rank ↔ nonzero minors) is not in Mathlib, so the general Measurable (fun x => (A x).rank) cannot yet be proved here; see the module note at the end.

What is available is the top stratum of the flag — the full-rank set — via the square determinantal characterisation A.rank = d ↔ A.det ≠ 0, which this file proves (Matrix.rank_eq_card_iff_det_ne_zero) and turns into measurability of the top-rank level set of the cocycle.

Main results #

Remaining gap #

The full measurable dimension function x ↦ cocycleRank A T n x (hence the eventual-kernel dimension x ↦ d - iInf_n cocycleRank A T n x) requires the rank ↔ nonzero-minor equivalence that Mathlib still lacks; see the closing note.

theorem Matrix.rank_eq_card_iff_det_ne_zero {n : Type u_1} {R : Type u_2} [Fintype n] [DecidableEq n] [Field R] (A : Matrix n n R) :

Full-rank determinantal criterion. A square matrix over a field has full rank iff its determinant is nonzero. This is the top-stratum case of the determinantal characterisation of rank (the general r ≤ rank ↔ nonzero r-minor is not yet in Mathlib).

theorem Oseledets.measurable_minor_det {X : Type u_1} {d : } [MeasurableSpace X] {r : } {A : XMatrix (Fin d) (Fin d) } (hA : Measurable A) (s t : Fin rFin d) :
Measurable fun (x : X) => ((A x).submatrix s t).det

Measurability of a single minor's determinant. For a measurable matrix family A, the determinant of the fixed r × r minor selected by s, t depends measurably on x. Each minor entry is (A x) (s i) (t j), a measurable coordinate of A x, and the determinant is a polynomial in those entries. This is the elementary piece of the determinantal characterisation of rank.

theorem Oseledets.measurableSet_minor_det_ne_zero {X : Type u_1} {d : } [MeasurableSpace X] {r : } {A : XMatrix (Fin d) (Fin d) } (hA : Measurable A) (s t : Fin rFin d) :
MeasurableSet {x : X | ((A x).submatrix s t).det 0}

The nondegenerate-minor set is measurable. The set of base points where a fixed r × r minor of A x has nonzero determinant is measurable: it is the preimage of the measurable set {0}ᶜ under the measurable minor-determinant. In the determinantal characterisation of rank these are the sets whose finite unions cut out the rank level sets.

theorem Oseledets.measurableSet_cocycleRank_eq_full {X : Type u_1} {d : } [MeasurableSpace X] {A : XMatrix (Fin d) (Fin d) } (hA : Measurable A) {T : XX} (hT : Measurable T) (n : ) :

The full-rank stratum of the cocycle is measurable. The top stratum of the singular rank flag — the set where the n-step cocycle still has full rank d — is measurable. By the full-rank determinantal criterion Matrix.rank_eq_card_iff_det_ne_zero it equals {x | (cocycle A T n x).det ≠ 0}, the preimage of {0}ᶜ under the measurable determinant of the (measurable) cocycle. This is the outermost, full-dimension layer of the measurable filtration.