Classical Adjoint

Let A be an n  n matrix and Aij of A, denoted by aij .

The classical adjoint of A, denoted by adjA, is the transpose
of the matrix of cofactors of A. Namely,

adjA  ( Aij ) T

We say ‘‘classical adjoint’’ instead of simply ‘‘adjoint’’

because the term ‘‘adjoint’’ is currently used for
an entirely different concept.
  1 3 7  4 3
Example A   2 4 3  ，find
11
adjA. A11  (1)  29,
  7 2
 3 7 2 
 
2 3 13 2 4
A12  (1) 1 2
 5, A13  (1)  26,
3 2 3 7
A21  55, A22  23, A23  2, A31  19, A32  17, A33  10,
 29 55 19 
 
adjA   5 23 17  .
 26 2 10 
 
  a11 a12  a1n  A11 A21  An1   A 0  0
    
a a  a2 n  A12 A22  An 2   0 A  0
A(adjA)   21 22
  AI
              
    
 an1 an 2  ann  A1n An 2  Ann   0 0  A

A(adjA)  (adjA) A  A I ( A  0)
adjA adjA
A( )( )A  I 1
A 
1
(adjA)
A A A
 1
A  196  0,
1
A  (adjA).( A  0)
A

 1 3 7   29 55 19 
  1  
A   2 4 3  find A adjA   5 23 17  .
 3 7 2   26 2 10 
   

 29 55 19 
1 1 1 1  
A  (adjA)= (adjA)=  5 23 17 
A 196 196  
 26 2 10 
Applications to Linear Equations, Cramer’s Rule

 a11 x1  a12 x2    a1n xn  b1 a11 a12  a1n

 a x  a x  a x  b
 21 1 22 2 a 21 a 22  a 2 n
D
2n n 2

 
 an1 x1  an 2 x2    ann xn  bn a n1 a n 2  a nn

AX  B
 a11 a12  a1n   x1   b1  a11 a12  a1n
     a 21 a 22  a 2 n
 a21 a22  a2 n   x2    b2  D
         
     a n1 a n 2  a nn
 an1 an 2  ann   xn   bn 
a11  a1 , j 1 b1 a1 , j 1  a1 n
D j  
a n1  a n , j 1 bn a n , j 1  a nn
The (square) system AX =B has a solution if and only if
D0
In this case, the unique solution is given by

D1 D2 D3 Dn
x1  , x2  , x3  , , xn  .
D D D D
  x1  2 x2  3 x3  0,

 4 x1  5 x2  6 x3  3,
 7 x  8 x  8 x  7.
 1 2 3

1 2 3
D  4 5 6  1 5  8 2  6  7
7 8 8
4  8  3 3  5  7 2  4  8 1 8  6
 3  0,
 0 2 3 1 0 3
D1  3 5 6  3, D2  4 3 6  3,
7 8 8 7 7 8
1 2 0 1 2 3 0
D3  4 5 3  3, D  4  
5 6  3
7 8 7 7
7 8 8  
D1 D2 D3
x1   1, x2   1, x3   1.
D D D
A square homogeneous system AX =0 has a nonzero
solution if and only if

D A 0

A square homogeneous system AX =0 has a zero

solution, if

D A 0
1    x1  x2  x3  0,

 x1  1    x2  x3  0,(1)
 x  x  1    x  0,
1 2 3

Find 
such that a square homogeneous system (1) has a
nonzero solution.
 1  1 1
D  1 1  1  (3   ) 2 0
1 1 1 

  3,  0.