Linear Algebra Lecture 22.

Slides:



Advertisements
Similar presentations
5.4 Basis And Dimension.
Advertisements

5.1 Real Vector Spaces.
4 4.3 © 2012 Pearson Education, Inc. Vector Spaces LINEARLY INDEPENDENT SETS; BASES.
THE DIMENSION OF A VECTOR SPACE
Subspaces, Basis, Dimension, Rank
Linear Algebra Lecture 25.
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
Section 4.1 Vectors in ℝ n. ℝ n Vectors Vector addition Scalar multiplication.
A matrix equation has the same solution set as the vector equation which has the same solution set as the linear system whose augmented matrix is Therefore:
Chapter Content Real Vector Spaces Subspaces Linear Independence
Linear Equations in Linear Algebra
1 1.7 © 2016 Pearson Education, Inc. Linear Equations in Linear Algebra LINEAR INDEPENDENCE.
5.5 Row Space, Column Space, and Nullspace
4.6: Rank. Definition: Let A be an mxn matrix. Then each row of A has n entries and can therefore be associated with a vector in The set of all linear.
4 © 2012 Pearson Education, Inc. Vector Spaces 4.4 COORDINATE SYSTEMS.
4.3 Linearly Independent Sets; Bases
Arab Open University Faculty of Computer Studies M132: Linear Algebra
Elementary Linear Algebra Anton & Rorres, 9th Edition
1.7 Linear Independence. in R n is said to be linearly independent if has only the trivial solution. in R n is said to be linearly dependent if there.
4.5: The Dimension of a Vector Space. Theorem 9 If a vector space V has a basis, then any set in V containing more than n vectors must be linearly dependent.
4 4.5 © 2016 Pearson Education, Inc. Vector Spaces THE DIMENSION OF A VECTOR SPACE.
4 Vector Spaces 4.1 Vector Spaces and Subspaces 4.2 Null Spaces, Column Spaces, and Linear Transformations 4.3 Linearly Independent Sets; Bases 4.4 Coordinate.
Chapter 5 Chapter Content 1. Real Vector Spaces 2. Subspaces 3. Linear Independence 4. Basis and Dimension 5. Row Space, Column Space, and Nullspace 6.
Sec Sec Sec 4.4 CHAPTER 4 Vector Spaces Let V be a set of elements with vector addition and multiplication by scalar is a vector space if these.
4 4.1 © 2012 Pearson Education, Inc. Vector Spaces VECTOR SPACES AND SUBSPACES.
 Matrix Operations  Inverse of a Matrix  Characteristics of Invertible Matrices …
7.3 Linear Systems of Equations. Gauss Elimination
Eigenvalues and Eigenvectors
Vector Spaces B.A./B.Sc. III: Mathematics (Paper II) 1 Vectors in Rn
Elementary Linear Algebra Anton & Rorres, 9th Edition
Linear Algebra Lecture 26.
Eigenvalues and Eigenvectors
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Chapter 2 Simultaneous Linear Equations (cont.)
Lecture 7 Vector Space Last Time - Properties of Determinants
Row Space, Column Space, and Nullspace
1.7 Linear Independence 线性无关
VECTOR SPACES AND SUBSPACES
Elementary Linear Algebra
4.6: Rank.
1.3 Vector Equations.
Linear Algebra Lecture 37.
Linear Algebra Lecture 39.
Linear Algebra Lecture 21.
Elementary Linear Algebra
Elementary Linear Algebra Anton & Rorres, 9th Edition
Elementary Linear Algebra
Properties of Solution Sets
Linear Algebra Lecture 24.
Linear Algebra Lecture 20.
EIGENVECTORS AND EIGENVALUES
Elementary Linear Algebra Anton & Rorres, 9th Edition
Vector Spaces 1 Vectors in Rn 2 Vector Spaces
Linear Algebra Lecture 41.
Linear Algebra Lecture 7.
Chapter 4 Vector Spaces 4.1 Vector spaces and Subspaces
RAYAT SHIKSHAN SANSTHA’S S. M. JOSHI COLLEGE HADAPSAR, PUNE
LINEAR INDEPENDENCE Definition: An indexed set of vectors {v1, …, vp} in is said to be linearly independent if the vector equation has only the trivial.
Linear Algebra Lecture 35.
Eigenvalues and Eigenvectors
Vector Spaces RANK © 2012 Pearson Education, Inc..
General Vector Spaces I
THE DIMENSION OF A VECTOR SPACE
Elementary Linear Algebra Anton & Rorres, 9th Edition
Null Spaces, Column Spaces, and Linear Transformations
NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS
Linear Equations in Linear Algebra
Vector Spaces COORDINATE SYSTEMS © 2012 Pearson Education, Inc.
Eigenvalues and Eigenvectors
CHAPTER 4 Vector Spaces Linear combination Sec 4.3 IF
Presentation transcript:

Linear Algebra Lecture 22

Vector Spaces

Linearly Independent Sets; Bases

Definition Let V be an arbitrary nonempty set of objects on which two operations are defined, addition and multiplication by scalars.

If the following axioms are satisfied by all objects u, v, w in V and all scalars l and m, then we call V a vector space.

1. u + v is in V 2. u + v = v + u Axioms of Vector Space For any set of vectors u, v, w in V and scalars l, m, n: 1. u + v is in V 2. u + v = v + u

3. u + (v + w) = (u + v) + w 4. There exist a zero vector 0 such that 0 + u = u + 0 = u 5. There exist a vector –u in V such that -u + u = 0 = u + (-u)

6. (l u) is in V 7. l (u + v)= l u + l v 8. m (n u) = (m n) u = n (m u) 9. (l +m) u= I u+ m u 10. 1u = u where 1 is the multiplicative identity

Definition A subset W of a vector space V is called a subspace of V if W itself is a vector space under the addition and scalar multiplication defined on V.

Theorem If W is a set of one or more vectors from a vector space V, then W is subspace of V if and only if the following conditions hold:

(a) If u and v are vectors in W, then u + v is in W continued (a) If u and v are vectors in W, then u + v is in W (b) If k is any scalar and u is any vector in W, then k u is in W.

Nul A = {x: x is in Rn and Ax = 0} Definition The null space of an m x n matrix A (Nul A) is the set of all solutions of the hom equation Ax = 0 Nul A = {x: x is in Rn and Ax = 0}

Definition The column space of an m x n matrix A (Col A) is the set of all linear combinations of the columns of A.

Definition The column space of an m x n matrix A (Col A) is the set of all linear combinations of the columns of A.

continued If A = [a1 … an], then Col A = Span {a1 ,… , an }

Linearly Independent Sets; Bases

Definition An indexed set of vectors {v1,…, vp} in V is said to be linearly independent if the vector equation has only the trivial solution, c1=0, c2=0,…,cp=0

Definition The set {v1,…,vp} is said to be linearly dependent if (1) has a nontrivial solution, that is, if there are some weights, c1,…,cp, not all zero, such that (1) holds. In such a case, (1) is called a linear dependence relation among v1, … , vp.

Theorem An indexed set { v1, … , vp } of two or more vectors, with , is linearly dependent if and only if some vj (with ) is a linear combination of the preceding vectors, v1, … , vj-1.

{p 1, p 2, p 3} is linearly dependent in P because p3 = 4p1 – p2. Example 1 Let p1 (t) = 1, p 2(t) = t and p 3 (t) = 4 – t. Then {p 1, p 2, p 3} is linearly dependent in P because p3 = 4p1 – p2.

Example 2 The set {Sint,Cost} is linearly independent in C[0,1] because Sint and Cost are not multiples of one another as vectors in C [0,1]. …

is linearly dependent because of the identity: Sin 2t = 2 Sin t Cos t, continued However, {Sint Cost,Sin2t} is linearly dependent because of the identity: Sin 2t = 2 Sin t Cos t, for all t.

B = {b1,…, bp} in V is a basis for H if … Definition Let H be a subspace of a vector space V. An indexed set of vectors B = {b1,…, bp} in V is a basis for H if …

continued B is a linearly independent set, and the subspace spanned by B coincides with H; that is, H = Span {b1,...,bp }.

Example 3 Let A be an invertible n x n matrix – say, A = [a1 … an]. Then the columns of A form a basis for Rn because they are linearly independent and they span Rn, by the Invertible Matrix Theorem.

The set {e1, …, en} is called the standard basis for Rn. Example 4 Let e1,…, en be the columns of the identity matrix, In. That is, The set {e1, …, en} is called the standard basis for Rn.

Standard Bases for R3 x1 x2 x3 e1 e2 e3

Determine if {v1, v2, v3} is a basis for R3. Example 5 Determine if {v1, v2, v3} is a basis for R3.

Example 6 Let S = {1, t, t2, …, tn}. Verify that S is a basis for Pn. This basis is called the standard bases for Pn.

Standard Bases for P2 y y = t2 y = 1 t y = t

Check whether the set of vectors Example 7 Check whether the set of vectors {(2, -3, 1), (4, 1, 1), (0, -7, 1)} is a basis for R3 ?

Check whether the set of vectors Example 8 Check whether the set of vectors {-4  + 1 t + 3 t2, 6  + 5 t + 2 t2, 8 + 4 t + 1 t2} is a basis for P2?

is a basis for the vector space V of all 2 x 2 matrices. Example 9 Show that the set is a basis for the vector space V of all 2 x 2 matrices.

is a basis for the vector space V of all 2 x 2 matrices. Example 10 Show that the set is a basis for the vector space V of all 2 x 2 matrices.

Example 11 Note that v3 = 5v1 + 3v2 and show that Span {v1, v2, v3} = Span {v1, v2}. Then find a basis for the subspace H.

Spanning Set Theorem

Let S = {v1, … , vp} be a set in V and let H = Span {v1, …, vp}. (a) If one of the vectors in S, say vk, is a linear combination of the remaining vectors in S, then the set formed from S by removing vk still spans H. (b) If H {0}, some subset of S is a basis for H.

Procedure The procedure for finding a subset of S that is a basis for W = span S is as follows: 1. Write the Equation, c1v1 + c2v2 + …+ cn vn = 0

2. Construct the augmented matrix associated with the continued 2. Construct the augmented matrix associated with the homogeneous system of equation and transform it to reduced row echelon form.

continued 3. The vectors corresponding to the columns containing the leading 1’s form a basis for W = span S.

then { v1 , v3 , v4} is a basis for span S. Thus if S = {v1, v2,…, v6} and the leading 1’s occur in columns 1, 3, and 4, then { v1 , v3 , v4} is a basis for span S.

Let S = {v1, v2, v3, v4, v5} be a set of vectors in R4, where Example 12 Let S = {v1, v2, v3, v4, v5} be a set of vectors in R4, where v1 = (1,2,-2,1), v2 = (-3,0,-4,3), v3 = (2,1,1,-1), v4 = (-3,3,-9,6), and v5 = (9,3,7,-6). Find basis for W = span S.

Example 13

Example 14 Is {v1, v2} a basis for H?

Solution Neither v1 nor v2 is in H, so {v1, v2} cannot be a basis for H. In fact, {v1, v2} is a basis for the plane of all vectors of the form (c1, c2, 0), but H is only a line.

Linear Algebra Lecture 22