Module 03 - Determinants
Module 03 - Determinants
α(p) =
{ 1
-1
if p is an even permutation
if p is an odd permutation
Determinant
› The determinant of an n x m matrix A is defined to be
With this sum extending over all permutations of p 1,2,,,,n. Note that det A is a sum of
terms, each of which is plus or minus a product containing one element from each row and
each column of A.
We denote, that det A as |A|. (This is not to be confused as an absolute value, since
determinant can be negative.
Example 1 – Define a determinant of 2x2 matrix
𝑎11 𝑎21
A=
𝑎12 𝑎22
› There are only two permutations on the
numbers 1,2 namely
𝑎31
A = 𝑎12 𝑎22 a31
𝑎12 𝑎22
a31 (a12*a23 – a22*a13)
𝑎13 𝑎23 𝑎13 𝑎23
detA = a11 (a22*a33 – a32*a23) -a21 (a12*a33 – a32*a13) +a31 (a12*a23 – a22*a13)
Fundamental properties of determinants
1. |A’| = |A|,
2. If A has a zero row or column then |A| = 0
3. If B is formed from A by interchanging two rows or columns
(a type 1 operation, extended to include the columns) then
|B| = -|A|
4. If two rows of A are the same, or if two columns of A are the
same, then |A| = 0.
5. If B is formed from A by multiplying a row or column by a
nonzero number α (a type II operation) then
|B| = α |A|
Fundamental properties of determinants
6. If one row (or column) of A is a constant multiple of another row
(or column), then |A| = 0
7. Suppose each element of row k of A is written as a sum
akj = bkj + ckj.
8. If D is formed from A by adding α times one row (or column) to
another row (or column) (a type II operation), then
|D| =|A|
9. A is nonsingular if and only |A| ≠ 0
10. If A and B are both n x n, then
|AB| = |A| |B|
The determinant of a product is the product of the determinants
Evaluation of Determinants
Evaluation of Determinant I
Evaluation of determinants 1
› The more zero elements in a matrix
has, the easier it is to evaluate the
determinant.
› Every zero element causes some
terms in the sum of equation to
vanish.
𝑎11 0 0
A = 𝑎12 𝑎22 𝑎23
𝑎13 𝑎32 𝑎33
Then,
|A| = (-1)k+rakr|Akr|
Where |Akr| is the n-1 x n-1 matrix formed by deleting row k and
column r of A.
Elimination of Row and Columns
This reduces the problem of evaluating an n x n determinant to one of evaluating a smaller (n-
1) x (n-1), determinant.
𝑎11 0 0
A = 𝑎12 𝑎22 𝑎32
𝑎13 𝑎23 𝑎33
𝑎𝑛1 𝑎𝑛2 𝑎𝑛3
In the sum of equations, the factor a1(p1) is zero if p(1) ≠ 0, Because all other elements of row
one is zero.
|A| = (-1)k+rakr|Akr|
K = rows
R = Columns
|A| = (-1)k+rakr|Akr|
Example 01
Multiply (-2) to row one, Multiply (3) to row one,
then add to row 2 then add to row 3
4 2 −3 4 2 −3 4 2 −3
A=3 4 A = −5 0 12 A = −5 0 12
6
2 −6 8 2 −6 8 14 0 −1
|A| = (-1)1+22|B12|
|A| = (-1)1+22 −5 12
14 −1
|A| = 326
Example 02
−6 0 1 3 2
−1 5 0 1 7
|A| = 8 3 2 1 7
0 1 5 −3 2
1 15 −3 9 4
Example 02
−6 0 1 3 2
−1 5 0 1 7
|A| = 8 3 2 1 7
0 1 5 −3 2
1 15 −3 9 4
Exploit the 1 in Row 1, Column 3, and make all
other values in column 3 equal to zero
|A| = |B|
−6 0 1 3 2
−1 5 0 1 7
|B| = (-1)1+31|C| = |C|
|B| = 20 3 0 −5 3
30 1 0 −18 −8
−17 15 0 18 10
Example 02
C is a 4x4 matrix by deleting row one and
column 3 of B. Use elementary operations to
make all numbers in row 1, be zero, except for
(-1) on A11.
−1 5 1 7
20 3 −5 3
|C| =
30 1 −18 −8
−17 15 18 10
−1 0 0 0
20 103 15 143
|D| =
30 151 12 202
−17 70 1 −109
−1 5 1 7
20 3 −5 3
|C| =
30 1 −18 −8
−17 15 18 10
−1 0 0 0
20 103 15 143
|D| =
30 151 12 202
−17 70 1 −109
1153 1778
|G| = |G| = -20,968
991 1510
10 1 −6 2
0 3 3 9
0 1 1 7
−2 6 8 8
Evaluation of Determinant II
Cofactor expansion by a row
For any k with 1 ≤ i ≤ n.
The equation states that the determinant of A is the sum, along any row k, of the
matrix elements of that row, each multiplied by its cofactor.
This holds for any row of the matrix, although of course this sum is easier to
evaluate if we choose a row with as many zero elements as possible.
−6 3 7
|A| = 12 −5 −9
2 4 −6
The equation states that the determinant of A is the sum, along any column j, of
the matrix elements of that column, each multiplied by its cofactor.
This holds for any column of the matrix, although of course this sum is easier to
evaluate if we choose a column with as many zero elements as possible.
Example
−6 3 7
|A| = 12 −5 −9
2 4 −6
Then B = A-1.
Bij = [1/|A|] (-1)i+jMji
Example
−2 4 1
|A| = 6 3 −3 |A| = 120
2 9 −5
𝟑 −𝟑 𝟑 −𝟑 𝟏𝟐
B11= [1/120] (-1)1+1 = [1/120] 1[ ] = 𝟏𝟐𝟎 = 𝟏/𝟏𝟎
𝟗 −𝟓 𝟗 −𝟓
𝟒 𝟏 𝟒 𝟏 𝟐𝟗
B12= [1/120] (-1)2+1 = [1/120] -1[ ] = 𝟏𝟐𝟎
𝟗 −𝟓 𝟗 −𝟓
𝟒 𝟏 𝟒 𝟏 𝟏
B13= [1/120] (-1)3+1 = [1/120] 1[ ] = −𝟖
𝟑 −𝟑 𝟑 −𝟑
𝟔 𝟑 𝟐
B21= [1/120] (-1)1+2
𝟔 −𝟑 𝟏
= B31= [1/120] (-1)1+3 =
𝟐 −𝟓 𝟓 𝟐 𝟗 𝟓
−𝟐 𝟒 𝟏𝟑
B22= [1/120] (-1)2+2
−𝟐 𝟏 𝟏
= 𝟏𝟓 B32= [1/120] (-1)2+3 =
𝟐 −𝟓 𝟐 𝟗 𝟔𝟎
−𝟐 𝟒 𝟏
B23= [1/120] (-1)3+2
−𝟐 𝟏
=𝟎 B33= [1/120] (-1)3+3 = −𝟒
𝟔 −𝟑 𝟔 𝟑
Bij = [1/|A|] (-1)i+jMji
Example
−2 4 1
|A| = 6 3 −3 |A| = 120
2 9 −5
𝟏 𝟐
B11= 𝟏/𝟏𝟎 B21= 𝟓 B31= 𝟓
𝟐𝟗
B12= 𝟏𝟐𝟎 B22= 𝟏𝟓
𝟏
B32= 𝟔𝟎
𝟏𝟑
B13=
𝟏
−𝟖 B23= 𝟎 B33= − 𝟒
𝟏
[ ]
1/10 29/120 −1/8
|B| = |A-1| = 1/5 1/15 0
2/5 13/60 −1/4
Cramer’s Rule
Cramer’s Rule
› Is a determinant formula for the xk = [1/|A|] |A(k;B)|
unique solution of a
nonhomogeneous system AX=B when
A is nonsingular
› Of course, this is X = A-1B.
Example
› Solve the system
x1-3x2-4x3 = 1
-x1+x2-3x3 = 14
x2-3x3 = 5
−1 −3 −4
|A| = −1 1 −3 |A| = 13
0 1 −3
Solution
› Solve the system
1 −3 −4
x1-3x2-4x3 = 1 x1 = 1/13 14 1 −3 = -117/13 = -9
5 1 −3
-x1+x2-3x3 = 14
x2-3x3 = 5 −1 1 −4
x2 = 1/13 −1 14 −3 = -10/13
−1 −3 −4 0 5 −3
|A| = −1 1 −3 |A| = 13
0 1 −3 −1 −3 1
x3 = 1/13 −1 1 14 = -25/13
0 1 5
END OF MODULE 3