Solved Exercises on Linear Transformations as Matrix-Vector Products

Master linear transformations, matrix-vector products, and their applications through these 5 detailed exercises.

Linear Transformations as Matrix-Vector Products - Comprehensive Summary

Definitions

Linear Transformation: A function T: \(\mathbb{R}^n \to \mathbb{R}^m\) that satisfies: T(u+v) = T(u) + T(v) and T(cu) = cT(u)

Matrix-Vector Product: The result of multiplying a matrix A by a vector x, denoted Ax

Standard Matrix: For any linear transformation T: \(\mathbb{R}^n \to \mathbb{R}^m\), there exists a unique matrix A such that T(x) = Ax

Core Rules

• Every linear transformation can be represented as a matrix-vector product

• The standard matrix is formed by applying T to standard basis vectors

• Matrix multiplication preserves linear combinations

• Composition of transformations corresponds to matrix multiplication

Methods

1. Find standard matrix: Apply T to standard basis vectors

2. Verify linearity: Check additivity and homogeneity

3. Compute transformation: Perform matrix-vector multiplication

4. Analyze properties: Determine injectivity, surjectivity, etc.

Key Tips

• Always verify that transformations are linear before using matrix representation

• The standard matrix has columns T(e₁), T(e₂), ..., T(eₙ)

• Matrix-vector products follow standard multiplication rules

• Use geometric intuition for transformations in R² and R³

Solution: Exercises 1 to 3
1 Basic Linear Transformation
Exercise 1
Let \(T: \mathbb{R}^2 \to \mathbb{R}^2\) be defined by \(T\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} 2x_1 + 3x_2 \\ x_1 - x_2 \end{pmatrix}\). Find the standard matrix A such that T(x) = Ax.
Definition:

Standard Matrix: For a linear transformation \(T: \mathbb{R}^n \to \mathbb{R}^m\), the standard matrix A is the \(m \times n\) matrix whose columns are the images of the standard basis vectors: \(A = [T(\vec{e_1}) \, T(\vec{e_2}) \, \ldots \, T(\vec{e_n})]\).

Standard Matrix Method:
  1. Identify the standard basis vectors for the domain
  2. Apply the transformation to each standard basis vector
  3. Form the matrix with these transformed vectors as columns
  4. Verify that T(x) = Ax for any vector x
Standard Basis
\(\vec{e_1} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}, \vec{e_2} = \begin{pmatrix} 0 \\ 1 \end{pmatrix}\)
Transformations
\(T(\vec{e_1}) = \begin{pmatrix} 2 \\ 1 \end{pmatrix}, T(\vec{e_2}) = \begin{pmatrix} 3 \\ -1 \end{pmatrix}\)
Standard Matrix
\(A = \begin{pmatrix} 2 & 3 \\ 1 & -1 \end{pmatrix}\)
Step 1: Identify standard basis vectors

For \(\mathbb{R}^2\), the standard basis vectors are: \(\vec{e_1} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}\) and \(\vec{e_2} = \begin{pmatrix} 0 \\ 1 \end{pmatrix}\).

Step 2: Apply transformation to \(\vec{e_1}\)

\(T(\vec{e_1}) = T\begin{pmatrix} 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 2(1) + 3(0) \\ 1 - 0 \end{pmatrix} = \begin{pmatrix} 2 \\ 1 \end{pmatrix}\)

Step 3: Apply transformation to \(\vec{e_2}\)

\(T(\vec{e_2}) = T\begin{pmatrix} 0 \\ 1 \end{pmatrix} = \begin{pmatrix} 2(0) + 3(1) \\ 0 - 1 \end{pmatrix} = \begin{pmatrix} 3 \\ -1 \end{pmatrix}\)

Step 4: Form the standard matrix

The standard matrix A has columns \(T(\vec{e_1})\) and \(T(\vec{e_2})\):

\(A = \begin{pmatrix} 2 & 3 \\ 1 & -1 \end{pmatrix}\)

Step 5: Verify the result

Check that \(T(\vec{x}) = A\vec{x}\) for any \(\vec{x} = \begin{pmatrix} x_1 \\ x_2 \end{pmatrix}\):

\(A\vec{x} = \begin{pmatrix} 2 & 3 \\ 1 & -1 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} 2x_1 + 3x_2 \\ x_1 - x_2 \end{pmatrix} = T(\vec{x})\). ✓

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

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

Applied rules:

• Standard matrix theorem: Every linear transformation has a unique matrix representation

• Column method: Standard matrix columns are transformations of basis vectors

• Verification: Always check that T(x) = Ax for arbitrary x

2 Transformation Verification
Exercise 2
Let \(T: \mathbb{R}^2 \to \mathbb{R}^2\) be defined by \(T\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} x_1^2 \\ x_2 \end{pmatrix}\). Show that T is not a linear transformation.
Definition:

Linear Transformation: A function T is linear if it satisfies both: (1) Additivity: \(T(\vec{u} + \vec{v}) = T(\vec{u}) + T(\vec{v})\), and (2) Homogeneity: \(T(c\vec{u}) = cT(\vec{u})\).

Additivity Check
\(T(\vec{u} + \vec{v}) \neq T(\vec{u}) + T(\vec{v})\)
Homogeneity Check
\(T(c\vec{u}) \neq cT(\vec{u})\)
Conclusion
Not linear
Step 1: Check additivity property

Let \(\vec{u} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}\) and \(\vec{v} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}\).

Compute \(T(\vec{u} + \vec{v})\):

\(T\begin{pmatrix} 1 \\ 0 \end{pmatrix} + \begin{pmatrix} 1 \\ 0 \end{pmatrix} = T\begin{pmatrix} 2 \\ 0 \end{pmatrix} = \begin{pmatrix} 2^2 \\ 0 \end{pmatrix} = \begin{pmatrix} 4 \\ 0 \end{pmatrix}\)

Step 2: Compute \(T(\vec{u}) + T(\vec{v})\)

\(T(\vec{u}) = T\begin{pmatrix} 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 1^2 \\ 0 \end{pmatrix} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}\)

\(T(\vec{v}) = T\begin{pmatrix} 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 1^2 \\ 0 \end{pmatrix} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}\)

Therefore: \(T(\vec{u}) + T(\vec{v}) = \begin{pmatrix} 1 \\ 0 \end{pmatrix} + \begin{pmatrix} 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 2 \\ 0 \end{pmatrix}\)

Step 3: Compare results

We have: \(T(\vec{u} + \vec{v}) = \begin{pmatrix} 4 \\ 0 \end{pmatrix} \neq \begin{pmatrix} 2 \\ 0 \end{pmatrix} = T(\vec{u}) + T(\vec{v})\)

Since additivity fails, T is not linear. ✓

Step 4: Check homogeneity property (verification)

Let \(\vec{u} = \begin{pmatrix} 1 \\ 0 \end{pmatrix}\) and \(c = 2\).

Compute \(T(c\vec{u})\):

\(T(2\begin{pmatrix} 1 \\ 0 \end{pmatrix}) = T\begin{pmatrix} 2 \\ 0 \end{pmatrix} = \begin{pmatrix} 2^2 \\ 0 \end{pmatrix} = \begin{pmatrix} 4 \\ 0 \end{pmatrix}\)

Step 5: Compute \(cT(\vec{u})\)

\(cT(\vec{u}) = 2T\begin{pmatrix} 1 \\ 0 \end{pmatrix} = 2\begin{pmatrix} 1^2 \\ 0 \end{pmatrix} = 2\begin{pmatrix} 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 2 \\ 0 \end{pmatrix}\)

Step 6: Compare results

We have: \(T(c\vec{u}) = \begin{pmatrix} 4 \\ 0 \end{pmatrix} \neq \begin{pmatrix} 2 \\ 0 \end{pmatrix} = cT(\vec{u})\)

Homogeneity also fails. ✓

T is not a linear transformation.
Final answer:

T is not a linear transformation because it fails both the additivity and homogeneity properties.

Applied rules:

• Additivity test: \(T(\vec{u} + \vec{v}) = T(\vec{u}) + T(\vec{v})\) must hold

• Homogeneity test: \(T(c\vec{u}) = cT(\vec{u})\) must hold

• Counterexample: One violation is sufficient to prove non-linearity

3 Matrix-Vector Product
Exercise 3
Let \(A = \begin{pmatrix} 1 & 2 & 3 \\ 0 & 1 & 4 \\ 5 & 0 & 1 \end{pmatrix}\) and \(\vec{x} = \begin{pmatrix} 2 \\ -1 \\ 3 \end{pmatrix}\). Compute \(A\vec{x}\) and interpret as a linear transformation.
Definition:

Matrix-Vector Product: The product \(A\vec{x}\) is computed by taking linear combinations of the columns of A using the components of \(\vec{x}\) as weights: \(A\vec{x} = x_1\vec{a_1} + x_2\vec{a_2} + \ldots + x_n\vec{a_n}\).

Matrix A
\(A = \begin{pmatrix} 1 & 2 & 3 \\ 0 & 1 & 4 \\ 5 & 0 & 1 \end{pmatrix}\)
Vector x
\(\vec{x} = \begin{pmatrix} 2 \\ -1 \\ 3 \end{pmatrix}\)
Result
\(A\vec{x} = \begin{pmatrix} 9 \\ 11 \\ 13 \end{pmatrix}\)
Step 1: Identify the columns of A

\(\vec{a_1} = \begin{pmatrix} 1 \\ 0 \\ 5 \end{pmatrix}\), \(\vec{a_2} = \begin{pmatrix} 2 \\ 1 \\ 0 \end{pmatrix}\), \(\vec{a_3} = \begin{pmatrix} 3 \\ 4 \\ 1 \end{pmatrix}\)

Step 2: Compute the linear combination

\(A\vec{x} = x_1\vec{a_1} + x_2\vec{a_2} + x_3\vec{a_3}\)

\(= 2\begin{pmatrix} 1 \\ 0 \\ 5 \end{pmatrix} + (-1)\begin{pmatrix} 2 \\ 1 \\ 0 \end{pmatrix} + 3\begin{pmatrix} 3 \\ 4 \\ 1 \end{pmatrix}\)

\(= \begin{pmatrix} 2 \\ 0 \\ 10 \end{pmatrix} + \begin{pmatrix} -2 \\ -1 \\ 0 \end{pmatrix} + \begin{pmatrix} 9 \\ 12 \\ 3 \end{pmatrix}\)

\(= \begin{pmatrix} 2 - 2 + 9 \\ 0 - 1 + 12 \\ 10 + 0 + 3 \end{pmatrix} = \begin{pmatrix} 9 \\ 11 \\ 13 \end{pmatrix}\)

Step 3: Verify using row-by-column method

Row 1: \((1)(2) + (2)(-1) + (3)(3) = 2 - 2 + 9 = 9\)

Row 2: \((0)(2) + (1)(-1) + (4)(3) = 0 - 1 + 12 = 11\)

Row 3: \((5)(2) + (0)(-1) + (1)(3) = 10 + 0 + 3 = 13\)

Result: \(\begin{pmatrix} 9 \\ 11 \\ 13 \end{pmatrix}\). ✓

Step 4: Interpretation as linear transformation

The matrix A represents a linear transformation \(T_A: \mathbb{R}^3 \to \mathbb{R}^3\) where \(T_A(\vec{x}) = A\vec{x}\).

This transformation maps the input vector \(\begin{pmatrix} 2 \\ -1 \\ 3 \end{pmatrix}\) to the output vector \(\begin{pmatrix} 9 \\ 11 \\ 13 \end{pmatrix}\).

Step 5: Properties verification

Since A is a matrix, the transformation \(T_A\) is linear, satisfying:

- Additivity: \(T_A(\vec{u} + \vec{v}) = T_A(\vec{u}) + T_A(\vec{v})\)

- Homogeneity: \(T_A(c\vec{u}) = cT_A(\vec{u})\)

\(A\vec{x} = \begin{pmatrix} 9 \\ 11 \\ 13 \end{pmatrix}\)
Final answer:

The matrix-vector product is \(A\vec{x} = \begin{pmatrix} 9 \\ 11 \\ 13 \end{pmatrix}\). This represents the linear transformation of \(\vec{x}\) by matrix A.

Applied rules:

• Column interpretation: Matrix-vector product is linear combination of columns

• Row-by-column: Alternative method using dot products

• Linear transformation: Every matrix represents a linear transformation

Linear Transformations Properties
\(T(\vec{x}) = A\vec{x} \Leftrightarrow A = [T(\vec{e_1}) \, T(\vec{e_2}) \, \ldots \, T(\vec{e_n})]\)
Standard Matrix Formula
Linearity
\(T(c\vec{u} + d\vec{v}) = cT(\vec{u}) + dT(\vec{v})\)
All linear transformations preserve linear combinations
Composition
\(T_A \circ T_B = T_{AB}\)
Composition of transformations corresponds to matrix multiplication
Inverse
\(T_A^{-1} = T_{A^{-1}}\)
Inverse transformation corresponds to inverse matrix
Uniqueness: Every linear transformation has exactly one standard matrix representation
Geometric Interpretation: Linear transformations preserve straight lines and ratios of distances
Kernel and Range: The null space of A is the kernel of T, and column space of A is the range of T
Solution: Exercises 4 to 5
4 Composition of Transformations
Exercise 4
Let \(T_1: \mathbb{R}^2 \to \mathbb{R}^2\) be defined by \(T_1\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} x_1 + x_2 \\ 2x_1 - x_2 \end{pmatrix}\) and \(T_2: \mathbb{R}^2 \to \mathbb{R}^2\) be defined by \(T_2\begin{pmatrix} x_1 \\ x_2 \end{pmatrix} = \begin{pmatrix} 3x_1 \\ x_1 + 2x_2 \end{pmatrix}\). Find the standard matrix for the composition \(T_2 \circ T_1\).
Definition:

Composition of Transformations: The composition \((T_2 \circ T_1)(\vec{x}) = T_2(T_1(\vec{x}))\) is the transformation obtained by applying \(T_1\) first, then \(T_2\). The standard matrix of the composition is the product of the individual standard matrices.

Standard Matrices
\(A_1 = \begin{pmatrix} 1 & 1 \\ 2 & -1 \end{pmatrix}\), \(A_2 = \begin{pmatrix} 3 & 0 \\ 1 & 2 \end{pmatrix}\)
Composition Matrix
\(A_2A_1 = \begin{pmatrix} 3 & 3 \\ 5 & -1 \end{pmatrix}\)
Verification
Direct computation matches
Step 1: Find the standard matrix for \(T_1\)

Apply \(T_1\) to standard basis vectors:

\(T_1\begin{pmatrix} 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 1 \\ 2 \end{pmatrix}\), \(T_1\begin{pmatrix} 0 \\ 1 \end{pmatrix} = \begin{pmatrix} 1 \\ -1 \end{pmatrix}\)

So \(A_1 = \begin{pmatrix} 1 & 1 \\ 2 & -1 \end{pmatrix}\)

Step 2: Find the standard matrix for \(T_2\)

Apply \(T_2\) to standard basis vectors:

\(T_2\begin{pmatrix} 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 3 \\ 1 \end{pmatrix}\), \(T_2\begin{pmatrix} 0 \\ 1 \end{pmatrix} = \begin{pmatrix} 0 \\ 2 \end{pmatrix}\)

So \(A_2 = \begin{pmatrix} 3 & 0 \\ 1 & 2 \end{pmatrix}\)

Step 3: Compute the composition matrix

The standard matrix for \(T_2 \circ T_1\) is \(A_2A_1\):

\(A_2A_1 = \begin{pmatrix} 3 & 0 \\ 1 & 2 \end{pmatrix}\begin{pmatrix} 1 & 1 \\ 2 & -1 \end{pmatrix}\)

Row 1, Col 1: \((3)(1) + (0)(2) = 3\)

Row 1, Col 2: \((3)(1) + (0)(-1) = 3\)

Row 2, Col 1: \((1)(1) + (2)(2) = 5\)

Row 2, Col 2: \((1)(1) + (2)(-1) = -1\)

Therefore: \(A_2A_1 = \begin{pmatrix} 3 & 3 \\ 5 & -1 \end{pmatrix}\)

Step 4: Verification by direct computation

Let's verify with \(\vec{x} = \begin{pmatrix} 1 \\ 1 \end{pmatrix}\):

\(T_1\begin{pmatrix} 1 \\ 1 \end{pmatrix} = \begin{pmatrix} 1+1 \\ 2-1 \end{pmatrix} = \begin{pmatrix} 2 \\ 1 \end{pmatrix}\)

\(T_2\begin{pmatrix} 2 \\ 1 \end{pmatrix} = \begin{pmatrix} 3(2) \\ 2 + 2(1) \end{pmatrix} = \begin{pmatrix} 6 \\ 4 \end{pmatrix}\)

Step 5: Verify using the composition matrix

\(A_2A_1\begin{pmatrix} 1 \\ 1 \end{pmatrix} = \begin{pmatrix} 3 & 3 \\ 5 & -1 \end{pmatrix}\begin{pmatrix} 1 \\ 1 \end{pmatrix} = \begin{pmatrix} 3+3 \\ 5-1 \end{pmatrix} = \begin{pmatrix} 6 \\ 4 \end{pmatrix}\)

Results match! ✓

Standard matrix for \(T_2 \circ T_1\) is \(\begin{pmatrix} 3 & 3 \\ 5 & -1 \end{pmatrix}\)
Final answer:

The standard matrix for the composition \(T_2 \circ T_1\) is \(\begin{pmatrix} 3 & 3 \\ 5 & -1 \end{pmatrix}\).

Applied rules:

• Composition property: \((T_2 \circ T_1)(\vec{x}) = T_2(T_1(\vec{x}))\)

• Matrix multiplication: Standard matrix of composition is product of individual matrices

• Order matters: \(T_2 \circ T_1\) corresponds to \(A_2A_1\), not \(A_1A_2\)

5 Kernel and Range
Exercise 5
Let \(T: \mathbb{R}^3 \to \mathbb{R}^2\) be defined by \(T\begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} = \begin{pmatrix} x_1 + 2x_2 - x_3 \\ 3x_1 - x_2 + 4x_3 \end{pmatrix}\). Find the kernel and range of T.
Definition:

Kernel (Null Space): \(\ker(T) = \{\vec{x} \in \mathbb{R}^n \mid T(\vec{x}) = \vec{0}\}\). This is the set of all vectors that T maps to the zero vector.

Range (Image): \(\text{range}(T) = \{T(\vec{x}) \mid \vec{x} \in \mathbb{R}^n\}\). This is the set of all possible outputs of T.

Standard Matrix
\(A = \begin{pmatrix} 1 & 2 & -1 \\ 3 & -1 & 4 \end{pmatrix}\)
Kernel
\(\ker(T) = \{\vec{0}\}\)
Range
\(\text{range}(T) = \mathbb{R}^2\)
Step 1: Find the standard matrix A

Apply T to standard basis vectors:

\(T\begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix} = \begin{pmatrix} 1 \\ 3 \end{pmatrix}\), \(T\begin{pmatrix} 0 \\ 1 \\ 0 \end{pmatrix} = \begin{pmatrix} 2 \\ -1 \end{pmatrix}\), \(T\begin{pmatrix} 0 \\ 0 \\ 1 \end{pmatrix} = \begin{pmatrix} -1 \\ 4 \end{pmatrix}\)

So \(A = \begin{pmatrix} 1 & 2 & -1 \\ 3 & -1 & 4 \end{pmatrix}\)

Step 2: Find the kernel of T

Solve \(A\vec{x} = \vec{0}\): \(\begin{pmatrix} 1 & 2 & -1 \\ 3 & -1 & 4 \end{pmatrix}\begin{pmatrix} x_1 \\ x_2 \\ x_3 \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}\)

This gives the system: \(x_1 + 2x_2 - x_3 = 0\) and \(3x_1 - x_2 + 4x_3 = 0\)

Row reduce the augmented matrix: \(\begin{pmatrix} 1 & 2 & -1 & | & 0 \\ 3 & -1 & 4 & | & 0 \end{pmatrix}\)

\(R_2 \leftarrow R_2 - 3R_1\): \(\begin{pmatrix} 1 & 2 & -1 & | & 0 \\ 0 & -7 & 7 & | & 0 \end{pmatrix}\)

\(R_2 \leftarrow -\frac{1}{7}R_2\): \(\begin{pmatrix} 1 & 2 & -1 & | & 0 \\ 0 & 1 & -1 & | & 0 \end{pmatrix}\)

\(R_1 \leftarrow R_1 - 2R_2\): \(\begin{pmatrix} 1 & 0 & 1 & | & 0 \\ 0 & 1 & -1 & | & 0 \end{pmatrix}\)

So: \(x_1 + x_3 = 0\) and \(x_2 - x_3 = 0\), which gives \(x_1 = -x_3\) and \(x_2 = x_3\)

Let \(x_3 = t\), then: \(\vec{x} = \begin{pmatrix} -t \\ t \\ t \end{pmatrix} = t\begin{pmatrix} -1 \\ 1 \\ 1 \end{pmatrix}\)

Therefore: \(\ker(T) = \text{span}\left\{\begin{pmatrix} -1 \\ 1 \\ 1 \end{pmatrix}\right\}\)

Step 3: Find the range of T

The range of T is the column space of A. Since A is \(2 \times 3\), the range is a subspace of \(\mathbb{R}^2\).

From the row reduction above, the first two columns of A are linearly independent (they form a basis for the column space).

So \(\text{range}(T) = \text{span}\left\{\begin{pmatrix} 1 \\ 3 \end{pmatrix}, \begin{pmatrix} 2 \\ -1 \end{pmatrix}\right\}\).

Since these two vectors are linearly independent in \(\mathbb{R}^2\), they span all of \(\mathbb{R}^2\).

Therefore: \(\text{range}(T) = \mathbb{R}^2\).

Step 4: Verify with Rank-Nullity Theorem

\(\dim(\ker(T)) + \dim(\text{range}(T)) = 1 + 2 = 3 = \dim(\text{domain})\). ✓

\(\ker(T) = \text{span}\left\{\begin{pmatrix} -1 \\ 1 \\ 1 \end{pmatrix}\right\}\), \(\text{range}(T) = \mathbb{R}^2\)
Final answer:

The kernel of T is \(\text{span}\left\{\begin{pmatrix} -1 \\ 1 \\ 1 \end{pmatrix}\right\}\) and the range of T is \(\mathbb{R}^2\).

Applied rules:

• Kernel computation: Solve homogeneous system \(A\vec{x} = \vec{0}\)

• Range computation: Find column space of the standard matrix

• Rank-Nullity theorem: Verify that dimensions add to domain dimension

Linear Transformations: Advanced Concepts
\(T(\vec{x}) = A\vec{x} \Rightarrow \ker(T) = \text{null}(A), \text{range}(T) = \text{col}(A)\)
Kernel-Range Connection
Key definitions:

Linear Transformation: A function that preserves vector addition and scalar multiplication, always representable as matrix-vector multiplication.

Standard Matrix: The unique matrix that represents a linear transformation with respect to standard bases.

Kernel: The null space of the transformation, representing all vectors mapped to zero.

Range: The column space of the transformation, representing all possible outputs.

Complete methodology:
  1. For standard matrix: Apply transformation to standard basis vectors
  2. For kernel: Solve homogeneous system Ax = 0
  3. For range: Find column space of standard matrix
  4. For composition: Multiply corresponding matrices in reverse order
Tip 1: Always verify that transformations are linear before finding standard matrices.
Tip 2: The standard matrix columns are T(e₁), T(e₂), ..., T(eₙ).
Tip 3: Use row reduction for kernel and range calculations.
Tip 4: Check your results using the rank-nullity theorem.
Common errors: Forgetting to verify linearity, incorrect order in composition, misidentifying standard basis vectors.
Applications: Computer graphics, robotics, physics simulations, machine learning, signal processing.
Properties to know by heart:

• Every linear transformation has a unique matrix representation

• Composition of transformations corresponds to matrix multiplication

• The kernel of T equals the null space of its standard matrix

• The range of T equals the column space of its standard matrix

• Injective ⟺ kernel contains only zero vector

Linear Transformations Visualization: Geometric Interpretation
Exercise 6: Transformation Effects
Visualize how the linear transformation \(T\begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} 2x + y \\ x - y \end{pmatrix}\) affects the unit square with vertices at (0,0), (1,0), (1,1), and (0,1).

Geometric Interpretation: Linear transformations preserve straight lines and ratios of distances, mapping the unit square to a parallelogram.

  • Original unit square: vertices (0,0), (1,0), (1,1), (0,1)
  • Transformed vertices: (0,0), (2,1), (3,0), (1,-1)
  • Linear transformations map parallelograms to parallelograms
  • The transformation matrix is \(\begin{pmatrix} 2 & 1 \\ 1 & -1 \end{pmatrix}\)

Questions & Answers

Question: I'm confused about why every linear transformation can be represented as a matrix-vector product. Why is this true?

Answer: This is a fundamental theorem in linear algebra! Here's the intuition:

Key idea: Since linear transformations preserve linear combinations, knowing where the transformation sends the basis vectors completely determines the transformation.

Proof outline:

  • Let \(T: \mathbb{R}^n \to \mathbb{R}^m\) be a linear transformation
  • Any vector \(\vec{x} \in \mathbb{R}^n\) can be written as \(\vec{x} = x_1\vec{e_1} + x_2\vec{e_2} + \ldots + x_n\vec{e_n}\)
  • By linearity: \(T(\vec{x}) = T(x_1\vec{e_1} + \ldots + x_n\vec{e_n}) = x_1T(\vec{e_1}) + \ldots + x_nT(\vec{e_n})\)
  • This is exactly the matrix-vector product where columns of A are \(T(\vec{e_i})\)

This is why the standard matrix is formed by applying T to the standard basis vectors.

Question: Why does the composition of transformations correspond to matrix multiplication in the reverse order? If we do \(T_2 \circ T_1\), why is the matrix \(A_2A_1\) and not \(A_1A_2\)?

Answer: This is a common source of confusion! The "reverse order" makes perfect sense when you think about function composition:

Function notation: \((T_2 \circ T_1)(\vec{x}) = T_2(T_1(\vec{x}))\)

Reading from inside out: We apply \(T_1\) first, then \(T_2\)

Matrix representation: If \(T_1(\vec{x}) = A_1\vec{x}\) and \(T_2(\vec{x}) = A_2\vec{x}\), then:

\((T_2 \circ T_1)(\vec{x}) = T_2(T_1(\vec{x})) = T_2(A_1\vec{x}) = A_2(A_1\vec{x}) = (A_2A_1)\vec{x}\)

So the matrix of \(T_2 \circ T_1\) is \(A_2A_1\). The first transformation applied corresponds to the rightmost matrix.

Question: What's the relationship between the kernel of a linear transformation and its standard matrix?

Answer: The relationship is exact and fundamental:

Kernel equals Null Space: If \(T(\vec{x}) = A\vec{x}\), then \(\ker(T) = \text{null}(A) = \{\vec{x} \mid A\vec{x} = \vec{0}\}\)

Why this is true:

  • \(\vec{x} \in \ker(T)\) means \(T(\vec{x}) = \vec{0}\)
  • Since \(T(\vec{x}) = A\vec{x}\), this means \(A\vec{x} = \vec{0}\)
  • So \(\vec{x} \in \text{null}(A)\)
  • Therefore \(\ker(T) = \text{null}(A)\)

This connection allows us to use matrix methods to analyze properties of linear transformations. The dimension of the kernel equals the nullity of the matrix, and the dimension of the range equals the rank of the matrix.

Question: How are linear transformations used in computer graphics?

Answer: Linear transformations are fundamental in computer graphics:

Basic transformations:

  • Scaling: Stretch or shrink objects uniformly or differently in each direction
  • Rotation: Rotate objects around axes using rotation matrices
  • Shearing: Skew objects by applying shearing transformations

3D graphics pipeline:

  • Objects are transformed from model space to world space
  • Then to camera/view space using view transformation
  • Finally to screen space using projection transformation

Each transformation is represented as a matrix, and the final transformation is the product of all individual transformation matrices. This allows for efficient computation and smooth animation.

Question: How do linear transformations relate to machine learning?

Answer: Linear transformations are everywhere in machine learning:

Neural networks:

  • Each layer applies a linear transformation followed by a non-linear activation
  • Weights of a layer form the transformation matrix

Dimensionality reduction:

  • PCA projects data using linear transformations
  • Autoencoders learn efficient linear representations

Feature engineering:

  • Linear combinations of features create new representations
  • Preprocessing often involves linear transformations

Understanding linear transformations helps in designing architectures, preprocessing data, and interpreting models.