Three Forms of a Line
| Form | ℝ² (2D) | ℝ³ (3D) |
| General | ax + by = c | Two plane equations (not commonly used) |
| Vector | r = r₀ + t·d | r = r₀ + t·d |
| Parametric | x = x₀ + at y = y₀ + bt | x = x₀ + at y = y₀ + bt z = z₀ + ct |
Where: r₀ = position vector of a known point; d = direction vector; t ∈ ℝ is the free parameter.
How to Find the Direction Vector d
Given two points P₁ = (x₁, y₁, z₁) and P₂ = (x₂, y₂, z₂):
d = P₂ − P₁ = (x₂−x₁, y₂−y₁, z₂−z₁)
Worked Example — Line in ℝ² Through Two Points
Find all three forms of the line through P₁ = (2, −1) and P₂ = (10, 3).
Step 1: Direction vector
d = P₂ − P₁ = (10−2, 3−(−1)) = (8, 4)
(can simplify: d = (2, 1) by dividing by 4)
Step 2: Vector form using P₁ as r₀
r = (2, −1) + t(2, 1)
Step 3: Parametric form
x = 2 + 2t
y = −1 + t
Step 4: General form
From parametric: t = y + 1, so x = 2 + 2(y+1) = 2y + 4
→ x − 2y = 4
Check: Plug P₁(2,−1): 2 − 2(−1) = 4 ✓ and P₂(10,3): 10 − 2(3) = 4 ✓
Worked Example — Line in ℝ³ Through Two Points
Find parametric and vector forms for the line through P₁ = (−9, 3, 4) and P₂ = (−6, −15, 4).
Direction vector:
d = P₂ − P₁ = (−6−(−9), −15−3, 4−4) = (3, −18, 0)
Simplify: d = (1, −6, 0)
Vector form (using P₁):
r = (−9, 3, 4) + t(1, −6, 0)
Parametric form:
x = −9 + t
y = 3 − 6t
z = 4 ← z is constant (line is horizontal in z)
Note: When a component of d is 0 (here, the z-component), that coordinate stays constant along the entire line.
Three Forms of a Plane in ℝ³
| Form | Equation | Notes |
| General | ax + by + cz = d | Normal vector n = (a, b, c). Unique (up to sign). |
| Vector | r = r₀ + s·u + t·v | u, v are two direction vectors in the plane. NOT unique. |
| Parametric | x = x₀ + a₁s + a₂t y = y₀ + b₁s + b₂t z = z₀ + c₁s + c₂t | Two free parameters s, t ∈ ℝ. |
How to Find the General Form from 3 Points
1
Find two direction vectors in the plane: u = P₂ − P₁, v = P₃ − P₁
2
Find the normal vector n: n must be perpendicular to both u and v. Use the cross product n = u × v, OR set up the system n·u = 0, n·v = 0 and solve.
3
Write general form: n = (a,b,c) and any known point P₁ = (x₁,y₁,z₁) gives a(x−x₁) + b(y−y₁) + c(z−z₁) = 0, simplify to ax + by + cz = d.
Worked Example — Plane Through 3 Points
Find all forms of the plane through P₁ = (5,0,0), P₂ = (6,1,0), P₃ = (3,0,1).
Step 1: Direction vectors
u = P₂ − P₁ = (6−5, 1−0, 0−0) = (1, 1, 0)
v = P₃ − P₁ = (3−5, 0−0, 1−0) = (−2, 0, 1)
Step 2: Normal vector n = (a, b, c) such that n·u=0 and n·v=0
n · u = 0: a + b = 0 → b = −a
n · v = 0: −2a + c = 0 → c = 2a
Set a=1: n = (1, −1, 2)
Step 3: General form using P₁=(5,0,0):
1(x−5) + (−1)(y−0) + 2(z−0) = 0
x − y + 2z = 5
Step 4: Vector / parametric form using r₀=P₁, directions u and v:
r = (5,0,0) + s(1,1,0) + t(−2,0,1)
x = 5 + s − 2t
y = s
z = t
Quick check: Plug P₁(5,0,0): 5−0+0=5 ✓ P₂(6,1,0): 6−1+0=5 ✓ P₃(3,0,1): 3−0+2=5 ✓
Key difference — Lines vs Planes: A line has one direction vector and one free parameter t. A plane has two direction vectors and two free parameters s and t. The normal vector is perpendicular to the plane, not along it.
Linear Combination
A vector v is a linear combination of vectors v₁, v₂, …, vₖ if there exist scalars c₁, c₂, …, cₖ such that:
v = c₁v₁ + c₂v₂ + ··· + cₖvₖ
Example: Is [5, 7] a linear combination of [1,2] and [3,1]?
Set up: c₁[1,2] + c₂[3,1] = [5,7] → c₁ + 3c₂ = 5 and 2c₁ + c₂ = 7
Consistent — so [5,7] = (16/5)[1,2] + (3/5)[3,1] ✓
Span of a Set — Definition & Geometry
Span{v₁, v₂, …, vₖ} = the set of ALL possible linear combinations of v₁, …, vₖ.
The span is always a subspace — it contains the origin, is closed under addition, and closed under scalar multiplication.
The shape of the span depends on how many independent directions the vectors provide — not on how many vectors you have. Three parallel vectors still only span a line.
How to Find the Span — The Rank Method
Form the matrix with the vectors as columns and row-reduce. The number of pivots = rank = dimension of the span.
rank = number of pivots in RREF of [v₁ | v₂ | ··· | vₖ]
= number of linearly independent directions in the set
| rank | Span in ℝ² | Span in ℝ³ |
| 0 | Just {0} — origin only | Just {0} — origin only |
| 1 | A line through origin | A line through origin |
| 2 | All of ℝ² (whole plane) | A plane through origin |
| 3 | — | All of ℝ³ (all space) |
Adding more vectors only increases the span if a vector is NOT in the current span. If v₃ is already in Span{v₁,v₂}, adding it does nothing — rank stays the same.
📐 Span Outcome Examples
Outcome — Line in ℝ² (rank 1)
When: One non-zero vector, OR all vectors are parallel (scalar multiples of each other).
Span
Span{v₁, v₂} = {t[1,2] : t ∈ ℝ}
A line through the origin in direction [1,2].
Outcome — All of ℝ² (rank 2)
When: Two vectors in ℝ² that are NOT parallel (not scalar multiples).
Span
Span{v₁, v₂} = ℝ²
Every vector in 2D can be reached.
Outcome — Line in ℝ³ (rank 1)
When: One non-zero vector in ℝ³ (or all vectors are multiples of each other).
Span
Span{v₁} = {t[1,2,3] : t ∈ ℝ}
A line through the origin in direction [1,2,3].
Outcome — Plane in ℝ³ (rank 2)
When: Two linearly independent vectors in ℝ³ (not parallel to each other).
Span
Span{v₁,v₂} = {s[1,0,1] + t[0,1,1] : s,t ∈ ℝ}
A plane through origin. Normal: n = v₁ × v₂ = [−1,−1,1]
Plane equation: −x − y + z = 0 (i.e. z = x + y)
Outcome — All of ℝ³ (rank 3)
When: Three linearly independent vectors in ℝ³ (no vector is in the span of the other two).
Span
Span{v₁, v₂, v₃} = ℝ³
Every vector in 3D space can be written as a combination of these three. Any b will be consistent.
⚠ Tricky Cases — When Extra Vectors Don't Help
Adding a third vector that is already in the span of the first two does NOT increase the span. The rank stays the same.
3 vectors in ℝ³ but rank = 2 (plane, not ℝ³)
v₃ = v₁ + v₂ — already in span! RREF has a zero row → rank = 2 → still just a plane.
4 vectors in ℝ² — still only ℝ²
You can never span more than ℝⁿ with vectors from ℝⁿ. Adding a 3rd, 4th, … vector to a ℝ² set still can't reach anything outside ℝ². The maximum rank in ℝⁿ is n.
Does {v₁, …, vₖ} Span ℝⁿ? — The Test
A set spans all of ℝⁿ iff you can reach every vector in ℝⁿ as a linear combination. Test:
1
Form A = [v₁ | v₂ | ··· | vₖ] — this is an n × k matrix.
2
Row reduce A (ignore any augmented column — you're just checking rank).
3
Span = ℝⁿ iff rank = n (every row has a pivot, equivalently: no zero rows in RREF of A).
| RREF of A has… | Conclusion |
| n pivot rows (no zero rows) | Spans ℝⁿ ✓ |
| At least one zero row | Does NOT span ℝⁿ — some b has no solution |
Minimum requirement: You need at least n vectors to span ℝⁿ (k ≥ n). But having k ≥ n is not sufficient — they must also be linearly independent.
Worked Example — Does NOT Span ℝ³
Do v₁ = [1,0,2], v₂ = [0,1,1], v₃ = [2,1,5] span ℝ³?
Form A = [v₁ | v₂ | v₃] and row reduce:
R₃ → R₃ − 2R₁, then R₃ → R₃ − R₂:
zero row → rank = 2, NOT 3
Conclusion
v₃ = 2v₁ + v₂ (dependent!) — these three vectors span only a plane in ℝ³, NOT all of ℝ³.
Any b = [b₁, b₂, b₃] with b₃ ≠ 2b₁ + b₂ is NOT in their span.
Exam Question Types — Span
| Question asks… | Method | Answer format |
| "Is b in Span{v₁,…}?" |
Form [v₁|…|b], row reduce, check consistency |
Yes/No + coefficients c₁,c₂,… |
| "Find the span of {v₁,…}" |
Form [v₁|…], row reduce, count pivots (rank) |
Line / plane / ℝ² / ℝ³ + parametric description |
| "Does {v₁,…} span ℝⁿ?" |
Row reduce [v₁|…], check if rank = n (no zero rows) |
Yes/No |
| "Does adding v₃ to {v₁,v₂} increase the span?" |
Test if v₃ is IN Span{v₁,v₂} — if yes: no change; if no: span grows |
Yes/No + new rank |
| "Express b as a linear combination" |
Form [v₁|…|b], row reduce to RREF, read off c₁,c₂,… |
b = c₁v₁ + c₂v₂ + … |
Test: Is b in Span{v₁, v₂, …, vₖ}?
1
Build the augmented matrix [v₁ | v₂ | … | vₖ | b] — place each vector as a column, b as the rightmost column.
3
Check for consistency: If no contradiction row → b IS in the span. If contradiction row → b is NOT in the span.
This is just solving a linear system! c₁v₁ + … + cₖvₖ = b is exactly the system you're solving — you just want to know if it's consistent, not what c₁,…,cₖ are.
Worked Example — Span Test
Is b = [3, 1, 4]ᵀ in Span{v₁=[1,0,1]ᵀ, v₂=[1,1,2]ᵀ}?
R₃ → R₃ − R₂
← zero row, no contradiction
R₁ → R₁ − R₂
RREF ✓ Consistent! c₁ = 2, c₂ = 1
b = 2v₁ + v₂ = 2[1,0,1] + [1,1,2] = [3,1,4] ✓
Answer
Yes — b IS in Span{v₁, v₂}. b = 2v₁ + 1·v₂
Definition
A set of vectors {v₁, v₂, …, vₖ} is linearly independent if the only solution to:
c₁v₁ + c₂v₂ + ··· + cₖvₖ = 0 (the zero vector)
Trivial solution only: c₁ = c₂ = ··· = cₖ = 0 → LINEARLY INDEPENDENT
Any non-trivial solution (some cᵢ ≠ 0) → LINEARLY DEPENDENT
Linearly dependent means: at least one vector can be expressed as a linear combination of the others — it's "redundant".
Test: Are {v₁, v₂, …, vₖ} Linearly Independent?
1
Form the matrix A = [v₁ | v₂ | … | vₖ] with the vectors as columns.
2
Row reduce A (no augmented column needed — the right side is all zeros).
3
Check:
• No free variables (every column has a pivot) → Linearly INDEPENDENT
• At least one free variable → Linearly DEPENDENT
Quick Rules — No Calculation Needed
| Situation | Conclusion | Why |
| Set contains the zero vector | Always DEPENDENT | c₁·0 + 0·v₂ + … = 0 gives c₁ can be anything → non-trivial solution exists |
| Two vectors: one is a scalar multiple of the other | DEPENDENT | v₂ = kv₁ → v₁ − kv₂ = 0 is non-trivial |
| More vectors than dimensions | Always DEPENDENT | k vectors in ℝⁿ with k > n → always dependent (more unknowns than equations) |
| Single non-zero vector | Always INDEPENDENT | cv = 0 and v ≠ 0 forces c = 0 |
Worked Example — Independent Set
Are {v₁=[1,1,2], v₂=[2,3,4], v₃=[4,1,2]} linearly independent?
Form A = [v₁ | v₂ | v₃] and row reduce:
R₂ → R₂ − R₁ R₃ → R₃ − 2R₁
R₃ → (−1/6)R₃, then back-substitute to RREF:
← every column has a pivot → NO free variables
Conclusion
LINEARLY INDEPENDENT — only solution is c₁=c₂=c₃=0
Worked Example — Dependent Set (More Vectors than Dimensions)
Are {v₁=[1,0], v₂=[0,1], v₃=[1,1]} linearly independent?
3 vectors in ℝ² → immediately DEPENDENT (k > n quick rule)
Verify: Form A = [v₁ | v₂ | v₃] — already in RREF:
← col 3 has no pivot → x₃ is FREE
x₁ = −x₃, x₂ = −x₃, x₃ = t (free)
Non-trivial solution: c₁ = −1, c₂ = −1, c₃ = 1
Check: (−1)[1,0] + (−1)[0,1] + 1[1,1] = [0,0] ✓
Conclusion
LINEARLY DEPENDENT. v₃ = v₁ + v₂
Dependence Relationship — How to Find It
If the set is dependent, the free variable solution tells you how to express one vector in terms of the others:
From c₁ = −1, c₂ = −1, c₃ = 1: −1·v₁ + (−1)·v₂ + 1·v₃ = 0
→ v₃ = v₁ + v₂ ← v₃ is redundant
Any vector with a free variable in its column can be expressed as a combination of the other vectors.
➕ Matrix Operations
Problem 1 — Compute 2A + B and A·B
Given: A = [[1,2],[3,4]], B = [[0,−1],[2,5]]. Compute (a) 2A + B, (b) A·B, (c) B·A. Are AB and BA equal?
(a) 2A + B:
(b) A·B:
(1·0+2·2 1·(−1)+2·5) = (4 9)
(3·0+4·2 3·(−1)+4·5) = (8 17)
(c) B·A:
(0·1+(−1)·3 0·2+(−1)·4) = (−3 −4)
(2·1+5·3 2·2+5·4) = (17 24)
Conclusion
AB ≠ BA (matrix multiplication is NOT commutative in general)
Problem 2 — Size and Existence Check
A is 3×4, B is 4×2, C is 3×2. Which of AB, BA, AC, BC, AB+C are defined? Give sizes of those that are.
AB: (3×4)(4×2) → inner dims match (4=4) → defined, result is 3×2
BA: (4×2)(3×4) → inner: 2 ≠ 3 → UNDEFINED
AC: (3×4)(3×2) → inner: 4 ≠ 3 → UNDEFINED
BC: (4×2)(3×2) → inner: 2 ≠ 3 → UNDEFINED
AB+C: AB is 3×2, C is 3×2 → same size → defined, result is 3×2
📏 Lines & Planes
Problem 3 — Line Through Two Points in ℝ³
Find parametric and vector forms of the line through P = (1, 2, 3) and Q = (4, 0, −1).
Approach: d = Q − P, then r = P + td.
d = (4−1, 0−2, −1−3) = (3, −2, −4)
Vector form:
r = (1, 2, 3) + t(3, −2, −4)
Parametric form:
x = 1 + 3t
y = 2 − 2t
z = 3 − 4t
Verify: At t=0 get P=(1,2,3) ✓. At t=1 get (4,0,−1)=Q ✓.
Problem 4 — Plane Through 3 Points
Find the general equation of the plane through A = (1,0,0), B = (0,2,0), C = (0,0,3).
Approach: u = B−A, v = C−A, find n⊥u and n⊥v.
u = (0−1, 2−0, 0−0) = (−1, 2, 0)
v = (0−1, 0−0, 3−0) = (−1, 0, 3)
Find n=(a,b,c) s.t. n·u=0 and n·v=0:
n·u: −a + 2b = 0 → a = 2b
n·v: −a + 3c = 0 → a = 3c
Set b=3: a=6, c=2. n = (6, 3, 2)
General form using point A=(1,0,0):
6(x−1) + 3(y−0) + 2(z−0) = 0
6x + 3y + 2z = 6
Check: A(1,0,0): 6+0+0=6 ✓ B(0,2,0): 0+6+0=6 ✓ C(0,0,3): 0+0+6=6 ✓
🔢 RREF & Systems
Problem 5 — Solve by Gauss-Jordan (Unique Solution)
Solve: 2x + y = 5 | 5x + 3y = 13
Unique solution
x = 1, y = 3
Problem 6 — Solve by Gauss-Jordan (Infinitely Many)
Solve: x₁ − x₂ + 2x₃ = 4 | 2x₁ − 2x₂ + 4x₃ = 8 | x₁ + x₂ = 2
R₂ → R₂ − 2R₁ R₃ → R₃ − R₁
← R₂ was redundant (zero row)
R₂ ↔ R₃ (move zero row to bottom)
R₂ → ½R₂, then R₁ → R₁ + R₂
Free variable: x₃ = t
General solution (∞ many)
(3−t, −1+t, t) for any t ∈ ℝ
⛓️ Span & Linear Independence
Problem 7 — Test for Linear Independence
Are {v₁=[1,2,3], v₂=[0,1,0], v₃=[2,5,6]} linearly independent?
Approach: Form A = [v₁ | v₂ | v₃] and row reduce.
R₂ → R₂ − 2R₁ R₃ → R₃ − 3R₁
← col 3 has no pivot → x₃ is FREE → DEPENDENT
Conclusion + dependence relation
LINEARLY DEPENDENT.
From RREF: x₁ = −2t, x₂ = −t, x₃ = t. Set t=1: c₁=−2, c₂=−1, c₃=1
Check: −2[1,2,3] + (−1)[0,1,0] + [2,5,6] = [0,0,0] ✓
So v₃ = 2v₁ + v₂
Problem 8 — Is Vector in Span?
Is b = [1,2,6]ᵀ in Span{[1,0,2]ᵀ, [0,1,0]ᵀ, [2,0,4]ᵀ}?
Approach: Set up [v₁ | v₂ | v₃ | b] and row reduce.
Augmented [v₁ | v₂ | v₃ | b]:
Answer
b is NOT in Span{v₁, v₂, v₃} — the system is inconsistent.
🔍 Read the RREF — Predict the Solution
Trace 1 — Read Solution from RREF
The augmented matrix below is in RREF. Write the general solution.
← col 3 (x₃) has no pivot → FREE
Solution
Pivot columns: 1, 2, 4 → x₁, x₂, x₄ are leading variables
Free column: 3 → x₃ = t (free)
x₁ = 2 − 3t
x₂ = −1 − t
x₃ = t (t ∈ ℝ)
x₄ = 4
Infinitely many solutions.
Trace 2 — Is This System Consistent?
Which of these RREF forms are inconsistent?
(A) — INCONSISTENT
0 = 2 contradiction
(B) — ∞ solutions
x₂ is free
(C) — unique (trivial)
x₁=0, x₂=0
(D) — unique (homogeneous)
x₁=x₂=x₃=0
Answers
(A) INCONSISTENT — row 3: [0 0 0 | 2] means 0 = 2, impossible.
(B) Consistent, infinitely many — x₂ is free (no pivot in col 2).
(C) Consistent, unique — x₁=0, x₂=0. (trivial solution)
(D) Consistent, unique — x₁=x₂=x₃=0. (trivial solution, homogeneous)