MATH 1210 Assignment 4 Solutions 16R-T1

Similar documents
Evaluating Determinants by Row Reduction

Elementary Matrices. which is obtained by multiplying the first row of I 3 by -1, and

MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.

Formula for the inverse matrix. Cramer s rule. Review: 3 3 determinants can be computed expanding by any row or column

Linear Systems and Matrices

Math 240 Calculus III

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.

Determinants Chapter 3 of Lay

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion

Linear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.

Chapter 2: Matrices and Linear Systems

Properties of the Determinant Function

Chapter 2. Square matrices

Section 1.1 System of Linear Equations. Dr. Abdulla Eid. College of Science. MATHS 211: Linear Algebra

det(ka) = k n det A.

MAC Module 3 Determinants. Learning Objectives. Upon completing this module, you should be able to:

MATH2210 Notebook 2 Spring 2018

8 Square matrices continued: Determinants

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.

Linear Algebra: Lecture notes from Kolman and Hill 9th edition.

Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?

Math Camp II. Basic Linear Algebra. Yiqing Xu. Aug 26, 2014 MIT

Equality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.

MATH 1210 Assignment 3 Solutions 17R-T2

Elementary maths for GMT

Math 313 (Linear Algebra) Exam 2 - Practice Exam

Math 320, spring 2011 before the first midterm

EXAM. Exam #1. Math 2360, Second Summer Session, April 24, 2001 ANSWERS

MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics

Name: MATH 3195 :: Fall 2011 :: Exam 2. No document, no calculator, 1h00. Explanations and justifications are expected for full credit.

Determinants by Cofactor Expansion (III)

This MUST hold matrix multiplication satisfies the distributive property.

Elementary Row Operations on Matrices

Graduate Mathematical Economics Lecture 1

Undergraduate Mathematical Economics Lecture 1

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in

Math Computation Test 1 September 26 th, 2016 Debate: Computation vs. Theory Whatever wins, it ll be Huuuge!

The determinant. Motivation: area of parallelograms, volume of parallepipeds. Two vectors in R 2 : oriented area of a parallelogram

MTH 102A - Linear Algebra II Semester

Fall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop

Linear Algebra 1 Exam 1 Solutions 6/12/3

Determinants. Recall that the 2 2 matrix a b c d. is invertible if

Matrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices

MATH 2050 Assignment 8 Fall [10] 1. Find the determinant by reducing to triangular form for the following matrices.

CSL361 Problem set 4: Basic linear algebra

Chapter 5: Matrices. Daniel Chan. Semester UNSW. Daniel Chan (UNSW) Chapter 5: Matrices Semester / 33

Introduction. Vectors and Matrices. Vectors [1] Vectors [2]

k=1 ( 1)k+j M kj detm kj. detm = ad bc. = 1 ( ) 2 ( )+3 ( ) = = 0

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

[ Here 21 is the dot product of (3, 1, 2, 5) with (2, 3, 1, 2), and 31 is the dot product of

Matrices and Linear Algebra

MATH 2030: EIGENVALUES AND EIGENVECTORS

Linear Algebra Primer

Topic 15 Notes Jeremy Orloff

Math Linear Algebra Final Exam Review Sheet

Chapter 4. Determinants

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

2. Every linear system with the same number of equations as unknowns has a unique solution.

Matrices Gaussian elimination Determinants. Graphics 2009/2010, period 1. Lecture 4: matrices

LINEAR ALGEBRA WITH APPLICATIONS

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

NOTES FOR LINEAR ALGEBRA 133

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by

4. Determinants.

Final Examination 201-NYC-05 - Linear Algebra I December 8 th, and b = 4. Find the value(s) of a for which the equation Ax = b

Materials engineering Collage \\ Ceramic & construction materials department Numerical Analysis \\Third stage by \\ Dalya Hekmat

Inverting Matrices. 1 Properties of Transpose. 2 Matrix Algebra. P. Danziger 3.2, 3.3

TOPIC III LINEAR ALGEBRA

SPRING OF 2008 D. DETERMINANTS

1. In this problem, if the statement is always true, circle T; otherwise, circle F.

Matrices. Ellen Kulinsky

LINEAR ALGEBRA REVIEW

II. Determinant Functions

Math 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam

Chapter 2 Notes, Linear Algebra 5e Lay

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

Lecture 10: Determinants and Cramer s Rule

1 Matrices and Systems of Linear Equations. a 1n a 2n

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~

Third Midterm Exam Name: Practice Problems November 11, Find a basis for the subspace spanned by the following vectors.

Math 220: Summer Midterm 1 Questions

5.3 Determinants and Cramer s Rule

Inverses and Determinants

3.4 Elementary Matrices and Matrix Inverse

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

Chapter 1: Systems of Linear Equations and Matrices

Matrix Algebra. Matrix Algebra. Chapter 8 - S&B

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.

Matrices. Ellen Kulinsky

n n matrices The system of m linear equations in n variables x 1, x 2,..., x n can be written as a matrix equation by Ax = b, or in full

Gaussian Elimination and Back Substitution

Matrix & Linear Algebra

MATH 1553 PRACTICE MIDTERM 3 (VERSION B)

Determinant of a Matrix

MTH 464: Computational Linear Algebra

Determinants. Samy Tindel. Purdue University. Differential equations and linear algebra - MA 262

3 Matrix Algebra. 3.1 Operations on matrices

Computational Foundations of Cognitive Science. Definition of the Inverse. Definition of the Inverse. Definition Computation Properties

Linear Algebra Primer

GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511)

Transcription:

MATH 1210 Assignment 4 Solutions 16R-T1 Attempt all questions and show all your work. Due November 13, 2015. 1. Prove using mathematical induction that for any n 2, and collection of n m m matrices A 1, A 2,..., A n, det(a 1 A 2 A n ) = det(a 1 ) det(a 2 ) det(a n ). Fix m 1. For all n 2, let P n denote the statement that for any collection of n m m matrices A 1, A 2,..., A n, det(a 1 A 2 A n ) = det(a 1 ) det(a 2 ) det(a n ). Base Case. The statement P 2 says that for any collection of 2 m m matrices A, B, This is true by Theorem 7.6 in the text. det(ab) = det(a) det(b). Inductive Step. Fix k 2 and suppose that P k holds, that is, for any collection of k m m matrices A 1, A 2,..., A k, det(a 1 A 2 A k ) = det(a 1 ) det(a 2 ) det(a k ). It remains to show that P k+1 holds, that is, for any collection of k +1 m m matrices A 1, A 2,..., A k+1, det(a 1 A 2 A k+1 ) = det(a 1 ) det(a 2 ) det(a k+1 ). Let A 1, A 2,..., A k+1 be m m matrices. Then det(a 1 A 2 A k+1 ) = det( (A 1 A 2 A k ) A k+1 ) = det(a 1 A 2 A k ) det(a k+1 ) (by P 2 ) = det(a 1 ) det(a 2 ) det(a k ) det(a k+1 ) (by P k ). Therefore P k+1 holds. Thus by PMI, for all n 2, P n holds. 2. Prove using mathematical induction that for any n 1, the determinant of an uppertriangular n n matrix is the product of its diagonal entries. For any n 1, let P n denote the statement that the determinant of every upper-triangular n n matrix is the product of its diagonal entries. Base Case. The statement P 1 says that the determinant of every upper-triangular 1 1 matrix is the product of its diagonal entries. Every 1 1 matrix A = [a 1,1 ]

is upper-triangular, and A = a 1,1, which is the product of the diagonal entries. Therefore P 1 holds. Inductive Step. Fix k 1 and assume that P k holds, that is, the determinant of every upper-triangular k k matrix is the product of its diagonal entries. It remains to show that P k+1 holds, that is, the determinant of every upper-triangular k +1 k +1 matrix is the product of its diagonal entries. Let A = [a i,j ] k+1 k+1 be an upper-triangular matrix. First some notation: let A i,j denote the matrix formed from A by removing row i and column j. The last row of A is all zeros, except for the last entry, a k+1,k+1. Therefore expanding across the bottom row, we have: A = a k+1,j C k+1,j = a k+1,k+1 C k+1,k+1 = a k+1,k+1 ( 1) k+1+k+1 A k+1,k+1 = a k+1,k+1 ( 1) 2k+2 A k+1,k+1 = a k+1,k+1 A k+1,k+1. Note that A k+1,k+1 is a k k upper-triangular matrix. Therefore by P k, the determinant of A k+1,k+1 is the product of the diagonal entries, that is, Put these together and we get A k+1,k+1 = a 1,1 a 2,2 a k,k. A = a k+1,k+1 A k+1,k+1 = a k+1,k+1 a 1,1 a 2,2 a k,k. Therefore P k+1 holds. Thus by PMI, for all n 1, P n holds. 3. Is it true that for any two matrices A and B, det(a + B) = det(a) + det(b)? If so, prove it. If not, find a counter example. No. For instance, 1 0 0 0 = 0, 0 0 = 0, but [ 1 0 0 0 ] + [ 0 0 ] = 1 0 = 1 1 0 0 0 + 0 0.

4. Solve the following system using Cramer s Rule: x 1 + 3x 3 = 1 x 2 + 2x 3 = 9 2x 1 + x 2 = 15 A = A 2 = 1 0 3 0 1 2 2 1 0 1 0 3 0 1 2 2 1 0 1 1 3 0 9 2 2 15 0 x 1 x 2 x 3 =, A 1 =, A 3 = 1 9 15 1 0 3 9 1 2 15 1 0 1 0 1 0 1 9 2 1 15 Then A = 4, A 1 = 20, A 2 = 20, and A 3 = 8. Therefore, by Cramer s rule: x 1 = A 1 A x 2 = A 2 A x 3 = A 3 A = 20 4 = 5 = 20 4 = 5 = 8 4 = 2. 5. Prove the following property: for all a, b, c R, a 0, b 0, c 0, ( 1 1 + b 1 1 1 1 + c = abc 1 + 1 a + 1 b + 1 ). c 1 1 + b 1 1 1 1 + c R 2 R 2 R 1 = a b 0 1 1 1 + c R 3 R 3 (1 + c)r 1 = a b 0 1 (1 + a)(1 + c) c 0

= = a b 0 a c ac c 0 a b a c ac c = ac b( a c ac) = ac + ba + bc + abc = abc ( 1 + 1 a + 1 b + 1 ). c 6. (a) Let c R. Prove using mathematical induction that for any n 1 and any n n matrix A, ca = c n A. Fix c R. For all n 1, let P n denote the statement that for any n n matrix A, ca = c n A. Base Case. The statement P 1 says that for any 1 1 matrix A = [a 1,1 ], ca = c A. ca = [ca 1,1 ] = ca 1,1 = c [a 1,1 ] = c A. Therefore P 1 holds. Inductive Step. Fix k 1 and assume that P k holds, that is, for any k k matrix A, ca = c k A. It remains to show that P k+1 holds, that is, for any k + 1 k + 1 matrix A, ca = c k+1 A. First some notation: let A i,j denote the matrix formed from A by removing row i and column j. Then expanding across the first row we have: ca = ca 1,j C 1,j = ca 1,j ( 1) 1+j (ca) 1,j = ca 1,j ( 1) 1+j c k A 1,j = ca 1,j ( 1) 1+j c k A 1,j = c k+1 a 1,j ( 1) 1+j A 1,j = c k+1 A. By P k since (ca) 1,j is a k k matrix By P k since (ca) 1,j is a k k matrix Therefore P k+1 holds, and thus by PMI, for all n 1, P n holds. (b) A square matrix is called skew-symmetric if A T = A. Use part (a) and a property of determinants when taking transposes to show that every skew-symmetric

1001 1001 matrix has determinant 0. Let A be a skew-symmetric matrix. Then A T determinant of both sides, we get = A. Taking the A T = A A = ( 1)A = ( 1) 1001 A = A. Thus A = A, and so 2 A = 0, thus A = 0. 7. An elementary matrix is a matrix which is one elementary row operation away from the identity matrix. For instance, 3 0 0 0 1 0 0 E 1 = 0, E 2 = 1 0 0, E 3 = 3 0 0 0 are all elementary matrices. (a) Let k be any real number, k 0. Find an elementary matrix with determinant k. [ ] k 0 For any k 0, is an elementary matrix (for the row operation R 1 kr 1 ), and has determinant k. (b) BONUS: 3 MARKS. Let E be an n n elementary matrix formed by performing row operation r to the identity I n. Let A be any n n matrix. Then the matrix product EA will result in the result of performing r to A. Use this fact, and properties of determinants to formally prove the following theorem: If A is an n n matrix such that the row reduced row echelon form of A is I n, then det(a) 0. Assume A is an n n matrix with RREF I n. Then there exist row operations r 1, r 2,..., r k such that if we perform them to A (starting with r 1 and proceeding in order), we get I n. That is, there exist elementary matrices E 1,..., E k such that E k E 2 E 1 A = I n. Therefore det(e k E 2 E 1 A) = det(i n ) = 1. But we know from question 1 above that det(e k E 2 E 1 A) = det(e k ) det(e 1 ) det(a). Therefore det(a) cannot equal zero (since if it did, the left hand side would be zero, not 1). 8. Let u = [1, 1, 1], v = [ 1, 2, 5], w = [0, 1, 1]. Calculate each of the following: (a) (2u + v) (v 3w) (2u + v) (v 3w) = (2[1, 1, 1] + [ 1, 2, 5]) ([ 1, 2, 5] 3[0, 1, 1])

= ([2, 2, 2] + [ 1, 2, 5]) ([ 1, 2, 5] [0, 3, 3]) = [1, 4, 7] [ 1, 1, 2] = 1 4 + 14 = 9. (b) u 2 v + ( 3)w u 2 v + ( 3)w = [1, 1, 1] 2 [ 1, 2, 5] + ( 3)[0, 1, 1] = 1 2 + 1 2 + 1 2 2 1 2 + 2 2 + 5 2 + [0, 3, 3] = 3 2 30 + 3 2 + 3 2 = 3 2 30 + 18. 9. Prove the associative rule for addition of vectors in E 3 in the following two different ways: (u + v) + w = u + (v + w) (a) by writing each of u, v, w in terms of their coordinates and simplifying both sides algebraically in coordinate form Let u = (a, b, c), v = (d, e, f), w = (x, y, z). Then (u + v) + w = ((a, b, c) + (d, e, f)) + (x, y, z) = (a + d, b + e, c + f) + (x, y, z) = ((a + d) + x, (b + e) + y, (c + f) + z) = (a + (d + x), b + (e + y), c + (f + z)) = (a, b, c) + (d + x, e + y, f + z) = (a, b, c) + ((d, e, f) + (x, y, z)) = u + (v + w). (b) by a geometric argument using arrow representations for u, v, w

10. Find the points where the plane 3x 2y + 5z = 30 meets each of the x, y and z axes in E 3. Use these intercepts to provide a neat sketch of the plane. Here are the formulae for the axes: x-axis: y-axis: z-axis: x = (t, 0, 0), t R x = (0, t, 0), t R x = (0, 0, t), t R So to find the intersection of this plane and the x-axis, just plug in y = z = 0: 3x = 30 = x = 10 = (10, 0, 0) Similarly, 2y = 30 = y = 15 = (0, 15, 0) 5z = 30 = z = 6 = (0, 0, 6) Therefore we have the following plane:

11. (a) Find an equation for the line through points (1, 3) and (5, 4) in parametric form. The vector v = (5, 4) (1, 3) = (4, 1) is along the line. Therefore the line in point-parallel form is: which in parametric form becomes x = (1, 3) + t(4, 1), t R x = 1 + 4t, y = 3 + t, t R. (b) Find an equation for the line through points (1, 2, 3) and (5, 5, 0) in parametric form. The vector v = (5, 5, 0) (1, 2, 3) = (4, 3, 3) is along the line. Therefore the line in point-parallel form is: which in parametric form becomes x = (5, 5, 0) + t(4, 3, 3), t R x = 5 + 4t, y = 5 + 3t, z = 3t, t R.