Stable phase retrieval in function spaces
Abstract.
Let be a measure space, and . A subspace is said to do stable phase retrieval (SPR) if there exists a constant such that for any we have
(0.1) |
In this case, if is known, then is uniquely determined up to an unavoidable global phase factor ; moreover, the phase recovery map is -Lipschitz. Phase retrieval appears in several applied circumstances, ranging from crystallography to quantum mechanics.
In this article, we construct various subspaces doing stable phase retrieval, and make connections with -set theory. Moreover, we set the foundations for an analysis of stable phase retrieval in general function spaces. This, in particular, allows us to show that Hölder stable phase retrieval implies stable phase retrieval, improving the stability bounds in a recent article of M. Christ and the third and fourth authors. We also characterize those compact Hausdorff spaces such that contains an infinite dimensional SPR subspace.
Key words and phrases:
Phase retrieval; stable phase retrieval.2020 Mathematics Subject Classification:
46B42, 43A46, 42C151. Introduction
There are many situations in mathematics, science, and engineering where the goal is to recover some vector from , where is a linear transformation into a function space. Note that if then it is impossible to distinguish and in this way. The linear transformation is said to do phase retrieval if this ambiguity is the only obstruction to recovering . That is,
given a vector space and function space , a linear operator does phase retrieval if whenever satisfy then for some scalar with . Phase retrieval naturally arises in situations where one is only able to obtain the magnitude of linear measurements, and not the phase.
Notable examples in physics and engineering which require phase retrieval include X-ray crystallography, electron microscopy, quantum state tomography, and cepstrum analysis in speech recognition. The study of phase retrieval in mathematical physics dates back to at least 1933 when in his seminal work Die allgemeinen Prinzipien der Wellenmechanik [65] W. Pauli asked whether a wave function is uniquely determined by the probability densities of position and momentum. In other words, Pauli asked whether and determine up to multiplication by a unimodular scalar. The mathematics of phase retrieval has since grown to be an important and well-studied topic in applied harmonic analysis.
As any application of phase retrieval would involve error, it is of fundamental importance that the recovery of from not only be possible, but also be stable. We say that does stable phase retrieval if the recovery (up to a unimodular scalar) of from is Lipschitz. If is finite dimensional, then does phase retrieval if and only if it does stable phase retrieval [12, 21]. However, if is infinite dimensional and is the analysis operator of a frame or a continuous frame, then cannot do stable phase retrieval [2, 22]. Here, a collection of vectors is a continuous frame of a Hilbert space over a measure space if the map is an embedding of into . One of the main goals of this paper is to use the theory of subspaces of Banach lattices to present a unifying framework for stable phase retrieval which encompasses the previously studied cases and allows for stable phase retrieval in infinite dimensions.
Let , or, more generally, a Banach lattice. Let be a subspace. We say that does phase retrieval as a subspace of if whenever for some we have that for some scalar with . Given a constant , we say that does -stable phase retrieval as a subspace of if
(1.1) |
We may define an equivalence relation on by if for some scalar with . Then, does phase retrieval as a subspace of if and only if the map from to is injective. Furthermore, does -stable phase retrieval as a subspace of if and only if the map from to is injective and the inverse is -Lipschitz. By introducing stable phase retrieval into the setting of Banach lattices, we are able to apply established methods from the subject to attack problems in phase retrieval, and conversely we hope that the ideas and questions in phase retrieval will inspire a new avenue of research in the theory of Banach lattices. Before starting the meat of the paper, we present some additional motivation, give an outline of our major results, and state some of the important ideas and theorems from Banach lattices which we will be applying. We conclude the paper by listing many open questions concerning stable phase retrieval in this new setting.
1.1. Motivation and applications
The inequality (1.1) arises in various circumstances. For instance, in crystallography and optics, one seeks to recover an unknown function from the absolute value of its Fourier transform . If one also seeks stability, this translates into an inequality of the form
(1.2) |
which one would want to be valid for in a subspace which incorporates the additional constraints are known to satisfy. Using Plancherel’s theorem to write , one sees that the inequality (1.2) reduces to (1.1), up to passing to Fourier space and making the change of notation and . We refer the reader to the surveys [42, 46] and references therein for a further explanation of the importance of phase retrieval in optics, crystallography, and other areas. In particular, these articles explains why, in practice, physical experiments are often able to measure the magnitude of the Fourier transform, but are unable to measure the phase.
A second scenario where phase retrieval appears is quantum mechanics. In this case, one wants to identify situations where and determine uniquely. As already mentioned, Pauli asked whether this could true for all . However, a counterexample to this conjecture was given in 1944: There exists such that and but is not a multiple of . This leads to the natural question of whether one can build “large” subspaces for which and determine uniquely. By passing to the phase space , we see that has the above property if and only if does phase retrieval as a subspace of , i.e., knowing and implies is a unimodular multiple of . This also naturally leads to the question of stability of Pauli phase retrieval, by requiring (1.1) hold on . In this case, using Plancherel’s theorem to return to , (1.1) on translates into the inequality
(1.3) |
For a non-exhaustive collection of results on Pauli phase retrieval and its generalizations, see [8, 42, 48, 49] and references therein. To our knowledge, the question of stability in the Pauli Problem is essentially unexplored. However, the results presented here in conjunction with [27] give a relatively large class of subspaces of satisfying (1.3).
Finally, we mention that phase retrieval has grown to become an exciting and important topic of research in frame theory [12, 13, 14, 17, 26, 33, 42]. A frame for a separable Hilbert space is a sequence of vectors in such that there exists uniform bounds so that
(1.4) |
The analysis operator of a frame of is the map given by . Note that the uniform upper bound in the frame inequality (1.4) guarantees that is bounded, and the uniform lower bound gives that is an embedding of into . Given a frame of , the canonical dual frame is defined by for all and satisfies
(1.5) |
Frames have many applications and play a fundamental role in signal processing and applied harmonic analysis. One important reason for this is that the analysis operator is an embedding of into , which allows for the application of filters, thresholding, and other signal processing techniques. Another reason is that (1.5) gives a linear, stable, and unconditional reconstruction formula for a vector in terms of the frame coefficients.
A frame is said to do phase retrieval if whenever and , there exists a unimodular scalar such that A frame is said to do stable phase retrieval if there exists a constant such that for all ,
(1.6) |
Using the fact that the analysis operator is an embedding, we see that a frame does stable phase retrieval if and only if the subspace does stable phase retrieval in the sense of (1.1). In finite dimensions, phase retrieval for frames is automatically stable. However, in infinite dimensions, it is necessarily unstable. As we will see, this is due to the fact that the ambient Hilbert lattice is atomic, whereas the construction of SPR subspaces from [23] is done in the non-atomic lattice . For further investigations on the instability of phase retrieval for frames - including generalizations to continuous frames and frames in Banach spaces - see [2, 22].
As mentioned previously, phase retrieval problems arise in applications when considering an operator , which embeds a Hilbert space into a function space . In particular, the inequality (1.2) arises by taking be the Fourier transform, and (1.6) arises by taking to be the analysis operator of a frame. Another important choice for is the Gabor transform (see [3, 43] for recent advances in Gabor phase retrieval). As should now be evident, the question of stability for each of these phase retrieval problems can be translated into a special case of (1.1), by taking
1.2. An overview of the results
The examples from Section 1.1 show that the inequality (1.1) unifies various phase retrieval problems. However, as mentioned previously, phase retrieval for frames is unstable in infinite dimensions, and it was only recently that the first examples of infinite dimensional SPR subspaces of real spaces were constructed [23]. The purpose of this article is twofold. First, we construct numerous examples of subspaces of doing stable phase retrieval. For this, we use various isometric Banach space techniques, modifications of the “almost disjointness” methods in classical Banach lattice theory, random constructions, and analogues of some constructions from harmonic analysis. Secondly, we prove several structural results about SPR subspaces of , and even general Banach lattices. Notably, both the characterization of real SPR in terms of almost disjoint pairs (Theorem 3.4), as well as the equivalence of SPR and its Hölder analogue (Corollary 3.12) hold for all Banach lattices. Our results also extend those in the recent article [27], which uses orthogonality and combinatorial arguments akin to Rudin’s work [68] on -sets to produce examples of subspaces of (real or complex) doing Hölder stable phase retrieval.
We now briefly overview the paper. In Section 2, we recall some basic terminology and results from Banach lattice theory in order to make the paper accessible to a wider audience. Most notably, in Section 2.1 we collect basic facts related to the Kadec-Pelczynski dichotomy. Such results give structural information about closed subspaces of Banach lattices that are dispersed, i.e., that do not contain normalized almost disjoint sequences. As we will show in Theorem 3.4, a subspace of a (real) Banach lattice does stable phase retrieval if and only if it does not contain normalized almost disjoint pairs. In Theorem 2.1, we collect various facts about dispersed subspaces; finding SPR analogues of these results will occupy much of the paper. In particular, although SPR is much stronger than being dispersed, in Theorem 5.1 we will show that every closed infinite dimensional dispersed subspace of an order continuous Banach lattice contains a further closed infinite dimensional subspace doing SPR. The preliminary section finishes with Section 2.2, which recalls basic facts about complex Banach lattices.
Section 3 collects various results on stable phase retrieval that hold for general Banach lattices. In particular, in Section 3.1 we make the aforementioned connection between stable phase retrieval and almost disjoint pairs (see Theorem 3.4). In Section 3.2, we show that if the phase recovery map is Hölder continuous on the ball, then it is Lipschitz continuous on the whole space (Corollary 3.12). This follows from Theorem 3.9, which shows that failure of stable phase retrieval can be witnessed by “well-separated” vectors. The equivalence between stable phase retrieval and Hölder stable phase retrieval allows us to improve some results from [27], yielding the first examples of infinite dimensional closed subspaces of complex doing stable phase retrieval.
In Section 4, we build infinite dimensional SPR subspaces using a variety of different techniques. In particular, we prove in Corollary 4.8 an analogue of statement (iii) of Theorem 2.1; namely, that for every dispersed subspace (, we can build a closed subspace isomorphic to , and doing stable phase retrieval. Moreover, for and , we will show that any closed subspace of isometric to does SPR in , see Proposition 4.1. Regarding sequence spaces, in Section 4.2 we show that embeds into itself in an SPR way, while no infinite dimensional subspace of does SPR when Section 4.3 constructs SPR subspaces of r.i. spaces using random variables. This, in particular, tells us that subspaces spanned by iid Gaussian and -stable random variables will do SPR in a variety of spaces, including all -spaces in which they can be found. Finally, Section 4.4 provides some basic stability properties of SPR subspaces.
Section 5 contains a study of the structure of SPR subspaces of , for a finite measure . We begin with the aforementioned Theorem 5.1, which is applicable for general order continuous Banach lattices, but for which much of the proof occurs in . Indeed, the generalization to order continuous Banach lattices follows from the result in by arguing via the Kadec-Pelczynski dichotomy.
Note that from the classical results in Theorem 2.1 (a)-(d) it follows that if is dispersed in and , then may be viewed as a closed subspace of , and it is dispersed in . In Theorem 5.3 we show that if , there are closed subspaces which do SPR (and hence are dispersed in for all ), but fail to do SPR when viewed as a closed subspace of for all However, by Theorem 5.6, if , then any SPR subspace also does SPR when viewed as a closed subspace of for any . Whether there is an SPR analogue of statement (v) of Theorem 2.1 remains an open problem.
Section 6 is devoted to the study of infinite dimensional SPR subspaces of . The main result is Theorem 6.1 which states that for a compact Hausdorff space , the space of continuous functions over admits a (closed) infinite dimensional SPR subspace if and only if the Cantor-Bendixson derivative of is infinite. The paper finishes with Section 7, which discusses various avenues for further research.
2. Preliminaries
As many of our results hold in the generality of Banach lattices, we briefly summarize some of the standard notations and conventions from this theory. For the most part, our conventions align with the references [7, 60]. Moreover, the statements of our results require minimal knowledge of Banach lattices to understand; it is simply the proofs that use the technology and terminology from this theory. Unless otherwise mentioned, all -spaces, -spaces and Banach lattices are real. When a result is applicable for complex scalars, we will explicitly state this. The word “subspace” is to be interpreted in the vector space sense. If a result requires the subspace to be closed or (in)finite dimensional, we will state this.
Recall that a vector lattice is a vector space, equipped with a compatible lattice-ordering (see [7] for a precise definition). For a vector lattice , the positive cone of is denoted by The infimum of is denoted by , and the supremum is denoted by . The modulus of is defined as , and elements are said to be disjoint if . A weak unit is an element for which implies . For a net in , the notation means that is decreasing and has infimum . A subspace is a sublattice if it is closed under finite lattice operations; it is an ideal if and implies .
A Banach lattice is a Banach space which is also a vector lattice, and for which one has the compatibility condition whenever Note that the SPR inequality (1.1) remains well-defined when is replaced by an arbitrary Banach lattice. As we will see, several of our results on SPR are also valid in this level of generality. Common examples of Banach lattices include -spaces, -spaces, Orlicz spaces, and various sequence spaces. In this case, the ordering is pointwise, i.e., means for all (or almost all in the case of measurable functions) in the domain of and .
A Banach lattice is order continuous if for each net satisfying we have -spaces are order continuous for , but -spaces are not (unless they are finite dimensional). To transfer results from to more general Banach lattices, we will make use of the AL-representation procedure. For this, let be an order continuous Banach lattice with a weak unit . It is known that can be represented as an order and norm dense ideal in for some finite measure . That is, there is a vector lattice isomorphism such that Range is an order and norm dense ideal in . Note that need not be a norm isomorphism, though may be chosen to be continuous with . Moreover, Range contains as a norm and order dense ideal. It is common to identify with Range and view as an ideal of . Such an inclusion of into is called an AL-representation of . We refer to [60, Theorem 1.b.14] or [38, Section 4] for details on AL-representations.
2.1. The Kadec-Pelczynski dichotomy
Here, we briefly recap the literature on subspaces which do not contain almost disjoint normalized sequences. Recall that a sequence in a Banach lattice is said to be a normalized almost disjoint sequence if for all , and there exists a disjoint sequence in such that . Following [15, 39, 40], a closed subspace of a Banach lattice that fails to contain normalized almost disjoint sequences will be called dispersed. The classical Kadec-Pelczynski dichotomy (c.f. [60, Proposition 1.c.8]) states that for a subspace of an order continuous Banach lattice with weak unit, either
-
(i)
fails to be dispersed, i.e., contains an almost disjoint normalized sequence, or,
-
(ii)
is isomorphic to a closed subspace of
As we will see in Theorem 3.4, for real scalars, a subspace does stable phase retrieval if and only if it does not contain normalized almost disjoint pairs. Hence, the Kadec-Pelczynski dichotomy will provide a tool to analyze such subspaces.
In for and a probability measure , the Kadec-Pelczynski dichotomy can be improved. Indeed, we summarize the literature in the following theorem.
Theorem 2.1.
Let and be a probability measure. For a closed subspace of , the following are equivalent:
-
(a)
is dispersed, i.e., contains no almost disjoint normalized sequences;
-
(b)
There exists such that on ;
-
(c)
For all , on ;
-
(d)
is strongly embedded in , i.e., convergence in measure coincides with norm convergence on .
Moreover,
-
(i)
For , a closed subspace of is dispersed if and only if it contains no subspace isomorphic to .
-
(ii)
For , a closed subspace of is dispersed if and only if it is isomorphic to a Hilbert space.
-
(iii)
For and any , there is a closed subspace of which is both dispersed and isometric to .
-
(iv)
For , cannot be written as the direct sum of two dispersed subspaces.
-
(v)
There exists an orthogonal decomposition with both and dispersed in .
Proof.
The equivalence of (b), (c) and (d) is [4, Proposition 6.4.5]. Other than the isometric portion of statement (iii), the rest of the statements are neatly summarized in [39, Propositions 3.4 and 3.5], with references to various textbooks for proofs. An isometric embedding of into for is given in [60, Corollary 2.f.5]. An isometric embedding of into for is given in [4, Proposition 6.4.12]. ∎
Remark 2.2.
One of the goals of this article is to find SPR analogues of the results in Theorem 2.1. However, we should mention that the connection between Theorem 2.1 and SPR has already been implicitly made in [27]. Recall that a subset is called a -set if the closed subspace generated by the set of exponentials satisfies the equivalent conditions in Theorem 2.1. Such sets have been deeply studied [9, 19, 69], and have many interesting properties. For example, Rudin [68] showed that for all integers , there are -sets that are not -sets for every . Moreover, Bourgain [18] extended Rudin’s theorem to all . On the other hand, when , and is , then it is automatically for some ([11, 44]). Since , complex exponentials cannot do stable phase retrieval. However, by replacing by or other trigonometric polynomials with non-constant moduli, [27] is able to use combinatorial arguments in the spirit of Rudin to produce SPR subpaces of when the dilation set is sufficiently sparse.
2.2. Complex Banach lattices
Complex Banach lattices are defined as complexifications of real Banach lattices, and in the case of complex function spaces like and , agree with the standard definition. More precisely, by a complex Banach lattice we mean the complexification of a real Banach lattice, , endowed with the norm , where the modulus is the mapping given by
(2.1) |
We refer to [1, Section 3.2] and [70, Section 2.11] for a proof that the modulus function is well-defined, and behaves as expected.
With the above definition, one can define complex sublattices, complex ideals, etc. However, we will not need this. We do, however, note that if is a real linear operator between real Banach lattices, then we may define the complexification of via The map is -linear, bounded, and if is a lattice homomorphism then preserves moduli, i.e., for When we work with complex Banach lattices , we will use these facts to identify as a space of measurable functions on some measure space, and then work pointwise. How to do this will be explained later in the paper.
3. General theory
In this section, we present several results on (stable) phase retrieval that are valid in general Banach lattices. We begin with the definitions:
Definition 3.1.
Let be a subspace of a vector lattice . We say that does phase retrieval if for each with there is a scalar such that
Definition 3.2.
Let be a subspace of a real or complex Banach lattice . We say that does -stable phase retrieval if for each we have
(3.1) |
If does -stable phase retrieval for some , we simply say that does stable phase retrieval (SPR for short).
Note that if a subspace of a real or complex Banach lattice does -stable phase retrieval, then so does its closure.
3.1. Connections with almost disjoint pairs and sequences
When considering whether a subspace does phase retrieval, there is one obvious obstruction. If are non-zero disjoint vectors, then , but cannot be a multiple of . Hence, if is to do phase retrieval, then it cannot contain disjoint pairs. Similarly, if is to do stable phase retrieval, then it cannot contain “almost” disjoint pairs. As we will now see, in the real case, these are the only obstructions to (stable) phase retrieval.
Definition 3.3.
Let be a subspace of a real or complex Banach lattice . We say that contains -almost disjoint pairs if there are such that If contains -almost disjoint pairs for all , we say that contains almost disjoint pairs.
Theorem 3.4.
Let be a subspace of a Banach lattice , and . Then,
-
(i)
If does -stable phase retrieval, then it contains no -almost disjoint pairs;
-
(ii)
If contains no -almost disjoint pairs, then it does -stable phase retrieval.
In particular, does stable phase retrieval if and only if it does not contain almost disjoint pairs.
Proof.
(i)(ii): Suppose that does -stable phase retrieval, but there are such that but . Define and Then since the identity
holds in any vector lattice by [7, Theorem 1.7], we have
On the other hand, has norm , and also has norm . This contradicts that does -stable phase retrieval.
(ii)(i): A classical Banach lattice fact (see, e.g., [10, Remark after Lemma 3.3]) is that every Banach lattice embeds lattice isometrically into some space of the form
Since both stable phase retrieval and existence of almost disjoint pairs are invariant under passing to and from closed sublattices, we may assume without loss of generality that is of this form.
Suppose does not do -stable phase retrieval. Find such that For each let
Then
We compute that
So, since the modulus is additive on disjoint vectors,
Now, by definition of we have
and
Notice next that and are disjoint. Moreover,
Similarly,
By assumption, we have that both and are non-zero. Hence, by [7, Lemma 1.4], and the fact that we have
It follows that
Thus, we have constructed normalized -almost disjoint vectors and in . ∎
Remark 3.5.
Implication (i) of Theorem 3.4 holds when the Banach lattice is replaced by any vector lattice equipped with an absolute norm. Here, a norm on a vector lattice is absolute if for all ; see [16, 55, 66] for more information. The proof of Theorem 3.4 also shows that a subspace of a Banach lattice does phase retrieval if and only if it does not contain disjoint non-zero vectors. A compactness argument then yields that in finite dimensions, phase retrieval implies stable phase retrieval. Indeed, consider the map , Then this map is continuous, so its image is compact, which allows one to conclude that the existence of almost disjoint pairs implies the existence of a disjoint pair. In infinite dimensions, it is relatively easy to construct subspaces doing phase retrieval but failing stable phase retrieval.
Proposition 3.6.
Every infinite dimensional Banach lattice has a closed subspace which does phase retrieval but not stable phase retrieval.
Proof.
By [6, p. 46, Exercise 13], any infinite dimensional Banach lattice contains a normalized disjoint positive sequence, which we shall index as consisting of vectors and ; here, denotes the set of all two-element subsets of (the order is not important). We fix an injection and consider the vectors
The sum above converges, and we have
Then , hence, by [4, Theorem 1.3.9], is a Schauder basic sequence. Also, for each , so this basis is semi-normalized.
We shall show that fails stable phase retrieval, but has phase retrieval.
To show the failure of SPR, let, for , . Clearly , and for any . Note that , hence
Next we show that does phase retrieval. Pick non-zero , with ; we have to show that . To this end, write and . We can expand
and likewise for . Comparing the coefficients with , we conclude that, for every , . By switching signs in front of and , and by re-indexing, we can assume that . We have to show that the equality holds for every .
The preceding reasoning shows that iff . Suppose both and are different from . Comparing the coefficients with , we see that
which is only possible if . ∎
Example 3.7.
Theorem 3.4 fails for complex spaces. Indeed, define as the complex span of , where we equip with the modulus . Clearly, contains vectors with but such that is not zero for any . Hence, fails phase retrieval. However, one can easily compute that contains no disjoint vectors, which by compactness yields the non-existence of almost disjoint vectors. Moreover, as observed in [27], a complex subspace that contains two linearly independent real vectors cannot do complex phase retrieval. In particular, if is subspace of a Banach lattice with , then the canonical subspace fails to do phase retrieval.
Remark 3.8.
Theorem 3.4 shows that for real scalars, the study of subspaces doing stable phase retrieval is equivalent to the study of subspaces lacking almost disjoint pairs. As mentioned in Section 2.1, there is a vast literature on closed subspaces lacking almost disjoint normalized sequences. Clearly, if contains an almost disjoint normalized sequence, then it fails to do stable phase retrieval. However, the converse is not true. For example, the standard Rademacher sequence in , , is dispersed by Khintchine’s inequality, but for all . Moreover, if one adds a single disjoint vector to a dispersed subspace, one produces a dispersed subspace failing phase retrieval. Nevertheless, as mentioned in Section 1.2, many of the results in Theorem 2.1 have SPR analogues.
3.2. Hölder stable phase retrieval and witnessing failure of SPR on orthogonal vectors
In [27], the following terminology was introduced in the setting of -spaces: A subspace of a real or complex Banach lattice is said to do -Hölder stable phase retrieval with constant if for all we have
(3.2) |
The utility of this definition arose from a construction in [27] of SPR subspaces of which are dispersed in . Applying certain Hölder inequality arguments, [27] was then able to deduce that such subspaces do -Hölder stable phase retrieval in . The idea in [27] is to begin with an orthonormal sequence , and instead of comparing to , one compares to . Assuming the integrability condition with uniformly bounded norm, and various orthogonality and mean-zero conditions on the products , the orthogonal expansion leads to an orthogonal expansion
The products encode how the subspace “sits” in , i.e., they encode the lattice structure. However, analyzing rather than allows one to work algebraically. As was shown in [27], if one imposes appropriate orthogonality conditions, the subspace spanned by will do stable phase retrieval in . [27] then gives examples of such built from dilates of a single function , with not identically constant. Verifying that such sequences satisfy the required orthogonality conditions is then a combinatorial exercise, using sparseness of the dilates to get non-overlapping supports with respect to the basis expansion. This sparseness naturally leads to lying in higher -spaces, so that by interpolating, one concludes that does Hölder stable phase retrieval in with if , and as .
The purpose of this section is to show that - at the cost of dilating the constant - Hölder stable phase retrieval is equivalent to stable phase retrieval. For real scalars, this can already be deduced from the almost disjoint pair characterization in Theorem 3.4. However, the proof below works equally well for complex scalars. The following theorem was proven in [5] for phase retrieval using a continuous frame for a Hilbert space. We extend it here to subspaces of Banach lattices.
Theorem 3.9.
Let be a Banach lattice, real or complex. There exists a universal constant such that for any linearly independent , there exists with
(3.3) |
and
(3.4) |
and
(3.5) |
Remark 3.10.
Conditions (3.3) and (3.5) state that replacing by tightens the SPR inequality up to the universal factor . The condition (3.4) states that and are “almost orthogonal”; it also permits us to witness the failure of SPR on with controlled norm.
The constant appearing in the proof of the theorem is the supremum of the Banach-Mazur distance between a -dimensional subspace of and . In general, by John’s Theorem, , but in certain cases a better estimate can be obtained. For instance, if then .
To prove Theorem 3.9, we need to represent elements of as measurable functions. As mentioned in the proof of Theorem 3.4, every (real) Banach lattice embeds lattice isometrically into a space of the form Hence, throughout the proof we can assume that elements of are functions on a measure space. In the complex case, a similar reduction is possible. Indeed, let be a complex Banach lattice. By the discussion in Section 2.2, we can assume that is the complexification of some (real) Banach lattice . We can then let be a lattice isometric embedding. The complexification maps into the complexification of . The codomain of this map is still , but now interpreted as a Banach lattice over the complex field (cf. [1, Exercises 3 and 5 on page 110]). Since is one-to-one, the definition of tells us that is one-to-one. Moreover, as mentioned in Section 2.2, preserves moduli. Finally, by [1, Lemma 3.18 or Corollary 3.23], preserves norm. Thus, everything in the SPR inequality is preserved, so, analogously to the real case, we may assume throughout the proof that the complex Banach lattice is a space of complex-valued functions.
Proof of Theorem 3.9.
Let . This is a -dimensional Banach space. Hence, there exists an equivalent norm such that is Hilbert, and
By replacing by a unimodular scalar times , we assume
This latter condition is equivalent to Indeed,
This is minimized when is the conjugate phase of . This is minimized when iff .
Consider and for . We let be the first instance of This is possible since when , the inner product is non-negative, and when , it is negative. Note that
Thus, since and are orthogonal,
We will take and . To see (3.3), we compute
(3.6) |
Moreover, as and are orthogonal in ,
(3.7) |
This gives (3.4). Note that in the worst case scenario, we have However, if the Banach-Mazur distance to is less than , the constant improves.
We now verify (3.5). To see this, we prove
(3.8) |
We represent and let . We will prove that
(3.9) |
Note that (3.9) is simply a claim that an elementary inequality holds for complex numbers. Write and . Multiplying and by a unimodular scalar, we rotate so that WLOG, ; then, multiplying by if necessary, we also assume . We have
Now, we note that our assumptions give for Indeed, and for by elementary computations. Taking , Hence, we must prove
This inequality is true for all . Indeed, recall first that . By the Fundamental Theorem of Calculus, for any convex function and , we have . In our case, the function is convex and ; therefore,
Remark 3.11.
For real or complex , the proof of Theorem 3.9 shows that , and is orthogonal to . Actually, the proof gives a more local result: If is a closed subspace of a Banach lattice , and is -isomorphic to a Hilbert space , then for one can take and orthogonal to in .
Corollary 3.12.
Let be a subspace of a real or complex Banach lattice , and . If does -Hölder stable phase retrieval in with constant then does stable phase retrieval in with constant .
Proof.
Let with and such that
(3.10) |
In particular,
As does -stable -Hölder phase retrieval, we have that
(3.11) |
Thus, we have that and . It follows that
(3.12) |
To prove (3.12) we have assumed that and . However, by scaling we have that any which satisfy (3.10) also satisfy (3.12).
We now consider any pair of linearly independent vectors . By Theorem 3.9 there exists which satisfy (3.10) such that
Thus, we have that
This proves that does -stable phase retrieval. ∎
Remark 3.13.
The constant in Corollary 3.12 arises by using the worst case scenario from Theorem 3.9. This constant can certainly be optimized; for example, if one also takes into account the distance from to a Hilbert space.
To conclude this section we give a simple proof that in finite dimensions, phase retrieval is automatically stable.
Corollary 3.14.
Let be a real or complex Banach lattice, and a finite dimensional subspace of . If does phase retrieval, then does stable phase retrieval.
Proof.
The real case has already been dealt with in Remark 3.5, but the argument we provide below works for both real and complex scalars. Indeed, by Theorem 3.9, if fails to do stable phase retrieval then we can find, for each , functions with , ,
(3.13) |
and
(3.14) |
By compactness, after passing to subsequences, we may assume that and , for some . Since for all , it follows that . Moreover, from (3.14) and continuity of lattice operations, we see that . Hence, . Fix a phase . By (3.13), we have
Passing to the limit, we see that
Hence, . It follows that fails to do phase retrieval. ∎
Remark 3.15.
Note that the Banach lattice in Corollary 3.14 is not assumed to be finite dimensional. This is of some note, as, unlike for closed spans, the closed sublattice generated by a finite set can be infinite dimensional.
4. Examples
4.1. Building SPR subspaces via isometric theory
As mentioned in Theorem 2.1, when and , one can find isometric copies of in As we will now see, such subspaces must do SPR.
Proposition 4.1.
Suppose , and either , or . There exists an such that if is -isomorphic to , then does SPR in .
Proof.
We only handle case (1), as (2) is very similar. Suppose, for the sake of contradiction, that fails SPR. Then by Theorem 3.4, contains -isomorphic copies of , for any . Consequently, for any such we can find norm one so that . However, by the Clarkson inequality in ,
where . However, the left side is , and it is easy to see that . Hence, we get a contradiction if is sufficiently small. ∎
Corollary 4.2.
If either , or , then contains an SPR subspace isometric to .
Proof.
It is well known (see e.g. [50, Section 9]) that, under the above conditions, contains an isometric copy of . By Proposition 4.1, that copy does SPR. ∎
4.2. Existence of SPR embeddings into sequence spaces
Proposition 4.3.
If a Banach space embeds into for some cardinal which happens, in particular, when itself has density character , then there is an isomorphic SPR embedding of inside of .
The fact that any Banach space of density character embeds isometrically into is standard. We recall the construction for the sake of completeness: Let be a dense subset of of cardinality ; for each find so that . Then is the desired embedding. Similarly, one can show that if is a dual space, with a predual of density character , then embeds isometrically into .
To establish Proposition 4.3, it therefore suffices to prove:
Lemma 4.4.
For any cardinal , there exists an isometric SPR embedding of into itself.
To prove Lemma 4.4, we rely on the following.
Lemma 4.5.
Suppose is a real or complex Banach space, and have norm . Then there exists a norm functional so that .
Proof.
Suppose first that (here is either or ). Find so that . By the triangle inequality, . Find so that . Then . The case of is handled similarly.
Now suppose . By Hahn-Banach Theorem, there exist norm one so that , , , and . Then has the desired properties. Indeed, , hence
and likewise, . ∎
Proof of Lemma 4.4.
For the sake of brevity, we shall use the notation , and .
Pick a dense set in , with .
Define an isometric embedding . We shall show that, for every and , there exists so that . Once this is done, we will conclude that for any , which by Theorem 3.4 tells us that is indeed an SPR embedding.
By Lemma 4.5, there exists so that . By Goldstine’s Theorem, there exists so that . Find so that . Then
which proves our claim. ∎
Remark 4.6.
We can define the canonical embedding of into (with equipped with its weak∗ topology) by sending to the function . The above reasoning shows that this embedding is SPR. For separable , more can be said - see Proposition 6.2 below.
Remark 4.7.
If an atomic lattice is order continuous (which of course is not), then the “gliding hump” argument shows the non-existence of infinite dimensional dispersed subspaces. The lattice is not order continuous, but it has no infinite dimensional dispersed subspaces. This is because contains as a subspace of finite codimension, hence any infinite dimensional subspace of has an infinite dimensional intersection with .
Combining the results from this and the previous subsection, we see that, often, the collection of dispersed subspaces of a Banach lattice coincides with those that do SPR, up to isomorphism (cf. 7.1 below). Indeed, we have the following:
Corollary 4.8.
For every dispersed subspace (, there exists a closed subspace isomorphic to , and doing stable phase retrieval. The same result holds with replaced by , or any order continuous atomic Banach lattice.
Proof.
By Theorem 2.1, for and , a closed subspace of is dispersed if and only if it contains no subspace isomorphic to . A result of Rosenthal [67] states that for , a subspace of that does not contain must be isomorphic to a subspace of for some . By Corollary 4.2, one can build an SPR copy of in .
In the case Theorem 2.1 states that any dispersed subspace of must be isomorphic to a Hilbert space. By Corollary 4.2, contains an SPR copy of .
To deal with the case , note that is isomorphic (as a Banach space) to , and use Lemma 4.4 together with the fact that lattice isometrically embeds in .
For order continuous atomic lattices and , there are no infinite dimensional dispersed subspaces by Remark 4.7. The claim for and will be proven in Proposition 6.2 below, when we analyze SPR subspaces of -spaces. As we will see in the proof of Proposition 6.2, the fact that every separable Banach space embeds into and in an SPR fashion ultimately follows from Remark 4.6. ∎
4.3. Explicit constructions of SPR subspaces using random variables
In this subsection, we construct SPR subspaces of a rather general class of function spaces by considering the closed span of certain independent random variables. The use of sub-Gaussian random vectors has been widely successful in building random frames for finite dimensional Hilbert spaces which do stable phase retrieval whose stability bound is independent of the dimension [24, 25, 34, 53, 54]. However, different distributions for random variables will allow for the construction of subspaces which do stable phase retrieval and are not isomorphic to Hilbert spaces. We begin by presenting a technical criterion for SPR.
Proposition 4.9.
Suppose is a Banach lattice of measurable functions on a probability measure space which contains the indicator functions and has the property that for every there exists so that whenever . Suppose, furthermore, that is a subspace of , which has the following property: There exist and so that, for any norm one , we have
(4.1) |
Then is an SPR-subspace.
Proof.
Suppose have norm . By the Inclusion-Exclusion Principle,
Thus, . ∎
The above proposition is applicable, for instance, when is a rearrangement invariant (r.i. for short; see [61] for an in-depth treatment) space on , equipped with the canonical Lebesgue measure . Examples include spaces, and, more generally, Lorentz and Orlicz spaces (once again, described in great detail in [61]; for Lorentz spaces, see also [32]). Below we describe some SPR subspaces, spanned by independent identically distributed random variables.
Suppose is a random variable, realized as a measurable function on (with the usual Lebesgue measure ). Then independent copies of – denoted by – can be realized on . By Caratheodory’s Theorem (see e.g. [57, p. 121]), there exists a measure-preserving bijection between and . Therefore, we view as functions on .
Suppose now that, in the above setting, the following statements hold:
-
(i)
belongs to , and has norm one in that space;
-
(ii)
There exists so that, if are independent copies of , and , then is equidistributed with ;
-
(iii)
There exists so that .
In this situation, if are independent copies of (viewed as elements of , per the preceding paragraph), then is an SPR copy of in .
We should mention two examples of random variables with the above properties: Gaussian ((ii) holds with ) and -stable (; (ii) holds with ). The details can be found in [4, Section 6.4]. For the Gaussian variables, the probability density function is , with depending on the normalization. For the -stable variables with characteristic function (with ensuring normalization), the Fourier inversion formula gives the density function
In both cases, is continuous (in the latter case, due to Dominated Convergence Theorem), hence there exists so that
It is known that Gaussian random variables belong to for , while the -stable random variables () lie in if and only . Moreover, the results from [61, p. 142-143] tell us that for (this is a continuous inclusion, not an isomorphic embedding). If , then the -stable variables belong to (indeed, take ; then the -stable variables live in , which in turn sits inside of ). Likewise, one shows that any Lorentz space contains Gaussian random variables.
The above reasoning implies:
Proposition 4.10.
Suppose and when , assume in addition . Then contains a copy of that does SPR. If, in addition, , then contains a copy of that does SPR.
4.4. Stability of SPR subspaces under ultraproducts and small perturbations
We show that SPR subspaces are stable under ultraproducts, and under small perturbations (in the sense of Hausdorff distance). These results hold for both real and complex spaces.
Proposition 4.11.
Suppose is an ultrafilter on a set , and, for each , is a -SPR subspace of a Banach lattice . Then is a -SPR subspace of .
We refer the reader to [45] or [31, Chapter 8] for information on ultraproducts of Banach spaces and Banach lattices.
Proof.
We have to show that, for any , there exists a modulus one so that . To this end, find families and , representing and respectively. Then for each there exists so that and . As ultraproducts preserve lattice operations, and are represented by and , respectively, hence . By the compactness of the unit torus, there exists , with . Then , which leads to the desired inequality. ∎
Remark 4.12.
Proposition 4.11 can be used to give an alternative proof of Corollary 4.2.
First find a family of finite dimensional subspaces , ordered by inclusion, so that is dense in , and each is isometric to for some (one can, for instance, take subspaces spanned by certain step functions). A reasoning similar to that of [31, Theorem 8.8] permits us to find a free ultrafilter so that contains an isometric copy of . A fortiori, contains an isometric copy of (call it ).
Proposition 4.10 proves that contains a subspace, isometric to (spanned by Gaussian random variables for , -stable random variables for ) which does SPR. By Proposition 4.11, embeds isometrically into , in an SPR fashion. By [45], can be identified (as a Banach lattice) with , for some measure space .
To examine stability of SPR under small perturbations, we introduce the notion of one-sided Hausdorff distance between subspaces of a given Banach space. If are subspaces of , define as the infimum of all so that, for every with there exists with (this “distance” is not reflexive, hence “one-sided”). Note also that, for as above, there exists with and ; indeed, one can take .
By “symmetrizing” , we obtain the classical Hausdorff distance: if and are subspaces of , let . For interesting properties of , see [20], and references therein.
Proposition 4.13.
Suppose is an SPR subspace of a Banach lattice . Then there exists so that any subspace with is again SPR.
From this we immediately obtain:
Corollary 4.14.
For any Banach lattice , the set of its SPR subspaces is open in the topology determined by the Hausdorff distance.
Remark 4.15.
See [39, Proposition 3.10] for a similar stability result for dispersed subspaces of a Banach lattice.
Proof of Proposition 4.13.
Suppose does -SPR. We shall show that, if , then does -SPR, with
Suppose, for the sake of contradiction, that fails to do -SPR. Find so that and . By Theorem 3.9, we can find so that
For any , there exist so that and . The triangle inequality implies:
As does -SPR, we conclude that
and consequently,
which contradicts our choice of . ∎
R. Balan proved that frames which do stable phase retrieval for finite dimensional Hilbert spaces are stable under small perturbations [12]. The following extends this to infinite dimensional subspaces of Banach lattices.
Corollary 4.16.
Suppose is a semi-normalized basic sequence in a Banach lattice , so that does SPR in . Then there exists so that if and then does SPR in .
Remark 4.17.
In real , Corollary 4.16 can be strengthened. Suppose is a sequence of normalized independent mean-zero random variables, spanning an SPR-subspace of . Then there exists an with the following property: if is a collection of normalized independent mean-zero random variables so that are independent whenever , and , then does SPR as well.
For the proof, recall that there exists so that the inequality holds for any norm one . Let .
We will show that, for any norm one , we have .
Write and , and define , . Then
Similarly, . Therefore, , hence . But , hence .
5. SPR in -spaces
In this section, we investigate the relations between dispersed and SPR subspaces of , as well as the relation between doing SPR in versus doing SPR in .
Theorem 5.1.
Every infinite dimensional dispersed subspace of an order continuous Banach lattice contains a further closed infinite dimensional subspace that does SPR.
Proof.
We first prove the claim for , with a finite measure. Let be a closed infinite dimensional subspace of containing no normalized almost disjoint sequence. By Theorem 2.1, also does not contain . By [56], every closed infinite dimensional subspace of almost isometrically contains for some . Since does not contain , it follows that there exists such that for all , is -isomorphic to a subspace of . Let be such that is not -isomorphic to a subspace of . Such an exists by the Clarkson argument in Proposition 4.1.
We now claim that for , every subspace of that is -isomorphic to must do stable phase retrieval. Indeed, if failed SPR, it would contain for all a -copy of Thus, for all , we have that is -isomorphic to a subspace of .
However, this gives a contradiction if is small enough such that .
Now let be a closed infinite dimensional dispersed subspace of an order continuous Banach lattice . Replacing be a separable subspace of , we may assume that is separable. Using that every closed sublattice of an order continuous Banach lattice is order continuous, replacing by the closed sublattice generated by in , we may assume that is separable. It follows in particular that has a weak unit. By the AL-representation theory, there exists a finite measure space such that can be represented as an ideal of satisfying
-
(i)
is dense in and is dense in ;
-
(ii)
and for all .
Since contains no almost disjoint normalized sequence, the Kadec-Pelczynski dichotomy [60, Proposition 1.c.8] guarantees that on . In particular, we may view as a closed infinite dimensional subspace of . We claim that contains no almost disjoint sequence when viewed as a subspace of . Indeed, suppose there exists a sequence in with for all , and a disjoint sequence in with . Then in particular, converges to in measure. By [30, Theorem 4.6], in . That is, for all , we have that . Thus, by [30, Theorem 3.2] there exists a subsequence and a disjoint sequence in such that . Since and on , this contradicts that contains no normalized almost disjoint sequence.
By the beginning part of the proof, we may select an infinite dimensional closed subspace of that does SPR in . In other words, there exists such that for all with we have
Since on , the same is true on , so we may view as a closed infinite dimensional subspace of . We claim that it contains no normalized almost disjoint pairs. Indeed, if with , then . Now, using that does SPR in and property (ii) of the embedding, we have
Thus, contains no normalized almost disjoint pairs when viewed as a subspace of . It follows that does SPR in . ∎
Question 5.2.
With Corollary 4.8 and Theorem 5.1 in mind, we ask the following: If a Banach lattice contains an infinite dimensional dispersed subspace , does it contains an infinite dimensional SPR subspace? If so, can we construct an infinite dimensional SPR subspace with ?
Our next results are motivated by the equivalence between statements (a)-(d) in Theorem 2.1 and the discussion in Remark 2.2. Note that it follows from Theorem 2.1 (a)-(d) that if is dispersed in and , then may be viewed as a closed subspace of , and it is dispersed in . It is then natural to ask the following question: Let be a finite measure and . Let be a subspace of . What is the relation between doing SPR in versus doing SPR in ? It is easy to see that if does SPR in , then does SPR in if and only if on . We will now show that doing SPR in does not imply does SPR in , even though the property of being dispersed passes from to .
Theorem 5.3.
For all there exists a closed subspace such that does stable phase retrieval in but fails to do stable phase retrieval in for all .
Proof.
Let . It will be convenient to build the subspace instead of . Let be the Rademacher sequence of independent, mean-zero, random variables on . For all , we let .
Let .
We first prove for all that fails to do stable phase retrieval in . We have for all that
. On the other hand, and . Thus, . This shows that fails to do stable phase retrieval in .
We now prove that does stable phase retrieval in . Note that by Khintchine’s Inequality there exists so that for all scalars . Thus, we have for all and that
This computation shows that the map extends linearly to a map , , establishing an isomorphism between and a Hilbert space. By Theorem 3.9 and Remark 3.11 it suffices to prove that there exists a constant so that if and with and such that , , and then .
We now claim that it suffices to prove that there exists such that
(5.1) |
Indeed, as all the norms are equivalent on the span of the Rademacher sequence, there exists a uniform constant so that the following holds:
Here, the constant comes from bounding
(5.2) |
To get this upper estimate, note that, by Hölder’s Inequality,
hence, by Triangle Inequality,
(5.3) |
Further, both and belong to the span of independent Rademachers, on which all the norms are equivalent (for finite ). Since we know that and , this gives a bound for the right-hand side of (5.3), which, in turn, implies (5.2).
To finish the proof of the claim, note that if then and if then .
We now establish (5.1) with and . Let and . We let and and assume that , and . We may assume that
(5.4) |
All that remains is to prove that . We have from (5.4) that for all . Hence, for all as . As for all , we have that
(5.5) |
Note that (5.5) gives an expansion for in terms of the ortho-normal collection of vectors . Thus we have that
Hence, ∎
Example 5.4.
In the special case , Theorem 5.3 could have been proven using a result in [23]. Indeed, as above, let denote the Rademacher sequence, realized on the interval . Define . We can think of the sequence as being defined on a finite measure space. Note that . Hence, for the same reason as in [23], does SPR in . However, recall that the Rademacher sequence does not do phase retrieval; we’ve also scaled the additional indicator functions to be perturbative in . Hence, for we have , whereas the other side of the SPR inequality is of order This provides an example of a subspace that does SPR in but not in .
As a special case of the next result, we show that for , if does SPR in and , then we can both interpolate and extrapolate to deduce that does SPR in for
Theorem 5.5.
Suppose is a probability measure and . Let be a closed subspace of (real or complex). Assume that on , and does stable phase retrieval in . Then for all , on , and does stable phase retrieval in .
Proof.
Assume first that . Let so that the and norms are -equivalent on , and let so that does -stable phase retrieval in . As we have for all that
(5.6) |
Thus, does stable phase retrieval in .
We now turn to the case . By the previous argument, does stable phase retrieval in . Hence, the norm is equivalent to the norm on , and hence the norm is equivalent to the norm on . Let so that the and norms are -equivalent on , and let so that does -stable phase retrieval in . Let be the value so that . By Hölder’s inequality, for any
(5.7) |
Therefore, for any , we have
Thus, does -Hölder stable phase retrieval in . By Corollary 3.12, it follows that does stable phase retrieval in . ∎
In Theorem 5.3, we showed that when an SPR-subspace need not do SPR in for any . Our next result shows that the case is completely different.
Theorem 5.6.
Let be a probability space and let be a closed infinite dimensional subspace of . Consider the following statements:
-
(i)
does stable phase retrieval in .
-
(ii)
does stable phase retrieval in and on .
-
(iii)
There exists such that for all ,
(5.8)
Then for all , (iii)(ii)(i). Moreover, if , all three statements are equivalent.
Proof.
: Note that condition (iii) implies that contains no normalized -disjoint pairs, when viewed in the norm. Hence, does SPR in , which implies that on . Using this in condition (iii), we conclude that contains no normalized almost disjoint pairs, when viewed in the norm, hence does SPR in .
: Let so that for all . Let so that does -stable phase retrieval in . Thus, for all we have that
Thus, does -stable phase retrieval in .
: Let and assume that (i) is true but (iii) is false. We first note that condition (i) implies that on . We may choose a sequence of pairs in and such that , with
(5.9) |
As converges in measure to and is uniformly bounded below in norm, after passing to a subsequence we may find a sequence of disjoint subsets such that
(5.10) |
Let with . After passing to a subsequence, we may assume that for all . As is a sequence of disjoint subsets of the probability space , we have that . Thus, after passing to a further subsequence we may assume that for all . Again, after passing to a further subsequence we may assume that there exists values such that for all . Furthermore, we may assume that for all . As is a sequence of disjoint sets, we have for all that
In particular, we have that . Hence, after passing to a further subsequence of we may assume that for all . Thus,
for all . In summary, we have that for all , and for all , we have
As , we have in particular that for all .
We have that is a semi-normalized sequence in a closed subspace of which does not contain . Thus, by [67, Theorem 8], is equivalent to a semi-normalized sequence in for some and probability measure .
We may assume after passing to a subsequence that is weakly convergent in . Thus, the sequence converges weakly to in . As has an unconditional basis, after passing to a further subsequence, we may assume that is -unconditional for some constant .
As has type and is unconditional, we have that is dominated by the unit vector basis of .
We will prove that there exists a constant so that for all there exists such that the finite sequence -dominates the unit vector basis of . As , this would contradict that is dominated by the unit vector basis of . Alternatively, one could use that has type , the uniform containment of , and [67, Theorem 13] to get that contains a subspace isomorphic to , which, in view of Theorem 2.1, contradicts that does stable phase retrieval in .
Let and . Let be large enough so that . Let be a sequence of scalars. We have that
Now that we have established that all three statements in Theorem 5.6 are equivalent for , we can show the implication (ii)(iii) for . Indeed, we assume (ii) holds. Since does SPR in , by (ii)(iii) for , we deduce that there exists such that for all ,
(5.11) |
Now we use the second assumption of (ii) to replace the norm with the norm in (5.11). ∎
6. -spaces with SPR subspaces
Throughout this section, subspaces are assumed to be closed and infinite dimensional, unless otherwise mentioned. Recall that a non-empty compact Hausdorff space is called perfect if it has no isolated points, and scattered (or dispersed) if it contains no perfect subsets. For a compact Hausdorff space , we define its Cantor-Bendixson derivative to be the set of all non-isolated points of . Clearly is closed, and iff is perfect; otherwise, is a proper subset of . Also, if contains a perfect set , then lies inside of as well.
Theorem 6.1.
Suppose is a compact Hausdorff space. Then has an SPR subspace if and only if is infinite.
The proof depends on an auxiliary result, strengthening Remark 4.6.
Proposition 6.2.
Every separable Banach space embeds isometrically into , and into , as a -SPR subspace here is the Cantor set.
Proof.
Fix a separable Banach space . Let be the unit ball of , with its weak∗ topology. By Lemma 4.5 and Remark 4.6, the natural isometric embedding (taking into the function ) is such that whenever . As is compact and metrizable, there exists a continuous surjection [52, Theorem 4.18]; this generates a lattice isometric embedding of into , hence one can find an isometric copy of so that whenever are norm one elements of .
View as a subset of . Then there exists a positive unital isometric extension operator – that is, for , ; ; ; and whenever . The “standard” construction of involves piecewise-affine extensions of functions from to ; for a more general approach, see the proof of [4, Theorem 4.4.4]. One observes that , hence, if has the property described in the preceding paragraph, then whenever have norm .
By Theorem 3.4, the copies of in and described above do -SPR. ∎
The next result is standard topological fare (cf. [63, Theorem 29.2]).
Lemma 6.3.
Suppose is a compact Hausdorff space, and , where is an open set. Then there exists an open set so that .
Proof of Theorem 6.1.
Suppose first that is finite (in this case, must be scattered). To show that any subspace fails SPR, consider . Then , hence is infinite dimensional as well. It suffices therefore to show that every infinite dimensional subspace of fails SPR.
Note that, in the case of finite , can be identified with as a Banach lattice. Indeed, any is continuous on , since this set consists of isolated points only. Extend to a function with , . Note that for any , the set is finite, hence closed; consequently, is an open neighborhood of any element of . From this it follows that is continuous.
On the other hand, pick . We claim that – that is, is finite for any . Suppose, for the sake of contradiction, that this set is infinite for some . By the compactness of , this set must have an accumulation point, which must lie in . This, however, contradicts the continuity of .
A “gliding hump” argument shows that no subspace of does SPR. From this we conclude that no subspace of does SPR if is finite.
Now suppose contains a perfect set. By [57, Theorem 2, p. 29], there exists a continuous surjection . This map generates a lattice isometric embedding . However, contains SPR subspaces, by Proposition 6.2.
It remains to prove that contains an SPR copy of when is scattered, and is infinite. Note first that must be infinite. Indeed, otherwise any point of will be an accumulation point of the same set, and will be perfect, which is impossible.
Observe also that any is an accumulation point of . Indeed, suppose otherwise, for the sake of contradiction. Then has an open neighborhood , disjoint from . If is another open neighborhood of , then so is . As is an accumulation point of , must meet , hence also . This implies , providing us with the desired contradiction.
Find distinct points . For each find an open set so that for .
Lemma 6.3 permits us to find an open set so that . Replacing by , by , and so on, we can assume that the sets are disjoint. Lemma 6.3 guarantees the existence of open sets so that, for every , .
As noted above, each is an accumulation point of . Therefore, we can find distinct points . For each , let be the closure of (note ). Note that there exists such that:
-
(i)
everywhere.
-
(ii)
.
-
(iii)
.
-
(iv)
for .
-
(v)
on .
To construct such an , recall that are isolated points of , hence the function , defined by , for , and everywhere else, is continuous. Further, by Urysohn’s Lemma, there exists so that , vanishing outside of . Then has the desired properties.
We claim that is equivalent to the standard -basis. Indeed, suppose , with . We need to show . The lower estimate on the norm is clear, since attains the value of at .
For an upper estimate, note that vanishes outside of , and on if is large enough. If is odd (), then the only point of where does not vanish is , which we have already discussed. If is even (), then except for the points (); at these points, equals , which has absolute value not exceeding .
It remains to show that does SPR. In light of Theorem 3.4, if suffices to prove that for any norm one . Write and . Find and so that . If , then both and equal at , so .
Otherwise, assume, by relabeling, that . If , then
The case of is treated similarly. If , then , and similarly, , which again gives us . ∎
Question 6.4.
The proof of Theorem 6.1 shows that is infinite iff contains an SPR copy of . If is “large” enough (in terms of the smallest ordinal for which is finite), what SPR subspaces (other than ) does have? Note that is isomorphic to ( is the first infinite ordinal). If is infinite, does contain an SPR copy of ? This question is of interest even for separable , i.e., metrizable .
In the spirit of Proposition 4.1, it is natural to ask which (isometric) subspaces of are necessarily SPR. Below we give a “very local” condition on a Banach space (finite or infinite dimensional) which guarantees that any isometric embedding of into has SPR.
Recall (see [47]) that a Banach space is called uniformly non-square if there exists so that, for any norm one we have . Note that fails to be uniformly non-square iff for every there exist norm one so that . In the real case, this means that contains (equivalently, ) with arbitrarily small distortion. This is incompatible with uniform convexity or uniform smoothness.
Proposition 6.5.
Any uniformly non-square subspace of does SPR.
Proof.
Suppose is a non-SPR subspace of ; we shall show that it fails to be uniformly non-square. To this end, fix ; by Theorem 3.4, there exist norm one with . Pointwise evaluation shows that
As the ambient lattice is an M-space, we have , hence
Replacing by , we conclude that .
Let and . Then
and similarly, . Then
and likewise, . As is arbitrary, fails to be uniformly non-square. ∎
For infinite dimensional subspaces, Proposition 6.5 is only meaningful when is not scattered. Indeed, if is scattered, then is -saturated [35, Theorem 14.26], hence any infinite dimensional subspace of contains an almost isometric copy of [59, Proposition 2.e.3]. In particular, such subspaces contain almost isometric copies of , hence they cannot be uniformly non-square.
In light of Proposition 6.5, we ask:
Question 6.6.
Which Banach spaces isometrically embed into in a non-SPR way?
Note that containing an isometric copy of (and consequently, failing to be uniformly non-square) does not automatically guarantee the existence of a non-SPR embedding into (in this sense, the converse to Proposition 6.5 fails). In the following example we look at isometric embeddings only; one can modify this example to allow for sufficiently small distortions.
Proposition 6.7.
There exists a -dimensional space , containing isometrically and consequently, failing to be uniformly non-square, so that, if is a Hausdorff compact, and is an isometric embedding, then for any norm one .
The following lemma is needed for the proof, and may be of interest in its own right.
Lemma 6.8.
Suppose is a Hausdorff compact, is a Banach space, and is an isometric embedding. Denote by the set of all extreme points of the unit ball of . Then, for any , .
Proof.
Standard duality considerations tell us that ( stands for the space of Radon measures on ) is a strict quotient – that is, for any there exists so that and . Further, we claim that, for any , there exists so that . Indeed, the set is weak∗-compact, hence it is the weak∗-closure of the convex hull of its extreme points. We claim that any such extreme point is also an extreme point of . Indeed, suppose , with . Then , which guarantees that , so , and therefore, they coincide with .
To finish the proof, recall that the extreme points of are point evaluations and their opposites. ∎
Proof of Proposition 6.7.
To obtain , equip with the norm
(6.1) |
Clearly gives us an isometric copy of in .
Note that the unit ball of is a polyhedron with vertices , , and ; we denote this set of vertices by . In light of Lemma 6.8, we have to show that, for any norm one and in , there exists so that .
In searching for , we deal with several cases separately. Note first that, if , then has the desired properties. The case of is treated similarly. Henceforth we assume . In light of (6.1), we need to consider three cases:
(i) or .
(ii) Either and , or and .
(iii) .
In all the three cases, we look for , with selected appropriately.
Case (i). We shall assume , as other permutations of indices and choices of sign are handled similarly. Select , and take so that . Pick if and otherwise. Then , hence
Further,
Case (ii). We deal with (and consequently, ) and , as other possible settings can be treated similarly. Let . If , select so that . Pick so that and have the same sign. Then
and
Suppose, conversely, that , hence . Let . Select so that and are of the same sign. Then , hence
On the other hand, and
Case (iii). If , let , and select so that both and have the same sign as . Then
and
The case of is handled similarly.
Now suppose neither of the above holds. Up to a permutation of indices, we assume that (hence ), and (hence ). Then let and . Pick so that , then
and likewise,
7. Open problems
We now list some open questions and directions for further research. The reader can find additional questions embedded throughout the paper.
Question 7.1.
(Classification of SPR subspaces): Given a Banach lattice , it is of interest to classify the closed subspaces of that do SPR. This question, of course, can be interpreted in various ways. Possibly the crudest of these is to classify the closed subspaces of doing SPR up to Banach space isomorphism. One can then refine this classification by tracking the optimal SPR and isomorphism constants. On the other hand, one can ask about the “structure” of the collection of SPR subspaces of . For example, whether certain natural candidates do SPR, or whether they have a further subspace/perturbation which does SPR. Compare with [23, Theorem 1.1], which, within a restricted class of subspaces of , is able to classify those that do SPR.
(Discretization): Phase retrieval is most often studied in terms of recovering a function from where is a linear transformation, such as the Fourier transform or Gabor transform. However, any use of phase retrieval in applications requires sampling at only finitely many points.
Gabor frames are constructed by sampling the short-time Fourier transform at a lattice; however, any frame constructed by sampling the Gabor transform at an integer lattice cannot do phase retrieval. There has been significant recent interest in determining which sampling points allow for constructing frames which do phase retrieval [3, 41, 43].
The problem of sampling continuous frames which do stable phase retrieval to obtain frames which do stable phase retrieval was introduced in [36] and was shown to be connected to important integral norm discretization problems in approximation theory (such as in [28, 29, 51, 58]). In [37] it is proven that if is a bounded continuous frame of a separable Hilbert space then there exists sampling points in such that is a frame of . The corresponding quantitative and finite dimensional theorem in [58] gives that for each there are universal constants so that if is a continuous Parseval frame of an -dimensional Hilbert space and for all then there exists on the order of sampling points in so that is a frame of with lower frame bound and upper frame bound . The proof of the above theorem relies on the celebrated solution to the Kadison-Singer Problem and its connection to frame partitioning [62, 64]. It is natural to consider if this discretization theorem holds as well for stable phase retrieval, and the following question is stated in [36].
Question 7.2.
Let . Do there exist constants so that for all there exists so that the following is true: Let be an -dimensional Hilbert space, a probability space, and a continuous Parseval frame of which does -stable phase retrieval such that for all . Then there exists a sequence of sampling points such that is a frame of which does -stable phase retrieval.
Note that if is a continuous Parseval frame of over a probability space then the analysis operator is an isometric embedding of into . We have that the continuous frame does -stable phase retrieval if and only if the range of the analysis operator does -stable phase retrieval as a subspace of . In Theorem 5.3 we prove that there exists a subspace such that does stable phase retrieval as a subspace of but that does not do stable phase retrieval as a subspace of . As shown by Theorem 5.6, doing stable phase retrieval in gives a lot of useful additional structure. This motivates the following problem.
Question 7.3.
Let . Do there exist constants so that for all there exists so that the following is true: Let be an -dimensional Hilbert space, a probability space, and a continuous Parseval frame of with analysis operator such that does -stable phase retrieval as a subspace of and as a subspace of , and for all . Then there exists a sequence of sampling points such that is a frame of which does -stable phase retrieval.
The previous two questions on constructing frames by sampling continuous frames relate to discretizing the -norm on a subspace of . There is significant interest in approximation theory on discretizing the -norm on finite dimensional subspaces of which are called Marcinkiewicz-type discretization problems [28, 29, 51, 58]. For , it is too much to ask for the number of sampling points to be on the order of the dimension of the subspace. This leads to the following general problem on discretizing stable phase retrieval.
Question 7.4.
Let be an -dimensional subspace for some and probability space . Let and let be strictly increasing. What properties on imply that there exists and sampling points so that the subspace does -stable phase retrieval in ? What properties on imply that there exists , sampling points , and weights with so that the subspace does -stable phase retrieval in ?
References
- [1] Y. A. Abramovich and C. D. Aliprantis. An invitation to operator theory, volume 50 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2002.
- [2] Rima Alaifari and Philipp Grohs. Phase retrieval in the general setting of continuous frames for Banach spaces. SIAM J. Math. Anal., 49(3):1895–1911, 2017.
- [3] Rima Alaifari and Philipp Grohs. Gabor phase retrieval is severely ill-posed. Appl. Comput. Harmon. Anal., 50:401–419, 2021.
- [4] Fernando Albiac and Nigel J. Kalton. Topics in Banach space theory, volume 233 of Graduate Texts in Mathematics. Springer, [Cham], second edition, 2016. With a foreword by Gilles Godefroy.
- [5] W. Alharbi, S. Alshabhi, D. Freeman, and D. Ghoreishi. Locality and stability for phase retrieval. preprint, 2022.
- [6] Charalambos D. Aliprantis and Owen Burkinshaw. Locally solid Riesz spaces with applications to economics, volume 105 of Mathematical Surveys and Monographs. American Mathematical Society, Providence, RI, second edition, 2003.
- [7] Charalambos D. Aliprantis and Owen Burkinshaw. Positive operators. Springer, Dordrecht, 2006. Reprint of the 1985 original.
- [8] S. Andreys and Ph. Jaming. Zak transform and non-uniqueness in an extension of Pauli’s phase retrieval problem. Anal. Math., 42(3):185–201, 2016.
- [9] S. V. Astashkin. -spaces. J. Funct. Anal., 266(8):5174–5198, 2014.
- [10] A. Avilés and P. Tradacete. Amalgamation and injectivity in Banach lattices. arXiv preprint, 2021.
- [11] Gregory F. Bachelis and Samuel E. Ebenstein. On sets. Pacific J. Math., 54(1):35–38, 1974.
- [12] R. Balan. Stability of phase retrievable frames. SPIE Optical Engineering + Applications, International Society for Optics and Photonics, 2013.
- [13] Radu Balan and Chris B Dock. Lipschitz analysis of phase retrievable matrix frames. arXiv preprint arXiv:2109.14522, 2021.
- [14] Afonso S. Bandeira, Jameson Cahill, Dustin G. Mixon, and Aaron A. Nelson. Saving phase: injectivity and stability for phase retrieval. Appl. Comput. Harmon. Anal., 37(1):106–125, 2014.
- [15] Eugene Bilokopytov. Disjointly non-singular operators on order continuous Banach lattices complement the unbounded norm topology. J. Math. Anal. Appl., 506(1):Paper No. 125556, 2022.
- [16] J. M. Borwein and D. T. Yost. Absolute norms on vector lattices. Proc. Edinburgh Math. Soc. (2), 27(2):215–222, 1984.
- [17] S. Botelho-Andrade, P.G. Casazza, D. Ghoreishi, S. Jose, and J.C. Tremain. Weak phase retrieval. Compressed Sensing and its Applications, pages 221–234, 2017.
- [18] J. Bourgain. Bounded orthogonal systems and the -set problem. Acta Math., 162(3-4):227–245, 1989.
- [19] Jean Bourgain. -sets in analysis: results, problems and related aspects. In Handbook of the geometry of Banach spaces, Vol. I, pages 195–232. North-Holland, Amsterdam, 2001.
- [20] B. M. Braga. On the Hausdorff distance and some openings between Banach spaces as Borel functions. Quaest. Math., 38(3):403–411, 2015.
- [21] J. Cahill, P.G. Casazza, J. Peterson, and L. Woodland. Using projections for phase retrieval. Proc. SPIE 8858, Wavelets and Sparsity XV, 2013.
- [22] Jameson Cahill, Peter G. Casazza, and Ingrid Daubechies. Phase retrieval in infinite-dimensional Hilbert spaces. Trans. Amer. Math. Soc. Ser. B, 3:63–76, 2016.
- [23] Robert Calderbank, Ingrid Daubechies, Daniel Freeman, and Nikki Freeman. Stable phase retrieval for infinite dimensional subspaces of . arXiv preprint arXiv:2203.03135, 2022.
- [24] Emmanuel J. Candès and Xiaodong Li. Solving quadratic equations via PhaseLift when there are about as many equations as unknowns. Found. Comput. Math., 14(5):1017–1026, 2014.
- [25] Emmanuel J. Candès, Thomas Strohmer, and Vladislav Voroninski. PhaseLift: exact and stable signal recovery from magnitude measurements via convex programming. Comm. Pure Appl. Math., 66(8):1241–1274, 2013.
- [26] Peter G Casazza, Dorsa Ghoreishi, Shani Jose, and Janet C Tremain. Norm retrieval and phase retrieval by projections. Axioms, 6(1):6, 2017.
- [27] Michael Christ, Ben Pineau, and Mitchell A Taylor. Examples of Hölder-stable phase retrieval. arXiv preprint arXiv:2205.00187, 2022.
- [28] Feng Dai, A Prymak, A Shadrin, V Temlyakov, and S Tikhonov. Sampling discretization of integral norms. Constr. Approx., 2021.
- [29] Feng Dai and V Temlyakov. Universal sampling discretization. arXiv preprint arXiv:2107.11476, 2021.
- [30] Y. Deng, M. O’Brien, and V. G. Troitsky. Unbounded norm convergence in Banach lattices. Positivity, 21(3):963–974, 2017.
- [31] Joe Diestel, Hans Jarchow, and Andrew Tonge. Absolutely summing operators, volume 43 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1995.
- [32] S. J. Dilworth. Special Banach lattices and their applications. In Handbook of the geometry of Banach spaces, Vol. I, pages 497–532. North-Holland, Amsterdam, 2001.
- [33] Dylan Domel-White and Bernhard G. Bodmann. Phase retrieval by random binary questions: Which complementary subspace is closer? Constructive Approx., 56:1–33, 2022.
- [34] Yonina C. Eldar and Shahar Mendelson. Phase retrieval: stability and recovery guarantees. Appl. Comput. Harmon. Anal., 36(3):473–494, 2014.
- [35] Marián Fabian, Petr Habala, Petr Hájek, Vicente Montesinos, and Václav Zizler. Banach space theory. CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC. Springer, New York, 2011. The basis for linear and nonlinear analysis.
- [36] Daniel Freeman and Dorsa Ghoreishi. Discretizing norms and frame theory. arXiv preprint arXiv:2109.14454, 2022.
- [37] Daniel Freeman and Darrin Speegle. The discretization problem for continuous frames. Adv. Math., 345:784–813, 2019.
- [38] N. Gao, V. G. Troitsky, and F. Xanthos. Uo-convergence and its applications to Cesàro means in Banach lattices. Israel J. Math., 220(2):649–689, 2017.
- [39] Manuel González, Antonio Martínez-Abejón, and Antonio Martinón. Disjointly non-singular operators on Banach lattices. J. Funct. Anal., 280(8):Paper No. 108944, 14, 2021.
- [40] Manuel González and Antonio Martinoón. A quantitative approach to disjointly non-singular operators. arXiv preprint, 2021.
- [41] P. Grohs and L. Liehr. On foundational discretization barriers in STFT phase retrieval. 2021.
- [42] Philipp Grohs, Sarah Koppensteiner, and Martin Rathmair. Phase retrieval: uniqueness and stability. SIAM Rev., 62(2):301–350, 2020.
- [43] Philipp Grohs and Lukas Liehr. Stable Gabor phase retrieval in Gaussian shift-invariant spaces via biorthogonality. arXiv preprint arXiv:2109.02494, 2021.
- [44] Kathryn E. Hare. An elementary proof of a result on sets. Proc. Amer. Math. Soc., 104(3):829–834, 1988.
- [45] Stefan Heinrich. Ultraproducts in Banach space theory. J. Reine Angew. Math., 313:72–104, 1980.
- [46] Kishore Jaganathan, Yonina C. Eldar, and Babak Hassibi. Phase retrieval: an overview of recent developments. In Optical compressive imaging, Ser. Opt. Optoelectron., pages 263–296. CRC Press, Boca Raton, FL, 2017.
- [47] Robert C. James. Uniformly non-square Banach spaces. Ann. of Math. (2), 80:542–550, 1964.
- [48] Philippe Jaming. Phase retrieval techniques for radar ambiguity problems. J. Fourier Anal. Appl., 5(4):309–329, 1999.
- [49] Philippe Jaming and Martin Rathmair. Uniqueness of phase retrieval from three measurements. 2022.
- [50] William B. Johnson and Joram Lindenstrauss. Basic concepts in the geometry of Banach spaces. In Handbook of the geometry of Banach spaces, Vol. I, pages 1–84. North-Holland, Amsterdam, 2001.
- [51] B Kashin, E Kosov, I Limonova, and V Temlyakov. Sampling discretization and related problems. arXiv preprint arXiv:2109.07567, 2021.
- [52] Alexander S. Kechris. Classical descriptive set theory, volume 156 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1995.
- [53] F. Krahmer and D. Stöger. Complex phase retrieval from subgaussian measurements. J. Four. Anal. and App., 26, 2020.
- [54] Felix Krahmer and Yi-Kai Liu. Phase retrieval without small-ball probability assumptions. IEEE Trans. Inform. Theory, 64(1):485–500, 2018.
- [55] Marcel Kreuter. Sobolev spaces of vector-valued functions. Ulm University Faculty of Mathematics and Economies, 2015.
- [56] J.-L. Krivine and B. Maurey. Espaces de Banach stables. Israel J. Math., 39(4):273–295, 1981.
- [57] H. Elton Lacey. The isometric theory of classical Banach spaces. Die Grundlehren der mathematischen Wissenschaften, Band 208. Springer-Verlag, New York-Heidelberg, 1974.
- [58] I Limonova and V Temlyakov. On sampling discretization in . arXiv preprint arXiv:2009.10789, 2021.
- [59] Joram Lindenstrauss and Lior Tzafriri. Classical Banach spaces. I. Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 92. Springer-Verlag, Berlin-New York, 1977. Sequence spaces.
- [60] Joram Lindenstrauss and Lior Tzafriri. Classical Banach spaces. II, volume 97 of Ergebnisse der Mathematik und ihrer Grenzgebiete [Results in Mathematics and Related Areas]. Springer-Verlag, Berlin-New York, 1979. Function spaces.
- [61] Joram Lindenstrauss and Lior Tzafriri. Classical Banach spaces. II, volume 97 of Ergebnisse der Mathematik und ihrer Grenzgebiete [Results in Mathematics and Related Areas]. Springer-Verlag, Berlin-New York, 1979. Function spaces.
- [62] A. W. Marcus, D. A. Spielman, and N. Srivastava. Interlacing Families II: mixed characteristic polynomials and the Kadison-Singer problem. Ann. of Math., 182(1):327–350, 2015.
- [63] James R. Munkres. Topology. Prentice Hall, Inc., Upper Saddle River, NJ, 2000. Second edition of [ MR0464128].
- [64] Shahaf Nitzan, Alexander Olevskii, and Alexander Ulanovskii. Exponential frames on unbounded sets. Proc. Amer. Math. Soc., 144(1):109–118, 2016.
- [65] Wolfgang Pauli. Die allgemeinen prinzipien der wellenmechanik. In Quantentheorie, pages 83–272. Springer, 1933.
- [66] I. M. Popovici and D. T. Vuza. Factoring compact operators and approximable operators. Z. Anal. Anwendungen, 9(3):221–233, 1990.
- [67] Haskell P. Rosenthal. On subspaces of . Ann. of Math. (2), 97:344–373, 1973.
- [68] Walter Rudin. Trigonometric series with gaps. J. Math. Mech., 9:203–227, 1960.
- [69] D. Ryou. A variant of the -set problem in Orlicz spaces. arXiv preprint, 2021.
- [70] Helmut H. Schaefer. Banach lattices and positive operators. Die Grundlehren der mathematischen Wissenschaften, Band 215. Springer-Verlag, New York-Heidelberg, 1974.