PlanetMath: linearly independent

(more info)

Math for the people, by the people.

Main Menu

sections Encyclopædia
Papers
Books
Expositions

meta Requests (232)
Orphanage
Unclass'd
Unproven (519)
Corrections (22)
Classification

talkback Polls
Forums
Feedback
Bug Reports

downloads Snapshots
PM Book

information News
Docs
Wiki
ChangeLog
TODO List
Legalese
About

linearly independent

(Definition)

Let be a vector space over a field . We say that $v_1,\ldots, v_k\in V$ are linearly dependent if there exist scalars $\lambda_1,\ldots, \lambda_k\in F$ , not all zero, such that

$\displaystyle \lambda_1 v_1+ \cdots +\lambda_k v_k = 0 .$

If no such scalars exist, then we say that the vectors are linearly independent. More generally, we say that a (possibly infinite) subset $S\subset V$ is linearly independent if all finite subsets of

are linearly independent.

In the case of two vectors, linear dependence means that one of the vectors is a scalar multiple of the other. As an alternate characterization of dependence, we also have the following.

Proposition 1 Let $S\subset V$ be a subset of a vector space. Then, is linearly dependent if and only if there exists a $v\in S$ such that can be expressed as a linear combination of the vectors in the set $S\backslash \{v\}$ (all the vectors in other than ).

Remark. Linear independence can be defined more generally for modules over rings: if is a (left) module over a ring . A subset of is linearly independent if whenever $r_1m_1+\cdots +r_nm_n=0$ for $r_i\in R$ and $m_i\in M$ , then $r_1=\cdots =r_n=0$ .