Linear Transformations
Consider a map (function) \( T \) between \( \mathcal{U} \) & \( \mathcal{V} \):
Figure 1
\( \mathcal{U} \) : domain; \( \mathcal{V} \): target
\( y = T(x) \) is called the image of \( x \)
\( x \in T^{-1}\{y\} \) is called a pre-image of \( y \)
Linear Transformations
Consider a map (function) \( T \) between \( \mathcal{U} \) & \( \mathcal{V} \):
Figure 2
\( T \) is onto (surjective) if any \( y \in \mathcal{V} \) is the image of some \( x \in \mathcal{U} \),
i.e. for any \( y \in \mathcal{V} \), there is an \( x \in \mathcal{U} \) such that \( y = T(x) \)
Linear Transformations
Consider a map (function) \( T \) between \( \mathcal{U} \) & \( \mathcal{V} \):
Figure 3
\( T \) is one-to-one (injective)
if \( T(x_1) = T(x_2) \implies x_1 = x_2 \)
ie. \( x_1 \ne x_2 \implies T(x_1) \ne T(x_2) \)
i.e. if \( T^{-1}\{y\} \) is non-empty, \( T^{-1}\{y\} \) has only one element. unique element.
Linear Transformations
Consider a map (function) \( T \) between \( \mathcal{U} \) & \( \mathcal{V} \):
Figure 4
If \( T \) is both one-to-one and onto, then \( T \) has an inverse \( T^{-1} : \mathcal{V} \longrightarrow \mathcal{U} \).
- \( T^{-1} \circ T(x) = x \), ie. \( T^{-1} \circ T = \) identity on \( \mathcal{U} \)
- \( T \circ T^{-1}(y) = y \), ie. \( T \circ T^{-1} = \) identify on \( \mathcal{V} \)
Linear Transformation between \( \mathbb{R}^n \) & \( \mathbb{R}^m \)
Consider \( \mathbb{R}^n \xrightarrow{\;T\;} \mathbb{R}^m \), lin. transf.
Given by \( T(X) = AX \)
\( X \in \mathbb{R}^n \) \( AX \in \mathbb{R}^m \), \( A - m \times n \) matrix
\( T \) is onto if for any \( Y \in \mathbb{R}^m \), there is an \( X \in \mathbb{R}^n \) such that \( AX = Y \),
ie. \( AX = Y \) is solvable for any \( Y \)
i.e \( \mathrm{Rank}(A) = m \) ( no zero rows in REF of \( A \))
Linear Transformation between \( \mathbb{R}^n \) & \( \mathbb{R}^m \)
Consider \( \mathbb{R}^n \xrightarrow{\;T\;} \mathbb{R}^m \), lin. transf.
Given by \( T(X) = AX \)
\( X \in \mathbb{R}^n \) \( AX \in \mathbb{R}^m \), \( A - m \times n \) matrix
\( T \) is one-to-one if \( AX_1 = AX_2 \implies X_1 = X_2 \)
ie. if \( AX = Y \) is solvable, there is only one soln.
ie. if \( AX = 0 \implies X = 0 \), ie. \( \mathrm{Null}(A) = \{\vec{0}\} \)
ie. \( \mathrm{Nullity}(A) = 0 \), (no free variables)
Linear Transformation between \( \mathbb{R}^n \) & \( \mathbb{R}^m \)
Consider \( \mathbb{R}^n \xrightarrow{\;T\;} \mathbb{R}^m \), lin. transf.
Given by \( T(X) = AX \)
\( X \in \mathbb{R}^n \) \( AX \in \mathbb{R}^m \), \( A - m \times n \) matrix
\( T \) is onto and one-to-one, if
\( \mathrm{Rank}(A) = m = n \), \( (\implies A \) is necessarily square\( ) \)
For any \( Y \), \( AX = Y \) is uniquely solvable.
Inverse of a Square Matrix A
\( \mathbb{R}^n \;\underset{T^{-1}}{\overset{T}{\rightleftarrows}}\; \mathbb{R}^n \)
\( T(X) = AX, \qquad T^{-1}(Y) = A^{-1} Y \)
\( T^{-1} \circ T(X) = X \) for any \( X \) \( \implies \) \( A^{-1} A = I \)
\( T \circ T^{-1}(Y) = Y \) for any \( Y \) \( \implies \) \( A A^{-1} = I \)
Def: \( B \) is called the inverse of \( A \), denoted by \( A^{-1} \), if \( AB = I \) & \( BA = I \)
Inverse of a Square Matrix A
-
For a square matrix \( A, {}^{(n \times n)} \)
\( A \) is onto \( \iff A \) is one-to-one
\( \Updownarrow \)
\( \mathrm{Rank}(A) = n \) (no zero rows in REF\((A)\)) \( \iff \) \( \mathrm{Nullity}(A) = 0 \) (no free variables)
-
If \( BA = I \), then \( AB = I \) ( and hence \( B = A^{-1} \))
-
\( A^{-1} \) is unique:
if \( AB = BA = I \), \( \forall \) \( AC = CA = I \), then \( B = C \).
Inverse of a Square Matrix A
(4) If \( A^{-1} \) & \( B^{-1} \) exist, then \( (AB)^{-1} = B^{-1} A^{-1} \)
Figure 5
(5) \( (A^{T})^{-1} = (A^{-1})^{T} \)
\[ \left( A^{T}(A^{-1})^{T} = (A^{-1}A)^{T} = I^{T} = I \right) \]Inverse of a Square Matrix \( A^{n \times n} \)
How to find \( A^{-1} \) (if it exists)
\( \Updownarrow \) \( \mathrm{Rank}(A) = n \)
\[ \left[\begin{array}{c|c} A & I \end{array}\right] \xrightarrow{\;\text{elementary row op.}\;} \cdots \longrightarrow \left[\begin{array}{c|c} I & B \end{array}\right] \]identity (\( I \) in \( [A \mid I] \)), identity (\( I \) in \( [I \mid B] \)), \( A^{-1} \) (\( B \))