2.3 Properties of Determinants Cramers

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

Dawson College

Mathematics Department
Linear Algebra, 201-NYC-05, Winter 2020
Noushin Sabetghadam
———————————————————————————————–
2.3. Properties of Determinants; Cramer’s Rule

Some Properties of Determinant


Let A and B be two square matrices of size n and k be a scalar, then
(a) det(AB) = det(A) det(B),

(b) det(kA) = k n det(A).


1
(c) det(A−1 ) = , where A is invertible.
det(A)

As we mentioned earlier a square matrix A is invertible if and only if det(A) 6= 0.

How to find the inverse of an invertible matrix

Definition. If A is any n × n matrix and Cij is the cofactor of aij ,


then the matrix  
C11 C12 ... C1n
 C21 C22 ... C2n 
 
 .. ... ... 
 . 
Cn1 Cn2 ... Cnn
is called the matrix of cofactors from A. The transpose of this
is called the adjoint of A and is denoted by adj(A).

Example 13) Let  


2 5 5
A =  −1 −1 0  .
2 4 3
The cofactors of A are

C11 = −3, C12 = 3, C13 = −2,

C21 = 5, C22 = −4, C23 = 2,


C31 = 5, C32 = −5, C33 = 3;
so the matrix of cofactors is
 
−3 3 −2
 5 −4 2  ,
5 −5 3

and therefore the adjoint of A is


 T  
−3 3 −2 −3 5 5
adj(A) =  5 −4 2  =  3 −4 −5  .
5 −5 3 −2 2 3

The significance of adjoint comes from the fact that it can be used to find the
inverse of an invertible matrix.

Theorem. If A is an invertible matrix, then


1
A−1 = adj(A).
det(A)
.

Example 14) Use this formula to find the inverse of the matrix of Example
13).
Since det(A) = −1, the formula of the theorem yields
   
−3 5 5 3 −5 −5
A−1 = −  3 −4 −5  =  −3 4 5  .
−2 2 3 2 −2 −3

The next theorem provides a formula for the solution of a system of n


equations in n unknowns, provided that the coefficient matrix of the system is
invertible.
Theorem. If A is an n × n matrix, then the following statements
are equivalent.
(1) A is invertible.
(2) The matrix equation Ax = b is consistent and has exactly one solution
for every n × 1 matrix b.
(3) The homogeneous matrix equation Ax = 0 has only the trivial solution.
(4) The reduced row-echelon form of A is In .
(5) det(A) 6= 0.

Cramer’s Rule

Theorem. (Cramer’s Rule) If Ax = b is a system of n linear


equations in n unknowns such that det(A) 6= 0, then the system
has a unique solution. This solution is
det(A1) det(A2) det(An)
x1 = , x2 = , ..., xn = ,
det(A) det(A) det(A)
where Aj is the matrix obtained from A by replacing the entries
in the j-th column of A by the entries in the matrix
 
b1
b 
 
b =  ..2  .
 . 
bn

Example 15) Solve the following system by Cramer’s Rule.



 4x + 5y =2
11x + y + 2z = 3
x + 5y + 2z = 1

We have    
4 5 0 2 5 0
A =  11 1 2  , A1 =  3 1 2  ,
1 5 2 1 5 2
   
4 2 0 4 5 2
A2 =  11 3 2  , A3 =  11 1 3  .
1 1 2 1 5 1
Therefore,
det(A1 ) −36 3
x1 = = = ,
det(A) −132 11
det(A2 ) −24 2
x2 = = = ,
det(A) −132 11
det(A3 ) 12 1
x3 = = =− .
det(A) −132 11

You might also like