Matrix Power Calculator
Raise a square matrix to any non-negative integer power by repeated multiplication.
What Is Matrix Power?
The nth power of a square matrix A is the matrix product of A with itself n times:
Only square matrices (same number of rows and columns) can be raised to a power, because each multiplication requires the column count of the first matrix to equal the row count of the second.
Special Cases
- A^0 = I (the identity matrix — analogous to x^0 = 1)
- A^1 = A (the matrix itself)
- A^2 = A × A (matrix squared)
- A^-1 (negative powers require the inverse to exist)
Worked Example
Compute A^2 for A = [[1,1],[1,0]] (the Fibonacci matrix):
[1,0] [1×1+0×1, 1×1+0×0] [1,1]
Remarkably, A^n gives Fibonacci numbers: A^n[0][0] = F(n+1), A^n[0][1] = F(n).
Properties of Matrix Powers
- A^m × A^n = A^(m+n)
- (A^m)^n = A^(mn)
- (A^n)^T = (A^T)^n
- det(A^n) = (det A)^n
- If A is diagonalizable: A = PDP^-1, then A^n = PD^nP^-1 (efficient for large n)
Real-World Applications
- Markov chains: A^n gives the probability distribution after n steps. The steady-state is found by taking the limit of A^n as n → ∞.
- Fibonacci numbers: The Fibonacci matrix [[1,1],[1,0]]^n produces Fibonacci numbers.
- Discrete dynamical systems: Population models where state(t+1) = A × state(t) give state(t) = A^t × state(0).
- Network paths: A^n for an adjacency matrix counts the number of paths of length n between nodes.
Frequently Asked Questions
What does matrix power mean?
A^n = A×A×...×A (n times). Only square matrices can be raised to a power.
What is A^0?
A^0 = I, the identity matrix (1s on diagonal, 0s elsewhere), analogous to x^0 = 1.
How do matrix powers relate to eigenvalues?
If λ is an eigenvalue of A, then λ^n is an eigenvalue of A^n with the same eigenvector. Eigenvalue decomposition makes computing A^n very efficient.
What is the Cayley-Hamilton theorem?
Every square matrix satisfies its own characteristic polynomial. This allows expressing A^n for large n in terms of lower powers of A.