Basis Hung-yi Lee.

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

Section 4.6 (Rank).
4 4.3 © 2012 Pearson Education, Inc. Vector Spaces LINEARLY INDEPENDENT SETS; BASES.
THE DIMENSION OF A VECTOR SPACE
Basis of a Vector Space (11/2/05)
ENGG2013 Unit 13 Basis Feb, Question 1 Find the value of c 1 and c 2 such that kshumENGG20132.
4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.
Subspaces, Basis, Dimension, Rank
Linear Algebra Lecture 25.
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.
Section 4.1 Vectors in ℝ n. ℝ n Vectors Vector addition Scalar multiplication.
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.
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.
Section 2.3 Properties of Solution Sets
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.
Chap. 4 Vector Spaces 4.1 Vectors in Rn 4.2 Vector Spaces
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.
 Matrix Operations  Inverse of a Matrix  Characteristics of Invertible Matrices …
7.3 Linear Systems of Equations. Gauss Elimination
Eigenvalues and Eigenvectors
Inverse of a Matrix Hung-yi Lee Textbook: Chapter 2.3, 2.4 Outline:
Vector Spaces B.A./B.Sc. III: Mathematics (Paper II) 1 Vectors in Rn
Eigenvalues and Eigenvectors
Lecture 7 Vector Space Last Time - Properties of Determinants
Linear Transformations
Row Space, Column Space, and Nullspace
Elementary Linear Algebra
Orthogonality and Least Squares
Linear Independence Prepared by Vince Zaccone
Linear Transformations
Linear Transformations
Basis and Dimension Basis Dimension Vector Spaces and Linear Systems
Linear Algebra Lecture 22.
Coordinate System Hung-yi Lee.
Elementary Linear Algebra
4.6: Rank.
Orthogonal Projection
Orthogonality and Least Squares
Linear Algebra Lecture 39.
What can we know from RREF?
2.III. Basis and Dimension
System of Linear Inequalities
Elementary Linear Algebra
Matrix Definitions It is assumed you are already familiar with the terms matrix, matrix transpose, vector, row vector, column vector, unit vector, zero.
Affine Spaces Def: Suppose
I.4 Polyhedral Theory (NW)
Elementary Linear Algebra Anton & Rorres, 9th Edition
Mathematics for Signals and Systems
Row-equivalences again
Properties of Solution Sets
Maths for Signals and Systems Linear Algebra in Engineering Lecture 6, Friday 21st October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Linear Algebra Lecture 24.
Maths for Signals and Systems Linear Algebra in Engineering Lectures 4-5, Tuesday 18th October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN.
Linear Transformations
Vector Spaces 1 Vectors in Rn 2 Vector Spaces
I.4 Polyhedral Theory.
How many solutions? Hung-yi Lee New Question:
Vector Spaces, Subspaces
Row-equivalences again
Vector Spaces RANK © 2012 Pearson Education, Inc..
THE DIMENSION OF A VECTOR SPACE
NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS
Orthogonality and Least Squares
Eigenvalues and Eigenvectors
Subspace Hung-yi Lee Think: beginning subspace.
Presentation transcript:

Basis Hung-yi Lee

Outline What is a basis for a subspace? Confirming that a set is a basis for a subspace Reference: Textbook 4.2

What is Basis?

Basis Why nonzero? Let V be a nonzero subspace of Rn. A basis B for V is a linearly independent generation set of V. {e1, e2, , en} is a basis for Rn. 1. {e1, e2, , en} is independent 2. {e1, e2, , en} generates Rn. (vector set) { 1 0 , 0 1 } is a basis for R2 { 1 1 , 1 −1 } { 1 3 , −3 1 } { 1 1 , 1 2 } …… any two independent vectors form a basis for R2

Basis The pivot columns of a matrix form a basis for its columns space. RREF pivot columns Col A = Span

Properties 1. A basis is the smallest generation set. 2. A basis is the largest independent vector set in the subspace. 3. Any two bases for a subspace contain the same number of vectors. The number of vectors in a basis for a nonzero subspace V is called dimension of V (dim V). Basis is a vector set When I say “large” or “small”, I mean the number of elelemtns in the set

Property 1 – Reduction Theorem A basis is the smallest generation set. If there is a generation set S for subspace V, The size of basis for V is smaller than or equal to S. Reduction Theorem There is a basis containing in any generation set S. S can be reduced to a basis for V by removing some vectors.

Property 1 – Reduction Theorem A basis is the smallest generation set. S can be reduced to a basis for V by removing some vectors. Suppose S = {u1, u2, , uk} is a generation set of subspace V Subspace 𝑉=𝑆𝑝𝑎𝑛 𝑆 Let A = [ u1 u2  uk ]. =𝐶𝑜𝑙 𝐴 The basis of Col A is the pivot columns of A Subset of S

Property 1 – Reduction Theorem A basis is the smallest generation set. = Span Subspace 𝑉=𝑆𝑝𝑎𝑛 𝑆 =𝐶𝑜𝑙 𝐴 𝑆= 1 −1 2 −3 , 2 −2 4 6 , −1 1 −3 2 , 2 2 2 0 , 1 3 0 3 , 2 6 3 9 Smallest generation set Generation set RREF 𝐴=

Property 2 – Extension Theorem A basis is the largest independent set in the subspace. If the size of basis is k, then you cannot find more than k independent vectors in the subspace. Extension Theorem Given an independent vector set S in the space S can be extended to a basis by adding more vectors Every subspace has a basis

Property 2 – Extension Theorem A basis is the largest independent set in the subspace. For a finite vector set S (a) S is contained in Span S (b) If a finite set S’ is contained in Span S, then Span S’ is also contained in Span S Because Span S is a subspace (c) For any vector z, Span S = Span S∪{z} if and only if z belongs to the Span S Basis is always in its subspace

Property 2 – Extension Theorem A basis is the largest independent set in the subspace. There is a subspace V Given a independent vector set S (elements of S are in V) If Span S = V, then S is a basis If Span S ≠ V, find v1 in V, but not in Span S S’ = S ⋃ {v1} is still an independent set If Span S’ = V, then S’ is a basis If Span S’ ≠ V, find v2 in V, but not in Span S’ S’’ = S’ ⋃ {v2} is still an independent set …… You will find the basis in the end.

Textbook P245 Property 3 Any two bases of a subspace V contain the same number of vectors Suppose {u1, u2, …, uk} and {w1, w2, …, wp} are two bases of V. Let A = [u1 u2  uk] and B = [w1 w2  wp]. Since {u1, u2, …, uk} spans V,  ci  Rk s.t. Aci = wi for all i  A[c1 c2  cp] = [w1 w2  wp]  AC = B …………………. Now Cx = 0 for some x  Rp  ACx = Bx = 0 B is independent vector set  x= 0  c1 c2  cp are independent ci  Rk  p  k Reversing the roles of the two bases one has k  p  p = k.

Property 3 Every basis of Rn has n vectors. The number of vectors in a basis for a subspace V is called the dimension of V, and is denoted dim V The dimension of zero subspace is 0 dim R2 =2 dim R3=3 Understand as how large your span is

Example Find dim V dim V = 3 Basis? 𝑥 1 =3 𝑥 2 −5 𝑥 3 +6 𝑥 4 dim V = 3 Basis? Independent vector set that generates V

More from Properties A basis is the smallest generation set. A vector set generates Rm must contain at least m vectors. Rm have a basis {e1, e2, , em} Because a basis is the smallest generation set Any other generation set has at least m vectors. Every subset of Rn with more than n vectors is L.D. (Section 1.7).  Every basis of Rn contains at most n vectors.  Every basis of Rn contains exactly n vectors. A basis is the largest independent set in the subspace. Any independent vector set in Rm contain at most m vectors.

Independent vector set Summary 雕塑 … 主要是使用雕(通過減除材料來造型)及塑(通過疊加材料來造型)的方式 …… (from wiki) Same size 刪去 疊加 Independent vector set https://www.lightnovel.cn/thread-743816-1-1.html Generation set Basis

Confirming that a set is a Basis

Intuitive Way Definition: A basis B for V is an independent generation set of V. Is C a basis of V ? Independent? yes Generation set? difficult generates V

Another way Given a subspace V, assume that we already know that dim V = k. Suppose S is a subset of V with k vectors If S is independent S is basis If S is a generation set S is basis 本來要兩個 但已經 dim, 一個就夠了 …. Dim V = 2 (parametric representation) Is C a basis of V ? C is a subset of V with 2 vectors C is a basis of V ? Independent? yes

Another way Assume that dim V = k. Suppose S is a subset of V with k vectors If S is independent S is basis By the extension theorem, we can add more vector into S to form a basis. However, S already have k vectors, so it is already a basis. If S is a generation set S is basis https://www.lightnovel.cn/thread-743816-1-1.html Proof Let S  V be L.I. and have k vectors.  By the Extension Theorem,  a basis B s.t. S  B.  B has k vectors, since dim. V = k.  B = S. Let S  V be a generating set for V and have k vectors.  By the Reduction Theorem,  a basis B  S. By the reduction theorem, we can remove some vector from S to form a basis. However, S already have k vectors, so it is already a basis.

Example Is B a basis of V ? Dim V = ? 3 B is a basis of V. Independent set in V? yes Dim V = ? 3 B is a basis of V.

Example Is B a basis of V = Span S ? 𝑑𝑖𝑚𝐴=3 𝐼𝑛𝑑𝑒𝑝𝑒𝑛𝑑𝑒𝑛𝑡 B is a subset of V with 3 vectors Is B a basis of V = Span S ? 𝑅 𝐴 = 1 0 0 1 0 −2/3 0 1/3 0 0 0 0 1 2/3 0 0 Textbook is tedious ??? 1. B  W (you check that rank A = rank [ A B ].) 2. B is L.I. (you check it). 3. dim. W = 3 (you check that rank A = 3.)  B is a basis of W. 𝑑𝑖𝑚𝐴=3 𝑅 𝐵 = 1 0 0 0 1 0 0 0 1 0 0 0 𝐼𝑛𝑑𝑒𝑝𝑒𝑛𝑑𝑒𝑛𝑡 B is a basis of V.

傅子興