Skip to main content

Section 6.2 Understand the linear transformation

In this section, we will learn how to understand a linear transformation through its matrix, which turns the abstract definition of a linear transformation into a concrete object that we can analyze and compute with. We will see how to find the matrix representation of a linear transformation relative to given bases, and how to use that matrix to understand the properties of the transformation.

Subsection 6.2.1 Matrix relative to bases

Definition 6.2.1. Matrix Relative to Bases.

Let \(V\) and \(W\) be vector spaces with bases \(\alpha=\{\alpha_1,\alpha_2,\ldots,\alpha_n\}\) and \(\beta=\{\beta_1,\beta_2,\ldots,\beta_m\}\text{,}\) respectively. Let \(T\) be a linear transformation from \(V\) to \(W\text{.}\) Then the matrix
\begin{equation*} [T]_{\alpha}^{\beta} = \Big[[T(\mathbf{\alpha}_1)]_\beta\quad [T(\mathbf{\alpha}_2)]_\beta\quad \ldots\quad [T(\mathbf{\alpha}_n)]_\beta\Big] \end{equation*}
is called the matrix of \(T\) relative to the bases \(\alpha\) and \(\beta\text{.}\)
If \(V=W\) and \(\alpha=\beta\text{,}\) then \([T]_{\alpha}^{\beta}\) will be written as \([T]_{\alpha}.\)

How to compute \([T]_{\alpha}^{\beta}\).

  1. Apply \(T\) to each basis vector in \(\alpha\text{:}\) compute \(T(\alpha_1), T(\alpha_2), \ldots, T(\alpha_n)\text{.}\)
  2. Express each image \(T(\alpha_i)\) as a linear combination of basis vectors in \(\beta\text{:}\)
    \begin{equation*} T(\alpha_i) = c_{1i}\beta_1 + c_{2i}\beta_2 + \cdots + c_{mi}\beta_m. \end{equation*}
  3. The coordinate vector \([T(\alpha_i)]_\beta = \begin{bmatrix} c_{1i} \\ c_{2i} \\ \vdots \\ c_{mi} \end{bmatrix}\) forms the \(i\)-th column of \([T]_{\alpha}^{\beta}\text{.}\)
  4. Assemble the matrix: \([T]_{\alpha}^{\beta} = \Big[[T(\alpha_1)]_\beta\quad [T(\alpha_2)]_\beta\quad \cdots\quad [T(\alpha_n)]_\beta\Big]\text{.}\)

Activity 6.2.1. Computing Matrix Representation \([T]_{\alpha}\).

Let \(T:\mathbb{R}^{3}\rightarrow \mathbb{R}^{3}\) be a linear transformation defined by
\begin{equation*} T\left(\begin{bmatrix} x_1 \\ x_2 \\ x_3 \end{bmatrix}\right)=\begin{bmatrix} x_1+3x_2 \\ 3x_1+x_2\\ -2x_3 \end{bmatrix}, \end{equation*}
and let \(\alpha=\left\{\mathbf{\alpha}_1=\begin{bmatrix} 1\\ 1\\ 0 \end{bmatrix}, \mathbf{\alpha}_2=\begin{bmatrix} 1\\ -1\\ 0 \end{bmatrix}, \mathbf{\alpha}_3=\begin{bmatrix} 0\\ 0\\ 1 \end{bmatrix}\right\}\) be a basis for \(\mathbb{R}^3\text{.}\)
We will compute the matrix \([T]_{\alpha}\) step by step.
(a)
Compute \(T(\mathbf{\alpha}_1)\) where \(\mathbf{\alpha}_1=\begin{bmatrix} 1\\ 1\\ 0 \end{bmatrix}\text{.}\)
Solution.
We have
\begin{equation*} T(\mathbf{\alpha}_1) = T\left(\begin{bmatrix} 1\\ 1\\ 0 \end{bmatrix}\right) = \begin{bmatrix} 1+3(1)\\ 3(1)+1\\ -2(0) \end{bmatrix} = \begin{bmatrix} 4\\ 4\\ 0 \end{bmatrix}. \end{equation*}
(b)
Compute \(T(\mathbf{\alpha}_2)\) where \(\mathbf{\alpha}_2=\begin{bmatrix} 1\\ -1\\ 0 \end{bmatrix}\text{.}\)
Solution.
We have
\begin{equation*} T(\mathbf{\alpha}_2) = T\left(\begin{bmatrix} 1\\ -1\\ 0 \end{bmatrix}\right) = \begin{bmatrix} 1+3(-1)\\ 3(1)+(-1)\\ -2(0) \end{bmatrix} = \begin{bmatrix} -2\\ 2\\ 0 \end{bmatrix}. \end{equation*}
(c)
Compute \(T(\mathbf{\alpha}_3)\) where \(\mathbf{\alpha}_3=\begin{bmatrix} 0\\ 0\\ 1 \end{bmatrix}\text{.}\)
Solution.
We have
\begin{equation*} T(\mathbf{\alpha}_3) = T\left(\begin{bmatrix} 0\\ 0\\ 1 \end{bmatrix}\right) = \begin{bmatrix} 0+3(0)\\ 3(0)+0\\ -2(1) \end{bmatrix} = \begin{bmatrix} 0\\ 0\\ -2 \end{bmatrix}. \end{equation*}
(d)
Express \(T(\mathbf{\alpha}_1) = \begin{bmatrix} 4\\ 4\\ 0 \end{bmatrix}\) as a linear combination of the basis vectors in \(\alpha\text{.}\) That is, find \(c_1, c_2, c_3\) such that
\begin{equation*} \begin{bmatrix} 4\\ 4\\ 0 \end{bmatrix} = c_1\begin{bmatrix} 1\\ 1\\ 0 \end{bmatrix} + c_2\begin{bmatrix} 1\\ -1\\ 0 \end{bmatrix} + c_3\begin{bmatrix} 0\\ 0\\ 1 \end{bmatrix}. \end{equation*}
Solution.
We need to solve the system
\begin{equation*} \begin{bmatrix} 1 \amp 1 \amp 0 \\ 1 \amp -1 \amp 0 \\ 0 \amp 0 \amp 1 \end{bmatrix} \begin{bmatrix} c_1 \\ c_2 \\ c_3 \end{bmatrix} = \begin{bmatrix} 4 \\ 4 \\ 0 \end{bmatrix}. \end{equation*}
We form the augmented matrix and reduce to RREF:
\begin{align*} \left[\begin{array}{ccc|c} 1 \amp 1 \amp 0 \amp 4 \\ 1 \amp -1 \amp 0 \amp 4 \\ 0 \amp 0 \amp 1 \amp 0 \end{array}\right] \amp\xrightarrow{R_2 - R_1} \left[\begin{array}{ccc|c} 1 \amp 1 \amp 0 \amp 4 \\ 0 \amp -2 \amp 0 \amp 0 \\ 0 \amp 0 \amp 1 \amp 0 \end{array}\right]\\ \amp\xrightarrow{-\frac{1}{2}R_2} \left[\begin{array}{ccc|c} 1 \amp 1 \amp 0 \amp 4 \\ 0 \amp 1 \amp 0 \amp 0 \\ 0 \amp 0 \amp 1 \amp 0 \end{array}\right]\\ \amp\xrightarrow{R_1 - R_2} \left[\begin{array}{ccc|c} 1 \amp 0 \amp 0 \amp 4 \\ 0 \amp 1 \amp 0 \amp 0 \\ 0 \amp 0 \amp 1 \amp 0 \end{array}\right] \end{align*}
From the RREF, we read off the solution: \(c_1 = 4\text{,}\) \(c_2 = 0\text{,}\) \(c_3 = 0\text{.}\)
Therefore, \([T(\mathbf{\alpha}_1)]_\alpha = \begin{bmatrix} 4\\ 0\\ 0 \end{bmatrix}\text{.}\)
(e)
Similarly, find \([T(\mathbf{\alpha}_2)]_\alpha\) and \([T(\mathbf{\alpha}_3)]_\alpha\) by solving the systems for \(T(\mathbf{\alpha}_2) = \begin{bmatrix} -2\\ 2\\ 0 \end{bmatrix}\) and \(T(\mathbf{\alpha}_3) = \begin{bmatrix} 0\\ 0\\ -2 \end{bmatrix}\text{.}\)
Solution.
For \([T(\mathbf{\alpha}_2)]_\alpha\text{:}\) We need to solve
\begin{equation*} c_1\begin{bmatrix} 1\\ 1\\ 0 \end{bmatrix} + c_2\begin{bmatrix} 1\\ -1\\ 0 \end{bmatrix} + c_3\begin{bmatrix} 0\\ 0\\ 1 \end{bmatrix} = \begin{bmatrix} -2\\ 2\\ 0 \end{bmatrix}. \end{equation*}
Form the augmented matrix and reduce:
\begin{align*} \left[\begin{array}{ccc|c} 1 \amp 1 \amp 0 \amp -2 \\ 1 \amp -1 \amp 0 \amp 2 \\ 0 \amp 0 \amp 1 \amp 0 \end{array}\right] \amp\xrightarrow{R_2 - R_1} \left[\begin{array}{ccc|c} 1 \amp 1 \amp 0 \amp -2 \\ 0 \amp -2 \amp 0 \amp 4 \\ 0 \amp 0 \amp 1 \amp 0 \end{array}\right]\\ \amp\xrightarrow{-\frac{1}{2}R_2} \left[\begin{array}{ccc|c} 1 \amp 1 \amp 0 \amp -2 \\ 0 \amp 1 \amp 0 \amp -2 \\ 0 \amp 0 \amp 1 \amp 0 \end{array}\right]\\ \amp\xrightarrow{R_1 - R_2} \left[\begin{array}{ccc|c} 1 \amp 0 \amp 0 \amp 0 \\ 0 \amp 1 \amp 0 \amp -2 \\ 0 \amp 0 \amp 1 \amp 0 \end{array}\right] \end{align*}
Therefore, \([T(\mathbf{\alpha}_2)]_\alpha = \begin{bmatrix} 0\\ -2\\ 0 \end{bmatrix}\text{.}\)
For \([T(\mathbf{\alpha}_3)]_\alpha\text{:}\) We need to solve
\begin{equation*} c_1\begin{bmatrix} 1\\ 1\\ 0 \end{bmatrix} + c_2\begin{bmatrix} 1\\ -1\\ 0 \end{bmatrix} + c_3\begin{bmatrix} 0\\ 0\\ 1 \end{bmatrix} = \begin{bmatrix} 0\\ 0\\ -2 \end{bmatrix}. \end{equation*}
From the first two equations, we get \(c_1 = 0\) and \(c_2 = 0\text{.}\) From the third equation, \(c_3 = -2\text{.}\)
Therefore, \([T(\mathbf{\alpha}_3)]_\alpha = \begin{bmatrix} 0\\ 0\\ -2 \end{bmatrix}\text{.}\)
(f)
Assemble the matrix \([T]_{\alpha}\) by placing the coordinate vectors as columns:
\begin{equation*} [T]_{\alpha} = \Big[[T(\mathbf{\alpha}_1)]_\alpha\quad [T(\mathbf{\alpha}_2)]_\alpha\quad [T(\mathbf{\alpha}_3)]_\alpha\Big]. \end{equation*}
Answer.
\begin{equation*} [T]_{\alpha} = \begin{bmatrix} 4 \amp 0 \amp 0 \\ 0 \amp -2 \amp 0 \\ 0 \amp 0 \amp -2 \end{bmatrix} \end{equation*}
(g) Discussion: Is there better way to compute \([T(\mathbf{\alpha}_1)]_\alpha, [T(\mathbf{\alpha}_2)]_\alpha \) and \([T(\mathbf{\alpha}_3)]_\alpha\text{?}\)
We can verify our calculations using SageMath:

Activity 6.2.2. Practice: Computing Matrix Representation with a Different Basis.

Let \(T:\mathbb{R}^{3}\rightarrow \mathbb{R}^{3}\) be a linear transformation defined by the matrix
\begin{equation*} T\left(\begin{bmatrix} x_1 \\ x_2 \\ x_3 \end{bmatrix}\right)=\begin{bmatrix} 4x_1+3x_2-4x_3\\ -x_1+2x_3\\ x_1+x_2 \end{bmatrix}. \end{equation*}
(a)
Find the standard matrix \(A\) of the linear transformation \(T\text{.}\)
(b)
Let \(\beta=\left\{\mathbf{\beta}_1=\begin{bmatrix} 1\\ 0\\ \frac{1}{2} \end{bmatrix}, \mathbf{\beta}_2=\begin{bmatrix} -1\\ 1\\ 0 \end{bmatrix}, \mathbf{\beta}_3=\begin{bmatrix} 1\\ 0\\ 1 \end{bmatrix}\right\}\) be a basis for \(\mathbb{R}^3\text{.}\)
Compute the matrix \([T]_{\beta}\) representation of \(T\) with respect to basis \(\beta\text{.}\)
Exercise: Find the matrix \([T]_{\alpha}\) of the linear map in Example 6.1.10, where \(\alpha=\{1, 1-\frac{1}{2}x,1-x+\frac{1}{4}x^{2}\}\)

Subsection 6.2.2 The Fundamental Relation

Now we establish the key relationship between linear transformations and their matrix representations. This formula is the bridge that connects abstract linear transformations to concrete matrix computations.

Proof.

Let \([\mathbf{v}]_\alpha = \begin{pmatrix} x_1 \\ x_2 \\ \vdots \\ x_n \end{pmatrix}\text{.}\) This means
\begin{equation*} \mathbf{v} = x_1 \alpha_1 + x_2 \alpha_2 + \cdots + x_n \alpha_n. \end{equation*}
By linearity of \(T\text{,}\) we have
\begin{align*} T(\mathbf{v}) \amp= T(x_1 \alpha_1 + x_2 \alpha_2 + \cdots + x_n \alpha_n)\\ \amp= x_1 T(\alpha_1) + x_2 T(\alpha_2) + \cdots + x_n T(\alpha_n). \end{align*}
Taking coordinates with respect to \(\beta\) on both sides:
\begin{align*} [T(\mathbf{v})]_\beta \amp= [x_1 T(\alpha_1) + x_2 T(\alpha_2) + \cdots + x_n T(\alpha_n)]_\beta\\ \amp= x_1 [T(\alpha_1)]_\beta + x_2 [T(\alpha_2)]_\beta + \cdots + x_n [T(\alpha_n)]_\beta\\ \amp= \begin{bmatrix} [T(\alpha_1)]_\beta \amp [T(\alpha_2)]_\beta \amp \cdots \amp [T(\alpha_n)]_\beta \end{bmatrix} \begin{pmatrix} x_1 \\ x_2 \\ \vdots \\ x_n \end{pmatrix}\\ \amp= [T]_{\alpha}^{\beta} [\mathbf{v}]_\alpha. \end{align*}
This theorem says: to compute the coordinate vector of \(T(\mathbf{v})\) with respect to \(\beta\text{,}\) simply multiply the matrix \([T]_{\alpha}^{\beta}\) by the coordinate vector of \(\mathbf{v}\) with respect to \(\alpha\text{.}\)
This is why we study matrices: they give us a computational method to evaluate linear transformations.

Example 6.2.3. From Abstract Problem to Matrix Problem.

Let us solve the challenge question in Example 6.1.10 by converting it to a matrix problem.
Step 1: Choose a basis. For \(P_2(x)\text{,}\) we use the standard basis \(\alpha = \{1, x, x^2\}\text{.}\)
Step 2: Find the matrix of \(T\text{.}\) We compute the image of each basis element:
\begin{align*} T(1) \amp= (x-2)(0) + 1 = 1,\\ T(x) \amp= (x-2)(1) + x = 2x - 2,\\ T(x^2) \amp= (x-2)(2x) + x^2 = 2x^2 - 4x + x^2 = 3x^2 - 4x. \end{align*}
Writing these in terms of the basis \(\alpha\text{:}\)
\begin{align*} [T(1)]_\alpha \amp= \begin{pmatrix} 1 \\ 0 \\ 0 \end{pmatrix}, \quad [T(x)]_\alpha = \begin{pmatrix} -2 \\ 2 \\ 0 \end{pmatrix}, \quad [T(x^2)]_\alpha = \begin{pmatrix} 0 \\ -4 \\ 3 \end{pmatrix}. \end{align*}
Therefore, the matrix of \(T\) relative to basis \(\alpha\) is
\begin{equation*} [T]_\alpha = \begin{bmatrix} 1 \amp -2 \amp 0 \\ 0 \amp 2 \amp -4 \\ 0 \amp 0 \amp 3 \end{bmatrix}. \end{equation*}
Step 3: Convert the problem to a matrix equation. The condition \(T(f(x)) = kf(x)\) becomes
\begin{equation*} [T(f(x))]_\alpha = [kf(x)]_\alpha = k[f(x)]_\alpha. \end{equation*}
By the fundamental relation between linear transformations and matrices, we have \([T(f(x))]_\alpha = [T]_\alpha [f(x)]_\alpha\text{.}\) Therefore,
\begin{equation*} [T]_\alpha [f(x)]_\alpha = k[f(x)]_\alpha. \end{equation*}
We are going to seek scalars \(k\) (eigenvalues) and nonzero vectors \([f(x)]_\alpha\) (eigenvectors) satisfying this equation.
Step 4: Find the values \(k\) . We rearrange the equation to get
\begin{equation*} ([T]_\alpha - kI)[f(x)]_\alpha = \mathbf{0}. \end{equation*}
For nontrivial solutions to exist, the matrix \([T]_\alpha - kI\) must be singular, which means its determinant must be zero:
\begin{align*} \det([T]_\alpha - kI) \amp= \det\begin{bmatrix} 1-k \amp -2 \amp 0 \\ 0 \amp 2-k \amp -4 \\ 0 \amp 0 \amp 3-k \end{bmatrix}\\ \amp= (1-k)(2-k)(3-k) = 0. \end{align*}
So the possible values are \(k = 1, 2, 3\text{.}\)
Step 5: Find the corresponding polynomial \(f(x)\) for \(k=3\text{.}\) We need to solve \(([T]_\alpha - 3I)[f(x)]_\alpha = \mathbf{0}\text{.}\) For \(k=3\text{,}\) we have:
\begin{equation*} [T]_\alpha - 3I = \begin{bmatrix} -2 \amp -2 \amp 0 \\ 0 \amp -1 \amp -4 \\ 0 \amp 0 \amp 0 \end{bmatrix}. \end{equation*}
Computing the reduced row echelon form:
\begin{equation*} \begin{bmatrix} -2 \amp -2 \amp 0 \\ 0 \amp -1 \amp -4 \\ 0 \amp 0 \amp 0 \end{bmatrix} \xrightarrow{\text{RREF}} \begin{bmatrix} 1 \amp 0 \amp -4 \\ 0 \amp 1 \amp 4 \\ 0 \amp 0 \amp 0 \end{bmatrix}. \end{equation*}
The general solution is:
\begin{align*} c - 4a \amp= 0 \quad \Rightarrow \quad c = 4a,\\ b + 4a \amp= 0 \quad \Rightarrow \quad b = -4a, \end{align*}
where \(a\) is a free parameter. Since we want a monic polynomial (leading coefficient \(a = 1\)), we set \(a = 1\text{,}\) which gives:
\begin{equation*} c = 4, \quad b = -4, \quad a = 1. \end{equation*}
Therefore, the coordinate vector is \([f(x)]_\alpha = \begin{pmatrix} 4 \\ -4 \\ 1 \end{pmatrix}\text{,}\) which corresponds to the polynomial:
\begin{equation*} f(x) = 4 \cdot 1 + (-4) \cdot x + 1 \cdot x^2 = x^2 - 4x + 4 = (x-2)^2. \end{equation*}
Conclusion: The abstract question "Find all \(k\) and monic polynomials \(f(x)\) such that \(T(f(x))=kf(x)\)" has been transformed into a concrete matrix problem: "Find the eigenvalues and eigenvectors of \([T]_\alpha\text{.}\)" This illustrates the power of matrix representations — abstract questions become computational problems.
Remark: Similarly, we can find the monic polynomials for \(k=1\) and \(k=2\) by solving \(([T]_\alpha - kI)[f(x)]_\alpha = \mathbf{0}\) with the constraint that the coefficient of \(x^2\) equals 1.

Philosophical Reflection: The Wisdom of Problem Transformation.

The key to solving problems lies not in how difficult the problem itself is, but in whether we can find the right method to transform it into a problem we already know how to solve.
The essence of human intelligence is this: transforming the unknown into the known, the complex into the simple, the abstract into the concrete. This example perfectly illustrates this idea — instead of tackling the abstract polynomial transformation directly, we used coordinate representations and matrices to transform the problem into familiar systems of linear equations.
This is the true meaning of learning: not merely accumulating knowledge, but building a network of knowledge where new problems can continuously connect with what we already know. Each time we master a new tool (such as coordinate vectors or matrix representations), we add another possible pathway for transforming future problems.
Remember: When facing a seemingly difficult problem, don’t attack it head-on. Instead, ask yourself: "What known form can I transform this problem into?" This is how mathematicians think.