Adjugate matrix (original) (raw)

For a square matrix, the transpose of the cofactor matrix

In linear algebra, the adjugate or classical adjoint of a square matrix A, adj(A), is the transpose of its cofactor matrix.[1][2] It is occasionally known as adjunct matrix,[3][4] or "adjoint",[5] though that normally refers to a different concept, the adjoint operator which for a matrix is the conjugate transpose.

The product of a matrix with its adjugate gives a diagonal matrix (entries not on the main diagonal are zero) whose diagonal entries are the determinant of the original matrix:

A adj ⁡ ( A ) = det ( A ) I , {\displaystyle \mathbf {A} \operatorname {adj} (\mathbf {A} )=\det(\mathbf {A} )\mathbf {I} ,}

where I is the identity matrix of the same size as A. Consequently, the multiplicative inverse of an invertible matrix can be found by dividing its adjugate by its determinant.

The adjugate of A is the transpose of the cofactor matrix C of A,

adj ⁡ ( A ) = C T . {\displaystyle \operatorname {adj} (\mathbf {A} )=\mathbf {C} ^{\mathsf {T}}.}

In more detail, suppose R is a unital+ commutative ring and A is an n × n matrix with entries from R. The (i, j)-minor of A, denoted Mij, is the determinant of the (n − 1) × (n − 1) matrix that results from deleting row i and column j of A. The cofactor matrix of A is the n × n matrix C whose (i, j) entry is the (i, j) cofactor of A, which is the (i, j)-minor times a sign factor:

C = ( ( − 1 ) i + j M i j ) 1 ≤ i , j ≤ n . {\displaystyle \mathbf {C} =\left((-1)^{i+j}\mathbf {M} _{ij}\right)_{1\leq i,j\leq n}.}

The adjugate of A is the transpose of C, that is, the n × n matrix whose (i, j) entry is the (j, i) cofactor of A,

adj ⁡ ( A ) = C T = ( ( − 1 ) i + j M j i ) 1 ≤ i , j ≤ n . {\displaystyle \operatorname {adj} (\mathbf {A} )=\mathbf {C} ^{\mathsf {T}}=\left((-1)^{i+j}\mathbf {M} _{ji}\right)_{1\leq i,j\leq n}.}

Important consequence

[edit]

The adjugate is defined so that the product of A with its adjugate yields a diagonal matrix whose diagonal entries are the determinant det(A). That is,

A adj ⁡ ( A ) = adj ⁡ ( A ) A = det ( A ) I , {\displaystyle \mathbf {A} \operatorname {adj} (\mathbf {A} )=\operatorname {adj} (\mathbf {A} )\mathbf {A} =\det(\mathbf {A} )\mathbf {I} ,}

where I is the n × n identity matrix. This is a consequence of the Laplace expansion of the determinant.

The above formula implies one of the fundamental results in matrix algebra, that A is invertible if and only if det(A) is an invertible element of R. When this holds, the equation above yields

adj ⁡ ( A ) = det ( A ) A − 1 , A − 1 = det ( A ) − 1 adj ⁡ ( A ) . {\displaystyle {\begin{aligned}\operatorname {adj} (\mathbf {A} )&=\det(\mathbf {A} )\mathbf {A} ^{-1},\\\mathbf {A} ^{-1}&=\det(\mathbf {A} )^{-1}\operatorname {adj} (\mathbf {A} ).\end{aligned}}}

1 × 1 generic matrix

[edit]

Since the determinant of a 0 × 0 matrix is 1, the adjugate of any 1 × 1 matrix (complex scalar) is I = [ 1 ] {\displaystyle \mathbf {I} ={\begin{bmatrix}1\end{bmatrix}}} . Observe that A adj ⁡ ( A ) = A I = ( det A ) I . {\displaystyle \mathbf {A} \operatorname {adj} (\mathbf {A} )=\mathbf {A} \mathbf {I} =(\det \mathbf {A} )\mathbf {I} .}

2 × 2 generic matrix

[edit]

The adjugate of the 2 × 2 matrix

A = [ a b c d ] {\displaystyle \mathbf {A} ={\begin{bmatrix}a&b\\c&d\end{bmatrix}}}

is

adj ⁡ ( A ) = [ d − b − c a ] . {\displaystyle \operatorname {adj} (\mathbf {A} )={\begin{bmatrix}d&-b\\-c&a\end{bmatrix}}.}

By direct computation,

A adj ⁡ ( A ) = [ a d − b c 0 0 a d − b c ] = ( det A ) I . {\displaystyle \mathbf {A} \operatorname {adj} (\mathbf {A} )={\begin{bmatrix}ad-bc&0\\0&ad-bc\end{bmatrix}}=(\det \mathbf {A} )\mathbf {I} .}

In this case, it is also true that det(adj(A)) = det(A) and hence that adj(adj(A)) = A.

3 × 3 generic matrix

[edit]

Consider a 3 × 3 matrix

A = [ a 1 a 2 a 3 b 1 b 2 b 3 c 1 c 2 c 3 ] . {\displaystyle \mathbf {A} ={\begin{bmatrix}a_{1}&a_{2}&a_{3}\\b_{1}&b_{2}&b_{3}\\c_{1}&c_{2}&c_{3}\end{bmatrix}}.}

Its cofactor matrix is

C = [ + | b 2 b 3 c 2 c 3 | − | b 1 b 3 c 1 c 3 | + | b 1 b 2 c 1 c 2 | − | a 2 a 3 c 2 c 3 | + | a 1 a 3 c 1 c 3 | − | a 1 a 2 c 1 c 2 | + | a 2 a 3 b 2 b 3 | − | a 1 a 3 b 1 b 3 | + | a 1 a 2 b 1 b 2 | ] , {\displaystyle \mathbf {C} ={\begin{bmatrix}+{\begin{vmatrix}b_{2}&b_{3}\\c_{2}&c_{3}\end{vmatrix}}&-{\begin{vmatrix}b_{1}&b_{3}\\c_{1}&c_{3}\end{vmatrix}}&+{\begin{vmatrix}b_{1}&b_{2}\\c_{1}&c_{2}\end{vmatrix}}\\\\-{\begin{vmatrix}a_{2}&a_{3}\\c_{2}&c_{3}\end{vmatrix}}&+{\begin{vmatrix}a_{1}&a_{3}\\c_{1}&c_{3}\end{vmatrix}}&-{\begin{vmatrix}a_{1}&a_{2}\\c_{1}&c_{2}\end{vmatrix}}\\\\+{\begin{vmatrix}a_{2}&a_{3}\\b_{2}&b_{3}\end{vmatrix}}&-{\begin{vmatrix}a_{1}&a_{3}\\b_{1}&b_{3}\end{vmatrix}}&+{\begin{vmatrix}a_{1}&a_{2}\\b_{1}&b_{2}\end{vmatrix}}\end{bmatrix}},}

where

| a b c d | = det [ a b c d ] . {\displaystyle {\begin{vmatrix}a&b\\c&d\end{vmatrix}}=\det \!{\begin{bmatrix}a&b\\c&d\end{bmatrix}}.}

Its adjugate is the transpose of its cofactor matrix,

adj ⁡ ( A ) = C T = [ + | b 2 b 3 c 2 c 3 | − | a 2 a 3 c 2 c 3 | + | a 2 a 3 b 2 b 3 | − | b 1 b 3 c 1 c 3 | + | a 1 a 3 c 1 c 3 | − | a 1 a 3 b 1 b 3 | + | b 1 b 2 c 1 c 2 | − | a 1 a 2 c 1 c 2 | + | a 1 a 2 b 1 b 2 | ] . {\displaystyle \operatorname {adj} (\mathbf {A} )=\mathbf {C} ^{\mathsf {T}}={\begin{bmatrix}+{\begin{vmatrix}b_{2}&b_{3}\\c_{2}&c_{3}\end{vmatrix}}&-{\begin{vmatrix}a_{2}&a_{3}\\c_{2}&c_{3}\end{vmatrix}}&+{\begin{vmatrix}a_{2}&a_{3}\\b_{2}&b_{3}\end{vmatrix}}\\&&\\-{\begin{vmatrix}b_{1}&b_{3}\\c_{1}&c_{3}\end{vmatrix}}&+{\begin{vmatrix}a_{1}&a_{3}\\c_{1}&c_{3}\end{vmatrix}}&-{\begin{vmatrix}a_{1}&a_{3}\\b_{1}&b_{3}\end{vmatrix}}\\&&\\+{\begin{vmatrix}b_{1}&b_{2}\\c_{1}&c_{2}\end{vmatrix}}&-{\begin{vmatrix}a_{1}&a_{2}\\c_{1}&c_{2}\end{vmatrix}}&+{\begin{vmatrix}a_{1}&a_{2}\\b_{1}&b_{2}\end{vmatrix}}\end{bmatrix}}.}

3 × 3 numeric matrix

[edit]

As a specific example, we have

adj [ − 3 2 − 5 − 1 0 − 2 3 − 4 1 ] = [ − 8 18 − 4 − 5 12 − 1 4 − 6 2 ] . {\displaystyle \operatorname {adj} \!{\begin{bmatrix}-3&2&-5\\-1&0&-2\\3&-4&1\end{bmatrix}}={\begin{bmatrix}-8&18&-4\\-5&12&-1\\4&-6&2\end{bmatrix}}.}

It is easy to check the adjugate is the inverse times the determinant, −6.

The −1 in the second row, third column of the adjugate was computed as follows. The (2,3) entry of the adjugate is the (3,2) cofactor of A. This cofactor is computed using the submatrix obtained by deleting the third row and second column of the original matrix A,

[ − 3 − 5 − 1 − 2 ] . {\displaystyle {\begin{bmatrix}-3&-5\\-1&-2\end{bmatrix}}.}

The (3,2) cofactor is a sign times the determinant of this submatrix:

( − 1 ) 3 + 2 det [ − 3 − 5 − 1 − 2 ] = − ( − 3 ⋅ − 2 − − 5 ⋅ − 1 ) = − 1 , {\displaystyle (-1)^{3+2}\operatorname {det} \!{\begin{bmatrix}-3&-5\\-1&-2\end{bmatrix}}=-(-3\cdot -2--5\cdot -1)=-1,}

and this is the (2,3) entry of the adjugate.

For any n × n matrix A, elementary computations show that adjugates have the following properties:

Over the complex numbers,

Suppose that B is another n × n matrix. Then

adj ⁡ ( A B ) = adj ⁡ ( B ) adj ⁡ ( A ) . {\displaystyle \operatorname {adj} (\mathbf {AB} )=\operatorname {adj} (\mathbf {B} )\operatorname {adj} (\mathbf {A} ).}

This can be proved in three ways. One way, valid for any commutative ring, is a direct computation using the Cauchy–Binet formula. The second way, valid for the real or complex numbers, is to first observe that for invertible matrices A and B,

adj ⁡ ( B ) adj ⁡ ( A ) = ( det B ) B − 1 ( det A ) A − 1 = ( det A B ) ( A B ) − 1 = adj ⁡ ( A B ) . {\displaystyle \operatorname {adj} (\mathbf {B} )\operatorname {adj} (\mathbf {A} )=(\det \mathbf {B} )\mathbf {B} ^{-1}(\det \mathbf {A} )\mathbf {A} ^{-1}=(\det \mathbf {AB} )(\mathbf {AB} )^{-1}=\operatorname {adj} (\mathbf {AB} ).}

Because every non-invertible matrix is the limit of invertible matrices, continuity of the adjugate then implies that the formula remains true when one of A or B is not invertible.

A corollary of the previous formula is that, for any non-negative integer k,

adj ⁡ ( A k ) = adj ⁡ ( A ) k . {\displaystyle \operatorname {adj} (\mathbf {A} ^{k})=\operatorname {adj} (\mathbf {A} )^{k}.}

If A is invertible, then the above formula also holds for negative k.

From the identity

( A + B ) adj ⁡ ( A + B ) B = det ( A + B ) B = B adj ⁡ ( A + B ) ( A + B ) , {\displaystyle (\mathbf {A} +\mathbf {B} )\operatorname {adj} (\mathbf {A} +\mathbf {B} )\mathbf {B} =\det(\mathbf {A} +\mathbf {B} )\mathbf {B} =\mathbf {B} \operatorname {adj} (\mathbf {A} +\mathbf {B} )(\mathbf {A} +\mathbf {B} ),}

we deduce

A adj ⁡ ( A + B ) B = B adj ⁡ ( A + B ) A . {\displaystyle \mathbf {A} \operatorname {adj} (\mathbf {A} +\mathbf {B} )\mathbf {B} =\mathbf {B} \operatorname {adj} (\mathbf {A} +\mathbf {B} )\mathbf {A} .}

Suppose that A commutes with B. Multiplying the identity AB = BA on the left and right by adj(A) proves that

det ( A ) adj ⁡ ( A ) B = det ( A ) B adj ⁡ ( A ) . {\displaystyle \det(\mathbf {A} )\operatorname {adj} (\mathbf {A} )\mathbf {B} =\det(\mathbf {A} )\mathbf {B} \operatorname {adj} (\mathbf {A} ).}

If A is invertible, this implies that adj(A) also commutes with B. Over the real or complex numbers, continuity implies that adj(A) commutes with B even when A is not invertible.

Finally, there is a more general proof than the second proof, which only requires that an n × n matrix has entries over a field with at least 2_n_ + 1 elements (e.g. a 5 × 5 matrix over the integers modulo 11). det(A+t I) is a polynomial in t with degree at most n, so it has at most n roots. Note that the ij th entry of adj((A+t I)(B)) is a polynomial of at most order n, and likewise for adj(A+t I) adj(B). These two polynomials at the ij th entry agree on at least n + 1 points, as we have at least n + 1 elements of the field where A+t I is invertible, and we have proven the identity for invertible matrices. Polynomials of degree n which agree on n + 1 points must be identical (subtract them from each other and you have n + 1 roots for a polynomial of degree at most n – a contradiction unless their difference is identically zero). As the two polynomials are identical, they take the same value for every value of t. Thus, they take the same value when t = 0.

Using the above properties and other elementary computations, it is straightforward to show that if A has one of the following properties, then adj A does as well:

• upper triangular,
• lower triangular,
• diagonal,
• orthogonal,
• unitary,
• symmetric,
• Hermitian,
• normal.

If A is skew-symmetric, then adj(A) is skew-symmetric for even n and symmetric for odd n. Similarly, if A is skew-Hermitian, then adj(A) is skew-Hermitian for even n and Hermitian for odd n.

If A is invertible, then, as noted above, there is a formula for adj(A) in terms of the determinant and inverse of A. When A is not invertible, the adjugate satisfies different but closely related formulas.

• If rk(A) ≤ n − 2, then adj(A) = 0.
• If rk(A) = n − 1, then rk(adj(A)) = 1. (Some minor is non-zero, so adj(A) is non-zero and hence has rank at least one; the identity adj(A) A = 0 implies that the dimension of the nullspace of adj(A) is at least n − 1, so its rank is at most one.) It follows that adj(A) = αxyT, where α is a scalar and x and y are vectors such that Ax = 0 and AT y = 0.

Column substitution and Cramer's rule

[edit]

Partition A into column vectors:

A = [ a 1 ⋯ a n ] . {\displaystyle \mathbf {A} ={\begin{bmatrix}\mathbf {a} _{1}&\cdots &\mathbf {a} _{n}\end{bmatrix}}.}

Let b be a column vector of size n. Fix 1 ≤ i ≤ n and consider the matrix formed by replacing column i of A by b:

( A ← i b ) = def [ a 1 ⋯ a i − 1 b a i + 1 ⋯ a n ] . {\displaystyle (\mathbf {A} {\stackrel {i}{\leftarrow }}\mathbf {b} )\ {\stackrel {\text{def}}{=}}\ {\begin{bmatrix}\mathbf {a} _{1}&\cdots &\mathbf {a} _{i-1}&\mathbf {b} &\mathbf {a} _{i+1}&\cdots &\mathbf {a} _{n}\end{bmatrix}}.}

Laplace expand the determinant of this matrix along column i. The result is entry i of the product adj(A)b. Collecting these determinants for the different possible i yields an equality of column vectors

( det ( A ← i b ) ) i = 1 n = adj ⁡ ( A ) b . {\displaystyle \left(\det(\mathbf {A} {\stackrel {i}{\leftarrow }}\mathbf {b} )\right)_{i=1}^{n}=\operatorname {adj} (\mathbf {A} )\mathbf {b} .}

This formula has the following concrete consequence. Consider the linear system of equations

A x = b . {\displaystyle \mathbf {A} \mathbf {x} =\mathbf {b} .}

Assume that A is non-singular. Multiplying this system on the left by adj(A) and dividing by the determinant yields

x = adj ⁡ ( A ) b det A . {\displaystyle \mathbf {x} ={\frac {\operatorname {adj} (\mathbf {A} )\mathbf {b} }{\det \mathbf {A} }}.}

Applying the previous formula to this situation yields Cramer's rule,

x i = det ( A ← i b ) det A , {\displaystyle x_{i}={\frac {\det(\mathbf {A} {\stackrel {i}{\leftarrow }}\mathbf {b} )}{\det \mathbf {A} }},}

where x i is the ith entry of x.

Characteristic polynomial

[edit]

Let the characteristic polynomial of A be

p ( s ) = det ( s I − A ) = ∑ i = 0 n p i s i ∈ R [ s ] . {\displaystyle p(s)=\det(s\mathbf {I} -\mathbf {A} )=\sum _{i=0}^{n}p_{i}s^{i}\in R[s].}

The first divided difference of p is a symmetric polynomial of degree n − 1,

Δ p ( s , t ) = p ( s ) − p ( t ) s − t = ∑ 0 ≤ j + k < n p j + k + 1 s j t k ∈ R [ s , t ] . {\displaystyle \Delta p(s,t)={\frac {p(s)-p(t)}{s-t}}=\sum _{0\leq j+k<n}p_{j+k+1}s^{j}t^{k}\in R[s,t].}

Multiply sI − A by its adjugate. Since p(A) = 0 by the Cayley–Hamilton theorem, some elementary manipulations reveal

adj ⁡ ( s I − A ) = Δ p ( s I , A ) . {\displaystyle \operatorname {adj} (s\mathbf {I} -\mathbf {A} )=\Delta p(s\mathbf {I} ,\mathbf {A} ).}

In particular, the resolvent of A is defined to be

R ( z ; A ) = ( z I − A ) − 1 , {\displaystyle R(z;\mathbf {A} )=(z\mathbf {I} -\mathbf {A} )^{-1},}

and by the above formula, this is equal to

R ( z ; A ) = Δ p ( z I , A ) p ( z ) . {\displaystyle R(z;\mathbf {A} )={\frac {\Delta p(z\mathbf {I} ,\mathbf {A} )}{p(z)}}.}

The adjugate also appears in Jacobi's formula for the derivative of the determinant. If A(t) is continuously differentiable, then

d ( det A ) d t ( t ) = tr ⁡ ( adj ⁡ ( A ( t ) ) A ′ ( t ) ) . {\displaystyle {\frac {d(\det \mathbf {A} )}{dt}}(t)=\operatorname {tr} \left(\operatorname {adj} (\mathbf {A} (t))\mathbf {A} '(t)\right).}

It follows that the total derivative of the determinant is the transpose of the adjugate:

d ( det A ) A 0 = adj ⁡ ( A 0 ) T . {\displaystyle d(\det \mathbf {A} )_{\mathbf {A} _{0}}=\operatorname {adj} (\mathbf {A} _{0})^{\mathsf {T}}.}

Cayley–Hamilton formula

[edit]

Let pA(t) be the characteristic polynomial of A. The Cayley–Hamilton theorem states that

p A ( A ) = 0 . {\displaystyle p_{\mathbf {A} }(\mathbf {A} )=\mathbf {0} .}

Separating the constant term and multiplying the equation by adj(A) gives an expression for the adjugate that depends only on A and the coefficients of pA(t). These coefficients can be explicitly represented in terms of traces of powers of A using complete exponential Bell polynomials. The resulting formula is

adj ⁡ ( A ) = ∑ s = 0 n − 1 A s ∑ k 1 , k 2 , … , k n − 1 ∏ ℓ = 1 n − 1 ( − 1 ) k ℓ + 1 ℓ k ℓ k ℓ ! tr ⁡ ( A ℓ ) k ℓ , {\displaystyle \operatorname {adj} (\mathbf {A} )=\sum _{s=0}^{n-1}\mathbf {A} ^{s}\sum _{k_{1},k_{2},\ldots ,k_{n-1}}\prod _{\ell =1}^{n-1}{\frac {(-1)^{k_{\ell }+1}}{\ell ^{k_{\ell }}k_{\ell }!}}\operatorname {tr} (\mathbf {A} ^{\ell })^{k_{\ell }},}

where n is the dimension of A, and the sum is taken over s and all sequences of kl ≥ 0 satisfying the linear Diophantine equation

s + ∑ ℓ = 1 n − 1 ℓ k ℓ = n − 1. {\displaystyle s+\sum _{\ell =1}^{n-1}\ell k_{\ell }=n-1.}

For the 2 × 2 case, this gives

adj ⁡ ( A ) = I 2 ( tr ⁡ A ) − A . {\displaystyle \operatorname {adj} (\mathbf {A} )=\mathbf {I} _{2}(\operatorname {tr} \mathbf {A} )-\mathbf {A} .}

For the 3 × 3 case, this gives

adj ⁡ ( A ) = 1 2 I 3 ( ( tr ⁡ A ) 2 − tr ⁡ A 2 ) − A ( tr ⁡ A ) + A 2 . {\displaystyle \operatorname {adj} (\mathbf {A} )={\frac {1}{2}}\mathbf {I} _{3}\!\left((\operatorname {tr} \mathbf {A} )^{2}-\operatorname {tr} \mathbf {A} ^{2}\right)-\mathbf {A} (\operatorname {tr} \mathbf {A} )+\mathbf {A} ^{2}.}

For the 4 × 4 case, this gives

adj ⁡ ( A ) = 1 6 I 4 ( ( tr ⁡ A ) 3 − 3 tr ⁡ A tr ⁡ A 2 + 2 tr ⁡ A 3 ) − 1 2 A ( ( tr ⁡ A ) 2 − tr ⁡ A 2 ) + A 2 ( tr ⁡ A ) − A 3 . {\displaystyle \operatorname {adj} (\mathbf {A} )={\frac {1}{6}}\mathbf {I} _{4}\!\left((\operatorname {tr} \mathbf {A} )^{3}-3\operatorname {tr} \mathbf {A} \operatorname {tr} \mathbf {A} ^{2}+2\operatorname {tr} \mathbf {A} ^{3}\right)-{\frac {1}{2}}\mathbf {A} \!\left((\operatorname {tr} \mathbf {A} )^{2}-\operatorname {tr} \mathbf {A} ^{2}\right)+\mathbf {A} ^{2}(\operatorname {tr} \mathbf {A} )-\mathbf {A} ^{3}.}

The same formula follows directly from the terminating step of the Faddeev–LeVerrier algorithm, which efficiently determines the characteristic polynomial of A.

In general, adjugate matrix of arbitrary dimension N matrix can be computed by Einstein's convention.

( adj ⁡ ( A ) ) i N j N = 1 ( N − 1 ) ! ϵ i 1 i 2 … i N ϵ j 1 j 2 … j N A j 1 i 1 A j 2 i 2 … A j N − 1 i N − 1 {\displaystyle (\operatorname {adj} (\mathbf {A} ))_{i_{N}}^{j_{N}}={\frac {1}{(N-1)!}}\epsilon _{i_{1}i_{2}\ldots i_{N}}\epsilon ^{j_{1}j_{2}\ldots j_{N}}A_{j_{1}}^{i_{1}}A_{j_{2}}^{i_{2}}\ldots A_{j_{N-1}}^{i_{N-1}}}

Relation to exterior algebras

[edit]

The adjugate can be viewed in abstract terms using exterior algebras. Let V be an _n_-dimensional vector space. The exterior product defines a bilinear pairing

V × ∧ n − 1 V → ∧ n V . {\displaystyle V\times \wedge ^{n-1}V\to \wedge ^{n}V.}

Abstractly, ∧ n V {\displaystyle \wedge ^{n}V} is isomorphic to R, and under any such isomorphism the exterior product is a perfect pairing. Therefore, it yields an isomorphism

ϕ : V → ≅ Hom ⁡ ( ∧ n − 1 V , ∧ n V ) . {\displaystyle \phi \colon V\ {\xrightarrow {\cong }}\ \operatorname {Hom} (\wedge ^{n-1}V,\wedge ^{n}V).}

Explicitly, this pairing sends v ∈ V to ϕ v {\displaystyle \phi _{\mathbf {v} }} , where

ϕ v ( α ) = v ∧ α . {\displaystyle \phi _{\mathbf {v} }(\alpha )=\mathbf {v} \wedge \alpha .}

Suppose that T : V → V is a linear transformation. Pullback by the (n − 1)st exterior power of T induces a morphism of Hom spaces. The adjugate of T is the composite

V → ϕ Hom ⁡ ( ∧ n − 1 V , ∧ n V ) → ( ∧ n − 1 T ) ∗ Hom ⁡ ( ∧ n − 1 V , ∧ n V ) → ϕ − 1 V . {\displaystyle V\ {\xrightarrow {\phi }}\ \operatorname {Hom} (\wedge ^{n-1}V,\wedge ^{n}V)\ {\xrightarrow {(\wedge ^{n-1}T)^{*}}}\ \operatorname {Hom} (\wedge ^{n-1}V,\wedge ^{n}V)\ {\xrightarrow {\phi ^{-1}}}\ V.}

If V = Rn is endowed with its canonical basis e1, …, en, and if the matrix of T in this basis is A, then the adjugate of T is the adjugate of A. To see why, give ∧ n − 1 R n {\displaystyle \wedge ^{n-1}\mathbf {R} ^{n}} the basis

{ e 1 ∧ ⋯ ∧ e ^ k ∧ ⋯ ∧ e n } k = 1 n . {\displaystyle \{\mathbf {e} _{1}\wedge \dots \wedge {\hat {\mathbf {e} }}_{k}\wedge \dots \wedge \mathbf {e} _{n}\}_{k=1}^{n}.}

Fix a basis vector ei of Rn. The image of ei under ϕ {\displaystyle \phi } is determined by where it sends basis vectors:

ϕ e i ( e 1 ∧ ⋯ ∧ e ^ k ∧ ⋯ ∧ e n ) = { ( − 1 ) i − 1 e 1 ∧ ⋯ ∧ e n , if k = i , 0 otherwise. {\displaystyle \phi _{\mathbf {e} _{i}}(\mathbf {e} _{1}\wedge \dots \wedge {\hat {\mathbf {e} }}_{k}\wedge \dots \wedge \mathbf {e} _{n})={\begin{cases}(-1)^{i-1}\mathbf {e} _{1}\wedge \dots \wedge \mathbf {e} _{n},&{\text{if}}\ k=i,\\0&{\text{otherwise.}}\end{cases}}}

On basis vectors, the (n − 1)st exterior power of T is

e 1 ∧ ⋯ ∧ e ^ j ∧ ⋯ ∧ e n ↦ ∑ k = 1 n ( det A j k ) e 1 ∧ ⋯ ∧ e ^ k ∧ ⋯ ∧ e n . {\displaystyle \mathbf {e} _{1}\wedge \dots \wedge {\hat {\mathbf {e} }}_{j}\wedge \dots \wedge \mathbf {e} _{n}\mapsto \sum _{k=1}^{n}(\det A_{jk})\mathbf {e} _{1}\wedge \dots \wedge {\hat {\mathbf {e} }}_{k}\wedge \dots \wedge \mathbf {e} _{n}.}

Each of these terms maps to zero under ϕ e i {\displaystyle \phi _{\mathbf {e} _{i}}} except the k = i term. Therefore, the pullback of ϕ e i {\displaystyle \phi _{\mathbf {e} _{i}}} is the linear transformation for which

e 1 ∧ ⋯ ∧ e ^ j ∧ ⋯ ∧ e n ↦ ( − 1 ) i − 1 ( det A j i ) e 1 ∧ ⋯ ∧ e n , {\displaystyle \mathbf {e} _{1}\wedge \dots \wedge {\hat {\mathbf {e} }}_{j}\wedge \dots \wedge \mathbf {e} _{n}\mapsto (-1)^{i-1}(\det A_{ji})\mathbf {e} _{1}\wedge \dots \wedge \mathbf {e} _{n},}

that is, it equals

∑ j = 1 n ( − 1 ) i + j ( det A j i ) ϕ e j . {\displaystyle \sum _{j=1}^{n}(-1)^{i+j}(\det A_{ji})\phi _{\mathbf {e} _{j}}.}

Applying the inverse of ϕ {\displaystyle \phi } shows that the adjugate of T is the linear transformation for which

e i ↦ ∑ j = 1 n ( − 1 ) i + j ( det A j i ) e j . {\displaystyle \mathbf {e} _{i}\mapsto \sum _{j=1}^{n}(-1)^{i+j}(\det A_{ji})\mathbf {e} _{j}.}

Consequently, its matrix representation is the adjugate of A.

If V is endowed with an inner product and a volume form, then the map φ can be decomposed further. In this case, φ can be understood as the composite of the Hodge star operator and dualization. Specifically, if ω is the volume form, then it, together with the inner product, determines an isomorphism

ω ∨ : ∧ n V → R . {\displaystyle \omega ^{\vee }\colon \wedge ^{n}V\to \mathbf {R} .}

This induces an isomorphism

Hom ⁡ ( ∧ n − 1 R n , ∧ n R n ) ≅ ∧ n − 1 ( R n ) ∨ . {\displaystyle \operatorname {Hom} (\wedge ^{n-1}\mathbf {R} ^{n},\wedge ^{n}\mathbf {R} ^{n})\cong \wedge ^{n-1}(\mathbf {R} ^{n})^{\vee }.}

A vector v in Rn corresponds to the linear functional

( α ↦ ω ∨ ( v ∧ α ) ) ∈ ∧ n − 1 ( R n ) ∨ . {\displaystyle (\alpha \mapsto \omega ^{\vee }(\mathbf {v} \wedge \alpha ))\in \wedge ^{n-1}(\mathbf {R} ^{n})^{\vee }.}

By the definition of the Hodge star operator, this linear functional is dual to * v. That is, ω∨∘ φ equals v ↦ * v∨.

Let A be an n × n matrix, and fix r ≥ 0. The _r_th higher adjugate of A is an ( n r ) × ( n r ) {\textstyle {\binom {n}{r}}\!\times \!{\binom {n}{r}}} matrix, denoted adj_r_ A, whose entries are indexed by size r subsets I and J of {1, ..., m} [_citation needed_]. Let _I_c and _J_c denote the complements of I and J, respectively. Also let A I c , J c {\displaystyle \mathbf {A} _{I^{c},J^{c}}} denote the submatrix of A containing those rows and columns whose indices are in _I_c and J_c, respectively. Then the (I, J) entry of adj_r A is

( − 1 ) σ ( I ) + σ ( J ) det A J c , I c , {\displaystyle (-1)^{\sigma (I)+\sigma (J)}\det \mathbf {A} _{J^{c},I^{c}},}

where σ(I) and σ(J) are the sum of the elements of I and J, respectively.

Basic properties of higher adjugates include [_citation needed_]:

• adj0(A) = det A.
• adj1(A) = adj A.
• adj_n_(A) = 1.
• adj_r_(BA) = adj_r_(A) adj_r_(B).
• adj r ⁡ ( A ) C r ( A ) = C r ( A ) adj r ⁡ ( A ) = ( det A ) I ( n r ) {\displaystyle \operatorname {adj} _{r}(\mathbf {A} )C_{r}(\mathbf {A} )=C_{r}(\mathbf {A} )\operatorname {adj} _{r}(\mathbf {A} )=(\det \mathbf {A} )I_{\binom {n}{r}}} , where C r(A) denotes the r th compound matrix.

Higher adjugates may be defined in abstract algebraic terms in a similar fashion to the usual adjugate, substituting ∧ r V {\displaystyle \wedge ^{r}V} and ∧ n − r V {\displaystyle \wedge ^{n-r}V} for V {\displaystyle V} and ∧ n − 1 V {\displaystyle \wedge ^{n-1}V} , respectively.

Iteratively taking the adjugate of an invertible matrix A k times yields

adj ⁡ ⋯ adj ⏞ k ( A ) = det ( A ) ( n − 1 ) k − ( − 1 ) k n A ( − 1 ) k , {\displaystyle \overbrace {\operatorname {adj} \dotsm \operatorname {adj} } ^{k}(\mathbf {A} )=\det(\mathbf {A} )^{\frac {(n-1)^{k}-(-1)^{k}}{n}}\mathbf {A} ^{(-1)^{k}},}

det ( adj ⁡ ⋯ adj ⏞ k ( A ) ) = det ( A ) ( n − 1 ) k . {\displaystyle \det(\overbrace {\operatorname {adj} \dotsm \operatorname {adj} } ^{k}(\mathbf {A} ))=\det(\mathbf {A} )^{(n-1)^{k}}.}

For example,

adj ⁡ ( adj ⁡ ( A ) ) = det ( A ) n − 2 A . {\displaystyle \operatorname {adj} (\operatorname {adj} (\mathbf {A} ))=\det(\mathbf {A} )^{n-2}\mathbf {A} .}

det ( adj ⁡ ( adj ⁡ ( A ) ) ) = det ( A ) ( n − 1 ) 2 . {\displaystyle \det(\operatorname {adj} (\operatorname {adj} (\mathbf {A} )))=\det(\mathbf {A} )^{(n-1)^{2}}.}

• Cayley–Hamilton theorem
• Cramer's rule
• Trace diagram
• Jacobi's formula
• Faddeev–LeVerrier algorithm
• Compound matrix

1. ^ Gantmacher, F. R. (1960). The Theory of Matrices. Vol. 1. New York: Chelsea. pp. 76–89. ISBN 0-8218-1376-5.
2. ^ Strang, Gilbert (1988). "Section 4.4: Applications of determinants". Linear Algebra and its Applications (3rd ed.). Harcourt Brace Jovanovich. pp. 231–232. ISBN 0-15-551005-3.
3. ^ Claeyssen, J.C.R. (1990). "On predicting the response of non-conservative linear vibrating systems by using dynamical matrix solutions". Journal of Sound and Vibration. 140 (1): 73–84. Bibcode:1990JSV...140...73C. doi:10.1016/0022-460X(90)90907-H.
4. ^ Chen, W.; Chen, W.; Chen, Y.J. (2004). "A characteristic matrix approach for analyzing resonant ring lattice devices". IEEE Photonics Technology Letters. 16 (2): 458–460. Bibcode:2004IPTL...16..458C. doi:10.1109/LPT.2003.823104.
5. ^ Householder, Alston S. (2006). The Theory of Matrices in Numerical Analysis. Dover Books on Mathematics. pp. 166–168. ISBN 0-486-44972-6.

• Roger A. Horn and Charles R. Johnson (2013), Matrix Analysis, Second Edition. Cambridge University Press, ISBN 978-0-521-54823-6
• Roger A. Horn and Charles R. Johnson (1991), Topics in Matrix Analysis. Cambridge University Press, ISBN 978-0-521-46713-1
• Matrix Reference Manual
• Online matrix calculator (determinant, track, inverse, adjoint, transpose) Compute Adjugate matrix up to order 8
• "Adjugate of { { a, b, c }, { d, e, f }, { g, h, i } }". Wolfram Alpha.