06.09.2021 Views

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

Linear Algebra, Theory And Applications, 2012a

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

78 DETERMINANTS<br />

Note that for a n × n matrix, you will need n! terms to evaluate the determinant in this<br />

way. If n =10, this is 10! = 3, 628 , 800 terms. This is a lot of terms.<br />

In addition to the difficulties just discussed, why is the determinant well defined? Why<br />

should you get the same thing when you expand along any row or column? I think you<br />

should regard this claim that you always get the same answer by picking any row or column<br />

with considerable skepticism. It is incredible and not at all obvious. However, it requires<br />

a little effort to establish it. This is done in the section on the theory of the determinant<br />

which follows.<br />

Notwithstanding the difficulties involved in using the method of Laplace expansion,<br />

certain types of matrices are very easy to deal with.<br />

Definition 3.1.5 A matrix M, is upper triangular if M ij =0whenever i>j. Thus such<br />

a matrix equals zero below the main diagonal, the entries of the form M ii , as shown.<br />

⎛<br />

⎞<br />

∗ ∗ ··· ∗<br />

. 0 ∗ .. . ⎜<br />

⎝<br />

.<br />

. .. . ⎟ .. ∗ ⎠<br />

0 ··· 0 ∗<br />

A lower triangular matrix is defined similarly as a matrix for which all entries above the<br />

main diagonal are equal to zero.<br />

You should verify the following using the above theorem on Laplace expansion.<br />

Corollary 3.1.6 Let M be an upper (lower) triangular matrix. Then det (M) is obtained<br />

by taking the product of the entries on the main diagonal.<br />

Proof: The corollary is true if the matrix is one to one. Suppose it is n × n. Then the<br />

matrix is of the form (<br />

m11 a<br />

0 M 1<br />

)<br />

where M 1 is (n − 1)×(n − 1) . Then expanding along the first row, you get m 11 det (M 1 )+0.<br />

Then use the induction hypothesis to obtain that det (M 1 )= ∏ n<br />

i=2 m ii. <br />

Example 3.1.7 Let<br />

Find det (A) .<br />

A =<br />

⎛<br />

⎜<br />

⎝<br />

1 2 3 77<br />

0 2 6 7<br />

0 0 3 33.7<br />

0 0 0 −1<br />

⎞<br />

⎟<br />

⎠<br />

From the above corollary, this is −6.<br />

There are many properties satisfied by determinants. Some of the most important are<br />

listed in the following theorem.<br />

Theorem 3.1.8 If two rows or two columns in an n × n matrix A are switched, the determinant<br />

of the resulting matrix equals (−1) times the determinant of the original matrix. If<br />

A is an n×n matrix in which two rows are equal or two columns are equal then det (A) =0.<br />

Suppose the i th row of A equals (xa 1 + yb 1 , ··· ,xa n + yb n ).Then<br />

det (A) =x det (A 1 )+y det (A 2 )

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!