Definition of Linear Independence
What You'll Learn
You'll learn what it means for a set of vectors to be linearly independent and why the "trivial solution" is the key test.
The Core Idea
A set of vectors is linearly independent if none of the vectors can be written as a linear combination of the others. In other words, no vector in the set is "redundant"—each one contributes something unique that the others cannot provide.
Here's the formal test: Vectors v₁, v₂, ..., vₙ are linearly independent if the only solution to the equation
c₁v₁ + c₂v₂ + ... + cₙvₙ = 0
is when all the scalars are zero: c₁ = c₂ = ... = cₙ = 0.
This solution (all zeros) is called the trivial solution. If there's any other way to make that linear combination equal the zero vector—using at least one nonzero scalar—then the vectors are linearly dependent.
Why This Matters
Think of it like building with blocks. If you have three blocks and one is just a duplicate of another, you're not really getting three independent building options. Linear independence ensures every vector in your set brings new "direction" or "dimensionality" to the table.
Example: In R², the vectors (1, 0) and (0, 1) are linearly independent because if c₁(1, 0) + c₂(0, 1) = (0, 0), then c₁ = 0 and c₂ = 0 is the only solution. But (1, 0) and (2, 0) are dependent because -2(1, 0) + 1(2, 0) = (0, 0) with nonzero scalars.
Key Takeaway: A set of vectors is linearly independent if the only linear combination that equals the zero vector is the trivial one (all coefficients zero).