Inverses of linear transformations
What is an inverse transformation?
Previously we talked about a transformation as a mapping, something that maps one vector to another.
So if a transformation maps vectors from the subset to the subset , such that if is a vector in , the transformation will map it to a vector in , then we can write that transformation as , or as .
Hi! I'm krista.
I create online courses to help you rock your math class. Read more.
The identity transformation
With that in mind, we want to define the identity transformation as the transformation that maps vectors to themselves. There’s no trick here. The identity transformation literally just says, given any vector in , the transformation will map it to , itself. In other words, , or as .
So for a vector in the subset , the identity transformation would be , or . And for a vector in the subset , the identity transformation would be , or .
Invertibility and inverse transformations
So we know that the identity transformation maps a vector to itself, without, in a way, ever really leaving the subset.
What we want to know now is whether we can use a transformation to map a vector from one subset to another subset , and then undo the process, mapping the result we got in back into , and end up with the same vector in that we started with. In a sense, we’d just end up with the identity transformation, but we would have left the subset and come back again.
If we can do this for every vector in (use a transformation to map in to in , and then reverse the process to map back to the we started with), then the transformation is invertible.
In other words, a transformation is invertible if it has an inverse. If , then is invertible if and only if its inverse exists, such that the composition of with and vice versa are both defined by the identity transformations we talked about earlier:
This make sense. If and , then could be written as
The transformation maps a vector in to some in . But then takes that result in and maps that vector back to an in . In other words, we started at a vector in , and ended up right back at the exact same vector in , which we know now is just the identity transformation for , . And we could follow the opposite logical path for .
And of course, if and are inverses of one another, it’s implied that the domain of is the codomain of , and that the domain of is the codomain of .
Invertibility and uniqueness
If a transformation is invertible, there are really three other related conclusions we can make.
1. Its inverse transformation is unique. In other words, an invertible transformation cannot have multiple inverses. It will always have exactly one inverse.
2. When you apply the transformation to a vector in , you’ll be mapped to one unique vector in . In other words, the transformation can never map you from in to multiple values and in .
3. When you apply the inverse transformation to a vector in , you’ll be mapped back to one unique vector in . In other words, the unique inverse transformation can never map you from in back to multiple vectors and in .
Surjective and injective
If is a transformation that maps vectors in the subset to vectors in the subset , , and if every vector in is being mapped to at least once by some vector(s) in such that , then is a surjective transformation, also called an onto transformation. If there’s any vector in which, via , is not mapped to by any in , then is not surjective; it’s not onto.
If every vector in is being mapped to, then is surjective, or onto.
If is a transformation that maps vectors in the subset to vectors in the subset , , and if every vector in is being mapped to by at most one vector in such that , then is an injective transformation, also called a one-to-one transformation. If there is any vector in which, via , is mapped to by two or more in , then is not injective; it’s not one-to-one.
If every maps to a unique , then is injective, or one-to-one.
In other words, if there’s a vector in that’s not being mapped to, then the transformation isn’t surjective. But if there are multiple vectors and in being mapped to the same vector in , then the transformation isn’t injective.
And remember before that we said a transformation was invertible if we could find an inverse transformation, and we know that a transformation will only ever have one inverse.
If we formalize that definition, we’re saying that:
A transformation is invertible if, for every in , there’s a unique in , such that .
This definition is telling us that every is being mapped to, which means the transformation is surjective, or onto. The definition is also telling us that there’s a unique in that’s mapping to each , which means the transformation is injective, or one-to-one.
Therefore, we can say that a transformation is invertible if and only if is both surjective and injective.
How to find the inverse of a transformation
Take the course
Want to learn more about Linear Algebra? I have a step-by-step course for that. :)
Say whether the transformation is invertible, given information about specific vectors in set A that map to specific vectors in set B
Example
Say whether the transformation is invertible.
In order for the transformation to be invertible, it must be both surjective and injective (onto and one-to-one).
If we look at the picture of the transformation, we can see that every in is being mapped to by an in , which means the transformation is surjective.
In other words, a transformation is invertible if it has an inverse.
But we can see that both and are mapping to , which means we have multiple ’s in mapping to the same in , and therefore that the transformation is not injective.
The transformation is invertible if and only if it’s both surjective and injective. In this example, it’s surjective, but not injective, and therefore, it’s not invertible. The transformation does not have an inverse.