terican

Last verified · v1.0

Calculator · math

Adjoint (Adjugate) Matrix Calculator (3x3)

Calculates the adjoint (adjugate) of a 3x3 matrix by computing all nine cofactors and transposing the cofactor matrix. Displays any selected entry of adj(A).

FreeInstantNo signupOpen source

Inputs

Adjugate Matrix Entry

Explain my result

0/3 free

Get a plain-English breakdown of your result with practical next steps.

Adjugate Matrix Entry

The formula

How the
result is
computed.

What Is the Adjoint (Adjugate) Matrix?

The adjoint matrix, also called the adjugate matrix, is a foundational concept in linear algebra that enables exact computation of matrix inverses and provides the machinery behind Cramer's rule for solving linear systems. For a 3×3 matrix A, the adjoint is defined as the transpose of the cofactor matrix C, expressed as adj(A) = CT. This identity appears as equation 148 in The Matrix Cookbook by Petersen and Pedersen and is the classical definition adopted by virtually every linear algebra textbook and computational library in use today. Unlike numerical decomposition methods, the adjugate formula produces exact integer or rational results from integer inputs, making it especially valuable in symbolic computation and cryptographic applications.

The Core Formula and Its Variables

Three nested definitions build the adjoint from the ground up:

  • Minor Mij: Delete row i and column j from A, then compute the determinant of the remaining 2×2 submatrix. Each of the nine minors of a 3×3 matrix involves exactly two multiplications and one subtraction.
  • Cofactor Cij: Attach a sign to the minor — Cij = (−1)i+j · Mij. Positions where i+j is even keep a plus sign; positions where i+j is odd receive a minus sign.
  • Adjoint adj(A): Transpose the full cofactor matrix so that adj(A)ij = Cji. Note the reversed subscript order — the entry at row i, column j of adj(A) comes from cofactor Cji, not Cij.

The alternating sign pattern for a 3×3 matrix forms the checkerboard grid: row 1 is [+, −, +], row 2 is [−, +, −], row 3 is [+, −, +].

Step-by-Step Calculation for a 3×3 Matrix

Step 1 — Label Each Entry

Denote the nine elements of A as a11 through a33, where the first subscript is the row index and the second is the column index. This calculator accepts entries a11, a12, a13 (row 1), a21, a22, a23 (row 2), and a31, a32, a33 (row 3).

Step 2 — Compute All Nine 2×2 Minors

Delete one row and one column at a time and evaluate each resulting 2×2 determinant:

  • M11 = a22a33 − a23a32
  • M12 = a21a33 − a23a31
  • M13 = a21a32 − a22a31
  • M21 = a12a33 − a13a32
  • M22 = a11a33 − a13a31
  • M23 = a11a32 − a12a31
  • M31 = a12a23 − a13a22
  • M32 = a11a23 − a13a21
  • M33 = a11a22 − a12a21

Step 3 — Apply the Sign Pattern

Multiply each minor by (−1)i+j. So C11 = +M11, C12 = −M12, C13 = +M13, C21 = −M21, C22 = +M22, and so on through C33 = +M33.

Step 4 — Transpose to Obtain the Adjugate

Swap the rows and columns of the cofactor matrix. The first column of adj(A) is taken from the first row of C; the second column from the second row; and so on. This transpose step is the most common source of manual calculation errors — always verify subscript placement after transposing.

Worked Numerical Example

Let A have entries: row 1 = [1, 2, 3], row 2 = [0, 4, 5], row 3 = [1, 0, 6]. Computing the nine minors and applying signs gives cofactors C11 = 4·6 − 5·0 = 24, C12 = −(0·6 − 5·1) = 5, C13 = 0·0 − 4·1 = −4, C21 = −(2·6 − 3·0) = −12, C22 = 1·6 − 3·1 = 3, C23 = −(1·0 − 2·1) = 2, C31 = 2·5 − 3·4 = −2, C32 = −(1·5 − 3·0) = −5, C33 = 1·4 − 2·0 = 4. Transposing this cofactor matrix yields adj(A) with first row [24, −12, −2]. As established in Emory University's Section 3.2 on Determinants and Matrix Inverses, since det(A) = 22 for this matrix, the exact inverse is A−1 = adj(A) / 22 — no row reduction required.

Key Applications

  • Matrix Inversion: A−1 = adj(A) / det(A) when det(A) ≠ 0 — the primary and defining use of the adjugate.
  • Cramer's Rule: Express each variable in the system Ax = b as a ratio of determinants constructed from cofactors of A.
  • 3D Computer Graphics: Transform surface normal vectors correctly under non-uniform scaling using the inverse-transpose, which derives directly from adj(A).
  • Control Engineering: Compute resolvent matrices (sI − A)−1 in state-space models for Laplace-domain stability analysis.
  • Cryptography: Compute modular matrix inverses for Hill cipher encryption and decryption over integer residue fields.

Sources

Reference

Frequently asked questions

What is the difference between the adjoint and the adjugate matrix?
The terms adjoint and adjugate refer to the same mathematical object — the transpose of the cofactor matrix — when applied to real square matrices. Modern linear algebra texts prefer the word adjugate to avoid confusion with the conjugate transpose, also called the Hermitian adjoint, which applies in complex vector spaces. For real-valued 3x3 matrices the distinction is purely terminological, and this calculator uses both terms interchangeably.
How do you calculate the adjoint of a 3x3 matrix step by step?
First, compute all nine 2x2 minors by deleting one row and one column at a time and evaluating each 2x2 determinant. Second, multiply each minor by the sign factor (-1)^(i+j) to form the nine cofactors. Third, transpose the cofactor matrix by swapping row and column indices to produce adj(A). The full process requires exactly nine 2x2 determinant evaluations, each involving two multiplications and one subtraction.
What is the relationship between the adjoint matrix and the matrix inverse?
When det(A) is nonzero, the matrix inverse satisfies A-inverse = adj(A) divided by det(A). This exact closed-form formula requires no Gaussian elimination and avoids floating-point accumulation errors, making it ideal for symbolic computation and small matrices. Dividing every entry of adj(A) by the scalar det(A) yields the inverse directly. For singular matrices where det(A) equals zero, adj(A) still exists and is well-defined, but the inverse does not.
Can the adjoint matrix be computed when the matrix is singular?
Yes — the adjoint matrix is defined for any square matrix regardless of whether det(A) equals zero. The computation relies only on 2x2 minor determinants and sign assignments, never on division by det(A). However, when A is singular, the product adj(A) times A equals det(A) times the identity matrix, which collapses to the zero matrix, confirming non-invertibility. The adjugate always exists even when the inverse does not.
What are practical applications of the adjoint matrix in engineering and science?
The adjoint matrix appears across multiple technical fields. In 3D computer graphics, the adjugate provides correct transformation of surface normal vectors under non-uniform scaling. In control engineering, it appears in resolvent matrix expressions essential for Laplace-domain stability analysis. In cryptography, Hill cipher decryption computes a modular matrix inverse via the adjugate. In economics and statistics, Cramer's rule applies cofactors to solve input-output linear systems exactly without numerical decomposition.
How does the sign pattern (-1)^(i+j) work in cofactor and adjoint calculation?
The factor (-1)^(i+j) assigns a plus sign to positions where i+j is even and a minus sign where i+j is odd, creating an alternating checkerboard pattern. For a 3x3 matrix, row 1 receives signs [+, -, +], row 2 receives [-, +, -], and row 3 receives [+, -, +]. This alternation ensures that cofactor expansion along any row or column yields the correct determinant value, and it guarantees that adj(A) times A equals det(A) times the identity matrix.