Linear Independence in General Vector Spaces
You'll learn how the concept of linear independence extends naturally from ℝⁿ to any vector space, including polynomials and functions.
The Core Idea
So far, you've tested linear independence for vectors in ℝ² and ℝ³—ordered lists of numbers. But remember: vector spaces aren't just about arrows. Polynomials, continuous functions, matrices, and many other mathematical objects can be "vectors" if they follow the right rules (addition and scalar multiplication).
The beautiful part? The definition of linear independence doesn't change at all.
A set of vectors {v₁, v₂, ..., vₙ} is linearly independent if the only solution to:
c₁v₁ + c₂v₂ + ... + cₙvₙ = 0
is c₁ = c₂ = ... = cₙ = 0.
Examples in Different Spaces
Polynomial Space P₂
Consider the polynomials: {1, x, x²} in the space of polynomials of degree ≤ 2.
Are they linearly independent? Test:
c₁(1) + c₂(x) + c₃(x²) = 0 (the zero polynomial)
For this to be true for all values of x, each coefficient must be zero: c₁ = c₂ = c₃ = 0. ✓ They're independent!
Function Space
In the space of continuous functions, consider {sin(x), cos(x)}:
c₁sin(x) + c₂cos(x) = 0 (for all x)
Try x = 0: c₂ = 0
Try x = π/2: c₁ = 0
Both must be zero—so these functions are linearly independent.
Why This Matters
Whether you're working with polynomials, solutions to differential equations, or abstract spaces, you use the same test. The method might differ (no matrices for functions!), but the underlying logic is identical.
Key Takeaway: Linear independence is a universal property defined purely by the equation c₁v₁ + ... + cₙvₙ = 0, making it applicable to any vector space—not just ℝⁿ.