Linear independence and dependence

A set is linearly independent if only the trivial finite linear combination equals zero
Linear independence and dependence

Let XX be a over KK, and let MXM\subset X.

The set MM is linearly independent if for every finite subset {x1,,xm}M\{x_1,\dots,x_m\}\subset M and every choice of scalars α1,,αmK\alpha_1,\dots,\alpha_m\in K,

i=1mαixi=0α1==αm=0. \sum_{i=1}^m \alpha_i x_i = 0 \quad\Longrightarrow\quad \alpha_1=\cdots=\alpha_m=0.

If MM is not linearly independent, it is linearly dependent, i.e., there exists a finite subset and scalars, not all zero, giving a zero .

Linear independence is one of the two defining properties of a .

Examples:

  • The standard unit vectors e1,,ene_1,\dots,e_n in Rn\mathbb{R}^n are linearly independent.
  • The set {(1,0),(2,0)}R2\{(1,0),(2,0)\}\subset\mathbb{R}^2 is linearly dependent since 2(1,0)(2,0)=02(1,0)-(2,0)=0.
  • Any set containing the zero vector is linearly dependent: if 0M0\in M, then 10=01\cdot 0=0 is a nontrivial dependence.
  • The empty set is linearly independent (there is no finite nonempty subset to witness dependence).