HW 4 - Inverse Maps

3.D: Inverse Maps

#1

Theorem

Suppose T∈L(U,V) and S∈L(V,W) are both invertible linear maps. Then ST∈L(U,W) is invertible and (ST)−1=T−1S−1.

Proof
We'll show that ST is bijective (injective and surjective) first to show that it's invertible.

Suppose u1,u2∈U are arbitrary and that STu1=STu2. Since S is invertible then:

STu1=STu2S−1STu1=S−1Su2(S−1∘S)Tu1=(S−1∘S)Tu2IVTu1=IVTu2Tu1=Tu2

and similarly since T is also invertible:

Tu1=Tu2T−1Tu1=T−1Tu2IUu1=IUu2u1=u2

showing injectivity. Now for surjectivity, let w∈W be arbitrary. I claim that the choice of T−1S−1w is a vector in U such that:

ST(T−1S−1w)=S(T∘T−1)S−1w=S(IV)S−1w=(S∘S−1)w=IWw=w

Thus, showing that ST is surjective. Therefore, ST is bijective and thus invertible.

Notice that (ST)−1=T−1S−1 in this case since:

(ST)−1ST=(T−1S−1)ST=T−1(S−1∘S)T=T−1∘IV∘T=T−1∘T=IU

and since we get the identity, then this is the actual inverse of the given map. The reverse case showing that ST(ST)−1=IW is also trivial and follows without loss of generality.
☐

#2

Theorem

Suppose V is finite-dimensional and dim(V)>1. Then the set of noninvertible operators on V is not a subspace of L(V).

Proof
We can prove this by showing that S={N∈L(V):∄N−1} is not a subspace.

Since dim(V)>1 say V has dimension n>1, so then v1,v2,...,vn is a basis for V where at least v1,v2 exist.

Notice that the zero transformation O∈S:V→V is noninvertible since clearly O(v1)=O(v2)=0→V but we have v1≠v2 (so it's not injective and therefore not bijective), so we need some different approach as the zero vector is in our "subspace".

We will show that T1+T2∉S for a chosen T1,T2∈S. Choose T1 where T1v1=0→ and T1vi=vi elsewhere. Then define T2 where T2v1=v1 while T2vi=0→ elsewhere.

Notice that T1(1v1)=T2(2v1)=0→ but 1v1≠2v1 showing non-injectivity (thus T1 isn't invertible). A similar argument shows that T2 isn't invertible using instead v2, which we know at least exists.

Notice that (T1+T2) is expressed as, for some basis vector vi:

(T1+T2)vi=T1vi+T2vi

Notice that if i=1 then we get (T1+T2)vi=0→+v1=v1 and if i≠1 then (T1+T2)vi=vi+0→=vi. Therefore, we get that (T1+T2) is just the identity map, which is an invertible operator. Thus T1+T2∉S showing that S is not closed under vector addition. Hence S is not a subspace.
☐

#3

Theorem

Suppose V is finite-dimensional, U is a subspace of V and S∈L(U,V). Then there is some invertible operator T∈L(V) such that Tu=Su for all u∈U iff S is injective.

Proof
Consider →, so suppose that there is some invertible operator T∈L(V) such that Tu=Su for all u∈U. We'll prove that S∈L(U,V) is injective.

Let Su1=Su2 where u1,u2∈U. Via our supposition, then Tu1=Tu2=Su1=Su2. Since T is invertible then notice that:

Tu1=Tu2T−1Tu1=T−1Tu2IUu1=IUu2u1=u2

Thus showing that S is injective.

Now consider ←. Suppose that S is injective. We'll need to prove that there is some operator T∈L(V) such that Tu=Su for all u∈U. Define T where:

Tv={Svv∈Uvv∉U

First we'll show that T is linear over V. Let v1,v2∈V be arbitrary. Then we have 2 cases:

  1. If v1+v2∈U then:
T(v1+v2)=S(v1+v2)=Sv1+Sv2=Tv1+Tv2

since S is a linear operator.
2. If v1+v2∉U then:

T(v1+v2)=v1+v2

note that then we have either v1,v2∉U in which case we get that:

T(v1+v2)=v1+v2=Tv1+Tv2

which is good for showing additivity. WLOG if instead v1∈U and v2∉U then:

T(v1+v2)=v1+v2=Sv1+Tv2=Tv1+Tv2

as by the definition of T. As such, no matter what we get that we have additivity of T.

For homogeneity, let λ∈F be arbitrary.

  1. If λv∈U then notice that:
T(λv)=S(λv)=λSv=λTv

since U is closed under scalar multiplication and S is linear.
2. If λv∉U then:

T(λv)=λv=λ(Tv)

since clearly v∉U as U is closed under scalar multiplication. Thus homogeneity is here.

Hence, T is a linear map, and by the definition of T we have Tu=Su for all u∈U.
☐

#4

Theorem

Suppose W is finite-dimensional and T1,T2∈L(V,W). Then null(T1)=null(T2) iff there is an invertible operator S∈L(W) such that T1=ST2.

Proof
Since W is finite-dimensional (say n dimensional) then there's some basis w1,...,wn for W.

Consider →, so suppose null(T1)=null(T2) and have dimension m. By the FTOLM, then dim(range(T1))=dim(range(T2))=n−m. Thus, they both each have some basis v1,...,vn−m and u1,...,un−m respectively, where all vi,ui∈W.

Choose an invertible operator S∈L(W) such that Sui=vi for all i.

Notice that this is invertible since surjectivity is implied in the definition (any vi has some ui that it's mapped from, and any v∈range(T1) is from our basis v1,...,vn−m as defined before, where S is linear since any linear combination from the vi′s can be equated to their corresponding ui's), and injectivity comes from where we allow v1,v2∈range(T2) to be arbitrary, so then if Sv1=Sv2 then Sv1=v1 so then correspondingly Sv2=v2 so then v1=v2 showing injectivity.

Thus S is a valid invertible operator. Notice also that S is a linear map due to the linearity of the bases v1,...,vn−m and u1,...,un−m. But notice that for some arbitrary v∈V that:

T1v∈range(T1)⇒T1v=a1v1+⋯+an−mvn−m=a1Su1+⋯+an−mSun−m=S(a1u1+⋯+an−mun−m)=ST2v

Thus T1=ST2 as required.

Now suppose ←, so S is an invertible operator such that T1=ST2. We'll show ⊆ and ⊇. Let w∈null(T1). Then T1w=0→ but notice then that ST2w=0→ consequently. Then T2w=S−10→ but since S has an empty nullspace, then S−10→=0→ so then T2w=0→. Thus w∈null(T2). For the other direction, let w∈null(T2). Then T2w=0→. Thus ST2w=S0→=0→, but then that means that T1w=0→ so then w∈null(T1). Therefore, null(T1)=null(T2).

☐

#8

Theorem

Suppose V is finite-dimensional and T:V→W is a surjective linear map of V onto W. Then there is a subspace U of V such that T|U is an isomorphism of U onto W.

Here T|U means that the function T restricted to U, or the function whose domain is U with T|U defined by T|U(u)=Tu for all u∈U.

Proof
Let V be n-dimensional and T:V→W be surjective. Then both:

First notice by the FTOLM:

dim(V)=n=dim(null(T))+dim(range(T))

where since T is surjective then:

n=dim(null(T))+dim(W)⇒n−dim(null(T))=dim(W)≤n

as such then W must be finite dimensional, so denote the basis of W as w1,...,wm where m≤n.

Consider the following cases. If m=n then we can just choose U=V is a valid subspace (since we have all the conditions as V is a vector space) and T|U is a valid isomorphism since if m=n then dim(null(T))=0 so then we must have injectivity, so then T is bijective and thus invertible. Hence, we can just have T|U=T be a valid isomorphism.

But now then consider when m≠n, so then m<n. We can try U=span(v1,...,vn−m), where each vi is a basis vector from our basis above. Notice that 0→∈U since 0→ is in the span of any part of a basis of V (set all the constants to 0). Further, we have closure since if u1,u2∈U then they are comprised of linear combinations that themselves must be within their own span:

u1+u2=a1v1+⋯+an−mvn−m+b1v1+⋯+an−mvn−m=(a1+b1)v1+⋯+(an−m+bn−m)vn−m∈span(v1,...,vn−m)=U

Showing closure under vector addition. The same argument shows closure under scalar multiplication:

αu=α(a1v1+⋯+an−mvn−m)=αa1v1+⋯+αan−mvn−m∈span(v1,...,vn−m)=U

But notice still that T|U is a valid isomorphism. If dim(W)=m−n then we have a basis for a subspace for U with the same number of vectors, so then the transformation is isomorphic!

☐

#9

Theorem

Suppose V is finite-dimensional and S,T∈L(V). Then ST is invertible iff S,T each are both invertible.

Proof
First, consider ←, so both S,T are invertible. Then:

T−1S−1(ST)=T−1(S−1∘S)T=T−1∘IV∘T=T−1∘T=I

and:

ST(T−1S−1)=S(T∘T−1)S−1=S∘IV∘S−1=S∘S−1=I

so then we've found T−1S−1 as a valid inverse for ST and thus ST is invertible.

Next, consider →. Suppose ST is invertible. Assume for contradiction that T (WLOG) is not invertible. That means that T is not bijective, so then it either isn't injective or isn't surjective.

If T isn't injective then there are two vectors v1,v2∈V such that v1≠v2 and therefore Tv1≠Tv2. No matter if S is injective or not (from being invertible), it's clear that STv1≠STv2 which contradicts the injectivity of ST (from it being invertible).

So clearly T just isn't surjective right? Well then that means that there is some vector v∈V such that for all vectors v′∈V have it that Tv′≠v. But since ST is invertible, it must be surjective. Hence, for any vector u∈V there's some other vector u′∈V such that STu′=u. We can use v in this statement, so then there's some other vector v″ where STv″=v. Since Tv″∈V then we can relabel it as v′∈V. Thus, Tv′=v which is a contradiction.

Therefore, S must've been bijective. A similar argument shows T must be bijective as well (since here we didn't assume anything about T whatsoever), so then both S,T are invertible maps.

☐

#10

Theorem

Suppose V is finite-dimensional and S,T∈L(V). Then ST=I iff TS=I.

Proof
This proof essentially says that if we find one method of showing that TS=I then S is the inverse as a given. As such, we only consider → as the other direction is done in the same manner.

Thus, suppose that ST=I. Notice that:

(ST)T=T,T(ST)=T⇒(ST)T=T(ST)⇒(ST)T=(TS)T

therefore then ST=TS. But ST=I. Therefore, TS=I.
☐

#18

Theorem

V and L(F,V) are isomorphic vector spaces.

Proof
We can just show that these two spaces have the same dimension:

dim(L(F,V))=dim(F)dim(V)=1⋅dim(V)=dim(V)

which comes straight from our Lemma 3.61 from our book. It's already assumed that V is a vector space, and we've proved previously that L(F,V) is a vector space.
☐