# MAT188H1S Lec0101 Burbulla

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Winter 206

2 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 and v, and all scalars k This definition is equivalent to saing T (a u + b v) at (u) + bt (v) for all vectors u and v, and all scalars, a and b We sa, T preserves linear combinations Basic Terminolog For the linear transformation T : R m R n, R m is called the domain of T R n is called the codomain of T For the vector u R m, the vector T (u) is called the image of u under T The set of all images of vectors u R m is called the range of T, and denoted b range(t ) It is a subset of R n A linear transformations can also be called a linear map, or a linear function, or simpl a map

3 Example Define T : R m R m b T (v) 2 v Then T (u + v) 2 (u + v) 2 u + 2 v T (u) + T (v), and T (k v) 2(k v) k(2 v) kt (v) So T is a linear transformation Indeed, an scalar map, T (v) a v, for an scalar a, is a linear transformation, as ou can check Example 2 Let T : R 2 R 2 be dfined b ([ ) [ x 2x + 3 T x + [ x 2 + [ 3 Then T is a linear transformation The eas wa to see this is to rewrite T in terms of products: T (v) A v if [ [ 2 3 x A, v Then and T (u + v) A(u + v) A u + A v T (u) + T (v), T (k v) A(k v) ka v kt (v) So T is a linear transformation, known as a matrix transformation

4 Dimensions of a Matrix Here is some terminolog about matrices that ou should be aware of: Suppose A is a matrix with n rows and m columns Then we sa that A is an n m matrix, and that A has dimensions n m The dimensions of a matrix are often called its size If m n then A is called a square matrix For example, A is a 2 4 matrix and B is a 3 3 square matrix: [ A, B Matrix Transformations Theorem 32: Let A be an n m matrix; let T (x) A x Then T : R m R n is a linear transformation Proof: as in Example 2 Less obviousl, ever linear transformation is actuall a matrix transformation for some matrix A To see this, define the vectors e 0 0, e 2 in R m and consider the images 0 0,, e m T (e ), T (e 2 ),, T (e m ) 0 0

5 The Matrix of a Linear Transformation Theorem 38: Let T : R m R n be a linear transformation, let A [ T (e ) T (e 2 ) T (e m ), which is an n m matrix Then T (x) A x Proof: first observe that if x R m with components x,, x m then x x e + x 2 e x m e m, and so T (x) T (x e + x 2 e x m e m ) x T (e ) + x 2 T (e 2 ) + + x m T (e m ) A x Note: A is called the standard matrix of T, or just the matrix of T Example 3 If then T (e ) T [ 4 x z [, T (e 2 ) [ x + 2z 4x + 3z, [ 2, T (e 3 ) 3 So the matrix of T is A [ 2 4 3

6 One-to-one and Onto Linear Transformations Let T : R m R n be a linear transformation Definition : T is one-to-one if for ever vector w R n there exists at most one vector u R m such that T (u) w Definition 2: T is onto if for ever vector w R n there exists at least one vector u R m such that T (u) w ie range(t ) R n Alternate Version of Definition : T is one-to-one if T (u) T (v) u v Theorem 35: Let T be a linear transformation T is one-to-one if and onl if T (x) 0 implies that x 0 Proof: ( ) T (x) 0 and T (0) 0 impl x 0 ( ) T (u) T (v) T (u v) 0 x u v 0 u v Example 4 Let T : R 2 R 3 be defined b T ([ x ) 2x + x 2 4x + 3 T is one-to-one: T (x) 0 2x + 0, x 2 0, 4x x 0 T is not onto: T ([ x ) 2x + x 2 4x + 3 x so range(t ) is spanned b two vectors, which cannot span R 3 ;

7 Theorems About a Transformation and its Matrix Let A [ a a 2 a m be an n m matrix and suppose T : R m R n is the linear transformation defined b T (x) A x Theorem 33: (a) w range(t ) if and onl if A x w is a consistent sstem (b) range(t ) span{a, a 2,, a m } Theorem 36: (a) T is one-to-one if and onl if {a, a 2,, a m } is independent (b) If n < m, then T is not one-to-one Theorem 37: (a) T is onto if and onl if R n span{a, a 2,, a m } (b) If n > m, then T is not onto Proofs: in each case, (b) is an immediate consequence of (a) And Theorem 33 (b) immediatel implies Theorem 37 (a) So all we reall have to proof is part (a) of both Theorems 33 and (a): w range(t ) if and onl if there is vector x R m such that T (x) w A x w if and onl if the sstem A x w is a consistent sstem 36 (a): use Theorem 35 T is one-to-one if and onl if the equation T (x) 0 has onl the trivial solution if and onl if the equation A x 0 has onl the trivial solution if and onl if the columns of A are independent, b Theorem 23

8 The Big Theorem, Version 2 We can now add two more conditions to the Big Theorem: Theorem 39: Let A {a, a 2,, a n } be a set of n vectors in R n, let A [ a a 2 a n, and let T : R n R n be a linear transformation such that T (x) A x Then the following statements are equivalent: (a) A spans R n (b) A is linearl independent (c) A x b has a unique solution for all b in R n (d) T is onto (e) T is one-to-one Example 5 As in Exercise 52, page 93 of Holt, the cross product of two vectors u, v in R 3 is defined to be u v u 2 v 3 v 2 u 3 u 3 v v 3 u u v 2 v u 2, and for an vector u R 3 the map defined b T (x) u x is linear Show that T is neither one-to-one nor onto Solution: if u 0, thent (x) 0 x 0 and T is as far from onto and one-to-one as it is possible to be If u 0, then T (u) 0, impling T is not one-to-one So b the Big Theorem it isn t onto either Aside: check that the matrix of T is A [ T (e ) T (e 2 ) T (e 3 ) 0 u 3 u 2 u 3 0 u u 2 u 0

9 Geometric Interpretation of a Matrix Transformation One wa to see the geometric effect of a linear transformation T : R 2 R 2 is to look at the image of the unit square The unit square is the square determined b e and e 2 The image of the unit square is the parallelogram determined b T (e ) and T (e 2 ) T (e 2 ) e 2 T (e ) O x e Example 6: Expansion in the Direction Let T ([ x ) [ [ x [ x 3 The image of the unit square is a rectangle with area 3 T is called an expansion of factor 3 in the direction If the factor is less than one, then T would be called a compression e 2 O T (e 2 ) 3e 2 e T (e ) x

10 Example 7: Shear in the x Direction Let T ([ x ) [ 3 0 [ x [ x + 3 The image of the unit square is a parallelogram that still has area T is called a shear of factor 3 in the x direction e 2 O x e Example 8: Dilation Let T ([ x ) [ [ x [ 3x 3 The image of the unit square is a bigger square, with area 9 T is called a dilation of factor 3 If the factor is less than one, then T would be called a contraction e 2 O T (e 2 ) 3e 2 e x T (e ) 3e

11 Rotations Let T (v) be the result of rotating the vector v counterclockwise through an angle θ about the origin [ cos θ T (e ) sin θ e 2 T (e ) [ ( ) cos θ + π T (e 2 ) T (e 2 ) 2 sin ( θ + π ) θ 2 [ O e x sin θ cos θ [ cos θ sin θ So the matrix of T is R θ sin θ cos θ Example 9 The standard matrix of a rotation of π about the origin is [ [ [ cos π sin π 0 x R π and R sin π cos π 0 π [ x The standard matrix of a rotation of π 6 about the origin is R π/6 [ ( ) ( ) cos π 6 sin π 6 sin ( π ) 6 cos ( π ) 6 2 [ 3 3 and R π/6 [ x 2 [ 3 x + x + 3

12 The Standard Matrix of a Reflection in the Line mx Let d [ m Check that: T (e ) +m 2 [ m 2 2m [ T (e 2 ) +m 2 2m m 2 So the matrix of T is Q m [ m 2 2m + m 2 2m m 2 T (e ) mx d O e x T (e 2 ) 7 e 2 Example 0 The standard matrix for a reflection in the x-axis, with m 0, is [ [ [ 0 x x Q 0 and Q 0 0 The standard matrix for a reflection in the line x is Q [ [ [ [ x and Q x The standard matrix for a reflection in the line 3x is Q 3 [ 8 6 [ 4 3 and Q 3 [ x 5 [ 4x 3 3x + 4

13 Subscript Notation Up until now a matrix has been used to represent a sstem of linear equations, or to represent a linear transformation In this section we shall treat matrices as algebraic objects in their own right In general, an n m matrix A a a 2 a 3 a m a 2 a 22 a 23 a 2m a 3 a 32 a 33 a 3m a n a n2 a n3 a nm can be represented as A [a ij, where i n, and j m First definition: two matrices A and B are equal if A and B have the same dimensions and corresponding entries are equal, a ij b ij Matrix Addition If A [a ij and B [b ij are both n m matrices, then A + B and A B are defined as follows: A + B [a ij + b ij and A B [a ij b ij That is, ou add and subtract componentwise For example, if [ [ A and B then A + B [ and A B [

14 Zero Matrices An matrix for which ever entr is 0, is called a zero matrix Eg, [ is a zero matrix To be more precise, it is a 2 3 zero matrix A zero matrix is alwas represented b the number 0 with appropriate subscripts added to emphasize the size of the matrix: 0 23 [ and are both zero matrices Often the subscripts are dropped, if it is clear from context that 0 represents a matrix The Negative of a Matrix If A [a ij is an n m matrix, then A is called the negative of A; it is defined as A [ a ij For example, if then A A [ , [ Matrix subtraction is thus addition of the negative: A B A + ( B)

15 Properties of Matrix Addition Suppose A, B and C are all n m matrices Then A + B B + A A + (B + C) (A + B) + C 0 nm + A A, A + ( A) 0 nm The proofs are all eas computations; see the textbook Scalar Multiplication If A [a ij is an n m matrix, and k is a scalar, that is, a real number, then ka is called a scalar multiple of A and it is defined b ka [ka ij For example, if then A 3A [ [ ,

16 Properties of Scalar Multiplication Let A, B be n m matrices; let c and d be scalars Then c(a + B) ca + cb (c + d)a ca + da c(da) (cd)a A A 0A 0 nm, ( )A A If ca 0 nm, then c 0 or A 0 nm Again, the proofs are all eas Vectors as Matrices An n matrix is called a column matrix, or a column vector Thus vectors as defined in Chapter are just special cases of matrices However, we will still reserve the notation x x x 2 x n for vectors, although ou could just as well use x X x 2 x n

17 Transposition Let A [a ij be an n m matrix The transpose of A, denoted b A T, is the m n matrix defined b A T [a ji That is, A T is obtained from A b interchanging rows and columns For example, if [ A, 0 6 then A T Properties of Transposition Let A and B be n m matrices; let k be a scalar Then (A T ) T A (ka) T ka T (A + B) T A T + B T See the textbook for the (eas) proofs

18 Smmetric Matrices A square matrix A for which A T A is called a smmetric matrix For example: 3 6 A is smmetric, but B [ is not Example ( [ [ ) T [ T

19 Composition of Transformations and Matrix Multiplication Suppose both S : R m R k and T : R k R n are linear transformations Then the composition, T S, defined b (T S)(v) T (S(v)), is also a linear transformation from R m to R n : (T S)(au + bv) T (S(au + bv)), b definition T (as(u) + bs(v)), because S is linear a T (S(u)) + b T (S(v)), because T is linear a (T S)(u) + b (T S)(v) What is the matrix of T S in terms of the matrices of T and S? The Matrix of T S Suppose the matrix of T is the n k matrix A and the matrix of S is the k m matrix B [ b b 2 b m Then (T S)(x) T (S(x)) A(B x) A(x b + x 2 b x m b m ) x A b + x 2 A b x m a b m [ A b A b 2 A b m x The n m matrix C [ A b A b 2 A b m is the matrix of T S It is defined as the product AB : if A is n k, B is k m, then AB [ A b A b 2 A b m, which is an n m matrix

20 Example 2 Let A [ [ 2 5, B 9 4 [ 3, C Both AC and BC are defined: [ [ [ AC A A 2 4 [ BC B [ 2 B [ 4 But CA and CB are not defined [ A [ B [ [ ; Both products AB and BA are possible Let s calculate them: [ [ AB [ BA [ [ [ Note that AB BA Be careful! matrix multiplication has properties different than number multiplication

21 An Alternate Definition for the Product AB If A is an n k matrix and B is a k m matrix, then the n m matrix C [c ij, defined b c ij a i b j + a i2 b 2j + + a ik b kj, for i n, j m, is called the product of A and B, and we write C AB If ou have seen the dot product of vectors in high school, then c ij r i c j, where r i [ a i a i2 a ik and cj b j b 2j b kj are the i-th row of A and the j-th column of B, respectivel Example 3 Take A and C as in Example 2 Here is how we can calculate the product AC: [ [ AC [ 3() + 7(2) 3( ) + 7(4) 3(3) + 7( 2) 2() + 5(2) 2( ) + 5(4) 2(3) + 5( 2) [ Regardless of which wa ou calculate the product of two matrices, it is not necessar to write down ever miniscule computation: we usuall do the arithmetic in our heads

22 Identit Matrices A square matrix with ever entr on the main diagonal equal to, and ever other entr equal to 0, is called an identit matrix, and is usuall denoted b I For example, I and I [ 0 0 are both identit matrices If it is important to indicate the sizes, ou can use subscripts: I 44 and I 22, or more sloppil, I 4 and I 2 Properties of Matrix Multiplication Let c be a scalar and let A, B, C be matrices of appropriate sizes so that the following products can be formed Then: IA A and BI B, where I is an identit matrix A(BC) (AB)C A(B ± C) AB ± AC (B ± C)A BA ± CA c(ab) (ca)b A(cB) (AB) T B T A T, note the change of order! See the textbook for the proofs Note that AB BA is not one of the properties listed above

23 Example 4 Consider the matrices [ A, B 2 2 [ [ 2, C 2 Then AB [ 2 2 [ but neither A 0 nor B 0 Similarl [ [ 2 AC [ [ Thus it is possible that AB AC but neither B C nor A 0 Example 5 Suppose T is a reflection in the line x, and S is a reflection in the line 2x Then the matrix of T is Q [ [ [ and the matrix of S is Q The matrix of T S is 4 3 Q Q 2 [ [ [ 4 3 R cos ( 4/5) and (T S)(v) 5 [ [ x 5 [ 4x 3 3x 4

24 Powers of a Matrix If A is a square matrix we define A 2 AA, A 3 AAA, etc [ 3 7 A 2 5 So for ou can check that A 2 [ [ [ and A 3 A 2 B [ [ [ It can be ver cumbersome to calculate higher powers of a matrix! Example 6 For numbers, x 2 x ± Things are ver different for matrices Consider the matrix equation A 2 I Two obvious solutions are A ±I, but there are infinitel man more For example, if A is 2 2: [ 0 /c A, for c 0 c 0 Can ou find an others?

25 Diagonal and Triangular Matrices D U L a a a nn a a 2 a n 0 a 22 a 2n 0 0 a nn a 0 0 a 2 a 22 0 a n a n2 a nn D [a ij is diagonal if a ij 0, i j U [a ij is upper triangular if a ij 0, i > j L [a ij is lower triangular if a ij 0, i < j Powers of Diagonal and Triangular Matrices Powers of these tpes of matrices are of the same form That is D k is diagonal if D is; U k is upper triangular if U is; and L k is lower triangular if L is For example: D D k 4 k k ( 3) k and U U , U , as ou can check

26 Block Multiplication Sometimes it is convenient to partition the entries of a matrix into blocks Consider the matrix [ A P Q, O R where the 2 2 matrix P, the 2 3 matrix Q, the 2 matrix O, and the 3 matrix R are all called blocks If B [ U V, where U and V are also blocks, then AB can be calculated as [ [ P Q U AB O R V [ PU + QV OU + RV [ PU + QV RV , as ou ma check 49 5

27 Inverse Linear Transformations The linear transformation T : R n R n is called invertible if it is one-to-one and onto If T is invertible, the inverse function T : R n R n is defined b T () x T (x) That is (T T )() and (T T )(x) x, for all x, R n Note: The function T is well defined because For each R n there is at least one x R n such that T (x), because T is onto 2 For each R n there is at most one x R n such that T (x), because T is one-to-one Thus for each R n there is exactl one x R n such that T (x), and so T is well defined T is Also a Linear Transformation Theorem 39: If T : R n R n is invertible, then T is also a linear transformation Proof: let, 2 be vectors in R n, let a, a 2 be scalars Since T is invertible there are unique vectors x, x 2 R n such that Then T (x ) and T (x 2 ) 2 T (a + a 2 2 ) T (a T (x ) + a 2 T (x 2 )) T (T (a x + a 2 x 2 )) (wh?) a x + a 2 x 2 a T ( 2 ) + a 2 T ( 2 )

28 The Matrix of T Suppose that T : R n R n is invertible, the matrix of T is A, and the matrix of T is B Then for all R n, This means that T (T ()) T (B ) AB AB I Definition: the n n matrix A is invertible if there is an n n matrix B such that AB I Example Suppose that T : R 2 R 2 is a shear of factor 2 in the x-direction What is its inverse? [ [ 2 2 Soluton: The matrix of T is A ; let B 0 0 Then [ [ [ AB So the matrix of T is B, and [ [ T 2 x (v) 0 [ x 2 That is, T is a shear of factor 2 in the negative x-direction

29 The Inverse of a Matrix Theorem 32: Suppose A is an n n invertible matrix and B is an n n matrix such that AB I Then BA I, and if C is another n n matrix such that AC I, then C B Proof: Let e i, a i, b i, for i n, be the i-th column of the matrices I, A, B, respectivel I AB e i AB e i A b i, so R n span{e,, e n } span{a b,, A b n } span{a,, a n } Thus the columns of A span R n, and b the Big Theorem, the onl solution to A 0 is the trivial solution Now for an x R n : I (Ax) Ax (AB)(Ax) Ax A(BA)x Ax A(BAx x) 0 Thus BAx x, for all x, and it follows that BA I Now suppose AB I and AC I Then B(AB) B(AC) (BA)B (BA)C IB IC B C So for an invertible matrix A there is a unique matrix B such that AB I BA This matrix B is called the inverse of A and thus: Definitions: If A is an n n invertible matrix, A is called the inverse of A and denotes the unique matrix such that AA I A A (In other books ou ma see a one-step definition: A is invertible if there is a matrix B, called A, such that AB I BA) Also: another word for invertible is nonsingular Then a matrix is singular if it is not invertible

30 Properties of the Inverse Theorem 323 Extended: Let A, B, A,, A k be n n invertible matrices, let C, D be n m matrices Then: A is invertible and ( A ) A 2 A p is invertible for p, and (A p ) ( A ) p 3 A T is invertible and ( A T ) ( A ) T 4 If c 0, then ca is invertible and (ca) c A 5 AB is invertible and (AB) B A 6 A A 2 A k is invertible and (A A 2 A k ) A k 7 If AC AD then C D 8 If AC 0 nm then C 0 nm A 2 A Proof: here are some You can fill in the rest 3 AA I (AA ) T I T (A ) T A T I (A T ) (A ) T 5: check the given formula: AB(B A ) A(BB )A AIA AA I 7: AC AD A AC A AD IC ID C D 8 AC 0 nm A AC A 0 nm IC 0 nm C 0 nm The question remains: how to compute A? There turn out to be various was, but the most basic is called the Gaussian algorithm

31 The Gaussian Algorithm for Finding Matrix Inverses If AB I, then ABe i e i A b i e i So solving the sstem A b i e i will give ou b i, which is the i-th column of B A But instead of solving n separate sstems, all with the same coefficient matrix A, use row reduction on the augmented matrix (A I ) : reduce the left side until it becomes I, if possible Appl the same operations to the right side; when the left side becomes I the right side will become A That is (A I ) ( I A ) This method is actuall the most efficient wa for finding inverses If it is not possible to reduce A to I on the left side, then A is not invertible Example 2 A [A I (I A ) A

32 Example 3 Let then [A I A , So A [ I A

33 Example 4 Consider the sstem of equations in three variables x, x 2, x 3 : 2x + x 2 x 3 x + x 2 + x x 2 + 4x 3 3 This can be written as a single matrix equation A x b, with 2 x A, x x 2, b x 3 3 From Example 3, A It can be used to solve the sstem of equations in a different wa: A x b A (A x) A b (A A)x A b x A b That is, the solution to the sstem is x x x

34 The Inverse of a 2 2 Matrix Let [ a b A c d be the general 2 2 matrix Then [ A d b ad bc c a, if ad bc 0 Verif: ad bc [ [ d b a b ad bc c a c d [ da bc db bd ca + ac cb + ad [ 0 0 I Example 5 Let T : R 2 R 2 be a rotation of θ counterclockwise around the origin Then the matrix of T is [ cos θ sin θ R θ sin θ cos θ and the matrix of T is R [ cos θ cos 2 θ + sin 2 θ sin θ θ sin θ cos θ [ cos( θ) sin( θ) sin( θ) cos( θ) R θ That is, the inverse of a rotation of θ counterclockwise around the origin is a rotation of θ clockwise around the origin

35 Invertible Coefficient Matrices and Sstems of Equations Theorem 324: Let A be an n n matrix Then the following statements are equivalent A is invertible 2 A x b has a unique solution for all b R n : x A b 3 A x 0 has onl the trivial solution Proof: as in Example 4, it is simple calculation to show that () (2) (3) To complete the ccle of implications we need to show (3) () : if the onl solution to A x 0 is x 0, then the reduced echelon form of A must be I B the Gaussian algorithm, A exists The Big Theorem, Version 3 Theorem 325: Let A {a, a 2,, a n } be a set of n vectors in R n, let A [ a a 2 a n, and let T : R n R n be a linear transformation such that T (x) A x Then the following statements are equivalent: (a) A spans R n (b) A is linearl independent (c) A x b has a unique solution for all b in R n (d) T is onto (e) T is one-to-one (f) A is invertible

36 When are Diagonal or Triangular Matrices Invertible? One consequence of the Big Theorem is that a triangular matrix A is invertible if and onl if the product of its diagonal entries is not zero (Because its columns must be independent) That is, A is invertible a a 22 a 33 a nn 0 and it is possible b inspection to tell if a triangular matrix diagonal, upper triangular, or lower triangular is invertible So if U 0 2 9, L 3 0 0, D 0 5 0, then U and D are invertible, but L is not Inverses of Diagonal or Triangular Matrices Invertible The inverses of these matrices are of the same form That is, the inverse of an invertible diagonal matrix is another diagonal matrix, the inverse of an invertible upper triangular matrix is another upper triangular matrix, and the inverse of an invertible lower triangular matrix is another lower triangular matrix For example, with U and D as above: U , D

### Introduction to Matrices for Engineers

Introduction to Matrices for Engineers C.T.J. Dodson, School of Mathematics, Manchester Universit 1 What is a Matrix? A matrix is a rectangular arra of elements, usuall numbers, e.g. 1 0-8 4 0-1 1 0 11

### Inverses and powers: Rules of Matrix Arithmetic

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

### 12.3 Inverse Matrices

2.3 Inverse Matrices Two matrices A A are called inverses if AA I A A I where I denotes the identit matrix of the appropriate size. For example, the matrices A 3 7 2 5 A 5 7 2 3 If we think of the identit

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

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

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

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

### 2.1: MATRIX OPERATIONS

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

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

### 4. MATRICES Matrices

4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

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

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

### Diagonal, Symmetric and Triangular Matrices

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

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

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

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

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

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

### Lecture 2 Matrix Operations

Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or

### Matrix Inverse and Determinants

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

### Matrices, transposes, and inverses

Matrices, transposes, and inverses Math 40, Introduction to Linear Algebra Wednesday, February, 202 Matrix-vector multiplication: two views st perspective: A x is linear combination of columns of A 2 4

### LECTURE 1 I. Inverse matrices We return now to the problem of solving linear equations. Recall that we are trying to find x such that IA = A

LECTURE I. Inverse matrices We return now to the problem of solving linear equations. Recall that we are trying to find such that A = y. Recall: there is a matri I such that for all R n. It follows that

### EC9A0: Pre-sessional Advanced Mathematics Course

University of Warwick, EC9A0: Pre-sessional Advanced Mathematics Course Peter J. Hammond & Pablo F. Beker 1 of 55 EC9A0: Pre-sessional Advanced Mathematics Course Slides 1: Matrix Algebra Peter J. Hammond

### A matrix over a field F is a rectangular array of elements from F. The symbol

Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F) denotes the collection of all m n matrices over F Matrices will usually be denoted

### Lecture Notes 1: Matrix Algebra Part B: Determinants and Inverses

University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 57 Lecture Notes 1: Matrix Algebra Part B: Determinants and Inverses Peter J. Hammond email: p.j.hammond@warwick.ac.uk Autumn 2012,

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

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

### Lecture Notes: Matrix Inverse. 1 Inverse Definition

Lecture Notes: Matrix Inverse Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Inverse Definition We use I to represent identity matrices,

### Math 313 Lecture #10 2.2: The Inverse of a Matrix

Math 1 Lecture #10 2.2: The Inverse of a Matrix Matrix algebra provides tools for creating many useful formulas just like real number algebra does. For example, a real number a is invertible if there is

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

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

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

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

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

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

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

### Linear Dependence Tests

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

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

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

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

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

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

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

### Lecture 6. Inverse of Matrix

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

### Mathematics Notes for Class 12 chapter 3. Matrices

1 P a g e Mathematics Notes for Class 12 chapter 3. Matrices A matrix is a rectangular arrangement of numbers (real or complex) which may be represented as matrix is enclosed by [ ] or ( ) or Compact form

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

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

### NOTES on LINEAR ALGEBRA 1

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

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

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

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

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

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

### Lecture 23: The Inverse of a Matrix

Lecture 23: The Inverse of a Matrix Winfried Just, Ohio University March 9, 2016 The definition of the matrix inverse Let A be an n n square matrix. The inverse of A is an n n matrix A 1 such that A 1

### Linear Algebraic Equations, SVD, and the Pseudo-Inverse

Linear Algebraic Equations, SVD, and the Pseudo-Inverse Philip N. Sabes October, 21 1 A Little Background 1.1 Singular values and matrix inversion For non-smmetric matrices, the eigenvalues and singular

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

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

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

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

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

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

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

### The Solution of Linear Simultaneous Equations

Appendix A The Solution of Linear Simultaneous Equations Circuit analysis frequently involves the solution of linear simultaneous equations. Our purpose here is to review the use of determinants to solve

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

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

### THREE DIMENSIONAL GEOMETRY

Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,

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

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

### 1 Determinants. Definition 1

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

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

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

### Identifying second degree equations

Chapter 7 Identifing second degree equations 7.1 The eigenvalue method In this section we appl eigenvalue methods to determine the geometrical nature of the second degree equation a 2 + 2h + b 2 + 2g +

### Inverses. Stephen Boyd. EE103 Stanford University. October 27, 2015

Inverses Stephen Boyd EE103 Stanford University October 27, 2015 Outline Left and right inverses Inverse Solving linear equations Examples Pseudo-inverse Left and right inverses 2 Left inverses a number

### Introduction to Matrix Algebra I

Appendix A Introduction to Matrix Algebra I Today we will begin the course with a discussion of matrix algebra. Why are we studying this? We will use matrix algebra to derive the linear regression model

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

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

### 7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Style. Learning Outcomes

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 =. Similarly a square matrix A may have an inverse B = A where AB =

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

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

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

### Section 5: The Jacobian matrix and applications. S1: Motivation S2: Jacobian matrix + differentiability S3: The chain rule S4: Inverse functions

Section 5: The Jacobian matri and applications. S1: Motivation S2: Jacobian matri + differentiabilit S3: The chain rule S4: Inverse functions Images from Thomas calculus b Thomas, Wier, Hass & Giordano,

### Matrix Algebra and Applications

Matrix Algebra and Applications Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Matrix Algebra and Applications 1 / 49 EC2040 Topic 2 - Matrices and Matrix Algebra Reading 1 Chapters

### GCE Mathematics (6360) Further Pure unit 4 (MFP4) Textbook

Version 36 klm GCE Mathematics (636) Further Pure unit 4 (MFP4) Textbook The Assessment and Qualifications Alliance (AQA) is a company limited by guarantee registered in England and Wales 364473 and a

### Topic 1: Matrices and Systems of Linear Equations.

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

### 6. Cholesky factorization

6. Cholesky factorization EE103 (Fall 2011-12) triangular matrices forward and backward substitution the Cholesky factorization solving Ax = b with A positive definite inverse of a positive definite matrix

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

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

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

### The Inverse of a Square Matrix

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

### COMPONENTS OF VECTORS

COMPONENTS OF VECTORS To describe motion in two dimensions we need a coordinate sstem with two perpendicular aes, and. In such a coordinate sstem, an vector A can be uniquel decomposed into a sum of two

### LINEAR ALGEBRA. September 23, 2010

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

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

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

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

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

Facts About Eigenvalues By Dr David Butler Definitions Suppose A is an n n matrix An eigenvalue of A is a number λ such that Av = λv for some nonzero vector v An eigenvector of A is a nonzero vector v

### Complex Numbers. w = f(z) z. Examples

omple Numbers Geometrical Transformations in the omple Plane For functions of a real variable such as f( sin, g( 2 +2 etc ou are used to illustrating these geometricall, usuall on a cartesian graph. If

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

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

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

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

### L1-2. Special Matrix Operations: Permutations, Transpose, Inverse, Augmentation 12 Aug 2014

L1-2. Special Matrix Operations: Permutations, Transpose, Inverse, Augmentation 12 Aug 2014 Unfortunately, no one can be told what the Matrix is. You have to see it for yourself. -- Morpheus Primary concepts:

### Some Lecture Notes and In-Class Examples for Pre-Calculus:

Some Lecture Notes and In-Class Examples for Pre-Calculus: Section.7 Definition of a Quadratic Inequality A quadratic inequality is any inequality that can be put in one of the forms ax + bx + c < 0 ax