Applications: Steady States and Dynamics
You'll learn how eigenvalues and eigenvectors reveal the long-term behavior of systems that evolve step-by-step.
What Are Discrete Dynamical Systems?
Imagine tracking a population of rabbits and foxes month by month, or modeling how market share shifts between competing companies each quarter. These are discrete dynamical systems—situations where a state vector x evolves over time according to a rule like x_{n+1} = Ax_n, where A is a fixed matrix and n represents the time step.
After many iterations, where does the system go? Does it stabilize, oscillate, or grow without bound?
The Role of Eigenvalues and Eigenvectors
Eigenvectors are the "pure modes" of the system. If your initial state happens to be an eigenvector v with eigenvalue λ, then:
- x_n = λⁿv
The eigenvalue tells you what happens over time:
- If |λ| < 1, that mode decays to zero
- If |λ| = 1, it stays constant (steady state)
- If |λ| > 1, it grows exponentially
For general initial conditions, you decompose x_0 as a combination of eigenvectors. Each piece evolves independently according to its eigenvalue.
Finding Steady States
A steady state is a vector s where As = s, meaning the system doesn't change. This means s is an eigenvector with eigenvalue λ = 1. The long-term behavior is dominated by the eigenvalue with the largest absolute value (the dominant eigenvalue).
Key Takeaway: Eigenvalues determine whether a discrete system converges to equilibrium, oscillates, or explodes; eigenvectors with eigenvalue 1 are steady states, and the dominant eigenvalue controls long-term dynamics.