On the integral of the Lebesgue function of interpolation. II (Q1897820)

Notations. \(-1\leq x_{0,n}< x_{1,n}< \dots< x_{1,n}< 1\) is a set of nodes on the interval \([-1,1]\). For brevity set \(x_k := x_{k,n}\). Define also some well known quantities \[ \ell_k(x) := \ell_{k,n}(x)= {{\omega(x)} \over {\omega' (x_k) (x- x_k)}}, \qquad \omega (x)= \prod^n_{k=0} (x-x_k), \] \(\lambda(a,b) := \max_{a\leq x\leq b} \sum^n_{k=1} |\ell_k (x)|\), \(-1\leq a<b\leq 1\). The present paper and a former paper by the first two authors [Acta Math. Acad. Sci. Hungar 32, 191-195 (1978; Zbl 0391.41003)]\ deal with lower bound estimates of the function \(\lambda_n(x) := \sum^n_{k=0} |\ell_k(x)|\). In the above mentioned paper it was shown that for any interval \([a,b]\subseteq [-1,1]\) and arbitrary nodes \(x_k\) the inequality \[ \int_a^b \sum^n_{k=0} |\ell_k(x)| dx\geq c(b- a)\log n \] holds for sufficiently large \(n\) depending only on the interval \([a,b ]\). This inequality was an improvement of Bernstein's \(\lambda_n (a,b)\geq c_1\log n\), \(n\geq n_1 (a,b)\). A further improvement is shown in the present paper, namely a similar inequality is derived for every individual interval \([a_n, b_n ]\subseteq [-1,1]\) and for all \(n\) without exception. The result states Theorem. There exists an absolute positive constant \(c\) for which the inequality \[ \int^{b_n}_{a_n} \lambda(x) dx\geq c(b_n - a_n) \log (n(\alpha_n - \beta_n)+ 2), \qquad (a_n\cos \alpha_n,\;b_n= \cos \beta_n). \] In fact the authors show the sharpness, in a sense, of their estimate by showing that \[ \max_{a_n\leq x\leq b_n} \lambda_n (x)= O\bigl(\log(n (\alpha_n - \beta_n)+ 2)\bigr). \]