Multiplicative ergodic theorem and Lyapunov spectra
State the invertible Oseledets theorem precisely and compute growth along invariant directions rather than coordinate axes.
On this page
The question for today
What you’ll understand
- State finite-dimensional invertible Oseledets hypotheses and the equivariant splitting conclusion.
- Distinguish finite-time singular stretches, invariant growth directions, and asymptotic exponents.
- Compute an explicit triangular spectrum and a periodic cocycle spectrum with the correct time normalization.
A matrix product can stretch different directions at different exponential rates. Kingman's theorem identifies a top norm-growth rate under suitable hypotheses, but a full spectrum needs more structure. Oseledets' multiplicative ergodic theorem supplies measurable invariant directions and their asymptotic exponents. Its invertible formulation requires integrability for both forward matrices and their inverses. A triangular example shows why reading diagonal entries or following a coordinate axis can misidentify a vector's rate, even when the matrix is constant and all products are explicit.
Specify the base and both integrability conditions
Let T be an invertible bimeasurable ergodic probability-preserving transformation on a standard Borel probability space, and let A be a measurable map into invertible real d-by-d matrices. Assume the positive parts of the natural logarithms of the operator norms of A and its inverse are integrable. These are sufficient hypotheses for the two-sided finite-dimensional theorem used here. The cocycle product applies the earliest matrix first, on the right. Reversing the order can change a product when matrices do not commute.
The theorem gives finitely many finite real exponents with multiplicities and a measurable direct-sum decomposition of the vector space at almost every base point. Applying A sends each subspace to its corresponding subspace over the next point. Every nonzero vector in one subspace has its assigned exponential growth rate. In the ergodic case the exponents and dimensions are almost surely constant; without ergodicity they can be invariant measurable functions. Almost-sure statements do not automatically cover all initial base points or supply numerical convergence rates.
Growth directions differ from finite-time singular vectors
A vector with components in several Oseledets subspaces has the largest exponent among its nonzero components. Singular values of the full n-step product also have normalized logarithms converging to the exponents, repeated with multiplicity. However, singular vectors of a particular finite product are optimized for that finite interval and need not equal the equivariant splitting directions. This distinction is already visible for a constant nonnormal matrix, where a coordinate direction can feed an expanding eigenvector despite having a contracting diagonal entry.
With only forward integrability, a more general theorem provides a forward filtration, and some exponents may equal minus infinity. One should not claim the full invertible splitting stated above after dropping inverse integrability or invertibility of the base. Different formulations address noninvertible bases, but require their own conclusions and hypotheses. Here the explicit assumptions keep forward and backward growth compatible and make every exponent finite. A small observed singular value at one time is not by itself evidence of a negative limiting exponent.
Exterior powers account for the spectrum
The largest stretch of an exterior power measures growth of oriented volume in the corresponding dimension. Applying the subadditive theorem to these exterior-power cocycles identifies sums of the largest exponents; differences of consecutive sums recover individual values. The top exterior power is determinant, whose logarithm is additive along products. Birkhoff then gives the displayed sum rule. This explains why determinant one forces the sum of exponents to vanish but does not force each exponent to vanish. Expansion and contraction can compensate.
The matrix lab's family has bottom-right entry one, so it does not directly represent every matrix in the worked example. It can nevertheless expose the difference between one-step stretching and asymptotic growth for its own selected constant matrix. Its playback interpolates geometry rather than composing a cocycle. Compute powers and their normalized logarithms separately, and treat the readouts as checks on an individual matrix. The theorem establishes the long-time conclusion only after its measure, measurability, and integrability assumptions have been verified.
Work it through
A contracting eigenvector hidden by an expanding coordinate
On a one-point probability base, take . Find both exponents and their invariant directions, then determine the rate of the second coordinate vector.
The expanding eigenvector is , with eigenvalue two. The vector satisfies . Hence the two exponents are and , with the corresponding one-dimensional eigenspaces.
Multiplication or a geometric sum gives . Thus , whose norm grows at rate .
The decomposition has a nonzero expanding component. The determinant is one, so the sum of the two exponents is zero, matching . All integrability conditions hold automatically on this finite base.
The second coordinate vector expands asymptotically even though the bottom diagonal entry contracts. The contracting direction is an oblique eigenspace, and determinant one balances the two rates.
The living notebook
Explore the model
Interactive lab · matrix
One-step stretching can overstate the long-time rate
Pause and Reset; set both . Predict determinant one half and largest singular value , although powers of this selected matrix have top exponent zero. Reset and set both ; predict determinant two and stretch , with top constant-matrix exponent . These are the lab's matrices, not the worked matrix. Playback interpolates geometry, not powers; edits retain time, so Reset and set both controls for fresh comparisons.
- Area scale · det A
- 1.4
- Singular values · σmax, σmin
- 1.597, 0.876
- Condition number · κ₂(A)
- 1.823
The selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forA one-step singular stretch and an asymptotic Lyapunov exponent answer different questions.
Pause & reason
Check your understanding
Your turn
Try it yourself
Let the base alternate between two points with uniform probability. Set and . Find the two Lyapunov exponents per single iterate, state the product order from point zero, and verify their sum.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Compute a two-step product, then divide its logarithmic rates by two because one full base cycle takes two iterates.
Compare with the solution
From zero the product is . Repeating full cycles gives exponents and per iterate; the bounded leftover factor does not alter them. Here the diagonal matrices commute, so starting from the other point gives the same full-cycle product. Both determinants equal one, and the exponent sum is zero, as the determinant formula requires.
Keep the idea
Take it with you
- A finite two-sided Lyapunov splitting uses explicit forward and inverse integrability hypotheses.
- Invariant growth directions and finite-time singular vectors need not coincide.
- Exterior powers and determinant connect individual exponents to volume growth.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.