Skip to main content

Matrix Adjoint (Adjugate) Calculator

Compute the classical adjoint (adjugate) of a 2×2 matrix, which is the transpose of its cofactor matrix. Also returns the matrix determinant, since the adjoint and the inverse are linked by A · adj(A) = det(A) · I.

Category: Mathematics

Matrix Adjoint (Adjugate) Calculator Inputs

Enter values to calculate

Top-left entry.

Top-right entry.

Bottom-left entry.

Bottom-right entry.

Enable JavaScript for interactive calculation and step-by-step results.

Matrix Adjoint (Adjugate) Calculator Formula

Equation

\mathrmadj\beginpmatrix a & b \\ c & d \endpmatrix = \beginpmatrix d & -b \\ -c & a \endpmatrix

Excel Formula

={adj}{pmatrix}a&b&dEXP(1)nd{pmatrix}={pmatrix}d&-b\-c&aEXP(1)nd{pmatrix}

Variables

  • a (row 1 col 1) — Top-left entry.
  • b (row 1 col 2) — Top-right entry.
  • c (row 2 col 1) — Bottom-left entry.
  • d (row 2 col 2) — Bottom-right entry.

How the Matrix Adjoint (Adjugate) Calculator Works

The classical adjoint of a square matrix A, denoted adj(A), is the transpose of its cofactor matrix. It is one of the building blocks of the explicit formula for the matrix inverse: A · adj(A) = det(A) · I, so A⁻¹ = (1/det A) · adj(A) when det A ≠ 0.

The core relationship is \mathrm{adj}\begin{pmatrix} a & b \\ c & d \end{pmatrix} = \begin{pmatrix} d & -b \\ -c & a \end{pmatrix}. Typical inputs include a (row 1 col 1), b (row 1 col 2), c (row 2 col 1), d (row 2 col 2).

Enter your values in the matrix adjoint (adjugate) calculator above, review the step-by-step solution, and compare against the worked examples below so you can see how each input changes the result. This free online mathematics tool is built for homework, design checks, and professional verification.

Matrix Adjoint (Adjugate) Calculator Theory & Explanation

Definition

Replace each entry with its cofactor (signed minor), then transpose. For a 2×2 matrix, the cofactor of a is +det of the 1×1 remainder (i.e. d), and so on:

\mathrmadj(A) = \beginpmatrix +d & -b \\ -c & +a \endpmatrix

2×2 shortcut

For a 2×2 matrix, the adjoint is just the matrix of cofactors transposed: swap the diagonal entries (a and d) and negate the off-diagonal entries (b and c).

General formula for the inverse

The classical matrix inverse exists whenever the determinant is nonzero, and is given by:

A^-1 = (1)/(\det(A)) \, \mathrmadj(A)

Determinant

The 2×2 determinant is the "diagonal product minus the anti-diagonal product":

\det(A) = ad - bc

When is A invertible?

A is invertible if and only if det(A) ≠ 0. Geometrically, det(A) = 0 means the columns of A are linearly dependent — the matrix collapses a 2D area to a line or point.

Building the Adjugate Step by Step

The adjugate is constructed in three passes. First compute the minor M_ij of each entry — the determinant of the matrix left after deleting row i and column j. Second, attach the checkerboard sign (-1)^i+j to turn each minor into a cofactor C_ij. Third, transpose the whole cofactor matrix.

That final transpose is the step most often forgotten, and it is what distinguishes the adjugate from the cofactor matrix. For a 2×2 matrix the whole procedure collapses to a memorable shortcut: swap the two diagonal entries and negate the two off-diagonal ones. So the adjugate of \beginpmatrix a & b \\ c & d \endpmatrix is \beginpmatrix d & -b \\ -c & a \endpmatrix — which, divided by ad - bc, gives the familiar 2×2 inverse formula.

\operatornameadj(A) = C^T, \quad C_ij = (-1)^i+j M_ij

The Defining Identity

The adjugate satisfies A\,\operatornameadj(A) = \operatornameadj(A)\,A = \det(A)\,I for every square matrix — including singular ones. This single identity is the source of everything else the adjugate is used for.

When \det(A) \ne 0, dividing through gives the inverse directly. When \det(A) = 0, the identity still holds and says something interesting instead: the product A\,\operatornameadj(A) is the zero matrix, so every column of the adjugate lies in the null space of A. That is why the adjugate of a rank-deficient matrix is not merely useless but structurally informative — for an n× n matrix of rank n-1, the adjugate has rank exactly 1, and for rank below n-1 it vanishes entirely.

A\,\operatornameadj(A) = \det(A)\,I \quad \Rightarrow \quad A^-1 = \frac\operatornameadj(A)\det(A)

When to Use It — and When Not To

The adjugate route to the inverse is exact and symbolic, which makes it valuable in three situations: hand computation of small matrices, algebraic work where entries are variables rather than numbers, and theoretical arguments such as proving Cramer's rule or showing that the inverse of an integer matrix with determinant ±1 is again an integer matrix.

For numerical work on anything larger it is the wrong tool. Computing an n× n adjugate requires n^2 determinants of size n-1, giving roughly O(n!) cost by naive expansion — against O(n^3) for Gaussian elimination with partial pivoting, which is also far better conditioned. The practical rule: use the adjugate for 2×2 and 3×3 by hand or in symbolic algebra, and use LU decomposition or, better still, solve the linear system directly without ever forming the inverse for anything numerical.

\det(\operatornameadj(A)) = \det(A)^\,n-1

Matrix Adjoint (Adjugate) Calculator Worked Examples

Worked Example

Inputs

  • a: 1
  • b: 2
  • c: 3
  • d: 4

Result: adjoint: [object Object] determinant: -2 inverseA: -0.5 inverseB: 0.5 inverseC: 0.75 inverseD: -0.25 invertible: true

Explanation

A = [[1,2],[3,4]]. adj(A) = [[4, −2], [−3, 1]]. det(A) = 1·4 − 2·3 = −2. Since det ≠ 0, A⁻¹ = adj(A)/det = [[−2, 1], [1.5, −0.5]].

Second Scenario

Inputs

  • a: 2.25
  • b: 2
  • c: 3
  • d: 4

Result: adjoint: [object Object] determinant: -2 inverseA: -0.5 inverseB: 0.5 inverseC: 0.75 inverseD: -0.25 invertible: true

Explanation

This scenario uses different inputs (a = 2.25, b = 2, c = 3, d = 4) to show how changing one variable affects the matrix adjoint (adjugate) result. Run the calculator above with these values to get the exact updated output with step-by-step work.

Common Matrix Adjoint (Adjugate) Calculator Use Cases

  • Homework and exam practice
  • Engineering and science coursework
  • Quick verification of hand calculations
  • Matrix Adjoint (Adjugate) homework and study
  • Matrix Adjoint (Adjugate) design and analysis

Matrix Adjoint (Adjugate) Calculator FAQs

How is adjugate different from adjoint?

In modern usage they are the same thing — "adjoint" or "adjugate" both refer to the transpose of the cofactor matrix. The older operator-theoretic meaning of "adjoint" (Hermitian conjugate A*) is distinct from this classical algebraic usage.

Why does A · adj(A) = det(A) · I hold?

It is the elegant generalization of Cramer's rule, in which the inverse of a matrix is expressed in closed form: A · adj(A) collapses onto the diagonal because every cross-product (adjoint along with another entry) produces the determinant, while every diagonal entry is exactly det(A).

What about 3×3 matrices?

For a 3×3 matrix, you compute nine 2×2 cofactors, arrange them in a cofactor matrix, and transpose to get the adjoint. The same A · adj(A) = det(A) · I property holds.

Is there a fast use for this in algorithms?

For 2×2 matrices, it's a clear explicit formula worth using directly. For larger matrices, computing the adjoint explicitly is O(n!) — generally slower than Gaussian elimination for the inverse. The formula is mostly a theoretical tool, not a numerical routine.

What is the difference between the adjugate and the cofactor matrix?

The adjugate is the transpose of the cofactor matrix. Build the cofactors first by taking each minor with its checkerboard sign, then transpose the whole array. Skipping that transpose is the most common error, and for a non-symmetric matrix it silently produces the wrong inverse.