Inverse of Linear Transformations
📂Linear AlgebraInverse of Linear Transformations
Definition
Let V,W be a vector space, and T:V→W be a linear transformation. If the linear transformation U:W→V satisfies the following, then U is called the inverse or inverse transformation of T.
TU=IWandUT=IV
TU is the composition of U and T, IX:X→X is the identity transformation. If T has an inverse, T is called an invertible transformation. If T is invertible, the inverse U is unique and denoted as T−1=U.
Explanation
According to the definition, a transformation being invertible is equivalent to being a bijective function.
Properties
(a) (TU)−1=U−1T−1
(b) (T−1)−1=T
(c) If T:V→W is a linear transformation and V,W are vector spaces of the same dimension and finite dimension, then
rank(T)=dim(V)
rank(T) is the rank of T.
(d) The inverse T−1:W→V of a linear transformation T:V→W is also a linear transformation.
(e) For an invertible linear transformation T:V→W, it’s necessary and sufficient for V to be finite-dimensional if and only if W is finite-dimensional. In this case, dim(V)=dim(W) holds.
(f) T being invertible is equivalent to [T]βγ being invertible. Furthermore, [T−1]βγ=([T]βγ)−1. In this case, [T]βγ is the matrix representation of T.
Proof
(d)
Given x1,x2∈V, and let k be any constant. Then, since T is linear, the following holds.
T−1(T(x1)+kT(x2))=T−1(T(x1+kx2))=x1+kx2=T−1(T(x1))+kT−1(T(x2))
■
(e)
Assume V is finite-dimensional, and β={v1,…,vn} is a basis for V. Then, T(β) spans the codomain R(T)=W.
span(T(β))=R(T)=W
Thus, W is finite-dimensional. The converse also holds.
Now, assume V,W is finite-dimensional. Since T is injective and surjective,
nullity(T)=0andrank(T)=dim(R(T))=dim(W)
By the dimension theorem,
dim(V)=rank(T)+nullity(T)=dim(W)
■
(f)
(⟹)
Assume T:V→W is invertible. Then, by (e), dim(V)=n=dim(W). Thus, [T]βγ is a n×n matrix. As for the inverse T−1 of T, since T−1T=IV,TT−1=IW,
In=[IV]β=[T−1T]β=[T−1]γβ[T]βγ
Similarly, In=[IW]β=[TT−1]β=[T]βγ[T−1]γβ is satisfied. Therefore, [T]βγ is an invertible matrix, and its inverse is ([T]βγ)−1=[T−1]γβ.
(⟸)
Assume A=[T]βγ is an invertible matrix. Then, a n×n matrix B satisfying AB=BA=I exists. Then, the linear transformation U:W→V defined as follows uniquely exists.
U(wj)=i=1∑nBijvi for j=1,…,n
In this case, γ={w1,…,wn},β={v1,…,vn}. Hence, the matrix representation of U is [U]γβ=B. Then, the following holds.
[UT]β=[U]γβ[T]γβ=BA=In=[IV]β
Therefore, UT=IV, and similarly, TU=IW holds. Therefore, T is an invertible transformation.
■