06.09.2021 Views

Linear Algebra, 2020a

Linear Algebra, 2020a

Linear Algebra, 2020a

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.

Section IV. Matrix Operations 235<br />

(e) 3<br />

( ) ( )<br />

2 1 1 1 4<br />

+ 2<br />

3 0 3 0 5<br />

1.9 Give the matrix representing the zero map from R 4 to R 2 , with respect to the<br />

standard bases.<br />

1.10 Prove Theorem 1.4.<br />

(a) Prove that matrix addition represents addition of linear maps.<br />

(b) Prove that matrix scalar multiplication represents scalar multiplication of<br />

linear maps.<br />

̌ 1.11 Prove each, assuming that the operations are defined, where G, H, and J are<br />

matrices, where Z is the zero matrix, and where r and s are scalars.<br />

(a) Matrix addition is commutative G + H = H + G.<br />

(b) Matrix addition is associative G +(H + J) =(G + H)+J.<br />

(c) The zero matrix is an additive identity G + Z = G.<br />

(d) 0 · G = Z<br />

(e) (r + s)G = rG + sG<br />

(f) Matrices have an additive inverse G +(−1) · G = Z.<br />

(g) r(G + H) =rG + rH<br />

(h) (rs)G = r(sG)<br />

1.12 Fix domain and codomain spaces. In general, one matrix can represent many<br />

different maps with respect to different bases. However, prove that a zero matrix<br />

represents only a zero map. Are there other such matrices?<br />

̌ 1.13 Let V and W be vector spaces of dimensions n and m. Show that the space<br />

L(V, W) of linear maps from V to W is isomorphic to M m×n .<br />

̌ 1.14 Show that it follows from the prior question that for any six transformations<br />

t 1 ,...,t 6 : R 2 → R 2 there are scalars c 1 ,...,c 6 ∈ R such that not every c i equals 0<br />

but c 1 t 1 + ···+ c 6 t 6 is the zero map. (Hint: the six is slightly misleading.)<br />

1.15 The trace of a square matrix is the sum of the entries on the main diagonal<br />

(the 1, 1 entry plus the 2, 2 entry, etc.; we will see the significance of the trace in<br />

Chapter Five). Show that trace(H + G) =trace(H)+trace(G). Is there a similar<br />

result for scalar multiplication?<br />

1.16 Recall that the transpose of a matrix M is another matrix, whose i, j entry is<br />

the j, i entry of M. Verify these identities.<br />

(a) (G + H) T = G T + H T<br />

(b) (r · H) T = r · H T<br />

̌ 1.17 A square matrix is symmetric if each i, j entry equals the j, i entry, that is, if<br />

the matrix equals its transpose.<br />

(a) Prove that for any square H, the matrix H + H T is symmetric. Does every<br />

symmetric matrix have this form?<br />

(b) Prove that the set of n×n symmetric matrices is a subspace of M n×n .<br />

̌ 1.18 (a) How does matrix rank interact with scalar multiplication — can a scalar<br />

product of a rank n matrix have rank less than n? Greater?<br />

(b) How does matrix rank interact with matrix addition — can a sum of rank n<br />

matrices have rank less than n? Greater?

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

Saved successfully!

Ooh no, something went wrong!