1.7 Linear Independence 线性无关

Slides:



Advertisements
Similar presentations
Linear Equations in Linear Algebra
Advertisements

5.3 Linear Independence.
4 4.3 © 2012 Pearson Education, Inc. Vector Spaces LINEARLY INDEPENDENT SETS; BASES.
THE DIMENSION OF A VECTOR SPACE
Linear Equations in Linear Algebra
4 4.2 © 2012 Pearson Education, Inc. Vector Spaces NULL SPACES, COLUMN SPACES, AND LINEAR TRANSFORMATIONS.
1 1.4 Linear Equations in Linear Algebra THE MATRIX EQUATION © 2016 Pearson Education, Inc.
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:
Linear Equations in Linear Algebra
1 1.7 © 2016 Pearson Education, Inc. Linear Equations in Linear Algebra LINEAR INDEPENDENCE.
Orthogonality and Least Squares
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.3 Linearly Independent Sets; Bases
Linear Algebra 线性代数. Linear Algebra Chapter 1 Linear Equations 线性方程(组) Chapter 2 Matrix Algebra 矩阵代数 Chapter 3 Determinants 行列式 Chapter 4 Vector Spaces.
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.
HOMOGENEOUS LINEAR SYSTEMS (A different focus) Until now we have looked at the equation with the sole aim of computing its solutions, and we have been.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
4 4.5 © 2016 Pearson Education, Inc. Vector Spaces THE DIMENSION OF A VECTOR SPACE.
The Matrix Equation A x = b (9/16/05) Definition. If A is an m  n matrix with columns a 1, a 2,…, a n and x is a vector in R n, then the product of A.
1 1.4 Linear Equations in Linear Algebra THE MATRIX EQUATION © 2016 Pearson Education, Ltd.
1 1.3 © 2016 Pearson Education, Ltd. Linear Equations in Linear Algebra VECTOR EQUATIONS.
 Matrix Operations  Inverse of a Matrix  Characteristics of Invertible Matrices …
REVIEW Linear Combinations Given vectors and given scalars
1.4 The Matrix Equation Ax = b
Eigenvalues and Eigenvectors
Linear Equations 1.1 System of linear Equations
Linear Equations in Linear Algebra
Elementary Linear Algebra Anton & Rorres, 9th Edition
Linear Algebra Lecture 26.
Eigenvalues and Eigenvectors
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Chapter 2 Simultaneous Linear Equations (cont.)
Row Space, Column Space, and Nullspace
The Matrix of a Linear Transformation (9/30/05)
Euclidean Inner Product on Rn
Linear Independence Prepared by Vince Zaccone
Linear Algebra Lecture 22.
Linear Equations in Linear Algebra
Elementary Linear Algebra
4.6: Rank.
Orthogonality and Least Squares
1.3 Vector Equations.
Linear Algebra Lecture 37.
Linear Algebra Lecture 39.
What can we know from RREF?
Linear Algebra Lecture 21.
The Inverse of a Matrix Prepared by Vince Zaccone
Elementary Linear Algebra
Linear Algebra Lecture 5.
Linear Algebra Lecture 24.
Linear Algebra Lecture 20.
Elementary Linear Algebra Anton & Rorres, 9th Edition
Linear Algebra Lecture 6.
Linear Algebra Lecture 7.
Chapter 4 Vector Spaces 4.1 Vector spaces and Subspaces
RAYAT SHIKSHAN SANSTHA’S S. M. JOSHI COLLEGE HADAPSAR, PUNE
Vector Spaces, Subspaces
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.
Vector Spaces RANK © 2012 Pearson Education, Inc..
THE DIMENSION OF A VECTOR SPACE
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
CHAPTER 4 Vector Spaces Linear combination Sec 4.3 IF
Presentation transcript:

1.7 Linear Independence 线性无关 THEOREM 4 The following statements are logically equivalent. a. For each b in Rm, the equation Ax = b has a solution. b. Each b in Rm is a linear combination of the column of A. c. The columns of A span Rm. d. A has a pivot position in every row.

DEFINITION A set {v1, v2, … , vp} in Rn is said to be linearly independent if the vector equation x1v1+ x2v2+ … + xpvp=0 has only the trivial solution. The set {v1, v2, … , vp} is said to be linearly dependent if there exist weights c1, c2, …, cp, not all zero, such that c1v1+ c2v2+ … + cpvp=0.

没有“线性有关”这个词,应该是“线性相关” A set is linearly dependent if and only if it is not linearly independent. 不是“线性独立” 没有“线性有关”这个词,应该是“线性相关” linearly dependent linearly independent

Linear dependence relation, 线性相关关系 c1v1+ c2v2+ … + cpvp=0 linearly dependent set, 线性相关组 {v1, v2, … , vp} is linearly dependent linearly independent set 线性无关组 {v1, v2, … , vp} is linearly independent

EXAMPLE 1 Let 1.Determine if the set {v1, v2, v3} is linearly independent. 2.If possible, find a linear dependence relation among v1, v2, v3. DOES x1v1+ x2v2+ x3v3=0 has only the trivial solution? linearly independent

linearly dependent 2v1-v2+v3=0

Linear Independence of Matrix Columns The columns of a matrix A are linearly independent if and only if the equation Ax=0 has only the trivial solution. Ax=0 

EXAMPLE 2 Determine if the column of the matrix are linearly independent.

Sets of One or Two Vectors A set containing only one vector – say, v – is linearly independent if and only if v is not the zero vector. A set of two vectors {v1, v2} is linearly dependent if at least one of the vectors is a multiple of the other. The set is linearly independent if and only if neither of the vectors is a multiple of the other.

THEOREM 7 Characterization of Linearly Dependent Sets A set S={v1, v2,…, vp} of two or more vectors is linearly dependent if and only if at least one of the vectors in S is a linear combination of the others.

A set S={v1, v2,…, vp} of two or more vectors is linearly dependent if and only if at least one of the vectors in S is a linear combination of the others. :The set {v1, v2, … , vp} is linearly dependent , so there exist weights c1, c2, …, cp, not all zero, such that c1v1+ c2v2+ … + cpvp=0.

THEOREM 7 Characterization of Linearly Dependent Sets A set S={v1, v2,…, vp} of two or more vectors is linearly dependent if and only if at least one of the vectors in S is a linear combination of the others. If S is linearly dependent and v10,then some vj is a linear combination of the preceding vectors, v1, v2,…, vj-1.

THEOREM 8 If a set contains more vectors than there are entries in each vector, then the set is linearly dependent. That is, any set {v1, v2,…, vp} in Rn is linearly dependent if p>n. THEOREM 9 If a set S={v1, v2,…, vp} in Rn contains the zero vector, then the set is linearly dependent.