In linear algebra, the adjugate or classical adjoint of a square matrix is a matrix which plays a role similar to the inverse of a matrix; it can however be defined for any square matrix without the need to perform any divisions.

The adjugate has sometimes been called the "adjoint", but that terminology is ambiguous. Today, "adjoint" of a matrix normally refers to its corresponding adjoint operator, which is its conjugate transpose.

Definition

Suppose R is a commutative ring and A is an n×n matrix with entries from R. The definition of the adjugate of A is a multi-step process:

• Define the (i,j) minor of A, denoted M_ij, as the determinant of the (n − 1)×(n − 1) matrix that results from deleting row i and column j of A.
• Define the (i,j) cofactor of A as

$mathbf\{C\}\_\{ij\}\; =\; (-1)^\{i+j\}\; mathbf\{M\}\_\{ij\}.\; ,$

• Define the cofactor matrix of A, as the n×n matrix C whose (i,j) entry is the (i,j) cofactor of A.

The adjugate of A is the transpose of the cofactor matrix of A:

$mathrm\{adj\}(mathbf\{A\})\; =\; mathbf\{C\}^T\; ,$.

That is, the adjugate of A is the n×n matrix whose (i,j) entry is the (j,i) cofactor of A:

$mathrm\{adj\}(mathbf\{A\})\_\{ij\}\; =\; mathbf\{C\}\_\{ji\}\; ,$.

Examples

2x2 generic matrix

The adjugate of the $2times\; 2$ matrix

is

.

3x3 generic matrix

Consider the $3times\; 3$ matrix

$$

mathbf{A} = begin{pmatrix} A_{11} & A_{12} & A_{13} A_{21} & A_{22} & A_{23} A_{31} & A_{32} & A_{33} end{pmatrix} = begin{pmatrix} 1 & 2 & 3 4 & 5 & 6 7 & 8 & 9 end{pmatrix}. Its adjugate is

$operatorname\{adj\}(mathbf\{A\})\; =\; begin\{pmatrix\}$

+left| begin{matrix} 5 & 6 8 & 9 end{matrix} right| & -left| begin{matrix} 2 & 3 8 & 9 end{matrix} right| & +left| begin{matrix} 2 & 3 5 & 6 end{matrix} right|

& & 

-left| begin{matrix} 4 & 6 7 & 9 end{matrix} right| & +left| begin{matrix} 1 & 3 7 & 9 end{matrix} right| & -left| begin{matrix} 1 & 3 4 & 6 end{matrix} right|

& & 

+left| begin{matrix} 4 & 5 7 & 8 end{matrix} right| & -left| begin{matrix} 1 & 2 7 & 8 end{matrix} right| & +left| begin{matrix} 1 & 2 4 & 5 end{matrix} right| end{pmatrix} where

detleft( begin{matrix} A_{im} & A_{in} ,,A_{jm} & A_{jn} end{matrix} right).

Note that the adjugate is the transpose of the cofactor matrix. Thus, for instance, the (3,2) entry of the adjugate is the (2,3) cofactor of A.

3x3 numeric matrix

As a specific example, we have

$operatorname\{adj\}begin\{pmatrix\}$

!-3 & , 2 & !-5 !-1 & , 0 & !-2 , 3 & !-4 & , 1 end{pmatrix}= begin{pmatrix} !-8 & 18 & !-4 !-5 & 12 & !-1 , 4 & !-6 & , 2 end{pmatrix} .

The −6 in the third row, second column of the adjugate was computed as follows:

.

Again, the (3,2) entry of the adjugate is the (2,3) cofactor of A. Thus, the submatrix

was obtained by deleting the second row and third column of the original matrix A.

Applications

As a consequence of Laplace's formula for the determinant of an n×n matrix A, we have

$mathbf\{A\},\; mathrm\{adj\}(mathbf\{A\})\; =\; mathrm\{adj\}(mathbf\{A\}),\; mathbf\{A\}\; =\; det(mathbf\{A\}),\; mathbf\{I\}qquad\; (*)$

where I is the n×n identity matrix. Indeed, the (i,i) entry of the product A adj(A) is the scalar product of row i of A with row i of the cofactor matrix C, which is simply the Laplace formula for det(A) expanded by row i. Moreover, for i ≠ j the (i,j) entry of the product is the scalar product of row i of A with row j of C, which is the Laplace formula for the determinant of a matrix whose i and j rows are equal and is therefore zero.

From this formula follows one of the most important results in matrix algebra: A matrix A over a commutative ring R is invertible if and only if det(A) is invertible in R.

For if A is an invertible matrix then

$1\; =\; det(mathbf\; I)\; =\; det(mathbf\{A\}\; mathbf\{A\}^\{-1\})\; =\; det(mathbf\{A\})\; det(mathbf\{A\}^\{-1\}),$

and if det(A) is a unit then (*) above shows that

$mathbf\{A\}^\{-1\}\; =\; det(mathbf\{A\})^\{-1\},\; mathrm\{adj\}(mathbf\{A\}).$

Properties

The adjugate has the properties

$mathrm\{adj\}(mathbf\{I\})\; =\; mathbf\{I\},$

$mathrm\{adj\}(mathbf\{AB\})\; =\; mathrm\{adj\}(mathbf\{B\}),mathrm\{adj\}(mathbf\{A\}),$

for all n×n matrices A and B.

The adjugate preserves transposition:

$mathrm\{adj\}(mathbf\{A\}^T)\; =\; mathrm\{adj\}(mathbf\{A\})^T,$.

Furthermore,

$detbig(mathrm\{adj\}(mathbf\{A\})big)\; =\; det(mathbf\{A\})^\{n-1\},$.

If p(t) = det(A − tI) is the characteristic polynomial of A and we define the polynomial q(t) = (p(0) − p(t))/t, then

$mathrm\{adj\}(mathbf\{A\})\; =\; q(mathbf\{A\})\; =\; -(p\_1\; mathbf\{I\}\; +\; p\_2\; mathbf\{A\}\; +\; p\_3\; mathbf\{A\}^2\; +\; cdots\; +\; p\_\{n\}\; mathbf\{A\}^\{n-1\})$,

where $p\_j$ are the coefficients of p(t),

$p(t)\; =\; p\_0\; +\; p\_1\; t\; +\; p\_2\; t^2\; +\; cdots\; p\_\{n\}\; t^\{n\}.$

The adjugate also appears in the formula of the derivative of the determinant.

References

• Strang, Gilbert (1988). Linear Algebra and its Applications. Third edition, Harcourt Brace Jovanovich.

External links

• Matrix Reference Manual