Chapter 2: Determinants 17

Size: px
Start display at page:

Download "Chapter 2: Determinants 17"

Transcription

1 Chapter 2: Determinants 17 SECTION B Properties of a Determinant By the end of this section you will be able to prove that the determinant of a triangular or diagonal matrix is the product of the leading diagonal entries evaluate determinants of a triangular and diagonal matrix prove properties of determinant of an elementary matrix establish certain properties of determinants of other matrices You will need to remember the definition of a determinant of a matrix and the technique to evaluate it by using cofactors. This section is a difficult section to follow because we need to prove a number of propositions and some of these rely on the results of chapter 1. B1 Revision of Properties of a Determinant In the last section we established certain properties of the determinant of a matrix such as: Proposition (2.10). If a square n by n matrix A consists of two identical rows then det = 0. Further properties were also established in the associated Exercise 2(a) and we give these reference numbers. T Proposition (2.14). Let A be a square matrix then det ( A ) = det ( A ). What does this mean? The determinant of the transposed matrix is the same as the determinant of the initial matrix. Proposition (2.15). Let B be a matrix obtained from matrix A by multiplying one row (or column) of A by a non-zero scalar k then det ( B) = k det ( A ) We will restate this result later in this section. Proposition (2.16). Let A be a square n by n matrix and k be a scalar then n det ( ka) = k det ( A ) What does this mean? The determinant of the scalar multiplication ka is times the determinant of the matrix A. T Note that since det ( A ) = det ( A ), expanding along a row or column is equivalent. Generally propositions about the determinant of the matrix with the word row can be T det A = det A. swapped by the word column because B2 Determinant Properties of Particular Matrices We can find determinants of particular matrices such as triangular matrices. What are triangular matrices? Definition (2.17). A triangular matrix is a n by n matrix where all entries to one side of the leading diagonal are zero. What is meant by the leading diagonal? Leading diagonal of a matrix is the entries going from the top left hand corner to the bottom right hand corner of the matrix, For example, the following are triangular matrices: n k

2 Chapter 2: Determinants Leading (a) and (b) Diagonal (a) is an example of an upper triangular matrix. (b) is an example of a lower triangular matrix. Another type of matrix is a diagonal matrix. Do you know what is meant by a diagonal matrix? Definition (2.18). A diagonal matrix is a n by n matrix where all entries to both sides of the leading diagonal are zero. Can you think of an example of a diagonal matrix? The identity matrix = Another example is I A diagonal matrix is both an upper and lower triangular matrix. Triangular and diagonal matrices have the following property. Proposition (2.19). The determinant of a triangular or diagonal matrix is a product of the entries along the leading diagonal. What does this proposition mean? Let A be an upper triangle matrix such that a11 a12 a1 n 0 a22 a2n A = 0 0 ann then det = a11a22a33 ann. We prove it for the upper triangular matrix and the proof for the lower triangular matrix is similar. Since the diagonal matrix is a particular upper (or lower) triangular matrix therefore the proof of the diagonal matrix follows from the upper triangular result. We use proof by induction. Remember the method of proof by induction is threefold. 1. Prove it for a base n= 1 or n= 2 (or for some other base n= k0 ). 2. Assume it is true for n= k. 3. Prove it for n= k+ 1. For a 2 by 2 matrix we have det a a = a11a 22 0 = a11a22 0 a22 Hence the determinant of a 2 by 2 upper triangular matrix is the product of entries in the leading diagonal. Therefore the result is true for n = 2. Assume it is true for n = k, that is a11 a12 a1 k k det a a = a11a22a33 akk ( ) 0 0 akk

3 Chapter 2: Determinants 19 We need to prove the result for n= k+ 1, that is a matrix of size k + 1 by k +1. For n= k+ 1 we can find the determinant by expanding along the bottom row because all entries in the bottom row are zero apart from a ( k + 1)( k + 1) : a11 a12 a1 ( k + 1) a11 a12 a1k 0 a22 a 2( k + 1) ( k+ 1 ) + ( k+ 1 ) 0 a22 a2k det 1 a( 1)( 1) det = k+ k+ 0 0 a 0 0 a ( k+ 1)( k+ 1) kk 2k + 2 ( 1) ( k+ 1)( k+ 1) = = a a a a a a a a a a ( + )( + ) kk k 1 k 1 Remember 2 k+ 1 2 ( 1) 2( k+ = 1) =1 because the index 2( 1) = a11a22a33 akk by ( ) k + is even. Hence the determinant of an upper triangular matrix of size k + 1 by k +1 is the product of the entries in the leading diagonal. We have proven the case for n= k+ 1. Therefore by induction we have shown that the determinant of an upper triangular matrix is the product of the entries along the leading diagonal. Example 10 Find the determinants of the following matrices: (a) U = (b) L = (c) D = Solution We use the result of the above Proposition (2.19) because all 3 matrices are upper triangular, lower triangular and diagonal respectively. In each case the determinant is the product of the leading diagonal entries. det U = = 400 (a) (b) ( L) (c) ( D ) det = = 20 det = = 1440 You may like to check these answers by using MATLAB. The MATLAB command for determinant is det(). B3 Determinant Properties of Elementary Matrices Do you remember what an elementary matrix is? An elementary matrix is a matrix obtained by a single row operation on the identity matrix I. Examples of 3 by 3 elementary matrices are , and There are three different types of elementary matrices. kk

4 Chapter 2: Determinants An elementary matrix E obtained from the identity matrix, I, by multiplying a row by a non-zero scalar k. 2. An elementary matrix E obtained from the identity matrix, I, by adding (or subtracting) one row to another. 3. An elementary matrix E obtained from the identity matrix, I, by interchanging two rows (or columns). We can evaluate the determinant of these three different elementary matrices by using the following proposition. Proposition (2.20). Let E be an elementary matrix. (a) If the elementary matrix E is obtained from the identity matrix I by multiplying a det E = k. row by a non-zero scalar k then (b) If the elementary matrix E is obtained from the identity matrix I by adding (or det E = 1. subtracting) a multiple of one row to another then (c) If the elementary matrix E is obtained from the identity matrix I by interchanging det E = 1. two rows (or columns) then (a) Remember the determinant of the identity is 1 therefore by the above Proposition (2.15) with one row of the identity multiplied by non-zero k we have det E = k det I = k 1 = k (b) Remember the identity matrix is a diagonal matrix. If we add a multiple of one row of the identity matrix to another then we have a triangular matrix and by the above proposition (2.19) the determinant of a triangular matrix is the product of the elements along the main diagonal, which is = 1 det E = 1.. Hence (c) We have to prove it for the case when two rows have been interchanged. This is a more complex proof and is by induction. We first prove the result for n = 2 : 0 1 Rows of I2 have det ( E) = det 1 0 been interchanged = 0 1= 1 Hence if we interchange the two rows of the 2 by 2 identity matrix then the determinant is 1. Assume the result is true for n= k, that is k by k elementary matrix Ek with rows i and j interchanged, det E k = 1. We need to prove the result for n= k+ 1. Let E k + 1 be the k+ 1 by k+ 1 elementary matrix with rows i and j of the identity matrix interchanged ith row Ek + 1 = jth row (2.15) de t B = k det A where B is obtained by multiplying one row of A by k

5 Chapter 2: Determinants 21 To find the determinant of this matrix we can expand along the kth row where kth row is not one of ith or jth row. Note that in the kth row all the entries should be zeros apart from the diagonal element which is equal to 1. Therefore the determinant of this matrix E k +1 is e kk k+ k det ( E k+ 1) = ( 1) det ( E k) (*) Why? Because if you delete the elements containing the row and column containing the entry e then the remaining matrix is the k by k elementary matrix with rows i and j kk interchanged, which is E. What is the determinant of E? By our induction hypothesis we have ( E k ) k+ k det ( E ) ( 1) ( 1) k 1 k + = k det = 1. Substituting this into (*) gives k 2 2k = 1 1 = 1 Because 1 = 1 Hence we have proven that the determinant of an elementary matrix of size k +1 by k + 1which has two rows interchanged is 1. Therefore by induction we have our result that if the elementary matrix E is obtained from the identity matrix I by swapping two rows (or columns) then det E = 1. Note that we can use this Proposition (2.20) to find the determinants of elementary matrices. Summarizing this Proposition (2.20) we have that the determinant of an elementary matrix E is given by 1 if a multiple of one row is added to another (2.21) ( E) det = 1 if two rows have been interchanged k if a row has been multiplied by non-zero k Example 11 Find the determinants of the following elementary matrices: (a) A = (b) B = (c) C = Solution Each of these is an elementary matrix so we can use the above Result (2.21). (a) Since this A is the elementary matrix obtained from the identity matrix by multiplying the middle row by 5 we have, by Result (2.21) with k = 5, det A = 5 (b) How is matrix B obtained from the identity matrix? By interchanging top and bottom rows, therefore by the middle line of (2.21) we have det B = 1 (c) How is matrix C obtained from the identity matrix? By subtracting 5 times the bottom row from the top row. Hence by the top line of Result (2.21) we have det C = 1

6 Chapter 2: Determinants 22 B4 Determinant Properties of Other Matrices We can extend Proposition (2.20) or result (2.21) to any square matrix A as the following proposition states. Proposition (2.22). Let B be a matrix obtained from the matrix A by (a) multiplying a row (or column) by a non-zero scalar k. In this case det B = k det A. (b) adding (or subtracting) a multiple of one row to another. In this case det B = det A. (c) interchanging two rows (or columns). In this case det ( B) = det ( Part (a) was proven in Exercise 2(a) and is really Proposition (2.11) stated earlier in this section. See Exercise 2(b) for proofs of parts (b) and (c). We can summarize this into the following result. det if a multiple of one row is added to another (2.23) det ( B) = det if two rows have been interchanged kdet if a row has been multiplied by non-zero k In the next example we apply this result (2.23) to find the determinant of a matrix which has fractional entries. Example 12 Find the determinant of the following matrix: A = Solution How can we find the determinant of this matrix? We can find the determinant of another matrix which is matrix A with top row multiplied by 23, second row multiplied by 6 and bottom row multiplied by 11. How is the determinant of this new matrix, call it B say, related to the determinant of matrix A? ( ) det = det ( B ) = det ( ) We can find the determinant of matrix B as in the last section: det ( B) = det = det ( 2) det + 23det = ( 1 15) + 2( 3 5) + 23( 9 1) = = 152 Substituting this, det B = 152, into ( ) gives A).

7 Chapter 2: Determinants 23 Hence det 76 A = det = 152 det A = = = ( ) For larger size matrices it is normally easier to convert these into triangular matrices by applying row operations. Why carry out this conversion? Because the determinant of a triangular matrix is just the product of the entries on the leading diagonal. The following two examples shows how we use this approach. Example 13 Find the determinant of the following matrix by using row operations: A = Solution Can we convert this into a triangular matrix? Yes by using row operations. Note that the given matrix A is not a triangular matrix because both sides of the leading diagonal contain non-zero entries. You will need to recall your work from chapter 1 on row operations. How can we convert the matrix A into a triangular matrix? First we label the rows of matrix A and then we apply row operations: R R R R Interchanging rows R 1 and R 4, R 2 and R 3 we have R R R R What is the determinant of this matrix? We have a lower triangular matrix so the determinant is the product of the entries on the leading diagonal, that is = 24. What is the determinant of the given matrix A? The bottom matrix is obtained from matrix A by interchanging rows R 1 and R 4, R 2 and R 3. How does interchanging rows affect the determinant of the matrix? By (2.23) interchanging rows multiplies the determinant by 1. Since we have two interchanges therefore the determinant of the matrix A is given by 1 1 det = 2 det A = 24 (2.23) ( B) = ( A ) 4 which gives det det if two rows have been interchanged

8 Chapter 2: Determinants 24 Example 14 Find the determinant of the following matrix: A = Solution Labelling the rows of this matrix we have R R R R R Executing the following row operations: R R2* = R2 R R3* = R3 R R4* = R4 R R5* = R5 R Carrying out the row operation 5 R 2 * gives R R2** = 5 R2* R3 * R4 * R5 * Executing the row operation R ** R1 yields R R2*** = R2** + 4R R3 * R4 * R5 * What is the determinant of this matrix? We have an upper triangular matrix so the determinant is the product of all the entries on the leading diagonal, that is = What is the determinant of the given matrix A? All the above row operations apart from 5 R 2 * makes no difference to the determinant. Why not? Because by result (2.23) adding a multiple of one row to another has the same determinant. How does the row operation 5 R 2 * change the determinant? (2.23) ( B) = ( A ) det det if a multiple of one row is added to another

9 Chapter 2: Determinants 25 By (2.23) we have the above determinant 7680 is 5 det( A ), that is det = 7680 which gives det ( A ) = = Proposition (2.24). Let E be an elementary matrix. For any square matrix A of the same size as E we have det EA = det E det A What does this proposition mean? Means the determinant of matrix multiplication EA is equal to the determinant of the elementary matrix E times the determinant of matrix A. We consider the three different cases of elementary matrices separately. Case 1. Let E be the elementary matrix obtained from the identity matrix by adding a multiple of one row to another. Then from Chapter 1 we have that the matrix multiplication EA performs the same row operation of adding one row to another of matrix A. By the first line of Result (2.23) we have det EA = det A By result (2.21) we have det ( E ) = 1 therefore det ( EA) = det = 1 det = det ( E) det Hence for the first case we have det ( EA) = det ( E) det ( A ). Case 2. Let E be the elementary matrix obtained from the identity matrix by multiplying a row (or column) by a non-zero scalar k. By result (2.21) we have det E = k. The matrix multiplication EA performs the same row operation of multiplying a row by a non-zero scalar k on matrix A. By result (2.23) we have det EA = k det A). ( det EA = det A = det E det A = det k ( E) We have proven det = det det Case 3. See Exercise 2(b). EA E A for the second case. Proposition (2.25). Let E1, E2, E3, and Ek be elementary matrices and B be a square matrix of the same size. Then det ( EEE EB k ) = det ( E1) det ( E2) det ( E3) det ( Ek) det ( B) What does this proposition mean? Means if we have a matrix multiplication EEE EkB then the determinant of this is equal to determinant of each matrix multiplied together. Exercise 2(b). (2.23) ( B) det if a multiple of one row is added to another det = det if two rows have been interchanged kdet if a row has been multiplied by non-zero k

10 Chapter 2: Determinants 26 Next we prove an important property of invertible (non-singular) matrices. Theorem (2.26). A square matrix A is invertible (non-singular) if and only if det A 0 What does this proposition mean? Means if matrix A is invertible then the determinant of A does not equal zero. Also if the determinant is not equal to zero then the matrix A is invertible (non-singular). How do we prove this result? Since it is an if and only if statement, we need to prove it both ways. That is we first det A 0. This direction is assume matrix A is invertible and show that this leads to normally symbolized by. Then we assume det 0 A and prove that matrix A is invertible. This direction is normally symbolized by. ( ). Assume the matrix A is invertible. By Proposition (1.27) part d) of chapter 1 we know the matrix A is a product of elementary matrices. We can write the matrix A as A= EE E E where have E, E, E, and Ek det k are elementary matrices. By Proposition (2.25) we = det ( EE 1 2E3 Ek ) = det det det det ( E1 E2 E3 Ek ) Remember 1 if a multiple of one row is added to another (2.21) det ( E) = 1 if two rows have been interchanged k if a row has been multiplied by non-zero k The determinant of an elementary matrix can only be 1, 1 or the non-zero k. Multiplying these non-zero numbers, det ( E1) det ( E2) det ( E3) det ( Ek ), cannot give 0. Therefore det A 0. Now we go the other way ( ). Assume det ( A ) 0 then by Proposition (2.13) we have A = det 1 1 adj Hence we have proven our result. A which means that matrix A is invertible (non-singular). We can extend Proposition (2.24) to any two square matrices of the same size as the next proposition states. Proposition (2.27). If A and B are square matrices of the same size then det AB = det A det B We consider the two cases of matrix A. Case 1 is where the matrix A is invertible (nonsingular) and case 2 is where matrix A is non-invertible (singular). Case 1. Assume the matrix A is invertible. Then by Proposition (1.27) part d) of chapter 1 we know matrix A is a product of elementary matrices. We can write A= EE E E k (1.27) Part (d) A is invertible A is a product of elementary matrices

11 Chapter 2: Determinants 27 where E1, E2, E3, and Ek are elementary matrices. We have det ( AB) = det ( E1E 2E3 EkB) = det ( E1) det ( E2) det ( E3) det ( Ek ) det ( B) [ By (2.25)] = det EEE Ek det ( B) = A = det det ( B) Case 2. Assume matrix A is non-invertible (singular). By the above Proposition (2.26) we conclude that det A = 0. Since matrix A is non-invertible therefore matrix multiplication AB is also non-invertible. Why? Suppose AB is invertible then by Proposition (1.20) of the last chapter we have matrix A (and B) is invertible. Since AB is also non-invertible therefore det AB = 0. Hence we have our result because det ( AB) = det det ( B ) ( A ) = and det = 0 det 0 AB. Again we can extend the result of Proposition (2.27) to n square matrices as the next proposition states. Proposition (2.28). If A1, A2, A3, and An are square matrices of the same size then det AAA A = det A det A det A det A n Exercise 2(b). Generally a function in mathematics which has these properties of Proposition (2.27) or (2.28) is called a multiplicative function. Generally in mathematics we say a function f is multiplicative if f xy = f x f y The determinant is an example of a multiplicative function. Proposition (2.29). If A is an invertible (non-singular) matrix then Exercise 2(b) det ( A ) = det 1 1 n (1.20) ( AB) = B A (2.25) det ( EEE EkB) = det ( E1) det ( E2) det ( E3) det ( Ek) det ( B) (2.26) A square matrix A is invertible (non-singular) if and only if det 0

12 Chapter 2: Determinants 28 SUMMARY A triangular matrix is a square matrix where all entries to one side of the leading diagonal are zero. A diagonal matrix is a square matrix where all entries to both sides of the leading diagonal are zero. The determinant of a triangular or diagonal matrix is a product of the entries along the leading diagonal. det if a multiple of one row is added to another (2.23) det ( B) = det if two rows have been interchanged kdet if a row has been multiplied by non-zero k A square matrix A is invertible if and only if the determinant of A does not equal to zero. If A and B are square matrices of the same size then det AB = det A det B

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Solving Linear Systems, Continued and The Inverse of a Matrix

Solving Linear Systems, Continued and The Inverse of a Matrix , Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

More information

Notes on Determinant

Notes on Determinant ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

More information

Using row reduction to calculate the inverse and the determinant of a square matrix

Using row reduction to calculate the inverse and the determinant of a square matrix Using row reduction to calculate the inverse and the determinant of a square matrix Notes for MATH 0290 Honors by Prof. Anna Vainchtein 1 Inverse of a square matrix An n n square matrix A is called invertible

More information

8 Square matrices continued: Determinants

8 Square matrices continued: Determinants 8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You

More information

Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).

Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication). MAT 2 (Badger, Spring 202) LU Factorization Selected Notes September 2, 202 Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix

More information

MATHEMATICS FOR ENGINEERS BASIC MATRIX THEORY TUTORIAL 2

MATHEMATICS FOR ENGINEERS BASIC MATRIX THEORY TUTORIAL 2 MATHEMATICS FO ENGINEES BASIC MATIX THEOY TUTOIAL This is the second of two tutorials on matrix theory. On completion you should be able to do the following. Explain the general method for solving simultaneous

More information

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i. Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

More information

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections

More information

Lecture 2 Matrix Operations

Lecture 2 Matrix Operations Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or

More information

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

7 Gaussian Elimination and LU Factorization

7 Gaussian Elimination and LU Factorization 7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method

More information

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that

More information

Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems. Matrix Factorization Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

More information

6. Cholesky factorization

6. Cholesky factorization 6. Cholesky factorization EE103 (Fall 2011-12) triangular matrices forward and backward substitution the Cholesky factorization solving Ax = b with A positive definite inverse of a positive definite matrix

More information

Matrix Algebra in R A Minimal Introduction

Matrix Algebra in R A Minimal Introduction A Minimal Introduction James H. Steiger Department of Psychology and Human Development Vanderbilt University Regression Modeling, 2009 1 Defining a Matrix in R Entering by Columns Entering by Rows Entering

More information

Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively. Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

Unit 18 Determinants

Unit 18 Determinants Unit 18 Determinants Every square matrix has a number associated with it, called its determinant. In this section, we determine how to calculate this number, and also look at some of the properties of

More information

Solution to Homework 2

Solution to Homework 2 Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if

More information

Elementary Matrices and The LU Factorization

Elementary Matrices and The LU Factorization lementary Matrices and The LU Factorization Definition: ny matrix obtained by performing a single elementary row operation (RO) on the identity (unit) matrix is called an elementary matrix. There are three

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

Here are some examples of combining elements and the operations used:

Here are some examples of combining elements and the operations used: MATRIX OPERATIONS Summary of article: What is an operation? Addition of two matrices. Multiplication of a Matrix by a scalar. Subtraction of two matrices: two ways to do it. Combinations of Addition, Subtraction,

More information

DETERMINANTS TERRY A. LORING

DETERMINANTS TERRY A. LORING DETERMINANTS TERRY A. LORING 1. Determinants: a Row Operation By-Product The determinant is best understood in terms of row operations, in my opinion. Most books start by defining the determinant via formulas

More information

The Determinant: a Means to Calculate Volume

The Determinant: a Means to Calculate Volume The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are

More information

Solution of Linear Systems

Solution of Linear Systems Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start

More information

Lecture 4: Partitioned Matrices and Determinants

Lecture 4: Partitioned Matrices and Determinants Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying

More information

The Characteristic Polynomial

The Characteristic Polynomial Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

More information

1.2 Solving a System of Linear Equations

1.2 Solving a System of Linear Equations 1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables

More information

Typical Linear Equation Set and Corresponding Matrices

Typical Linear Equation Set and Corresponding Matrices EWE: Engineering With Excel Larsen Page 1 4. Matrix Operations in Excel. Matrix Manipulations: Vectors, Matrices, and Arrays. How Excel Handles Matrix Math. Basic Matrix Operations. Solving Systems of

More information

Name: Section Registered In:

Name: Section Registered In: Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are

More information

MAT188H1S Lec0101 Burbulla

MAT188H1S Lec0101 Burbulla Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u

More information

Solving Systems of Linear Equations

Solving Systems of Linear Equations LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

More information

Similar matrices and Jordan form

Similar matrices and Jordan form Similar matrices and Jordan form We ve nearly covered the entire heart of linear algebra once we ve finished singular value decompositions we ll have seen all the most central topics. A T A is positive

More information

Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

More information

Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices

Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices Solving square systems of linear equations; inverse matrices. Linear algebra is essentially about solving systems of linear equations,

More information

7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Style. Learning Outcomes

7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Style. Learning Outcomes The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a 0 has a reciprocal b written as a or such that a ba = ab =. Similarly a square matrix A may have an inverse B = A where AB =

More information

1 Introduction to Matrices

1 Introduction to Matrices 1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns

More information

Solving Systems of Linear Equations

Solving Systems of Linear Equations LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

More information

Activity 1: Using base ten blocks to model operations on decimals

Activity 1: Using base ten blocks to model operations on decimals Rational Numbers 9: Decimal Form of Rational Numbers Objectives To use base ten blocks to model operations on decimal numbers To review the algorithms for addition, subtraction, multiplication and division

More information

Systems of Linear Equations

Systems of Linear Equations Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

More information

Solving Systems of Linear Equations Using Matrices

Solving Systems of Linear Equations Using Matrices Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.

More information

SECTION 10-2 Mathematical Induction

SECTION 10-2 Mathematical Induction 73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

More information

9 MATRICES AND TRANSFORMATIONS

9 MATRICES AND TRANSFORMATIONS 9 MATRICES AND TRANSFORMATIONS Chapter 9 Matrices and Transformations Objectives After studying this chapter you should be able to handle matrix (and vector) algebra with confidence, and understand the

More information

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

More information

7. LU factorization. factor-solve method. LU factorization. solving Ax = b with A nonsingular. the inverse of a nonsingular matrix

7. LU factorization. factor-solve method. LU factorization. solving Ax = b with A nonsingular. the inverse of a nonsingular matrix 7. LU factorization EE103 (Fall 2011-12) factor-solve method LU factorization solving Ax = b with A nonsingular the inverse of a nonsingular matrix LU factorization algorithm effect of rounding error sparse

More information

Chapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6

Chapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6 Chapter 7 Matrices Definition An m n matrix is an array of numbers set out in m rows and n columns Examples (i ( 1 1 5 2 0 6 has 2 rows and 3 columns and so it is a 2 3 matrix (ii 1 0 7 1 2 3 3 1 is a

More information

Introduction to Matrices for Engineers

Introduction to Matrices for Engineers Introduction to Matrices for Engineers C.T.J. Dodson, School of Mathematics, Manchester Universit 1 What is a Matrix? A matrix is a rectangular arra of elements, usuall numbers, e.g. 1 0-8 4 0-1 1 0 11

More information

18.06 Problem Set 4 Solution Due Wednesday, 11 March 2009 at 4 pm in 2-106. Total: 175 points.

18.06 Problem Set 4 Solution Due Wednesday, 11 March 2009 at 4 pm in 2-106. Total: 175 points. 806 Problem Set 4 Solution Due Wednesday, March 2009 at 4 pm in 2-06 Total: 75 points Problem : A is an m n matrix of rank r Suppose there are right-hand-sides b for which A x = b has no solution (a) What

More information

9.2 Summation Notation

9.2 Summation Notation 9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

More information

Matrix Differentiation

Matrix Differentiation 1 Introduction Matrix Differentiation ( and some other stuff ) Randal J. Barnes Department of Civil Engineering, University of Minnesota Minneapolis, Minnesota, USA Throughout this presentation I have

More information

1 2 3 1 1 2 x = + x 2 + x 4 1 0 1

1 2 3 1 1 2 x = + x 2 + x 4 1 0 1 (d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which

More information

Chapter 2 Determinants, and Linear Independence

Chapter 2 Determinants, and Linear Independence Chapter 2 Determinants, and Linear Independence 2.1 Introduction to Determinants and Systems of Equations Determinants can be defined and studied independently of matrices, though when square matrices

More information

Lecture 1: Systems of Linear Equations

Lecture 1: Systems of Linear Equations MTH Elementary Matrix Algebra Professor Chao Huang Department of Mathematics and Statistics Wright State University Lecture 1 Systems of Linear Equations ² Systems of two linear equations with two variables

More information

Lecture Notes 2: Matrices as Systems of Linear Equations

Lecture Notes 2: Matrices as Systems of Linear Equations 2: Matrices as Systems of Linear Equations 33A Linear Algebra, Puck Rombach Last updated: April 13, 2016 Systems of Linear Equations Systems of linear equations can represent many things You have probably

More information

LINEAR ALGEBRA. September 23, 2010

LINEAR ALGEBRA. September 23, 2010 LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................

More information

13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions. 3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms

More information

by the matrix A results in a vector which is a reflection of the given

by the matrix A results in a vector which is a reflection of the given Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

More information

Linear Algebra Notes

Linear Algebra Notes Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note

More information

Chapter 6. Orthogonality

Chapter 6. Orthogonality 6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be

More information

Linear Codes. Chapter 3. 3.1 Basics

Linear Codes. Chapter 3. 3.1 Basics Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

More information

SOLVING LINEAR SYSTEMS

SOLVING LINEAR SYSTEMS SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis

More information

Row Echelon Form and Reduced Row Echelon Form

Row Echelon Form and Reduced Row Echelon Form These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation

More information

Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components

Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components The eigenvalues and eigenvectors of a square matrix play a key role in some important operations in statistics. In particular, they

More information

AMATH 352 Lecture 3 MATLAB Tutorial Starting MATLAB Entering Variables

AMATH 352 Lecture 3 MATLAB Tutorial Starting MATLAB Entering Variables AMATH 352 Lecture 3 MATLAB Tutorial MATLAB (short for MATrix LABoratory) is a very useful piece of software for numerical analysis. It provides an environment for computation and the visualization. Learning

More information

Factorization Theorems

Factorization Theorems Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

Linear Algebra Review. Vectors

Linear Algebra Review. Vectors Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length

More information

Notes on Linear Algebra. Peter J. Cameron

Notes on Linear Algebra. Peter J. Cameron Notes on Linear Algebra Peter J. Cameron ii Preface Linear algebra has two aspects. Abstractly, it is the study of vector spaces over fields, and their linear maps and bilinear forms. Concretely, it is

More information

9.4. The Scalar Product. Introduction. Prerequisites. Learning Style. Learning Outcomes

9.4. The Scalar Product. Introduction. Prerequisites. Learning Style. Learning Outcomes The Scalar Product 9.4 Introduction There are two kinds of multiplication involving vectors. The first is known as the scalar product or dot product. This is so-called because when the scalar product of

More information

Suk-Geun Hwang and Jin-Woo Park

Suk-Geun Hwang and Jin-Woo Park Bull. Korean Math. Soc. 43 (2006), No. 3, pp. 471 478 A NOTE ON PARTIAL SIGN-SOLVABILITY Suk-Geun Hwang and Jin-Woo Park Abstract. In this paper we prove that if Ax = b is a partial signsolvable linear

More information

Introduction to Matrix Algebra

Introduction to Matrix Algebra Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary

More information

Lecture 1: Schur s Unitary Triangularization Theorem

Lecture 1: Schur s Unitary Triangularization Theorem Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections

More information

Matrix-vector multiplication in terms of dot-products

Matrix-vector multiplication in terms of dot-products Matrix-vector multiplication in terms of dot-products Let M be an R C matrix. Dot-Product Definition of matrix-vector multiplication: M u is the R-vector v such that v[r] is the dot-product of row r of

More information

Introduction. Appendix D Mathematical Induction D1

Introduction. Appendix D Mathematical Induction D1 Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

More information

1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES 1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

More information

Lecture 3: Finding integer solutions to systems of linear equations

Lecture 3: Finding integer solutions to systems of linear equations Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture

More information

Operation Count; Numerical Linear Algebra

Operation Count; Numerical Linear Algebra 10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point

More information

Question 2: How do you solve a matrix equation using the matrix inverse?

Question 2: How do you solve a matrix equation using the matrix inverse? Question : How do you solve a matrix equation using the matrix inverse? In the previous question, we wrote systems of equations as a matrix equation AX B. In this format, the matrix A contains the coefficients

More information

( ) which must be a vector

( ) which must be a vector MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are

More information

CS3220 Lecture Notes: QR factorization and orthogonal transformations

CS3220 Lecture Notes: QR factorization and orthogonal transformations CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss

More information

Subspaces of R n LECTURE 7. 1. Subspaces

Subspaces of R n LECTURE 7. 1. Subspaces LECTURE 7 Subspaces of R n Subspaces Definition 7 A subset W of R n is said to be closed under vector addition if for all u, v W, u + v is also in W If rv is in W for all vectors v W and all scalars r

More information

Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

More information

Beginner s Matlab Tutorial

Beginner s Matlab Tutorial Christopher Lum lum@u.washington.edu Introduction Beginner s Matlab Tutorial This document is designed to act as a tutorial for an individual who has had no prior experience with Matlab. For any questions

More information

CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation

CONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in

More information

To give it a definition, an implicit function of x and y is simply any relationship that takes the form:

To give it a definition, an implicit function of x and y is simply any relationship that takes the form: 2 Implicit function theorems and applications 21 Implicit functions The implicit function theorem is one of the most useful single tools you ll meet this year After a while, it will be second nature to

More information

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.

Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook. Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information

[1] Diagonal factorization

[1] Diagonal factorization 8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:

More information

Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

More information

Lecture 5: Singular Value Decomposition SVD (1)

Lecture 5: Singular Value Decomposition SVD (1) EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25-Sep-02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system

More information

Chapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors

Chapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors Chapter 9. General Matrices An n m matrix is an array a a a m a a a m... = [a ij]. a n a n a nm The matrix A has n row vectors and m column vectors row i (A) = [a i, a i,..., a im ] R m a j a j a nj col

More information

Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013

Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013 Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,

More information

MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A =

MAT 200, Midterm Exam Solution. a. (5 points) Compute the determinant of the matrix A = MAT 200, Midterm Exam Solution. (0 points total) a. (5 points) Compute the determinant of the matrix 2 2 0 A = 0 3 0 3 0 Answer: det A = 3. The most efficient way is to develop the determinant along the

More information

Some Lecture Notes and In-Class Examples for Pre-Calculus:

Some Lecture Notes and In-Class Examples for Pre-Calculus: Some Lecture Notes and In-Class Examples for Pre-Calculus: Section.7 Definition of a Quadratic Inequality A quadratic inequality is any inequality that can be put in one of the forms ax + bx + c < 0 ax

More information

MATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3

MATH2210 Notebook 1 Fall Semester 2016/2017. 1 MATH2210 Notebook 1 3. 1.1 Solving Systems of Linear Equations... 3 MATH0 Notebook Fall Semester 06/07 prepared by Professor Jenny Baglivo c Copyright 009 07 by Jenny A. Baglivo. All Rights Reserved. Contents MATH0 Notebook 3. Solving Systems of Linear Equations........................

More information

26. Determinants I. 1. Prehistory

26. Determinants I. 1. Prehistory 26. Determinants I 26.1 Prehistory 26.2 Definitions 26.3 Uniqueness and other properties 26.4 Existence Both as a careful review of a more pedestrian viewpoint, and as a transition to a coordinate-independent

More information