Matrix Power Calculator - Raise a 2x2 A to the nth Power

A matrix power calculator raises a square matrix A to an integer power n by repeated matrix multiplication. Type the four cells of a 2x2 matrix A, pick an integer exponent n, and the result panel returns A^1, A^2, and A^n with a det(A) line and a status flag for the singular-matrix case on negative n.

• • Linear-algebra homework: Confirm A^n by hand on a 2x2 matrix, then check each cell against the row-by-column rule.
• • Recurrence relations and sequences: Model Fibonacci or other linear recurrences with the 2x2 companion matrix.
• • Computer graphics transforms: Compose scaling, rotation, and shear matrices by raising a transform to a power.
• • Markov chain step n: Raise a 2x2 transition matrix to a power to project the chain n steps ahead.

Matrix power extends matrix multiplication. A^1 is A, A^2 is A * A, and A^n is A multiplied by itself n times. A^0 returns the identity, and a negative exponent is legal when A is invertible.

If you want the row-by-column product for two different matrices, the matrix multiplication calculator applies the same dot-product rule this calculator uses to build A * A.

The calculator reads the four cells of the 2x2 matrix A and the integer exponent n, then multiplies A by itself |n| times using the row-by-column rule. A^0 returns I, and negative exponents use A^(-1) first.

• A[i][k]: Entry in row i, column k of the left factor. The index k runs across the inner dimension of size 2 for a 2x2 by 2x2 product.
• A[k][j]: Entry in row k, column j of the right factor, sharing the same k with the left factor's column index.
• n: Integer exponent applied to A. n = 0 returns the identity, and negative integers require A to be invertible.
• det(A): Determinant a11 * a22 - a12 * a21. When this value is zero and n is negative, the A^n cells show '—' and the status line reads 'Singular - A^n undefined for negative n'.

The result panel lists the cells in the same row-column order as the input matrix, so each cell maps directly between A and A^n. A^1 and A^2 appear separately, det(A) is shown explicitly, and the status line flags the singular-matrix case for negative n.

As published by Wolfram MathWorld, the n-th power of a square matrix A is the matrix product of A with itself n times, and the zero-th power is the identity matrix of the same size. Wikipedia gives the same rule in terms of the n-fold product A · A · ... · A.

When n is negative, the calculator inverts A first, and the matrix inverse calculator walks through the same adjugate-over-determinant step that powers the negative-exponent branch of this page.

Four short ideas cover what matrix power means, what the n = 0 case collapses to, why A^(-1) sometimes does not exist, and how the result behaves for large n.

These four ideas cover the matrix power questions that come up early in linear algebra. The most common slip is treating A^n as the entrywise power a[i][j]^n, which it is not. The result panel returns I for n = 0, so that case is a quick sanity check.

For matrices that grow rapidly with n, the matrix norm calculator puts a number on the size of A^n with the Frobenius or infinity norm once you have the result.

Enter the four cells of matrix A, pick an integer exponent n from -10 to 25, then read the A^1, A^2, and A^n cells in the result panel.

1. 1 Type the first row of A: Fill in A row 1, col 1 and A row 1, col 2 with the top row of the matrix A.
2. 2 Type the second row of A: Fill in A row 2, col 1 and A row 2, col 2 with the bottom row of A.
3. 3 Pick the exponent n: Enter an integer exponent in the n field. Use 0 to see the identity, positive integers to grow the power, and negative integers only when A is invertible.
4. 4 Read det(A) and the status line: If n is negative and det(A) is zero, the four A^n cells display '—' and the status line reads 'Singular - A^n undefined for negative n'.
5. 5 Read A^1 and A^2 first: The A^1 echo and A^2 cells confirm the matrix was entered correctly and the row-by-column rule is producing the right square.
6. 6 Read the A^n result: The four A^n cells at the top of the result panel are the final answer. Use them in a hand calculation or a Markov-chain step.

Modelling a Fibonacci sequence with A = [[1, 1], [1, 0]] and asking for F_6: type A into the four cells, set n to 5, and the matrix power calculator returns A^5 = [[8, 5], [5, 3]]. The top row reads (F_6, F_5) = (8, 5), which gives F_6 from the A^n cells.

When the second factor is a single number rather than a 2x2 matrix, the math power calculator applies the same exponent rule to scalars and returns the entrywise power a^n.

The row-by-column rule is short, but tracking which row goes with which column across |n| multiplications goes wrong by hand. The matrix power calculator surfaces det(A) and a status flag so the singular-matrix case for negative n is impossible to miss.

• • A^1, A^2, and A^n side by side: The result panel returns A^1, A^2, and A^n at the same time so you can read how the cells grow across powers.
• • det(A) line and status flag for negative exponents: The result panel shows det(A) and the 'Singular - A^n undefined for negative n' status when A is singular and n is negative.
• • Covers n = 0, n > 0, and n < 0 in one form: The same form covers the identity case, the repeated-product case, and the negative case, so you do not have to switch tools.
• • Matches the textbook row-by-column rule: The calculation applies the rule |n| times, so the cells of A^n match what you would write by hand.
• • Real-time updates as you type: The form recalculates on every keystroke, so you can try different exponents.

The biggest payoff is the negative-exponent case: many homework sets ask for A^(-1) of a 2x2 matrix, and the det(A) line tells you immediately whether the inverse exists. The A^1 cells double as an entry check, and the status line keeps the undefined case separate from a real zero result.

If you need a quick entrywise scaling before raising the matrix to a power, the matrix by scalar calculator walks through the cell-by-cell kA step that you can apply first to A.

A few input choices and structural facts decide what the cells of A^n look like and whether the negative-exponent branch is even defined.

• • The calculator is limited to 2x2 matrices and integer exponents from -10 to 25. For a 3x3 matrix, the row-by-column rule still applies but each cell becomes a 3-term sum of products.
• • Output values are rounded to four decimal places for display, so a true fraction like 1/3 will appear as 0.3333 in the cell.

Roundoff for large n matches repeated matrix multiplication because each cell of A^n is a chain of |n| row-by-column products. The result is exact to four decimal places for most 2x2 inputs.

According to Wikipedia, a square matrix A is invertible exactly when its determinant is non-zero, and A^(-1) is the unique matrix that satisfies A * A^(-1) = A^(-1) * A = I.

When the negative-exponent case is too tight to compute by hand, the adjoint matrix calculator returns the adjugate [[a22, -a12], [-a21, a11]] that powers A^(-1) = adj(A) / det(A) using the same four input cells.