Kreyszig 2.3, Further Properties of Normed Spaces
Problem 1. Show that is a vector subspace of and so is , the space of all sequences of scalars converging to zero.
Solution:
The space is defined as the set of all bounded sequences of real (or complex) numbers. A sequence is in if there exists a real number such that for every term in the sequence, .
The space denotes the set of all convergent sequences. A sequence is in if it converges to some limit in the real (or complex) numbers.
The space , or as it is often denoted, is the set of all sequences that converge to zero.
To show that and are subspaces of , we must verify the following properties for each:
Non-emptiness: The subspace must contain the zero vector.
Closed under vector addition: If two vectors and are in the subspace, then their sum must also be in the subspace.
Closed under scalar multiplication: If a vector is in the subspace and is any scalar, then the product must also be in the subspace.
For (all convergent sequences):
Non-emptiness: The zero sequence is in since it converges to zero, and it is clearly bounded.
Closed under vector addition: If , both converge to some limits and , and their sum converges to . Also, the sum of two bounded sequences is bounded.
Closed under scalar multiplication: For any and scalar , the sequence converges to and is bounded if is bounded.
For (sequences converging to zero):
Non-emptiness: contains the zero sequence.
Closed under vector addition: The sum of two sequences in also converges to zero.
Closed under scalar multiplication: A scalar multiple of a sequence in also converges to zero and is bounded.
Since both and satisfy these properties, they are both subspaces of .
Problem 2. Show that in Problem 1 is a closed subspace of , so that is complete by: (a) Theorem (Complete subspace): A subspace of a complete metric space is itself complete if and only if the set is closed in . (b) Completeness of : The space , is complete.
Solution:
To show that from Problem 1 is a closed subspace of , we will use the theorem provided and the fact that is complete.
Step 1: Use the Theorem (Complete Subspace)
The theorem states that a subspace of a complete metric space is complete if and only if is closed in . Therefore, we must demonstrate that is closed in .
Step 2: Show that is closed in
A subset of a metric space is closed if it contains all of its limit points. To prove that is closed, we need to show that if a sequence of elements in converges to some limit within , then this limit is also in .
Suppose is a sequence of sequences in that converges to some sequence in . We need to show that is also in . This means that must converge to zero.
Since converges to in , for every , there exists an such that for all , the sequences are within of in the supremum norm, i.e.,
Each is in , meaning that for each and for every , there exists an (which can depend on ) such that for all , .
As , converges to and since each gets arbitrarily close to zero for large enough indices, must also get arbitrarily close to zero for large enough indices. This means that converges to zero and thus .
Step 3: Apply the Completeness of
Since is a complete metric space and is closed in , by the theorem, is also complete.
By showing that is a closed subset of the complete space , we have shown that is a complete subspace of .
Problem 3. Problem Statement: In , let be the subset of all sequences with only finitely many nonzero terms. Show that is a subspace of but not a closed subspace.
Solution:
To demonstrate that is a subspace of , we must verify that satisfies the three properties of a vector subspace:
Non-emptiness: contains the zero vector.
Closed under vector addition: If two vectors and are in , then their sum must also be in .
Closed under scalar multiplication: If a vector is in and is any scalar, then the product must also be in .
Let's examine each property:
Non-emptiness: The zero sequence, where every term is zero, is a sequence with finitely many nonzero terms (specifically, none), so contains the zero vector.
Closed under vector addition: If and are in , they each have only finitely many nonzero terms. The sum will also have only finitely many nonzero terms because the nonzero terms can only occur at the indices where or (or both) have nonzero terms. Therefore, is also in .
Closed under scalar multiplication: If is in and is any scalar, multiplying by will not introduce any new nonzero terms beyond those already present in . Therefore, will also have only finitely many nonzero terms and is in .
Since satisfies all three properties, it is a subspace of .
To show that is not a closed subspace, we need to find a sequence of elements in that converges to a limit not in . This limit will be a sequence with infinitely many nonzero terms, demonstrating that does not contain all its limit points, and hence it is not closed.
Consider the sequence of sequences defined by:
Each is in because it has only nonzero terms. Now, consider the sequence defined by:
The sequence is not in because it has infinitely many nonzero terms. However, converges to in the norm because for every , there exists an such that for all , the tail of the sequence (from onward) is bounded above by .
Therefore, the limit of the convergent sequence is not in , showing that is not closed in .
Problem 4. In a normed space , show that vector addition and multiplication by scalars are continuous operations with respect to the norm; that is, the mappings defined by and are continuous.
Solution:
Continuity of Vector Addition
Let and be sequences in such that and as . We need to show that . By the definition of convergence in a normed space, for every , there exist such that for all , and for all , .
Let . Then for all , we have:
The inequality follows from the triangle inequality of the norm. Since was arbitrary, this shows that , and thus vector addition is continuous.
Continuity of Scalar Multiplication
Let be a sequence of scalars converging to , and let be a sequence in such that . We need to show that . For every , there exist such that for all , and for all , .
Let . Then for all , we have:
Using the properties of the norm and the convergence of and , we further obtain:
Since was arbitrary, this shows that , and thus scalar multiplication is continuous.
Hence, in a normed space , both vector addition and scalar multiplication are continuous with respect to the norm.
Problem 5. Show that and implies . Show that and implies .
Solution:
Continuity of Vector Addition
Given and , we need to demonstrate that .
By the definition of convergence, for every , there exists an such that for all , . Similarly, there exists an such that for all , .
Let . Then for all :
This proves that , confirming the continuity of vector addition.
Continuity of Scalar Multiplication
Given and , we need to show that .
For every , there exists an such that for all , (assuming , otherwise the result is trivial). Also, there exists an such that for all , .
Let . Then for all :
Using the convergence criteria and the norm properties, we get:
and
Summing these inequalities gives:
This confirms that , establishing the continuity of scalar multiplication.
Problem 6. Show that the closure of a subspace of a normed space is again a vector subspace.
Solution:
To show that the closure of a subspace is a vector subspace, we need to verify that it satisfies the properties of a vector subspace:
Non-emptiness: The closure must contain the zero vector. Since is a subspace, it contains the zero vector . The closure of a set contains all the limit points of that set, and since is in and is its own limit, is also in .
Closed under vector addition: If and are in , then must also be in . Let and be in . By the definition of closure, for every , there exist points and such that and . Since is a subspace and therefore closed under addition, is in .
Consider and . We have:
This inequality shows that for every point in , we can find a point in such that is as close as we wish to , which means is a limit point of and hence in .
Closed under scalar multiplication: If is in and is a scalar, then must also be in . Let be in and let be any scalar. By the definition of closure, for every , there exists a point such that if (if , the result is trivial since is in and hence in ).
Since is a subspace, it is closed under scalar multiplication, so is in . Consider and . We have:
This inequality shows that for every point in , we can find a point in such that is as close as we wish to , which means is a limit point of and hence in .
Therefore, the closure of a subspace of a normed space satisfies all the properties of a vector subspace and is thus itself a vector subspace of .
Problem 7. Show that convergence of may not imply convergence of . Hint: Consider in Prob. 3 and , where , , for all .
Solution:
To demonstrate the statement, we'll consider a sequence in the space of all bounded sequences of scalars, which is the space mentioned in Problem 3.
We'll construct a specific example using the hint provided, which involves sequences with only one non-zero term whose magnitude is . This example will show that the series of norms converges (absolute convergence), but the series of vectors does not converge in the space.
Construction:
Let be a sequence in defined by where:
This sequence has only the -th term non-zero and equal to , and all other terms are zero.
Absolute convergence of norms:
Consider the series of norms . Since for each , the series is:
The series is known to converge (it's a p-series with , which converges for ).
Lack of convergence of the vector series:
Now consider the series of vectors . The -th partial sum of this series is:
Each partial sum is a sequence in where the first terms are the reciprocals of the squares of the natural numbers, and the rest are zeros.
The limit of the partial sums as , if it exists, would be the sequence:
The sequence represents the harmonic series of squares, which does not converge in the space, because it's not a bounded sequence. Each term in the sequence is a positive number, and there are infinitely many terms, so the sequence does not converge to a point in (which requires boundedness).
Conclusion:
We have shown that while the series of norms converges, the series of vectors does not converge in the space. This example illustrates that absolute convergence of the norms does not imply convergence of the series of vectors in the space.
Problem 8. Problem Statement: In a normed space , if absolute convergence of any series always implies convergence of that series, show that is complete.
Proof:
Absolute Convergence Implies Convergence: By hypothesis, if a series in is absolutely convergent, meaning that converges, then the series itself converges in .
Cauchy Criterion for Series: A series converges if and only if the sequence of partial sums is a Cauchy sequence.
Absolute Convergence and Cauchy Sequences: Suppose is absolutely convergent. Then for every , there exists such that for all , we have because the series of norms is convergent and hence satisfies the Cauchy criterion.
-
Implication for Partial Sums: The property above implies that the sequence of partial sums is Cauchy. To see this, note that for ,
This inequality holds because the norm is subadditive (it satisfies the triangle inequality).
Completeness of X: If is a Cauchy sequence in and is a space where absolute convergence implies convergence, then must converge in because it is absolutely convergent.
Conclusion: Since every Cauchy sequence in converges in , is complete. Hence, is a Banach space.
The key point here is the equivalence of the Cauchy criterion for series convergence and the completeness of the space. The hypothesis that absolute convergence implies convergence ensures that Cauchy sequences of partial sums always converge, which is precisely the definition of a complete space. Solution:
The key point here is the equivalence of the Cauchy criterion for series convergence and the completeness of the space. The hypothesis that absolute convergence implies convergence ensures that Cauchy sequences of partial sums always converge, which is precisely the definition of a complete space.
Completeness of :
To say that is complete means that every Cauchy sequence in converges to a limit within . Now, let's consider any Cauchy sequence in . By the property of normed spaces, we can form a series . This series is absolutely convergent if the series of norms converges.
Since is a Cauchy sequence, for every , there exists an such that for all , the distance between and is less than . Formally, .
The property of being a Cauchy sequence suggests that the series of differences has terms that become arbitrarily small as increases. In other words, the series has terms that decrease and approach zero, implying that the series of norms is convergent.
Given that absolute convergence of a series in implies its convergence, we can conclude that the series converges in . The convergence of this series means that the sequence of partial sums, which corresponds to the sequence up to an initial segment, converges to a limit in .
Therefore, the original Cauchy sequence must also converge in , because its behavior at infinity is captured by the series formed by its successive differences. Since every Cauchy sequence in has a limit in , we conclude that is complete.
In summary, the condition that absolute convergence implies convergence in allows us to transform the Cauchy criterion for sequences into a condition on series. Since this condition guarantees convergence for all absolutely convergent series—and hence for all Cauchy sequences—it follows that is a complete normed space, or a Banach space.
Solution:
This proof leverages the fundamental property of normed spaces: a space is complete if every Cauchy sequence converges within the space. The given condition, that absolute convergence implies convergence, is used to show that Cauchy sequences, constructed from series of vectors in the space, converge. This implies that the space must be complete, as all such Cauchy sequences have a limit in the space, satisfying the definition of a Banach space.
Problem 9. Show that in a Banach space, an absolutely convergent series is convergent.
Detailed Proof:
Let be a Banach space. Suppose we have a series in that is absolutely convergent. By definition, this means that the series converges in the real numbers.
-
Definition of Absolute Convergence: The series is said to be absolutely convergent if the sum of the norms, which are real numbers, is a convergent series in , i.e., there exists a real number such that for every , there is an integer such that for all , it holds that
Partial Sums as a Sequence: Define the -th partial sum of the series by . The sequence is a sequence of elements in .
-
Partial Sums Are Cauchy: To show that is a Cauchy sequence, consider any . Since the series of norms converges, there exists an integer such that for all with , we have
Now, consider the difference between the -th and -th partial sums:
where we used the triangle inequality for norms. Given our choice of , for , this implies
This is the Cauchy criterion for sequences in a normed space: for any , there exists an such that for all , the norm of the difference between the -th and -th terms of the sequence is less than .
Convergence of Cauchy Sequences in Banach Spaces: A Banach space is, by definition, a complete normed vector space. Completeness means that every Cauchy sequence in the space converges to a limit within the space. Since we have established that is a Cauchy sequence, it must converge to some limit in .
Conclusion: The limit to which the sequence converges is the sum of the series . Therefore, the series converges in , and we have demonstrated that an absolutely convergent series in a Banach space is indeed convergent.
Solution:
This detailed proof walks through the concepts of absolute convergence, the properties of Cauchy sequences, and the completeness of Banach spaces to conclusively show that an absolutely convergent series in a Banach space must converge. This result is a cornerstone of functional analysis and underscores the robustness of Banach spaces for analytical purposes.