Solved Exercises on Linear Transformations as Matrices

Master linear transformations as matrices: finding standard matrices, properties of linear transformations, and transformation composition through these 5 detailed exercises.

Solution: Exercises 1 to 3
1 Finding Standard Matrix
Exercise 1
Find the standard matrix A for the linear transformation T: ℝ² → ℝ² defined by T(x₁, x₂) = (2x₁ - 3x₂, x₁ + 4x₂)
Definition:

Standard matrix: A matrix A such that T(v) = Av for all vectors v

Method:
  1. Apply T to standard basis vectors e₁, e₂, ..., eₙ
  2. Write T(eᵢ) as columns of matrix A
  3. Verify: T(v) = Av for any vector v
Apply T to e₁
T(e₁) = \(\begin{bmatrix} 2 \\ 1 \end{bmatrix}\)
Apply T to e₂
T(e₂) = \(\begin{bmatrix} -3 \\ 4 \end{bmatrix}\)
Standard matrix
A = \(\begin{bmatrix} 2 & -3 \\ 1 & 4 \end{bmatrix}\)
Step 1: Apply T to e₁ = (1, 0)

T(e₁) = T(1, 0) = (2(1) - 3(0), 1(1) + 4(0)) = (2, 1)

Step 2: Apply T to e₂ = (0, 1)

T(e₂) = T(0, 1) = (2(0) - 3(1), 1(0) + 4(1)) = (-3, 4)

Step 3: Form the standard matrix

A = [T(e₁) T(e₂)] = \(\begin{bmatrix} 2 & -3 \\ 1 & 4 \end{bmatrix}\)

Step 4: Verify with arbitrary vector

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₂) ✓

A = \(\begin{bmatrix} 2 & -3 \\ 1 & 4 \end{bmatrix}\)
Final answer:

The standard matrix is A = \(\begin{bmatrix} 2 & -3 \\ 1 & 4 \end{bmatrix}\)

Applied rules:

• 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

2 Projection Transformation
Exercise 2
Find the standard matrix for the projection onto the x-axis: T(x₁, x₂) = (x₁, 0)
Definition:

Projection transformation: Maps each vector to its projection onto a subspace

T(e₁)
\(\begin{bmatrix} 1 \\ 0 \end{bmatrix}\)
T(e₂)
\(\begin{bmatrix} 0 \\ 0 \end{bmatrix}\)
Standard matrix
\(\begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix}\)
Step 1: Apply T to e₁ = (1, 0)

T(e₁) = T(1, 0) = (1, 0)

Step 2: Apply T to e₂ = (0, 1)

T(e₂) = T(0, 1) = (0, 0)

Step 3: Form the standard matrix

A = [T(e₁) T(e₂)] = \(\begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix}\)

Step 4: Verify idempotence

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\) ✓

Step 5: Verify transformation

For any vector (x₁, x₂): A\(\begin{bmatrix} x₁ \\ x₂ \end{bmatrix}\) = \(\begin{bmatrix} x₁ \\ 0 \end{bmatrix}\) ✓

A = \(\begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix}\)
Final answer:

The projection matrix is A = \(\begin{bmatrix} 1 & 0 \\ 0 & 0 \end{bmatrix}\)

Applied rules:

• Projection: T² = T (idempotent transformation)

• Standard basis method: T(eᵢ) forms columns of A

• Rank: Rank of projection matrix equals dimension of image

3 Reflection Transformation
Exercise 3
Find the standard matrix for the reflection across the line y = x: T(x₁, x₂) = (x₂, x₁)
Definition:

Reflection transformation: Flips vectors across a line or plane

T(e₁)
\(\begin{bmatrix} 0 \\ 1 \end{bmatrix}\)
T(e₂)
\(\begin{bmatrix} 1 \\ 0 \end{bmatrix}\)
Standard matrix
\(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)
Step 1: Apply T to e₁ = (1, 0)

T(e₁) = T(1, 0) = (0, 1)

Step 2: Apply T to e₂ = (0, 1)

T(e₂) = T(0, 1) = (1, 0)

Step 3: Form the standard matrix

A = [T(e₁) T(e₂)] = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)

Step 4: Verify involution property

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\) ✓

Step 5: Verify transformation

For any vector (x₁, x₂): A\(\begin{bmatrix} x₁ \\ x₂ \end{bmatrix}\) = \(\begin{bmatrix} x₂ \\ x₁ \end{bmatrix}\) ✓

A = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)
Final answer:

The reflection matrix is A = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)

Applied rules:

• Reflection: A² = I (involution property)

• Standard basis method: T(eᵢ) forms columns of A

• Determinant: det(A) = -1 for reflections

Linear Transformations: Key Concepts
T(v) = Av
Matrix Representation
Property
T(cv + dw) = cT(v) + dT(w)
Linearity Condition
Method
A = [T(e₁) T(e₂) ... T(eₙ)]
Standard Matrix
Property
A² = A (projection)
Idempotence
Fundamental theorem: Every linear transformation has a unique matrix representation
Kernel: Solutions to Av = 0 (vectors mapped to zero)
Image: All possible outputs Av for inputs v
Solution: Exercises 4 to 5
4 Composition of Transformations
Exercise 4
Let T₁ be rotation by 90° counterclockwise and T₂ be reflection across x-axis. Find the standard matrix for T₂ ∘ T₁ (apply T₁ first, then T₂).
Definition:

Composition: (T₂ ∘ T₁)(v) = T₂(T₁(v)), represented by matrix product A₂A₁

T₁ matrix
A₁ = \(\begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix}\)
T₂ matrix
A₂ = \(\begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}\)
Composition
A₂A₁ = \(\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}\)
Step 1: Find A₁ for 90° rotation

For 90° counterclockwise: A₁ = \(\begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix}\)

T₁(e₁) = (0, 1), T₁(e₂) = (-1, 0)

Step 2: Find A₂ for x-axis reflection

For reflection across x-axis: A₂ = \(\begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}\)

T₂(e₁) = (1, 0), T₂(e₂) = (0, -1)

Step 3: Compute composition A₂A₁

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}\)

Step 4: Verify with example

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}\) ✓

A₂A₁ = \(\begin{bmatrix} 0 & -1 \\ -1 & 0 \end{bmatrix}\)
Final answer:

The composition matrix is \(\begin{bmatrix} 0 & -1 \\ -1 & 0 \end{bmatrix}\)

Applied rules:

• Composition rule: T₂ ∘ T₁ corresponds to A₂A₁

• Order matters: Apply transformations right-to-left

• Matrix multiplication: Standard algorithm

5 Inverse Transformation
Exercise 5
Find the standard matrix for the inverse of T(x₁, x₂) = (2x₁ + x₂, x₁ + x₂). Verify that TT⁻¹ = T⁻¹T = I.
Definition:

Inverse transformation: T⁻¹ such that TT⁻¹ = T⁻¹T = I (identity transformation)

Original T
A = \(\begin{bmatrix} 2 & 1 \\ 1 & 1 \end{bmatrix}\)
Inverse T⁻¹
A⁻¹ = \(\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)
Step 1: Find matrix A for T

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}\)

Step 2: Find A⁻¹ using formula

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}\)

Step 3: Verify AA⁻¹ = I

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\) ✓

Step 4: Verify A⁻¹A = 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\) ✓

A⁻¹ = \(\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)
Final answer:

The inverse transformation matrix is \(\begin{bmatrix} 1 & -1 \\ -1 & 2 \end{bmatrix}\)

Applied rules:

• Inverse formula: A⁻¹ = (1/det(A))adj(A)

• Verification: AA⁻¹ = A⁻¹A = I

• Existence: Only when det(A) ≠ 0

Linear Transformations: Comprehensive Guide
T(cv + dw) = cT(v) + dT(w)
Linearity Condition
Key definitions:

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

Complete methodology:
  1. Verify linearity: Check T(cv + dw) = cT(v) + dT(w)
  2. Find standard matrix: Apply T to standard basis vectors
  3. Compute properties: Kernel, image, rank, nullity
  4. Verify results: Test with sample vectors
Tip 1: Every linear transformation is completely determined by its action on a basis.
Tip 2: For transformations, composition corresponds to matrix multiplication.
Tip 3: A transformation has an inverse if and only if its matrix has non-zero determinant.
Tip 4: Rank-nullity theorem: dim(kernel) + dim(image) = domain dimension.
Common errors: Confusing domain/codomain dimensions, forgetting to verify linearity, misapplying composition order.
Exam preparation: Master standard forms, practice composition, understand kernel/image relationships.
Properties to know by heart:

• 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

Transformation Properties Visualization
Exercise 6: Property Analysis
Visual analysis of transformation properties:
• 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

Questions & Answers

Question: How do I determine if a transformation is linear? What exactly does the linearity condition mean geometrically?

Answer: To check if a transformation T is linear, verify both conditions:

  • Additivity: T(u + v) = T(u) + T(v) for all vectors u, v
  • Homogeneity: T(cv) = cT(v) for all vectors v and scalars c

These combine into the single linearity condition: T(cv + dw) = cT(v) + dT(w).

Geometrically:

  • Lines map to lines (preserves straightness)
  • Origin maps to origin (T(0) = 0)
  • Parallelograms map to parallelograms
  • Uniform scaling and shearing, but no translation

For example, T(x,y) = (2x+y, x-y) is linear, but T(x,y) = (2x+3, y) is not (the constant term breaks linearity).

Question: Why is the standard matrix formed by applying T to basis vectors? What makes this work?

Answer: This works due to the fundamental property of linearity and the concept of spanning sets.

Since any vector v can be written as a linear combination of basis vectors:

v = x₁e₁ + x₂e₂ + ... + xₙeₙ

And since T is linear:

T(v) = T(x₁e₁ + x₂e₂ + ... + xₙeₙ) = x₁T(e₁) + x₂T(e₂) + ... + xₙT(eₙ)

This is exactly the matrix-vector product Av where A has columns T(e₁), T(e₂), ..., T(eₙ).

The standard basis is particularly convenient because the coordinates of a vector directly become the weights in the linear combination, making the matrix construction straightforward.

This is why we call these matrices "standard" - they use the standard basis vectors as reference.

Question: What are the practical implications of the correspondence between linear transformations and matrices?

Answer: This correspondence is fundamental to many fields:

  • Computer Graphics: Transformations (rotation, scaling, translation) are implemented as matrix operations
  • Machine Learning: Neural networks apply matrix transformations followed by nonlinearities
  • Physics: Coordinate transformations, quantum mechanics operators
  • Engineering: System dynamics, control theory, signal processing
  • Economics: Input-output models, Markov chains

The correspondence allows us to:

  • Compose transformations using matrix multiplication
  • Find inverses using matrix inversion
  • Analyze properties using matrix algebra
  • Implement efficiently using optimized linear algebra libraries

This mathematical framework enables the efficient computation of complex geometric and algebraic operations that underpin much of modern technology.