Orthogonal Sets of Vectors
What you'll learn: You'll discover what makes a collection of vectors an orthogonal set and why orthogonal vectors are always linearly independent.
What is an Orthogonal Set?
An orthogonal set is a collection of vectors where every pair of distinct vectors is orthogonal—that is, their inner product equals zero. Think of it like a group of vectors where each one is "perpendicular" to all the others.
Formally, vectors {v₁, v₂, ..., **vₖ} form an orthogonal set if:
- ⟨vᵢ, vⱼ⟩ = 0 whenever i ≠ j
For example, the standard basis vectors e₁ = (1,0,0), e₂ = (0,1,0), and e₃ = (0,0,1) form an orthogonal set in ℝ³ because each pair has inner product zero.
Why Orthogonality Implies Linear Independence
Here's a powerful fact: nonzero orthogonal vectors are always linearly independent.
Proof: Suppose {v₁, v₂, ..., **vₖ} is an orthogonal set of nonzero vectors. Consider a linear combination:
c₁v₁ + c₂v₂ + ... + cₖ**vₖ = 0
Take the inner product of both sides with vᵢ:
⟨c₁v₁ + c₂v₂ + ... + cₖ**vₖ, vᵢ⟩ = ⟨0, vᵢ⟩ = 0
By linearity of the inner product:
c₁⟨v₁, vᵢ⟩ + ... + cᵢ⟨vᵢ, vᵢ⟩ + ... + cₖ⟨vₖ, vᵢ⟩ = 0
Since the set is orthogonal, all terms vanish except cᵢ⟨vᵢ, vᵢ⟩, giving us:
cᵢ⟨vᵢ, vᵢ⟩ = 0
Since vᵢ is nonzero, ⟨vᵢ, vᵢ⟩ > 0 (by properties of norms), so cᵢ = 0. This holds for every i, proving linear independence.
Key Takeaway: An orthogonal set consists of vectors that are pairwise orthogonal, and any orthogonal set of nonzero vectors is automatically linearly independent—making orthogonal sets extremely useful in decomposing vector spaces.