# Math 312 Homework 1 Solutions

Size: px
Start display at page:

Transcription

1 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 staple your pages before you turn in your homework and make sure the problems are labeled clearly and are, preferably, in sequential order Solutions are in blue 1 Consider the following general system of two equations in the two variables x, y: ax + cy = e bx + dy = f Find a condition on a, b, c, d so that the system above has a solution for all possible e, f Solution: First assume that both a = 0 and b = 0 In this case, we see that the two equations become cy = e and dy = f If c = 0 or d = 0 then this system contains the equation 0 = e or 0 = f, but we can choose e, f arbitrarily so this would be an inconsistent system On the other hand, if c, d 0, then the system becomes y = e/c = f/d but, again, we can vary e, f so that e/c f/d and we obtain an inconsistent system Thus, at least one of a or b is non-zero, and, by symmetry, we can assume without loss of generality that a 0 Now we look at the augmented matrix obtained from the system: ( ) a c e b d f which row reduces to: ( 1 c/a e/a 0 d bc/a f be/a We can choose f so that f be/a 0 so that this system is consistent if and only if d bc/a 0 or equivalently ad bc 0 When this is the case, we see that x = (de cf)/(ad cb) and y = (af be)/(ad cb) is a solution for an arbitrary e, f Let v 1,, v m F n be given and consider F n as a vector space over F Denote by v i = (a 1i,, a ni ), a ij F, and consider the matrix A M n m (F) defined by A ij = a ij Show that 1 )

2 (a) If Span(v 1,, v m ) = F n then the row reduced echelon form of A has n pivots (b) If the row reduced echelon form of A has n pivots then Span(v 1,, v m ) = F n (c) Deduce: if Span(v 1,, v m ) = F n then m n Solution: Say v = (b 1,, b n ) F n is given Observe that v Span(v 1,, v m ) if and only if the system of linear equations Ax = (b 1,, b n ) t =: b has a solution (a) Suppose that the RREF form of A has less than n pivots (note that there can be at most n) Then the RREF form of A must have a row of zeros Denote by B the RREF form of A, which is obtained from A by applying the elementary row operations R 1,, R s Denote by R i the row operations which reverses R i ie R i is the row operation which is the inverse to R i In particular, we can obtain A back from B by applying R s,, R 1 in that order By our assumption, B contains a row of zeros and thus the augmented matrix: C := B corresponds to an inconsistent system Applying the row operations R s,, R 1 to C, we obtain the matrix: D := A which is also inconsistent since it is obtained by elementary row operations from an inconsistent system In particular, (b 1,, b n ) / Span(v 1,, v m ) (b) Conversely, if B has n pivots, then it has a pivot in every row Thus, the row reduction of is precisely D := C := A B and, since B has a pivot in every row, both systems of linear equations are consistent b 1 b n b 1 b n c 1 c n

3 (c) If Span(v 1,, v m ) = F n then B has a pivot in every row However, B is a matrix of size n m By the definition of pivot we see that there are precisely n pivot columns Since B has m columns, we deduce that n m 3 Let F be a field (ie F = Q, R or C) Let A M m n (F) be given Prove that the following sets are subspaces in the corresponding vector space: (a) The set {A B : B M n k (F)}, as a subset of M m k (F) (b) The set {B A : B M k m (F)}, as a subset of M k n (F) (c) The set {B M n k (F) : A B = 0}, as a subset of M n k (F) (d) The set {B M k m (F) : B A = 0}, as a subset of M k m (F) Solution: Recall that a set S V is a subspace if the following two conditions hold: S and For all v, v S and a, a F one has av + a v S To show that the sets above are subspaces, we check these two conditions (a) An arbitrary element in this set is of the form A B for some B As 0 = A 0 is contained in the set, it is non-empty Let A B and A B be two arbitrary elements of the set and a, a be two arbitrary scalars Then a(a B) + a (A B ) = A (ab + a B ) is contained in the set Thus, this set is closed under matrix addition and scalar multiplication, as required (b) An arbitrary element in this set is of the form B A for some B As 0 = 0 A is contained in the set, it is non-empty Let B A and B A be two arbitrary elements of the set and a, a be two arbitrary scalars Then a(b A) + a (B A) = (ab + a B ) A is contained in the set Thus, this set is closed under matrix addition and scalar multiplication, as required (c) Observe that A 0 = 0 so that 0 is an element of this set Suppose B, B are contained in the set equivalently, AB = AB = 0 and let a, a be two arbitrary scalars Then A (ab + a B ) = aab + a AB = a0 + a 0 = 0 so that ab + a B is contained in the set as well (d) Observe that 0 A = 0 so that 0 is an element of this set Suppose B, B are contained in the set equivalently, BA = B A = 0 and let a, a be two arbitrary scalars Then (ab + a B ) A = aba + a B A = a0 + a 0 = 0 so that ab + a B is contained in the set as well 4 Exercise 138 from the text, reproduced here for your convenience: Are the following sets subspaces of R 3 under the usual vector addition and scalar multiplication? Explain (a) W 1 = {(a 1, a, a 3 ) : a 1 = 3a, and a 3 = a } 3

4 (b) W = {(a 1, a, a 3 ) : a 1 = a 3 + } (c) W 3 = {(a 1, a, a 3 ) : a 1 7a + a 3 = 0} (d) W 4 = {(a 1, a, a 3 ) : a 1 4a a 3 = 0} (e) W 5 = {(a 1, a, a 3 ) : a 1 + a 3a 3 = 1} (f) W 6 = {(a 1, a, a 3 ) : 5a 1 3a + 6a 3 = 0} Solution: (a) Observe that (0, 0, 0) W 1 so that W 1 is non-empty Suppose (a 1, a, a 3 ), (b 1, b, b 3 ) W 1 are arbitrary Let a, b F be scalars and consider the linear combination: a(a 1, a, a 3 ) + b(b 1, b, b 3 ) = (aa 1 + bb 1, aa + bb, aa 3 + bb 3 ) =: w Observe that aa 1 + bb 1 = a3a + b3b = 3(aa + bb ) and aa 3 + bb 3 = a( a ) + b( b 3 ) = (aa +bb 3 ) so that w W 1 Thus, we see that W 1 is indeed a subspace (b) This is not a subspace as (0, 0, 0) / W (c) This is a subspace, as follows First, we observe that (0, 0, 0) W 3 Suppose v = (a 1, a, a 3 ) and v = (b 1, b, b 3 ) are elements of W 3 and take an arbitrary linear combination av + bv = (aa 1 + bb 1, aa + bb, aa 3 + bb 3 ) We have: (aa 1 + bb 1 ) 7(aa + bb ) + (aa 3 + bb 3 ) = a(a 1 7a + a 3 ) + b(b 1 7b + b 3 ) = 0 Thus, we see that av + bv W 3 as well, proving that W 3 is indeed a subspace (d) In a similar way to part (3), we see that W 4 is a subspace (e) The vector (0, 0, 0) / W 5 so that W 5 is not a subspace (f) This is not a subspace as it is not closed under vector addition For example, v = (0,, 1) W 6 and v = (1, 0, 5/6) W 6 However, v + v = (1,, 1 + 5/6) / W6 since (check this!): 5 (1) 3 ( ) + 6 (1 + 5/6) 0 5 Find examples of the following finite sets of vectors in the corresponding vector space: (a) A collection of mn matrices of dimension m n which span M m n (F) (b) A collection of n (n+1) symmetric n n square matrices which span the subspace Sym n := {A M n n (F) : A t = A} of symmetric matrices (c) A collection of n (n 1) skew-symmetric n n square matrices which span the subspace Skew n := {A M n n (F) : A t = A} of skew-symmetric matrices Solution: 4

5 (a) Consider the set G = {E ij : 1 i m, 1 j n} Observe that: A = i,j A ij E ij for an arbitrary m n matrix A, where A ij denotes the i, j component of A Thus, indeed, Span G = M m n, as required Moreover, we see immediately that #G = m n (b) Consider the set G = {E ij + E ji : 1 i j n} Observe that (E ij ) t = E ji so that (E ij + E ji ) t = E ij + E ji and so G indeed contains symmetric matrices Moreover, we observe that, for an arbitrary symmetric matrix A, one has: A = i A ii (E ii + E ii ) + A ij (E ij + E ji ) i<j Thus, Span G = Sym n, as required Moreover, we see that: #G = n = n(n + 1) (c) Consider the set G = {E ij E ji : 1 i < j n} Observe that (E ij E ji ) t = E ji E ij = (E ij E ji ) so that, indeed, G contains skew-symmetric matrices For any skew symmetric matrix A, one has: A = i<j A ij (E ij E ji ) so that Span G = Skew n Moreover, #G = (n 1) = n(n 1) 6 Let V be a vector space over F and let W 1, W be two subspaces of V Prove or disprove the following statements: (a) The set W 1 W = {w V : w W 1 and w W } is a subspace of V (b) The set W 1 W = {w V : w W 1 or w W } is a subspace of V (c) The set W 1 + W = {w 1 + w : w i W i } is a subspace of V Solution: (a) This is a subspace First note that 0 W 1 W as 0 W 1 and 0 W Suppose w, w W 1 W and a, a are scalars Consider aw + a w Since w, w W 1 and W 1 is a subspace, we see that aw + a w W 1 and, since w, w W with W a subspace we see that aw + a w W as well Thus aw + a w W 1 W 5

6 (b) This is not a subspace Consider, eg, V = R, let W 1 denote the x-axis and W denote the y-axis Then W 1 W is the union of the two coordinate axes, in particular: W 1 W = {(x, y) : x = 0 or y = 0} but then (1, 0) W 1 W, (0, 1) W 1 W while (1, 0)+(0, 1) = (1, 1) / W 1 W (c) This is a subspace First note that 0 = W 1 + W as 0 W 1 W Now suppose w, w W 1 + W are arbitrary Then w = w 1 + w and w = w 1 + w for some w i, w i W i, i = 1, Let a, a be arbitrary scalars Then aw + a w = (aw 1 +a w 1)+(aw +a w ) W 1 +W since aw 1 +a w 1 W 1 and aw +a w W 7 Let V be a vector space over F and let W 1, W be two subspaces of V We say that V is the direct sum of W 1 and W, and write V = W 1 W provided that: W 1 W = {0} is the zero subspace V = W 1 + W ; ie any element of V can be written as a sum w 1 + w where w i W i Prove the following: (a) M n n (R) = Sym n Skew n ; here Sym n denotes the subspace of symmetric matrices and Skew n denotes the subspace of anti-symmetric matrices (b) C 0 (R, R) = O E; here C 0 (R, R) denotes the vector space of continuous functions f : R R, O denotes the subspace of odd functions (f such that f( x) = f(x)) and E denotes the subspace of even functions (f such that f( x) = f(x)) Hint: If A M n n (F), consider A + A t and A A t Solution: In both situations, we need to show that an arbitrary vector v V can be written as a sum w 1 + w where w i W i, then show that W 1 W = {0} 1 Let A be an n n matrix Observe that: ( ) t 1 (A + At ) = 1 (A + At ), and ( ) t 1 (A At ) = 1 (A At ) Thus, 1 (A + At ) is symmetric while 1 (A At ) is skew-symmetric Moreover, A = 1 (A + At ) + 1 (A At ) Sym n + Skew n Lastly, we must show that Sym n Skew n = {0} For this, suppose that A is both symmetric and skew-symmetric Namely, A t = A = A so that A = 0 but then A = 0 Thus, we deduce that M n n = Sym n Skew n, by the definition of 6

7 This is similar to the proof above as follows Let f be a continuous function and observe that the function f e (x) = 1 (f(x) + f( x)) is even while f o(x) = 1 (f(x) f( x)) is odd; moreover, f = f e + f o so that, indeed, C 0 (R, R) = O + E On the other hand, if a function f O E, we see that f( x) = f(x) = f(x) so that f(x) = 0 which implies that f(x) = 0 for all xl thus O E = {0} From this we deduce that C 0 (R, R) = O E as required 7

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

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

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

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

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

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

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

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

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

### 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 +

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

### 1 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

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

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

### Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

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

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

### These 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

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

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

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

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

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

### LINEAR 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,

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

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

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

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

### is in plane V. However, it may be more convenient to introduce a plane coordinate system in V.

.4 COORDINATES EXAMPLE Let V be the plane in R with equation x +2x 2 +x 0, a two-dimensional subspace of R. We can describe a vector in this plane by its spatial (D)coordinates; for example, vector x 5

### Section 5.3. Section 5.3. u m ] l jj. = l jj u j + + l mj u m. v j = [ u 1 u j. l mj

Section 5. l j v j = [ u u j u m ] l jj = l jj u j + + l mj u m. l mj Section 5. 5.. Not orthogonal, the column vectors fail to be perpendicular to each other. 5..2 his matrix is orthogonal. Check that

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

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

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

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

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

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

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

### LINEAR ALGEBRA. September 23, 2010

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

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

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

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

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

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

### Vector Spaces. Chapter 2. 2.1 R 2 through R n

Chapter 2 Vector Spaces One of my favorite dictionaries (the one from Oxford) defines a vector as A quantity having direction as well as magnitude, denoted by a line drawn from its original to its final

### Inner products on R n, and more

Inner products on R n, and more Peyam Ryan Tabrizian Friday, April 12th, 2013 1 Introduction You might be wondering: Are there inner products on R n that are not the usual dot product x y = x 1 y 1 + +

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

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

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

### Vector and Matrix Norms

Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

### α = 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

### Linear 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

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

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

### x + y + z = 1 2x + 3y + 4z = 0 5x + 6y + 7z = 3

Math 24 FINAL EXAM (2/9/9 - SOLUTIONS ( Find the general solution to the system of equations 2 4 5 6 7 ( r 2 2r r 2 r 5r r x + y + z 2x + y + 4z 5x + 6y + 7z 2 2 2 2 So x z + y 2z 2 and z is free. ( r

### x1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.

Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability

### THE 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

### Lectures 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

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

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

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

### ISOMETRIES 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

### Problem Set 5 Due: In class Thursday, Oct. 18 Late papers will be accepted until 1:00 PM Friday.

Math 312, Fall 2012 Jerry L. Kazdan Problem Set 5 Due: In class Thursday, Oct. 18 Late papers will be accepted until 1:00 PM Friday. In addition to the problems below, you should also know how to solve

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

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

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

### GROUP ALGEBRAS. ANDREI YAFAEV

GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite

### MATH1231 Algebra, 2015 Chapter 7: Linear maps

MATH1231 Algebra, 2015 Chapter 7: Linear maps A/Prof. Daniel Chan School of Mathematics and Statistics University of New South Wales danielc@unsw.edu.au Daniel Chan (UNSW) MATH1231 Algebra 1 / 43 Chapter

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

### Brief Introduction to Vectors and Matrices

CHAPTER 1 Brief Introduction to Vectors and Matrices In this chapter, we will discuss some needed concepts found in introductory course in linear algebra. We will introduce matrix, vector, vector-valued

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

### MATH 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

### Polynomial Invariants

Polynomial Invariants Dylan Wilson October 9, 2014 (1) Today we will be interested in the following Question 1.1. What are all the possible polynomials in two variables f(x, y) such that f(x, y) = f(y,

### Lecture notes on linear algebra

Lecture notes on linear algebra David Lerner Department of Mathematics University of Kansas These are notes of a course given in Fall, 2007 and 2008 to the Honors sections of our elementary linear algebra

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

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

### Inner Product Spaces

Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

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

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

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

### CITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION

No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

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

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

### 5. Orthogonal matrices

L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 5-1 Orthonormal

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### Chapter 6. Linear Transformation. 6.1 Intro. to Linear Transformation

Chapter 6 Linear Transformation 6 Intro to Linear Transformation Homework: Textbook, 6 Ex, 5, 9,, 5,, 7, 9,5, 55, 57, 6(a,b), 6; page 7- In this section, we discuss linear transformations 89 9 CHAPTER

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

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

### Solutions to Homework Section 3.7 February 18th, 2005

Math 54W Spring 5 Solutions to Homeork Section 37 Februar 8th, 5 List the ro vectors and the column vectors of the matrix The ro vectors are The column vectors are ( 5 5 The matrix ( (,,,, 4, (5,,,, (

### The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression

The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression The SVD is the most generally applicable of the orthogonal-diagonal-orthogonal type matrix decompositions Every

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

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

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

### 3. Let A and B be two n n orthogonal matrices. Then prove that AB and BA are both orthogonal matrices. Prove a similar result for unitary matrices.

Exercise 1 1. Let A be an n n orthogonal matrix. Then prove that (a) the rows of A form an orthonormal basis of R n. (b) the columns of A form an orthonormal basis of R n. (c) for any two vectors x,y R

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

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

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

### LEARNING OBJECTIVES FOR THIS CHAPTER

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional