Linear Algebra Test 2 Review by JC McNamara


 Lester Garrett
 1 years ago
 Views:
Transcription
1 Linear Algebra Test 2 Review by JC McNamara 2.3 Properties of determinants: det(a T ) = det(a) det(ka) = k n det(a) det(a + B) det(a) + det(b) (In some cases this is true but not always) A is invertible iff det(a) 0 (Thm 2.3.3) det(ab) = det(a) det(b) (Thm 2.3.4) AB is invertible A and B are invertible det(a 1 ) = 1 det(a) (Thm 2.3.5) A 1 = 1 det(a) adj(a) The matrix of cofactors is the following matrix C 11 C C 1n C 21 C C 2n C n1 C n2... C nn The adjoint of A is denoted by adj(a) and is equal the transpose of the matrix of cofactors i.e. C 11 C C n1 C 12 C C n2 adj(a) = C 1n C 2n... C nn Cramer s Rule Let A be an n n invertible matrix. Then the solutions of Ax = b are x 1 = det(a 1) det(a), x 2 = det(a 2) det(a),..., x n = det(a n) det(a) where A j is a matrix obtained from A by replacing the j th columb by b. Theorem A square matrix A is invertible det(a) 0. Proof. Let R be the reduced rowechelon form of A (i.e. R = E k...e 2 E 1 A, where E 1, E 2,..., E k are the elementary matrices used to obtain R from A). By Lemma 2.3.2, det(r) = det(e k ) det(e k 1 )... det(e 2 ) det(e 1 ) det(a). Since det(e n ) 0, then let a = det(e k ) det(e k 1 )... det(e 2 ) det(e 1 ) 0. So det(r) = a det(a). If A is invertible, then R = I n, hence det(r) = 1. Thus det(a) 0. On the other hand, assume det(a) 0, then det(r) 0 since it does not have a row of zeros. Hence R = I n which means that A is invertible. Theorem If A and B are square matrices of the same size, then det(ab) = det(a) det(b). Proof. There are two cases to look at, if A is invertible or A is not invertible. Case 1. If A is not invertible, then neither is AB. Thus from the previous theorem, det(ab) = 0 and det(a) = 0, so det(ab) = det(a) det(b) Case 2. If A is invertible, then A is expressible as a product of elementary matrices such that A = E 1 E 2...E r. Thus AB = E 1 E 2...E r B. Therefore, By Lemma 2.3.2, det(ab) = det(e 1 ) det(e 2 )... det(e r ) det(b) = det(e 1 E 2...E r ) det(b) = det(a) det(b). Theorem If A is invertible, then det(a 1 ) = 1 det(a). Proof. Since A 1 A = I, then det(a 1 A) = det(i). Hence det(a 1 ) det(a) = 1. Therefore, det(a 1 ) = 1 det(a).
2 2 3.1 A lot of the basics on vectors are pretty trivial at this point so I won t bother putting them on. Theorem If u, v, and w are vectors in R n, and if k and m are scalars, then (a) u + v = v + u (b) (u + v) + w = u + (v + w) (c) u + 0 = 0 + u = u (d) u + ( u) = 0 (e) k(u + v) = ku + kv (f) (k + m)u = ku + mu (g) k(mu) = (km)u (h) 1u = u The proofs for these are pretty straightforward, just turn each vector into ordered ntuples and it will work out. 3.2 The norm of v (also called the length or magnitude of v) is denoted by v and is v = v1 2 + v2 2 + v v2 n If v is a vector in R n, and if k is any scalar, then: (a) v 0 (b) v = 0 v = 0 (c) kv = k v The dot product of vectors u and v is denoted by u v and is defined as u v = u v cos θ Also, if u = 0 or v = 0, then u v = 0. If u = (u 1, u 2,..., u n ) and v = (v 1, v 2,..., v n ), then u v = u 1 v 1 + u 2 v u n v n. The dot product is a scalar. Note: v = v v u v Since u v = u v cos θ, then θ = arccos( u v ). Theorem If u, v, and w are vectors in R n, and if k is a scalar, then: (a) u v = v u (b) u (v + w) = u v + u w (c) k(u v) = (ku) v (d) v v 0 and v v = 0 iff v = 0 The proofs for (a) and (b) are straightforward. Proof (c). Let u = (u 1, u 2,..., u n ) and v = (v 1, v 2,..., v n ). Then k(u v) = k(u 1 v 1 + u 2 v u n v n ) = (ku 1 )v 1 + (ku 2 )v (ku n )v n = (ku) v. Proof (d). v v = v v v 2 n = v 2. Since v 0 and v = 0 v = 0, the same applies for v v. Theorem (CauchySchwarz Inequality) u v u v Verification in 2space. Let u = (u 1, u 2 ) and v = (v 1, v 2 ). Squaring both sides gives us u v 2 ( u v ) 2 (u 1 v 1 + u 2 v 2 ) 2 (u u 2 2)(v v 2 2) u 2 1v u 1 v 1 u 2 v 2 + u 2 2v 2 2 u 2 1v u 2 1v u 2 2v u 2 2v 2 2 2u 1 v 1 u 2 v 2 u 2 1v2 2 + u 2 2v1 2 0 u 2 1v2 2 + u 2 2v1 2 2u 1 v 1 u 2 v 2 0 (u 1 v 2 u 2 v 1 ) 2.
3 Theorem (a) If u and v are vectors in R n, then u + v u + v Proof. u + v 2 = (u + v) (u + v) = (u u) + 2(u v) + (v v) = u 2 + 2(u v) + v 2 u u v + v 2 (Property of absolute value) u u v + v 2 (CauchySchwartz) = ( u + v ) 2 u + v u + v. Theorem (Parallelogram Equation for Vectors) If u and v are vectors in R n, then Proof. u + v 2 + u v 2 = 2( u 2 + v 2 ) u + v 2 + u v 2 = (u + v) (u + v) + (u v) (u v) = 2(u u) + 2(v v) = 2( u 2 + v 2 ) 3.3 Orthogonal means perpendicular. Two vectors are orthogonal iff their dot product = 0. The vector component of u along a is and the vector component of u orthogonal to a is proj a u = u a a 2 a u proj a u = u u a a 2 a. If u and v are equal, then Thm is an equality. In R 2, the distance between a point p 0 (x 0, y 0 ) and line ax + by + c = 0 is D = ax 0 + by 0 + c a2 + b 2 In R 3, the distance between a point p 0 (x 0, y 0, z 0 ) and plane ax + by + cz + d = 0 is D = ax 0 + by 0 + cz 0 + d a2 + b 2 + c 2
4 If u = (u 1, u 2, u 3 ) and v = (v 1, v 2, v 3 ) are vectors in 3space, then the cross product u v is the vector defined by i j k u 1 u 2 u 3 v 1 v 2 v 3. u v u v  u v = u v sin θ i j = k, j k = i, etc. The area of a parallelogram is the norm of the cross product determined by the two vectors from the same vertex of a parallelogram. The area of a triangle is half of the norm of the cross product determined by the two vectors from the same vertex. If u, v, w R 3, then the scalar triple product of u, v, and w is u (v w). The norm of the scalar product is the volume of the parallelepiped formed by the three vectors. Theorem 3.5.1(a) If u, v, and w are vectors in 3space, then u (u v) = 0 Proof. (b) v (u v) = 0 (c) u v 2 = u 2 v 2 (u v) 2 (d) u (v w) = (u w)v (u v)w (e) (u v) w = (u w)v (v w)u u (u v) = (u 1, u 2, u 3 ) (u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ) = u 1 (u 2 v 3 u 3 v 2 ) + u 2 (u 3 v 1 u 1 v 3 ) + u 3 (u 1 v 2 u 2 v 1 ) = 0 Theorem (a) and (f) If u, v, and w are vectors in 3space and k is any scalar, then (a) u v = (v u) (f) u u = 0 Proof. (a) Since the cross product is a determinant, interchanging two rows changes the sign of the determinant. Thus u v = (v u). Proof. (f) Since the cross product is a determinant, the determinant of a matrix with two of the same rows is always zero. Thus u u = 0. (b) u (v + w) = (u v) + (u w) (c) (u + v) w = (u w) + (v w) (d) k(u v) = (ku) v = u (kv) (e) u 0 = 0 u = 0 Theorem If u and v are vectors in 3space, then u v is equal to the area of the parallelogram determined by u and v. Proof. The area of a parellelogram is A = bh = u v sin θ = u v.
5 5 4.1 A vector space V is a nonempty set defined under addition and scalar multiplication satisfying the following: Note: u, v, w V and k, m R 1. If u and v V, then u + v V (Closure under addition) 2. u + v = v + u (Commutativity) 3. u + (v + w) = (u + v) + w (Associativity) 4. 0 V called the zero vector 0 + u = u + 0 = u u V (Additive Identity) 5. u V, u V u + ( u) = ( u) + u = 0 (Additive Inverse) 6. If k is any scalar and u is any object in V, then ku is in V. (Closure under scalar multiplication) 7. k(u + v) = ku + mu (Distributivity) 8. (k + m)u = ku + mu (Distributivity) 9. k(mu) = (km)(u) 10. 1u = u Theorem Let V be a vector space, u V and k R, then: (a) 0u = 0 (b) k0 = 0 (c) ( 1)u = u (d) ku = 0 k = 0 or u = 0 Proof. I m omitting the reasons since I m sure you guys can figure it out yourselves. (a) (b) (c) (d) Let ku = 0 and k 0. 0u + 0u = (0 + 0)u = 0u (0u + 0u) + ( 0u) = 0u + ( 0u) 0u + (0u 0u) = 0 0u + 0 = 0 0u = 0 k0 = k(0 + 0) = k0 + k0 k0 + ( k0) = (k0 + k0) + ( k0) 0 = k0 + (k0 + ( k0)) 0 = k = k0 u + ( 1)u = 1u + ( 1)u = (1 + ( 1))u = 0u = 0 ku = 0 1 k (ku) = 1 k 0 ( 1 k k)u = 0 1u = 0 u = 0
6 4.2 A subset W of a vector space V is called a subspace of V if W is itself a vector space. A set W is a subspace of V if the following conditions hold: (a) If u and v are vectors in W, then u + v W. (b) If k is any scalar and u is any vector in W, then ku W. Every space has at least one subspace, the zero space W = {0} and the whole space W = V. These are called trivial subspaces. A subspace that is neither one of those two is called a proper subspace. If W 1, W 2,..., W n are subspaces of a vector space V, then W 1 W 2... W n is also a subspace of V. If w is a vector in a vector space V, then w is said to be a linear combination of the vectors v 1, v 2,..., v n in V if w can be expressed in the form w = k 1 v 1 + k 2 v k n v n where k 1, k 2,..., k n are scalars. These scalars are called the coefficients of the linear combination. Span{w 1, w 2,..., w n } is the set of all linear combinations of the vectors w 1, w 2,..., w r (which itself is a subspace of V ). Theorem The solution set of Ax = 0 (with nunknowns) forms a subspace R n. Proof. Let W be the solution set for the system. The set W is nonempty because it contains the trivial solution x = 0. To show that W is a subspace of R n, we must show that it is closed under addition and scalar multiplication. Let x 2 and x 2 be solutions such that Ax 1 = 0 and Ax 2 = 0 It follows that 4.3 Let v 1, v 2,..., v n be vectors in vector space V. These vectors are called linearly independent if has only the trivial solution A(x 1 + x 2 ) = Ax 1 + Ax 2 = = 0 A(kx 1 ) = ka(x 1 ) = k0 = 0. k 1 v 1 + k 2 v k n v n = 0 k 1 = k 2 =... = k n = 0. Otherwise, they are linearly dependent. A finite set that contains 0 is linearly dependent. A set with exactly one vector is linearly independent iff that vector is not 0. A set with exactly two vectors is linearly independent iff neither vector is a scalar multiple of the other. If f 1 (x), f 2 (x),..., f n (x) are functions that are n 1times differentiable on the interval (, ), then the determinant f 1 (x) f 2 (x)... f n (x) f 1(x) f 2(x)... f n(x) W (x) = f (n 1) 1 (x) f (n 1) 2 (x)... f n (n 1) (x) is called the Wronskian of f 1, f 2,..., f n. If W (x) 0, then f 1, f 2,..., f n are linearly independent. Theorem 4.3.1(a) A set S with two or more vectors is linearly dependent iff at least one of the vectors in S is expressible as a linear combination of the other vectors in S. Proof. Let S be a linearly dependent set. Then k 1 v 1 + k 2 v k n v n = 0 has only the trivial solution. Suppose k 1 0 : k 1 v 1 = (k 2 v k n v n ) v 1 = k 2 k 1 v 2 k 3 k 1 v 3... k n k 1 v n. Thus at least one of the vectors in S is expressible as a linear combination of the other vectors in S. Notice that as long as k j 0 for some 1 j n, then v j can be expressed a linear combination of the other vectors in S. On the other hand, assume that at least one of the vectors in S can be expressed as a linear combination of the other vectors such that v 1 c 2 v 2 c 3 v 3... c r v r = 0 v 1 = c 2 v 2 + c 3 v c r v r which is clearly linearly dependent since v 1 has a nonzero coefficient. (b) A set S with two or more vectors is linearly independent iff no vector in S is expressible as a linear combination of the other vectors in S.
2.1: Determinants by Cofactor Expansion. Math 214 Chapter 2 Notes and Homework. Evaluate a Determinant by Expanding by Cofactors
2.1: Determinants by Cofactor Expansion Math 214 Chapter 2 Notes and Homework Determinants The minor M ij of the entry a ij is the determinant of the submatrix obtained from deleting the i th row and the
More informationLecture 11. Shuanglin Shao. October 2nd and 7th, 2013
Lecture 11 Shuanglin Shao October 2nd and 7th, 2013 Matrix determinants: addition. Determinants: multiplication. Adjoint of a matrix. Cramer s rule to solve a linear system. Recall that from the previous
More informationMATH 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
More information1 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
More informationDeterminants. Dr. Doreen De Leon Math 152, Fall 2015
Determinants Dr. Doreen De Leon Math 52, Fall 205 Determinant of a Matrix Elementary Matrices We will first discuss matrices that can be used to produce an elementary row operation on a given matrix A.
More informationCofactor Expansion: Cramer s Rule
Cofactor Expansion: Cramer s Rule MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Today we will focus on developing: an efficient method for calculating
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More informationv 1 v 3 u v = (( 1)4 (3)2, [1(4) ( 2)2], 1(3) ( 2)( 1)) = ( 10, 8, 1) (d) u (v w) = (u w)v (u v)w (Relationship between dot and cross product)
0.1 Cross Product The dot product of two vectors is a scalar, a number in R. Next we will define the cross product of two vectors in 3space. This time the outcome will be a vector in 3space. Definition
More information(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
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More information1.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:
More informationProblems. Universidad San Pablo  CEU. Mathematical Fundaments of Biomedical Engineering 1. Author: First Year Biomedical Engineering
Universidad San Pablo  CEU Mathematical Fundaments of Biomedical Engineering 1 Problems Author: First Year Biomedical Engineering Supervisor: Carlos Oscar S. Sorzano September 15, 013 1 Chapter 3 Lay,
More information2.5 Elementary Row Operations and the Determinant
2.5 Elementary Row Operations and the Determinant Recall: Let A be a 2 2 matrtix : A = a b. The determinant of A, denoted by det(a) c d or A, is the number ad bc. So for example if A = 2 4, det(a) = 2(5)
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationMatrix 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
More informationMATRIX 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 informationChapter 1. Determinants
Chapter 1. Determinants This material is in Chapter 2 of Anton & Rorres (or most of it is there). See also section 3.5 of that book. 1.1 Introductory remarks The determinant of a square matrix A is a number
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationDeterminants. Chapter Properties of the Determinant
Chapter 4 Determinants Chapter 3 entailed a discussion of linear transformations and how to identify them with matrices. When we study a particular linear transformation we would like its matrix representation
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional 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 informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationLinear 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
More informationSec 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
More informationINTRODUCTORY 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
More informationDeterminants LECTURE Calculating the Area of a Parallelogram. Definition Let A be a 2 2 matrix. A = The determinant of A is the number
LECTURE 13 Determinants 1. Calculating the Area of a Parallelogram Definition 13.1. Let A be a matrix. [ a c b d ] The determinant of A is the number det A) = ad bc Now consider the parallelogram formed
More informationTopic 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
More information1. For each of the following matrices, determine whether it is in row echelon form, reduced row echelon form, or neither.
Math Exam  Practice Problem Solutions. For each of the following matrices, determine whether it is in row echelon form, reduced row echelon form, or neither. (a) 5 (c) Since each row has a leading that
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More informationCross product and determinants (Sect. 12.4) Two main ways to introduce the cross product
Cross product and determinants (Sect. 12.4) Two main ways to introduce the cross product Geometrical definition Properties Expression in components. Definition in components Properties Geometrical expression.
More information5.3 Determinants and Cramer s Rule
290 5.3 Determinants and Cramer s Rule Unique Solution of a 2 2 System The 2 2 system (1) ax + by = e, cx + dy = f, has a unique solution provided = ad bc is nonzero, in which case the solution is given
More informationMath 241, Exam 1 Information.
Math 241, Exam 1 Information. 9/24/12, LC 310, 11:1512:05. Exam 1 will be based on: Sections 12.112.5, 14.114.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)
More informationUNIT 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
More informationUsing 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
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationWe know a formula for and some properties of the determinant. Now we see how the determinant can be used.
Cramer s rule, inverse matrix, and volume We know a formula for and some properties of the determinant. Now we see how the determinant can be used. Formula for A We know: a b d b =. c d ad bc c a Can we
More informationLecture 14: Section 3.3
Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationOrthogonal 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 informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationMath 315: Linear Algebra Solutions to Midterm Exam I
Math 35: Linear Algebra s to Midterm Exam I # Consider the following two systems of linear equations (I) ax + by = k cx + dy = l (II) ax + by = 0 cx + dy = 0 (a) Prove: If x = x, y = y and x = x 2, y =
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all ndimensional column
More informationDot product and vector projections (Sect. 12.3) There are two main ways to introduce the dot product
Dot product and vector projections (Sect. 12.3) Two definitions for the dot product. Geometric definition of dot product. Orthogonal vectors. Dot product and orthogonal projections. Properties of the dot
More informationChapter 8. Matrices II: inverses. 8.1 What is an inverse?
Chapter 8 Matrices II: inverses We have learnt how to add subtract and multiply matrices but we have not defined division. The reason is that in general it cannot always be defined. In this chapter, we
More informationThe Inverse of a Matrix
The Inverse of a Matrix 7.4 Introduction In number arithmetic every number a ( 0) has a reciprocal b written as a or such that a ba = ab =. Some, but not all, square matrices have inverses. If a square
More informationSolutions 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
More informationDETERMINANTS. b 2. x 2
DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in twodimensional space (1) 2x y = 3 describes a line in twodimensional space The coefficients of x and y in the equation
More informationNotice that v v w (4)( 15) ( 3)( 20) (0)(2) ( 2)( 15) (2)( 20) (5)(2)
The Cross Product When discussing the dot product, we showed how two vectors can be combined to get a number. Here, we shall see another way of combining vectors, this time resulting in a vector. This
More information= [a ij ] 2 3. Square matrix A square matrix is one that has equal number of rows and columns, that is n = m. Some examples of square matrices are
This document deals with the fundamentals of matrix algebra and is adapted from B.C. Kuo, Linear Networks and Systems, McGraw Hill, 1967. It is presented here for educational purposes. 1 Introduction In
More informationMATH 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
More informationOctober 3rd, 2012. Linear Algebra & Properties of the Covariance Matrix
Linear Algebra & Properties of the Covariance Matrix October 3rd, 2012 Estimation of r and C Let rn 1, rn, t..., rn T be the historical return rates on the n th asset. rn 1 rṇ 2 r n =. r T n n = 1, 2,...,
More informationMAT 1341: REVIEW II SANGHOON BAEK
MAT 1341: REVIEW II SANGHOON BAEK 1. Projections and Cross Product 1.1. Projections. Definition 1.1. Given a vector u, the rectangular (or perpendicular or orthogonal) components are two vectors u 1 and
More informationSolutions to Review Problems
Chapter 1 Solutions to Review Problems Chapter 1 Exercise 42 Which of the following equations are not linear and why: (a x 2 1 + 3x 2 2x 3 = 5. (b x 1 + x 1 x 2 + 2x 3 = 1. (c x 1 + 2 x 2 + x 3 = 5. (a
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in threespace, we write a vector in terms
More informationSolution. 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 Takehome 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)
More informationSection 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 informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationThe Determinant: a Means to Calculate Volume
The Determinant: a Means to Calculate Volume Bo Peng August 20, 2007 Abstract This paper gives a definition of the determinant and lists many of its wellknown properties Volumes of parallelepipeds are
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationAPPLICATIONS OF MATRICES. Adj A is nothing but the transpose of the cofactor matrix [A ij ] of A.
APPLICATIONS OF MATRICES ADJOINT: Let A = [a ij ] be a square matrix of order n. Let Aij be the cofactor of a ij. Then the n th order matrix [A ij ] T is called the adjoint of A. It is denoted by adj
More informationLinear Algebra Concepts
University of Central Florida School of Electrical Engineering Computer Science EGN3420  Engineering Analysis. Fall 2009  dcm Linear Algebra Concepts Vector Spaces To define the concept of a vector
More informationLecture 4: Partitioned Matrices and Determinants
Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying
More informationExercises and Problems in Linear Algebra. John M. Erdman Portland State University. Version July 13, 2014
Exercises and Problems in Linear Algebra John M. Erdman Portland State University Version July 13, 2014 c 2010 John M. Erdman Email address: erdman@pdx.edu Contents PREFACE vii Part 1. MATRICES AND LINEAR
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationB such that AB = I and BA = I. (We say B is an inverse of A.) Definition A square matrix A is invertible (or nonsingular) if matrix
Matrix inverses Recall... Definition A square matrix A is invertible (or nonsingular) if matrix B such that AB = and BA =. (We say B is an inverse of A.) Remark Not all square matrices are invertible.
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 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 informationMATH 304 Linear Algebra Lecture 24: Scalar product.
MATH 304 Linear Algebra Lecture 24: Scalar product. Vectors: geometric approach B A B A A vector is represented by a directed segment. Directed segment is drawn as an arrow. Different arrows represent
More informationVectors, Gradient, Divergence and Curl.
Vectors, Gradient, Divergence and Curl. 1 Introduction A vector is determined by its length and direction. They are usually denoted with letters with arrows on the top a or in bold letter a. We will use
More informationLinear 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 information28 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE. v x. u y v z u z v y u y u z. v y v z
28 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE 1.4 Cross Product 1.4.1 Definitions The cross product is the second multiplication operation between vectors we will study. The goal behind the definition
More informationWe call this set an ndimensional parallelogram (with one vertex 0). We also refer to the vectors x 1,..., x n as the edges of P.
Volumes of parallelograms 1 Chapter 8 Volumes of parallelograms In the present short chapter we are going to discuss the elementary geometrical objects which we call parallelograms. These are going to
More informationChapter 1  Matrices & Determinants
Chapter 1  Matrices & Determinants Arthur Cayley (August 16, 1821  January 26, 1895) was a British Mathematician and Founder of the Modern British School of Pure Mathematics. As a child, Cayley enjoyed
More informationChapter 4: Systems of Equations and Ineq. Lecture notes Math 1010
Section 4.1: Systems of Equations Systems of equations A system of equations consists of two or more equations involving two or more variables { ax + by = c dx + ey = f A solution of such a system is an
More informationMATH 304 Linear Algebra Lecture 16: Basis and dimension.
MATH 304 Linear Algebra Lecture 16: Basis and dimension. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis. Equivalently, a subset S V is a basis for
More informationv w is orthogonal to both v and w. the three vectors v, w and v w form a righthanded 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 information4. 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
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationMatrix Algebra LECTURE 1. Simultaneous Equations Consider a system of m linear equations in n unknowns: y 1 = a 11 x 1 + a 12 x 2 + +a 1n x n,
LECTURE 1 Matrix Algebra Simultaneous Equations Consider a system of m linear equations in n unknowns: y 1 a 11 x 1 + a 12 x 2 + +a 1n x n, (1) y 2 a 21 x 1 + a 22 x 2 + +a 2n x n, y m a m1 x 1 +a m2 x
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More information2.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
More informationMatrices, Determinants and Linear Systems
September 21, 2014 Matrices A matrix A m n is an array of numbers in rows and columns a 11 a 12 a 1n r 1 a 21 a 22 a 2n r 2....... a m1 a m2 a mn r m c 1 c 2 c n We say that the dimension of A is m n (we
More informationMATH10212 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
More informationOrthogonal Projections and Orthonormal Bases
CS 3, HANDOUT A, 3 November 04 (adjusted on 7 November 04) Orthogonal Projections and Orthonormal Bases (continuation of Handout 07 of 6 September 04) Definition (Orthogonality, length, unit vectors).
More informationi=(1,0), j=(0,1) in R 2 i=(1,0,0), j=(0,1,0), k=(0,0,1) in R 3 e 1 =(1,0,..,0), e 2 =(0,1,,0),,e n =(0,0,,1) in R n.
Length, norm, magnitude of a vector v=(v 1,,v n ) is v = (v 12 +v 22 + +v n2 ) 1/2. Examples v=(1,1,,1) v =n 1/2. Unit vectors u=v/ v corresponds to directions. Standard unit vectors i=(1,0), j=(0,1) in
More informationImages 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
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More informationNON 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
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationMA 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.
More information0.1 Linear Transformations
.1 Linear Transformations A function is a rule that assigns a value from a set B for each element in a set A. Notation: f : A B If the value b B is assigned to value a A, then write f(a) = b, b is called
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 3 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 3 1 / 12 Vector product and volumes Theorem. For three 3D vectors u, v, and w,
More information4.6 Null Space, Column Space, Row Space
NULL SPACE, COLUMN SPACE, ROW SPACE Null Space, Column Space, Row Space In applications of linear algebra, subspaces of R n typically arise in one of two situations: ) as the set of solutions of a linear
More informationChapter 4: Binary Operations and Relations
c Dr Oksana Shatalov, Fall 2014 1 Chapter 4: Binary Operations and Relations 4.1: Binary Operations DEFINITION 1. A binary operation on a nonempty set A is a function from A A to A. Addition, subtraction,
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LUdecomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More informationHarvard College. Math 21b: Linear Algebra and Differential Equations Formula and Theorem Review
Harvard College Math 21b: Linear Algebra and Differential Equations Formula and Theorem Review Tommy MacWilliam, 13 tmacwilliam@college.harvard.edu May 5, 2010 1 Contents Table of Contents 4 1 Linear Equations
More informationMATH36001 Background Material 2015
MATH3600 Background Material 205 Matrix Algebra Matrices and Vectors An ordered array of mn elements a ij (i =,, m; j =,, n) written in the form a a 2 a n A = a 2 a 22 a 2n a m a m2 a mn is said to be
More information1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each)
Math 33 AH : Solution to the Final Exam Honors Linear Algebra and Applications 1. True/False: Circle the correct answer. No justifications are needed in this exercise. (1 point each) (1) If A is an invertible
More informationNotes 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 information2.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
More information