A = (2 1; 1 2)
dominant eigenvalue
3.
A matrix with all entries positive has a largest eigenvalue that is real and positive, with an eigenvector that has all positive entries; every other eigenvalue is smaller in size. It describes the long-term behaviour of repeated multiplication.
This page is easier if you are comfortable with:
Repeatedly multiplying a vector by a positive matrix pushes it towards the direction of the dominant eigenvector, because the dominant eigenvalue grows fastest (compare the powers in diagonalisation). This explains steady states in population models and rankings of web pages.
For a matrix whose rows each add to 1 (a Markov chain), the dominant eigenvalue is 1 and the eigenvector gives the steady state. Finding the eigenvalues uses the characteristic equation and the vector comes from the eigenvector equation.
The theorem also bounds the eigenvalues between the smallest and largest row sums, and it links to the matrix-tree theorem and other results about graphs and networks.
For a positive matrix there is one dominant eigenvalue with a positive eigenvector, which controls the long-term behaviour of repeated multiplication.
The largest eigenvalue grows far faster than the other, so it decides the direction after many steps.
These examples are worked by hand, step by step, so you can compare your own working.
Find the Perron eigenvalue of .
Find the Perron eigenvalue of .
Show that has largest eigenvalue 1.
A few situations come up again and again. Knowing them saves time and helps you spot answers that cannot be right.
dominant eigenvalue
3.
dominant eigenvalue
4.
row sums range
3 to 5.
dominant eigenvalue
1.
A positive matrix has a real positive dominant eigenvalue with an all-positive eigenvector; all other eigenvalues are smaller in modulus. It lies between the smallest and largest row sums.
(2 1; 1 2): λ² − 4λ + 3.
(1 2; 3 2): tr 3, det −4.
Row sums 3 and 5; λ = 4 is between.
Rows sum to 1.
negative ✗
positive for a positive matrix ✓
Theorem.
any ✗
non-negative, irreducible ✓
Condition.
mixed ✗
all positive ✓
Theorem.
equal ✗
strictly smaller for positive matrices ✓
Spectral gap.
Try each one on paper, then open the answer. Use the solver above to see the full working.
4
4
2
3
5
1
Unlimited fresh questions with instant marking. Choose a level, work it out on paper, then type your answer.
Solve: …
A positive matrix has a real positive dominant eigenvalue with a positive eigenvector.
Between the smallest and largest row sums.
1.
It describes long-term behaviour of Markov chains and populations.
eigenvector equation.
matrix tree theorem.
More in Vectors and matrices and the formula sheets.