Characterizing arbitrarily slow convergence in the method of alternating projections
H. H. Bauschke, F. Deutsch, H. Hundal
Introduction
For the notation and basic Hilbert space results necessary to read this paper, the book is a good source, especially chapter 9.
Let be a (real or complex) Hilbert space with inner product and norm . If is any closed (linear) subspace of , let denote the orthogonal projection onto . That is, is defined by
Let and be closed subspaces in and . It is well-known that if and only if and commute: . Von Neumann established the following result which yields an interesting analogue in the non-commuting case.
(von Neumann ) For each , there holds
The method of constructing the sequence by alternately projecting onto one subspace and then the other is called the method of alternating projections. While Von Neumann’s theorem shows that the sequence of iterates , always converges to for every , it does not say anything about the speed or rate of convergence. To say something about this, we will use the notion of angle between subpaces. Recall that the (Friedrichs) angle between the subspaces and is defined to be the angle in whose cosine is given by
where is the unit ball in . It is easy to see that .
(Aronszajn ) For each and , we have
Kayalar and Weinert showed that the constant in Aronszajn’s theorem is smallest possible independent of . More precisely, they proved that
The usefulness of the bound in (1.2) depends on knowing when the cosine of the angle between and is less than one, i.e., when the angle is positive. A useful characterization of when this happens is the following.
if and only if is closed.
This lemma is a consequence of results of Deutsch and Simonic, whose result appeared in [2, Lemma 4.10] (see also [6, Theorem 9.35, p. 222]).
Recall that a sequence is said to converge to linearly provided there exists an and a constant such that
In this case, we say that the rate of convergence is .
Using Lemma 1.3 and Theorem 1.2, we see that there is linear convergence for the method of alternating projections whenever the sum of the subspaces is closed. What can be said when the sum is not closed?
Franchetti and Light gave the first example of a Hilbert space and two closed subspaces whose sum was not closed such that: given any sequence of reals decreasing to zero, there exists a point in the space with the property that the convergence in the von Neumann theorem was at least as slow as this sequence of reals. But this still left open the question of whether such a construction could be made in any Hilbert space whenever and were any closed subspaces whose sum was not closed.
In their study of the method of alternating projections, Bauschke, Borwein, and Lewis stated the following dichotomy. (Actually, they stated their result as a trichotomy since they were considering the more general setting of closed affine sets, i.e., translates of subspaces, rather than subspaces. In this situation, unlike the subspace case, one must also consider the possibility that the intersection of the affine sets is empty. However, when the intersection is nonempty, the affine sets case easily reduces to the subspace case by a simple translation.) Roughly speaking, it states that in the method of alternating projections, either there is linear convergence for each starting point, or there exists a point which converges arbitrarily slowly.
(dichotomy) Let and be closed subspaces in a Hilbert space and . Then exactly one of the following alternatives holds.
is closed. Then for each , the sequence converges linearly to with a rate .
is not closed. Then for each , the sequence converges to . But convergence is “arbitrarily slow” in the following sense: for each sequence of positive real numbers with , there exists a point such that
Remark Clearly, the first statement of Theorem 1.4 is an immediate consequence of Theorem 1.2 and Lemma 1.3. Thus we need only verify the second statement. We will do this in Section 3 below.
Multiplicative form of the spectral theorem
The main fact that we will use in the proof of Theorem 1.4 is the multiplicative form of the spectral theorem (see Halmos or Reed-Simon [14, Corollary on p. 227]). Recall that a bounded linear operator between Hilbert spaces and is called unitary if is invertible and . It follows that a unitary operator is isometric: for each . Since the inverse of a unitary operator is unitary, it too is isometric. (We will use these facts in a few places below without explicit mention.)
(Spectral Theorem; multiplicative form) Let be a (real or complex) Hilbert space, and let be a self-adjoint bounded linear operator on . Then there exists a finite measure space , a bounded real-valued function on , and a unitary map such that
Defining to be the operator “multiplication by ”, , this can be expressed in operator notation as
Actually, in both and , the theorem is stated for a complex Hilbert space only, and even assumes separability. However, it is easy to check that each of the tools used in the proof in , for example, has a corresponding real space analogue.
Acknowledgements We are greatly indebted to Joel Anderson, Nigel Higson, and Barry Simon for personally transmitting some very useful comments to us related to the multiplicative form of the spectral theorem.
A self-adjoint operator on is called positive if for each . A simple, but important, example of a positive operator is the orthogonal projection onto any closed subspace (see, e.g., [6, p. 79]).
Assume the hypothesis of Theorem 2.1. If is also positive, then the bounded real-valued function of Theorem 2.1 is also nonnegative a.e..
Proof. Let be arbitrary and . Since is positive, we have that
Briefly, for each . We readily deduce that a.e.().
Proof of Theorem 1.4
In this section we will prove the second statement of Theorem 1.4. Our proof is along the same general lines as in in that we proceed by a series of small steps that are each easily digested. However, there are subtle errors in steps 2 and 3 of (see Section 4 for the details). We will avoid these errors by using Theorem 2.1 and following a somewhat different path.
Proof of the second statement in Theorem 1.4. Suppose is not closed, and let be a sequence with , and . By Lemma 1.3, . Let
Note that and are closed subspaces with . Clearly,
and hence, by Lemma 1.3 again, is not closed. Since by (see also [6, Lemma 9.5(7), p. 197]), it follows that .
The operator is a bounded self-adjoint linear operator on which is positive and . Hence there exists a finite measure space , a nonnegative bounded function on , and a unitary operator such that
where is defined by for each .
Proof of Lemma 3.1. By Corollary 2.2, it suffices to verify the first statement of the lemma. Clearly, is self-adjoint and bounded. Moreover, using [9, Corollary 5.17], . Fix any and set . Since is positive, we have that
This shows that is positive on and completes the proof of Lemma 3.1.
Next let be the strictly increasing sequence of integers with
Note that since is a subsequence of , it follows that
It is clear that , , and
To see this, note that by definition, , and . But the latter inequality implies that . Also, implies that . Since , relation (3.9) implies that . This, along with , shows that , which completes the proof of Claim 2.
We note that the first two claims follow exactly as in the proof given in . However, at this point our approach will deviate significantly from that of .
To see this, let and , where denotes the characteristic function of : if and otherwise. We must show that . Since
it suffices to show that . Using (3.11), we have
This shows that . But since is the product of norm one operators, . Thus . We deduce that
Thus we must have equality holding throughout the string of inequalities (3.13). It follows (see, e.g., [6, Theorem 5.8(2), p. 76]) that and hence . This proves Claim 3.
Claim 4. For each , .
If not, there exists such that . Choose any and set . Then, using Claim 3, we have that
Briefly, for each . It follows that , which (by Lemma 3.1) contradicts . This proves Claim 4.
Claim 5. For each , there exists such that
To verify this, we use Claim 4 and the countable additivity of to obtain
Thus there exists an integer such that . Let . Then and
We prove Claim 6 by induction. For , take . Then . Assume next that have been chosen so that , for , and for . Let . Then and Claim 5 implies the existence of such that . Let . Then . Also, . Finally, . This completes the induction step and hence the proof.
It is convenient to list next a few basic and easily verified facts concerning powers of and .
for all .
The last inequality follows from Claim 6. Next observe that
Also, by the definition of (in Definition 3.2), it is clear that
Taking square roots completes the proof of Claim 10.
Now we can define the element which will converge slower than the sequence .
Since and , it follows that is a well-defined element of .
Thus as claimed.
Using the facts that , , and is idempotent and commutes with both and (see, e.g., [6, p. 194]), we get that for and
Combining Claims 12 and 13, we immediately obtain
This completes the proof of the second statement of Theorem 1.4.
Two errors in [4]
In this section, we point out two errors in . We shall use the notation of . (Note that this is the same as the notation of the present paper except that here we have used instead of .)
First error. The proof of the Claim in Step 2 of the proof of Theorem 5.7.16 in has a mistake. The Claim itself is correct, only the proof of this claim is incorrect.
Specifically, we inductively construct and in and , respectively. Let and be the finite-dimensional spaces as in the proof. Let in and in as in the proof:
and weakly and weakly. Because is finite-dimensional, the sum is closed. Hence is regular (by [3, Proposition 5.16]) and so is (again by [3, Proposition 5.16]). This means the following by definition of regularity.
Observation. If is a bounded sequence with , then . (And analogously when is replaced by .)
Now back to the proof of the Claim. This time, is a compact operator. (In , and were considered, which is not sufficient.) Since weakly and weakly, we deduce that
Since , this implies
The above Observation now implies and ; equivalently,
Thus, for all sufficiently large, we have , , , , and is as close to (from below) as we like. Then for sufficiently large, we can take and .
Second error. The second error is on the third line on page 32 of , where it is claimed that
is true. This invalidates the rest of the proof in .
(Sketch: the spanning vectors are orthogonal. Normalize and use Fourier expansions. Equate coefficients, compare odd and even ones. Deduce that they are all equal; thus they must be equal to .) Hence and . Set
where . Since , the sequences and are as in the Claim of Step 2, and the sequences and are as in Step 3. Set
This would imply that belongs entirely to . While it is true that , it is not true that belongs to . This can be verified using relation (4.12).