Section 3.1. Solution: C(A) is a line (the x-axis), C(B) is a plane (the xy-plane), C(C) is a line (through 0 and (1, 2, 0)). Section 3.

Save this PDF as:

Size: px
Start display at page:

Download "Section 3.1. Solution: C(A) is a line (the x-axis), C(B) is a plane (the xy-plane), C(C) is a line (through 0 and (1, 2, 0)). Section 3."

Transcription

1 Section. 2. Suppose the multiplication cx is defined to produce (cx, ) instead of (cx, cx 2 ), which of the eight conditions are not satisfied?, 4, 5. Which of the following subsets of R are actually subspaces? (a) The plane of vectors (b, b 2, b ) with b = b 2. (b) The plane of vectors with b =. (c) The vectors with b b 2 b =. (d) All linear combinations of v = (, 4, ) and w = (2, 2, 2). (e) All vectors that satisfy b + b 2 + b =. (f) All vectors with b b 2 b. a, d, e 9. Describe the column spaces (lines or planes) of these particular matrices: A = 2 and B = 2 and C = 2. C(A) is a line (the x-axis), C(B) is a plane (the xy-plane), C(C) is a line (through and (, 2, )). Section.2. Reduce these matrices to their ordinary echelon forms U: (a) A = (b) B = (a) U A = (b) U B = By combining the special solutions in Problem 2, describe every solution to Ax = and Bx =. The nullspace contains only x = when there are no. All solutions to Ax = are given by x = x 2 ( 2,,,, ) + x 4 (,, 2,, ) + x 5 (,,,, ), all solutions to Bx = are given by x = x (,, ). The nullspace contains only x = when there are no free variables. 9. True or false (with reason if true or example to show it is false): (a) A square matrix has no free variables. (b) An invertible matrix has no free variables. (c) An m by n matrix has no more than n pivot variables. (d) An m by n matrix has no more than m pivot variables.

2 2 (a) False, e.g., A = has two free variables. (b) True, because an invertible matrix has only in its nullspace. (c) True because there are only n variables total. (d) True because every row contains at most one pivot.. If the nullspace of A consists of all multiples of x = (2,,, ), how many pivots appear in U? What is R? I F pivots appear in U, and R = in block form, where I is the by identity matrix, and F = 2. The blocks have and columns, respectively, and they could have any number of rows. Section. 2. Find the reduced row echelon form R and the rank of these matrices: (a) The by 4 matrix with all entries equal to 4. (b) The by 4 matrix with a ij = i + j. (c) The by 4 matrix with a ij = ( ) j. (a) Rank, R =. (b) Rank 2, (c) Rank, R = 2 2. R =. 8. Fill out these matrices so that they have rank : A = and B = a b and M =. c A = and B = 9 9/2 /2 a b and M =. c bc/a If A has rank r, then it has an r by r submatrix S that is invertible. Remove m r rows and n r columns to find an invertible submatrix S inside A, B, and C. You could keep the

3 pivot rows and pivot columns: A = 2 ] 2 4 B = 2 ] C =. S A = 4 S B = ] S C =. 24. What is the nullspace matrix N (containing the special solutions) for A, B, C? A = I I ] I I and B = and C = I I I ]. N A = I I and N B = I I and N C = I I I. I Section.4. Execute the six steps of Worked Example.4A to describe the column space and nullspace of A and the complete solution to Ax = b: A = b = b b 2 = First we reduce the augmented matrix to row echelon form (step ): b b b 2 b 2 b b 2 b 2 b b 2 b b b + b 2 2b This shows that the condition for the existence of a solution is b + b 2 2b = (step 2). The column space of of A is the plane containing all linear combinations of the pivot columns (2, 2, 2) and (4, 5, ), or equivalently all vectors b satisfying the condition b + b 2 2b = (step ). The free variables are x and x 4, so the first special solution is x =, x 4 =, and by back substitution with U we get x 2 = x 2x 4 = and x = 2 ( 4x 2 6x 4x 4 ) =, so s = (,,, ). Similarly, the second special solution has x =, x 4 =, and back substitution gives x 2 = 2 and x = 2, so s 2 = (2, 2,, ). The nullspace consists of all linear combinations x N = c s +c 2 s 2 (step 4). The particular solution to b = (4,, 5) is obtained by setting x = x 4 = and solving by back substitution with U, so x 2 = b 2 b x x 4 = and x = 2 (b 4x 2 6x 4x 4 ) = 4, so x P = (4,,, ). The complete solution is x = x P + x N (step 5). Continuing the elimination to the reduced form gives b 4b 2 2 b 2 b b + b 2 2b b b 2b 2 2 b 2 b b + b 2 2b This shows directly from the matrix that the particular solution is always ( 5 2 b 2b 2, b 2 b,, ), and that the special solutions are (,,, ) and (2, 2,, ) (step 6)..

4 4 5. Under what conditions on b, b 2, b is this system solvable? Include b as a fourth column in elimination. Find all solutions when that condition holds: x + 2y 2z = b 2x + 5y 4z = b 2 4x + 9y 8z = b Again we reduce the augmented matrix by elimination: 2 2 b b b b 2 2b 2 2 b b 2 2b b b 4b b b 2 2b The condition is b b 2 2b =. Nullspace solutions are multiples of the special solution s = (2,, ), particular solution is (5b 2b 2, b 2 2b, ), so the complete solution when the condition holds is (5b 2b 2, b 2 2b, ) + x (2,, ). 7. The largest possible rank of a 6 by 4 matrix is 4. Then there is a pivot in every column of U and R. The solution to Ax = b is unique. The nullspace of A is zero. An I example is A = (where I is the 4 by 4 identity matrix, and is a 2 by 4 matrix of zeroes). ] 24. Give examples of matrices A for which the number of solutions to Ax = b is (a) or, depending on b (b), regardless of b (c) or, depending on b (d), regardless of b (a) A = ], (b) A = ], (c) A =, (d) A =. Find matrices A and B with the given property or explain why you can t: (a) The only solution of Ax = 2 is x =. ] (b) The only solution of Bx = is x = ] 2. (a) A =, (b) Impossible because B would have to be a 2 by matrix 2 without free variables, i.e., of rank. However, the rank of a matrix can not be greater than the number of rows, in this example it could be at most Suppose you know that the by 4 matrix A has the vector s = (2,,, ) as the only special solution to Ax =. (a) What is the rank of A and the complete solution to Ax =? (b) What is the exact row reduced echelon form R of A? (c) How do you know that Ax = b can be solved for all b? (a) The rank is, and the complete solution to Ax = is x = x s = x (2,,, ).

5 5 (b) R = 2 (c) The matrix has full row rank, so there always is at least one solution (and since there is a free variable, really infinitely many). Section.5. Show that v, v 2, v are independent but v, v 2, v, v 4 are dependent: v = v 2 = v = v 4 = 2. 4 Solve c v + c 2 v 2 + c v + c 4 v 4 = or Ax =. The v s go in the columns of A. Any four vectors in R are dependent (since the dimension of R is ), and the vectors v, v 2, v are independent because they are columns of an invertible by matrix. Solving the system Ax = is finding the nullspace of the matrix A = 2. 4 Special solution here is x 4 =, x = 4, x 2 =, x =, so the nullspace consists of all (c, c 2, c, c 4 ) = x 4 (,, 4, ). 5. Decide the dependence or independence of (a) the vectors (,, 2) and (2,, ) and (, 2, ) (b) the vectors (,, 2) and (2,, ) and (, 2, ). Elimination on the matrices formed from these column vectors gives for (a): So this matrix has rank and the columns are independent. For (b) we get , so this matrix has rank 2 and the columns are dependent.. Find the dimensions of these 4 spaces. Which two of the spaces are the same? (a) column space of A, (b) column space of U, (c) row space of A, (d) row space of U: A = and U = 2. All dimensions are 2, (c) and (d) are the same space. 6. Find a basis for each of these subspaces of R 4 :

6 6 (a) All vectors whose components are equal. (b) All vectors whose components add to zero. (c) All vectors that are perpendicular to (,,, ) and (,,, ). (d) The column space and the nullspace of I (4 by 4) (a) (,,, ); (b) (,,, ), (,,, ), (,,, ); (c) (,,, ), (,,, ); (d) The columns of I for the column space, empty basis for the nullspace. 24. True or false (give a good reason): (a) If the columns of a matrix are dependent, so are the rows. (b) The column space of a 2 by 2 matrix is the same as its row space. (c) The column space of a 2 by 2 matrix has the same dimension as its row space. (d) The columns of a matrix are a basis for the column space. (a) False, e.g., A = ] (b) False, e.g., A =. (c) True, both equal the rank of A. (d) False, the columns might not be linearly independent, e.g., take either example from (a) or (b). Section.6 2. Find bases and dimensions for the four subspaces associated with A and B: A = and B = dim C(A) = dim C(A T ) = dim N(A T ) =, dim N(A) = 2, bases are (, 2) for C(A), (, 2, 4) for C(A T ), ( 2,, ) and ( 4,, ) for N(A), and ( 2, ) for N(A T ). For the matrix B we have dim C(B) = dim C(B T ) = 2, dim N(B) =, dim N(B T ) =, bases are (, 2) and (2, 5) for C(B), (, 2, 4) and (2, 5, 8) for C(B T ), ( 4,, ) for N(B), and nothing for N(B T ).. Find a basis for each of the four subspaces associated with A: A = = (,, ) and (, 4, ) for C(A), (,, 2,, 4) and (,, 2, 4, 6) for C(A T ), (,,,, ), (, 2,,, ) and (, 2,, 2, ) for N(A), and (,, ) for N(A T ). 7. Suppose the by matrix A is invertible. Write down bases for the four subspaces for A, and also for the by 6 matrix B = A A ]. The row and column space of A are both R, so a basis for those is (,, ), (,, ), and (,, ). The nullspace and the left nullspace of A are both zero, so the bases for those are empty. The column space of B is the same as the column space of A, so the same basis works there, the row space has basis (,,,,, ), (,,,,, ), and (,,,,, ). The left

7 nullspace of B is zero, so its basis is empty, and the nullspace of B has basis (,,,,, ), (,,,,, ) and (,,,,, ).. True or false (with a reason or counterexample): (a) If m = n, then the row space of A equals the column space. (b) The matrices A and A share the same four subspaces. (c) If A and B share the same four subspaces, then A is a multiple of B. (a) False, e.g., A =. (b) True. Every column of A is a linear combination of columns of A (in fact, just a multiple of one column), and vice versa, so the column spaces are the same. Every solution to Ax = also solves Ax = and vice versa, so the nullspaces are the same. Since ( A) T = (A T ), the same is true for the column space and nullspace of A T and ( A) T, so the four subspaces are the same for A and A. (c) False, any two n by n invertible matrices ] share the same ] subspaces, and they need not be multiples of each other, e.g., A = and B =. 25. True or false (with a reason or counterexample): (a) A and A T have the same number of pivots. (b) A and A T have the same left nullspace. (c) If the row space equals the column space then A T = A. (d) If A T = A then the row space equals the column space. (a) True, both equal the rank of the matrix. (b) False, any non-square matrix gives a counterexample, and it is not even true for square matrices, e.g., A =. (c) False, any non-symmetric invertible matrix is a counterexample, e.g., A =. (d) True, because C(A T ) = C( A T ) by problem b, and A T C( A T ) = C(A). 7 = A by assumption, so

2.1: MATRIX OPERATIONS

.: MATRIX OPERATIONS What are diagonal entries and the main diagonal of a matrix? What is a diagonal matrix? When are matrices equal? Scalar Multiplication 45 Matrix Addition Theorem (pg 0) Let A, B, and

Solutions 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

MA 242 LINEAR ALGEBRA C1, Solutions to Second Midterm Exam

MA 4 LINEAR ALGEBRA C, Solutions to Second Midterm Exam Prof. Nikola Popovic, November 9, 6, 9:3am - :5am Problem (5 points). Let the matrix A be given by 5 6 5 4 5 (a) Find the inverse A of A, if it exists.

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

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

Math 54. Selected Solutions for Week Is u in the plane in R 3 spanned by the columns

Math 5. Selected Solutions for Week 2 Section. (Page 2). Let u = and A = 5 2 6. Is u in the plane in R spanned by the columns of A? (See the figure omitted].) Why or why not? First of all, the plane in

LINEAR ALGEBRA. September 23, 2010

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

MATH 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

Math Practice Problems for Test 1

Math 290 - Practice Problems for Test 1 UNSUBSTANTIATED ANSWERS MAY NOT RECEIVE CREDIT. 3 4 5 1. Let c 1 and c 2 be the columns of A 5 2 and b 1. Show that b Span{c 1, c 2 } by 6 6 6 writing b as a linear

Solutions to Linear Algebra Practice Problems 1. form (because the leading 1 in the third row is not to the right of the

Solutions to Linear Algebra Practice Problems. Determine which of the following augmented matrices are in row echelon from, row reduced echelon form or neither. Also determine which variables are free

Math 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

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

MAT 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

Linear Dependence Tests

Linear Dependence Tests The book omits a few key tests for checking the linear dependence of vectors. These short notes discuss these tests, as well as the reasoning behind them. Our first test checks

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

Lecture 6. Inverse of Matrix

Lecture 6 Inverse of Matrix Recall that any linear system can be written as a matrix equation In one dimension case, ie, A is 1 1, then can be easily solved as A x b Ax b x b A 1 A b A 1 b provided that

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

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

Linearly Independent Sets and Linearly Dependent Sets

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

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.

2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Theorem 8: Let A be a square matrix. Then the following statements are equivalent. That is, for a given A, the statements are either all true

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

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

Math 240: Linear Systems and Rank of a Matrix

Math 240: Linear Systems and Rank of a Matrix Ryan Blair University of Pennsylvania Thursday January 20, 2011 Ryan Blair (U Penn) Math 240: Linear Systems and Rank of a Matrix Thursday January 20, 2011

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0

Linear Equations in Linear Algebra

1 Linear Equations in Linear Algebra 1.2 Row Reduction and Echelon Forms ECHELON FORM A rectangular matrix is in echelon form (or row echelon form) if it has the following three properties: 1. All nonzero

University of Ottawa

University of Ottawa Department of Mathematics and Statistics MAT 1302A: Mathematical Methods II Instructor: Alistair Savage Final Exam April 2013 Surname First Name Student # Seat # Instructions: (a)

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

Lecture Note on Linear Algebra 15. Dimension and Rank

Lecture Note on Linear Algebra 15. Dimension and Rank Wei-Shi Zheng, wszheng@ieee.org, 211 November 1, 211 1 What Do You Learn from This Note We still observe the unit vectors we have introduced in Chapter

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

4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns

L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows

2.5 Gaussian Elimination

page 150 150 CHAPTER 2 Matrices and Systems of Linear Equations 37 10 the linear algebra package of Maple, the three elementary 20 23 1 row operations are 12 1 swaprow(a,i,j): permute rows i and j 3 3

4.1 VECTOR SPACES AND SUBSPACES

4.1 VECTOR SPACES AND SUBSPACES What is a vector space? (pg 229) A vector space is a nonempty set, V, of vectors together with two operations; addition and scalar multiplication which satisfies the following

Reduced 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

Solution. Area(OABC) = Area(OAB) + Area(OBC) = 1 2 det( [ 5 2 1 2. Question 2. Let A = (a) Calculate the nullspace of the matrix A.

Solutions to Math 30 Take-home prelim Question. Find the area of the quadrilateral OABC on the figure below, coordinates given in brackets. [See pp. 60 63 of the book.] y C(, 4) B(, ) A(5, ) O x Area(OABC)

1 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

(a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.

Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product

Recall 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

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 +

MathQuest: Linear Algebra. 1. Which of the following matrices does not have an inverse?

MathQuest: Linear Algebra Matrix Inverses 1. Which of the following matrices does not have an inverse? 1 2 (a) 3 4 2 2 (b) 4 4 1 (c) 3 4 (d) 2 (e) More than one of the above do not have inverses. (f) All

APPLICATIONS OF MATRICES. Adj A is nothing but the transpose of the co-factor matrix [A ij ] of A.

APPLICATIONS OF MATRICES ADJOINT: Let A = [a ij ] be a square matrix of order n. Let Aij be the co-factor of a ij. Then the n th order matrix [A ij ] T is called the adjoint of A. It is denoted by adj

MATH10212 Linear Algebra B Homework 7

MATH22 Linear Algebra B Homework 7 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra and its Applications Pearson, 26 (or other editions) Normally, homework assignments

Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M 1 such that

0. Inverse Matrix Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M such that M M = I = M M. Inverse of a 2 2 Matrix Let M and N be the matrices: a b d b M =, N = c

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

Methods 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,

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

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

1 Eigenvalues and Eigenvectors

Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x

Sec 4.1 Vector Spaces and Subspaces

Sec 4. Vector Spaces and Subspaces Motivation Let S be the set of all solutions to the differential equation y + y =. Let T be the set of all 2 3 matrices with real entries. These two sets share many common

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.

MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted

Math 308 Midterm Answers July 16, 2012

Math 308 Midterm Answers July 16, 2012 Instructions. You will get 10(?) points for turning up to the exam and filling in your name and student ID correctly and legibly on the scantron and on the blue book,

Vector Spaces 4.4 Spanning and Independence

Vector Spaces 4.4 and Independence October 18 Goals Discuss two important basic concepts: Define linear combination of vectors. Define Span(S) of a set S of vectors. Define linear Independence of a set

1 Orthogonal projections and the approximation

Math 1512 Fall 2010 Notes on least squares approximation Given n data points (x 1, y 1 ),..., (x n, y n ), we would like to find the line L, with an equation of the form y = mx + b, which is the best fit

Inverses and powers: Rules of Matrix Arithmetic

Contents 1 Inverses and powers: Rules of Matrix Arithmetic 1.1 What about division of matrices? 1.2 Properties of the Inverse of a Matrix 1.2.1 Theorem (Uniqueness of Inverse) 1.2.2 Inverse Test 1.2.3

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

[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:

Review Jeopardy. Blue vs. Orange. Review Jeopardy

Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 Jeopardy Round \$200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?

1 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

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

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

Linear Transformations

a Calculus III Summer 2013, Session II Tuesday, July 23, 2013 Agenda a 1. Linear transformations 2. 3. a linear transformation linear transformations a In the m n linear system Ax = 0, Motivation we can

1 Determinants. Definition 1

Determinants The determinant of a square matrix is a value in R assigned to the matrix, it characterizes matrices which are invertible (det 0) and is related to the volume of a parallelpiped described

Eigenvalues and Eigenvectors

Chapter 6 Eigenvalues and Eigenvectors 6. Introduction to Eigenvalues Linear equations Ax D b come from steady state problems. Eigenvalues have their greatest importance in dynamic problems. The solution

CHARACTERISTIC ROOTS AND VECTORS

CHARACTERISTIC ROOTS AND VECTORS 1 DEFINITION OF CHARACTERISTIC ROOTS AND VECTORS 11 Statement of the characteristic root problem Find values of a scalar λ for which there exist vectors x 0 satisfying

Diagonal, Symmetric and Triangular Matrices

Contents 1 Diagonal, Symmetric Triangular Matrices 2 Diagonal Matrices 2.1 Products, Powers Inverses of Diagonal Matrices 2.1.1 Theorem (Powers of Matrices) 2.2 Multiplying Matrices on the Left Right by

1.5 Elementary Matrices and a Method for Finding the Inverse

.5 Elementary Matrices and a Method for Finding the Inverse Definition A n n matrix is called an elementary matrix if it can be obtained from I n by performing a single elementary row operation Reminder:

Topic 1: Matrices and Systems of Linear Equations.

Topic 1: Matrices and Systems of Linear Equations Let us start with a review of some linear algebra concepts we have already learned, such as matrices, determinants, etc Also, we shall review the method

( ) 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

INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL

SOLUTIONS OF THEORETICAL EXERCISES selected from INTRODUCTORY LINEAR ALGEBRA WITH APPLICATIONS B. KOLMAN, D. R. HILL Eighth Edition, Prentice Hall, 2005. Dr. Grigore CĂLUGĂREANU Department of Mathematics

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

T ( a i x i ) = a i T (x i ).

Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)

UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

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

Helpsheet. Giblin Eunson Library MATRIX ALGEBRA. library.unimelb.edu.au/libraries/bee. Use this sheet to help you:

Helpsheet Giblin Eunson Library ATRIX ALGEBRA Use this sheet to help you: Understand the basic concepts and definitions of matrix algebra Express a set of linear equations in matrix notation Evaluate determinants

Orthogonal 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

Linear Equations and Inverse Matrices

Chapter 4 Linear Equations and Inverse Matrices 4. Two Pictures of Linear Equations The central problem of linear algebra is to solve a system of equations. Those equations are linear, which means that

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

Solving Systems of Linear Equations; Row Reduction

Harvey Mudd College Math Tutorial: Solving Systems of Linear Equations; Row Reduction Systems of linear equations arise in all sorts of applications in many different fields of study The method reviewed

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

160 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

Images and Kernels in Linear Algebra By Kristi Hoshibata Mathematics 232

Images and Kernels in Linear Algebra By Kristi Hoshibata Mathematics 232 In mathematics, there are many different fields of study, including calculus, geometry, algebra and others. Mathematics has been

MATH 2030: SYSTEMS OF LINEAR EQUATIONS. ax + by + cz = d. )z = e. while these equations are not linear: xy z = 2, x x = 0,

MATH 23: SYSTEMS OF LINEAR EQUATIONS Systems of Linear Equations In the plane R 2 the general form of the equation of a line is ax + by = c and that the general equation of a plane in R 3 will be we call

MATH 240 Fall, Chapter 1: Linear Equations and Matrices

MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS

Math 215 HW #6 Solutions

Math 5 HW #6 Solutions Problem 34 Show that x y is orthogonal to x + y if and only if x = y Proof First, suppose x y is orthogonal to x + y Then since x, y = y, x In other words, = x y, x + y = (x y) T

NON SINGULAR MATRICES. DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that

NON SINGULAR MATRICES DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that AB = I n = BA. Any matrix B with the above property is called

Section 2.1. Section 2.2. Exercise 6: We have to compute the product AB in two ways, where , B =. 2 1 3 5 A =

Section 2.1 Exercise 6: We have to compute the product AB in two ways, where 4 2 A = 3 0 1 3, B =. 2 1 3 5 Solution 1. Let b 1 = (1, 2) and b 2 = (3, 1) be the columns of B. Then Ab 1 = (0, 3, 13) and

4.3 Least Squares Approximations

18 Chapter. Orthogonality.3 Least Squares Approximations It often happens that Ax D b has no solution. The usual reason is: too many equations. The matrix has more rows than columns. There are more equations

Orthogonal Diagonalization of Symmetric Matrices

MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding

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........................

NOTES on LINEAR ALGEBRA 1

School of Economics, Management and Statistics University of Bologna Academic Year 205/6 NOTES on LINEAR ALGEBRA for the students of Stats and Maths This is a modified version of the notes by Prof Laura

Matrix 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

4.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

Practice Math 110 Final. Instructions: Work all of problems 1 through 5, and work any 5 of problems 10 through 16.

Practice Math 110 Final Instructions: Work all of problems 1 through 5, and work any 5 of problems 10 through 16. 1. Let A = 3 1 1 3 3 2. 6 6 5 a. Use Gauss elimination to reduce A to an upper triangular

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

Row and column operations

Row and column operations It is often very useful to apply row and column operations to a matrix. Let us list what operations we re going to be using. 3 We ll illustrate these using the example matrix

Matrix Inverse and Determinants

DM554 Linear and Integer Programming Lecture 5 and Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1 2 3 4 and Cramer s rule 2 Outline 1 2 3 4 and

Using determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible:

Cramer s Rule and the Adjugate Using determinants, it is possible to express the solution to a system of equations whose coefficient matrix is invertible: Theorem [Cramer s Rule] If A is an invertible

3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

4 Solving Systems of Equations by Reducing Matrices

Math 15 Sec S0601/S060 4 Solving Systems of Equations by Reducing Matrices 4.1 Introduction One of the main applications of matrix methods is the solution of systems of linear equations. Consider for example