Inverse and Elementary Matrices
|
|
- Valentine Barber
- 7 years ago
- Views:
Transcription
1 1. Inverse matrices Inverse and Elementary Matrices Recall the economy problem: B " œ total production of coal B # œ total production of steel B $ œ total production of electricity Based on an economic model, have system of equations for B À 3 B Þ#B Þ%B œ " " # $ (*) Þ"B Þ*B Þ#B œþ( Þ " # $ Þ"B Þ#B Þ*B œ#þ* " # $ Recall: we defined \œ Ô B" B# ÕB Ø $ à Eœ Ô " Þ# Þ% Þ" Þ* Þ# Õ Þ" Þ# Þ* Ø [known] Fœ Ô " Þ( Õ#Þ* Ø [known] Then equation for unknown matrix \ is: E\ œ F [recall any system of equations can be written this way].
2 How to solve in general for \? Definition 1: An 8 8 matrix is called the identity matrix M if it has 1's along the diagonal and zeroes elsewhere. Example 1: M œ % % Ô "!!!! "!! identity matrix œ Ö Ù.!! "! Õ!!! " Ø Note: ab % À [note size of the matrix is usually understood]. NOTE: M#$ œ!à M$# œ!à M$$ œ ". That is, M78 œ! unless 7œ8. Ô "!!! Ô," Ô,"! "!! ÙÖ, #,# Mb œ Ö ÙÖ Ù œ Ö Ù œ bþ!! "!, $, $ Õ!!! " ØÕ, Ø Õ, Ø % % Similarly this holds for all sizes 8 of the identity. Proposition 1: If M is an 8 8 identity matrix and a is an 8-vector, then Ma œ aþ Proof: as seen directly by multiplication. Ô "!! á! Ô + " Ô + "! "! á! ÙÖ+ # + # ÙÖ Ma œ!! "! ÙÖ+ $ œ + $ ß Ö ÙÖ Ù Ö Ù ã ã ã ä ã ã ã Õ!!! á " ØÕ+ Ø Õ+ Ø 8 8 Proposition 2: For any matrix Efor which the product makes sense, M E œ EÞ 8
3 Proof: MEœMÒa" áa7 ÓœÒMa" áma7 ÓœÒa" áa7óœeþ Definition 2: Given a square matrix E, a matrix F is called the inverse of E if EFœM and FEœMÞ A matrix for which an inverse exists is called invertible. " # " " " # Example 2: Eœ à E œ Þ # " $ # " Theorem 2: If E has an inverse matrix F, then F is unique (i.e., there is no other inverse matrix). Proof: If F and G are both inverses of E then: FœFMœFÐEGÑœÐFEÑGœMGœGß so that any two inverses are the same, i.e., there is only one inverse. Theorem: Given square matrices Eand F, if FEœM, then EFœM, i.e., Fis automatically the inverse of E. (Proved later in this lecture - after invertible matrix theorem) Now: +, B D Let's find inverse of Eœ : Find \œ s.t. -. C A +, B D œ "! -. C A! " Þ Get: +B,C œ " -B.C œ!
4 +D,A œ! -D.A œ " Augmented matrix for the first pair: Augmented matrix for second pair: +, l " -. l! Solve in parallel: +, l! -. l " +, l "! -. l! " Use row reduction: ",Î+ l "Î+! Ä ",Î+ l "Î+! -. l! "! Ð+.,-ÑÎ+ l -Î+ " Ä Ä ",Î+ l "Î+!! " l -ÎÐ+.,-Ñ +ÎÐ+.,-Ñ "! l "Î+ -,ÎÐ+Ð+.,-ÑÑ,ÎÐ+.,-Ñ! " l -ÎÐ+.,-Ñ +ÎÐ+.,-Ñ œ "! l.îð+.,-ñ,ð+.,-ñ! " l -ÎÐ+.,-Ñ +Ð+.,-Ñ But note the entries in the first column on the right should be the solution for B and C:
5 B.ÎÐ+.,-Ñ œ C -ÎÐ+.,-Ñ ß since the solution for B and C is obtained by manipulating the first column of the right hand side. And similarly the second column on the right should be D,ÎÐ+.,-Ñ œ A +ÎÐ+.,-Ñ So the inverse is: " B D.ÎÐ+.,-Ñ,ÎÐ+.,-Ñ E œ F œ œ C A -ÎÐ+.,-Ñ +ÎÐ+.,-Ñ œ " +.,-., - + +, Moral: to invert Eœ ß -. row reduce +, l "! "! l B D " Ä -. l! "! " l C A œ ÒMlE Ó (after row reduction) that is, after row reduction the identity will be in the left block, and the desired inverse matrix appears in the right block. Thus: \E œ Mà can also check that E\ œ MÞ Check: +, "., "! , œ - +! " Þ Thus we have a general formula for Note this is a general method # # matrices. Definition 3: A matrix which has an inverse is called nonsingular
6 Theorem 3: If E and F are nonsingular then EF is also nonsingular and ÐEFÑ œ F E " " " Þ " " " " " Pf: Note that ÐF E ÑÐEFÑ = ", so that ÐEFÑ œ F E. Note that the other direction giving the identity can also be checked. [Note: this generalizes to larger products of matrices in the expected way; see corollary 1.1; you will do the proof in exercises.] [Note there are some other theorems in the book along same lines; proofs are simple] 2. Conclusion of the original matrix problem: Recall: We had (*) B Þ#B Þ%B œ " " # $ Þ"B Þ*B Þ#B œþ( " # $ Þ"B Þ#B Þ*B œ#þ* " # $ Showed that if we defined \œ Ô B" B# à ÕB Ø $ Eœ Ô " Þ# Þ% Þ" Þ* Þ# Õ Þ" Þ# Þ* Ø [known] Fœ Ô " Þ( Õ#Þ* Ø [known], then to find \ we solve E\ œ Fß
7 for the unknown matrix \. How to do that? Suppose that matrix E has an inverse matrix E " : then " " " E\œF Ê ÐE EÑ\œE F Ê \œe F Thus we would have the unknown vector X as a product of two known matrices. " How to find E for a $ $ matrix? We'll find out later. Example (2 2; a previous example revisited ): Consider a metro area with constant population of 1 million. Area consists of city and suburbs. Analyze changing urban and suburban populations. Let G" and W" denote the two populations in the first year of our study, and in general G8 and W8 denote the populations in the 8 >2 year of the study. Assume that each year 15% of people in city move to suburbs, and 10% of people in suburbs move to the city. Thus next year's city population will be.85 times this year's city population plus.10 times this year's suburban population: Similarly G œþ)&g Þ"W 8 " 8 8 W8 " œþ"&g8.*!w8 Þ A) If the populations in year 2 were.5 and.5 million, what were they in year 1? Þ& œ Þ)& G Þ& œ Þ"& G Þ" W.*! W " " " " System of equations for G and W Þ Write as matrix: " " = ðóóñóóò Þ)& Þ" ï G " ï Þ& Þ"& Þ* W Þ& " E \ F
8 " " Þ* Þ" E œ Þ Þ* Þ)& Þ" Þ"& Þ"& Þ)& œ " Þ(& Þ* Þ" "Þ# Þ"$$$ œ Þ"& Þ)& Þ# "Þ"$$$ Thus: " "Þ# Þ"$$$ Þ& Þ&$$% \œe F œ œ Þ# "Þ"$$$ Þ& Þ%''( Which give original populations of the city and suburbs. 3. Elementary Matrices: Definition: An elementary matrix is a matrix obtained from the identity by a single elementary row operation. Ex 1: Elementary matrix of type I [interchange rows] : Ô!! "! "! Õ"!! Ø Elementary matrix of type II [multiply row by a constant] : Ô "!!! $! Õ!! " Ø Elementary matrix of type III [add multiple of one row to another] :
9 Ô "!!! "! Õ$! " Ø 4. Some theorems about elementary matrices: Note: now we will prove some theorems about elementary matrices; we will make them statements (most of which I will prove; will state when not proving them) Þ This is a story about elementary matrices we will be writing. Theorem 1: Let E be a matrix, and let F be the result of applying an ERO to E. Let I be the elementary matrix obtained from I by performing the same ERO. Then FœIEÞ Proof is exercise. Ô "!! Example 1: Start with Mœ! "! ß and add 3 row 1 + row 3 Õ!! " Ø to get the elementary matrix: Ô "!! Iœ! "! Þ Õ$! " Ø Now note that multiplying any matrix E by I performs the same operation on E: Ô "!! Ô # "! Ô # "! IE œ! "! " " # œ " " # Þ Õ$! " ØÕ # " $ Ø Õ ) % $ Ø Thus conclude: If have matrix E, and apply series of ERO's to E: E Ä E Ä E Ä E Ä á Ä E " # $ 8
10 Each ERO can be obtained by multiplying the previous matrix by an elementary matrix: E œ I E " " E œie œiie # # " # " E œie œiiie $ $ # $ # " (*) E œii áiie " # " ã Conclusion 1: If E 8 is the result of applying a series of row operations to E, then E8 can be expressed in terms of E as in (*) above. Note that every elementary row operation can be reversed by an elementary row operation of the same type. Since ERO's are equivalent to multiplying by elementary matrices, have parallel statement for elementary matrices: Theorem 2: Every elementary matrix has an inverse which is an elementary matrix of the same type. Proof: See book 5. More facts about matrices: Assume henceforth E is a square 8 8 matrix. Suppose we have homogeneous system Î Ô B" Ñ B# Ð Eœ [ E 34]; \œ Ö ÙÓ: ã Ï ÕB ØÒ %
11 E\ œ! Þ Assume that only solution is \œ! (i.e. zero matrix for \). What can we conclude about E? Reduce E to reduced row echelon form: E Ä F Then F\ œ! has the same solutions. But F has to have all non-zero rows, since if a row is 0 then there will be nontrivial solutions for \ (less equations than unknowns; see results from class last time). Therefore, F must be the identity. Conversely, if E is row equivalent to M, then E\ œ! is equivalent to M\ œ!, so the only solution is \ œ!þ We have just proved: Conclusion 2: E is row-equivalent to I, the identity matrix, 300 E\ œ! has no nontrivial solutions. Example: Eœ " # " # Ä 2 %!! System of equations: Lots of solutions: B œ B # # B œ #B Þ " # E\ œ! Ä B" #B# œ!!!œ!
12 B " # Thus \œ œb ß B arbitrary (infinite number of B # " # # solutions). Conclude: exist nontrivial solutions. Thus Eis not row-eqivalent to M. [as can be checked directly] Again we assume here our matrices are square: 1. Nonsingular matrices are just products of elementary matrices then: Notice that if a matrix E is nonsingular (invertible), then if E\ œ!, " " E\ œ! Ê E E\ œ E! Ê M\ œ! Thus E\ œ! Ê \ œ!þ has no nontrivial solutions. Thus E is row equivalent to I. Thus there exist elementary matrices IßáßI " 5 such that: I I I ái I E œ M 5 5 " 5 # # " " " " " " " " # 5 " # 5 Ê E œ ÐI I ái ÑM œ I I ái Þ So E is a product of elementary matrices. Also, note that if E is a product of elementary matrices, then Eis nonsingular since the product of nonsingular matrices is nonsingular. Thus Conclusion 3: E is a product of elementary matrices (note inverses of elementary matrices are also elementary) iff E is nonsingular, Now notice that:
13 if E is nonsingular, then EœIIáI " # 5 œiiái " # 5Mœ a matrix row equivalent to MÞ Can reverse the argument: if E row equivalent to M then so E is nonsingular. EœIIáI Mß " # 5 Conclusion 4: E3s row equivalent to M iff Eis nonsingular. Example 2: Eœ # " "Î#V" " "Î# Í " # #V " # " V" V # " "Î# #Î$ V# " "Î# Í Í V V! $Î# $Î#V! " " # # "Î# V# V " "! Í. "Î#V V! " # " Thus E is equivalent to the identity, so by conclusion 4, we have that E is nonsingular. Thus E must be a product of elementary matrices. But note we can reverse the above process and go from I to E as shown above.
14 Thus Eœ #! "! "! " "Î# "!! " " "! $Î#! "! " œiiiim " # $ % Thus since matrices. 2. Conclusions: E is nonsingular it is indeed a product of elementary We have shown the following are equivalent (if you follow through the arguments): 1. E is nonsingular 2. E\ œ! has only trivial soln. 3. E is row equivalent to M 4. E\ œ F has a unique solution for every given column matrix F. 5. E is a product of elementary matrices. [Note that other equivalences are shown in section 2.2; these are the important ones for now] T<990 À We have showed 2, 3, are equivalent in Conclusion 2. 1 and 5 are equivalent by Conclusion 3. And 1 and 3 are equivalent by Conclusion 4. To show that % is equivalent to ", note that if 1 holds, then the equation implies which implies E\ œ F " " E E\ œ E F \œe which means \ has a unique solution, so that 4 holds. Conversely, if 4 holds then E\œFhas a unique solution for each F. Setting Fœ!, we get that E\ œ! has only trivial solution, which shows E is nonsingular via condition 2 above. " Fß
15 We thus have 2 Í 3 Í 1 Í 5, and that 1 Í 4. This shows that all statements are equivalent. 3. A useful Corollary: Corollary: Let E be a 8 8matrix. If the square matrix F satisfies FE œ M, Ð"Ñ then automatically also EF œ M Ð#Ñ " i.e., F œ E. Similarly, Ð#Ñ also implies Ð"ÑÞ Proof: Suppose Ð"Ñ holds. Then E\œ! Ê FE\œ! Ê \œ! Ê only trivial solution Also we have from Ð"Ñ: ÊE " exists. " " " FEE œ ME Ê F œ E Þ Now suppose Ð#Ñ holds. Then reversing the roles of E and F, it follows that (1) holdsþ 4. Inverting a matrix: If Eis invertible then Eis row-equivalent to M, so II 5 5 " " áieœmß where the I are ERO which get M. Thus 5 E œ I I ái Mß " 5 5 " "
16 i.e. to get we need to perform the same elementary row operations on M that we perform on Eto turn it into identity. E " Example 1: Find inverse of Eœ # " " # [note we already know how to invert this in another way] Inversion process: # " l "! " # l! " Ä Ä " "Î# l "Î#! " # l! " " "Î# l "Î#!! $Î# l "Î# " Ä " "Î# l "Î#!! " l "Î$ #Î$ Ä "! l #Î$ "Î$! " l "Î$ #Î$ So " #Î$ "Î$ E œ Þ "Î$ #Î$ [Note that material below completes our coverage of material related to the inverse matrix theorem] 5. Inverses and linear transformations
17 Recall if E is a nonsingular square matrix, and x is a vector, then we can define the function Recall properties XÐxÑ œ ExÞ XÐx yñœeðx yñœex Ey œxðxñ XÐyÑ XÐ-xÑœE-x œ-ex œ-xðxñþ Thus X is a linear transformation. [recall X can be viewed as a rule for taking the vector xto Ex] We define the inverse X " of X as the operation which takes Xxback to x. Thus X " ÐXÐxÑÑ œ x [note this happens only if X is 1-1 and onto] Figure: Eviewed as a linear transformation: Ex œ XÐxÑÞ Note that X " inverts the operation. Note that " " E ÐXxÑ œ E ÐExÑ œ xþ Thus it must be that " " X ÐXxÑ œ E ÐXxÑ
18 " " so that X corresponds to multiplication by E. [this is stated as a theorem in the text]
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 informationMATRIX 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 informationMATH10212 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 informationUsing 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 informationSystems 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 information8 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 informationMethods for Finding Bases
Methods for Finding Bases Bases for the subspaces of a matrix Row-reduction methods can be used to find bases. Let us now look at an example illustrating how to obtain bases for the row space, null space,
More informationSolving 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 informationSolving 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 informationReduced echelon form: Add the following conditions to conditions 1, 2, and 3 above:
Section 1.2: Row Reduction and Echelon Forms Echelon form (or row echelon form): 1. All nonzero rows are above any rows of all zeros. 2. Each leading entry (i.e. left most nonzero entry) of a row is in
More information1.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 informationDecember 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 informationAu = = = 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 information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationNotes 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 informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationMATH2210 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 information1 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 informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More informationLecture 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 informationa 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 informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationMath 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
More informationLinear 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 informationMATH 551 - APPLIED MATRIX THEORY
MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points
More informationMath 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 informationLectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal
More informationSection 8.2 Solving a System of Equations Using Matrices (Guassian Elimination)
Section 8. Solving a System of Equations Using Matrices (Guassian Elimination) x + y + z = x y + 4z = x 4y + z = System of Equations x 4 y = 4 z A System in matrix form x A x = b b 4 4 Augmented Matrix
More information( ) 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 informationContinued 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 informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More informationSolving 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 information6. 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 informationRow 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 informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.5 SOLUTION SETS OF LINEAR SYSTEMS HOMOGENEOUS LINEAR SYSTEMS A system of linear equations is said to be homogeneous if it can be written in the form A 0, where A
More informationby 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 informationMAT 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 informationSimilarity 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α = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationMAT188H1S 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 informationLinear Equations ! 25 30 35$ & " 350 150% & " 11,750 12,750 13,750% MATHEMATICS LEARNING SERVICE Centre for Learning and Professional Development
MathsTrack (NOTE Feb 2013: This is the old version of MathsTrack. New books will be created during 2013 and 2014) Topic 4 Module 9 Introduction Systems of to Matrices Linear Equations Income = Tickets!
More information1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0
Solutions: Assignment 4.. Find the redundant column vectors of the given matrix A by inspection. Then find a basis of the image of A and a basis of the kernel of A. 5 A The second and third columns are
More information1 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 informationChapter 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 informationLecture 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 informationSolution 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 informationName: 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 informationv w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.
3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationMAT 242 Test 2 SOLUTIONS, FORM T
MAT 242 Test 2 SOLUTIONS, FORM T 5 3 5 3 3 3 3. Let v =, v 5 2 =, v 3 =, and v 5 4 =. 3 3 7 3 a. [ points] The set { v, v 2, v 3, v 4 } is linearly dependent. Find a nontrivial linear combination of these
More information1.5 SOLUTION SETS OF LINEAR SYSTEMS
1-2 CHAPTER 1 Linear Equations in Linear Algebra 1.5 SOLUTION SETS OF LINEAR SYSTEMS Many of the concepts and computations in linear algebra involve sets of vectors which are visualized geometrically as
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More informationOrthogonal Projections
Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors
More informationLecture 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 informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationSYSTEMS 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 informationThe 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 informationFactorization 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 information1 Determinants and the Solvability of Linear Systems
1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely side-stepped
More informationMathematics 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 informationHomogeneous equations, Linear independence
Homogeneous equations, Linear independence 1. Homogeneous equations: Ex 1: Consider system: B" #B# œ! B" #B3 œ! B B œ! # $ Matrix equation: Ô " #! Ô B " Ô! "! # B # œ! œ 0Þ Ð3Ñ Õ! " " ØÕB Ø Õ! Ø $ Homogeneous
More informationNOTES 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 informationChapter 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 informationDETERMINANTS 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 informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More information9 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 informationSolving 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 informationChapter 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 informationMatrix 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 informationIntroduction 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 informationCross product and determinants (Sect. 12.4) Two main ways to introduce the cross product
Cross product and determinants (Sect. 12.4) Two main ways to introduce the cross product Geometrical definition Properties Expression in components. Definition in components Properties Geometrical expression.
More information5 Homogeneous systems
5 Homogeneous systems Definition: A homogeneous (ho-mo-jeen -i-us) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x +... + a n x n =.. a m
More informationTypical 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 informationAbstract: 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 information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More informationNotes from February 11
Notes from February 11 Math 130 Course web site: www.courses.fas.harvard.edu/5811 Two lemmas Before proving the theorem which was stated at the end of class on February 8, we begin with two lemmas. The
More informationDETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH
DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH CHRISTOPHER RH HANUSA AND THOMAS ZASLAVSKY Abstract We investigate the least common multiple of all subdeterminants,
More informationDot product and vector projections (Sect. 12.3) There are two main ways to introduce the dot product
Dot product and vector projections (Sect. 12.3) Two definitions for the dot product. Geometric definition of dot product. Orthogonal vectors. Dot product and orthogonal projections. Properties of the dot
More informationDirect 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 informationThe 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 informationElementary 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 informationLecture 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 informationHomogeneous systems of algebraic equations. A homogeneous (ho-mo-geen -ius) system of linear algebraic equations is one in which
Homogeneous systems of algebraic equations A homogeneous (ho-mo-geen -ius) system of linear algebraic equations is one in which all the numbers on the right hand side are equal to : a x + + a n x n = a
More informationLecture 14: Section 3.3
Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in
More information13 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 informationLinear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University
Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone
More informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
More information[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 informationMATH 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 informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationExamination paper for TMA4115 Matematikk 3
Department of Mathematical Sciences Examination paper for TMA45 Matematikk 3 Academic contact during examination: Antoine Julien a, Alexander Schmeding b, Gereon Quick c Phone: a 73 59 77 82, b 40 53 99
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationUnit 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 informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationSubspaces 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