THE DIMENSION OF A VECTOR SPACE

Slides:



Advertisements
Similar presentations
Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Advertisements

5.4 Basis And Dimension.
Section 4.6 (Rank).
4 4.3 © 2012 Pearson Education, Inc. Vector Spaces LINEARLY INDEPENDENT SETS; BASES.
Eigenvalues and Eigenvectors
THE DIMENSION OF A VECTOR SPACE
Dimension of a Vector Space (11/9/05) Theorem. If the vector space V has a basis consisting of n vectors, then any set of more than n vectors in V must.
Orthogonality and Least Squares
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
5 5.1 © 2012 Pearson Education, Inc. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
Linear Algebra Lecture 25.
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
4.1 Vector Spaces and Subspaces 4.2 Null Spaces, Column Spaces, and Linear Transformations 4.3 Linearly Independent Sets; Bases 4.4 Coordinate systems.
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
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:
A vector space containing infinitely many vectors can be efficiently described by listing a set of vectors that SPAN the space. eg: describe the solutions.
Linear Equations in Linear Algebra
AN ORTHOGONAL PROJECTION
1 1.7 © 2016 Pearson Education, Inc. Linear Equations in Linear Algebra LINEAR INDEPENDENCE.
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
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.
Vector Spaces RANK © 2016 Pearson Education, Inc..
4.8 Rank Rank enables one to relate matrices to vectors, and vice versa. Definition Let A be an m  n matrix. The rows of A may be viewed as row vectors.
4 © 2012 Pearson Education, Inc. Vector Spaces 4.4 COORDINATE SYSTEMS.
2 2.9 © 2016 Pearson Education, Inc. Matrix Algebra DIMENSION AND RANK.
4.3 Linearly Independent Sets; Bases
4.8 Rank Rank enables one to relate matrices to vectors, and vice versa. Definition Let A be an m  n matrix. The rows of A may be viewed as row vectors.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
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 4.2 © 2016 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
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.
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 …
REVIEW Linear Combinations Given vectors and given scalars
7.3 Linear Systems of Equations. Gauss Elimination
Eigenvalues and Eigenvectors
Linear Algebra Lecture 26.
Eigenvalues and Eigenvectors
CHARACTERIZATIONS OF INVERTIBLE MATRICES
VECTOR SPACES AND SUBSPACES
Orthogonality and Least Squares
Linear Independence Prepared by Vince Zaccone
Linear Algebra Lecture 22.
VECTOR SPACES AND SUBSPACES
Basis Hung-yi Lee.
4.6: Rank.
Orthogonality and Least Squares
Linear Algebra Lecture 37.
Linear Algebra Lecture 39.
Determinants CHANGE OF BASIS © 2016 Pearson Education, Inc.
Linear Algebra Lecture 21.
Affine Spaces Def: Suppose
I.4 Polyhedral Theory (NW)
Linear Algebra Lecture 24.
I.4 Polyhedral Theory.
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.
Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
Vector Spaces RANK © 2012 Pearson Education, Inc..
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.
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Orthogonality and Least Squares
Eigenvalues and Eigenvectors
VECTOR SPACES AND SUBSPACES
Presentation transcript:

THE DIMENSION OF A VECTOR SPACE Vector Spaces THE DIMENSION OF A VECTOR SPACE © 2012 Pearson Education, Inc.

DIMENSION OF A VECTOR SPACE Theorem 9: If a vector space V has a basis B , then any set in V containing more than n vectors must be linearly dependent. Proof: Let {u1, …, up} be a set in V with more than n vectors. The coordinate vectors [u1]B, …, [up]B form a linearly dependent set in , because there are more vectors (p) than entries (n) in each vector. © 2012 Pearson Education, Inc.

DIMENSION OF A VECTOR SPACE So there exist scalars c1, …, cp, not all zero, such that Since the coordinate mapping is a linear transformation, The zero vector in © 2012 Pearson Education, Inc.

DIMENSION OF A VECTOR SPACE The zero vector on the right displays the n weights needed to build the vector from the basis vectors in B. That is, . Since the ci are not all zero, {u1, …, up} is linearly dependent. Theorem 9 implies that if a vector space V has a basis B , then each linearly independent set in V has no more than n vectors. © 2012 Pearson Education, Inc.

DIMENSION OF A VECTOR SPACE Theorem 10: If a vector space V has a basis of n vectors, then every basis of V must consist of exactly n vectors. Proof: Let B1 be a basis of n vectors and B2 be any other basis (of V). Since B1 is a basis and B2 is linearly independent, B2 has no more than n vectors, by Theorem 9. Also, since B2 is a basis and B1 is linearly independent, B2 has at least n vectors. Thus B2 consists of exactly n vectors. © 2012 Pearson Education, Inc.

DIMENSION OF A VECTOR SPACE Definition: If V is spanned by a finite set, then V is said to be finite-dimensional, and the dimension of V, written as dim V, is the number of vectors in a basis for V. The dimension of the zero vector space {0} is defined to be zero. If V is not spanned by a finite set, then V is said to be infinite-dimensional. Example 1: Find the dimension of the subspace © 2012 Pearson Education, Inc.

DIMENSION OF A VECTOR SPACE H is the set of all linear combinations of the vectors , , , Clearly, , v2 is not a multiple of v1, but v3 is a multiple of v2. By the Spanning Set Theorem, we may discard v3 and still have a set that spans H. © 2012 Pearson Education, Inc.

SUBSPACES OF A FINITE-DIMENSIONAL SPACE Finally, v4 is not a linear combination of v1 and v2. So {v1, v2, v4} is linearly independent and hence is a basis for H. Thus dim . Theorem 11: Let H be a subspace of a finite-dimensional vector space V. Any linearly independent set in H can be expanded, if necessary, to a basis for H. Also, H is finite-dimensional and © 2012 Pearson Education, Inc.

SUBSPACES OF A FINITE-DIMENSIONAL SPACE Proof: If , then certainly . Otherwise, let be any linearly independent set in H. If S spans H, then S is a basis for H. Otherwise, there is some in H that is not in Span S. © 2012 Pearson Education, Inc.

SUBSPACES OF A FINITE-DIMENSIONAL SPACE But then will be linearly independent, because no vector in the set can be a linear combination of vectors that precede it (by Theorem 4). So long as the new set does not span H, we can continue this process of expanding S to a larger linearly independent set in H. But the number of vectors in a linearly independent expansion of S can never exceed the dimension of V, by Theorem 9. © 2012 Pearson Education, Inc.

THE BASIS THEOREM So eventually the expansion of S will span H and hence will be a basis for H, and . Theorem 12: Let V be a p-dimensional vector space, . Any linearly independent set of exactly p elements in V is automatically a basis for V. Any set of exactly p elements that spans V is automatically a basis for V. Proof: By Theorem 11, a linearly independent set S of p elements can be extended to a basis for V. © 2012 Pearson Education, Inc.

THE BASIS THEOREM But that basis must contain exactly p elements, since dim . So S must already be a basis for V. Now suppose that S has p elements and spans V. Since V is nonzero, the Spanning Set Theorem implies that a subset of S is a basis of V. Since dim , must contain p vectors. Hence . © 2012 Pearson Education, Inc.

THE DIMENSIONS OF NUL A AND COL A Let A be an matrix, and suppose the equation has k free variables. A spanning set for Nul A will produce exactly k linearly independent vectors—say, —one for each free variable. So is a basis for Nul A, and the number of free variables determines the size of the basis. © 2012 Pearson Education, Inc.

DIMENSIONS OF NUL A AND COL A Thus, the dimension of Nul A is the number of free variables in the equation , and the dimension of Col A is the number of pivot columns in A. Example 2: Find the dimensions of the null space and the column space of © 2012 Pearson Education, Inc.

DIMENSIONS OF NUL A AND COL A Solution: Row reduce the augmented matrix to echelon form: There are three free variable—x2, x4 and x5. Hence the dimension of Nul A is 3. Also dim Col because A has two pivot columns. © 2012 Pearson Education, Inc.