Standard matrix: A matrix A such that T(v) = Av for all vectors v
- Apply T to standard basis vectors e₁, e₂, ..., eₙ
- Write T(eᵢ) as columns of matrix A
- Verify: T(v) = Av for any vector v
T(e₁) = T(1, 0) = (2(1) - 3(0), 1(1) + 4(0)) = (2, 1)
T(e₂) = T(0, 1) = (2(0) - 3(1), 1(0) + 4(1)) = (-3, 4)
A = [T(e₁) T(e₂)] = \(\begin{bmatrix} 2 & -3 \\ 1 & 4 \end{bmatrix}\)
For v = (x₁, x₂), Av = \(\begin{bmatrix} 2 & -3 \\ 1 & 4 \end{bmatrix} \begin{bmatrix} x₁ \\ x₂ \end{bmatrix} = \begin{bmatrix} 2x₁ - 3x₂ \\ x₁ + 4x₂ \end{bmatrix}\)
This matches T(v) = (2x₁ - 3x₂, x₁ + 4x₂) ✓
The standard matrix is A = \(\begin{bmatrix} 2 & -3 \\ 1 & 4 \end{bmatrix}\)
• Standard basis method: T(eᵢ) forms column i of A
• Linearity: T(cv + dw) = cT(v) + dT(w)
• Matrix-vector multiplication: Av represents transformation T
Projection transformation: Maps each vector to its projection onto a subspace
T(e₁) = T(1, 0) = (1, 0)
T(e₂) = T(0, 1) = (0, 0)
A = [T(e₁) T(e₂)] = \(\begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix}\)
For projections, A² = A (applying twice is same as once)
A² = \(\begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix} \begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix} = A\) ✓
For any vector (x₁, x₂): A\(\begin{bmatrix} x₁ \\ x₂ \end{bmatrix}\) = \(\begin{bmatrix} x₁ \\ 0 \end{bmatrix}\) ✓
The projection matrix is A = \(\begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix}\)
• Projection: T² = T (idempotent transformation)
• Standard basis method: T(eᵢ) forms columns of A
• Rank: Rank of projection matrix equals dimension of image
Reflection transformation: Flips vectors across a line or plane
T(e₁) = T(1, 0) = (0, 1)
T(e₂) = T(0, 1) = (1, 0)
A = [T(e₁) T(e₂)] = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)
For reflections, A² = I (applying twice returns to original)
A² = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} \begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix} = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I\) ✓
For any vector (x₁, x₂): A\(\begin{bmatrix} x₁ \\ x₂ \end{bmatrix}\) = \(\begin{bmatrix} x₂ \\ x₁ \end{bmatrix}\) ✓
The reflection matrix is A = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)
• Reflection: A² = I (involution property)
• Standard basis method: T(eᵢ) forms columns of A
• Determinant: det(A) = -1 for reflections
Composition: (T₂ ∘ T₁)(v) = T₂(T₁(v)), represented by matrix product A₂A₁
For 90° counterclockwise: A₁ = \(\begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix}\)
T₁(e₁) = (0, 1), T₁(e₂) = (-1, 0)
For reflection across x-axis: A₂ = \(\begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}\)
T₂(e₁) = (1, 0), T₂(e₂) = (0, -1)
A₂A₁ = \(\begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix} \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix}\)
Row 1, Col 1: (1×0) + (0×1) = 0
Row 1, Col 2: (1×(-1)) + (0×0) = -1
Row 2, Col 1: (0×0) + ((-1)×1) = -1
Row 2, Col 2: (0×(-1)) + ((-1)×0) = 0
Wait, let me recalculate: Row 1, Col 1: (1×0) + (0×1) = 0
Row 1, Col 2: (1×(-1)) + (0×0) = -1
Row 2, Col 1: (0×0) + ((-1)×1) = -1
Row 2, Col 2: (0×(-1)) + ((-1)×0) = 0
Actually: A₂A₁ = \(\begin{bmatrix} 0 & -1 \\ -1 & 0 \end{bmatrix}\)
For v = (1, 0):
T₁(v) = (0, 1), then T₂(T₁(v)) = (0, -1)
Using matrix: A₂A₁\(\begin{bmatrix} 1 \\ 0 \end{bmatrix}\) = \(\begin{bmatrix} 0 \\ -1 \end{bmatrix}\) ✓
The composition matrix is \(\begin{bmatrix} 0 & -1 \\ -1 & 0 \end{bmatrix}\)
• Composition rule: T₂ ∘ T₁ corresponds to A₂A₁
• Order matters: Apply transformations right-to-left
• Matrix multiplication: Standard algorithm
Inverse transformation: T⁻¹ such that TT⁻¹ = T⁻¹T = I (identity transformation)
T(x₁, x₂) = (2x₁ + x₂, x₁ + x₂)
T(e₁) = (2, 1), T(e₂) = (1, 1)
So A = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\)
For 2×2 matrix \(\begin{bmatrix} a & b \\ c & d \end{bmatrix}\), A⁻¹ = \(\frac{1}{ad-bc}\begin{bmatrix} d & -b \\ -c & a \end{bmatrix}\)
det(A) = (2×1) - (1×1) = 1
A⁻¹ = \(\frac{1}{1}\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix} = \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)
AA⁻¹ = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix} \begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)
= \(\begin{bmatrix} (2×1)+(1×(-1)) & (2×(-1))+(1×2) \\ (1×1)+(1×(-1)) & (1×(-1))+(1×2) \end{bmatrix}\)
= \(\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I\) ✓
A⁻¹A = \(\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix} \begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\)
= \(\begin{bmatrix} (1×2)+((-1)×1) & (1×1)+((-1)×1) \\ ((-1)×2)+(2×1) & ((-1)×1)+(2×1) \end{bmatrix}\)
= \(\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I\) ✓
The inverse transformation matrix is \(\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)
• Inverse formula: A⁻¹ = (1/det(A))adj(A)
• Verification: AA⁻¹ = A⁻¹A = I
• Existence: Only when det(A) ≠ 0
Linear transformation: Function T: V → W satisfying additivity and homogeneity
Standard matrix: Unique matrix A such that T(v) = Av for all v
Kernel: Set of vectors v such that T(v) = 0
Image: Set of all vectors w such that w = T(v) for some v
- Verify linearity: Check T(cv + dw) = cT(v) + dT(w)
- Find standard matrix: Apply T to standard basis vectors
- Compute properties: Kernel, image, rank, nullity
- Verify results: Test with sample vectors
• Linearity: T(cv + dw) = cT(v) + dT(w)
• Standard matrix: A = [T(e₁) T(e₂) ... T(eₙ)]
• Composition: (T₂ ∘ T₁) ↔ A₂A₁
• Inverse: T⁻¹ ↔ A⁻¹ (when det(A) ≠ 0)
• Projection: A² = A
• Reflection: A² = I
• Rotation: det(A) = 1, AᵀA = I
• Linearity: preserved under addition/scaling
• Invertibility: determined by determinant
• Composition: order matters
Analysis: The visualization shows how different transformation properties affect matrix characteristics.
- Linear transformations preserve vector space structure
- Rank determines dimension of image space
- Determinant indicates invertibility