Abstract
The connection between polynomials and entire functions of exponential type is an old one, in some ways harking back to the simple limit
On the left-hand side, we have \(P_{n}\left( \frac{z}{n}\right) \), where \(P_{n}\) is a polynomial of degree n, and on the right, an entire function of exponential type. We discuss the role of this type of scaling limit in a number of topics: Bernstein’s constant for approximation of \(\left| x\right| \); universality limits for random matrices; asymptotics of \(L_{p}\) Christoffel functions and Nikolskii inequalities; and Marcinkiewicz–Zygmund inequalities. Along the way, we mention a number of unsolved problems.
Research supported by NSF grant DMS1362208.
Access provided by CONRICYT-eBooks. Download conference paper PDF
Similar content being viewed by others
Keywords
1 Introduction
The classical limit
plays a role in many areas of mathematics, expressing very simply the scaling limit of a sequence of a polynomials as an entire function of exponential type 1. Recall that an entire function f has exponential type A if for every \(\varepsilon >0\),
and A is the smallest number with this property. Within approximation theory, this connection has long been recognized, perhaps most notably in relating asymptotics of errors of polynomial approximation to errors of approximation by entire functions of exponential type. Indeed, the classical monograph of Timan (see [58] for a translation of the Russian original) presents some of this theory, and this topic continues to be explored to this day, notably in the works of Michael Ganzburg [21, 23]. In this survey, we explore this connection in a number of topics in approximation theory.
A less trivial example than (1) involves Lagrange interpolation at roots of unity. Given \(n\ge 1\), the fundamental polynomials of Lagrange interpolation at the nth roots of unity are
satisfying
Let us fix t and take the scaling limit: As \(n\rightarrow \infty \),
Thus,
where \(\mathbb {S}\) is the classical sinc kernel
If
and for \(n\ge 1\), we let
then one can use (2) to show
where
is entire of exponential type \(\le \pi \), and its restriction to the real line lies in \(L_{2}\left( \mathbb {R}\right) \). The space of all such entire functions with the usual \(L_{2}\) norm on the real line is \(L_{2}\) Paley-Wiener space \({ PW}_{2}\). Its remarkable reproducing kernel \(\mathbb {S}\) plays a role in everything from sampling theory to random matrices, satisfying the orthonormality relation
The reproducing kernel relation is
The paper is organized as follows: in the next section, we discuss approximation of \(\left| x\right| \) by polynomials. Section 3 deals with universality limits for random matrices, Sect. 4 deals with asymptotics of Christoffel functions, Sect. 5 with Nikolskii inequalities, and Sect. 6 deals with Marcinkiewicz–Zygmund inequalities.
2 Bernstein’s Constant in Approximation of \(|\mathbf{{ {x}}}|\)
Let \(f:\left[ -1,1\right] \rightarrow \mathbb {R}\). For \(n\ge 1\), let \(E_{n} \left[ f\right] \) denote the error in best uniform approximation of \( \left| x\right| \) by polynomials of degree \(\le n\), so that
In a 1913 paper [6], S. N. Bernstein established that the error in approximating \(f\left( x\right) =\left| x\right| \) decays exactly like \(\frac{1}{n}\), that is,
exists and is finite and positive. \(\varLambda _{1}\) is often called the Bernstein constant. The proof that the limit exists is long and difficult and is unclear in parts. Twenty-five years later [7], he presented a much simpler proof that works for the more general function \( \left| x\right| ^{\alpha }\) for all \(\alpha >0\) that is not an even integer. It involves dilations of the interval, making essential use of the homogeneity of \(\left| x\right| ^{\alpha }\), namely that for \( \lambda >0\),
This enabled Bernstein to relate the error in approximation on \(\left[ -\lambda ,\lambda \right] \) to that on \(\left[ -1,1\right] \). It also yielded a formulation of the limit as the error in approximation on the whole real axis by entire functions of exponential type, namely
You might ask: what is the connection of all this to scaling limits? Well, Bernstein related the errors of polynomial approximation by polynomials of degree \(\le n\) on \(\left[ -1,1\right] \) and \(\left[ -n,n\right] \). Thus, if we let \(P_{n}^{*}\) denote the unique polynomial of degree \( \le n\) that best approximates \(\left| x\right| ^{\alpha }\) in the uniform norm on \(\left[ -n,n\right] \), Bernstein’s proof essentially involved scaling \(P_{n}^{*}\left( x\right) \) to \(P_{n}^{*}\left( x/n\right) \). Since 0 is the place where \(\left| x\right| ^{\alpha }\) is least smooth, it is not surprising that we scale about 0. One of the classical unsolved problems of approximation theory is
Problem 1
Give an explicit representation for \(\varLambda _{1}\).
Of course, this is a little imprecise, but something such as \(\varLambda _{1}\) is a root of an explicit equation, or given by some explicit series, would be a real achievement. Bernstein obtained upper and lower bounds for \( \varLambda _{1}\), and using these, speculated that possibly
Some 70 years later, this was disproved by Varga and Carpenter [64, 65] using high precision scientific computation. They showed that
They also showed numerically that the normalized error \(2nE_{2n}\left[ \left| x\right| \right] \) should admit an asymptotic expansion in negative powers of n. Further, numerical explorations for approximation of \( \left| x\right| ^{\alpha }\) have been provided by Carpenter and Varga [9].
Bernstein also showed that for \(\alpha >1\), [7], [9, p. 194]
Surprisingly, the much deeper analogous problem of rational approximation has already been solved, by the great Herbert Stahl [54]. He proved, using sophisticated methods of potential theory and other complex analytic tools, that
where \(R_{n}\left[ \left| x\right| \right] \) denotes the error in best \(L_{\infty }\) approximation of \(\left| x\right| \) on \(\left[ -1,1\right] \) by rational functions with numerator and denominator degree \( \le n\). Later [55], he extended this to \(\left| x\right| ^{\alpha }\), establishing
Although \(\varLambda _{\alpha }\) is not known explicitly, the ideas of Bernstein have been refined, and greatly extended. They are covered in the monograph of Timan [58, p. 48 ff.]. M. Ganzburg has shown limit relations of this type for large classes of functions, in one and several variables, even when weighted norms are involved [21,22,23,24]. Nikolskii [46] and Raitsin [48, 49] considered not only uniform, but also \(L_{p}\) norms. They and later Ganzburg [22] showed that for \(1\le p\le \infty \), there exists
More explicitly, Nikolskii [46] proved that at least for odd integers \(\alpha \),
He also established an integral representation valid for all \(\alpha >-1\), and Bernstein later noted that this implies the above series representation for all \(\alpha >-1\). Raitsin [49] proved that for \(\alpha >- \frac{1}{2}\),
These are the only known explicit values of \(\varLambda _{p,\alpha }\). The extremal entire functions associated with these constants were given in explicit form in [25].
Vasiliev [63] extended Bernstein’s results in another direction, replacing the interval \(\left[ -1,1\right] \) by fairly general compact sets E. Totik [62] has put Vasiliev’s results in final form, using sophisticated estimates for harmonic measures. In this more general setting, \(\varLambda _{\alpha }\) still appears, multiplied by a quantity involving the equilibrium density of potential theory for E. The Bernstein constant was discussed in the recent book of Finch on mathematical constants [17, p. 257 ff.] in different areas of mathematics.
Another recent mode of attack on the Bernstein problem involves sophisticated properties of conformal maps of comb domains: instead of approximating directly on \(\left[ -1,1\right] \), one solves the asymptotic problem on the symmetric interval \(\left[ -1,-a\right] \cup \left[ a,1\right] \). Reknowned complex analysts such as Eremenko, Nazarov, Peherstorfer, Volberg, and Yuditskii have been involved in this effort [16, 43]
The author’s own attempts at this problem directly involve scaling limits: as above, let \(P_{n}^{*}\) denote the unique polynomial of degree \(\le n\) that best approximates \(\left| x\right| ^{\alpha }\) in the uniform norm. In [35], we proved a pointwise limit, namely that uniformly in compact subsets of \(\mathbb {C}\),
where \(H_{\alpha }^{*}\) is the unique entire function of exponential type 1 attaining the inf in (4). That paper also contained \(L_{p} \) analogues and implicit integral representations of \(H_{\alpha }^{*}\). Closely related to Problem 1 is:
Problem 2
Give an explicit description of the function \(H_{\alpha }^{*}\).
3 Universality Limits in Random Matrices
Although they have much older roots, the theory of random matrices rose to prominence in the 1950s, when the physicist Eugene Wigner found them an indispensable tool in analyzing scattering theory for neutrons off heavy nuclei. The mathematical context of the unitary case may be briefly described as follows. Let \(\mathscr {M}\left( n\right) \) denote the space of n by n, Hermitian matrices \(M=\left( m_{ij}\right) _{1\le i,j\le n}\). Consider a probability distribution on \(\mathscr {M}\left( n\right) \),
Here, \(w\left( M\right) \) is a function defined on \(\mathscr {M}\left( n\right) \), and c is a normalizing constant. The most important case is
involving the trace tr, for appropriate functions Q defined on \(\mathscr {M} \left( n\right) \). In particular, the choice
leads to the Gaussian unitary ensemble (apart from scaling) that was considered by Wigner. One may identify \(P^{\left( n\right) }\) above with a probability density on the eigenvalues \(x_{1}\le x_{2}\le \cdots \le x_{n} \) of M,
See [10, p. 102 ff.]. Again, c is a normalizing constant.
Orthogonal polynomials enable one to explicitly represent \(P^{\left( n\right) }\) and a number of other statistical quantities. Let \(\mu \) be a finite positive Borel measure with support in the real line, with infinitely many points in the support, and all finite power moments. Define orthonormal polynomials
\(n=0,1,2,\dots \), satisfying the orthonormality conditions
The nth reproducing kernel for \(\mu \) is
and the normalized kernel is
where \(\mu ^{\prime }\) denotes the Radon-Nikodym derivative of \(\mu \).
There is the basic formula for the probability distribution \(P^{\left( n\right) }\) [10, p. 112]:
One may use this to compute a host of statistical quantities—for example, the probability that a fixed number of eigenvalues of a random matrix lie in a given interval. One particularly important quantity is the m-point correlation function for \(M\left( n\right) \) [10, p. 112]:
This last remarkable identity is due to Freeman Dyson.
The universality limit in the bulk asserts that for fixed \(m\ge 2\), \(\xi \) in the interior of the support of \(\mu \), and real \( a_{1},a_{2},\dots ,a_{m}\), we have
Because m is fixed in this limit, this reduces to the case \(m=2\), namely
for real a, b. Thus, an assertion about the distribution of eigenvalues of random matrices has been reduced to a scaling limit involving orthogonal polynomials. The term universal is quite justified: the limit on the right-hand side of (9) is independent of \(\xi \), but more importantly is independent of the underlying measure. Since in many cases,
where \(\omega \) is an appropriate “equilibrium density”, we can also often recast (9) as
For example, if \(\mu ^{\prime }>0\) is positive a.e. in \(\left( -1,1\right) \),
the ubiquitous arcsine distribution.
Typically, the limit (9) is established uniformly for a, b in compact subsets of the real line, but if we remove the normalization from the outer \(K_{n}\), we can also establish its validity for complex a, b, that is,
There are a variety of methods to establish (9–11). Perhaps the deepest methods are the Riemann-Hilbert methods, which yield far more than universality. See [5, 10,11,12, 27,28,29, 42] for Riemann-Hilbert references.
Inspired by the 60th birthday conference for Percy Deift, the author came up with a new comparison method to establish universality. Let \(\mu \) be a measure supported on \(\left( -1,1\right) \), and assume for example that \(\mu ^{\prime }>0\) a.e. in \(\left( -1,1\right) \). Let \(\mu \) be absolutely continuous in a neighborhood of some given \(\xi \in \left( -1,1\right) \) and assume that \(\mu ^{\prime }\) is positive and continuous at \(\xi \). Then, in [38] we established (10). This result was soon extended to a far more general setting by Findley, Simon, and Totik [18, 51, 52, 60, 61]. In particular, when \(\mu \) is a measure with compact support that is regular, and \(\log \mu ^{\prime }\) is integrable in a subinterval of the support \(\left( c,d\right) \), then Totik established that the universality (10) holds a.e. in \(\left( c,d\right) \). Totik used the method of polynomial pullbacks to go first from one to finitely many intervals, and then used the latter to approximate general compact sets. In contrast, Simon used the theory of Jost functions.
The drawback of this comparison method is that it requires regularity of the measure \(\mu \). Although the latter is a weak global condition, it is nevertheless most probably an unnecessary restriction. To circumvent this, the author developed a different method, based on tools of classical complex analysis, such as normal families, and the theory of entire functions of exponential type. In [39], this was used to show that universality holds in linear Lebesgue measure, meas, without any local or global conditions, in the set
Theorem 1
Let \(\mu \) be a measure with compact support and with infinitely many points in the support. Let \(\varepsilon >0\) and \(r>0\). Then
The method of proof of this result is instructive, because it contains ideas often used in establishing scaling limits:
Step 1. Let
a polynomial in u, v. For \(R>0\) and “most” \(\xi \), one can use tools such as the Bernstein-Walsh growth lemma to show that for \(n\ge n_{0}\left( R\right) \) and \(\left| u\right| ,\left| v\right| \le R\),
Here, \(C_{1}\) and \(C_{2}\) are independent of n, u, v.
Step 2. The uniform boundedness in (13) allows us to choose a subsequence \(\left\{ f_{n}\right\} _{n\in S}\) that converges uniformly for u, v in compact subsets of the plane to an entire function f satisfying the bound
Thus, f is of exponential type in each variable.
Step 3. Inasmuch as each \(K_{n}\) is a reproducing kernel for polynomials of degree \(\le n-1\), one expects its subsequential limit f to be a reproducing kernel for some space of functions. Indeed, it is, and this is the hard part: to show that f is a reproducing kernel for Paley-Wiener space PW. As reproducing kernels are unique, it follows that
Since the limit is independent of the subsequence, we have the result for the full sequence.
It is unlikely that convergence in measure in (12) can be replaced by convergence a.e., but nevertheless we pose:
Problem 3
Does universality hold a.e. in \(\left\{ \mu ^{\prime }>0\right\} ?\)
We emphasize that this is a tiny slice of a major topic. At the endpoints of compactly supported \(\mu \) (the “edge of the spectrum”), one scales not with x / n but with \(x/n^{2}\) and the limiting kernel is a Bessel kernel. For moving boundaries, one scales with \(x/n^{2/3}\) and the limiting kernel is an Airy kernel. Other kernels arise when there are jump or other discontinuities, and there are several other more complex scaling limits associated with other universality limits. See, for example, [1,2,3,4, 15, 19, 20, 27, 31, 37, 57].
4 \(L_{p}\) Christoffel Functions
Let \(\mu \) denote a finite positive Borel measure on \(\left[ -1,1\right] \). Its \(L_{2}\) Christoffel function is
If \(\left\{ p_{j}\right\} \) are the orthonormal polynomials for \(\mu \), then it follows from Cauchy-Schwarz’ inequality and orthogonality that
while a minimizing polynomial for a given x is
From these formulas, it is fairly clear why \(\lambda _{n}\left( \mu ,x\right) \) is useful: bounds on \(\lambda _{n}\) are essentially bounds on averages of the orthonormal polynomials. Moreover, the extremal or variational property (14) allows comparison of \(\lambda _{n}\) for different measures.
As is often the case with orthogonal polynomials, it is easier first to start on the unit circle and then later map to \(\left[ -1,1\right] \). Accordingly, let \(\omega \) denote a finite positive Borel measure on the unit circle, or equivalently \(\left[ -\pi ,\pi \right] \). Its \(L_{2}\) Christoffel function is
and yes again, there is a connection to orthogonal polynomials on the unit circle.
Asymptotics of Christoffel functions have been studied for a very long time. Paul Nevai’s 1986 ode to them [45] is still very relevant, while Barry Simon’s books [50, 53] contain the most recent research. In a breakthrough 1991 paper, Maté, Nevai, and Totik [41] proved that when \(\omega \) is regular and satisfies in some subinterval I of \(\left[ -\pi ,\pi \right] \)
then for a.e. \(\theta \in I\),
Here, \(\omega \) is regular if
A sufficient condition for regularity, the so-called Erdős-Turán condition, is that \(\omega ^{\prime }>0\) a.e. in \(\left[ -\pi ,\pi \right] \). However, there are pure jump measures, and pure singularly continuous measures that are regular [56].
That 1991 paper of Maté, Nevai, and Totik also addresses measures on \( \left[ -1,1\right] \). If \(\mu \) is regular on \(\left[ -1,1\right] \) and satisfies on some subinterval I,
then
for a.e. \(x\in I\). Totik subsequently extended this to measures \(\mu \) with arbitrary compact support [59].
The extension of Christoffel functions from \(L_{2}\) to \(L_{p}\) also goes back a long way—in some contexts, back to Szegő. For \(\omega \) as above, define its \(L_{p}\) Christoffel function
By a compactness argument, there is a polynomial \(P_{n,p,z}^{*}\) of degree \(\le n-1\) with \(P_{n,p,z}^{*}\left( z\right) =1\) and
When \(p\ge 1\), this polynomial is unique.
The classical Szegő theory provides asymptotics for \(\lambda _{n,p}\left( \omega ,z\right) \) when \(\left| z\right| <1\). For example, if \(\omega \) is absolutely continuous, then [50, p. 153] for \(\left| z\right| <1\),
Here, \(H^{\infty }\) is the usual Hardy space for the unit disk. Moreover, for general measures, there is an alternative expression involving the Poisson kernel for the unit disk [50, p. 154].
On the unit circle, and for measures on \(\left[ -1,1\right] \), bounds for \( L_{p}\) Christoffel functions have been known for a long time, notably those in Paul Nevai’s landmark memoir [44]. However, limits for \(L_{p}\) Christoffel functions on the circle or interval, were first established by Eli Levin and the author [33]. The asymptotic involves an extremal problem for the \(L_{p}\) Paley-Wiener space \({ PW}_{p}\). This is the set of all entire functions f of exponential type at most \(\pi \), whose restriction to the real lies in \(L_{p}\left( \mathbb {R}\right) \). We define
Moreover, we let \(f_{p}^{*}\in { PW}_{p}\) be a function attaining the infimum in (19), so that \(f_{p}^{*}\left( 0\right) =1\) and
When \(p\ge 1\), \(f_{p}^{*}\) is unique. For \(p<1\), uniqueness is apparently unresolved. For \(p>1\), we may give an alternate formulation:
where the inf is taken over all \(\left\{ c_{j}\right\} \in \ell _{p}\), that is, over all \(\left\{ c_{j}\right\} \) satisfying
When \(p=2\), the orthonormality of the integer translates \(\left\{ \mathbb {S} \left( t-j\right) \right\} \) shows that \(f_{2}^{*}=\mathbb {S}\), and
The precise value of \(\mathscr {E}_{p}\) is apparently not known for \(p\ne 2\). The estimate
goes back to 1949, to Korevaar’s thesis [8, p. 102], [26].
We proved [33]:
Theorem 2
Let \(p>0\), let \(\omega \) be a finite positive measure supported on the unit circle, and assume that \(\omega \) is regular. Let \(\left| z_{0}\right| =1\), and assume that \(z_{0}\) is a Lebesgue point of \(\omega \), while the derivative \(\omega ^{\prime }\) of the absolutely continuous part of \(\omega \) is lower semi-continuous at \(z_{0}\).
-
(a)
Then
$$\begin{aligned} \lim _{n\rightarrow \infty }n\lambda _{n,p}\left( \omega ,z_{0}\right) =2\pi \mathscr {E}_{p}\omega ^{\prime }\left( z_{0}\right) . \end{aligned}$$(22) -
(b)
If also \(\omega ^{\prime }\left( z_{0}\right) >0\) and \(p>1\), we have
$$\begin{aligned} \lim _{n\rightarrow \infty }P_{n,p,z_{0}}^{*}\left( z_{0}e^{2\pi iz/n}\right) =e^{i\pi z}f_{p}^{*}\left( z\right) , \end{aligned}$$(23)uniformly for z in compact subsets of the plane.
The proof of this theorem very heavily depends on scaling limits. Here are some ideas when \(p>1\), when \(\omega \) is Lebesgue measure on the unit circle and when \(z_{0}=1\): fix any \(f\in { PW}_{p}\) with \(f\left( 0\right) =1\). It admits the expansion
that converges locally uniformly in the plane. This allows us to construct polynomials along the lines in the introduction: fix \(m\ge 1\) and let
Here \(\left\{ \ell _{jn}\right\} \) are the fundamental polynomials of Lagrange interpolation at the roots of unity, as in Sect. 1. Since \(S_{n}\left( 1\right) =f\left( 0\right) =1\), we have
Here, for each \(r>0\), the limit (3) shows
We estimate the tails of both sides, let \(r\rightarrow \infty \), and deduce that
Next, we let \(m\rightarrow \infty \), and obtain
As we may choose any \(f\in L_{\pi }^{p}\), with \(f\left( 0\right) =1\), we obtain
The converse inequality is more difficult, but also involves scaling limits.
There are also analogous results on \(\left[ -1,1\right] \). Let \(\mu \) be a finite positive measure with support \(\left[ -1,1\right] \). It was probably Paul Nevai, who first systematically studied for measures on \(\left[ -1,1 \right] \), the general \(L_{p}\) Christoffel function
in his 1979 memoir [44]. It was useful in establishing Bernstein and Nikolskii inequalities, in estimating quadrature sums, and in studying convergence of Lagrange interpolation and orthogonal expansions. Let \( P_{n,p,\xi }^{*}\) denote a polynomial of degree \(\le n-1\) with \( P_{n,p,\xi }^{*}\left( \xi \right) =1\), that attains the inf in (25).
Let us say that \(\mu \) is regular on \(\left[ -1,1\right] \), or just regular, if
As for the unit circle, a simple sufficient condition for regularity is that \(\mu ^{\prime }>0\) a.e. in \(\left[ -1,1\right] \), although it is far from necessary. We proved [33]:
Theorem 3
Let \(p>0\), and let \(\mu \) be a finite positive measure supported on \(\left[ -1,1\right] \), and assume that \(\mu \) is regular. Let \(\xi \in \left( -1,1\right) \) be a Lebesgue point of \(\mu \), and let the derivative of its absolutely continuous part \(\mu ^{\prime }\) be lower semi-continuous at \(\xi \).
-
(a)
Then
$$\begin{aligned} \lim _{n\rightarrow \infty }n\lambda _{n,p}\left( \mu ,\xi \right) =\pi \sqrt{ 1-\xi ^{2}}\mathscr {E}_{p}\mu ^{\prime }\left( \xi \right) . \end{aligned}$$ -
(b)
If also \(\mu ^{\prime }\left( \xi \right) >0\) and \(p>1 \), we have
$$\begin{aligned} \lim _{n\rightarrow \infty }P_{n,p,\xi }^{*}\left( \xi +\frac{\pi \sqrt{ 1-\xi ^{2}}z}{n}\right) =f_{p}^{*}\left( z\right) , \end{aligned}$$(26)uniformly for z in compact subsets of the plane, where \(f_{p}^{*}\) is the function attaining the inf in (19).
Observe that for both the unit circle and \(\left[ -1,1\right] \), the only difference between the \(L_{2}\) and \(L_{p}\) asymptotics is the constant \( \mathscr {E}_{p}\). This suggests:
Problem 4
Evaluate \(\mathscr {E}_{p}\), or at least estimate it, for \( p\ne 2\).
Problem 5
Characterize the entire function \(f_{p}^{*}\) attaining the inf in (19).
5 Nikolskii Inequalities
Nikolskii inequalities compare the norms of polynomials in different \(L_{p}\) spaces. Accordingly, define
and
The simplest Nikolskii inequalities assert that given \(q>p>0\), there exists C depending on p, q, such that for \(n\ge 1\) and polynomials P of degree \(\le n\),
They are useful in studying convergence of orthonormal expansions and Lagrange interpolation, and in analyzing quadrature and discretization of integrals. A proof for trigonometric polynomials, which includes this case, appears in [13, Theorem 2.6, p. 102]. The converse sharp inequality, namely
follows from Hölder’s inequality. It is a longstanding problem to determine the sharp constant in (27). Accordingly define
Our results from the previous section resolve the case \(q=\infty \): as \( n\rightarrow \infty \),
This suggests a generalization that might work for Nikolskii inequalities. Define
Using precisely the sort of scaling limits discussed in the introduction, and in the previous section, Eli Levin and I proved [32] that if \(q>p>0\), then
Despite repeated attempts, we were unable to prove the limit. Accordingly, we pose:
Problem 6
Prove
Problem 7
Characterize, or describe, the entire functions attaining the inf in \(\mathscr {E}_{p,q}\).
6 Marcinkiewicz–Zygmund Inequalities
The Plancherel-Polya inequalities [30, p. 152] assert that for \( 1<p<\infty \), and entire functions f of exponential type at most \(\pi \),
provided the integral in the middle is finite. For \(0<p\le 1\), the left-hand inequality is still true, but the right-hand inequality requires additional restrictions [8, 47]. Here, \( A_{p}\) and \(B_{p}\) are independent of f. The Marcinkiewicz–Zygmund inequalities assert [66, Vol. II, p. 30] that for \(p>1,n\ge 1\), and polynomials P of degree \(\le n-1\),
Here too, \(A_{p}^{\prime }\) and \(B_{p}^{\prime }\) are independent of n and P, and the left-hand inequality is also true for \(0<p\le 1\) [34]. We assume that \(A_{p},B_{p},A_{p}^{\prime },B_{p}^{\prime } \) are the sharp constants, so that \(A_{p}\) and \(A_{p}^{\prime }\) are as large as possible, while \(B_{p}\) and \(B_{p}^{\prime }\) are as small as possible. These inequalities are useful in studying convergence of Fourier series, Lagrange interpolation, in number theory, and weighted approximation. See [14, 34, 35]. Of course if \(p=2\), then \(A_{2}=B_{2}=A_{2}^{\prime }=B_{2}^{\prime }=1\).
In [40], I proved that the sharp constants in (32) and (33) are the same:
Theorem 4
For \(0<p<\infty \),
and for \(1<p<\infty \),
Moreover if \(p\ne 2\), then \(A_{p}<1<B_{p}\).
In [8, p. 101, Thm. 6.7.15], it is proven that \(A_{p}\ge \frac{ \pi }{4e^{\pi \pi /2}}\) (this was recorded incorrectly in [40]).
Problem 8
Evaluate or estimate \(A_{p}\) and \(B_{p}\).
References
G. Akemann, J. Baik, P. Di Francesco (eds.), The Oxford Handbook of Random Matrix Theory (Oxford University Press, Oxford, 2011)
G. Anderson, A. Guionnet, O. Zeitouni, An Introduction to Random Matrices, Cambridge Studies in Advanced Mathematics, 118 (Cambridge University Press, Cambridge, 2010)
J. Baik, T. Kriecherbauer, K. McLaughlin, P. Miller, Uniform Asymptotics for Polynomials Orthogonal with Respect to a General Class of Discrete Weights and Universality Results for Associated Ensembles. Annals of Math. Studies, vol. 164 (Princeton University Press, Princeton, 2007)
J. Baik, L. Li, T. Kriecherbauer, K. McLaughlin, C. Tomei, Proceedings of the Conference on Integrable Systems, Random Matrices and Applications. Contemporary Mathematics, vol. 458 (American Mathematical Society, Providence, 2008)
P. Bleher, A. Its, Random Matrix Models and their Applications (Cambridge University Press, Cambridge, 2001)
S.N. Bernstein, Sur la meilleure approximation de \(\left|x\right|\) par des polynômes de degré donnés. Acta Math. 37, 1–57 (1913)
S.N. Bernstein, Sur la meilleure approximation de \(\left|x\right|^{p}\) par des polynô mes de degrés très élevés. Bull. Acad. Sc. USSR, Ser. Math., 2 181–190 (1938)
R.P. Boas, Entire Functions (Academic Press, New York, 1954)
A.J. Carpenter, R.S. Varga, Some Numerical Results on Best Uniform Polynomial Approximation of \(x^{\alpha }\) on \(\left[0,1\right] \). Springer Lecture Notes in Mathematics, vol. 1550 (1993), pp. 192–222
P. Deift, Orthogonal Polynomials and Random Matrices: A Riemann-Hilbert Approach, Courant Institute Lecture Notes, vol. 3 (New York University Press, New York, 1999)
P. Deift, D. Gioev, Random Matrix Theory: Invariant Ensembles and Universality, Courant Institute Lecture Notes, vol. 18 (New York University Press, New York, 2009)
P. Deift, T. Kriecherbauer, K. McLaughlin, S. Venakides, X. Zhou, Uniform Asymptotics for Polynomials Orthogonal with respect to Varying Exponential Weights and Applications to Universality Questions in Random Matrix Theory. Communications on Pure and Applied Mathematics, vol. L11 (1999), pp. 1335–1425
R. DeVore G. Lorentz, Constructive Approximation, vol. 1 (Springer, Berlin, 1993)
F. Filbir, H.N. Mhaskar, Marcinkiewicz-Zygmund measures on manifolds. J. Complex. 27, 568–596 (2011)
L. Erdős, Universality of Wigner random matrices: a survey of recent results. Russian Math. Surv. 66, 507–626 (2011)
A. Eremenko, P. Yuditskii, Polynomials of the best uniform approximation to sgn \(x\) on two intervals. J. d’Analyse Mathématique 114, 285–315 (2011)
S.R. Finch, Mathematical Constants (Cambridge University Press, Cambridge, 2003)
E. Findley, Universality for regular measures satisfying Szegő’s condition. J. Approx. Theory 155, 136–154 (2008)
A.F. Moreno, A. Martinez-Finkelshtein, V. Sousa, Asymptotics of orthogonal polynomials for a weight with a jump on \(\left[-1,1\right] \). Constr. Approx. 33, 219–263 (2011)
P. Forrester, Log-Gases and Random Matrices (Princeton University Press, Princeton, 2010)
M. Ganzburg, Limit Theorems and Best Constants of Approximation Theory (in), Handbook on Analytic Computational Methods in Applied Mathematics, ed. by G. Anastassiou (CRC Press, Boca Raton, FL 2000)
M. Ganzburg, The Bernstein constant and polynomial interpolation at the Chebyshev nodes. J. Approx. Theory 119, 193–213 (2002)
M. Ganzburg, Limit Theorems of Polynomial Approximation. Memoirs Am. Math. Soc. 192(897) (2008)
M. Ganzburg, Polynomial interpolation and asymptotic representations for zeta functions. Dissertationes Math. (Rozprawy Mat.) 496, 117 (2013)
M. Ganzburg, D.S. Lubinsky, Best approximating entire functions to \(\left|x\right|^{\alpha }\) in \(L_{2}\). Contemp. Math. 455, 93–107 (2008)
J. Korevaar, An inequality for entire functions of exponential type. Nieuw. Arch. Wiskunde 23, 55–62 (1949)
A. Kuijlaars, Universality, Chapter 6 in “The Oxford Handbook on Random Matrix Theory, ed. by G. Akemann, J. Baik, P. Di Francesco (Oxford University Press, Oxford, 2011), pp. 103–134
A. Kuijlaars, M. Vanlessen, Universality for eigenvalue correlations at the origin of the spectrum. Commun. Math. Phys. 243, 163–191 (2003)
A. Kuijlaars, K.T.-R. McLaughlin, W. Van Assche, M. Vanlessen, The Riemann-Hilbert approach to strong asymptotics for orthogonal polynomials on [–1,1]. Adv. Math. 188, 337–398 (2004)
B. Ja Levin, Lectures on Entire Functions, Translations of Mathematical Monographs (American Mathematical Society, Providence, 1996)
E. Levin, D.S. Lubinsky, Universality Limits at the Soft Edge of the Spectrum via Classical Complex Analysis. International Maths. Research Notices (2010), https://doi.org/10.1093/imrn/rnq185
E. Levin, D.S. Lubinsky, Asymptotic behavior of Nikolskii constants for polynomials on the unit circle. Comput. Methods Funct. Theory 15, 459–468 (2015)
E. Levin, D.S. Lubinsky, \(L_{p}\) Christoffel Functions, \(L_{p}\) Universality, and Paley-Wiener Spaces. J. d’Analyse Mathématique, 125 243–283 (2015)
D.S. Lubinsky, Marcinkiewicz-Zygmund Inequalities: Methods and Results, (in) Recent Progress in Inequalities, ed. by G.V. Milovanovic et al. (Kluwer Academic Publishers, Dordrecht, 1998), pp. 213–240
D.S. Lubinsky, On the Bernstein constants of polynomial approximation. Constr. Approx. 25, 303–366 (2007)
D.S. Lubinsky, Universality limits in the bulk for arbitrary measures on compact sets. J. d’Analyse Mathématique 106, 373–394 (2008)
D. S. Lubinsky, Universality Limits at the Hard Edge of the Spectrum for Measures with Compact Support, International Maths. Research Notices, International Maths. Research Notices (2008), Art. ID rnn 099, 39 pp
D.S. Lubinsky, A new approach to universality limits involving orthogonal polynomials. Ann. Math. 170, 915–939 (2009)
D.S. Lubinsky, Bulk universality holds in measure for compactly supported measures. J d’Analyse Mathématique 116, 219–253 (2012)
D.S. Lubinsky, On sharp constants in Marcinkiewicz-Zygmund and Plancherel-Polya inequalities. Proc. Am. Math. Soc. 142, 3575–3584 (2014)
A. Maté, P. Nevai, V. Totik, Szegő’s extremum problem on the unit circle. Ann. Math. 134, 433–453 (1991)
K.T.-R. McLaughlin, P.D. Miller, The \(\bar{\partial }\) -Steepest Descent Method and the Asymptotic Behavior of Polynomials Orthogonal on the Unit Circle with Fixed and Exponentially Varying Nonanalytic Weights, International Maths. Research Notices (2006), Article ID 48673, pp. 1–78
F. Nazarov, F. Peherstorfer, A. Volberg, P. Yuditskii, Asymptotics of the best polynomial approximation of \( \vert x\vert ^ p\) and of the best Laurent polynomial approximation of sgn(x) on two symmetric intervals. Constr. Approx. 29, 23–39 (2009)
P. Nevai, Orthogonal Polynomials. Memoirs of the AMS, vol. 213 (1979)
P. Nevai, Geza Freud, orthogonal polynomials and Christoffel functions: a case study. J. Approx. Theory 48, 3–167 (1986)
S.M. Nikolskii, On the best mean approximation by polynomials of the functions \(\left|x-c\right|^{s}\). Izvestia Akad. Nauk SSSR 11, 139–180 (1947). (in Russian)
M. Plancherel, G. Polya, Fonctions entierers et integrales de Fourier multiples. Comment. Math. Helvet. 10, 110–163 (1937)
R.A. Raitsin, S. N. Bernstein limit theorem for the best approximation in the mean and some of its applications. Izv. Vysch. Uchebn. Zaved. Mat. 12 81–86(1968)
R.A. Raitsin, On the best approximation in the mean by polynomials and entire functions of finite degree of functions having an algebraic singularity. Izv. Vysch. Uchebn. Zaved. Mat. 13, 59–61 (1969)
B. Simon, Orthogonal Polynomials on the Unit Circle, Parts 1 and 2 (American Mathematical Society, Providence, 2005)
B. Simon, Two extensions of Lubinsky’s universality theorem. Journal d’Analyse de Mathématique 105, 345–362 (2008)
B. Simon, Weak convergence of CD kernels and applications. Duke Math. J. 146, 305–330 (2009)
B. Simon, Szegö’s theorem and its Descendants: Spectral Theory for \(L_{2}\) Perturbations of Orthogonal Polynomials (Princeton University Press, Princeton, 2011)
H. B. Stahl, Best Uniform Rational Approximations of \(\left|x\right|\) on \(\left[ -1,1 \right] \), Mat. Sb. 183(1992), 85–118. (Translation in Russian Acad. Sci. Sb. Math., 76(1993), 461–487)
H.B. Stahl, Best uniform rational approximation of \(x^{\alpha }\) on \(\left[0,1\right] \). Acta Math. 190, 241–306 (2003)
H. Stahl, V. Totik, General Orthogonal Polynomials (Cambridge University Press, Cambridge, 1992)
T. Tao, Topics in Random Matrix Theory, Graduate Studies in Mathematics, vol. 132 (American Mathematical Society, Providence, 2012)
A.F. Timan, Theory of Approximation of Functions of a Real Variable (translated by J Berry) (Dover, New York, 1994)
V. Totik, Asymptotics for Christoffel functions for general measures on the real line. J. d’Analyse Mathématique 81, 283–303 (2000)
V. Totik, Universality and fine zero spacing on general sets. Arkiv för Matematik 47, 361–391 (2009)
V. Totik, Universality under Szegő’s condition. Canad. Math. Bull. 59, 211–224 (2016)
V. Totik, Metric properties of harmonic measure. Memoirs Am. Math. Soc. 184 867 (2006)
R.K. Vasiliev, Chebyshev Polynomials and Approximation, Theory on Compact Subsets of the Real Axis (Saratov University Publishing House, 1998)
R.S. Varga, Scientific Computation on Mathematical Problems and Conjectures. CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, Vermont (1990)
R.S. Varga, A.J. Carpenter, On the Bernstein conjecture in approximation theory. Constr. Approx. 1, 333–348 (1985)
A. Zygmund, Trigonometric Series, vols. I, II (Cambridge University Press, Cambridge, II, 1990)
Acknowledgements
The author would like to thank the organizers of Approximation Theory XV for the opportunity to take part in a very successful and stimulating conference. In addition, the author thanks the referees for their thorough reports.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Lubinsky, D.S. (2017). Scaling Limits of Polynomials and Entire Functions of Exponential Type. In: Fasshauer, G., Schumaker, L. (eds) Approximation Theory XV: San Antonio 2016. AT 2016. Springer Proceedings in Mathematics & Statistics, vol 201. Springer, Cham. https://doi.org/10.1007/978-3-319-59912-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-59912-0_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59911-3
Online ISBN: 978-3-319-59912-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)