Matrix of Linear Transformation¶
As we have seen that any finite-dimensional vector space \(V\) with an ordered basis is isomorphic to \(\newcommand{R}{\mathbb{R}}\R^n\). Now suppose we have two vector spaces \(V\) and \(W\) over the same field \(\R\), and a linear transformation \(T\) between them. If we fix a basis \(\alpha\) for \(V\) and \(\beta\) for \(W\), then we have following situation
where the function \(f\) is given by the compositions of these functions as follows \begin{align*} f=\rho_\beta\circ T\circ \rho_{\alpha}^{-1} \end{align*} So, for any linear transformation \(T: V\to W\), we can find a unique linear transformation \(f:\R^n\to \R^n\).
One important property of the vector spaces like \(\R^n\) is that any linear transformation between such space is given by a matrix as the following theorem
Theorem: For any field \(F\), any linear transformation \(T:F^n \to F^m\) is given by a matrix, \(A\), of size \(m\times n\), such that, \(T(\mathbf{x}) = A\mathbf{x}\).
Matrix of a Linear Transformation¶
Definition: Let \(V\) and \(W\) be two vector spaces over a field \(F\) with ordered basis \(\alpha\) and \(\beta\) respectively. Suppose \(T: V\to W\) is a linear transformation, then the matrix associated with the linear transformation \(f\) is called the matrix of \(T\) with respect to \(\alpha\) and \(\beta\), and it is denoted by \(\left[\, T \,\right ]_{\alpha}^{\beta}\).
The following theorem provides a method to calculate the matrix of a linear transformation with given bases.
Theorem: Let \(T: V\to W\) be a linear transformation from a vector space \(v\) to \(w\) over field \(F.\) Let \(\alpha=(v_1, \dots, v_n)\) and \(\beta=(w_1,\dots,w_n)\) be the ordered basis of \(V\) and \(W\) respectively. Then the matrix= of linear transformation \(T\) w.r.to \(\alpha\) and \(\beta\) is given by.
Proof For any \(v\in V\), we have
Now applying \(T\) on both sides, we get
Since, \(T(v_i)\in W\), we can find scalar \(a_{ij}\), such that,
Now assume,
After watching this you can try question 1 from assignment 1.
Last modified on: 2023-01-11 01:50:45