- (a) Finish the last page of the worksheet used in class on Monday, Oct. 28 titled Invertible Linear Transformations and Matrices. Explain your reasoning for each part by making connection to LA being one-to-one and onto.
(b) Explain why a matrix has to be square in order to be invertible.
- (if you did not finish this last week) (Strang, 1.6, #25) Suppose that A is a 33 matrix with (Row-1)+(Row2)=(Row-3).
- Explain why cannot have a solution.
- Which right-hand sides might allow a solution to A~x =~b?
- What happens to Row-3 if we perform forward elimination on A?
- Explain why each of the above three situations leads to the conclusion that A is not invertible? (Hint: Think in terms of the linear transformation LA that A )
- (if you did not finish this last week) (Strang, 1.6, #40) True or False. If true, explain why. If false, show a concrete counterexample. (Hint: Use the fact that A is invertible if and only if the linear transformation LA which it defines is invertible.)
- A 44 matrix with a row of zeros is not invertible.
- A matrix with 1s down the main diagonal is invertible.
- If A is invertible, then A1 is invertible.
- (Strang, 1.6, #4)
- Prove the statement: if A is invertible and AB = AC then B = C.
- Write down example matrices A 6= 0, B, and C satisfying AB = AC but B 6= C.
- (Optional)
- Finish the optional worksheet titled Inverse Matrix Formal Definition, which introduces the formal mathematics definition of invertible matrices and explains its equivalence to requiring the matrix define an invertible linear transformation.
- Review the so-called Gauss-Jordan method to find inverse matrix you learned in Math 24. You may refresh your memory by watching some YouTube videos https://youtu.be/cJg2AuSFdjw. Explain why this method is valid. More precisely, explain how we can be certain that the matrix we find is indeed the inverse matrix we seek?
- Draw a parallelogram whose area is 24 square units on the left grid given below. Let us call this parallelogram P1. We are going to map your parallelogram using a linear transformation.
Let us use P2 to denote the image of P1 after the linear transformation A.
- Use the exercise we did in lecture, Area of a parallelogram, as a hint to make a prediction of the area of P2. Explain your reasoning.
- On the right grid, draw your P2, the image of your P1 after the transformation. Read off the area of your P2 from the grid and verify your prediction.
- Let B : R2 R2 be the linear transformation that sends the square with vertices (0,0), (0,1), (1,0), and (1,1), to your P1.
- Without writing down the matrix B, make a prediction of, do NOT calculate, the values of detB and det(AB). Explain your reasoning.
- Write down explicitly what matrix B Calculate the product AB, the determinants detA, detB, and det(AB). Verify your predictions.
- Let us generalize the previous problem to nn matrices A and B.
- What do you think is the relationship among det(AB), detA, and detB?
- In particular, if A is invertible, how are detA and detA1 related? Explain why.
- The following are some very useful properties of determinant, some of which we proved the 2-by-2 case in lecture using areas. Knowing them will speed up your calculation of determinants in a lot of situations. Complete each sentence and use a 22 or 33 example to illustrate why your claim is true. No proof needed.
- detInn = (Inn denotes the n n identity matrix).
- The determinant when two rows of the matrix are exchanged.
- If two rows of A are equal, then detA .
- Subtracting a multiple of one row from another row of the matrix leaves the determinant .
- If A has a row of zeros, then detA = .
k.
is a diagonal matrix, then detA = .
- If A is a triangular (either upper or lower) matrix, then detA = .
- If A is singular (i.e., not invertible), detA . If A is invertible, detA
- det(AB) = . As a consequence, if A is invertible, then detA . (Same as previous problem, included here for the sake of completeness.)
- det(AT) = .
- Calculate the following determinant using Gaussian elimination. To make calculation by hand easier, you may use row-exchanges that we do not use in our standard forward Gaussian elimination process.
4det121 | 4201 | 4010 | 4122 |
Reviews
There are no reviews yet.