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

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

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

82 DETERMINANTS<br />

(b)<br />

(c)<br />

⎛<br />

⎝<br />

⎛<br />

⎜<br />

⎝<br />

4 3 2<br />

1 7 8<br />

3 −9 3<br />

1 2 3 2<br />

1 3 2 3<br />

4 1 5 0<br />

1 2 1 2<br />

⎞<br />

⎠(The answer is 375.)<br />

⎞<br />

⎟<br />

⎠ ,(Theansweris−2.)<br />

2. If A −1 exist, what is the relationship between det (A) and det ( A −1) . Explain your<br />

answer.<br />

3. Let A be an n × n matrix where n is odd. Suppose also that A is skew symmetric.<br />

This means A T = −A. Show that det(A) =0.<br />

4. Is it true that det (A + B) =det(A)+det(B)? If this is so, explain why it is so and<br />

if it is not so, give a counter example.<br />

5. Let A be an r ×r matrix and suppose there are r −1 rows (columns) such that all rows<br />

(columns) are linear combinations of these r − 1 rows (columns). Show det (A) =0.<br />

6. Show det (aA) =a n det (A) where here A is an n × n matrix and a is a scalar.<br />

7. Suppose A is an upper triangular matrix. Show that A −1 exists if and only if all<br />

elements of the main diagonal are non zero. Is it true that A −1 will also be upper<br />

triangular? Explain. Is everything the same for lower triangular matrices?<br />

8. Let A and B be two n × n matrices. A ∼ B (A is similar to B) means there exists an<br />

invertible matrix S such that A = S −1 BS. Show that if A ∼ B, then B ∼ A. Show<br />

also that A ∼ A and that if A ∼ B and B ∼ C, then A ∼ C.<br />

9. In the context of Problem 8 show that if A ∼ B, then det (A) =det(B) .<br />

10. Let A be an n × n matrix and let x be a nonzero vector such that Ax = λx for some<br />

scalar, λ. When this occurs, the vector, x is called an eigenvector and the scalar, λ<br />

is called an eigenvalue. It turns out that not every number is an eigenvalue. Only<br />

certain ones are. Why? Hint: Show that if Ax = λx, then (λI − A) x = 0. Explain<br />

why this shows that (λI − A) is not one to one and not onto. Now use Theorem 3.1.15<br />

to argue det (λI − A) =0. What sort of equation is this? How many solutions does it<br />

have?<br />

11. Suppose det (λI − A) =0. Show using Theorem 3.1.15 there exists x ≠ 0 such that<br />

(λI − A) x = 0.<br />

( )<br />

a (t) b (t)<br />

12. Let F (t) =det<br />

. Verify<br />

c (t) d (t)<br />

(<br />

F ′ a<br />

(t) =det<br />

′ (t) b ′ (t)<br />

c (t) d (t)<br />

) (<br />

a (t) b (t)<br />

+det<br />

c ′ (t) d ′ (t)<br />

)<br />

.<br />

Now suppose<br />

⎛<br />

F (t) =det⎝ a (t) b (t) c (t)<br />

d (t) e (t) f (t)<br />

g (t) h (t) i (t)<br />

⎞<br />

⎠ .

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

Saved successfully!

Ooh no, something went wrong!