Computing Linear Combinations in R³ and Beyond
You'll learn how to extend the mechanics of linear combinations from two-dimensional space into three dimensions and higher.
The Core Idea
Just as you combined vectors in R² using scalar multiples and addition, you can do exactly the same in R³ (three-dimensional space) and even R⁴, R⁵, or any higher dimension. The process doesn't change—only the number of components grows.
A linear combination in R³ looks like:
c₁v₁ + c₂v₂ + c₃v₃
where c₁, c₂, c₃ are scalars and v₁, v₂, v₃ are vectors in three-dimensional space.
Working in R³
Suppose v₁ = ⟨1, 0, 2⟩, v₂ = ⟨-1, 3, 1⟩, and v₃ = ⟨0, 1, -1⟩.
To compute 2v₁ - 3v₂ + 4v₃:
-
Multiply each vector by its scalar:
- 2⟨1, 0, 2⟩ = ⟨2, 0, 4⟩
- -3⟨-1, 3, 1⟩ = ⟨3, -9, -3⟩
- 4⟨0, 1, -1⟩ = ⟨0, 4, -4⟩
-
Add component-wise:
- ⟨2+3+0, 0+(-9)+4, 4+(-3)+(-4)⟩ = ⟨5, -5, -3⟩
Beyond Three Dimensions
The beauty of this algebraic approach is that it scales effortlessly. In R⁴, you'd have four components per vector. In R¹⁰⁰, you'd have a hundred. The rule stays identical: multiply each vector by its coefficient, then add all results component-by-component.
Think of it like a recipe: whether you're mixing three ingredients or ten, you still measure each one and combine them in the same bowl.
Key Takeaway: Linear combinations work identically in any dimension—scale each vector, then add corresponding components; the dimension just determines how many numbers you track per vector.