Explicit power laws in analytic continuation problems via reproducing kernel Hilbert spaces
Yury Grabovsky, Narek Hovsepyan

TL;DR
This paper investigates the ill-posed nature of analytic continuation problems, demonstrating that solutions exhibit power law precision decay, and introduces a Hilbert space-based method to determine these decay exponents explicitly.
Contribution
The paper develops a Hilbert space framework to explicitly compute power law exponents in analytic continuation, including solutions in special geometries like the annulus and upper half-plane.
Findings
Power law decay of solution accuracy away from data source
Explicit formulas for exponents in circular geometries
Method aligns with prior results in special cases
Abstract
The need for analytic continuation arises frequently in the context of inverse problems. Notwithstanding the uniqueness theorems, such problems are notoriously ill-posed without additional regularizing constraints. We consider several analytic continuation problems with typical global boundedness constraints that restore well-posedness. We show that all such problems exhibit a power law precision deterioration as one moves away from the source of data. In this paper we demonstrate the effectiveness of our general Hilbert space-based approach for determining these exponents. The method identifies the "worst case" function as a solution of a linear integral equation of Fredholm type. In special geometries, such as the circular annulus or upper half-plane this equation can be solved explicitly. The obtained solution in the annulus is then used to determine the exact power law exponent for…
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.
Explicit power laws in analytic continuation problems via reproducing kernel Hilbert spaces.
Yury Grabovsky
Narek Hovsepyan
Abstract
The need for analytic continuation arises frequently in the context of inverse problems. Notwithstanding the uniqueness theorems, such problems are notoriously ill-posed without additional regularizing constraints. We consider several analytic continuation problems with typical global boundedness constraints that restore well-posedness. We show that all such problems exhibit a power law precision deterioration as one moves away from the source of data. In this paper we demonstrate the effectiveness of our general Hilbert space-based approach for determining these exponents. The method identifies the “worst case” function as a solution of a linear integral equation of Fredholm type. In special geometries, such as the circular annulus or upper half-plane this equation can be solved explicitly. The obtained solution in the annulus is then used to determine the exact power law exponent for the analytic continuation from an interval between the foci of an ellipse to an arbitrary point inside the ellipse. Our formulas are consistent with results obtained in prior work in those special cases when such exponents have been determined.
1 Introduction
Many inverse problems reduce to analytic continuation questions when solutions of direct problems are known to possess analyticity in a domain in the complex plane but can be measured only on a subset (often a part of the boundary) of this domain. For example, if one wants to recover a signal corrupted by a low-pass convolution filter, then one needs to recover an entire function from its measured values on an interval [11, 2]. Another large class of inverse problems can be termed “Dehomogenization” [7, 26], where one wants to reconstruct some details of microgeometry from measurements of effective properties of the composite. The idea of reconstruction is based on the analytic properties of effective moduli [3, 24, 17] of composites. See e.g. [25] for an extensive bibliography in this area.
The method of recovery via analytic continuation is a tempting proposition in view of the uniqueness properties of analytic functions. Unfortunately, analyticity is a local property “stored” at an infinite depth within the continuum of function values and can be represented by delicate cancellation properties responsible for the validity of Carleman and Carleman type extrapolation formulas [6, 18, 1]. Adding small errors to the exact values of analytic functions destroys these local properties. Instead we want to accumulate the remnants of analyticity and use global properties of analytic functions to achieve analytic continuation. This is only possible under some additional regularizing constraints, such as global boundedness [12, 5, 33, 16, 35]. Taking this idea to the extreme, any bounded entire function is a constant by Liouville’s theorem, so that the effect of boundedness depends strongly on the geometry of the domain of analyticity.
In order to quantify the degree to which analytic continuation is possible, consider an analytic function in a domain . Assume that is measured on a curve with a relative error , with respect to some norm . Can one perform an analytic continuation of from to in the presence of measurement errors? Without discussing specific analytic continuation algorithms we would like to examine theoretical feasibility of such a procedure. For example, if two different algorithms are deployed matching on with relative precision how far their outputs could possibly differ at a given point ? To answer this question we consider the difference of the two purported analytic continuations. Such a difference will be small on , and we want to quantify how large such a function can possibly be at some point relative to its global size on .
Based on established upper and lower bounds, exact and numerical results [9, 5, 8, 23, 30, 14, 36, 15, 10, 35] a general power law principle emerges, whereby the relative precision of analytic continuation decays as power law , where the exponent decreases to 0, as we move further away from the source of data. How fast decays depends strongly on the geometry of the domain and the data source [35, 20]. In [20] we considered an example, where is the complex upper half-plane and is the interval on the real axis. We have proved that for in the upper half-plane is the angular size of the interval as viewed from , measured in units of . Conformal mappings can also be used to relate the exponents for one geometry to the exponents for the conformally equivalent ones. We believe that such power law transition from well-posedness to practical ill-posedness is a general property of analytic continuation, quantifying the tug-of-war between their rigidity (unique continuation property) and flexibility (as in the Riesz density theorem [29]).
The lower bounds on can be obtained by exhibiting bounded analytic functions that are small on a curve , but not quite as small at a particular extrapolation point. The upper bounds are harder to prove but there is ample literature where such results are achieved [9, 5, 8, 23, 30, 14, 36, 15, 10, 35]. In fact, it was observed in [35] that upper and lower bounds of the form on the extrapolation error do hold for all geometries. However, with few exceptions the upper and lower bounds do not match. In those examples where they do match [10, 35] the optimality of the bounds are concluded a posteriori.
In our recent work [20] we have developed a new method for characterizing analytic functions in the upper half-plane attaining the optimal upper bound in terms of a solution of an integral equation of the second kind with compact, positive, self-adjoint operator on . In Section 3.1, we extend this result to reproducing kernel Hilbert spaces of analytic functions in a domain . The error maximization problem is reformulated as a maximization of a linear objective functional subject to quadratic constraints, permitting us to use convex duality methods. The optimality conditions take the form of a linear integral equation of Fredholm type, where the positive, compact self-adjoint operator is expressed in terms of the reproducing kernel of . The integral operator occurs frequently in the context of reproducing kernel Hilbert spaces (e.g. [9]) and is related to the restriction operator . Namely, . The exponent in the power law asymptotics can then be expressed in terms of the rates of exponential decay of eigenvalues of the integral operator and its eigenfunctions at the extrapolation point . For certain classes of restriction operators the exponential decay of the eigenvalues of has been known for a long time, and their exact asymptotics has been established in [28] (see also [37, 27, 21, 31]). Alternatively, the exponent can be read off the explicit solution of the integral equation in cases where such an explicit solution is available [20]. This allows us to compute explicitly in a number of special cases. For example, when is a circle in the upper half-plane (Section 2.2) or a circle in an annulus (Section 2.1).
In Section 4.3 we present a somewhat unexpected application of the annulus result to the problem of analytic continuation in a Bernstein ellipse [4], studied in [10]. Since the annulus is not conformally equivalent to the ellipse one would not expect a direct relation. The trick we use, inspired by [10], is to map the Bernstein ellipse cut along onto the annulus using the inverse of the Joukowski function. Then, functions analytic in the ellipse are distinguished from functions analytic in the cut ellipse by their continuity across the cut. After the conformal transformation the image of functions analytic in the entire ellipse would consist of functions analytic in the annulus with a reflection symmetry on the unit circle. Our Hilbert space-based approach can easily incorporate linear constraints by making an appropriate choice of the underlying Hilbert space. However, the question is about the relation between the problems with and without such constraints. In the case of the Bernstein ellipse and the annulus, we discover that the subspace of functions analytic in the annulus corresponding to functions analytic in the Bernstein ellipse is invariant with respect to the integral operator . It is this invariance that permits us to solve the problem with additional linear constraints using the known solution of the original problem. This is discussed in Section 3.4. When the extrapolation point lies on the real line inside the Bernstein ellipse we recover the optimal exponent obtained in [10]. However, our approach also gives the formula for the exponent for arbitrary points inside the ellipse.
2 Main Results
Notation: We will write , if there exists a constant such that and likewise the notation will be used. If both and are satisfied, then we will write . Throughout the paper all the implicit constants will be independent of the parameter .
2.1 The annulus
For , let
[TABLE]
Consider the Hardy space (e.g. [13])
[TABLE]
where for a curve the space denotes the space of square-integrable functions on with respect to the arc length measure on .
Theorem** 2.1**** (Annulus).**
Let with fixed and . Then there exists , such that for any and any with and , we have
[TABLE]
where
[TABLE]
Moreover, (2.3) is asymptotically optimal in and the function attaining the bound is
[TABLE]
In addition is analytic in the closure of and is bounded uniformly in .
Remark 2.2**.**
The statement that attains the bound in (2.3) means that , and , with all implicit constants independent of .
It is somewhat surprising that the worst case function, which was required to be analytic only in is in fact analytic in a larger annulus , where is the point symmetric to w.r.t the circle and is the point symmetric to w.r.t the circle . In particular, . Hence, also maximizes , asymptotically, as , if the constraints were given in and , instead of and , respectively.
Remark 2.3**.**
The limiting case as corresponds to the analytic continuation from the circle into the unit disk . The limiting value of the exponent is for , and , for . The numerical stability of extrapolation inside can be seen directly from Cauchy’s integral formula. The same formula for has been obtained in [35] for .
2.2 The upper half-plane
Let denote the complex upper half-plane and consider the Hardy space
[TABLE]
It is well known [22] that these functions have -boundary data, and that defines a norm in . Assume that the data curve is a circle. By considering affine automorphisms , , of we may “translate” to be centered at .
Theorem** 2.4****.**
Let be a circle centered at of radius . Let be a point outside of . Then there exists , such that for any and any with and , we have
[TABLE]
where
[TABLE]
and
[TABLE]
is the Möbius map transforming the upper half-plane into the unit disc and the circle into a concentric circle, whose radius has to be . Moreover, (2.6) is asymptotically optimal in and the function attaining the bound can be written as a convergent in the upper half-plane “power” series
[TABLE]
Remark 2.5**.**
When is inside we have complete stability, indeed Cauchy’s integral formula implies that
[TABLE]
for a constant independent on .
2.3 The Bernstein ellipse
Let be the open ellipse with foci at and the sum of semi-minor and semi-major axes equal to . The axes lengths of such an ellipse are therefore . is called the Bernstein ellipse [4, 34]. Its boundary is an image of a circle of radius centered at the origin under the Joukowski map . Let be the space of bounded analytic functions in , with the usual supremum norm.
Theorem** 2.6****.**
Let . Then there exists , such that for every and with and , we have
[TABLE]
where
[TABLE]
Moreover, (2.9) is asymptotically optimal in and function attaining the bound is
[TABLE]
where is the Chebyshev polynomial of degree : for .
Several remarks are now in order.
- (i)
is the branch of an inverse of the Joukowski map , that is analytic in the slit ellipse and satisfies the inequalities . 2. (ii)
Chebyshev polynomials play the same role in the ellipse as monomials play in the annulus, i.e. they are the building blocks of analytic functions. In fact . 3. (iii)
The same bound (2.9) was obtained in [10] when , where it was shown that the bound (up to logarithmic factors) could be attained by a polynomial
[TABLE]
We observe that the terms in (2.11) increase exponentially fast from to and then decrease exponentially fast for . Hence, asymptotically (up to logarithmic factors) we can say that
[TABLE]
in agreement with (2.12).
3 Quantifying stability of analytic continuation
3.1 Reproducing kernel Hilbert spaces
Our goal is to characterize how large a function analytic in a domain can be at a point , provided that it is small on a curve , relative to its global size in . If some norms and are used to measure the magnitude of on and on , respectively, then we are looking at the problem
[TABLE]
Assume that the global norm is induced by an inner product and that the point evaluation functional is continuous (for any point ), then by the Riesz representation theorem, there exists an element such that . Now inner products with the function reproduce values of a function in . In this case is called a a reproducing kernel Hilbert space (RKHS) with kernel . Examples of such spaces include the Hardy spaces over unit disk, annulus or upper half-plane. From now on we will drop the subscript for the Hilbert space norm in .
Lemma** 3.1****.**
Suppose that is a RKHS whose elements are continuous functions on a metric space . Then the function is bounded on compact subsets of .
Proof.
Assume the contrary. Suppose is compact, but there exists a sequence , such that as . Since is compact we can extract a convergent subsequence (without relabeling it) , then for any we have , by continuity of . Thus, in , but this implies boundedness of , leading to a contradiction. ∎
Corollary 3.2**.**
Under the assumption of Lemma 3.1 the function is bounded on compact subsets of , since .
Assume that the smallness on is measured in -norm (where is the arc length measure). Then, there is a constant such that
[TABLE]
Indeed, for all we have . Since lies in a compact subset of and has finite length we conclude by Lemma 3.1 that (3.2) holds.
In order to analyze problem (3.1) we consider a Hermitian symmetric form
[TABLE]
By (3.2) is continuous, and thus there exists a positive, self-adjoint and bounded operator with . Moreover we can write an explicit formula for in terms of the kernel :
[TABLE]
Thus, for every
[TABLE]
This formula permits to define a new operator . However, in doing so we may lose injectivity, which underlies uniqueness of analytic continuation111It is this property that forces us to restrict attention to reproducing kernel Hilbert spaces of analytic functions.. Therefore, we restrict the domain of to a closed subspace of
[TABLE]
In fact, in many cases . The density in the context of Hardy spaces is known as the Riesz theorem (see e.g. [29]). If is bounded it is usually proved using density of polynomials in , which always holds if all polynomials are in (and is not a closed curve).
We note that the operator is bounded. Indeed, by Corollary 3.2 the function is bounded for each and by (3.3) we have
[TABLE]
where we have used (3.2) in the last inequality. It follows that .
The outcome of our constructions is the ability to write the two inequalities in (3.1) as quadratic constraints for :
[TABLE]
The final observation is that the objective functional in (3.1) can be replaced by a (real) linear functional . Indeed,
[TABLE]
It remains to notice that if satisfies (3.7) then so does for every , . Thus we arrive at the problem
[TABLE]
Lemma** 3.3****.**
The operator is compact, positive definite and self-adjoint.
Proof.
Self-adjointness and positivity of on are immediate consequences of (3.3). To prove compactness, let be a bounded sequence. Extract a weakly convergent subsequence (without relabeling it) . Then for every we have . In addition, for every we have . The sequence is bounded, since is weakly convergent, while is bounded on by Lemma 3.1. Thus, is uniformly bounded on . Then in the norm. But then by the estimate (see (3.6)) we conclude that in .
∎
Theorem** 3.4****.**
Let be a RKHS of functions analytic in domain , with kernel and norm . Let be a rectifiable curve of finite length and be the norm. Fix a point and assume with and , then
[TABLE]
where is the unique solution of
[TABLE]
Moreover, (3.9) is optimal since it is attained (up to the factor ) by
[TABLE]
Before we prove this theorem several remarks need to be made.
An obvious thing to do is to set in (3.10). If , where is given by (3.5), then , as . In which case the upper bound (3.9) is simply
[TABLE]
In other words we have numerically stable analytic continuation. Examples where this happens are mentioned in Remarks 2.3 and 2.5. This case will be referred to as the trivial case. 2. 2.
The function on the right-hand side of (3.11) is obviously in and obviously satisfies the constraints in (3.1). Hence, the attainability of the bound (3.9) is trivial. Only the bound itself requires a proof. 3. 3.
The upper bound (3.9) is not an explicit function of and . Its asymptotics as depends on fine properties of the operator . This will be discussed in Section 3.3. In specific examples in Section 4 equation (3.10) is solved explicitly and the power law behavior is exhibited. 4. 4.
The precise asymptotics of the exponential decay of eigenvalues of is known for certain classes of spaces. For example, assume coincides with the Smirnov class [13]. If the domain is bounded and simply connected and is a closed Jordan rectifiable curve of class for , with denoting the domain bounded by it, then the eigenvalues of satisfy the asymptotic relation [28]
[TABLE]
where is the Riemann invariant, whereby the domain is conformally equivalent to the annulus .
The proof of Theorem 3.4 in the more general context of RKHS follows without much change from the proof of the same theorem for the Hardy space of analytic functions in the upper half-plane given in [20]. For the sake of completeness we give a short recap of the argument.
3.2 Proof of Theorem 3.4
We start by analyzing the trivial case.
Lemma** 3.5****.**
Assume the setting of Theorem 3.4, let , then
[TABLE]
Proof.
Let satisfy , (note that does not depend on ), then using (3.3) we have
[TABLE]
It remains to use the Cauchy-Schwartz inequality to conclude the desired inequality with .
∎
Let us now turn to the case . For every , satisfying (3.7) and for every nonnegative numbers and () we have the inequality
[TABLE]
Applying convex duality to the quadratic functional on the left-hand side of (3.7) we get
[TABLE]
so that
[TABLE]
which is valid for every , satisfying (3.7) and all , . In order for the bound to be optimal we must have equality in (3.15), which holds if and only if
[TABLE]
giving the formula for optimal vector :
[TABLE]
The goal is to choose the Lagrange multipliers and so that the constraints in (3.8) are satisfied by , given by (3.17).
if , then and optimality implies that the first inequality constraint of (3.8) must be attained, i.e. . Thus, does not depend on the small parameter , which leads to a contradiction, because the second constraint is violated if is small enough.
if , then . But this equation has no solutions in according to the assumption .
Thus we are looking for , so that equalities in (3.8) hold. (These are the complementary slackness relations in Karush-Kuhn-Tucker conditions.), i.e.
[TABLE]
Let , we can solve either the first or the second equation in (3.18) for
[TABLE]
or
[TABLE]
The two analysis paths stemming from using one or the other representation for lead to two versions of the upper bound on , optimality of neither we can prove. However, the minimum of the two upper bounds is still an upper bound and its optimality is then apparent. At first glance both expressions for should be equivalent and not lead to different bounds. Indeed, their equivalence can be stated as an equation
[TABLE]
for . Equation (3.21) has a unique solution , because is monotone increasing (since its derivative can be shown to be positive), and . (See [20] for technical details.)
In the examples in this paper the eigenvalues and eigenfunctions of exhibit exponential decay. We have shown in [20] that such behavior implies that , as . However, any choice of gives two valid upper bounds: one via (3.19), the other, via (3.20). In the anticipation that the exponential decay of eigenvalues and eigenfunctions holds we simply set and obtain, setting ,
[TABLE]
Definition of implies , i.e.
[TABLE]
which implies the inequalities
[TABLE]
Therefore, we have both
[TABLE]
Inequality (3.9) is now proved. We remark that a possibly suboptimal choice still delivers asymptotically optimal upper bound (3.9), since it is attained by the function (3.11).
3.3 Solving the integral equation
We begin by making several observations about a priori properties of the solution of (3.10) in the non-trivial case . The most immediate consequence of the non-triviality is that blows up as . If it did not, we would be able to extract a weakly convergent subsequence and passing to the weak limits in (3.10) obtained that , for . However, since we get a contradiction with the non-triviality.
Next let us show that equation (3.22) implies that . On the one hand, dividing equation (3.22) by we obtain
[TABLE]
On the other, we have and therefore
[TABLE]
proving that . This means that one cannot expect full numerical stability of analytic continuation.
Finally, we prove the “mathematical well-posedness” of analytic continuation: as . This is a consequence of the weak convergence of to 0. If we divide (3.10) by and pass to weak limits, using the fact that we obtain that the weak limit of satisfies . But if , then . It follows that the analytic function on and hence must vanish everywhere in . This shows that the operator has a trivial null-space and that , as .
A consequence of the just established strict positivity of is separability of the Hilbert space . This should not be surprising, since consists of analytic functions each of which can be completely described by a countable set of numbers.
Lemma** 3.6****.**
The Hilbert space is always separable.
Proof.
We saw that given by (3.4) is a self-adjoint, compact operator. We have just seen that has a trivial null-space. In this case the Hilbert space is the orthogonal sum of countable number of finite dimensional eigenspaces of with positive eigenvalues. Thus, has a countable complete orthonormal set and is therefore separable. ∎
In applications of our theory in Section 4 we solve equation (3.10) exactly by finding all eigenvalues and eigenfunctions of . Let be an orthonormal eigenbasis of with . In this basis the equation (3.10) diagonalizes:
[TABLE]
therefore we find
[TABLE]
Using this expansion, formula , and (3.22) we find that
[TABLE]
It follows that
[TABLE]
since if the series had a finite sum then formula (3.24) for would imply
[TABLE]
contradicting the blow up of .
In our examples where the eigenvalues and eigenfunctions can be found explicitly they are seen to decay exponentially fast to 0 (see also (3.13)). As we have shown in [20] this implies the power law principle
[TABLE]
where can be expressed in terms of the rates of exponential decay of spectral data for .
Theorem** 3.7****.**
Let be orthonormal eigenbasis of with . Let and be given by (3.10) and (3.11) respectively. Assume
[TABLE]
with implicit constants independent of (so that (3.25) holds). Then,
[TABLE]
with implicit constants independent of . In particular, this implies the power law principle (3.26) with exact exponent:
[TABLE]
The proof of Theorem 3.7 immediately follows from (3.24) and Lemma A.1.
3.4 Linear constraints
In one of our examples we encounter a situation where additional linear constraints are imposed on a previously solved problem. In general all linear constraints on analytic functions will simply be incorporated into the definition of the RKHS . The question is whether we can use the already found solution of a problem if additional linear constraints are imposed. Let be a closed, -linear subspace. Then with the inner product from is still a RKHS with the reproducing kernel , where denotes the orthogonal projection onto . If we restrict and in (3.3) to elements from , then the operator can be written as . Then equation (3.10) can be written (in the language of the original RKHS ) as
[TABLE]
whose unique solution necessarily belongs to . In general, one’s ability to solve the original problem (3.10) would be of little help for solving (3.28), except in the special case when is an invariant subspace of . In this case commutes with and if solves (3.10), then solves (3.28).
The requirement that be a -linear subspace is important, because the linearization argument taking the objective functional in (3.1) to the one in (3.8) requires all the constraints to be invariant under multiplication by a phase factor , . In some applications, like the analytic continuation of the complex electromagnetic permittivity the constraints may be just -linear, in which case other techniques have to be applied [19].
4 Applications
4.1 The annulus
Here we prove Theorem 2.1, so assume the setting of Section 2.1. Note that if we replace -norm in Theorem 2.1 by another equivalent norm, this will only change the constant in the inequality (2.3). In order to apply our theory we need a norm, induced by an inner product, with respect to which the reproducing kernel of the space is as simple as possible. To define such an inner product we use the Laurent expansion
[TABLE]
then if and only if and (cf. [32]). So we define
[TABLE]
The norm in induced by (4.2) is equivalent to the norm (2.2) (e.g. [32, 22]). Now the functions form a basis in , let us normalize them:
[TABLE]
then is orthonormal basis of . Definition of the reproducing kernel implies that . Computing this sum, or by adding kernels of the spaces and , we find the reproducing kernel of :
[TABLE]
Note that . Indeed, the function has simple poles at . At the same time, for any the function may have singularities only in the set . If , then . If , then . But since and curves are outside of the annulus , the equation for cannot have any solutions in .
We observe that for any orthonormal basis of we have, using (3.3),
[TABLE]
It is easy to verify that when is a circle centered at the origin, the functions , given by (4.3) are also orthogonal in and hence, taking in (4.5) we conclude that . So we have proved
Lemma** 4.1****.**
Let be given by (4.3) and given by (4.5), then
[TABLE]
where
[TABLE]
We see that and approach to zero along two different sequences and have two different asymptotic behaviors, which are distinguished by the location of relative to . Therefore, to apply Theorem 3.7 we need to consider two cases. Assume that lies outside of , i.e. . The function from (3.10) is given by
[TABLE]
Note that, for any
[TABLE]
By assumption the above quantity is summable over , this implies that in analyzing the sum over negative indices is , as , and hence can be ignored. The dominant part is the sum over . Analogously, in quantities as well, the sum can be restricted to . This determines the behaviors and , therefore Theorem 3.7 implies that the exponent is . The case is done analogously and (2.4) now follows.
Next, we can rewrite (4.7) as
[TABLE]
Let us consider the function
[TABLE]
clearly for negative indices and hence can be ignored, and for positive indices can be ignored from the denominator in the definition of . Therefore, values of at and their and -norms have the same behavior in . Thus, we may consider instead, which then gives rise to the maximizer function in (2.5). Finally, the fact that is bounded uniformly in follows from the application of Lemma A.1.
4.2 The upper half-plane
Notation: Let and denote respectively the closed disk and the circle centered at and of radius in the complex plane.
In this section we prove Theorem 2.4. The Hardy space of functions analytic in the complex upper half-plane is a RKHS with the inner product . By Cauchy’s integral formula
[TABLE]
Therefore, the reproducing kernel of is
[TABLE]
In Theorem 2.4 the data is measured on with . Using the definition of (3.4) we have
[TABLE]
Note that . Indeed, the function is analytic everywhere in , except at , where it has a pole. At the same time for any the function is analytic everywhere in outside of . But , since lies outside of . Therefore, the equation has no solutions in .
Lemma** 4.2****.**
Let and . Let be an orthonormal eigenbasis of in , with eigenvalues . Then
[TABLE]
where are as in Theorem 2.4.
Before proving this lemma, let us see that it concludes the proof of Theorem 2.4 upon the application of Theorems 3.4 and 3.7. Indeed, and , then the formula (2.7) for the exponent follows. The function from (3.10) is given by
[TABLE]
As in the case of annulus, ignoring the constants that don’t affect the asymptotics of the function as we obtain the maximizer (2.8).
Proof of Lemma 4.2.
Let , then must be analytic in the extended complex plane with the closed disk removed. In particular, it is analytic in . Thus, we can evaluate the operator explicitly in terms of values of .
[TABLE]
We note that precisely when is outside of the closed disk . In addition is analytic in , hence
[TABLE]
Next we note that the Möbius transformation
[TABLE]
maps onto the exterior of . In particular there is a disk such that . Then is analytic in the exterior of , since is analytic outside of . But is an eigenfunction of , hence it must also be analytic outside of . Repeating the argument using the fact that is analytic in the larger domain we conclude that it must also be analytic outside of , such that . We can continue like this indefinitely, showing that the only possible singularity of must be at the fixed point of . We find
[TABLE]
Since is analytic at infinity the transformation will map the extended complex plane with removed to the entire complex plane (without the infinity). The eigenfunction will then be an entire function in the -plane. Let . Then
[TABLE]
The relation now reads
[TABLE]
One corollary of this equation is that . Hence, is also an entire function, satisfying
[TABLE]
We see that is an entire function with the property that is a constant multiple of , with and , where is given by (2.7). It remains to observe that such a property holds for functions , provided
[TABLE]
Indeed,
[TABLE]
In our case we get and conclude that and is given by (4.1). Converting the formula back to we obtain (up to a constant multiple)
[TABLE]
It remains to normalize the eigenfunctions . For that we compute
[TABLE]
∎
4.3 The Bernstein ellipse
4.3.1 From the ellipse to the annulus
The ellipse is conformally equivalent to a disk or the upper half-plane. The conformal mapping effecting the equivalence can be written explicitly in terms of the Weierstrass -function, but the image of the interval will then be a curve that would not permit any kind of explicit solution of the resulting integral equation. Instead we use a much simpler Joukowski function that will convert the problem in the ellipse to the problem in an annulus with being a concentric circle inside the annulus. We observe that maps the annulus onto the Bernstein ellipse in 2-1 fashion, meaning that each point in has exactly two (if we count the multiplicity) preimages in the annulus (note that ). Moreover, the unit circle gets mapped onto under . So given a function , the function is analytic in defined in (2.1), with , has the same norm, and satisfies the symmetry property
[TABLE]
Conversely, any function , satisfying (4.2) defines an analytic function in a Bernstein ellipse (with the same norm). This is so because (4.2) can also be written as
[TABLE]
The Schwarz reflection principle then guarantees that (4.3) holds for all . This implies that gives the same value for each of the two branches of and hence defines an analytic function in . Thus, the analytic continuation problem in ellipse reduces to the one in the annulus, but with an additional symmetry constraint (4.2).
4.3.2 The annulus with symmetry
Let us now define
[TABLE]
The curve will be a circle centered at the origin of radius .
Lemma** 4.3**** (Annulus with symmetry).**
Let and let be such that . Then there exists , such that for every and every with and we have the bound
[TABLE]
where the exponent is the same as in Theorem 2.1, i.e.
[TABLE]
Moreover, (4.5) is asymptotically optimal as and the function attaining the bound is
[TABLE]
Proof.
We note that the maximization problem in Lemma 4.3 differs from the one in Theorem 2.1 by the requirement of symmetry (4.2). Hence, following the theory in Section 3.4 we define the subspace
[TABLE]
Then, the orthogonal projection onto will be given by
[TABLE]
Lemma** 4.4****.**
The integral operator with kernel (4.4) and commutes with .
Proof.
The commutation is then equivalent to
[TABLE]
which, after change of variables on the left-hand side reduces to
[TABLE]
Substituting the definition of from (4.4) into this formula we easily verify it. ∎
According to the theory in Section 3.4 the solution of (3.28) is , where is given by (4.7). We observe that in the case we have and , so that
[TABLE]
Substituting the expressions for from (4.6), (4.3), respectively, and ignoring the first term and some constants, which affect the asymptotics of by constant factors, we arrive at the function
[TABLE]
We note that
[TABLE]
is the orthonormal eigenbasis of with respect to . The corresponding eigenvalues are , and for we have . Then, Theorem 3.7 gives formula (4.6) as well as the maximizer function (4.7). ∎
4.3.3 From the annulus to the ellipse
In this section we will show that Theorem 2.6 follows from Lemma 4.3. Let be such that and for all . As discussed in Section 4.3.1, the function is analytic in , with and has the symmetry where . It also satisfies
[TABLE]
as well as
[TABLE]
Let . Let be the unique solution of , satisfying . Then by Lemma 4.3 (with and ) we have
[TABLE]
where is given by (2.10). This proves (2.9).
In order to prove the optimality of the bound (2.9) we use Lemma A.1 to show that given by (4.7) satisfies
[TABLE]
Using the Joukowski function to map this to a function on the Bernstein ellipse we obtain
[TABLE]
where is the Chebyshev polynomial of degree . Chebyshev polynomials are just monomials in the annulus after the Joukowski transformation:
[TABLE]
We note that due to the choice of the branch of to correspond to a point in the exterior of the unit disk we can neglect in
[TABLE]
Thus, the function in (2.11) is asymptotically equivalent to (4.10). Theorem 2.6 is now proved.
Acknowledgments. The authors wish to thank Mihai Putinar for enlightening discussions during the BIRS workshop. We also thank the referees for valuable suggestions and new references. This material is based upon work supported by the National Science Foundation under Grant No. DMS-1714287.
Appendix A Appendix
Lemma** A.1****.**
Let be nonnegative numbers such that and with , where the implicit constants don’t depend on . Let be a small parameter, then
[TABLE]
where the implicit constants don’t depend on .
Proof.
Let us prove the first assertion of (A.11), the second one will follow analogously. Introduce the switchover index defined by
[TABLE]
Below all the implicit constants in relations involving or will be independent on . It is clear that
[TABLE]
Note that
[TABLE]
therefore using our assumption on we find
[TABLE]
On the other hand
[TABLE]
Thus we conclude
[TABLE]
Now and , therefore . Using these along with (A.12) and (A.13) we obtain
[TABLE]
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] L. A. Aizenberg. Carleman’s formulas in complex analysis: theory and applications , volume 244. Springer Science & Business Media, 2012.
- 2[2] D. Batenkov, L. Demanet, and H. N. Mhaskar. Stable soft extrapolation of entire functions. Inverse Problems , 35(1):015011, 2018.
- 3[3] D. J. Bergman. Exactly solvable microscopic geometries and rigorous bounds for the complex dielectric constant of a two-component composite material. Phys. Rev. Lett. , 44:1285–1287, 1980.
- 4[4] S. Bernstein. Sur la valeur asymptotique de la meilleure approximation des fonctions analytiques. Comptes Rendus de l’Académie des Sciences , 155:1062–1065, 1912.
- 5[5] J. Cannon and K. Miller. Some problems in numerical analytic continuation. Journal of the Society for Industrial and Applied Mathematics, Series B: Numerical Analysis , 2(1):87–98, 1965.
- 6[6] T. Carleman. Les Fonctions quasi analytiques: leçons professées au Collège de France . Gauthier-Villars et Cie, 1926.
- 7[7] E. Cherkaev and M.-J. Yvonne Ou. Dehomogenization: reconstruction of moments of the spectral measure of the composite. Inverse Problems , 24(6):065008, 19, 2008.
- 8[8] S. Ciulli. A stable and convergent extrapolation procedure for the scattering amplitude.—i. Il Nuovo Cimento A (1965-1970) , 61(4):787–816, Jun 1969.
