Serlo: EN: Inner direct sum
{{#invoke:Mathe für Nicht-Freaks/Seite|oben}}
Derivation and definition
We have already learned about sums of two subspaces. If and are two subspaces, then the sum of and is again a subspace . So for each vector we may find two vectors and , such that . Now the question arises: Are there several ways to write as such a combination?
The answer is yes, there can be several possibilities. As an example, let's look at the vector space . This space can be viewed as the sum of the -plane and the -plane. This means that if , then there are actually several ways to represent as the sum of vectors from the -plane and the -plane. For the vector , for example, we have .
Such representations are therefore generally not unique. We now want to find a criterion for uniqueness.
Suppose we have two different representations of , i.e. and with and (if one of them is the same, then so is the other). In particular, we know that and . If we now rearrange the equation , we get . Because the left-hand side is in and the right-hand side is in , this is an element in which is not a zero vector at the same time. So is not just . (The zero vector is in the intersection because and are both subspaces). This means that if the representation is not unique, then the intersection does not only contain the zero vector.
Conversely, if the intersection is not , we do not have a unique representation: Let with . Then there are two representations of , namely (on the one hand with and and on the other hand with and ). Because of , these representations are different from each other.
We can therefore conclude an equivalence: The intersection is exactly if the representation of all vectors in is unique.
In this case, we give the sum a special name: We call the sum of and , in the case , the direct sum of and and write .
Mathe für Nicht-Freaks: Vorlage:Definition
Examples
Sum of two lines in ℝ² Vorlage:Anker

We consider the following two lines in : Vorlage:Einrücken So is the -axis and is the line that runs through the origin and the point . Their sum is
Mathe für Nicht-Freaks: Vorlage:Frage
Let us now investigate whether this sum is direct. To do so, we need to determine . If , then we know the following: Because , we have . And because , we have . Therefore and we get . Because also contains , we get . This means that the sum of and is direct and we can write .
Sum of two lines in ℝ³

We have the following lines in : Vorlage:Einrücken Then is a line in that runs through the origin and the point , and is a line that runs through the origin and . The sum is a plane spanned by the vectors and , i.e. Vorlage:Einrücken
Mathe für Nicht-Freaks: Vorlage:Frage
Also here, we want to determine whether the sum is direct. To do so, we consider a vector . Then, because , we have . And because , we obtain . Therefore, and the sum is direct. This means that we can write .
Sum of a line and a plane in ℝ³

We consider the subvector spaces and of .
Vorlage:Einrücken The subspace is the line through the origin and the point , while represents the y-z-plane. Together, and span the entire , i.e. .
Mathe für Nicht-Freaks: Vorlage:Frage
One may now ask whether the sum is direct. To check this, we need to analyze the intersection . If only contains the zero vector , then the sum is direct.
Let be a vector in . Since , we have . Consequently, we can write as . Furthermore, , which implies . We have therefore shown that .
It follows that . Since the intersction only contains the zero vector, the sum is direct. Therefore, we can conclude .
Sum of even and odd polynomials
We will now look at an example of a direct sum in the vector space of real polynomials . Let us consider the following subspaces and of : consists of all odd polynomials over , while is the space of the even polynomials over . In formulas, this is Vorlage:Einrücken
The odd polynomials only contain monomials with odd exponents, while the even polynomials only contain monomials with even exponents. For example, is an even polynomial, while is neither even nor odd. We now show that the even and odd polynomials together generate the entire polynomial space . Expressed in formulas: .
To show this, we need to prove that every polynomial in can be written as the sum of an odd and an even polynomial. To do so, we consider any polynomial from . We must write as the sum of an even and an odd polynomial. Vorlage:Einrücken Therefore, is contained in the sum .
Now we want to check whether the sum is direct. That is, we need to check whether the intersection of the two subspaces only contains the zero vector, i.e. the zero polynomial. Let be a polynomial in the intersection . Then lies both in and in . We can write as . Since lies in , only consists of odd monomials. Therefore, the prefactors of the even monomials must be equal to . So for all even . Since lies in , only consists of even monomials. So for all odd . This means that all coefficients are equal to zero and is therefore the zero polynomial. Thus , and the sum of and is direct.
We have seen that . In other words, the polynomial space can be written as the direct sum of the subspaces and , where is the subspace of odd polynomials and is the subspace of even polynomials.
Counterexamples
Two planes in ℝ³

We consider the following two planes:
The two planes together span all of . However, the sum is not direct, as the intersection is a line and therefore does not only contain the zero vector. That is, .
We want to check this mathematically. This requires looking for a vector in the intersection of and which is not zero. We consider a vector that lies in the intersection . Because this vector lies in , we have so . In addition, there must be so , since .
We now look for suitable values for to fulfill both conditions. From and , we get . Because , we also have . Furthermore, results from . Finally, we conclude .
One possible solution is , and . The vector therefore lies in the intersection of and . Hence, .
Various polynomials in polynomial space
Let be a field. We consider two subspaces in the polynomial space : Let be the space of polynomials of degree less or equal to two, and let Vorlage:Einrücken be the space of polynomials whose sum of coefficients is . We want to investigate whether the sum is direct. To find this out, we need to decide whether .
An element is a polynomial , which has a maximum degree of and for which applies. Because the polynomial has degree two, we have . Therefore, we get . This means consists of all polynomials for which . Thus, we can find a non-zero element of if we use the equation Vorlage:Einrücken with non-trivial . One possibility for this is , i.e. . So the intersection of and is not zero, and the sum is therefore not direct.
Unique decomposition of vectors
We have already considered in the derivation that the decomposition of vectors is unique for the direct sum. We will prove this result here rigorously.
Mathe für Nicht-Freaks: Vorlage:Satz
Inner direct sum and disjoint union of sets
We can imagine the sum of two subspaces as a structure-preserving union: Forming the sum is "structure-preserving" because the result is again a subspace. This means that the vector space structure is preserved when forming the sum. We can also think of this construction as a union because the sum contains both subspaces. The subspaces and are subsets of the sum . The sum is the smallest subspace that contains the two subspaces and . Just as you can form unions with sets, the sums of subspaces also work in the same way.
The direct sum is a special case of the sum of subspaces. This means that every direct sum is also a structure-preserving union. "Being direct" is a property of a sum of subspaces. We now want to see whether there is a property of the union of sets that corresponds to the directness of a sum.
Direct sums are characterized by the fact that the decomposition of the vectors in the sum is unique. If we have a vector with , where and , then the vectors and are unique. For a union of sets and , each element lies in or in . The element can also lie in both, which means that we generally do not clearly know where they lie. We cannot assign unambiguously if , i.e. in the intersection. This means that the assignment of elements is unique if is empty. In fact, this criterion corresponds exactly to the criterion for a sum to be direct: We want , which is the smallest possible vector space, so the intersection contains nothing more from and (except the zero, which it must contain anyway as a vector space). This is exactly the definition of a disjoint union. In other words, the direct sum of subspaces intuitively corresponds to the disjoint union of sets.
Basis and dimension
We have seen that the direct sum is a special case of a sum of subspaces. So we can transfer everything we know about the vector space sum to the direct sum. We have already seen that the union of bases of and is a generating system of . This means if is a basis of and if is a basis of , then is a generating system of . If and are finite dimensional, we can use the dimension formula. Vorlage:Einrücken
If the sum is direct, i.e. if , then we even have . Since , the following sum formula applies in the finite-dimensional case: Vorlage:Einrücken So the dimension of the sum space is exactly the sum of the dimensions and . If is a basis of and if is a basis of , then we can conclude Vorlage:Einrücken Since , the union of the bases of and is disjoint, i.e. . Therefore, we get . Because is a generating system of and because , we conclude that is a basis of .
We have thus seen that in finite dimensions, the union of the bases of and is a basis of . This also applies in general:
Mathe für Nicht-Freaks: Vorlage:Satz From this theorem, we may immediately conclude that Vorlage:Einrücken
Exercises
Mathe für Nicht-Freaks: Vorlage:Aufgabe
For the following two exercises, you should know what a linear map is.
Mathe für Nicht-Freaks: Vorlage:Gruppenaufgabe
For this exercise, you need to know what the kernel and the image of a linear map are.
Mathe für Nicht-Freaks: Vorlage:Aufgabe
In we can illustrate the statement from the previous exercise:
Mathe für Nicht-Freaks: Vorlage:Beispiel
{{#invoke:Mathe für Nicht-Freaks/Seite|unten}}