Back to Linear Algebra

Mechanics of Matrix Multiplication

Products viewed purely as arithmetic: identity, diagonal, and permutation matrices, and the elementary matrices that perform row operations.

Linear Algebra, Mechanics of Matrix Multiplication

Status
FlagsLoading your progress…

27 exercises

Exercise 1

Predict the result of each product with a permutation matrix and then check by multiplying it out.

  • (a)  (0110)(1234)\begin{pmatrix}0&1\\ 1&0\end{pmatrix}\begin{pmatrix}1&2\\ 3&4\end{pmatrix}     (b)  (1234)(0110)\begin{pmatrix}1&2\\ 3&4\end{pmatrix}\begin{pmatrix}0&1\\ 1&0\end{pmatrix}     (c)  (100001010)(123456789)\begin{pmatrix}1&0&0\\ 0&0&1\\ 0&1&0\end{pmatrix}\begin{pmatrix}1&2&3\\ 4&5&6\\ 7&8&9\end{pmatrix}

3.0

Exercise 2

Predict the result of each multiplication by an elementary reduction matrix, and then check by multiplying it out.

  • (a)  (3001)(1234)\begin{pmatrix}3&0\\ 0&1\end{pmatrix}\begin{pmatrix}1&2\\ 3&4\end{pmatrix}     (b)  (1002)(1234)\begin{pmatrix}1&0\\ 0&2\end{pmatrix}\begin{pmatrix}1&2\\ 3&4\end{pmatrix}     (c)  (10−21)(1234)\begin{pmatrix}1&0\\ -2&1\end{pmatrix}\begin{pmatrix}1&2\\ 3&4\end{pmatrix}     (d)  (1234)(1−101)\begin{pmatrix}1&2\\ 3&4\end{pmatrix}\begin{pmatrix}1&-1\\ 0&1\end{pmatrix}     (e)  (1234)(0110)\begin{pmatrix}1&2\\ 3&4\end{pmatrix}\begin{pmatrix}0&1\\ 1&0\end{pmatrix}

3.0

Exercise 3

Predict the result of each multiplication by a diagonal matrix, and then check by multiplying it out.

  • (a)  (−3000)(1234)\begin{pmatrix}-3&0\\ 0&0\end{pmatrix}\begin{pmatrix}1&2\\ 3&4\end{pmatrix}     (b)  (4002)(1234)\begin{pmatrix}4&0\\ 0&2\end{pmatrix}\begin{pmatrix}1&2\\ 3&4\end{pmatrix}

3.0

Exercise 4

Produce each.

  • a 3 ⁣× ⁣33\!\times\!3 matrix that, acting from the left, swaps rows one and two

  • a 2 ⁣× ⁣22\!\times\!2 matrix that, acting from the right, swaps column one and two

3.0

Exercise 5

Show how to use matrix multiplication to bring this matrix to echelon form.

3.0

Exercise 6

Find the product of this matrix with its transpose.

3.0

Exercise 8

This table gives the number of hours of each type done by each worker, and the associated pay rates. Use matrices to compute the wages due.

Remark. This illustrates that in practice we often want to compute linear combinations of rows and columns in a context where we really aren’t interested in any associated linear maps.

3.0

Exercise 9

Express this nonsingular matrix as a product of elementary reduction matrices.

3.0

Exercise 10

Express

as the product of two elementary reduction matrices.

3.0

Exercise 11

Prove that the diagonal matrices form a subspace of Mn ⁣× ⁣n\mathcal{M}_{n\!\times\!n}. What is its dimension?

3.0

Exercise 12

Does the identity matrix represent the identity map if the bases are unequal?

3.0

Exercise 13

Show that every multiple of the identity commutes with every square matrix. Are there other matrices that commute with all square matrices?

3.0

Exercise 14

Prove or disprove: nonsingular matrices commute.

3.0

Exercise 15

Show that the product of a permutation matrix and its transpose is an identity matrix.

3.0

Exercise 16

Show that if the first and second rows of GG are equal then so are the first and second rows of GHGH. Generalize.

3.0

Exercise 17

Describe the product of two diagonal matrices.

3.0

Exercise 18

Show that if GG has a row of zeros then GHGH (if defined) has a row of zeros. Does that work for columns?

3.0

Exercise 19

Show that the set of unit matrices forms a basis for Mn ⁣× ⁣m\mathcal{M}_{n\!\times\!m}.

3.0

Exercise 20

Find the formula for the nn-th power of this matrix.

3.0

Exercise 21

The trace of a square matrix is the sum of the entries on its diagonal (its significance appears in Chapter Five). Show that Tr⁡(GH)=Tr⁡(HG)\operatorname{Tr}(GH)=\operatorname{Tr}(HG).

3.0

Exercise 22

A square matrix is upper triangular if its only nonzero entries lie above, or on, the diagonal. Show that the product of two upper triangular matrices is upper triangular. Does this hold for lower triangular also?

3.0

Exercise 23

A square matrix is a Markov matrix if each entry is between zero and one and the sum along each row is one. Prove that a product of Markov matrices is Markov.

3.0

Exercise 24

Give an example of two matrices of the same rank and size with squares of differing rank.

3.0

Exercise 25

Matrix multiplication is performed often on computers. Researchers trying to understand its performance, and improve on it, count the number of operations that it takes.

  • Definition 2.3 gives pi,j=gi,1h1,j+gi,2h2,j+⋯+gi,rhr,jp_{i,j}=g_{i,1}h_{1,j}+g_{i,2}h_{2,j}+\dots+g_{i,r}h_{r,j}. How many real number multiplications are in that expression? Using it, how many do we need for the product of a m ⁣× ⁣rm\!\times\!r matrix and a r ⁣× ⁣nr\!\times\!n matrix?

  • Matrix multiplication is associative, so in computing H1H2H3H4H_{1}H_{2}H_{3}H_{4} we can ex…

3.0

Exercise 26

If AA and BB are square matrices of the same size such that ABAB=0ABAB=0, does it follow that BABA=0BABA=0?

3.0

Exercise 27

Demonstrate these four assertions to get an alternate proof that column rank equals row rank.

  • y⃗⋅y⃗=0\vec{y}\cdot\vec{y}=0 iff y⃗=0⃗\vec{y}=\vec{0}.

  • Ax⃗=0⃗A\vec{x}=\vec{0} iff ATAx⃗=0⃗{{A}^{\mathsf{T}}}A\vec{x}=\vec{0}.

  • dim⁡(R(A))=dim⁡(R(ATA))\dim(\mathscr{R}(A))=\dim(\mathscr{R}({{A}^{\mathsf{T}}}A)).

  • col rank(A)=col rank(AT)=row rank(A)\text{col rank}(A)=\text{col rank}({{A}^{\mathsf{T}}})=\text{row rank}(A).

3.0

Exercise 28

Prove (where AA is an n ⁣× ⁣nn\!\times\!n matrix and so defines a transformation of any nn-dimensional space VV with respect to B,BB,B where BB is a basis) that dim⁡(R(A)∩N(A))=dim⁡(R(A))−dim⁡(R(A2))\dim(\mathscr{R}(A)\cap\mathscr{N}(A))=\dim(\mathscr{R}(A))-\dim(\mathscr{R}(A^{2})). Conclude

  • N(A)⊂R(A)\mathscr{N}(A)\subset\mathscr{R}(A) iff dim⁡(N(A))=dim⁡(R(A))−dim⁡(R(A2))\dim(\mathscr{N}(A))=\dim(\mathscr{R}(A))-\dim(\mathscr{R}(A^{2}));

  • R(A)⊆N(A)\mathscr{R}(A)\subseteq\mathscr{N}(A) iff A2=0A^{2}=0;

  • R(A)=N(A)\mathscr{R}(A)=\mathscr{N}(A) iff A2=0A^{2}=0 and dim⁡(N(A))=dim⁡(R(A))\dim(\mathscr{N}(A))=\dim(\mathscr{R}(A)) ;

  • dim⁡(R(A)∩N(A))=0\dim(\mathscr{R}(A)\cap\mathscr{N}(A))=0 iff dim⁡(R(A))=dim⁡(R(A2))\dim(\mathscr{R}(A))=\dim(\mathscr{R}(A^{2})) ;

  • (Requires the Direct Sum subsection, which is optional.) V=R(A)⊕N(A)V=\mathscr{R}(A)\oplus\mathscr{N}(A) iff dim⁡(R(A))=dim⁡(R(A2))\dim(\mathscr{R}(A))=\dim(\mathscr{R}(A^{2})).

3.0

Adapted from Linear Algebra © 2016 Jim Hefferon. Licensed under CC BY-SA 3.0 US. Source: Linear Algebra. Imported at revision df2262e.