betaFeedback

WorksMathematics

Conjectures of Bernstein and Erdős for weighted Lagrange interpolation with Hermite weight

Abstract

The classical Bernstein and Erdős Conjectures for algebraic Lagrange interpolation on a finite interval were settled in two consecutive papers by Kilgore and by de Boor and Pinkus in 1978. Extending these results to weighted interpolation on unbounded intervals has proved to be more difficult. In a previous work, we established the Bernstein and Erdős Conjectures, together with the ``modified'' de Boor–Pinkus intertwining theorem, for weighted Lagrange interpolation on the half-line with exponential weights. Here we continue this line of research by considering the Hermite weight on the whole real line. Our main result is the Hermite-weighted analogue of the Bernstein and Erdős conjectures together with the appropriate version of the de Boor–Pinkus intertwining theorem. A key ingredient in the classical proofs is the nonsingularity of certain derivative matrices associated with the local maxima of the Lebesgue function. This property already breaks down in the exponentially weighted setting, although the resulting difficulties can still be resolved. In the Hermite-weighted setting, however, the situation becomes more intricate, requiring a substantial refinement of the previous approach.

Introduction

The aim of the present paper is to establish an appropriate form of the Bernstein and Erdős Conjectures for Hermite-weighted polynomial interpolation on the real line. More precisely, we consider the Hermite-weight w(t)=e−t2w(t)=e^{-t^2}, t∈Rt\in\mathbb{R} and investigate the weighted Lagrange interpolation operator generated by a node system x∈S\mathbf{x}\in S where S:={(x0,x1,…,xn)∈Rn+1:x0<x1<…<xn}S:=\{(x_0,x_1,\ldots,x_n)\in\mathbb{R}^{n+1}: x_0<x_1<\ldots<x_n\}.

The original Bernstein Conjecture was formulated for algebraic polynomial interpolation on a compact interval more than a century ago [1]. The problem remained open for several decades until it was eventually solved by Kilgore [14]. Closely related questions were proposed by Erdős [3, 4], and were subsequently settled through the work of Kilgore, Cheney, de Boor and Pinkus [13, 2]. In fact, de Boor and Pinkus proved a substantially stronger statement, often referred to as the intertwining property, which implies the Erdős Conjecture as a special case.

Following these achievements, considerable effort was devoted to extending the theory to weighted polynomial spaces and to more general interpolation settings; see, among others, [16, 15, 17, 18]. A common feature of essentially all previous approaches is their reliance on the nonsingularity of certain derivative matrices built from the local maxima functions of the corresponding Lebesgue function. The decisive role of this property was later clarified by Shi [23], who showed that, together with a mild properness assumption, nonsingularity already

Sz. R. was supported in part by Hungarian National Foundation for Scientific Research, Grant #’s K-146387, K-147153 and Excellence No. 151341.

P. Sz. was supported by the HUN-REN Hungarian Research Network through funding of her visiting researcher semester. implies not only the Bernstein and Erdős Conjectures, but even the stronger intertwining property.

For exponentially weighted interpolation on the halfline, however, this classical scheme breaks down. It was shown in [22] that interval maxima may occur at endpoints of the corresponding intervals, causing entire columns of the derivative matrices to vanish. Consequently, the standard nonsingularity argument cannot be repaired in that setting. Nevertheless, the Bernstein and Erdős Conjectures were established in [22] by a completely different approach based on global topological considerations and a careful analysis of the structure of the local maxima.

The present paper continues this line of investigation in the Hermite-weighted setting. Although the Hermite weight shares several qualitative features with the exponential weight, the geometry of the interpolation problem is substantially different. The exponential case is formulated on a halfline and possesses only one outer interval. In contrast, the Hermite setting is naturally posed on the whole real line and therefore contains two outer intervals.

This distinction has important consequences for the derivative matrices. In the exponential case considered in [22], singularity arises when the maximum of the last interval polynomial is attained at the endpoint of the outer interval, leading to a vanishing column in the derivative matrix. In the Hermite case the phenomenon may occur simultaneously at both ends of the real line. As a consequence, not merely one but potentially two columns of the derivative matrix may vanish identically. Equivalently, after transposition, one may encounter two zero rows. Thus the failure of the nonsingularity framework is even more pronounced than in the exponential case.

Therefore, the Hermite-weighted problem provides a natural and significantly more demanding test case for methods that do not rely on nonsingularity. The purpose of the present work is to show that despite these difficulties, the Bernstein and Erdős Conjectures remain valid in this setting.

As in the exponential case, we consider the weighted space

Cw(R):={f∈C(R):∥f∥w:=∥fw∥∞<∞},C_w(\mathbb{R}) := \{f \in C(\mathbb{R}) : \|f\|_w := \|fw\|_\infty< \infty\},

together with the weighted polynomial space Wn:=wPn\mathcal{W}_n := w\mathcal{P}_n. In the present paper, however, the weight is mostly the Hermite weight w(t)=e−t2w(t) = e^{-t^2}; for some more general statements we will also use positive, continuous weights satisfying lim⁡±∞w(t)tn=0\lim_{\pm\infty} w(t)t^n = 0, subject to appropriate further conditions.

For a node system x=(x0,…,xn)∈S\mathbf{x} = (x_0,\ldots,x_n) \in S there are unique weighted fundamental functions

hk(x;t)=w(t)w(xk)∏j=0j≠knt−xjxk−xj,k=0,…,n,(1)h_k(\mathbf{x};t) = \frac{w(t)}{w(x_k)}\prod_{\substack{j=0\\j\ne k}}^n \frac{t-x_j}{x_k-x_j}, \qquad k=0,\ldots,n, \tag*{(1)}

satisfying hk(xj)=δjkh_k(x_j)=\delta_{jk} where δjk\delta_{jk} is the Kronecker delta.

The corresponding weighted Lebesgue function is given by

Ln(w,x,t)=∑k=0n∣hk(x,t)∣=∑k=0nεk(t)hk(t)(2)L_n(w,\mathbf{x},t) = \sum_{k=0}^n |h_k(\mathbf{x},t)| = \sum_{k=0}^n \varepsilon_k(t)h_k(t) \tag*{(2)}

where

εk(t):=sign⁡(hk(x,t))={(−1)k−iif t∈int⁡Ii, 1≤i≤k≤n,(−1)k+1−iif t∈int⁡Ii, 0≤k<i≤n+1,δikif t=xi, i=0,1,…,n.\varepsilon_k(t) := \operatorname{sign}(h_k(\mathbf{x},t)) = \begin{cases} (-1)^{k-i} & \text{if } t \in\operatorname{int} I_i,\ 1 \le i \le k \le n,\\ (-1)^{k+1-i} & \text{if } t \in\operatorname{int} I_i,\ 0 \le k < i \le n+1,\\ \delta_{ik} & \text{if } t=x_i,\ i=0,1,\ldots,n. \end{cases}

and, for a fixed node system x=(x0,…,xn)∈S\mathbf{x}=(x_0,\ldots,x_n)\in S the nodes partition the real line into the intervals

I0:=(−∞,x0],Ii:=[xi−1,xi](1≤i≤n),In+1:=[xn,∞).I_0 := (-\infty,x_0], \qquad I_i := [x_{i-1},x_i] \quad(1\le i\le n), \qquad I_{n+1} := [x_n,\infty).

On each interval the signs of the weighted fundamental functions remain constant. Therefore, restricting the Lebesgue function to a given interval IiI_i, we obtain a weighted polynomial

Pi(t):=Pi(x,t):=Ln(w,x,t)∣Ii=∑k=0nεk,ihk(x,t),i=0,…,n+1,(3)P_i(t) := P_i(\mathbf{x},t) := L_n(w,\mathbf{x},t)\big|_{I_i} = \sum_{k=0}^{n} \varepsilon_{k,i}h_k(\mathbf{x},t), \qquad i=0,\ldots,n+1, \tag*{(3)}

where

εk,i=(−1)k+1−i+χi≤k(0≤k≤n, 0≤i≤n+1).(4)\varepsilon_{k,i} = (-1)^{k+1-i+\chi_{i\leq k}} \qquad(0\leq k\leq n,\ 0\leq i\leq n+1). \tag*{(4)}

Then, we have that Pi(xi−1)=Pi(xi)=1P_i(x_{i-1})=P_i(x_i)=1, (i=1,…,n)(i=1,\ldots,n), also P0(x0)=1P_0(x_0)=1 and Pn+1(xn)=1P_{n+1}(x_n)=1. Moreover, P0=(−1)nPn+1P_0=(-1)^nP_{n+1}. The norm of the interpolation operator is therefore determined by the local maxima

mi(x):=max⁡t∈IiPi(x,t),i=0,…,n+1,m_i(\mathbf{x}) := \max_{t\in I_i} P_i(\mathbf{x},t), \qquad i=0,\ldots,n+1,

since

∥Ln∥w=max⁡t∈RLn(w,x,t)=max⁡0≤i≤n+1mi(x).\lVert L_n\rVert_w = \max_{t\in\mathbb{R}} L_n(w,\mathbf{x},t) = \max_{0\leq i\leq n+1} m_i(\mathbf{x}).

Consequently, the problem of finding optimal interpolation nodes, that is, node systems minimizing the norm of the interpolation operator, is equivalent to minimizing the maximum of the quantities mi(x)m_i(\mathbf{x}).

For a more detailed discussion of the weighted Lebesgue function and the related notation, we refer the reader to [22]. The setting considered there differs from the present one in that interpolation is studied on the half-line [0,∞)[0,\infty) with an exponential weight, whereas here we work on R\mathbb{R} with the Hermite weight.

The Bernstein Conjecture predicts that an optimal node system x\mathbf{x} is characterized by the equioscillation property

m0(x)=m1(x)=⋯=mn+1(x).m_0(\mathbf{x})=m_1(\mathbf{x})=\cdots=m_{n+1}(\mathbf{x}).

The corresponding Erdős Conjecture asserts that if x\mathbf{x} is an optimal node system and y≠x\mathbf{y}\ne\mathbf{x} is any other node system, then the interval maxima of y\mathbf{y} must straddle the common optimal value. More precisely, there exist indices ii and jj such that

mi(y)<mi(x)andmj(y)>mj(x).m_i(\mathbf{y})<m_i(\mathbf{x}) \qquad\text{and}\qquad m_j(\mathbf{y})>m_j(\mathbf{x}).

In other words, no competing node system can have all interval maxima simultaneously above or simultaneously below the equioscillating optimal level. The stronger intertwining property of de Boor and Pinkus [2] states that the same conclusion holds for any two distinct node systems x≠y\mathbf{x}\ne\mathbf{y}, without assuming that either of them is optimal.

Our main result shows that the Bernstein and Erdős assertions remain valid for Hermite-weighted interpolation. A crucial ingredient in the classical proofs is the nonsingularity of the (n+1)×(n+1)(n+1)\times(n+1) submatrices AkA_k, obtained by deleting the kkth column from the transpose of the Jacobian matrix, i.e., from the matrix

A=(∂mi∂xj(x))j=0,…,ni=0,…,n+1.(5)A=\left(\frac{\partial m_i}{\partial x_j}(\mathbf{x})\right)_{\substack{j=0,\ldots,n\\ i=0,\ldots,n+1}}. \tag*{(5)}

In [18], Kilgore claimed that these matrices remain nonsingular not only in the classical algebraic case, but also for exponentially and Hermite-weighted interpolation, and consequently formulated the corresponding Bernstein and Erdős theorems in these settings. However, the claimed nonsingularity of the matrices AkA_k was disproved in [24] by explicit counterexamples (see Examples 1 and 3 of [24] for the exponential and Hermite cases, respectively). As a consequence, Kilgore’s exponentially- and Hermite-weighted versions of the Bernstein and Erdős theorems reverted to conjectures.

In our previous work [22], we proved the exponentially weighted case without assuming the nonsingularity of the matrices AkA_k. Nevertheless, even in that setting substantial new ideas were required to compensate for the failure of the classical argument.

The Hermite-weighted setting turns out to be somewhat more delicate. Unlike the exponential half-line problem, the real line possesses two outer intervals, I0=(−∞,x0)I_0=(-\infty,x_0), In+1=[xn,∞)I_{n+1}=[x_n,\infty), which are not bounded by interpolation nodes on both sides. Consequently, the maxima of the outer weighted polynomials P0P_0 and Pn+1P_{n+1}, defining m0(x)m_0(\mathbf{x}) and mn+1(x)m_{n+1}(\mathbf{x}), need not be attained in the interiors of I0I_0 and In+1I_{n+1}, but may instead occur at the boundary nodes x0x_0 and xnx_n, respectively.

This phenomenon leads to a substantially stronger form of degeneracy than in the exponential case. Indeed, one or even both of the columns of AA corresponding to the “outer maxima” (i.e., ∇m0(x)\nabla m_0(\mathbf{x}) and ∇mn+1(x)\nabla m_{n+1}(\mathbf{x})) may vanish in the derivative matrices appearing in the Bernstein–Erdős approach, whereas in the exponential setting only one such degeneracy can occur.

The approach developed in the present paper is also related to several earlier methods designed to replace the classical nonsingularity argument. In particular, de Boor and Pinkus regarded the homeomorphism property of an appropriate difference mapping as one of the central conclusions of their work [2]. A related formulation was later investigated by Shi [23]. In the absence of nonsingularity, this homeomorphism property provides a natural substitute for the classical Jacobian argument, and it will play a central role in our proof as well. Our use of this idea is also motivated by its successful application in other approximation-theoretic settings; see, for example, [5, 8]. Nevertheless, before applying the homeomorphism approach, we need to make substantial detours, because here even two columns of the matrix AA may be vanish, whence the rank of the matrix can be lower than nn, excluding a homeomorphic mapping of node systems in general.

A second source of motivation comes from Fenton’s equioscillation theorem for sums of translates of concave kernels [10]. Building on this idea, and with the classical results of Kilgore and de Boor–Pinkus in mind, general minimax and equioscillation theorems were obtained in several settings where nonsingularity was unavailable [6, 7, 9]. Related periodic results go back to Kendall, Hardin and Saff [12] and were further developed in [5]. In those problems, however, the failure of nonsingularity could be compensated for by additional structural properties, most notably the concavity of the underlying kernels and the fact that the summands depended only on a single difference variable. These features are absent in the present Hermite-weighted interpolation problem, and hence the corresponding one-dimensional techniques cannot be applied directly.

The regular set and its boundary structure

References

  1. [1]S. Bernstein, Sur la limitation des valeurs d’un polynôme Pₙ(x) de degré n sur tout un segment par ses valeurs en n + 1 points du segment, Bull. Acad. Sci. USSR Leningrad (1931), pp. 1025–1050.
  2. [2]C. de Boor, and A. Pinkus, Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation, J. Approx. Th. 24 (1978), 289–303.DOI
  3. [3]P. Erdős, Some remarks on polynomials, Bull. Amer. Math. Soc. 53 (1947), 1169–1176.DOI
  4. [4]P. Erdős, Problems and results on the theory of interpolation, I, Acta Math. Acad. Sci. Hungar. 9 (1958), 381–388
  5. [5]B. Farkas, B. Nagy, and Sz. Gy. Révész, A minimax problem for sums of translates on the torus, Trans. London Math. Soc. 5 (2018), no. 1, 1–46.DOI
  6. [6]B. Farkas, B. Nagy, and Sz. Gy. Révész, On intertwining of maxima of sum of translates functions with nonsingular kernels, Tr. Inst. Mat. Mekh. 28 (2022), no. 4, 262–272.DOI
  7. [7]B. Farkas, B. Nagy, and Sz. Gy. Révész, On the weighted Bojanov–Chebyshev problem and the sum of translates method of Fenton, (in Russian), Sbornik Math. 214 (2023), no. 8, 119–150. English translation: Sb. Math. 214 (2023), no. 8, 1163–1190.arxiv.org/abs/2112.10169
  8. [8]B. Farkas, B. Nagy, and Sz. Gy. Révész, A homeomorphism theorem for sums of translates, Rev. Mat. Complut. 37 (2024), no. 2, 341–389.arxiv.org/abs/2112.11029
  9. [9]B. Farkas, B. Nagy, and Sz. Gy. Révész, Fenton type minimax problems for sum of translates functions, J. Math. Anal. Appl. 543 (2025), no. 2, Paper No. 128931, 25 pp.arxiv.org/abs/2210.04348
  10. [10]P. C. Fenton, A min-max theorem for sums of translates of a function, J. Math. Anal. Appl. 244 (2000), no. 1, 214–222.DOI
  11. [11]A. Haar, ”Die Minkowskische Geometrie und die Annäherung an stetige Funktionen” Math. Ann., 78 (1918), 249–311.DOI
  12. [12]D. P. Hardin, A. P. Kendall, and E. B. Saff, Polarization Optimality of Equally Spaced Points on the Circle for Discrete Potentials, Discrete Comput. Geom. 50 (2013), no. 1, 236–243.
  13. [13]T. Kilgore, and E. W. Cheney, A theorem on interpolation in Haar subspaces, Aequationes Math. 14 (1976), 391–400.
  14. [14]T. Kilgore, A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm, J. Approx. Th. 24 (1978), 273–288.DOI
  15. [15]T. Kilgore, A Note on Functions with Interlacing Roots, J. Approx. Th. 43 (1985), 25–28.DOI
  16. [16]T. Kilgore, Optimal interpolation with incomplete polynomials, J. Approx. Theory 41 (1984), 279–290.DOI
  17. [17]T. Kilgore, Optimal interpolation with polynomials having fixed roots, J. Approx. Theory 49 (1987), 378–389.DOI
  18. [18]T. Kilgore, Optimal interpolation with exponentially weighted polynomials on an unbounded interval, Acta Math. Hung. 57, (1991), 85–90.DOI
  19. [19]V. A. Markov, On the Functions of Least Deviation from Zero in a Given Interval, Izdat. Imp. Akad. Nauk, St. Petersburg, 1892 (in Russian); Condensed German translation: W. Markoff, Über polynome die einen gegebenen Intervalle möglichst wenig von Null abweichen, Math. Ann. 77 (1916), 213–258.
  20. [20]L. Milev, and N. Naidenov, Exact Markov inequalities for the Hermite and Laguerre weights, J. Approx. Theory 138 (2006), 87–96.DOI
  21. [21]L. Milev, and N. Naidenov, Markov interlacing property for exponential polynomials, J. Math. Anal. Appl. 367 (2010), 669–676.DOI
  22. [22]Sz. Gy. Révész and P. Szokol, Conjectures of Bernstein and Erdős for weighted Lagrange interpolation on the halfline with exponential weights, See at https://arxiv.org/abs/2606.31677.
  23. [23]Y. G. Shi, A minimax problem admitting the equioscillation characterization of Bernstein and Erdős, J. Approx. Th. 92 (1998), 463–471.DOI
  24. [24]P. Szokol, Examples and counterexamples in the theory of weighted interpolation, Acta Math. Hung., 179 (2026), 219–253.

Paper details

vlnc:W_ffrhrkcc
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents