Suppose and are both invertible linear maps. Then is invertible and .
Proof
We'll show that is bijective (injective and surjective) first to show that it's invertible.
Suppose are arbitrary and that . Since is invertible then:
and similarly since is also invertible:
showing injectivity. Now for surjectivity, let be arbitrary. I claim that the choice of is a vector in such that:
Thus, showing that is surjective. Therefore, is bijective and thus invertible.
Notice that in this case since:
and since we get the identity, then this is the actual inverse of the given map. The reverse case showing that is also trivial and follows without loss of generality.
☐
Suppose is finite-dimensional and . Then the set of noninvertible operators on is not a subspace of .
Proof
We can prove this by showing that is not a subspace.
Since say has dimension , so then is a basis for where at least exist.
Notice that the zero transformation is noninvertible since clearly but we have (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 for a chosen . Choose where and elsewhere. Then define where while elsewhere.
Notice that but showing non-injectivity (thus isn't invertible). A similar argument shows that isn't invertible using instead , which we know at least exists.
Notice that is expressed as, for some basis vector :
Notice that if then we get and if then . Therefore, we get that is just the identity map, which is an invertible operator. Thus showing that is not closed under vector addition. Hence is not a subspace.
☐
Suppose is finite-dimensional and . Then iff there is an invertible operator such that .
Proof
Since is finite-dimensional (say dimensional) then there's some basis for .
Consider , so suppose and have dimension . By the FTOLM, then . Thus, they both each have some basis and respectively, where all .
Choose an invertible operator such that for all .
Notice that this is invertible since surjectivity is implied in the definition (any has some that it's mapped from, and any is from our basis as defined before, where is linear since any linear combination from the can be equated to their corresponding 's), and injectivity comes from where we allow to be arbitrary, so then if then so then correspondingly so then showing injectivity.
Thus is a valid invertible operator. Notice also that is a linear map due to the linearity of the bases and . But notice that for some arbitrary that:
Thus as required.
Now suppose , so is an invertible operator such that . We'll show and . Let ). Then but notice then that consequently. Then but since has an empty nullspace, then so then . Thus . For the other direction, let . Then . Thus , but then that means that so then . Therefore, .
Suppose is finite-dimensional and is a surjective linear map of onto . Then there is a subspace of such that is an isomorphism of onto .
Here means that the function restricted to , or the function whose domain is with defined by for all .
Proof
Let be -dimensional and be surjective. Then both:
There's some basis for
For any there is some where .
is a linear map, so the rules of additivity and homogeneity apply here.
First notice by the FTOLM:
where since is surjective then:
as such then must be finite dimensional, so denote the basis of as where .
Consider the following cases. If then we can just choose is a valid subspace (since we have all the conditions as is a vector space) and is a valid isomorphism since if then so then we must have injectivity, so then is bijective and thus invertible. Hence, we can just have be a valid isomorphism.
But now then consider when , so then . We can try , where each is a basis vector from our basis above. Notice that since is in the span of any part of a basis of (set all the constants to 0). Further, we have closure since if then they are comprised of linear combinations that themselves must be within their own span:
Showing closure under vector addition. The same argument shows closure under scalar multiplication:
But notice still that is a valid isomorphism. If then we have a basis for a subspace for with the same number of vectors, so then the transformation is isomorphic!
Suppose is finite-dimensional and . Then is invertible iff each are both invertible.
Proof
First, consider , so both are invertible. Then:
and:
so then we've found as a valid inverse for and thus is invertible.
Next, consider . Suppose is invertible. Assume for contradiction that (WLOG) is not invertible. That means that is not bijective, so then it either isn't injective or isn't surjective.
If isn't injective then there are two vectors such that and therefore . No matter if is injective or not (from being invertible), it's clear that which contradicts the injectivity of (from it being invertible).
So clearly just isn't surjective right? Well then that means that there is some vector such that for all vectors have it that . But since is invertible, it must be surjective. Hence, for any vector there's some other vector such that . We can use in this statement, so then there's some other vector where . Since then we can relabel it as . Thus, which is a contradiction.
Therefore, must've been bijective. A similar argument shows must be bijective as well (since here we didn't assume anything about whatsoever), so then both are invertible maps.
Proof
This proof essentially says that if we find one method of showing that then is the inverse as a given. As such, we only consider as the other direction is done in the same manner.
Proof
We can just show that these two spaces have the same dimension:
which comes straight from our Lemma 3.61 from our book. It's already assumed that is a vector space, and we've proved previously that is a vector space.
☐