Supercritical Regime for the Kissing Polynomials
Andrew F. Celsus, Guilherme L.F. Silva

TL;DR
This paper analyzes the asymptotic behavior of a family of orthogonal polynomials with complex oscillatory weights in the supercritical regime, using quadratic differentials and Riemann-Hilbert techniques, revealing new phenomena at certain parameter values.
Contribution
It extends the asymptotic analysis of kissing polynomials to the supercritical regime, explicitly constructing the global parametrix and identifying parameter values where polynomials do not exist.
Findings
Asymptotics are obtained for ment yond the critical lue.
Explicit construction of the global parametrix using elliptic integrals.
Identification of a discrete set of lues where polynomials fail to exist.
Abstract
We study a family of polynomials which are orthogonal with respect to the varying, highly oscillatory complex weight function on , where is a positive parameter. This family of polynomials has appeared in the literature recently in connection with complex quadrature rules, and their asymptotics have been previously studied when is smaller than a certain critical value, . Our main goal is to compute their asymptotics when . We first provide a geometric description, based on the theory of quadratic differentials, of the curves in the complex plane which will eventually support the asymptotic zero distribution of these polynomials. Next, using the powerful Riemann-Hilbert formulation of the orthogonal polynomials due to Fokas, Its, and Kitaev, along with its method of asymptotic solution via Deift-Zhou nonlinear…
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.
Supercritical Regime for the Kissing Polynomials
Andrew F. Celsus
University of Cambridge, Cambridge, UK.
and
Guilherme L. F. Silva
Corresponding Author. Instituto de Ciências Matemáticas e de Computação, Universidade de São Paulo (ICMC - USP), São Carlos - SP, Brazil.
Abstract.
We study a family of polynomials which are orthogonal with respect to the varying, highly oscillatory complex weight function on , where is a positive parameter. This family of polynomials has appeared in the literature recently in connection with complex quadrature rules, and their asymptotics have been previously studied when is smaller than a certain critical value, . Our main goal is to compute their asymptotics when .
We first provide a geometric description, based on the theory of quadratic differentials, of the curves in the complex plane which will eventually support the asymptotic zero distribution of these polynomials. Next, using the powerful Riemann-Hilbert formulation of the orthogonal polynomials due to Fokas, Its, and Kitaev, along with its method of asymptotic solution via Deift-Zhou nonlinear steepest descent, we provide uniform asymptotics of the polynomials throughout the complex plane.
Although much of this asymptotic analysis follows along the lines of previous works in the literature, the main obstacle appears in the construction of the so-called global parametrix. This construction is carried out in an explicit way with the help of certain integrals of elliptic type. In stark contrast to the situation one typically encounters in the presence of real orthogonality, an interesting byproduct of this construction is that there is a discrete set of values of for which one cannot solve the model Riemann-Hilbert problem, and as such the corresponding polynomials fail to exist.
Key words and phrases:
Orthogonal polynomials in the complex plane; Riemann-Hilbert problems; zero distribution; strong asymptotics; steepest descent method, Boutroux condition, quadratic differentials
Contents
-
4 The Associated Quadratic Differential and its Trajectories
-
6.2 Step Two: Ansatz for the Global Parametrix and Related Scalar RHP’s
-
8 Asymptotics of the Kissing Polynomials: Discussion on Theorem 2.4
1. Introduction
Polynomial sequences satisfying non-Hermitian or complex orthogonality conditions originally appeared in the literature due to their use in approximation theory [4, 25, 35], but have recently been used in their connection to theoretical physics and random matrix theory [1, 2, 3, 10] and Painlevé equations [8, 12, 14], to mention only a few.
In the context of the present work, the motivation for studying these polynomials comes from the problem of constructing quadrature rules for oscillatory integrals of the form
[TABLE]
It was shown by Asheim, Deaño, Huybrechs and Wang [6] that by using the zeros of the monic polynomial of degree satisfying the orthogonality conditions,
[TABLE]
one could construct a quadrature rule for (1.1) that not only attained high asymptotic order as , but also reduced elegantly to traditional Gauss-Legendre quadrature as . We mean high asymptotic order in the following sense. Letting be the zeros of and be the associated Gaussian Quadrature weights, [6, Theorem 4.1] tells us that for analytic we have the following asymptotic decay,
[TABLE]
This is indeed high order, especially when compared with typical asymptotic methods (such as Filon methods) which attain as using the same amount of information. More details on this form of complex Gaussian quadrature, along with other numerical methods for the treatment of highly oscillatory integrals, can be found in the recent monograph of Deaño, Huybrechs, and Iserles [19]. As a result of this work, it became an important question in numerical analysis to understand the zero behavior of the sequence of polynomials , in particular under various possible asymptotic regimes in the parameter and also in the degree .
Although was, as mentioned, first studied in [6], it was Deaño, Huybrechs, and Iserles [20] who dubbed them the \sayKissing Polynomials due to the patterns formed by their zero trajectories, see Figure 1. In the same work, they showed that for fixed degree and as , the zeros of the kissing polynomials tend to .
The asymptotic analysis of for fixed and as can be found in the appendix of [18] or by using the techniques of [29], where one can show that the zeros of the kissing polynomials accumulate on the interval .
One can also let depend on . To get to a nontrivial new limit, one sets in (1.2) which leads to the formulation of the varying weight kissing polynomials, which we formally reintroduce by
[TABLE]
Thus, studying the behavior of the kissing polynomials as and go to infinity at the rate is equivalent to studying the large behavior of the varying weight kissing polynomials defined by (1.4). We stress that and are not the same polynomials although they are easily related through a rescaling.
In [18], Deaño studied the large degree asymptotics for , showing that for the zeros of accumulate on a single analytic arc connecting and . As shown in [18], the critical value (numerically, ) is the unique positive solution to the equation
[TABLE]
Deaño also noted that for , the zeros of seem to accumulate on two disjoint arcs in the complex plane, as illustrated in Figure 2.
The goal of this paper is to prove that the situation depicted in Figure 2 is correct. Therefore, we will show that for , the zeros of the varying weight kissing polynomials do indeed accumulate on two disjoint arcs, one emanating from and the other emanating from . These arcs turn out to be analytic, and we will describe them precisely. We will also provide strong asymptotic formulas for in the complex plane. By studying the supercritical regime, we are thus completing the picture regarding non-trivial asymptotics of the kissing polynomials.
2. Statement of Main Results
In this section, we provide the necessary background on complex orthogonality, setting up the notation used throughout this text, and discuss our main findings.
It should first be noted that due to the complex-valued nature of the weight function in (1.4), questions such as existence of the polynomials and bounds for the location of their zeros, which are taken for granted when dealing with real, positive weight functions, are no longer known a priori. Indeed, these questions were considered by Deaño, Huybrechs and Iserles in their study of the kissing polynomials [20].
As everything in the integrand of (1.4) is analytic, we have complete freedom when choosing the path of integration connecting and in the orthogonality conditions (1.4). On the other hand, accounting for the asymptotic behavior of as , and in particular its zeros, it is expected that there exists a distinguished curve of orthogonality along which the asymptotic behavior of changes depending on whether belongs to this curve or not. This curve should be the one where the zeros of asymptotically lie, as depicted in Figure 2.
The rigorous study of this intuitive notion of the \saycorrect curve to choose from was initiated by Nuttall, who conjectured in a non-varying situation that such correct curve should be of minimal capacity (see for instance the later work of Nuttall and Singh [36]). Nutall’s conjecture was later established rigorously by Stahl in a series of seminal works [39, 40]. Roughly, the idea is that for a fixed allowable curve of orthogonality , one first minimizes an energy functional over probability measures defined on , and then maximizes this minimum over all possible . The curve for which this max-min is attained, known after the works of Stahl by the name of S-curve, is then the one that attracts the zeros of the corresponding large degree orthogonal polynomials. Moreover, the probability measure that minimizes the energy functional on governs the limiting distribution of the zeros. For the interested reader, we also recommend the more recent work [5] by Aptekarev and Yattselev, where they revisit Nuttall’s conjecture under a more modern perspective, establishing strong asymptotics of non-hermitian orthogonal polynomials under some additional geometric conditions.
The original works of Stahl mentioned above were concerned with non-hermitian orthogonality with non-varying weights. In an attempt to extend Stahl’s results to account for varying weights, Gonchar and Rakhmanov [25] obtained the asymptotic zero distribution of a certain class of non-hermitian orthogonal polynomials with varying weights, but took the existence of the associated S-contour for granted. The problem of existence of the S-contour, not only in the context of Gonchar and Rakhmanov’s original work but also in other contexts, remained open until not so long ago, when Rakhmanov [38] outlined a very general max-min approach for obtaining S-contours. The rigorous analysis of this approach, nowadays called the Gonchar-Rakhmanov-Stahl program, depends heavily on the type of orthogonality weight and the geometry of the contours at hand, but nevertheless has been carried out in various different settings [5, 28, 31, 33, 44], many of which were largely inspired by Rakhmanov’s outline in [38].
Despite the many works on S-contours already available in the literature, a rigorous proof of the existence of such a contour adapted to the context of the orthogonality as in (1.4) and arbitrary polynomial potential remains an open question. By virtue of the simplicity of our choice of potential in (1.4), instead of trying to obtain the S-contour rigorously through a max-min approach, we use ad hoc calculations inspired by these max-min techniques to find an educated guess for the appropriate form of our S-contour. The main output of these calculations is an expression for the so-called spectral curve, from which we construct a -function that should ultimately describe the leading exponential asymptotics of the polynomials of large degree. Moving forward, we use this -function to implement the Riemann-Hilbert approach that finally provides the rigorous asymptotics of the orthogonal polynomials.
Much in virtue of the connection with random matrices and other mathematical physics’ models, asymptotics of orthogonal polynomials, both hermitian but also non-hermitian, have experimented an emerging of new ideas and techniques. In contrast to the potential-theoretic techniques by Stahl, Gonchar and Rakhmanov, among others, just described, another possible approach to obtain the -function that governs the leading asymptotics of orthogonal polynomials is through deformations techniques. In short terms, the main idea is to see this -function as being deformed with the parameter , and keep track of this deformation in the parameter space . These ideas have shown to be quite powerful in the context of integrable systems for a little while, see for instance the monograph by Kamvissis, McLaughlin and Miller [26] and the references therein, but have more recently also come to play in the theory of orthogonal polynomials, notably by Bertola and Tovbis [10, 12, 13].
In contrast with the potential-theoretic approach, where one constructs the -function with the solution of a variational problem, over here one finds a scalar Riemann-Hilbert problem for the -function (or yet its derivative), where the number of “cuts” (or the genus of the underlying Riemann surface) is also to be determined. Nevertheless, once one proves that for a given number of cuts and a specific parameter value this scalar Riemann-Hilbert problem yields the correct -function, one then has to deform , keeping track of all the level lines for . The critical transition in the parameter space then appears as a change in behavior of these level lines, and past those critical points one possibly has to adapt the number of cuts one started with. In the recent work [13], for instance, Bertola and Tovbis carry out this approach for a quartic potential, but many of their technical results are actually valid for general potential when the contour of orthogonality does not have finite endpoints. Such approach could in principle be adapted to our context here, where we have the endpoints , as well. In fact, many of the aspects of the present work are comparable, for instance the need of control for the level lines of is, to some extent, similar with our analysis of trajectories of quadratic differentials in Section 4 below, and (2.1) below is equivalent to the Riemann-Hilbert problem for the derivative of the -function.
Under the perspective of the matrix Riemann-Hilbert approach for the orthogonal polynomials, either the potential-theoretic approach or the deformations in the parameter space technique share in common that they do not provide the strong asymptotics of the orthogonal polynomials directly. Instead, they do provide the key object, the -function, that enters as an input of the Riemann-Hilbert analysis and with which one is then able to apply the Deift-Zhou steepest descent method.
Following along the lines of the max-min approach used in [28, 31], see also [18] for related calculations, we expect that the weak limit of the normalized zero counting measure for , say a measure , should verify a quadratic equation of the form
[TABLE]
where is a rational function to be determined, whose only singularities are simple poles at (so as to encode that the endpoints of integration in (1.4) are ). A comparison of both sides of this quadratic equation implies that
[TABLE]
so should take the form
[TABLE]
for
[TABLE]
and yet to be chosen appropriately.
For the choice the polynomial has a double zero at , and the Riemann surface associated to the equation
[TABLE]
for which
[TABLE]
should be a solution to, has genus [math]. This genus ansatz yields the correct guess of an appropriate for , and it is consistent with the numerical observation that for , the zeros of accumulate on a single analytic arc, as proven in the aforementioned work [18]. In the same work, Deaño also indicated that should not be the correct choice for . In light of the numerical outputs in Figure 2, which indicate that for the zeros accumulate on two disjoint arcs, we actually expect that the Riemann surface associated to as in (2.5) has genus . This means that must have simple zeros for , so we must expect that the correct choice must satisfy .
The determination of in the supercritical regime is our first contribution.
Theorem 2.1**.**
Suppose that and define as in (2.4). Then there exists a unique choice for which
[TABLE]
Furthermore,
[TABLE]
With some effort, the limit above could be complemented with the limit
[TABLE]
see for instance Remark 3.4 below.
In the literature, the transcendental condition (2.6) goes by the name of the Boutroux condition [10, 11, 12, 27]. We remark that this condition does not depend on the choice of branch of the square root, as long as it varies analytically along the contour of integration. We are implicitly assuming this fact when we write (2.6). In a moment we will fix a branch of this root that will be used throughout the rest of this introduction.
Once the function in (2.1) is determined, if we knew , then we could simply use Plemelj’s formula in (2.1) to recover the density of . Even if we did not know , this observation would still be useful, as it imposes a constraint on what could potentially look like. Indeed, assuming that is a union of arcs, using Plemelj’s formula in (2.1), we see that should verify the relation , where is the complex line element along the arcs of . In particular, this formal calculation indicates that has to be purely imaginary along the support of , therefore imposing a severe restriction on what types of arcs are good candidates for .
In fact, our next two results transform these ideas into rigorous statements. We first provide the existence of the analytic arcs that will support the limiting zero distribution of .
Theorem 2.2**.**
Take and as in (2.3) and (2.4), where is defined as in Theorem 2.1. Then there exist analytic arcs and with the following properties.
- (i)
The arc is on the right half plane, starts at and ends at , and it is the unique such arc that satisfies
[TABLE] 2. (ii)
The arc is obtained as the reflection of over the imaginary axis and satisfies
[TABLE]
In the same spirit as (2.6), the conditions (2.7)–(2.8) do not depend on the choice of the branch of the root, as long as this choice varies analytically along the contour of integration. But now it is a good time to define, once and for all, the branch of the root that we will be dealing with for the rest of this section.
To do so, we orient the arcs and from to and from to , respectively, and for convenience set . With the orientation inherited from and , the arc has natural -sides. The rational function has a well-defined analytic square root on , that we choose in such a way that the asymptotic expansion (2.2) holds true. For , we denote by the boundary values of this square root of when we approach from its -side.
The next result assures the existence of a positive measure , whose Cauchy transform solves (2.5). This measure, as formally stated in a moment, will turn out to be the limiting zero distribution of the kissing polynomials with varying weight.
Theorem 2.3**.**
Suppose and let be defined as in (2.3) with the choice of given by Theorem 2.1. Define a complex-valued measure on through its density w.r.t. the complex line element as
[TABLE]
Then is, in fact, a probability measure on , and its shifted Cauchy transform
[TABLE]
solves (2.5) for ,
With the measure in hand, we use it as an input for the asymptotic analysis of for large . This asymptotic analysis is based on the Riemann-Hilbert formulation for orthogonal polynomials which, combined with the Deift-Zhou nonlinear steepest descent method, provides not only the weak zero distribution for , but also strong asymptotic formulas for .
To discuss some of these asymptotic results, introduce the quantity
[TABLE]
where the path of integration is a straight line segment and the last identity follows from symmetry considerations. This real value is a real-analytic function of . As we will show in Section 6, for odd and a function which will be defined later with the help of (6.17)–(6.20), the difference takes values in only for a discrete set of values of and . With this in mind, for , we define the set to be the set of pairs for which the quantity is within a distance from . More details are given in Section 6.5. Set
[TABLE]
As we will verify later, the function is well defined modulo . Also, from the expansion (2.2) we see that
[TABLE]
for some complex constant .
Theorem 2.4**.**
Fix and suppose . For sufficiently large, and in case is odd, the kissing polynomial in (1.4) uniquely exists as a monic polynomial of degree exactly , and the weak asymptotics of its zeros is given by the weak limit
[TABLE]
where is the atomic measure with mass at .
Furthermore, as the asymptotic formulas
[TABLE]
hold true uniformly in compacts of and , respectively, where the functions and have the following properties.
- (i)
* is holomorphic on , whereas is holomorphic on , where is a contour connecting and , and they remain bounded in compacts of their domains of definition as .* 2. (ii)
* does not have zeros.* 3. (iii)
The function has a unique zero at a point , which is simple and located on the imaginary axis.
We note that although has a jump on a contour which does not contain zeros of , it actually turns out that is analytic on , so the leading term on the right-hand side of (2.13) is in fact analytic on .
The nature of the restriction on odd in Theorem 2.4 is due to the construction of the so-called global parametrix, whose existence can only be assured upon verifying the non-degeneracy conditions leading to the definition of above. Again, details are given in Section 6, and in particular Section 6.5. The functions and are specific entries in this global parametrix, and as such they are initially constructed with the help of meromorphic differentials on the Riemann surface associated to (2.5). For the benefit of the reader, in Section 8 we translate this construction into complex-analytic terms, which leads to more explicit forms for and .
The appearance of a zero of on the imaginary axis is natural in our situation, because for odd the polynomial has, by symmetry, exactly one zero on the imaginary axis. When , the support of the limiting zero distribution of is connected and intersects the imaginary axis, so this zero on is always encoded in the limiting distribution. However, when , the support of the limiting distribution no longer touches the imaginary axis. Therefore, the purely imaginary zero of remains an outlier, and can intuitively be thought of as a \sayspurious zero in the language of rational approximation.
As it was pointed out by Deaño, Huybrechs and Iserles [20, Proposition 3], for any fixed, there is always a sequence for which never exists (as a polynomial of degree exactly ). Having in mind the identification , and leaving aside technicalities such as the uniformity of the error in (2.13) for large , it is therefore natural that need not exist for all values of . As such, the restriction on odd degrees in Theorem 2.4 was to be expected.
Overview of the Paper
The present work is structured as follows.
In Section 3 we prove Theorem 2.1. The proof is based on the symmetries of the rational function , as well as on some explicit conformal mapping calculations.
Theorems 2.2 and 2.3 are proven in Section 4. These proofs are based on the theory of quadratic differentials, and are greatly inspired by ideas developed by Martínez-Finkelshtein and the second-named author, together with collaborators [34, 32, 7, 17, 16].
The asymptotic analysis of is performed via the Riemann-Hilbert formulation for the orthogonal polynomials combined with the Deift-Zhou nonlinear steepest descent method [22, 23]. Despite the fact that we are dealing with complex orthogonality, much of the analysis follows in parallel with the case of real orthogonality [29]. In Section 5, we make a brief overview of this method, quickly describing the outcome of its first steps. Although this asymptotic analysis, at the algebraic level, does not differ much from previous analysis in the literature, it is worth mentioning that a crucial object in the first steps is the rational function obtained through Theorem 2.1, or equivalently, the corresponding measure in Theorem 2.3.
Different constructions of the so-called global parametrix are present in the literature, for instance in the weighted case on higher genera Riemann surfaces with real symmetry [23], in the unweighted case without symmetries [5, 43] or yet in the logarithmically weighted case without symmetries as well [44]; all these works rely on constructions using theta functions. In our work, the main substantial difference in the asymptotic analysis appears in the construction of this parametrix. Due to the lack of real symmetry to explore, certain technical obstacles arise when trying to solve the associated model Riemann-Hilbert problem. This was already evidenced in the restriction on odd degrees in the statement of Theorem 2.4 and briefly discussed thereafter. At any rate, we follow ideas similar to the ones developed by Kuijlaars and Mo [30], but provide calculations in a more explicit manner so as to be able to construct this parametrix, rather than simply assure its existence. This construction is carried out in Section 6. The restriction in Theorem 2.4 also appears for the first time in this section, and is thoroughly discussed.
In Section 7 we briefly discuss the construction of local parametrix, which in our situation turns out to be constructed with the use of Bessel (for the endpoints ) and Airy (for the endpoints and ) functions. At the end of this section, we conclude the steepest descent analysis.
Finally, in Section 8 we wrap up the conclusions drawn from the steepest descent analysis, hence obtaining asymptotic formulas for , and in particular concluding the proof of the asymptotic results in Theorem 2.4.
Acknowledgments
The authors thank Alfredo Deaño, Arieh Iserles and Andrei Martínez-Finkelshtein for very fruitful discussions. They are also grateful to Ahmad Barhoumi and Maxim Yattselev, who pointed out a mistake in a previous version of Theorem 2.4. This collaboration started when the authors attended the conference Foundations of Computational Mathematics 2017 (FOCM 2017), and the authors are also grateful to the organizers of this conference for providing an excellent atmosphere for discussion. Most of this work was carried out while G.S. was a Postdoctoral Assistant Professor at the University of Michigan. He also acknowledges his current support by São Paulo Research Foundation under grant #2019/16062-1.
3. The Boutroux Condition
The Boutroux Condition, introduced in [10, 11], provides one approach to determining the asymptotics of orthogonal polynomials with respect to complex weights. For a rational function , the Boutroux condition asks that
[TABLE]
where is any closed loop on the Riemann surface associated to the algebraic curve .
In the present setting, for any , fix and consider
[TABLE]
and the associated rational function as in (2.3). Let be the union of the oriented line segments connecting to and to . In this section we use as a set of branch cuts for , so that we fix to be the square root of which is analytic on and that satisfies the asymptotics in (2.2). Notice that the endpoints of (and, in loose terms, itself) vary continuously with the parameters and .
In very concrete terms, the Boutroux condition in our setting asks to find for which
[TABLE]
where the integration takes place along straight line segments (that is, along subarcs of ), and we recall that the subscript denotes the limiting value of as we approach from its left-hand side w.r.t. the orientation of . We also point out to the reader that the last integral in (3.2) is exactly the same as (2.6).
Proposition 3.1**.**
[TABLE]
Proof.
Both identities follow from the symmetry , which is valid for outside the contours of integration and extends to the cuts as . See also Appendix A. ∎
As a result of Proposition 3.1, to determine such that equations (3.2) are satisfied, all we have to do is to make sure that the last integral in (3.2) is purely imaginary. To do this, we consider the function
[TABLE]
We emphasize that for any fixed , the contours of integration are still straight line segments. This assures that for fixed , the function is a continuous function of . Our next task is to show that changes sign on .
Proposition 3.2**.**
For any , we have that
[TABLE]
Proof.
We have that
[TABLE]
In this situation, we can write explicitly as
[TABLE]
where the branch of is the principal branch, so that , as . Using that
[TABLE]
a cumbersome, but straightforward calculation gives us that
[TABLE]
so that by taking real parts, we have that
[TABLE]
Note that when , which follows from the definition of as the only positive solution to (1.5). Furthermore,
[TABLE]
so for all , as desired. ∎
Proposition 3.3**.**
For all , we have that
[TABLE]
Proof.
Through the linear change of variables
[TABLE]
we see that
[TABLE]
where
[TABLE]
As we have fixed the branch of , the branch of in (3.4) is the one that behaves like
[TABLE]
Here, has branch cuts on the horizontal segments and and the integral (3.4) is computed along the first of these branch cuts. The goal now is to show that
[TABLE]
which will immediately imply that for . To do this, first note that for we can split into real and imaginary parts as
[TABLE]
As ,
[TABLE]
so that as moves from towards on the negative real axis, the image traces out a curve in the plane, starting at and initially dropping into the lower-right hand quadrant. As neither the real nor imaginary parts of have real zeros or poles in the interval , we can conclude that remains in this quadrant for these values of , and consequently
[TABLE]
In particular, from the expansion
[TABLE]
we obtain
[TABLE]
Because vanishes as a square root at , a conformal mapping analysis then implies that
[TABLE]
so that as moves from towards [math] on the negative real axis, the image of traces out a curve that starts at [math] and ventures into the lower left hand quadrant of the plane. Just as before, neither the real nor imaginary parts of have zeros or poles in the interval , and therefore we obtain
[TABLE]
as desired. ∎
We are ready to prove the main result of this section.
Proof of Theorem 2.1.
The existence of follows from Proposition 3.2 and 3.3 and the continuity of . With existence covered, we define .
The uniqueness of such will follow later, in a more indirect manner. As this is not an essential part in any of the coming, we only outline the proof of this statement in the following steps:
The whole asymptotic analysis to be done later relies only on the existence of as in Theorem 2.1, not on its uniqueness. 2.
In particular, for any other as in Theorem 2.1, say , we will be able to construct an associated measure as in Theorem 2.3 and verify the convergence (2.12) with instead of 3.
By uniqueness of the limiting zero distribution, we would have , and as such their supports would have to agree. Hence, the endpoints of the supports agree as well, thus .
Finally, to show that as , we start with a change of variables in (3.3) to arrive at
[TABLE]
where we are integrating over the branch cut oriented on the real axis from to [math]. Another cumbersome calculation shows that
[TABLE]
where
[TABLE]
and
[TABLE]
with a uniform error term for in compact subsets of .
If now, in particular, we restrict to , we see that
[TABLE]
for , so in this case
[TABLE]
with uniform error for . This means that the coefficient with in the right-hand side above is nonzero if and only if . However, we must have and for every , which, by virtue of the expansion above, can only happen if as , as desired. ∎
Actually, we showed that
[TABLE]
because the right-hand side of the last identity above, when evaluated at , must be [math] also in the limit .
Remark 3.4*.*
Along the same lines as we indicated on how to proceed for the proof of uniqueness above, we could in fact verify that as as follows.
First, one should observe that for the equation (2.6) is solved by ; this is a consequence of the genus zero study by Deaño [18]. Following very closely the asymptotic analysis presented therein (with the only difference that a local parametrix at would have to be considered as well), it does follow that an asymptotic formula as (2.13) takes place, say along the whole subsequence of polynomials of even degree. Consequently, this would imply the zero convergence of the whole sequence of counting measures for towards the measure determined by the conditions (2.6) and (2.7)–(2.8) with , so in particular in this case the limiting support of zeros consists of one single arc, say , that intersects the imaginary axis at .
Back to the limit of as , observe that because for any we can talk about accumulation points of as . Any such accumulation point, say , would necessarily solve (2.6) with , as this is a continuous condition on . As such, for any such accumulation point we could perform the whole asymptotic analysis carried out in this paper, concluding at the end of the day the asymptotic formula (2.13) for the whole sequence with and this value , obtaining also that the limiting support of zeros is obtained from .
Comparing the analysis just explained, we obtain that , in particular is a single analytic arc, and then as wanted.
Despite the natural details needed to turn the sketch above into a rigorous statement, we should stress that the asymptotic analysis for is not yet rigorously completed in the literature. Such a proof would require, as mentioned above, an appropriate analysis of a local parametrix near the intersection point of that would occur in that case.
To conclude this section, it is now useful to compute the first integral in (3.2).
Proposition 3.5**.**
For given by Theorem 2.1, we have that
[TABLE]
Proof.
Using (2.6) and Proposition 3.1,
[TABLE]
Using deformation of contours on the right-hand side above, we get that
[TABLE]
where is a closed contour that encircles the whole branch cut in the clockwise direction. To compute the latter integral, we deform to and use the expansion (2.2) to get
[TABLE]
as wanted. ∎
4. The Associated Quadratic Differential and its Trajectories
The final goal of this section is to prove Theorem 2.2. To construct the arcs and , our main tool will be the theory of trajectories of quadratic differentials. We will keep the discussion of the basic theory here to a minimum, and refer to [34, Appendix B] for details. The general theory can be found in the books by Strebel [41] or Pommerenke [37, Chapter 8].
We call an arc an arc of trajectory of the quadratic differential if for a fixed point ,
[TABLE]
Note that although the integral above depends on the starting point and on the branch of the square root taken, the condition that it is purely imaginary is independent of these. Also, we remark that this condition matches with (2.7)–(2.8).
Similarly, an arc is called an arc of orthogonal trajectory if for a base point ,
[TABLE]
Maximal arcs of (orthogonal) trajectories are simply called (orthogonal) trajectories.
If , then there exists exactly one arc of trajectory and one arc of orthogonal trajectory passing through , and these arcs are orthogonal to each other at . In particular, different critical trajectories can only intersect at critical points.
Trajectories emanating from zeros or simple poles of are called critical. From each simple zero of emanates exactly three critical trajectories, and the angle between consecutive ones is . From each simple pole emanates one critical trajectory.
Finally, from the expansion
[TABLE]
we see that the point is a pole of order of , and also that any trajectory extending to has to do so along angles [math] or , that is, horizontally. Furthermore, by the general theory there has to be at least two critical trajectories ending at , one along each allowable direction.
We will need two basic principles that follow from the general theory of trajectories of quadratic differentials. These principles are thoroughly discussed in [34, Section 4.5.1].
- P1.
If a critical trajectory emerges from a zero contained in a simply connected domain that does not contain poles of , then either connects to another zero inside , or intersects . In a similar spirit, if is simply connected and contains exactly one pole, then the trajectory emanating from this pole has to either end at a zero inside or hit the boundary of .
- P2.
If is a simply connected domain whose boundary is a union of critical trajectories and it does not contain poles in its interior, then it has to contain at least one pole on its boundary.
The next principles are specific to our particular situation, and follow immediately from the explicit form of in (2.3).
- P3.
Because has three distinct poles, any critical trajectory has to connect two critical points (possibly the same).
- P4.
If is an arc of trajectory, then its reflection onto the imaginary axis is also an arc of trajectory.
For a zero denote its order by , and for a pole of order set . Fix a simply connected domain whose boundary is a finite union of critical trajectories. Given a critical point , we set
[TABLE]
where is the inner angle of at . For instance, if is a zero on , the value gives the number of trajectories emanating from along the interior of .
The following formula, valid for any simply connected domain as above, is known as the Teichmüller Lemma [41, Theorem 14.1],
[TABLE]
The global behavior of all critical trajectories of is described by the following Theorem.
Theorem 4.1**.**
The trajectories of are symmetric with respect to reflection over the imaginary axis. Furthermore, the critical trajectories in the right half plane are as follows.
- (i)
There is a critical trajectory connecting and . 2. (ii)
There is a critical trajectory connecting and . This is the only trajectory from that moves to the left-half plane. 3. (iii)
The remaining trajectory that emanates from ends at . Furthermore, as along this trajectory.
These trajectories are numerically computed in Figure 4 for various choices of .
We split the proof of Theorem 4.1 into several lemmas.
Lemma 4.2**.**
There is at least one trajectory emanating from with endpoint on .
Proof.
To get to a contradiction, suppose that there is no trajectory as described. If a trajectory emanating from hits , then using Principle P4 we conclude that this trajectory connects to . But the latter cannot occur, so all three trajectories emanating from have to stay in the right half plane and none of them can end at .
Also, none of these trajectories from could be a closed loop on . Indeed, if this were the case, then Principle P2 applied to the bounded domain determined by this loop would guarantee that is inside the loop. But then the trajectory emerging from , by Principle P1, would have to hit . As is a trajectory and trajectories can only intersect at critical points, this means that would have to connect to the only critical point , which we are assuming cannot occur.
So this discussion and Principle P3 yield that all the trajectories from have to extend to , and because they have to stay on the upper half plane they all have to do so along angle [math]. These three trajectories determine exactly two domains on the right half plane, whose angle at is exactly [math]. Certainly at least one of these domains is pole-free, and for this one domain
[TABLE]
in contradiction to (4.1). The proof is complete. ∎
Lemma 4.3**.**
There cannot be two trajectories emanating from and intersecting .
Proof.
Suppose that there are two such trajectories, say and . By Principle P4, then they both have to connect to , so their union is the boundary of a simply connected domain . By Principles P2 and P4, the poles have to be in .
Consider now the remaining trajectory from . If emerges inside , then because we already know that we would not have any critical trajectory extending to , but this cannot occur. Hence, we have to have that extends to . Using again Principle P3, we see that the trajectories from are fully determined as in Figure 5.
We now look at the trajectory emanating from . By Principle P3, we conclude that has to connect and , so the full critical graph of is now depicted in Figure 6.
Consider the domain , which is obtained by removing from the domain bounded by , see Figure 6. According to the canonical decomposition of the critical graph [34, Theorem B1], the domain is a ring domain, which means that for the function
[TABLE]
and some nonzero real constant , the map is a conformal map from to an annulus of positive radii , and with boundary correspondence and . In particular, clearly so and hence . On the other hand, using (2.6) we get also that , a contradiction, thereby concluding the proof. ∎
Lemma 4.4**.**
If there is a trajectory connecting and , then there is a trajectory connecting and .
Proof.
Let be the trajectory connecting and , and and the remaining two trajectories emanating from . The proof will again proceed by contradiction. If we assume that there is no trajectory connecting to , then and have to extend to horizontally on the right-half plane. Using the symmetry on Principle P4, there are only two possibilities left for the critical graph of , depending on whether belongs or not to the domain bounded by and on the right half plane. These two possibilities are displayed in Figure 7.
In either of the two situations, we consider the domain on the critical graph uniquely determined by the condition that . This domain is also represented in Figure 4.4. Applying (4.1) to , we see that in the situation represented in Figure 7-left, we have
[TABLE]
whereas on the situation depicted in Figure 7-right,
[TABLE]
Hence, neither of these situations can happen, concluding the contradiction argument and the proof. ∎
Lemma 4.5**.**
There is a trajectory connecting and .
Proof.
Again to get to a contradiction, suppose there is no such trajectory. By Lemma 4.2 there has to be a trajectory connecting and , and then by Lemma 4.3 and Principle P3, the other two trajectories and stay on the right half plane and have to extend to with angle [math].
These trajectories and determine a simply connected domain on the right half plane, and this domain does not contain . Hence, applying (4.1) to this domain, we arrive at
[TABLE]
and thus must contain the only pole on the right half plane. This means that the critical graph is as depicted in Figure 8.
We continue focusing on the domain . According to the canonical decomposition of the critical graph [34, Theorem B1], this domain is a strip domain, which means that for some branch of the square root, the function
[TABLE]
is a conformal map from to a strip of the form
[TABLE]
and extends continuously to the boundary of , hence mapping and to distinct connected components of the strip .
Clearly, and because of the boundary correspondence just explained we must then have . However, using (2.6) we actually see that , a contradiction. The proof is complete. ∎
Proof of Theorem 4.1.
The symmetry under reflection is nothing but Principle P4.
A combination of Lemmas 4.4 and 4.5 immediately yield (i) and (ii). From Lemma 4.3 we see that the remaining trajectory emanating from , say , has to stay on the right half plane, so it has to extend to with angle [math]. This concludes the proof of (iii). ∎
In principle, the trajectory in part (iii) of Theorem 4.1 could extend to going below , which would result on the critical graph displayed in Figure 9, left (that we call case (i)), in contrast with Figure 9, right (that we call case (ii)). We now justify why case (ii) instead of (i) takes place, which corresponds exactly with the numerical outputs in Figure 4.
In either case, let be the branch of the square root defined by the asymptotics (2.2) and with branch cut being
[TABLE]
where is the reflection of onto the imaginary axis, see Figure 9. We orient this branch cut from to . In either situation in Figure 9, consider the domain bounded by , with being the reflection of onto the imaginary axis. In other words, in case (i) is the domain “above” the critical graph, and in case (ii) it is the domain “below” the critical graph, see Figure 9.
From the general theory, we know that the function
[TABLE]
is a conformal map from to either the left or the right half plane. By looking at the asymptotics (2.2), we see that
[TABLE]
so when along we must either have that (in case (i)) or (in case (ii)). This means that the image is either the right or left half plane, corresponding to cases (i) or (ii), respectively.
By boundary correspondence, we must then have in case (i) and in case (ii), which implies that and , respectively. But from (3.6) we know that , so case (ii) has to be taking place.
To conclude this section, we now prove Theorem 2.2 and the first part of Theorem 2.3, concerning the construction of .
Proof of Theorem 2.2.
Set as the trajectory as labeled in Figure 9, right, and to be its reflection onto the imaginary axis. Then (2.7)–(2.8) hold by the definition of a critical trajectory. The uniqueness follows by the uniqueness of the critical graph of , and the fact that is the only trajectory connecting and . ∎
For the rest of the paper, we now use the branch cut structure along , as discussed right after the statement of Theorem 2.2.
Proof of Theorem 2.3.
By the definition of and as trajectories, we know that is a real measure. Also, because its density does not vanish on each of the arcs, we also know that cannot change sign in each of these arcs. From (3.6),
[TABLE]
so has to be positive along . By symmetry (see for instance Proposition 3.1), so has to be a probability measure.
To show that the shifted Cauchy transform satisfies the algebraic equation, we use that along to write
[TABLE]
where is a bounded contour that encircles in the clockwise direction and does not encircle . Using (2.2) to compute residues,
[TABLE]
which is equivalent to (2.1). ∎
5. Asymptotic Analysis - Part I
The goal of this section is to introduce the Fokas-Its-Kitaev Riemann-Hilbert formulation [24] of the kissing polynomials, and to start the implementation of the Deift-Zhou nonlinear steepest descent analysis [22, 23], which will allow us to eventually provide uniform asymptotics of the kissing polynomials. For convenience, we will use the notation
[TABLE]
Define a contour , oriented as in Figure 10, where and are as in Theorem 2.2. The contour connects to and lies entirely within the sector determined by the trajectories of which is above the trajectory , see Figure 10.
The Riemann-Hilbert problem for the kissing polynomials is formulated as follows. We seek a matrix function such that
[TABLE]
Here, is the third Pauli matrix and is as in (1.4).
By the now standard theory, it follows that the solution to this problem, if it exists, is unique. The existence of is equivalent to the existence of the kissing polynomial and, furthermore, if is finite and non-zero then is explicitly given by
[TABLE]
where is the normalizing constant for , obtained via
[TABLE]
In (5.2), denotes the Cauchy transform of the function along , i.e.
[TABLE]
which is analytic in .
The Deift-Zhou steepest descent method consists of finding a sequence of explicit and invertible transformations
[TABLE]
so that, at the end of the day, satisfies a new Riemann-Hilbert problem. This new Riemann-Hilbert problem should have jumps which decay to the identity as , and solutions to this RHP should also decay to the identity as . In this case, can be obtained asymptotically as , with explicit control over error terms. By tracing back all the transformations, we can extract asymptotics for .
There is now a vast literature on this asymptotic method, many of which are very similar to our present situation [21, 23, 18]. In our case, the only nonstandard construction is in the so-called global parametrix, so we will only very briefly discuss the other steps, and provide more details in the construction of this global parametrix.
5.1. First Transformations
From now on, we fix the branch of to be the one with cuts on and , as explained after Theorem 2.2, and define as in (2.10), where the path of integration connects to without crossing . This function satisfies
[TABLE]
and also the inequality
[TABLE]
is valid in the immediate vicinity of any subarc of that does not contain their endpoints.
Recall also the complex constant determined via the expansion (2.11). The first transformation, which aims to normalize at , reads
[TABLE]
With , is analytic on , verifies the asymptotics as and satisfies the jump along , with a jump matrix that can be computed explicitly from .
The second transformation is referred to in the literature as the opening of the lenses. Define , with as in Figure 11, making sure that remains symmetric with respect to . Then we open lenses in the standard way,
[TABLE]
Then, is analytic on , verifies as , and satisfies the jump along , with
[TABLE]
From the inequalities in (5.3)–(5.4) we learn that many of these jumps are exponentially decaying. We expect that as , the matrix will converge to the solution of a model Riemann-Hilbert problem which is obtained by dropping these exponentially decaying terms of . This idea is made rigorous in the next sections.
6. Construction of the Global Parametrix
When we drop the exponentially decaying terms in (5.7), we arrive at the following model Riemann-Hilbert Problem:
[TABLE]
In the Riemann-Hilbert problem above, we also require that has at worst fourth root singularities at the endpoints of , and the jump matrix is explicitly given by
[TABLE]
The model RHP above differs from the standard RHP that one usually encounters when solving problems related to the asymptotics of orthogonal polynomials in that the jumps across the different cuts are different and have entries with nonzero imaginary component.
We will address these issues in the remainder of this section, and for sake of clarity we split this construction into four steps.
The first step is standard, and consists of building a solution to the particular RHP obtained from by setting . The resulting RHP is of the form one typically encounters when attempting to construct the global parametrix for orthogonal polynomials with positive weights on the real line, and yields a matrix function .
In the second step, we start from an ansatz on how to modify the entries of so as to obtain the required . This ansatz turns out to produce a system of scalar Riemann-Hilbert problems.
In the third step, we construct the solutions to these scalar Riemann-Hilbert problems in a somewhat explicit way, with the help of meromorphic differentials on the associated Riemann surface. This can be accomplished for generic values of and and is split into two sections. Our ideas are much inspired from [30].
In the fourth and final step we analyze this non-degeneracy condition on and , showing that the construction is valid as long as either is even or is odd and is not on the exceptional set mentioned in the Introduction.
6.1. Step One: Construction of Simplified Parametrix
We first set in (6.2) and so consider the following RHP:
[TABLE]
The solution to (6.3) is well known (see for instance [15]), and is given by
[TABLE]
where
[TABLE]
with branch cuts on and and the branch of the root chosen so that
[TABLE]
It is important to understand the location of the zeros of , as they will give us an extra degree of freedom when we later modify .
Proposition 6.1**.**
Let
[TABLE]
Then
[TABLE]
and this is the only finite zero of . In particular, the equation
[TABLE]
has no finite solutions.
Proof.
First note that the solutions to are the solutions to
[TABLE]
This equation has exactly one finite solution given by
[TABLE]
In other words, either or , and we will now show that only the former takes place. From (3.5), we have that
[TABLE]
As we normalized the branch of at infinity as in (6.6), we have that for large enough
[TABLE]
In words, the function is a continuous function of both and , and we know that if is large enough, will be large enough, and in this situation we have that is close to . In particular, it cannot be close to , and as we know that is either , we can conclude that for large enough. However, again using continuity in , we have that for all , and not just for large enough. Then,
[TABLE]
concluding the proof. ∎
6.2. Step Two: Ansatz for the Global Parametrix and Related Scalar RHP’s
We search in the form
[TABLE]
where and are nonzero constants, the functions are yet to be determined, and the notation indicates the -entry of the matrix .
Comparing the RHPs for and , we arrive at the following desired properties for :
- (1)
If , is analytic on . 2. (2)
If , is analytic on , where the singularity at is a simple pole. 3. (3)
The have the following jumps over ,
[TABLE] 4. (4)
When ,
[TABLE]
for some nonzero constant . 5. (5)
If , then
[TABLE] 6. (6)
The functions remain bounded at the endpoints of .
A more rigorous statement of this approach is established in the next result.
Proposition 6.2**.**
If the functions satisfy the conditions (1)–(6) above, then the solution to the RHP (6.1) is given by the formula (6.8)
Proof.
The condition (1) for , together with (6.3a) imply immediately that and are analytic on . Having in mind condition (2) and Proposition 6.1, we see that for the simple pole of at cancels with the zero of , so the off-diagonal entries of are also analytic on . Condition 6.1a is thus verified.
To verify the appropriate jump conditions, note that for , we use the jumps for to get
[TABLE]
This is the same as (6.1b) along . The jumps over and can be verified in the same manner. The normalization of at follows from (6.10) and (6.3c). Finally, because the ’s are bounded near the endpoints of , the behavior of near the endpoints of is governed by that of , and as such, has at worst fourth-root singularities. ∎
Therefore, we are left to construct the functions , which is accomplished in the remainder of this section.
6.3. Construction of the Meromorphic Differentials
Let be the genus Riemann surface associated to the algebraic equation (2.5). More concretely, this surface is obtained as the closure of the surface that we get when gluing the two copies
[TABLE]
along in the usual crosswise manner. On , the global meromorphic solution to the equation (2.5) is well defined by {\left.\kern-1.2pt\xi\vphantom{\big{|}}\right|_{\mathcal{Q}_{j}}}=\xi_{j}, where is the analytic branch of on uniquely determined by the asymptotics
[TABLE]
In other words, is the branch as in (2.2) and . For notational convenience, we denote by the copy of the point which is on the sheet . This is well defined as long as does not belong to any of the branch cuts and , which is enough for our purposes.
In addition, the canonical homology basis on is chosen as depicted in Figure 12.
To construct the functions from the previous section, we will use meromorphic differentials on the Riemann surface . As mentioned in the Introduction, this construction is inspired by a similar construction by Kuijlaars and Mo [30], but here we exploit the symmetry with respect to the imaginary axis in a very explicit way, which also leads to more explicit formulas when compared to [30].
The differential
[TABLE]
linearly generates the space of holomorphic differentials on . For later convenience, for a positive integer we denote
[TABLE]
Because is, up to a multiplicative constant, the only holomorphic differential on , the Riemann bilinear relations imply that and are nonzero. Also, symmetry (see for instance the Appendix A) gives
[TABLE]
For and , define a meromorphic differential by the formula
[TABLE]
Then the only poles of are , and , which are all simple, and
[TABLE]
Also, a calculation using symmetry and residues shows that
[TABLE]
Finally, for and , , set
[TABLE]
where is as in Proposition 6.1.
Proposition 6.3**.**
If and , then is holomorphic. Otherwise, the differential has simple poles at and with residues and , respectively, and no other poles. Furthermore, in either case
[TABLE]
Proof.
Follow immediately from the properties of and . ∎
Moving forward, define by
[TABLE]
Clearly is a linear function of . Furthermore, as the -cycle can be chosen to not intersect , is actually a real analytic function of as well. Thus, the level set determined by is actually the graph of a real analytic function , with
[TABLE]
Having in mind Proposition 6.3, we next consider the function given by
[TABLE]
For the integration above, we consider the cycle to be given by straight line segments on and with endpoints and . This way, in principle, is well defined for and also for in case . However, because the residue of at is we actually get that remains well defined and continuous, as a function with values on , when . Also, when , we immediately see that as , and a simple calculation shows that remains continuous with , and reduces to the null meromorphic differential.
In conclusion, is a continuous function from to .
Proposition 6.4**.**
The function is injective.
Proof.
Take two values and for which . This means that the -period of the difference vanishes. Also, having in mind the definition of and Proposition 6.3, we get that its -period vanishes as well.
To get to a contradiction, assume that . Then has residues and at and . Hence, for a fixed base point , the function
[TABLE]
is a well-defined meromorphic function on with only one pole, namely at , and nonzero residue. But since the residues of any meromorphic function have to add to [math], this is not possible. ∎
We also need to compute the limit of as . To do so, first notice that and do not depend on . To analyze , we use (2.2) to derive the asymptotics
[TABLE]
which is valid with uniform error term for in compacts. With this, in turn, implies that
[TABLE]
with the -sign for and -sign for . Thus,
[TABLE]
and then
[TABLE]
From the symmetries (6.13)–(6.14), the right-hand side of the above formula is purely imaginary, so defining through
[TABLE]
this constant is purely real and explicitly given by
[TABLE]
We emphasize that depends on , , and obviously , but not on .
As a consequence of Proposition 6.4, we see that is a bijection between and an interval of the form . As such, this means that for any we can always choose so that the -period of equals . We summarize the findings of this section as the next result.
Proposition 6.5**.**
For , , and , , with in case , the meromorphic differential in (6.15) has simple poles at and with residues and , respectively, and is elsewhere holomorphic.
Furthermore, if is such that , then there exist unique and for which
[TABLE]
where these identities are understood modulo .
6.4. Step Three: Solving the Scalar RHP’s
When the conditions
[TABLE]
take place, the matrix becomes a solution to the model RHP (6.1), so during this section we can assume the degeneration (6.18) does not occur.
We will now use the meromorphic differential as described in the previous section for a special choice of periods, whose existence will be guaranteed by Proposition 6.5. To do so, for and define numbers by
[TABLE]
The definition of and as above is chosen so as to place the poles of
[TABLE]
in very specific positions. When is even, the poles and are on the same sheet , whereas when is odd the pole is on the sheet and the pole is on the other sheet . Obviously, in these comments we identified .
We now choose and in (6.20) in a very specific way which is formally introduced as the next result.
Corollary 6.6**.**
Fix and . Let and be as above and and be as in (2.9) and (6.17), respectively. Suppose that . Then there exists a meromorphic differential with the following properties.
- (i)
The only poles of , which are simple, are at as in (6.7) and at another point , with
[TABLE] 2. (ii)
The periods of are
[TABLE]
where these identities are understood modulo .
Proof.
It is a consequence of Propositions 6.3 and 6.5. We should also remark that because we are assuming (6.18) does not occur, the poles and never coincide, that is, the degeneration and in Propositions 6.3 and 6.5 never takes place. ∎
Set . For define
[TABLE]
The path of integration always stays on the first sheet and is defined as follows. For lying above , the path of integration connects to without crossing , except of course at the initial point . For lying below , the path of integration emanates upwards from and moves to the region below crossing the interval . The path then remains below until reaching .
Next, for we define
[TABLE]
The path of integration for is entirely in and specified as follows. For lying below , the path of integration connects to on the second sheet without crossing , except at . For lying above , the path of integration emanates downwards from and moves to the region above across the interval . The path then remains above until meeting .
Intuitively, one can think of the path of integration for as the mirror image on the other sheet of the path used for . Also, because the residues of are , these functions are well-defined analytic functions modulo .
The main properties of are collected in the next result, where all equalities are understood modulo .
Proposition 6.7**.**
- (a)
The functions , , verify the following jumps for .
- (i)
For ,
[TABLE] 2. (ii)
For , ,
[TABLE] 3. (iii)
For ,
[TABLE] 2. (b)
For some constants the asymptotic behavior
[TABLE]
holds. 3. (c)
Furthermore, the function is analytic near , whereas when
[TABLE] 4. (d)
Finally, the behavior near is as follows.
For even, the function is analytic near , whereas for
[TABLE] 2.
For odd, when the function is analytic near , whereas
[TABLE]
Proof.
First let . Then
[TABLE]
where is a clockwise loop on the first sheet of surrounding both and . By transferring this loop to infinity, we have that
[TABLE]
The deformation of to infinity may pick up residue contributions from the poles and depending on their locations, but as all residues are , this contribution will only contribute a factor of .
Now let . Then,
[TABLE]
where now is contractible within , so that (6.24) holds for . In a similar fashion we compute (6.24) for .
Next, take . In this case,
[TABLE]
where can be deformed to the cycle , so this integral can be computed using (6.21) and yields 6.25 for . The case , as well as , follow analogously.
For the final jump, take . Then
[TABLE]
and this integral is computed using (6.21).
The asymptotic behavior (6.26) follows from the fact that is regular near infinity on the both sheets of .
Next, as has a simple pole of residue at with , we know that
[TABLE]
so upon integration, we have (6.27). A similar argument also provides provides (6.28)–(6.29). ∎
Finally, we define
[TABLE]
and prove our main result of this section.
Theorem 6.8**.**
For and as in (6.17) and (2.9), suppose that . Then the model Riemann-Hilbert problem (6.1) has a unique solution . Its entries satisfy
- (i)
For even, and are never zero, whereas and have a unique zero at . 2. (ii)
For odd, and are never zero, whereas and have a unique zero at .
Proof.
Uniqueness of follows in the standard way for Riemann-Hilbert problems, see for instance [21].
To prove existence, we use as in (6.30) and set as in (6.8). By Proposition 6.2 it is enough to verify that are solutions to the RHP (1)–(6) in (6.2) et seq.. In turn, these scalar RHP conditions follow immediately from Proposition 6.7 (a)–(c), and we skip the details.
Finally, the properties of the zeros of follow from Proposition 6.7–(d). ∎
6.5. Step Four: Analysis of
The whole construction of the global parametrix that ended up with Theorem 6.8 relies on the assumption that . It turns out that we can actually remove this restriction, provided that is even.
Indeed, recall that the meromorphic differential as in (6.20) has a pole at . Assuming that , when we try to match the periods of with the help of the injectivity of in (6.16), what happens is that the pole at moves to . Nevertheless, the meromorphic differential still has a limit, as one can see performing an asymptotic analysis very similar to the ones that led to (6.17). In such a case, becomes the unique differential whose only singularities are simple poles at and , with residues and , respectively.
In this way, we can still define as in (6.22)–(6.23) with a path of integration on the sheet . What will happen now is that when is even and , as the path of integration extends to the pole at , and as such as . This means that now as , which is no problem at all as the behavior (6.11) is still satisfied.
In contrast, when is odd the path of integration for is now the one that extends to the pole at , and consequently vanishes as . In such a case, the condition (6.10) is longer satisfied for a nonzero constant .
We can also verify that the condition occurs only for countably many pairs , if any. Indeed, first notice that depends real-analytically on . Likewise, does not depend on but only (real-analytically) on , and we write . Thus, for any and fixed , the identity
[TABLE]
has at most countably many solutions in , provided is not the constant function. For fixed , a straightforward (but long, so for the sake of simplicity, omitted) calculation shows that
[TABLE]
where , as in (3.5), and a constant , so that is indeed not constant. Now, we fix and define the set as
[TABLE]
By virtue of this discussion, Theorem 6.8 is improved to the following form.
Theorem 6.9**.**
Fix . For even with or odd with and , the model Riemann-Hilbert problem (6.1) has a unique solution . Its diagonal entries satisfy
- (i)
For even, and are never zero. 2. (ii)
For odd, and have a unique zero at which is simple.
Furthermore, the entries of remain bounded on compacts as with even or odd with .
7. Asymptotic Analysis - Part II
In this section we conclude the nonlinear steepest descent analysis.
7.1. Construction of the Local Parametrices
In our analysis, we need to construct four local parametrices, one for each of the endpoints of . At the endpoints and (soft edges) we construct Airy parametrices, whereas at the endpoints and , we construct Bessel parametrices. The construction is now very standard, and for completeness we only give the final form of the solutions near . To construct the other parametrices, we could either proceed analogously or explore the symmetry with respect to the imaginary axis.
7.1.1. Hard Edges
Let be a disc centered at of small radius . We seek a local parametrix, , defined on , which is the solution to the following Riemann-Hilbert problem:
[TABLE]
We will also require that has a continuous extension to and remains bounded as . For as in (2.10), we seek in the form
[TABLE]
where solves a Riemann-Hilbert problem which can be explicitly solved using Bessel functions as in [18, 29]. We describe this solution next.
Set
[TABLE]
where is the modified Bessel function of the first kind, is the modified Bessel function of the second kind, and and are Hankel functions of the first and second kind, respectively. The Bessel parametrix is defined by
[TABLE]
Let being the conformal map
[TABLE]
Recall from (5.3) that
[TABLE]
so that
[TABLE]
so that is analytic in . However, as , we see that the singularity is removable, so that is actually analytic in all of . We see from the definition of in (2.10),
[TABLE]
so that
[TABLE]
As , is indeed a conformal mapping on a neighborhood of 1. With defined as above, the matrix is
[TABLE]
where
[TABLE]
The parametrix in a small neighborhood of the hard edge can be constructed by exploring the symmetry w.r.t. the imaginary axis, which leads to
[TABLE]
7.1.2. Soft Edges
Let be a small disc centered at of radius . We seek a local parametrix, , defined on , which is the solution to the following Riemann-Hilbert problem:
[TABLE]
We also require that has a continuous extension to and remains bounded as . From standard methods, it is natural to seek a solution of the form
[TABLE]
where
[TABLE]
Then the RHP for reduces to a RHP for , which in turn can be solved explicitly using Airy functions in a now standard way. Set ,
[TABLE]
where Ai is the Airy function, and define the Airy parametrix as in [15] by
[TABLE]
Then takes the form
[TABLE]
where is the Airy parametrix as above, is the conformal map given by
[TABLE]
From (7.14), we can write for in a neighborhood ,
[TABLE]
where the cut for is taken on and is analytic in a neighborhood of , with the following Taylor expansion near ,
[TABLE]
and
[TABLE]
From (7.19), we see that has no jumps within , and as , we can conclude the singularity at is again removable. As , we see that is indeed a conformal mapping onto a neighborhood of [math]. The prefactor is
[TABLE]
where Sectors I, II, III, and IV are defined in Figure 13, and
[TABLE]
In the formulas above, all the roots are taken to be the principal branches.
In a similar fashion to the hard edge scenario, we compute the local parametrix in a small neighborhood of via symmetry, which leads to
[TABLE]
7.2. Final Transformation
As the last transformation of the steepest descent method, we define
[TABLE]
Then solves a Riemann-Hilbert problem of the form,
[TABLE]
where the contour is depicted in Figure 14, and the jump matrix that satisfies
[TABLE]
with uniform error terms. The definition of , and of itself, only requires that is even or . The condition that appears here to ensure that the entries of remain bounded as , see Theorem 6.9 above, and consequently ensure that indeed decays to the identity as claimed.
As shown in [15], this is enough to assure that
[TABLE]
uniformly for as with even or with . We are now left to retrace our steps in the transformations of nonlinear steepest descent to obtain the uniform asymptotic formulas for .
8. Asymptotics of the Kissing Polynomials: Discussion on Theorem 2.4
The procedure of recovering asymptotics of the orthogonal polynomials from the nonlinear steepest descent analysis of the associated Riemann-Hilbert problem is now standard, so we omit details below, and instead refer the reader to [15, 18, 21] for detailed analysis. In particular, tracing back all the transformations , we arrive at the identity
[TABLE]
The function is analytic away from and according to Theorem 6.8 either one of or has a zero, depending on the parity of , but not both. We can then use (7.25) to prove the weak convergence claimed by Theorem 2.4, as well as to find the asymptotic formula
[TABLE]
the identity above being valid with uniform error term for on compacts of . This formula is essentially (2.13), but for the sake of completeness we now rewrite in a more explicit form that leads to the formulation (2.13) with the functions and , summarizing our findings in a language that does not require prior knowledge of meromorphic differentials on Riemann surfaces.
In explicit terms, the function in (6.22) can be written as
[TABLE]
where the path of integration emanates from in the upper half-plane and is contained in . Here, is given by (6.7) and the points and are uniquely determined by the requirement that
[TABLE]
and
[TABLE]
where these identities are valid modulo . Such is well defined modulo on , and we write for even and for odd. The function has no singularities on its domain of definition, whereas has a unique singularity at , with behavior as in (6.29). Next, for as in (6.5) we set
[TABLE]
Plugging this back into (8.1) leads to the formulation of Theorem 2.4.
Appendix A Symmetry Relations
The following two technical lemmas in complex analysis were extensively used throughout the text. Their proofs are straightforward.
Lemma A.1**.**
Let be an contour on the left half plane, from to , and be the contour obtained from upon reflection over the imaginary axis, oriented from to .
Suppose that a function satisfies the symmetry relation
[TABLE]
where . Then
[TABLE]
In particular,
[TABLE]
Lemma A.2**.**
Let be a contour symmetric with respect to the imaginary axis and be as in the previous lemma. Then
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] G. Álvarez, L.M. Alonso, and E. Medina. Determination of S-curves with applications to the theory of non-hermitian orthogonal polynomials. Journal of Statistical Mechanics: Theory and Experiment , 2013(06):P 06006, 2013.
- 2[2] G. Álvarez, L.M. Alonso, and E. Medina. Partition functions and the continuum limit in Penner matrix models. Journal of Physics A: Mathematical and Theoretical , 47(31):315205, 2014.
- 3[3] G. Álvarez, L.M. Alonso, and E. Medina. Fine structure in the large n limit of the non-hermitian Penner matrix model. Annals of Physics , 361:440–460, 2015.
- 4[4] A.I. Aptekarev and H. Stahl. Asymptotics of Hermite-Padé polynomials. In Progress in approximation theory , pages 127–167. Springer, 1992.
- 5[5] A.I. Aptekarev and M.L. Yattselev. Padé approximants for functions with branch points—strong asymptotics of Nuttall-Stahl polynomials. Acta Math. , 215(2):217–280, 2015.
- 6[6] A. Asheim, A. Deaño, D. Huybrechs, and H. Wang. A Gaussian quadrature rule for oscillatory integrals on a bounded interval. Discrete Contin. Dyn. Syst. , 34(3):883–901, 2014.
- 7[7] M.J. Atia, A. Martínez-Finkelshtein, P. Martínez-González, and F. Thabet. Quadratic differentials and asymptotics of Laguerre polynomials with varying complex parameters. J. Math. Anal. Appl. , 416(1):52–80, 2014.
- 8[8] F. Balogh, M. Bertola, and T. Bothner. Hankel determinant approach to generalized Vorobev–Yablonski polynomials and their roots. Constructive Approximation , 44(3):417–453, 2016.
