5.3 Linear Independence.

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.1 Real Vector Spaces.
More Vectors.
8.2 Kernel And Range.
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.
Signal , Weight Vector Spaces and Linear Transformations
Signal , Weight Vector Spaces and Linear Transformations
Eigenvalues and Eigenvectors
THE DIMENSION OF A VECTOR SPACE
Ch 7.4: Basic Theory of Systems of First Order Linear Equations
Ch 3.3: Linear Independence and the Wronskian
Orthogonality and Least Squares
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
Linear Equations in Linear Algebra
Ch 5.3: Series Solutions Near an Ordinary Point, Part II A function p is analytic at x 0 if it has a Taylor series expansion that converges to p in some.
Chapter 2 Simultaneous Linear Equations (cont.)
Sections 1.8/1.9: Linear Transformations
Chapter 5 General Vector Spaces.
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:
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.
Section 3.5 Lines and Planes in 3-Space. Let n = (a, b, c) ≠ 0 be a vector normal (perpendicular) to the plane containing the point P 0 (x 0, y 0, z 0.
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
Boyce/DiPrima 9th ed, Ch 4.1: Higher Order Linear ODEs: General Theory Elementary Differential Equations and Boundary Value Problems, 9th edition, by.
VECTORS (Ch. 12) Vectors in the plane Definition: A vector v in the Cartesian plane is an ordered pair of real numbers:  a,b . We write v =  a,b  and.
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.
Section 4.1 Initial-Value and Boundary-Value Problems
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.
is a linear combination of and depends upon and is called a DEPENDENT set.
5.4 Basis and Dimension The equations can be written by using MathType
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.
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.
Multipole Moments Section 41. Expand potential  in powers of 1/R 0.
An IVP would look like Second Order Linear DE’s. Thm. Existence of a Unique Solution Let a 0, a 1, a 2, and g(x) be continuous on an interval containing.
Vector Spaces B.A./B.Sc. III: Mathematics (Paper II) 1 Vectors in Rn
8.2 Kernel And Range.
CS479/679 Pattern Recognition Dr. George Bebis
Eigenvalues and Eigenvectors
7.4 - The Intersection of 2 Lines
Ch 4.1: Higher Order Linear ODEs: General Theory
1.7 Linear Independence 线性无关
SPANNING.
Vectors, Linear Combinations and Linear Independence
Linear Algebra Lecture 22.
Elementary Linear Algebra
1.3 Vector Equations.
Signal & Weight Vector Spaces
Linear Algebra Lecture 39.
Subspaces and Spanning Sets
Linear Equations in Linear Algebra
Signal & Weight Vector Spaces
Ch 4.1: Higher Order Linear ODEs: General Theory
Elementary Linear Algebra
Elementary Linear Algebra
Linear Algebra Lecture 20.
Vector Spaces 1 Vectors in Rn 2 Vector Spaces
Linear Algebra Lecture 7.
Vector Spaces, Subspaces
3.IV. Change of Basis 3.IV.1. Changing Representations of Vectors
Linear Equations in Linear Algebra
General Vector Spaces I
Elementary Linear Algebra Anton & Rorres, 9th Edition
Ch 7.4: Basic Theory of Systems of First Order Linear Equations
Linear Equations in Linear Algebra
Presentation transcript:

5.3 Linear Independence

Linear Independence Definition: If S = {v1,v2,...,vr} is a non empty set of vectors then the vector equation k1v1+k2v2+....+kr vr = 0 has at least one solution, k1=0, k2=0, ..., kr=0. If this is the only solution, then S is called a linearly independent set. If there are other solutions, then S is called a linearly dependent set.

Linear Independence Example: v1 = (2,-1,0,3), v2=(1,2,5,-1), v3=(7,-1,5,8) S={v1, v2, v3} is linearly dependent since 3v1+v2 – v3 =0. S = {p1=1-x, p2=5+3x-2x2, p3=1+3x-x2} is a linearly dependent since 3p1-p2+2p3=0 S={i, j, k}, where i=(1,0,0), j=(0,1,0), k=(0,0,1), is a linearly independent since 0i + 0j + 0k = 0;

Linear Independence Theorem 5.3.1: A set S with two or more vectors is a) Linearly dependent iff at least one of the vectors in S is expressible as a linear combination of the other vectors in S b) Linearly independent iff no vectors in S is expressible as a linear combination of the other vector in S. Example: V1 = (2, -1, 0, 3), V2 = (1, 2, 5, -1), V3 = (7, -1, 5, 8) V1 = -⅓ V2 + ⅓ V3, V2 = -3V1+V3, V3 = -3V1+V2

Linear Independence Theorem: a) A finite set of vectors that contain the zero vectors is linearly dependent b) A set with exactly two vectors is linearly independent iff neither vector is a scalar multiple of the other.

Geometric Interpretation of Linear Independence In R2 or R3, a set of two vectors is linearly independent iff the vectors do not lie on the same line when they are placed with their initial points at the origin.

Geometric Interpretation of Linear Independence In R3, a set of three vectors is linearly independent iff the vectors do not lie in the same plane when they placed with their initial points at the origin.

Geometric Interpretation of Linear Independence Theorem 5.3.3: Let S={v1,v2,...,vr} be a set vectors in Rn. If r>n, then S is linearly dependent. Proof: homoggeneous system of n equations in the r unknowns k1,...,kr. Since r>n, the system has nontrivial solutions. Therefore, S is a linearly dependent set.

Linear Independence of Functions

Linear Independence of Functions Theorem: If the functions f1, f2,..., fn have n-1 continuous derivatives on the interval (-~,~), and if the Wronskian of these functions is not identically zero on (-~,~), then these functions form a linearly independent set of vectors in C(n-1)(-~,~). Example: Linearly Independent Set in C1(-~,~) Show that f1=x and f2=sin x form a linearly independent set of vectors in C1(-~,~). The function does not have value 0 for all x in the interval (-~,~), f1 & f2 form a linearly independent set

Linear Independence of Functions Example: Linearly Independent Set in C2(-~,~) Show that f1=1, f2=ex, and f3=e2x form a linearly independent set of vectors in C2(-~,~). This function does not have value zero for all x in the interval (-~,~), so f1, f2, and f3 form a linearly independent set.