Lecture 03. Math 22 Summer 2017 Section 2 June 26, 2017

Similar documents
Solutions of Linear system, vector and matrix equation

ICS 6N Computational Linear Algebra Vector Equations

1 Last time: inverses

Math 314H EXAM I. 1. (28 points) The row reduced echelon form of the augmented matrix for the system. is the matrix

Math 3191 Applied Linear Algebra

System of Linear Equations

Math 4377/6308 Advanced Linear Algebra

Advanced Linear Algebra Math 4377 / 6308 (Spring 2015) March 5, 2015

Math 4377/6308 Advanced Linear Algebra

Basic Linear Algebra Ideas. We studied linear differential equations earlier and we noted that if one has a homogeneous linear differential equation

Section 3.3. Matrix Equations

Math 3191 Applied Linear Algebra

Math 2331 Linear Algebra

Span and Linear Independence

Linear equations in linear algebra

Math 54 HW 4 solutions

MATH 152 Exam 1-Solutions 135 pts. Write your answers on separate paper. You do not need to copy the questions. Show your work!!!

1 Last time: multiplying vectors matrices

We know how to identify the location of a point by means of coordinates: (x, y) for a point in R 2, or (x, y,z) for a point in R 3.

Chapter 1. Vectors, Matrices, and Linear Spaces

Row Reduction and Echelon Forms

Chapter 1: Linear Equations

March 27 Math 3260 sec. 56 Spring 2018

Chapter 1: Linear Equations

Span & Linear Independence (Pop Quiz)

Linear Independence. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics

Section 1.5. Solution Sets of Linear Systems

3.4 Elementary Matrices and Matrix Inverse

if b is a linear combination of u, v, w, i.e., if we can find scalars r, s, t so that ru + sv + tw = 0.

MATH 304 Linear Algebra Lecture 20: The Gram-Schmidt process (continued). Eigenvalues and eigenvectors.

Lecture 2 Systems of Linear Equations and Matrices, Continued

1 Linear systems, existence, uniqueness

Linear Equations in Linear Algebra

Chapter 6. Orthogonality and Least Squares

LECTURES 4/5: SYSTEMS OF LINEAR EQUATIONS

Worksheet for Lecture 15 (due October 23) Section 4.3 Linearly Independent Sets; Bases

1 Last time: row reduction to (reduced) echelon form

Math 3C Lecture 25. John Douglas Moore

Lecture 9: Vector Algebra

Orthonormal Bases; Gram-Schmidt Process; QR-Decomposition

Linear Combination. v = a 1 v 1 + a 2 v a k v k

Linear Equations in Linear Algebra

Math 3C Lecture 20. John Douglas Moore

Math 3191 Applied Linear Algebra

Components and change of basis

EXAM. Exam #2. Math 2360 Summer II, 2000 Morning Class. Nov. 15, 2000 ANSWERS

Linear Algebra MATH20F Midterm 1

Math 3013 Solutions to Problem Set 5

MATH SOLUTIONS TO PRACTICE PROBLEMS - MIDTERM I. 1. We carry out row reduction. We begin with the row operations

MATH 2331 Linear Algebra. Section 1.1 Systems of Linear Equations. Finding the solution to a set of two equations in two variables: Example 1: Solve:

Math 290, Midterm II-key

Announcements Monday, September 18

Algorithms to Compute Bases and the Rank of a Matrix

Linear Independence Reading: Lay 1.7

Chapter 3. Directions: For questions 1-11 mark each statement True or False. Justify each answer.

Solutions to Math 51 Midterm 1 July 6, 2016

Chapter 1: Systems of Linear Equations

MATH 1553, SPRING 2018 SAMPLE MIDTERM 2 (VERSION B), 1.7 THROUGH 2.9

Lecture 3: Linear Algebra Review, Part II

VECTORS [PARTS OF 1.3] 5-1

Properties of Linear Transformations from R n to R m

Math 54 Homework 3 Solutions 9/

2. Every linear system with the same number of equations as unknowns has a unique solution.

OHSX XM511 Linear Algebra: Multiple Choice Exercises for Chapter 2

Linear independence, span, basis, dimension - and their connection with linear systems

Math 3191 Applied Linear Algebra

Worksheet for Lecture 15 (due October 23) Section 4.3 Linearly Independent Sets; Bases

MAT 242 CHAPTER 4: SUBSPACES OF R n

LECTURES 14/15: LINEAR INDEPENDENCE AND BASES

Matrix Algebra Lecture Notes. 1 What is Matrix Algebra? Last change: 18 July Linear forms

MTH 464: Computational Linear Algebra

Linear Algebra I Lecture 10

Math 415 Exam I. Name: Student ID: Calculators, books and notes are not allowed!

Chapter 2: Linear Independence and Bases

GENERAL VECTOR SPACES AND SUBSPACES [4.1]

Section 6.1. Inner Product, Length, and Orthogonality

Linear Methods (Math 211) - Lecture 2

Row Space, Column Space, and Nullspace

Midterm 1 Review. Written by Victoria Kala SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015

1111: Linear Algebra I

Vector Spaces. (1) Every vector space V has a zero vector 0 V

Review Let A, B, and C be matrices of the same size, and let r and s be scalars. Then

Math 102, Winter 2009, Homework 7

Lecture 1 Systems of Linear Equations and Matrices

IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET

Math 302 Test 1 Review

Diagonalization. Hung-yi Lee

Announcements Wednesday, November 15

Multiplying matrices by diagonal matrices is faster than usual matrix multiplication.

February 20 Math 3260 sec. 56 Spring 2018

Linear Equation: a 1 x 1 + a 2 x a n x n = b. x 1, x 2,..., x n : variables or unknowns

Matrix equation Ax = b

If A is a 4 6 matrix and B is a 6 3 matrix then the dimension of AB is A. 4 6 B. 6 6 C. 4 3 D. 3 4 E. Undefined

Announcements August 31

Math 344 Lecture # Linear Systems

Choose three of: Choose three of: Choose three of:

March 19 - Solving Linear Systems

1 Last time: linear systems and row operations

MATH 1553, JANKOWSKI MIDTERM 2, SPRING 2018, LECTURE A

Mathematics 206 Solutions for HWK 13b Section 5.2

Transcription:

Lecture 03 Math 22 Summer 2017 Section 2 June 26, 2017

Just for today (10 minutes) Review row reduction algorithm (40 minutes) 1.3 (15 minutes) Classwork

Review row reduction algorithm

Review row reduction algorithm Use row reduction to put the following matrix is RREF.

Review row reduction algorithm Use row reduction to put the following matrix is RREF. 1 2 1 3 0 2 4 5 5 3 3 6 6 8 2 1 2 0 10/3 0 0 0 1 1/3 0 0 0 0 0 1

Review row reduction algorithm Use row reduction to put the following matrix is RREF. 1 2 1 3 0 2 4 5 5 3 3 6 6 8 2 1 2 0 10/3 0 0 0 1 1/3 0 0 0 0 0 1 How many pivots does this matrix have?

Review row reduction algorithm Use row reduction to put the following matrix is RREF. 1 2 1 3 0 2 4 5 5 3 3 6 6 8 2 1 2 0 10/3 0 0 0 1 1/3 0 0 0 0 0 1 How many pivots does this matrix have? How many free variables does this matrix have?

Review row reduction algorithm Use row reduction to put the following matrix is RREF. 1 2 1 3 0 2 4 5 5 3 3 6 6 8 2 1 2 0 10/3 0 0 0 1 1/3 0 0 0 0 0 1 How many pivots does this matrix have? How many free variables does this matrix have? Suppose this is the augmented matrix of a linear system. What can you say about the solution set?

Review row reduction algorithm Use row reduction to put the following matrix is RREF. 1 2 1 3 0 2 4 5 5 3 3 6 6 8 2 1 2 0 10/3 0 0 0 1 1/3 0 0 0 0 0 1 How many pivots does this matrix have? How many free variables does this matrix have? Suppose this is the augmented matrix of a linear system. What can you say about the solution set? Suppose this is the coefficient matrix of a linear system. What can you say about the solution set?

1.3 Vectors in Rn

1.3 Vectors in R n Recall vectors in R 2, R 3, R n.

1.3 Vectors in R n Recall vectors in R 2, R 3, R n. It is convenient in linear algebra to write vectors as column vectors.

1.3 Vectors in R n Recall vectors in R 2, R 3, R n. It is convenient in linear algebra to write vectors as column vectors. That is, as n 1 matrices.

1.3 Vectors in R n Recall vectors in R 2, R 3, R n. It is convenient in linear algebra to write vectors as column vectors. That is, as n 1 matrices. Recall the algebraic properties of vectors.

1.3 Vectors in R n Recall vectors in R 2, R 3, R n. It is convenient in linear algebra to write vectors as column vectors. That is, as n 1 matrices. Recall the algebraic properties of vectors. Examples?

1.3 Vectors in R n Recall vectors in R 2, R 3, R n. It is convenient in linear algebra to write vectors as column vectors. That is, as n 1 matrices. Recall the algebraic properties of vectors. Examples? What is the difference between a vector and a scalar?

1.3 Vectors in R n Recall vectors in R 2, R 3, R n. It is convenient in linear algebra to write vectors as column vectors. That is, as n 1 matrices. Recall the algebraic properties of vectors. Examples? What is the difference between a vector and a scalar? What does it mean for two vectors to be equal?

1.3 Linear combinations

1.3 Linear combinations Definition Given v 1,..., v p R n and given scalars c 1,..., c p R, we define the linear combination of v 1,..., v p with the weights c 1,..., c p by c 1 v 1 + + c p v p.

1.3 Linear combinations Definition Given v 1,..., v p R n and given scalars c 1,..., c p R, we define the linear combination of v 1,..., v p with the weights c 1,..., c p by c 1 v 1 + + c p v p. How can we interpret a linear combination of vectors geometrically?

1.3 Linear combinations Definition Given v 1,..., v p R n and given scalars c 1,..., c p R, we define the linear combination of v 1,..., v p with the weights c 1,..., c p by c 1 v 1 + + c p v p. How can we interpret a linear combination of vectors geometrically? Let a, b R and v 1 = [ ] 1 0 and v 2 = [ ] 0. 1

1.3 Linear combinations Definition Given v 1,..., v p R n and given scalars c 1,..., c p R, we define the linear combination of v 1,..., v p with the weights c 1,..., c p by c 1 v 1 + + c p v p. How can we interpret a linear combination of vectors geometrically? Let a, b R and v 1 = [ ] 1 0 and v 2 = [ ] 0. 1 What is av 1 + bv 2?

1.3 Linear span

1.3 Linear span Definition Let v 1,..., v p R n.

1.3 Linear span Definition Let v 1,..., v p R n. We define the span of a set of vectors as: Span{v 1,..., v p } := {c 1 v 1 + + c p v p : c 1,..., c p R}.

1.3 Linear span Definition Let v 1,..., v p R n. We define the span of a set of vectors as: Span{v 1,..., v p } := {c 1 v 1 + + c p v p : c 1,..., c p R}. Informally, the span of a set of vectors is the set of all linear combinations of those vectors.

1.3 Linear span Definition Let v 1,..., v p R n. We define the span of a set of vectors as: Span{v 1,..., v p } := {c 1 v 1 + + c p v p : c 1,..., c p R}. Informally, the span of a set of vectors is the set of all linear combinations of those vectors. Span {[ ] 1, 0 [ ] 0, 1 [ ]} 1 =? 1

1.3 Linear span Definition Let v 1,..., v p R n. We define the span of a set of vectors as: Span{v 1,..., v p } := {c 1 v 1 + + c p v p : c 1,..., c p R}. Informally, the span of a set of vectors is the set of all linear combinations of those vectors. {[ ] [ ] [ ]} 1 0 1 1 0 1 Span,, =? Span 0, 1, 1 0 1 1 0 0 2 =?

1.3 Some properties of span

1.3 Some properties of span Let u, v be nonzero vectors in R n.

1.3 Some properties of span Let u, v be nonzero vectors in R n. u, v Span{u, v}

1.3 Some properties of span Let u, v be nonzero vectors in R n. u, v Span{u, v} Span{u, v, 0} = Span{u, v}

1.3 Some properties of span Let u, v be nonzero vectors in R n. u, v Span{u, v} Span{u, v, 0} = Span{u, v} u ± v, cu Span{u, v}

1.3 Some properties of span Let u, v be nonzero vectors in R n. u, v Span{u, v} Span{u, v, 0} = Span{u, v} u ± v, cu Span{u, v} S, T R n and S T implies Span{S} Span{T }

1.3 Linear systems as linear combinations

1.3 Linear systems as linear combinations Consider the vector equation x 1 a 1 + + x n a n = b.

1.3 Linear systems as linear combinations Consider the vector equation x 1 a 1 + + x n a n = b. Consider the linear system whose augmented matrix has columns a i and b which we abbreviate [ ] a 1 a 2 b.

1.3 Linear systems as linear combinations Consider the vector equation x 1 a 1 + + x n a n = b. Consider the linear system whose augmented matrix has columns a i and b which we abbreviate [ ] a 1 a 2 b. Next time we will prove the fundamental result that... these objects both have the same solution set!

1.3 Linear systems as linear combinations Consider the vector equation x 1 a 1 + + x n a n = b. Consider the linear system whose augmented matrix has columns a i and b which we abbreviate [ ] a 1 a 2 b. Next time we will prove the fundamental result that... these objects both have the same solution set! This means that a vector b R m can be expressed as a linear combination of the vectors [ a 1,..., a n ] if any only if the linear system corresponding to a 1 a n b is consistent.

1.3 Classwork

1.3 Classwork Suppose [ ] a 1 a 2 a 3 b = 1 0 2 5 2 5 0 11 2 5 8 7 1 0 2 0 0 1 4/5 0 0 0 0 1

1.3 Classwork Suppose [ ] a 1 a 2 a 3 b = 1 0 2 5 2 5 0 11 2 5 8 7 Do there exist scalars x 1, x 2, x 3 R such that x 1 a 1 + x 2 a 2 + x 3 a 3 = b? 1 0 2 0 0 1 4/5 0 0 0 0 1

1.3 Classwork

1.3 Classwork Consider A = 2 0 6 1 8 5, and b = 1 2 1 10 3. 3

1.3 Classwork Consider A = 2 0 6 1 8 5, and b = 1 2 1 10 3. 3 Let W be the linear span of the columns of A.

1.3 Classwork Consider A = 2 0 6 1 8 5, and b = 1 2 1 10 3. 3 Let W be the linear span of the columns of A. Is b W?

1.3 Classwork Consider A = 2 0 6 1 8 5, and b = 1 2 1 10 3. 3 Let W be the linear span of the columns of A. Is b W? 0 Is 8 W? 2