Matrix Algebra Reference

Math 251 — open-book study guide covering §2.3, §3.4, §3.5, §4.6

🟦

Matrix Basics

Notation, size, types, and equality — §4.6

What is a Matrix?

A matrix is a rectangular array of numbers arranged in rows and columns.

An m × n matrix has m rows and n columns:

A =
a₁₁a₁₂a₁ₙ
a₂₁a₂₂a₂ₙ
aₘ₁aₘ₂aₘₙ

Entry aᵢⱼ = row i, column j (row index FIRST).   Example: a₂₃ = element in row 2, column 3.

Size matters: Always state the size as rows × columns. A 3×2 matrix is NOT the same as a 2×3 matrix.
Special Matrices
NameDescription
Squarem = n (same rows and columns)
Zero (0)All entries are 0
Identity (Iₙ)Square; 1s on main diagonal, 0s elsewhere
Column vectorn × 1 matrix (single column)
Row vector1 × n matrix (single row)
Identity Matrix I₃
I₃ =
100
010
001

Property: A · I = I · A = A  (multiplying by I does nothing)

Matrix Equality

Two matrices A and B are equal if and only if:

  • They have the same size (same m and n), AND
  • Every corresponding entry is equal: aᵢⱼ = bᵢⱼ for all i, j
Exam trap: A 2×3 matrix can NEVER equal a 3×2 matrix even if they contain the same numbers — different sizes means not equal.

Matrix Operations

Addition, scalar multiplication, matrix multiplication — §4.6

Addition & Subtraction

Requirement: Both matrices must be the same size.

Add (or subtract) corresponding entries:

(A + B)ᵢⱼ = aᵢⱼ + bᵢⱼ

12
34
+
56
78
=
68
1012
Scalar Multiplication

Multiply every entry by the scalar c:

(cA)ᵢⱼ = c · aᵢⱼ

3 ·
12
34
=
36
912
Key: -A = (-1)A negates every entry.
Matrix Multiplication — The Big One

Size rule: A is m×n and B is n×p → AB is m×p. Inner dimensions must match.

/* (m × n)(n × p) = (m × p) — inner n's cancel */

Entry (AB)ᵢⱼ = (row i of A) · (col j of B) = aᵢ₁b₁ⱼ + aᵢ₂b₂ⱼ + ··· + aᵢₙbₙⱼ

A
12
34
B
56
78

(AB)₁₁ = 1·5 + 2·7 = 19   (AB)₁₂ = 1·6 + 2·8 = 22
(AB)₂₁ = 3·5 + 4·7 = 43   (AB)₂₂ = 3·6 + 4·8 = 50

AB =
1922
4350
NOT commutative: AB ≠ BA in general. Always check which order you're multiplying!
Size Compatibility Quick Reference
OperationRequirementResult SizeExample
A + BA and B same sizeSame as A, B(3×2) + (3×2) = (3×2)
cAAny matrixSame as A3 · (2×4) = (2×4)
ABcols(A) = rows(B)rows(A) × cols(B)(3×2)(2×5) = (3×5)
A + B when sizes differ❌ UNDEFINED — cannot add
AB when inner dims differ❌ UNDEFINED — cannot multiply
Non-Square Multiplication Example (3×2)(2×3)
A (3×2)
12
34
56
B (2×3)
789
101112

Row 1: [1·7+2·10   1·8+2·11   1·9+2·12] = [27   30   33]
Row 2: [3·7+4·10   3·8+4·11   3·9+4·12] = [61   68   75]
Row 3: [5·7+6·10   5·8+6·11   5·9+6·12] = [95   106   117]

AB =
273033
616875
95106117
Check: BA would be (2×3)(3×2) = (2×2) — a different size! AB ≠ BA is obvious here because they're even different sizes.
⚠ Common Exam Traps
TrapWrongRight
CommutativityAB = BA alwaysAB ≠ BA in general
Adding different sizes(2×3) + (3×2)❌ undefined
Wrong mult order size(2×3)(4×2)❌ inner: 3 ≠ 4, undefined
Entry index orderaᵢⱼ = row j, col iaᵢⱼ = row i, col j
Result size(m×n)(n×p) = (n×n)(m×n)(n×p) = (m×p)
IdentityAI ≠ AAI = IA = A always
📏

Lines in ℝ² and ℝ³

General, vector, and parametric forms — §2.3

Three Forms of a Line
Formℝ² (2D)ℝ³ (3D)
Generalax + by = cTwo plane equations (not commonly used)
Vectorr = r₀ + t·dr = r₀ + t·d
Parametricx = 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₁)

/* Any scalar multiple of d is also a valid direction vector */
/* The parametric form is NOT unique — any point on the line */
/* can serve as r₀, and any non-zero multiple of d is valid  */
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.
🟧

Planes in ℝ³

Normal vector, general form, parametric form — §2.3

Three Forms of a Plane in ℝ³
FormEquationNotes
Generalax + by + cz = dNormal vector n = (a, b, c). Unique (up to sign).
Vectorr = r₀ + s·u + t·vu, v are two direction vectors in the plane. NOT unique.
Parametricx = 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.
⚖️

Systems of Linear Equations

Augmented matrices, solution types, row operations — §3.4

Augmented Matrix Notation

A linear system is converted to an augmented matrix [A|b]:

  x + 2y + z = 3
2x + 4y + 3z = 8
3x + 6y + 5z = 13
1213
2438
36513

The vertical bar separates the coefficient matrix A from the constants b.

Three Solution Types
TypeRREF gives…Geometric meaning
InconsistentRow of form [0 0 … 0 | k] where k ≠ 0 → "0 = k" contradictionNo intersection; parallel planes
Unique solutionEvery variable is a leading variable; no free variablesLines/planes meet at exactly one point
Infinitely manyAt least one free variable; no contradictionsInfinite overlap — line, plane, etc.
Decision order: First check for contradiction rows. If none → count free variables. Zero free vars = unique. One or more = infinitely many.
Elementary Row Operations
OperationNotationWhat it doesExample
Scale a rowRᵢ → k·RᵢMultiply every entry in row i by nonzero scalar kR₂ → ½R₂
Swap rowsRᵢ ↔ RⱼExchange two rowsR₁ ↔ R₃
Row replacementRⱼ → Rⱼ + k·RᵢAdd k times row i to row j (row i unchanged)R₂ → R₂ − 2R₁
None of these change the solution set — that's why they're safe to apply. You can reverse every operation.
🔢

RREF & Gauss-Jordan Elimination

Algorithm, free variables, reading solutions — §3.4

The 4 Properties of RREF

A matrix is in Reduced Row Echelon Form if ALL four hold:

1
The first nonzero entry in each nonzero row is a 1 (called the leading 1 or pivot).
2
Each leading 1 is the only nonzero entry in its column (zeros above AND below).
3
Leading 1s shift strictly to the right in each successive row (staircase pattern).
4
All zero rows are grouped at the bottom.
Is This Matrix in RREF? — Examples
✓ RREF
1002
0105
001−1
✓ RREF (free variable: x₂)
130
001
000
✓ RREF (identity)
100
010
001
✗ NOT RREF — leading entry ≠ 1 (Rule 1)
2002
0105
001−1
✗ NOT RREF — nonzero above pivot in col 2 (Rule 2)
130
010
000
Shortcut test: Check (1) all pivots are 1, (2) all other entries in pivot columns are 0, (3) pivots go right in a staircase, (4) zero rows at bottom.
Gauss-Jordan Algorithm — Step by Step
1
Find the leftmost column with a nonzero entry. If the top entry is 0, swap rows to bring a nonzero to the top.
2
Scale the top row so the leftmost nonzero entry becomes 1 (the leading 1). Use Rᵢ → (1/aᵢⱼ)·Rᵢ.
3
Eliminate below: Use row replacement operations to make all entries BELOW the leading 1 equal to zero.
4
Cover that row. Repeat steps 1–3 on the remaining submatrix (ignoring rows already processed).
5
Eliminate above: Working bottom-up, use row replacement to make all entries ABOVE each leading 1 equal to zero.
6
Read the solution from the RREF.
Full Worked Trace — Infinitely Many Solutions
Solve: x + 2y + z = 3   |   2x + 4y + 3z = 8   |   3x + 6y + 5z = 13
Augmented matrix:
1213
2438
36513
R₂ → R₂ − 2R₁
1213
0012
36513
R₃ → R₃ − 3R₁
1213
0012
0024
R₃ → R₃ − 2R₂
1213
0012
0000
← zero row (not a contradiction)
R₁ → R₁ − R₂  (eliminate above leading 1 in col 3)
1201
0012
0000
RREF ✓

Leading variables (have pivot): x₁ (col 1), x₃ (col 3)
Free variable (no pivot): x₂ (col 2) → let x₂ = t

Solution set (infinitely many)
{(1−2t, t, 2) : t ∈ ℝ}
Worked Trace — Inconsistent System
Solve: x + y = 1   |   2x + 2y = 5
Augmented matrix:
111
225
R₂ → R₂ − 2R₁
111
003
← 0 = 3   CONTRADICTION!
Inconsistency signal: A row of the form [0 0 … 0 | k] where k ≠ 0. This literally says "0 = k" which is impossible. Stop — no solution exists.
Free Variables & Leading Variables Summary
TermMeaningIn RREF…
Leading variable (pivot variable)Variable corresponding to a column that contains a leading 1Expressed in terms of free vars and constants
Free variableVariable corresponding to a column with NO leading 1Assigned a parameter (t, s, …); can be anything
Count free variables: (number of columns in A) − (number of leading 1s) = number of free variables = number of parameters in the general solution.
🎯

Spanning Sets & Linear Combinations

What vectors can be built from a set — §3.5

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

Augmented [v₁ | v₂ | b]:
135
217
R₂ → R₂ − 2R₁
135
0−5−3
→ c₂ = 3/5,   c₁ = 16/5

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
rankSpan in ℝ²Span in ℝ³
0Just {0} — origin onlyJust {0} — origin only
1A line through originA line through origin
2All of ℝ² (whole plane)A plane through origin
3All 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).

v₁
1
2
v₂
2
4
v₂ = 2v₁
RREF of [v₁ | v₂]:
12
00
rank = 1
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).

v₁
1
2
v₂
3
1
not parallel
RREF of [v₁ | v₂]:
10
01
rank = 2
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).

v₁
1
2
3
RREF of [v₁]:
1
0
0
rank = 1
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).

v₁
1
0
1
v₂
0
1
1
RREF of [v₁ | v₂]:
10
01
00
rank = 2
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).

v₁
1
0
1
v₂
0
1
1
v₃
1
1
0
RREF of [v₁ | v₂ | v₃]:
100
010
001
rank = 3 = identity ✓
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₁
1
0
1
v₂
0
1
1
v₃
1
1
2

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 rowDoes 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:
102
011
215
R₃ → R₃ − 2R₁, then R₃ → R₃ − R₂:
102
011
000
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…MethodAnswer 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.
2
Row reduce to RREF.
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]ᵀ}?
Set up [v₁ | v₂ | b]:
113
011
124
R₃ → R₃ − R₁
113
011
011
R₃ → R₃ − R₂
113
011
000
← zero row, no contradiction
R₁ → R₁ − R₂
102
011
000
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₂
⛓️

Linear Independence

Definition, test, and quick rules — §3.5

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 variableLinearly DEPENDENT
Quick Rules — No Calculation Needed
SituationConclusionWhy
Set contains the zero vectorAlways DEPENDENTc₁·0 + 0·v₂ + … = 0 gives c₁ can be anything → non-trivial solution exists
Two vectors: one is a scalar multiple of the otherDEPENDENTv₂ = kv₁ → v₁ − kv₂ = 0 is non-trivial
More vectors than dimensionsAlways DEPENDENTk vectors in ℝⁿ with k > n → always dependent (more unknowns than equations)
Single non-zero vectorAlways INDEPENDENTcv = 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:
124
131
242
R₂ → R₂ − R₁    R₃ → R₃ − 2R₁
124
01−3
00−6
R₃ → (−1/6)R₃, then back-substitute to RREF:
100
010
001
← 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:

101
011
← 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.
🧪

Practice Problems & Solutions

Worked examples with step-by-step approach guides for each type

➕ 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:

2A =
24
68
  2A + B =
23
813

(b) A·B:

(1·0+2·2   1·(−1)+2·5) = (4   9)
(3·0+4·2   3·(−1)+4·5) = (8   17)

AB =
49
817

(c) B·A:

(0·1+(−1)·3   0·2+(−1)·4) = (−3   −4)
(2·1+5·3    2·2+5·4) = (17   24)

BA =
−3−4
1724
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
Augmented matrix:
215
5313
R₁ → ½R₁
1½5/2
5313
R₂ → R₂ − 5R₁
1½5/2
0½3/2
R₂ → 2R₂
1½5/2
013
R₁ → R₁ − ½R₂
101
013
RREF ✓
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
Augmented matrix:
1−124
2−248
1102
R₂ → R₂ − 2R₁    R₃ → R₃ − R₁
1−124
0000
02−2−2
← R₂ was redundant (zero row)
R₂ ↔ R₃  (move zero row to bottom)
1−124
02−2−2
0000
R₂ → ½R₂, then R₁ → R₁ + R₂
1013
01−1−1
0000
RREF ✓

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.

Form A = [v₁ | v₂ | v₃]:
102
215
306
R₂ → R₂ − 2R₁    R₃ → R₃ − 3R₁
102
011
000
← 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]:
1021
0102
2046
R₃ → R₃ − 2R₁
1021
0102
0004
← 0 = 4   CONTRADICTION!
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.
10302
0110−1
00014
00000
← 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
1003
0101
0002
0 = 2 contradiction
(B) — ∞ solutions
1205
0013
0000
x₂ is free
(C) — unique (trivial)
100
010
000
x₁=0, x₂=0
(D) — unique (homogeneous)
1000
0100
0010
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)
↑ Top