06.09.2021 Views

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

A First Course in Linear Algebra, 2017a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

112 Determ<strong>in</strong>ants<br />

The follow<strong>in</strong>g provides a formal def<strong>in</strong>ition for the determ<strong>in</strong>ant of an n × n matrix. You may wish<br />

to take a moment and consider the above def<strong>in</strong>itions for 2 × 2and3× 3 determ<strong>in</strong>ants <strong>in</strong> context of this<br />

def<strong>in</strong>ition.<br />

Def<strong>in</strong>ition 3.11: The Determ<strong>in</strong>ant of an n × n Matrix<br />

Let A be an n × n matrix where n ≥ 2 and suppose the determ<strong>in</strong>ant of an (n − 1) × (n − 1) has been<br />

def<strong>in</strong>ed. Then<br />

n<br />

n<br />

det(A)= ∑ a ij cof(A) ij = ∑ a ij cof(A) ij<br />

j=1<br />

i=1<br />

The first formula consists of expand<strong>in</strong>g the determ<strong>in</strong>ant along the i th row and the second expands<br />

the determ<strong>in</strong>ant along the j th column.<br />

In the follow<strong>in</strong>g sections, we will explore some important properties and characteristics of the determ<strong>in</strong>ant.<br />

3.1.2 The Determ<strong>in</strong>ant of a Triangular Matrix<br />

There is a certa<strong>in</strong> type of matrix for which f<strong>in</strong>d<strong>in</strong>g the determ<strong>in</strong>ant is a very simple procedure. Consider<br />

the follow<strong>in</strong>g def<strong>in</strong>ition.<br />

Def<strong>in</strong>ition 3.12: Triangular Matrices<br />

AmatrixA is upper triangular if a ij = 0 whenever i > j. Thus the entries of such a matrix below<br />

the ma<strong>in</strong> diagonal equal 0, as shown. Here, ∗ refers to any nonzero number.<br />

⎡<br />

⎤<br />

∗ ∗ ··· ∗<br />

0 ∗ ···<br />

...<br />

⎢<br />

⎥<br />

⎣ ...<br />

...<br />

... ∗ ⎦<br />

0 ··· 0 ∗<br />

A lower triangular matrix is def<strong>in</strong>ed similarly as a matrix for which all entries above the ma<strong>in</strong><br />

diagonal are equal to zero.<br />

The follow<strong>in</strong>g theorem provides a useful way to calculate the determ<strong>in</strong>ant of a triangular matrix.<br />

Theorem 3.13: Determ<strong>in</strong>ant of a Triangular Matrix<br />

Let A be an upper or lower triangular matrix. Then det(A) is obta<strong>in</strong>ed by tak<strong>in</strong>g the product of the<br />

entries on the ma<strong>in</strong> diagonal.<br />

The verification of this Theorem can be done by comput<strong>in</strong>g the determ<strong>in</strong>ant us<strong>in</strong>g Laplace Expansion<br />

along the first row or column.<br />

Consider the follow<strong>in</strong>g example.

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

Saved successfully!

Ooh no, something went wrong!