Serlo: EN: Image of a linear map
{{#invoke:Mathe für Nicht-Freaks/Seite|oben}} The image of a linear map is the set of all vectors in that are "hit by ". This set of vectors forms a subspace of and can be used to make the linear map surjective.
Derivation


We consider a linear map between two -vector spaces and . A vector is transformed by into a vector . The mapping does not necessarily hit all elements from , because is not necessarily surjective. The mapped vectors form a subset . This set is called image of .
Since is linear, preserves the structure of the vector spaces and . Therefore, we conjecture that maps the vector space into a vector space. Consequently, the image of , i.e., the set should be a subspace of . We will indeed prove this in a theorem below.
Definition
Mathe für Nicht-Freaks: Vorlage:Definition Mathe für Nicht-Freaks: Vorlage:Hinweis In the derivation we already considered that should be a subspace of . We now prove this as a theorem.
Mathe für Nicht-Freaks: Vorlage:Satz
Image and surjectivity
We already know that a mapping is surjective if and only if the mapping "hits" all elements of . Formally, this means that is surjective if and only if . Now if is a linear map, then is a subspace of . In particular, if is finite-dimensional, then is surjective exactly if .
Mathe für Nicht-Freaks: Vorlage:Beispiel Sometimes it is useful to show the surjectivity of by proving .
Mathe für Nicht-Freaks: Vorlage:Beispiel
The relationship between image and generating system
We have seen in the article on epimorphisms, that a linear map preserves generators of if and only if it is surjective. In this case, the image of each generator of generates the entire vector space . In particular, the image of each generator of generates the image of . The last statement holds also for non-surjective linear maps:
Mathe für Nicht-Freaks: Vorlage:Satz
Image and linear system Vorlage:Anker
Let be an matrix and . The associated system of linear equations is . We can also interpret the matrix as a linear map . In particular, the image of is a subset of .
If , there is some such that . By definition of we have . Thus, the linear system of equations is solvable. Conversely, if is solvable, then there exists an with . For this , we now have . Thus .
So the image gives us a criterion for the solvability of systems of linear equations: A linear system of equations is solvable if and only if lies in the image of . However, the criterion makes no statement about the uniqueness of solutions. For this, one can use the kernel.
Examples
We will now look at how to determine the image of a linear map.
Mathe für Nicht-Freaks: Vorlage:Beispiel
Mathe für Nicht-Freaks: Vorlage:Beispiel
After considering two examples in finite-dimensional vector spaces, we can venture to an example with an infinite-dimensional vector space. We consider the same function in the examples for determining the kernel of a linear map.
Mathe für Nicht-Freaks: Vorlage:Beispiel
When solving systems of linear equations, we will see many more examples. We will also learn a methodical way of solving for the determination of images.
Making linear maps "epic"
We now want to construct a surjective linear map from a given linear map . If we consider to be a mapping of sets, we already know how to accomplish this: We restrict the target set of to and get some restricted mapping . Now, we just need to check that is linear. But this is clear because is a subspace of . So all we need to do to make surjective (i.e., an epi-morphism) is to restrict the objective of to .
This method also gives us an approach for making functions between other structures surjective: We need to check that the restriction on the image preserves the structure. For example, for a group homomorphism we can show that is again a group and is again a group homomorphism.
Outlook: How surjective is a linear map? - The cokernel
In the article about the kernel we see that the kernel "stores" exactly that information which a linear map "eliminates". Further, is injective if and only if and the kernel intuitively represents a "measure of the non-injectivity" of .
We now want to construct a similar measure of the surjectivity of . The image of is not sufficient for this purpose: For example, the images of and are isomorphic, but is surjective and is not. From the image alone, no conclusions can be drawn as of whether is surjective, because surjectivity also depends on the target space . To measure "non-surjectivity," on the other hand, we need a vector space that measures, which part of is not hit by .
The space contains the information, which vectors are hit by . The goal is to "remove this information" from . We have already realized this "removal of information" in the article on the factor space by taking the quotient space . We call this space the cokernel of . It is indeed suitable for characterizing the non-surjectivity of , because is equal to the null space if and only if is surjective: A vector in that is not hit by yields a nontrivial element in and, conversely, a nontrivial element in yields an element in that is not hit by .
The kokernel even measures how non-surjective is exactly: if is larger, more vectors are not hit by . If is finite dimensional, we can measure the size of using the dimension. Thus, is a number we can use to quantify how non-surjective is. However, unlike , this number does not allow us to reconstruct the exact vectors that are not hit by .
Exercises
<section begin=zuordnung_abbildung_bild /> Mathe für Nicht-Freaks: Vorlage:Aufgabe<section end=zuordnung_abbildung_bild /> <section begin=surjektivität_dimension/> Mathe für Nicht-Freaks: Vorlage:Aufgabe<section end=surjektivität_dimension /> <section begin=bild_einer_matrix /> Mathe für Nicht-Freaks: Vorlage:Gruppenaufgabe<section end=bild_einer_matrix />
{{#invoke:Mathe für Nicht-Freaks/Seite|unten}}