0% found this document useful (0 votes)
20 views41 pages

Module 03 - Determinants

Module 3 of IE 2206 covers determinants, including their definition, evaluation, and Cramer’s Rule. It explains the properties of determinants, how to evaluate them using permutations, and the impact of elementary row operations. The module also provides examples and exercises for practical understanding of determinant calculations.

Uploaded by

treasurerrwin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
20 views41 pages

Module 03 - Determinants

Module 3 of IE 2206 covers determinants, including their definition, evaluation, and Cramer’s Rule. It explains the properties of determinants, how to evaluate them using permutations, and the impact of elementary row operations. The module also provides examples and exercises for practical understanding of determinant calculations.

Uploaded by

treasurerrwin
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 41

Module 3 - Determinants

IE 2206 - Advance Math for IE


University of San Carlos
School of Engineering
Topics to be discussed
1. Definition of determinants
2. Evaluation of Determinants
3. Cramer’s Rule
Definition of determinants
Definition of the Determinant
› Determinants are scalars (numbers or sometimes functions) formed from the square
matrices according to a rule we will develop.
› This Chapter develops some properties of determinants that we will need to evaluate and
make use of them

› Let n be an integer with n ≥ 2. A permutation of the integers 1,2,,,n is a rearrangement of


these integers.
› For example, if p is the permutation that rearranges 1,2,3,4,5,6 → 3,1,4,5,2,6
› Then p(1)=3, p(2) = 1, p(3) = 4, p(4) = 5, p(5) = 1, P(6) = 6.
Permutation
› A permutation is characterized as even or odd according to a rile we will illustrate
Consider the permutation
p: 1,2,3,4,5 → 2,5,1,4,3
Of the integers 1,2,3,4,5. For each k in the permuted list on the right, count
the number of integers to the right of k that are smaller than k.
1. There is one number to the right of 2 which is smaller than 2 (2,5,1,4,3)
2. There are three numbers to the right of 5 which is smaller than 5 (2,5,1,4,3)
3. There is no number to the right of 1 which is smaller than 1 (2,5,1,4,3)
4. There is 1 number to the right of 4 which is smaller than 4 (2,5,1,4,3)
5. There is no number to the right of 3 which is smaller than 3 (2,5,1,4,3)
Summary : (1,3,0,1,0) = (1+3+0+1+0) = 5 (Odd), p is then an odd permutation.
When the sum is even, p is an even permutation.
Permutation
› If p is a permutation on 1,2,,,n, define

α(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

detA =σσ𝒑 𝒑 a1p(1)a2(p2)…anp(n)..

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

P1: 1,2 --> 1,2 and


P2: 1,2 --> 2,1.

Upon checking, P1: is even and P2: is odd


|A| = σ(p1)a1p1(1)a2p1(2) + σ(p2)a1p2(1)a2p2(2)

|A| = a11a22 – a12a21


Example 1 – Define a determinant of 3x3 matrix
𝑎11 𝑎21 𝑎31 |B| =
A = 𝑎12 𝑎22 𝑎32 σ(pk)b1pk(1)b2pk(2)b3pk(3)
𝑎13 𝑎23 𝑎33

There are only six permutations on the


|B| = b11b22b33 - b11b23b32 +
numbers 1,2,3 namely
b12b23b31 - b12b21b33 + b13b21b32 -
b13b22b31
P1: 1,2,3 --> 1,2,3
P2: 1,2,3 --> 1,3,2
P3: 1,2,3 --> 2,3,1
P4: 1,2,3 --> 2,1,3
P5: 1,2,3 --> 3,1,2
P6: 1,2,3 --> 3,2,1
Example 1 – Define a determinant of 3x3 matrix
𝑎11 𝑎21 𝑎31
A = 𝑎12 𝑎22 𝑎32
𝑎13 𝑎23 𝑎33
𝑎11
A= 𝑎22 𝑎32 a11
𝑎22 𝑎32
a11 (a22*a33 – a32*a23)
𝑎23 𝑎33 𝑎23 𝑎33

𝑎21 𝑎12 𝑎32


A = 𝑎12 𝑎32 a21 -a21 (a12*a33 – a32*a13)
𝑎13 𝑎33
𝑎13 𝑎33

𝑎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

|A| = a11 (a22*a33 – a32*a23)


Elimination of Row and Columns
Let A be nxn, and suppose row k or column r has all zero
elements, except perhaps for akr.

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

Aim is to get zero in any column or row, using


elementary row operations to reduce the
number of multiplicative solutions. |A| = (-1)1+22|B12|
Elementary row operations does not change the −5 12
value of the determinant. B12 =
14 −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

|C| = |D| |D| = (-1)1+1-1|E| = -|E|


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

|C| = |D| |D| = (-1)1+1-1|E| = -|E|


Example 02

103 15 143 Next steps

|E| = 151 12 202


−70 1 −109
1153 0 1778
|F| = 991 0 1510 |F| = (-1)3+21|G| = -|G|
−70 1 −109

1153 1778
|G| = |G| = -20,968
991 1510

|A|= |B| = |C| = |D| = -|E| = -|F| = |G| = -20,968


Activity
Evaluate the matrix and get the determinant value.

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.

|A| = σ𝑛𝑗=1 −1 𝑘 +𝑗𝑎


𝑘𝑗𝑀𝑘𝑗

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.

𝑘+1 𝑘+2 𝑘+𝑛


|A| = −1 𝑎𝑘1𝑀𝑘1 + −1 𝑎𝑘2𝑀𝑘2 + −1 𝑎𝑘𝑛𝑀𝑘𝑛 +
Example

−6 3 7
|A| = 12 −5 −9
2 4 −6

|A| = σ𝑛𝑗=1 −1 𝑘 +𝑗𝑎


𝑘𝑗𝑀𝑘𝑗
Solution (Using Row 1)
−6 3 7
|A| = 12 −5 −9
2 4 −6

Using cofactor in Row 1 :

|A| = σ3𝑗=1 −1 𝑘 +𝑗𝑎


𝑘𝑗𝑀𝑘𝑗

Using cofactor in Row 1 :


−𝟓 −𝟗 𝟏𝟐 −𝟗 𝟏𝟐 −𝟓
|A| = (-1)1+1(-6) + (−1)1+2(−3) (-1)1+3(7)
𝟒 −𝟔 𝟐 −𝟔 𝟐 𝟒

|A| = −6 30 + 36 − 3 −72 + 18 + 7 −48 + 10 = 172


Solution (Using Row 3)
−6 3 7
|A| = 12 −5 −9
2 4 −6

Using cofactor in Row 1 :

|A| = σ3𝑗=1 −1 𝑘 +𝑗𝑎


𝑘𝑗𝑀𝑘𝑗

Using cofactor in Row 1 :


𝟑 𝟕 −𝟔 𝟕 −𝟔 𝟑
|A| = (-1)3+1(2) + (−1)3+2(4) (-1)3+3(-6)
−𝟓 −𝟗 𝟏𝟐 −𝟗 𝟏𝟐 −𝟓

|A| = 2 −27 + 35 − 4 54 − 84 − 6 30 − 36 = 172


Cofactor expansion by a column
For any j with 1 ≤ j ≤ n.

|A| = σ𝑛𝑖=1 −1 1+𝑗𝑎


𝑖𝑗𝑀𝑖𝑗

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

|A| = σ𝑛𝑖=1 −1 1+𝑗𝑎


𝑖𝑗𝑀𝑖𝑗
Solution (Using Column 1)
−6 3 7
|A| = 12 −5 −9
2 4 −6

Using cofactor in Column 1 :


+𝑗
|A| = σ𝑖=1 −1
𝑛 1 𝑎𝑖𝑗𝑀𝑖𝑗
Using cofactor in Column 1 :
−𝟓 −𝟗 𝟑 𝟕 𝟑 𝟕
|A| = (-1)1+1(-6) + (−1)2+1(12) (-1)3+1(2)
𝟒 −𝟔 𝟒 −𝟔 −𝟓 −𝟗

|A| = −6 30 + 36 − 12 −18 − 28 + 2 −27 + 35 = 172


Solution (Using Column 2)
−6 3 7
|A| = 12 −5 −9
2 4 −6

Using cofactor in Column 1 :


+𝑗
|A| = σ𝑖=1 −1
𝑛 1 𝑎𝑖𝑗𝑀𝑖𝑗
Using cofactor in Column 1 :
𝟏𝟐 −𝟗 −𝟔 𝟕 −𝟔 𝟕
|A| = (-1)1+2(3) + (−1)2+2(−5) (-1)3+2(4)
𝟐 −𝟔 𝟐 −𝟔 𝟏𝟐 −𝟗

|A| = −3 −72 + 18 − 5 36 − 14 − 4 54 − 84 = 172


Determinant formula for A-1
› When |A| ≠ 0, A has an inverse.

› Let A be a nonsingular n x m matrix


and define an nxm matrix B = (bij) by

Bij = [1/|A|] (-1)i+jMji.

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

You might also like