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.

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

5.4 Basis And Dimension.
6.1 Vector Spaces-Basic Properties. Euclidean n-space Just like we have ordered pairs (n=2), and ordered triples (n=3), we also have ordered n-tuples.
Vector Spaces & Subspaces Kristi Schmit. Definitions A subset W of vector space V is called a subspace of V iff a.The zero vector of V is in W. b.W is.
5.3 Linear Independence.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Mathematics. Matrices and Determinants-1 Session.
4 4.3 © 2012 Pearson Education, Inc. Vector Spaces LINEARLY INDEPENDENT SETS; BASES.
Signal , Weight Vector Spaces and Linear Transformations
Signal , Weight Vector Spaces and Linear Transformations
THE DIMENSION OF A VECTOR SPACE
Chapter 5 Orthogonality
Basis of a Vector Space (11/2/05)
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
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
MA2213 Lecture 5 Linear Equations (Direct Solvers)
Linear Algebra Lecture 25.
Chapter 5: The Orthogonality and Least Squares
CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.
Linear Algebra Chapter 4 Vector Spaces.
Chapter 5 General Vector Spaces.
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
Chapter 2: Vector spaces
Vectors in R n a sequence of n real number An ordered n-tuple: the set of all ordered n-tuple  n-space: R n Notes: (1) An n-tuple can be viewed.
Section 4.1 Vectors in ℝ n. ℝ n Vectors Vector addition Scalar multiplication.
Chapter 3 Vector Spaces. The operations of addition and scalar multiplication are used in many contexts in mathematics. Regardless of the context, however,
Vectors CHAPTER 7. Ch7_2 Contents  7.1 Vectors in 2-Space 7.1 Vectors in 2-Space  7.2 Vectors in 3-Space 7.2 Vectors in 3-Space  7.3 Dot Product 7.3.
Chapter Content Real Vector Spaces Subspaces Linear Independence
1 1.3 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra VECTOR EQUATIONS.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
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.
Chap. 5 Inner Product Spaces 5.1 Length and Dot Product in R n 5.2 Inner Product Spaces 5.3 Orthonormal Bases: Gram-Schmidt Process 5.4 Mathematical Models.
4 © 2012 Pearson Education, Inc. Vector Spaces 4.4 COORDINATE SYSTEMS.
Chap. 4 Vector Spaces 4.1 Vectors in Rn 4.2 Vector Spaces
1 MAC 2103 Module 8 General Vector Spaces I. 2 Rev.F09 Learning Objectives Upon completing this module, you should be able to: 1. Recognize from the standard.
4.3 Linearly Independent Sets; Bases
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.
Ch 6 Vector Spaces. Vector Space Axioms X,Y,Z elements of  and α, β elements of  Def of vector addition Def of multiplication of scalar and vector These.
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.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.
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
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.
 Matrix Operations  Inverse of a Matrix  Characteristics of Invertible Matrices …
Vector Spaces B.A./B.Sc. III: Mathematics (Paper II) 1 Vectors in Rn
Linear Algebra review (optional)
Linear Algebra Lecture 26.
Matrix Operations SpringSemester 2017.
Section 4.1: Vector Spaces and Subspaces
Section 4.1: Vector Spaces and Subspaces
Basis and Dimension Basis Dimension Vector Spaces and Linear Systems
Linear Equations in Linear Algebra
Linear Algebra Chapter 4 Vector Spaces.
1.3 Vector Equations.
Signal & Weight Vector Spaces
Affine Spaces Def: Suppose
I.4 Polyhedral Theory (NW)
Elementary Linear Algebra
Linear Algebra Lecture 24.
Linear Algebra Lecture 20.
Vector Spaces 1 Vectors in Rn 2 Vector Spaces
I.4 Polyhedral Theory.
Matrix Operations SpringSemester 2017.
Row-equivalences again
Eigenvalues and Eigenvectors
Vector Spaces RANK © 2012 Pearson Education, Inc..
THE DIMENSION OF A VECTOR SPACE
Presentation transcript:

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 an element .v V called the “scalar multiple of v by ” satisfying (i) (ii) (iii) (iv) Notation : 0 K denotes the additive identity under +, K, - denotes the inverse of  under + denotes the identity under v denotes the inverse of v under

Examples Example 1 (Polynomials of degree n) V = set of all polynomials of order n The additive operation on vectors is defined as follows: V(K) is a vector space Proof For v= Now by continuity of addition on the real numbers

Examples:1 Proof continued follows from associativity of normal addition Closure is trivial Hence, is an Abelian group therefore Similarly for properties (ii)-(iv)

Examples:2 Example 2 (n dimensional vectors) Example 3 (Complex Numbers) Example 4 (Matrices) is the set of nm matrices is the set of nn matrices

Properties of Vector Spaces Theorem Proof Identity under + by axiom (ii) of vector spaces But Identity under  Therefore by the cancellation law for V K v

Properties:2 Theorem (i) = .( v) (ii) (-).( v) =.v Proof (i) Show by previous theorem and inverse under + Therefore, by axiom (ii) of vector spaces Also (.v) by inverse under  Therefore (.v) (.v) by the cancellation law for

Properties:3 Show = .( v) .(v  ( v)) by inverse under  Therefore, by axiom (i) vector spaces Now by previous theorem and axiom (iii) by above theorem .v  . v Also .v  (.v) by inverse under  Therefore, .v  . v= .v  (.v) . v= (.v) By the cancellation law for (ii) proof ??

Subspaces Definition Let WV such that W then W(K) is a subspace of V(K) if W is a vector space over K with the same definition of  and scalar multiple as V Clearly to show that W(K) is a subspace of V(K) we need only show that <W,> is a sub-group of <V, > and that Characterisation Theorem A non-empty subset W of V is a subspace of V iff .u  vW for all K, u,vW Proof () trivial since .uW

Subspaces:2 Proof (continued) () Taking =1 then  u,vW by axiom (iv) Taking =-1 then  u,vW and by a previous theorem (-1).u= (1.u)= u by axiom (iv) Therefore u  uW  by inverse under  Therefore K, uW taking gives .uW Therefore, taking =-1 gives  (1.u)W  uW by a previous theorem Hence, is a subgroup and as required

Examples of Subspaces Example 1 Let Then W(K) is a subspace of V(K)

Examples of Subspaces:2 Example 1 (continued) proof (i) Clearly W and WV (ii) For R and u,vW such that and then Example 2 (i) Clearly W and WV and 2R but W(K) is not a subspace of V(K)

Linear Combinations Definition If then where is a linear combination of S

Linear Combinations:2 Theorem For then is a subspace of V Proof since and by a previous theorem and hence If then and for some Then by axiom (i) by axiom (iii) by axiom (ii)

Linear Independence Definition A subset of V is linearly independent iff Otherwise if there exist one such that then are linearly dependent Example 1 is linearly dependent over R since Example 2 is linearly independent since

Linear Dependence in Matrices Theorem If and are the n column vectors of A then is linearly dependent over K if and only if Proof If is linearly dependent over K, then there exists (not all zero) such that Without loss of generality assume then Hence, performing a column operation where is added to column 1 gives a matrix with zero first column. Hence,

Matrices:2 Proof (continued) If then the system of equations has a non-trivial solution, But this is the same as saying that there exist (not all zero) such that By considering the transpose of A we obtain Corollary The n rows of a matrix are linearly dependent if and only if

Basis Definition A set is a basis for V iff (i) S is linearly independent over K (ii) Condition (ii) means that S is a spanning set for V Definition (Finitely Generated) A vector space V is said to be finitely generated if it has a Basis S with a finite number of elements V S

Examples of Basis Example 1 Let is a basis for V Then Linear independence: Spanning: is also a basis for V Proof ??

Examples of Basis:2 Example 2 Let then is a basis where Example 3 then

Dimension Theorem Every Basis of a finitely generated vector space has the same number of elements. Definition (Dimension) The number of elements in a basis for a finitely generated vector space V is called the dimension of V and denoted dim V. Examples then is a basis dim(V) = 3 Let then is a basis and dim(V)=4