Outline. Points in space

Size: px
Start display at page:

Download "Outline. Points in space"

Transcription

1 Outline Matrix Calculations: Vector Spaces and Linear Maps B Jacobs Institute for Computing and Information Sciences Digital Security Version: spring 03 B Jacobs Version: spring 03 Matrix Calculations / 55 Points in plane B Jacobs Version: spring 03 Matrix Calculations / 55 Points in space The set of points in a plane is usually written as R {x, y x, y R} or as R { x y x, y R} Two points can be added, as in: x, y + x, y x + x, y + y What is this geometrically? Also, points can be multiplied by a number scalar : a x, y a x, a y Several nice properties hold, like: a x, y + x, y a x, y + a x, y Points in 3-dimensional are described as: R 3 {x, y, z x, y, z R} or as R 3 xy { x, y, z R} Again such 3-dimensional points can be added and multiplied: x, y, z + x, y, z x + x, y + y, z + z a x, y, z a x, a y, a z And similar nice properties hold Mathematicians like to capture such similarities in an abstract definition sometimes the definition is so abstract one gets lost but then it is good to keep the main examples in mind z B Jacobs Version: spring 03 Matrix Calculations 4 / 55 Vector space A vector space consists of a set V, whose elements are called vectors can be added can be multiplied with a real number The precise requirements are in the next two slides For each n N, n-dimensional space R n is a vector space, where R n {x, x,, x n x,, x n R} This includes points in a plane n and points in space n 3 B Jacobs Version: spring 03 Matrix Calculations 6 / 55 B Jacobs Version: spring 03 Matrix Calculations 5 / 55 Addition for vectors: precise requirements Vector addition is commutative: summands can be swapped: v + w w + v addition is associative: grouping of summands is irrelevant: u + v + w u + v + w 3 there is a zero vector 0 such that: v + 0 v, and hence by also: 0 + v v 4 each vector v has an additive inverse minus v such that: v + v 0 B Jacobs Version: spring 03 Matrix Calculations 7 / 55

2 Scalar multiplication for vectors: precise requirements Base in space R is unit for scalar multiplication: v v two scalar multiplications can be done as one: 3 distributivity a b v ab v }{{}}{{} twice scalar mult mult in R a v + w a v + a w a + b v a v + b v Exercise Check for yourself that all these properties hold for R n B Jacobs Version: spring 03 Matrix Calculations 8 / 55 Independence Vectors v,, v n in a vector space V are called independent if for all scalars a,, a n R one has: a v + + a n v n 0 in V implies a a a n 0 The 3 vectors, 0, 0, 0,, 0, 0, 0, R 3 are independent, since if a, 0, 0 + a 0,, 0 + a 3 0, 0, 0, 0, 0 then, using the computation from the previous slide, a, a, a 3 0, 0, 0, so that a a a 3 0 B Jacobs Version: spring 03 Matrix Calculations / 55 Proving independence via equation solving II In R 3 we can distinguish three special vectors:, 0, 0 R 3 0,, 0 R 3 0, 0, R 3 These vectors form a basis: each vector x, y, z can be expressed in terms of these three special vectors: x, 0, 0 + y 0,, 0 + z 0, 0, x, 0, 0 + 0, y, 0 + 0, 0, z x, y, z Moreover, these three special vectors are independent It is a challenge to capture this intuitive notion of basis abstractly in terms of the notion of vector space it can then be used for all examples of vector spaces B Jacobs Version: spring 03 Matrix Calculations 0 / 55 Proving independence via equation solving I 0 Investigate independence of,, and Thus we ask: are there any non-zero a, a, a 3 R with: 0 0 a + a + a If there is a non-zero solution, the vectors are dependent, and if a a a 3 0 is the only solution, they are independent B Jacobs Version: spring 03 Matrix Calculations / 55 Proving independence via equation solving III Our question involves the systems of equations / matrix: a + a 0 0 a a + 5a 3 0 corresponding to 5 3a + 4a + a This one has non-zero solutions a, a, a 3 compute and check for yourself! Thus the original vectors are dependent Explicitly: Same independence question for:,, 3 With corresponding matrix: 5 0 reducing to Thus the only solution is a a a 3 0 The vectors are independent! B Jacobs Version: spring 03 Matrix Calculations 3 / 55 B Jacobs Version: spring 03 Matrix Calculations 4 / 55

3 Non-independence / dependence Basis In the plane two vectors v, w R are dependent if and only if: they are on the same line ie v a w, for some scalar a : for v, and w, 4 we have: v w, so they are on the same line a v + a w 0, eg for a 0 and a 0 In space, three vectors u, v, w R 3 are dependent if they are in the same plane or even line In general, if v,, v n V are dependent, if and only if each v i can be expressed as linear combination of the others the v j with j i B Jacobs Version: spring 03 Matrix Calculations 5 / 55 The standard basis for R n Vectors v,, v n V form a basis for a vector space V if these v,, v n are independent, and span V in the sense that each w V can be written as linear combination of these v,, v n, namely as: w a v + + a n v n for certain a,, a n R These scalars a i are uniquely determined by w V see below a space V may have several bases, but the number of elements of such a basis for V is always the same; it is called the dimension of V, sometimes written as dimv N B Jacobs Version: spring 03 Matrix Calculations 6 / 55 An alternative basis for R For the space R n {x,, x n x i R} there is a standard choice of base vectors:, 0, 0, 0, 0,, 0,, 0, 0,, 0, We have already seen that they are independent; it is easy to see that they span R n This enables us to state precisely that R n has n dimensions The standard basis for R is, 0, 0, But many other choices are possible, eg,,, independence: if a, + b, 0, 0, then: { { a + b 0 a 0 and thus a b 0 b 0 spanning: each point x, y can written in terms of,,,, namely: x, y x+y x y, +, B Jacobs Version: spring 03 Matrix Calculations 7 / 55 Uniqueness of representations Lemma Suppose V is a vector space, with basis v,, v n assume x V can be represented in two ways: x a v + + a n v n and also x b v + + b n v n Then: a b and and a n b n Proof: This follows from independence of v,, v n since: 0 x x a v + + a n v n b v + + b n v n a b v + + a n b n v n Hence a i b i 0, by independence, and thus a i b i B Jacobs Version: spring 03 Matrix Calculations 8 / 55 Functions A function f is an operation that sends elements of one set X to another set Y in that case we write f : X Y or sometimes X f Y this f sends x X to f x Y X is called the domain and Y the codomain of the function f f n n can be seen as function N Q, that is from the natural numbers N to the rational numbers Q A function is sometimes also called a map or a mapping On each set X there is the identity function id : X X that does nothing: idx x Also one can compose functions X f Y g Z to a function: g f : X Z given by g f x gf x B Jacobs Version: spring 03 Matrix Calculations 9 / 55 B Jacobs Version: spring 03 Matrix Calculations / 55

4 Linear functions We have seen that the two relevant operations of a vector space are addition and scalar multiplication A linear function is required to preserve these two Let V, W be two vector spaces, and f : V W a function between them; f is called linear if it preserves both: addition: for all v, v V, f v } + {{ v } f v + f v }{{} in V in W scalar multiplication: for each v V and a R, f a }{{} v a f v }{{} in V in W B Jacobs Version: spring 03 Matrix Calculations / 55 Linear map examples I First we consider functions f : R R Most of them are not linear, like, for instance: f x + x, since f 0 0 f x x, since f f f These linear maps R R can only be very simple Lemma Each linear map f : R R is of the form f x c x, for some c R this constant c depends on f Proof: Scalar multiplication on R is ordinary multiplication Hence: f x f x x f f x c x, for c f preserve zero Lemma Each linear map f : V W preserves: zero: f 0 0 minus: f v f v Proof: Nice illustration of axiomatic reasoning: 0 f 0 f 0 f v f v + 0 f f 0 f v + f v f v f 0 + f 0 f 0 f v + f v f v f 0 + f 0 f 0 f v + v f v f f 0 f v f 0 0 f v f v B Jacobs Version: spring 03 Matrix Calculations 3 / 55 Linear map examples II Consider the map f : R 3 R given by f x, x, x 3 x x, x + x 3 We show in detail that this f is linear, following the definition Preservation of scalar multiplication from R 3 to R : f a x, x, x 3 f a x, a x, a x 3 a x a x, a x + a x 3 a x x, a x + x 3 a x x, x + x 3 a f x, x, x 3 B Jacobs Version: spring 03 Matrix Calculations 4 / 55 Linear map examples II cntd Preservation of addition from R 3 to R : f x, x, x 3 + y, y, y 3 f x + y, x + y, x 3 + y 3 x + y x + y, x + y + x 3 + y 3 x x + y y, x + x 3 + y + y 3 x x, x + x 3 + y y, y + y 3 f x, x, x 3 + f y, y, y 3 B Jacobs Version: spring 03 Matrix Calculations 5 / 55 Linear map examples III Consider the map f : R R given by f x, y x cosϕ y sinϕ, x sinϕ + y cosϕ In the same way one can show that f is linear [Do it yourself!] This map described rotation in the plane, with angle ϕ: B Jacobs Version: spring 03 Matrix Calculations 6 / 55 B Jacobs Version: spring 03 Matrix Calculations 7 / 55

5 and bases, example I Recall the linear map f x, x, x 3 x x, x + x 3 Claim: this map is entirely determined by what it does on the base vectors, 0, 0, 0,, 0, 0, 0, R 3, namely: f, 0, 0, 0 f 0,, 0, f 0, 0, 0, Indeed, by linearity: f x, x, x 3 f x, 0, 0 + 0, x, 0 + 0, 0, x 3 f x, 0, 0 + x 0,, 0 + x 3 0, 0, f x, 0, 0 + f x 0,, 0 + f x f, 0, 0 + x f 0,, 0 + x 3 f 0, 0, x, 0 + x, + x 3 0, x x, x + x 3 x 3 0, 0, B Jacobs Version: spring 03 Matrix Calculations 9 / 55 The general case The aim is to obtain a matrix for an arbitrary linear map Assume a linear map f : V W, where: the vector space V has basis {v,, v n } V ; W has basis {w,, w m } Each x V can be written as x a v + + a n v n Hence: f x f a v + + a n v n a f v + + a n f v n by linearity of f Thus, f is determined by its values f v,, f v n on base vectors v j V By writing f v j b j w + + b mj w m we obtain an m n matrix with entries b ij i m,j n and bases, example I cntd Our f x, x, x 3 x x, x + x 3 is thus determined by: f, 0, 0, 0 f 0,, 0, f 0, 0, 0, We can organise these data in a 3 matrix: 0 0 The f v i, for base vector v i, appears as the i-the column Applying f can be done by a new kind of multiplication: x 0 x 0 def x + x + 0 x 3 x x 0 x x + x + x 3 x + x 3 3 B Jacobs Version: spring 03 Matrix Calculations 30 / 55 Towards matrix-vector multiplication In this setting, we have: f x f a v + + a n v n a f v + + a n f v n a b w + + b m w m + + an bn w + + b mn w m a b + + a n b n w + + a b m + + a n b mn wm b a + + b n a n w + + b m a + + b mn a n wm This motivates the definition of matrix-vector multiplication: b b n a b a + + b n a n b m b mn a n b m a + + b mn a n B Jacobs Version: spring 03 Matrix Calculations 3 / 55 Matrix-vector multiplication, concretely Recall f x, x, x 3 x x, x + x 3 with matrix: 0 0 We can directly calculate f,,,, We can also get the same result by matrix-vector multiplication: This multiplication can be understood as: putting the argument values x, x, x 3 in variables of the underlying equations, and computing the outcome B Jacobs Version: spring 03 Matrix Calculations 33 / 55 B Jacobs Version: spring 03 Matrix Calculations 3 / 55 Another example, to learn the mechanics B Jacobs Version: spring 03 Matrix Calculations 34 / 55

6 Linear function from matrix Matrix summary We have seen how a linear function can be described via a matrix One can also read each matrix as a linear function Consider the matrix It has 3 columns/inputs and two rows/outputs Hence it describes a function f : R 3 R Namely: f x, x, x 3 x x 3, 5x + x 3x 3 Assume bases {v,, v n } V and {w,, w m } W Each linear map f : V W corresponds to an m n matrix, and vice-versa We often write the matrix of f as M f The i-th column in this matrix M f is given by the coefficients of f v i, wrt the basis w,, w m of W Matrix-vector multiplication corresponds to function application: f v is the same as M f v This matrix M f of f depends on the choice of basis: for different bases of V and W a different matrix is obtained Matrix-vector multiplication forms itself a linear function B Jacobs Version: spring 03 Matrix Calculations 35 / 55 The identity matrix Consider the following n n identity matrix with diagonal of s: 0 0 I n To which function does I n correspond? The identity function R n R n To which system of equations does I n correspond? x 0 x n 0 B Jacobs Version: spring 03 Matrix Calculations 37 / 55 Matrices as vectors II: example B Jacobs Version: spring 03 Matrix Calculations 36 / 55 Matrices as vectors I Write Mat m,n {M M is an m n matrix} Thus each M Mat m,n can be written as M a ij, for i m and j n We can add two such matrices M, N Mat m,n, giving M + N Mat m,n the matrices are added entry-wise, that is: if M a ij, N b ij, M + N c ij, then c ij a ij + b ij Similarly, matrices can be multiplied by a scalar s R s M Mat m,n has entries s a ij Finally, there is a zero matrix 0 m,n Mat m,n, with only zeros as entries Mat m,n is a vector space B Jacobs Version: spring 03 Matrix Calculations 38 / 55 Matrices as vectors III: transpose Addition: Scalar multiplication: For a matrix M Mat m,n write M T Mat n,m for the transpose of M It is obtained by mirroring: if M a ij then M T has entries a ji Transposition is a linear map T : Mat m,n Mat n,m That is: M + N T M T + N T a M T a M T B Jacobs Version: spring 03 Matrix Calculations 39 / 55 B Jacobs Version: spring 03 Matrix Calculations 40 / 55

7 definitions Subspace definition Let f : V W be a linear map the kernel of f is the subset of V given by: kerf {x V f x 0} the image of f is the subset of W given by: imf {f x x V } Consider the function f : R R given by f x 0, x the kernel is {x R 0, x 0, 0} {0} the image is the y-axis {0, x x R} B Jacobs Version: spring 03 Matrix Calculations 4 / 55 Subspace examples A subset S V of a vector space V is called a linear subspace if S is closed under addition and scalar multiplication: 0 S v, v S implies v + v S v S and a R implies a v S Note A subspace S V is a vector space itself, and can thus also have a basis Also S can have its own dimension, where dims dimv B Jacobs Version: spring 03 Matrix Calculations 43 / 55 Basis for subspaces Earlier we saw that the subset of solutions of a system of equations is closed under addition and scalar multiplication, and thus is a linear subspace The diagonal D {x, x x R} R is a linear subspace: if x, x, x, x D, then also x, x + x, x x + x, x + x D if x, x D and a R, also a x, x a x, a x D Also: D has a single vector as basis, for example, thus, D has dimension Let the space V have dimension n, and a subspace S V dimension p, where p n Then: any set of > p vectors in S is linearly dependent any set of < p vectors in S does not span S any set of p independent vectors in S is a basis for S any set of p vectors that spans S is a basis for S B Jacobs Version: spring 03 Matrix Calculations 44 / 55 Kernels and images are subspaces For a linear map f : V W, kerf {x f x 0} V is a linear subspace imf {f x x V } W is a linear subspace As subspaces kerf and imf also have dimensions see later Proof: We check two cases do the others yourself! Closure of kerf under addition: if x, x kerf, then f x 0 and f x 0 By linearity of f, f x + x f x + f x , so x + x kerf Closure of imf under scalar multiplication: Assume y imf, say y f x, and a R Again by linearity: a y a f x f a x, so a y imf B Jacobs Version: spring 03 Matrix Calculations 46 / 55 B Jacobs Version: spring 03 Matrix Calculations 45 / 55 The kernel as solution space With this kernel and image terminology we can connect some previous notions Suppose a linear map f : V W has matrix M f Then: v kerf f v 0 M f v 0 v is solution of the equations given by M f Moreover, the dimension of the kernel dimkerf is the same as the number of basic solutions of M f, that is the number of columns without pivots in the echelon form of M f B Jacobs Version: spring 03 Matrix Calculations 47 / 55

8 Independence and kernels More concretely Assume a vector space V with vectors v,, v n V We define a function f : R n V by Then: f a,, a n a v + + a n v n You can check for yourself that f is linear the vectors v,, v n are independent a v + + a n v n 0 implies a a n 0 f a,, a n 0 implies a a n 0 kerf {0,, 0} the matrix M f of f has only 0,, 0 as solution the echelon form of M f has n pivots B Jacobs Version: spring 03 Matrix Calculations 48 / 55 Kernel-image-dimension theorem aka rank-nullity For a linear map f : V W one has: dimkerf + dimimf dimv Pictorial proof: Consider echelon forms of the matrix M f of f : }{{}}{{}}{{} dimimf dimkerf dimimf, where dimkerf 0 B Jacobs Version: spring 03 Matrix Calculations 50 / 55 ctd We now know: dimimf 3 dimkerf 3 Thus the image of f : R 3 R is the whole codomain R Hence f is surjective 0 In the echelon form 0 we can see the basis of imf, namely the first two columns 0 That is: and, the standard basis for imf R 0 These base vectors are indeed in imf, since: Consider the 3 vectors 0,, and 0 they are independent because the associated matrix 0 0 reduces to and this echelon form has 3 pivots, that is, only 0 as solution B Jacobs Version: spring 03 Matrix Calculations 49 / 55 Consider the map f : R 3 R given by M f 0 The echelon form of M f is 0 { Thus: x, x, x 3 kerf x x 3 0 { 5x + x 3x 3 0 x x 3 0 x x 3 0 Thus kerf is -dimenionsional, say with base vector Check: Indeed, M f 0 B Jacobs Version: spring 03 Matrix Calculations 5 / 55 Main points, so far, I We have seen matrices as abstractions of systems of equations by removing variables: a x + + a n x n b a a n x b is a m x m + + a mn x mn b m a m a mn matrices capture the behaviour of linear maps on base vectors: M f f v f v n where f v i x n b n B Jacobs Version: spring 03 Matrix Calculations 5 / 55 B Jacobs Version: spring 03 Matrix Calculations 54 / 55

9 Main points, so far, II These two points are connected: solutions of a homogeneous system M f kerf x x n 0 0 Also: basic solutions are base vectors of this kernel Solutions of a non-homogeneous system M f b exist if and only if imf b n x x n are in b b n Also: these solutions are of the form P + H i, with H i kerf B Jacobs Version: spring 03 Matrix Calculations 55 / 55

NOTES ON LINEAR TRANSFORMATIONS

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

More information

MATH1231 Algebra, 2015 Chapter 7: Linear maps

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

More information

1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0

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

More information

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

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

More information

( ) which must be a vector

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

More information

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

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)

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

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

More information

Similarity and Diagonalization. Similar Matrices

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

More information

Systems of Linear Equations

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

More information

Linear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)

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

More information

THE DIMENSION OF A VECTOR SPACE

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

More information

Methods for Finding Bases

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,

More information

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

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

More information

Linear Algebra Notes

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

More information

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

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

More information

1 Sets and Set Notation.

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

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

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

More information

Name: Section Registered In:

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

More information

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

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

More information

LINEAR ALGEBRA W W L CHEN

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,

More information

160 CHAPTER 4. VECTOR SPACES

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

More information

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

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

More information

Solutions to Math 51 First Exam January 29, 2015

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

More information

1 VECTOR SPACES AND SUBSPACES

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

More information

MA106 Linear Algebra lecture notes

MA106 Linear Algebra lecture notes MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector

More information

Lecture Notes 2: Matrices as Systems of Linear Equations

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

More information

Matrix Representations of Linear Transformations and Changes of Coordinates

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

More information

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

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

More information

Section 1.7 22 Continued

Section 1.7 22 Continued Section 1.5 23 A homogeneous equation is always consistent. TRUE - The trivial solution is always a solution. The equation Ax = 0 gives an explicit descriptions of its solution set. FALSE - The equation

More information

Chapter 17. Orthogonal Matrices and Symmetries of Space

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

More information

University 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 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 information

Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013

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

More information

v w is orthogonal to both v and w. the three vectors v, w and v w form a right-handed set of vectors.

v 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 information

[1] Diagonal factorization

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

More information

Math 312 Homework 1 Solutions

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

More information

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

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

More information

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

More information

Linear Algebra Notes for Marsden and Tromba Vector Calculus

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

More information

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

Linear Algebra Review. Vectors

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

More information

Orthogonal Projections

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

More information

Solution to Homework 2

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

More information

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

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

More information

3. INNER PRODUCT SPACES

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.

More information

1 Introduction to Matrices

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

More information

LEARNING OBJECTIVES FOR THIS CHAPTER

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

More information

Geometric Transformations

Geometric Transformations Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted

More information

LS.6 Solution Matrices

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

Orthogonal Diagonalization of Symmetric Matrices

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

More information

α = u v. In other words, Orthogonal Projection

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

ISOMETRIES OF R n KEITH CONRAD

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

More information

MAT188H1S Lec0101 Burbulla

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

More information

Notes on Determinant

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

More information

Recall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n.

Recall the basic property of the transpose (for any A): v A t Aw = v w, v, w R n. ORTHOGONAL MATRICES Informally, an orthogonal n n matrix is the n-dimensional analogue of the rotation matrices R θ in R 2. When does a linear transformation of R 3 (or R n ) deserve to be called a rotation?

More information

Vector Spaces 4.4 Spanning and Independence

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

More information

Section 6.1 - Inner Products and Norms

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

More information

Linear Algebra: Vectors

Linear Algebra: Vectors A Linear Algebra: Vectors A Appendix A: LINEAR ALGEBRA: VECTORS TABLE OF CONTENTS Page A Motivation A 3 A2 Vectors A 3 A2 Notational Conventions A 4 A22 Visualization A 5 A23 Special Vectors A 5 A3 Vector

More information

Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Numerical Analysis Lecture Notes Peter J. Olver 6. Eigenvalues and Singular Values In this section, we collect together the basic facts about eigenvalues and eigenvectors. From a geometrical viewpoint,

More information

Solving Systems of Linear Equations

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

More information

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

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

More information

Inner Product Spaces

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

More information

Linear Algebra I. Ronald van Luijk, 2012

Linear Algebra I. Ronald van Luijk, 2012 Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.

More information

Recall that two vectors in are perpendicular or orthogonal provided that their dot

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

More information

8 Square matrices continued: Determinants

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

More information

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a 88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small

More information

Lecture 3: Finding integer solutions to systems of linear equations

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

More information

Linearly Independent Sets and Linearly Dependent Sets

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

More information

4.5 Linear Dependence and Linear Independence

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

More information

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

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

More information

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University

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

Lecture L3 - Vectors, Matrices and Coordinate Transformations

Lecture L3 - Vectors, Matrices and Coordinate Transformations S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between

More information

The Determinant: a Means to Calculate Volume

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

More information

Unified Lecture # 4 Vectors

Unified Lecture # 4 Vectors Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,

More information

Inner Product Spaces and Orthogonality

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,

More information

Linear Equations in Linear Algebra

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

The Matrix Elements of a 3 3 Orthogonal Matrix Revisited

The Matrix Elements of a 3 3 Orthogonal Matrix Revisited Physics 116A Winter 2011 The Matrix Elements of a 3 3 Orthogonal Matrix Revisited 1. Introduction In a class handout entitled, Three-Dimensional Proper and Improper Rotation Matrices, I provided a derivation

More information

Linear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University

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

Continued Fractions and the Euclidean Algorithm

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

More information

Review Jeopardy. Blue vs. Orange. Review Jeopardy

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?

More information

Notes on Linear Algebra. Peter J. Cameron

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

More information

Chapter 6. Orthogonality

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

More information

2x + 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

2x + 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 information

Elasticity Theory Basics

Elasticity Theory Basics G22.3033-002: Topics in Computer Graphics: Lecture #7 Geometric Modeling New York University Elasticity Theory Basics Lecture #7: 20 October 2003 Lecturer: Denis Zorin Scribe: Adrian Secord, Yotam Gingold

More information

MAT 242 Test 2 SOLUTIONS, FORM T

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

More information

MATH 551 - APPLIED MATRIX THEORY

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

More information

1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]

1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ] 1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not

More information

9 MATRICES AND TRANSFORMATIONS

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

More information

Figure 1.1 Vector A and Vector F

Figure 1.1 Vector A and Vector F CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities have

More information

Examination paper for TMA4115 Matematikk 3

Examination 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 information

1.5 SOLUTION SETS OF LINEAR SYSTEMS

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

More information

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

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

More information

Rotation Matrices and Homogeneous Transformations

Rotation Matrices and Homogeneous Transformations Rotation Matrices and Homogeneous Transformations A coordinate frame in an n-dimensional space is defined by n mutually orthogonal unit vectors. In particular, for a two-dimensional (2D) space, i.e., n

More information

DERIVATIVES AS MATRICES; CHAIN RULE

DERIVATIVES AS MATRICES; CHAIN RULE DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we

More information

1.2 Solving a System of Linear Equations

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

More information

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

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

More information

Inner products on R n, and more

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

More information

CS3220 Lecture Notes: QR factorization and orthogonal transformations

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

More information

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

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

More information

5. Linear algebra I: dimension

5. Linear algebra I: dimension 5. Linear algebra I: dimension 5.1 Some simple results 5.2 Bases and dimension 5.3 Homomorphisms and dimension 1. Some simple results Several observations should be made. Once stated explicitly, the proofs

More information

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

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

More information