Blaschke Decompositions on Weighted Hardy Spaces
Stephen D. Farnham

TL;DR
This paper advances the understanding of Blaschke decompositions on weighted Hardy spaces, providing improved bounds and conditions that explain the exponential convergence observed in nonlinear signal approximation methods.
Contribution
It extends previous work by studying functions in larger Hardy spaces with finitely many roots, improving bounds on weighted norms, and establishing conditions for exponential convergence in signal processing.
Findings
Improved bounds on weighted Hardy norms for Blaschke decompositions.
New insights into convergence rates on classical function spaces.
Conditions on weights ensuring exponential convergence for all Hardy space functions.
Abstract
Recently, several papers have considered a nonlinear analogue of Fourier series in signal analysis, referred to as either nonlinear phase unwinding or adaptive Fourier decomposition. In these processes, a signal is represented as the real component of a complex function , and by performing an iterative method to obtain a sequence of Blaschke decompositions, the signal can be approximated using only a few terms. To better understand the convergence of these methods, the study of Blaschke decompositions on weighted Hardy spaces was studied by Coifman and Steinerberger, under the assumption that the complex valued function has an analytic extension to for some . This provided bounds on weighted Hardy norms involving a function and its Blaschke decomposition. That work also noted that in many examples, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Blaschke Decompositions on Weighted Hardy Spaces
Stephen D. Farnham Syracuse University Department of Mathematics, Syracuse, NY 13244, USA; email: [email protected]
Abstract
Recently, several papers have considered a nonlinear analogue of Fourier series in signal analysis, referred to as either nonlinear phase unwinding or adaptive Fourier decomposition. In these processes, a signal is represented as the real component of a complex function , and by performing an iterative method to obtain a sequence of Blaschke decompositions, the signal can be approximated using only a few terms. To better understand the convergence of these methods, the study of Blaschke decompositions on weighted Hardy spaces was studied by Coifman and Steinerberger, under the assumption that the complex valued function has an analytic extension to for some . This provided bounds on weighted Hardy norms involving a function and its Blaschke decomposition. That work also noted that in many examples, the nonlinear unwinding series of a function converges at an exponential rate to the original signal, which when coupled with an efficient algorithm to perform a Blaschke decomposition, has lead to a new and efficient way to approximate signals.
In this work, we continue the study of Blaschke decompositions on weighted Hardy Spaces for functions in the larger space under the assumption that the function has finitely many roots in . By studying the growth rate of the weights, we improve the bounds provided by Coifman and Steinerberger. This provides us with new insights into Blaschke decompositions on classical function spaces including the Hardy-Sobolev spaces and weighted Bergman spaces. Further, we state a sufficient condition on the weights for our improved bounds to hold for any function in the Hardy space, . These results may help to better explain why the exponential convergence of the unwinding series is seen in many numerical examples.
Keywords: Blaschke Decomposition, Series Expansion, Weighted Hardy Space, Dirichlet Space, Unwinding Series
Mathematics Subject Classification: Primary 30B; Secondary 30J, 30H
1 Introduction
In many fields, the Hardy Space , where , has been studied due to its well behaved nature when compared to the larger Lebesgue space, . One of the most well known results for spaces is the decomposition theorem. Simply put, given a function , we can decompose
[TABLE]
where and for any . In this factorization, the function is a Blaschke product with the same zeros as in , and is a function that is also in the space . In the past decade, this theorem was utilized to create an iterative method to express a function, as a summation involving Blaschke products [5]. These summations are commonly referred to as the “unwinding series” of .
This idea inspired research in both signal processing and complex analysis as seen in [2, 3, 6, 4] and many other works. In 2017, it was pointed out in [2] that weighted Hardy spaces are a well suited environment to study the effect of Blaschke decompositions, and in particular can be used to show the convergence of the unwinding series. Given arbitrary, monotone increasing weights, several results were provided for functions that are analytic in for some .
Using the same notion of weighted Hardy spaces, this paper seeks to enhance the main results of [2] in two ways. Firstly, by controlling the growth rate of the weights, we create tighter bounds on the inequalities seen in [2], for functions in with a finite number of roots in . From a practical standpoint, this tells us how Blaschke decompositions affect a majority of functions in many well known spaces, including Hardy-Sobolev spaces and weighted Bergman spaces. Second, we show that for certain bounded weights, we can extend our inequalities to functions that are simply in , regardless of the cardinality of the functions’ roots in .
1.1 Acknowledgement
The results of this work are part of the Ph.D. dissertation of the author. I would like to thank my advisors, Dr. Loredana Lanzani and Dr. Lixin Shen, for all of their support through the writing of this paper and my thesis.
1.2 Main Results
We begin by recalling the definition of weighted spaces, denoted and found in [2].
Definition 1**.**
Let be a monotone increasing sequence of real numbers that satisfies . Given a function , we say that belongs to the space if
[TABLE]
Moreover, we define the space to be the set of functions that satisfy
[TABLE]
These weighted spaces allow us to prove results on many classical spaces in a generalized way. For example, if we choose a sequence , bounded above by some constant , such that where , then the space will be equivalent to the space of functions satisfying , as
[TABLE]
Similarly, if we choose the sequence , then the space will be equivalent to the smaller Dirichlet space, which is the space of functions in with derivatives that are also in .
As was pointed out in [2], the and spaces allow for a better understanding of the Blaschke decomposition compared to the unweighted space. To see this, if we are given a function with a Blaschke decomposition, , then we have the equality
[TABLE]
Coifman and Steinerberger demonstrated that any function, , that is analytic in and has a root at , we have the inequality
[TABLE]
Moreover, from the proof of this inequality, the authors of [2] were able to provide an enhanced version of (4) for the special case . The result is stated as Corollary 2 in [2], and tells us that for functions , the Dirichlet space, with roots111The statement of the Corollary does not seem to preclude infinitely many roots as long as , labeled , we have the identity
[TABLE]
In this paper, we improve upon the two aforementioned results by studying two different types of sequences, : ones that increase at an increasing rate, and ones that increase at a decreasing rate. These two types of sequences are of theoretical and practical importance, and by specifying the rate of increase, we are able to create tighter bounds on the norm of to obtain inequalities similar to (5) for more generalized spaces. Further, by imposing additional conditions on the growth rate of the sequence , we are able to remove the assumption that the function has a finite number of roots in , and obtain a converging infinite series on the right hand side of (5).
The first result of this paper, Theorem 2 below, investigates the case where the sequence is increasing at an increasing rate. In other words, by defining
[TABLE]
for any , we require to be a monotone increasing sequence. Equivalently stated, we require
[TABLE]
This condition provides us with several classical function spaces. As was previously mentioned, if , then the space is equivalent to the Dirichlet space, denoted , and is . Moreover, if , then is equivalent to the Hardy-Sobolev space, denoted , and is equivalent to .
We point out that functions in these types of weighted Hardy spaces may have a finite or an infinite number of roots in . In the latter case, a sufficient condition was given by Shapiro and Shields in [10] for an infinite set of points, , to be the zero set of a function in weighted Hardy spaces. Essentially, given , the growth rate of dictates the minimal convergence rate of points to for those points to be a zero set of a function in the space. Due to this dependence, we limit our first theorem to functions with a finite number of roots in and leave the convergence in the case when has an infinite number of roots as an open question. This gives us the following result.
Theorem 2**.**
Suppose that is a monotone increasing satisfying and (6). For functions with a finite number of zeros inside the unit disc labeled , we have
[TABLE]
From this Theorem, we arrive at the following two Corollaries which encompass the well known Dirichlet and Hardy-Sobolev spaces, defined in the next section.
To begin, as an immediate application of Theorem 2, we obtain an alternate proof of (5).
Corollary 3**.**
Suppose that is monotone increasing such that for any , for some constant . For functions with a finite number of zeros inside the unit disc labeled , we have the identity
[TABLE]
Our second Corollary provides a new inequality on the Hardy-Sobolev norm of the function involving both the Dirichlet and Hardy norms of . In this Corollary, we provide the bound for the space , but note that the same techniques can be used to create bounds on the spaces , where .
Corollary 4**.**
Let have Blaschke decomposition . Suppose has a finite number of roots in labeled . Then
[TABLE]
From here, we investigate the case when is increasing at a decreasing rate. That is, for any , we require to be monotone decreasing. In other words,
[TABLE]
As an example, we may consider
[TABLE]
for some . If , then the space will be equivalent to the space of functions that have Fourier coefficients that satisfy
[TABLE]
and if , then will be equivalent to . In either case, will be a -weighted Bergman space, a topic of interest in [8].
We begin our study of spaces , where satisfies (9) with a result regarding functions with a finite number of roots in .
Theorem 5**.**
Suppose that is a monotone increasing sequence satisfying (9). For functions with a finite number of zeros inside labeled , we have
[TABLE]
Similar to our first Theorem, this result connects the norm of and by using all of the roots of in . However, we no longer have an expression involving on the right hand side of the inequality. Our next goal is to extend this result to functions with an infinite number of roots in . To prove such a result, we add two additional conditions to the sequence : boundedness and the convergence rate of the sequence to its limit. This gives us the following result.
Theorem 6**.**
Suppose that is a bounded monotone increasing sequence satisfying (9) and . For any function with zeros inside the unit disc labeled in increasing order of magnitude, for , we have
[TABLE]
and
[TABLE]
Within the proofs of Theorem 2, Theorem 5, and Theorem 6, we also obtain an identity (seen later as (34)) that can be used to show how a Blaschke decomposition redistributes the magnitude of the Fourier coefficients of a function . Simply put, if has roots in labeled , where
[TABLE]
then for any , a result by Qian in [7] states
[TABLE]
In our work, by selecting the sequence
[TABLE]
and applying (34) with the appropriate substitutions, we obtain the following identity, an improvement of the inequality (12).
[TABLE]
The remainder of this paper is organized as follows:
In section 2, technical definitions and a review of the literature are provided.
In section 3, we prove the main results.
2 Background and Definitions
In this section, we briefly summarize existing works on the topic, and provide definitions and notations that will be used throughout the paper.
2.1 Definitions and Notation
We begin this section with the definition of the Hardy space on the complex unit disc, , which will also be denoted for simplicity.
The space for is the collection of analytic functions on the open unit disk that satisfy
[TABLE]
Of significant importance is the Hardy space . In this space, one can determine the norm of a function using only its Fourier coefficients. That is, given , if for all we express
[TABLE]
then
[TABLE]
The proof of this result can be found in [11].
Next, we define some previously mentioned Hilbert spaces, which are examples of weighted Hardy spaces.
The Dirichlet Space, denoted , is the space of functions who’s derivatives are also in . Functions in also satisfy the identity
[TABLE]
The Hardy-Sobolev Spaces, denoted , are the spaces of functions with weak derivatives in . These functions have associated norms that satisfy the identity
[TABLE]
As mentioned in the previous section, the Decomposition Theorem states that a function can be decomposed into the product of two functions
[TABLE]
The second function, , will be in the space , have no zeros in , and will satisfy . We may further impose the requirement that is real valued and nonnegative, but for this paper, we make no such requirement as it will not affect any of our normed spaces.
The first function, , will be unimodular, that is a.e. on , and will have the same zeros as inside . Moreover, it will be a Blaschke product.
A function is a Blaschke product if it is of the form
[TABLE]
where is finite, , where can be finite or infinity, and for any . If , we require an addition constraint on the zero set called the Blaschke condition. That is, if is an infinite set, then
[TABLE]
Simply put, the Blaschke condition states that the set of zeros of an function must accumulate to in a controlled way.
With these definitions and results, we now briefly review the existing literature.
2.2 Nonlinear Phase Unwinding
In the PhD thesis of Nahon [5], the concept of performing an unwinding series was first introduced. The idea is that given a periodic, real valued signal, , we can use the Hilbert transform to create a function whose real part agrees with the signal on . That is,
[TABLE]
where is the Hilbert transform of . From here, the unwinding series can be produced in the following way.
We begin with the decomposition
[TABLE]
Since , by adding and subtracting the term , we can introduce a root at the origin for the function . This implies that we can decompose
[TABLE]
Similarly, for any , we can iteratively define
[TABLE]
With all of this, through adding and subtracting the terms , for , we can expand into its partial unwinding series
[TABLE]
With this series, numerical experiments were performed and early results showed that the partial unwinding series of a function converged at an exponential rate to . This provided a method of approximating the original signal, , using the real part of the partial unwinding series.
Several years later, Coifman and Steinerberger further investigated the unwinding series of functions in the two articles [2, 3].
In the first paper, the definitions of the weighted Hardy spaces, and , were introduced and the results mentioned in the previous section were proven. This was the main inspiration of this work.
In the second paper, the unwinding series was studied for functions with small (in the sense) antiholomorphic components and an elementary result about the equivalence of the Fourier series and unwinding series for a certain class of functions was shown.
Since then, Coifman and Peyriere have shown the convergence of the unwinding series for any function with in [1] . While the convergence has been shown, the arguments are based on invariant spaces and do not tell us about the rate of convergence of the unwinding series.
2.3 Adaptive Fourier Decomposition
While nonlinear phase unwinding was being studied, Qian et al. have also worked on the related topic of Adaptive Fourier Decomposition (AFD). The main distinction between these two procedures is that at each step of AFD, instead of adding and subtracting the term (as was done in the unwinding series), an algorithm seeks the ”optimal” point that will provide the best finite approximation if we add and subtract . The existence of the optimal points , for each step , has been shown in [6], however there are no closed formulas for the explicit computation of such points (See [4] for related results.). Therefore, there is a computational cost in approximating the optimal points that is avoided in the unwinding series. We are not aware of results that compare the convergence rate of the AFD algorithm with the convergence rate of the unwinding series.
3 Proof of Main Results
In this section, we develop the theory necessary to prove Theorems 2, 5, and 6. This section will be broken into three parts for clarity.
In the first part, see Section 3.1, we expand upon the relationship between the functions and in the decomposition theorem to see that reflecting the roots of across provides a method of producing . With this knowledge, we study how the act of reflecting a root in across the unit circle affects the norm of a function, seen in Proposition 9. To end this part, we state Corollary 10 which provides an identity for the case when has a single root in .
In the second part, see Section 3.2, we investigate the case when has finitely many roots in . We begin by defining intermediate functions (seen in Definition 11) that can be viewed as partial decompositions. Using these functions, we invoke Proposition 9 to obtain an identity seen in Lemma 12, which connects the norms of and . From there, we state and prove Lemma 13, which provides bounds on the norm of functions based on the growth rate of the sequence . With this, we have the tools necessary to handle all functions with a finite number of zeros in , and prove Theorem 2, Theorem 5, Corollary 3, and Corollary 4.
In the final part, see Section 3.3, we prove the convergence of the inequality in Theorem 5 for functions with infinitely many roots in at the cost of imposing further conditions on (see Lemma 14 and Lemma 15). From there, we directly prove Theorem 6.
3.1 Part 1: Reflecting a Root Across
To begin, suppose that a function has a finite number of roots in labeled in increasing order of magnitudes , where the roots need not be distinct. Then for , we can express
[TABLE]
One way of generating the function from is by replacing each term in the Blaschke product with the term . This can be viewed as the reflection of each zero of across the complex unit circle. When all zeros are reflected, we will have removable singularities, all outside , so we will have a function equivalent to on .
In the case where has infinitely many roots in , we can apply the same technique, and rely on several Hardy Space results to show that this process will provide a sequence of functions that converge to uniformly on compact subsets of . This will be further discussed in the third part of this section.
With this knowledge, we want to investigate how the act of reflecting a single root across the unit circle changes the norm of a function. To understand how a single reflection works, we first define the following operator.
Definition 7**.**
Suppose that has a root at , that is, and for all , we can express . We define be the operator that acts on functions in with roots at and satisfies
[TABLE]
This definition tells us that the operator only affects a single root of a function. In the case where a function has a root at of higher multiplicity, this operator will reduce the multiplicity of the root by one. With this definition, we have the following result on the norm of .
Lemma 8**.**
If satisfies where , then . Further, we have the inequality
[TABLE]
Proof.
By definition, we know that
[TABLE]
Since is a root of , we know that has a removable singularity at , so because can be treated as an analytic function in ,
[TABLE]
Since , we know that if , for any ,
[TABLE]
Therefore,
[TABLE]
Dividing each side by and taking square roots gives us the result. ∎
With this lemma proved, we know that the function can be represented with a power series whose coefficients are in . This allows us to properly study how the operator, , affects the norm of functions and leads us to the following proposition, which is a generalization of a result in [2].
Proposition 9**.**
Let satisfy for some , so that for all , . With defined in (22), we have the following results:
* and * 2. 2.
**
Proof.
Given , we know that , so it follows from Lemma 8 that . Therefore, we know that for all we may represent
[TABLE]
With this notation, we know that
[TABLE]
so we can express
[TABLE]
and
[TABLE]
With these expressions, we can compute the norm of each function, and obtain
[TABLE]
From here, if we can show that , then this will imply that . Towards this end, we consider the following finite difference:
[TABLE]
For each , we know that
[TABLE]
because . Therefore,
[TABLE]
Thus, by passing limits into the summation, we have
[TABLE]
Since is an increasing sequence and we know that for ,
[TABLE]
Since , we know , which implies that , so
[TABLE]
By definition,
[TABLE]
so we have the identity
[TABLE]
Since this immediately tells us that , and that , which proves (1).
Lastly, by rearranging the terms, we have
[TABLE]
which completes the proof.
∎
This result shows us that the reflection of a single root about the complex unit circle will alter the norm of a function in a predictable way, and will always decrease the norm. We end this subsection with a Corollary involving functions with a single root in .
Corollary 10**.**
Let be a monotone increasing sequence with . If has a single root, , in , then
[TABLE]
Proof.
We begin by noting that for all ,
[TABLE]
Therefore, we know that , and . Therefore, by applying Proposition 9, we have the result. ∎
With this result proved, we have completed this part of the section, and move on to functions with finitely many roots in .
3.2 Part 2: Performing a Finite Number of Reflections
In the previous section we identified the relationship between and , and studied how the norm is affected by reflecting a single root across with Proposition 9. Unfortunately, for functions with multiple zeros in , a single reflection will not produce the function . Further, after we have performed a reflection, if we reflect a second root, we will be acting upon a new function. Therefore, to utilize the full potential of Proposition 9, we require the following definition.
Definition 11**.**
Let have roots in , enumerated , in increasing order of magnitude. Then expressing
[TABLE]
where has no zeros in , we define
[TABLE]
With this definition and using the same notation as Definition 7 , we notice that for each
[TABLE]
With all of this, we can prove a simple, yet useful lemma.
Lemma 12**.**
Suppose that has roots in , labeled in increasing order of magnitude . Then for any , we have the identity
[TABLE]
Proof.
We begin by observing that for , we have . Then by applying Proposition 9 to , for we have the identity
[TABLE]
Now, by applying Equation (29) to each , we have
[TABLE]
∎
As a direct consequence of this Lemma, we now have an identity for any function with many roots in :
[TABLE]
With this identity established, we now look to restrict our choices of to create a bound on the terms involving the functions and .
We begin by noticing that the semi-norm will carry the same properties as the norm if the sequence
[TABLE]
is monotone increasing. In other words, we can treat as . This means that any inequalities that can be applied to the norm can be applied to the norm. Namely, for any function , we can apply the results of Proposition 9 to see
[TABLE]
If the bounded sequence is monotone decreasing, then will be monotone increasing and nonnegative. This tells us that
[TABLE]
By the structure of the norm space, and the fact that , we directly obtain the inequality
[TABLE]
These inequalities help us to prove the following lemma.
Lemma 13**.**
Let be a monotone increasing sequence satisfying , and let have roots in labeled in increasing order of magnitude, where can be finite or infinity.
If satisfies (6), then for any ,
[TABLE] 2. 2.
If satisfies (9), then for any ,
[TABLE]
Proof.
To begin, let
[TABLE]
We know that for any , we can express
[TABLE]
Similarly, by rearranging, we know that
[TABLE]
Thus, by reflecting the first roots of across the unit circle, we get . By reflecting the remaining roots, we get .
If is monotone increasing, then by (35), we know that
[TABLE]
Clearly, if is finite the result holds. If , by the monotonicity of the sequence of norms, we know that this implies that
[TABLE]
which proves the first part of the inequality.
Proving the second inequality follows verbatim with all inequalities flipped, due to (36). This gives the result. ∎
With this lemma, we can see that by restricting to be a sequence that is either increasing at a non-increasing or non-decreasing rate, we can replace the intermediary terms in Equation (34). With all of this, we are now able to prove Theorem 2 and Theorem 5.
3.2.1 Proofs of Theorem 2, Corollary 3, Corollary 4, and Theorem 5,
With the previous results, we now prove Theorem 2, Theorem 5, and Corollary 2.
We begin with the proof of Theorem 2 . As a reminder, the hypotheses of this theorem are that the function has a finite number of roots in and the sequence is monotone increasing. We have to show that Equations (7) and (8) hold true.
Proof.
Since has a finite number of roots in , by Lemma 12 we have the identity
[TABLE]
If is a monotone increasing sequence, then by Lemma 13 we know that for all ,
[TABLE]
Therefore, by replacing each with , we preserve the inequality and have the result.
∎
From here, we prove Corollary 3.
Proof.
Let . Then we know that both (6) and (9) hold true. Therefore, by Lemma 13, for all
[TABLE]
Therefore, by replacing each term in (34), we have the result. ∎
With this proved, we now prove Corollary 4.
Proof.
By definition, we know that given , we can represent
[TABLE]
Letting , this gives us the identity
[TABLE]
Since , we have the identity
[TABLE]
Therefore, by invoking Theorem 1 on , we have
[TABLE]
Finally, by the fact that , and (37), we have the result. ∎
In studying the proof of this Corollary, we can see that similar techniques can also be used to create bounds for the spaces where . By expanding the terms , and applying the same techniques, we can obtain similar results.
We now move on to Theorem 5. The hypotheses of this theorem are similar to the previous theorem, with the exception that the sequence is monotone decreasing. With these conditions, we show that Equation (10) holds.
Proof.
Since has a finite number of roots in , by Lemma 12 we have the identity
[TABLE]
If is a monotone decreasing sequence, then by Lemma 13 we know that for all ,
[TABLE]
Therefore, by replacing each with , we preserve the inequality and have the result. ∎
With all results proved in the case when the function has finite number of roots in , we now consider the case when has an infinite number of roots in .
3.3 Part 3: Functions with Infinitely Many Roots in
Similar to the previous section, this section will study the relationship between the norm of and , with the exception that will now be assumed to have infinitely many zeros in . In this case, we rely on some well known literature about the convergence of the partial decompositions.
We know that has Blaschke decomposition , where is an infinite Blaschke Product, and . Therefore, if we enumerate the roots of as and ignore the rotation term for , we can express
[TABLE]
Similarly to what was done in the last section, we want to investigate the relationship between the norms of and . As a fact that is proven in [9] , if we define as the partial decomposition of defined in Definition 11, we know that uniformly on compact subsets of . Further, by Proposition 12, we know that for any finite , we have the identity
[TABLE]
Therefore, by showing that
[TABLE]
we will have a meaningful analogue to Equation (34) for functions with infinitely many zeros in , and can prove Theorem 6.
We begin by proving a sufficient condition on to ensure Equation (41) holds.
Lemma 14**.**
Suppose that Then
[TABLE]
Proof.
Since
[TABLE]
uniformly on compact subsets of , we know that for any fixed ,
[TABLE]
Therefore,
[TABLE]
so
[TABLE]
By our assumption, is bounded above by , so we know
[TABLE]
Therefore, the result holds. ∎
With this condition, we now have to restrict our choice of to bounded sequences. Clearly no bounded sequence can increase at an increasing rate, so for the remainder of this section we assume that (9) holds.
From here, we need to find a condition on so that (42) is true on the space . We know from Lemma 13 and from our restriction on that for any finite ,
[TABLE]
Therefore, if we can find a condition on such that
[TABLE]
we will also satisfy (42). The following lemma provides such a condition.
Lemma 15**.**
Let be a monotone increasing sequence where is monotone decreasing. If
[TABLE]
then, for every function with infinitely many roots labeled in increasing order of magnitude , with Blaschke decomposition , we have
[TABLE]
Proof.
We break this proof into two cases, and . In both cases we will provide a bound that is independent of the choice of , giving us the result.
To begin, let be a root of with . We know by the decomposition theorem that
[TABLE]
since
[TABLE]
If , we know by Lemma 8 that
[TABLE]
Since this bound is independent of , we are finished with this case.
If , then we can rewrite
[TABLE]
We know by our bound on that
[TABLE]
Therefore, if we bound the term
[TABLE]
we will have completed the proof.
For simplicity, we will denote where . We know that , so we may express , for all . Since , we know that for all , we can rewrite
[TABLE]
By Cauchy’s formula for derivatives, we know that for each ,
[TABLE]
By the generalized Leibniz rule, we know that for any ,
[TABLE]
Since , and
[TABLE]
we know
[TABLE]
Therefore, for each ,
[TABLE]
From here, we consider the norm of .
[TABLE]
By the Cauchy-Schwarz inequality we know
[TABLE]
Therefore
[TABLE]
Clearly, . By finite geometric series and the bound , we know
[TABLE]
Lastly, since satisfies
[TABLE]
we know that
[TABLE]
Therefore, we have
[TABLE]
With this, we have found a bound for that is independent of , so the result is proven.
Therefore we have shown
[TABLE]
∎
With this lemma, we now have a sufficient condition to show (42). An interesting observation about this lemma is the fact that it imposes a similar condition to the Blaschke condition on the sequence . That is, both
[TABLE]
must hold true for our results.
With all of this, we can now prove Theorem 6.
3.3.1 Proof of Theorem 6.
Proof.
We know by hypothesis that , and the roots , for satisfy the Blaschke condition, (20). By Proposition 12, we know that for any finite , we have the identity
[TABLE]
By Lemma 13 and by Lemma 15, we know that
[TABLE]
Further, we know that since all ,
[TABLE]
With this, we have
[TABLE]
Since the right hand summation converges, we know
[TABLE]
Since is bounded, by Lemma 14, we may pass the limit through the left hand side and have the inequality
[TABLE]
which proves the result.
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Coifman, J. Peyriere , Phase Unwinding, or Invariant Subspace Decompositions of Hardy Spaces , J. Fourier Anal. Appl, 25 (3), pp. 684–695 (2019)
- 2[2] R. Coifman, S. Steinerberger , Nonlinear Phase Unwinding of Functions , J. Fourier Anal. Appl, 23, pp. 778–809 (2017)
- 3[3] R. Coifman, S. Steinerberger, H. Wu , Carrier Frequencies, Holomorphy, and Unwinding , SIAM Journal on Mathematical Analysis 49 (6), pp. 4838–4864 (2018)
- 4[4] Y. Gao, M. Ku, T. Qian, J. Wang , FFT formulations of adaptive Fourier decomposition , Journal of Computational and Applied Mathematics. 324 , pp. 204–215 (2017)
- 5[5] M. Nahon , Phase Evaluation and Segmentation , Ph.D. Thesis,Yale University (2000)
- 6[6] T. Qian , Intrinsic Mono-component Decomposition of Functions: an advance of Fourier theory , Math. Methods Appl. Sci. 33 (7), pp. 880–891 (2010)
- 7[7] T. Qian . Adaptive Fourier decomposition, rational approximation, part 1: theory, International Journal of Wavelets, Multiresolution and Information Processing, 12 (05) (2014)
- 8[8] W. Qu, P. Dang , Rational Approximation in a Class of Weighted Hardy Spaces Complex Analysis and Operator Theory Volume 13, Issue 4, pp. 1827–1852 (2019)
