Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Bernstein's finite local telescoping inequality


Source. Bernstein 1931, equations (32) and (32 bis), printed pp. 1039--1040 / PDF pp. 15--16, in the complete source.

Let a0<⋯<ada_0<\cdots<a_d be real nodes with nodal polynomial AA and Lebesgue function FF. Choose a consecutive block ap,…,aqa_p,\ldots,a_q, where p<qp<q, and a real non-node ξ\xi. Suppose

∣A(ξ)∣≥∣A ⁣(ak+ak+12)∣(p≤k<q).(T0)|A(\xi)|\ge \left|A\!\left(\frac{a_k+a_{k+1}}2\right)\right| \qquad(p\le k<q). \tag{T0}

For example, (T0) holds if the block lies in a compact interval II and ∣A(ξ)∣=max⁡I∣A∣|A(\xi)|=\max_I|A|. Such a maximizing point is not a node, because a nonzero polynomial cannot vanish throughout a positive-length interval.

If ah<ξ<ah+1a_h<\xi<a_{h+1} with p≤h<qp\le h<q, then

F(ξ)>14log⁡ξ−apξ−ah+14log⁡aq−ξah+1−ξ.(T1)F(\xi)> \frac14\log\frac{\xi-a_p}{\xi-a_h} +\frac14\log\frac{a_q-\xi}{a_{h+1}-\xi}. \tag{T1}

A logarithm is zero when its numerator and denominator coincide. In particular, writing δ=ah+1−ah\delta=a_{h+1}-a_h,

F(ξ)>14log⁡4(ξ−ap)(aq−ξ)δ2.(T2)F(\xi)> \frac14\log \frac{4(\xi-a_p)(a_q-\xi)}{\delta^2}. \tag{T2}

If ξ>aq\xi>a_q, the one-sided version is

F(ξ)>14log⁡ξ−apξ−aq;(T3)F(\xi)>\frac14\log\frac{\xi-a_p}{\xi-a_q}; \tag{T3}

if ξ<ap\xi<a_p, it is F(ξ)>14log⁡((aq−ξ)/(ap−ξ))F(\xi)>\tfrac14\log((a_q-\xi)/(a_p-\xi)).

Proof. At ξ\xi, put wj=∣A(ξ)∣/(∣ξ−aj∣ ∣A′(aj)∣)>0w_j=|A(\xi)|/(|\xi-a_j|\,|A'(a_j)|)>0, so F(ξ)=∑jwjF(\xi)=\sum_jw_j. For every selected consecutive pair, (T0) gives Ik(ξ)≤wk+wk+1I_k(\xi)\le w_k+w_{k+1}, with IkI_k defined on the pair-estimate page. Use only pairs entirely to one side of ξ\xi. Each node belongs to at most two such pairs. The outer node of any nonempty finite block belongs to at most one, so the resulting inequality is strict:

F(ξ)>12(∑k=ph−1Ik(ξ)+∑k=h+1q−1Ik(ξ)).F(\xi)> \frac12\left(\sum_{k=p}^{h-1}I_k(\xi) +\sum_{k=h+1}^{q-1}I_k(\xi)\right).

If both sums are empty, strictness simply follows from F(ξ)≥1F(\xi)\ge1. Equations (31) and (31 bis) now give telescoping sums

∑k=ph−1log⁡ξ−akξ−ak+1=log⁡ξ−apξ−ah,∑k=h+1q−1log⁡ak+1−ξak−ξ=log⁡aq−ξah+1−ξ,\sum_{k=p}^{h-1}\log\frac{\xi-a_k}{\xi-a_{k+1}} =\log\frac{\xi-a_p}{\xi-a_h}, \qquad \sum_{k=h+1}^{q-1}\log\frac{a_{k+1}-\xi}{a_k-\xi} =\log\frac{a_q-\xi}{a_{h+1}-\xi},

which prove (T1). Since (ξ−ah)(ah+1−ξ)≤δ2/4(\xi-a_h)(a_{h+1}-\xi)\le\delta^2/4, (T2) follows. That auxiliary inequality is an equality precisely when ξ\xi is the midpoint of its node gap, but the full bound remains strict. If ξ\xi is outside the block, sum all its pairs in one direction to obtain (T3).

Case information retained. Formula (T2) contains both outer distances ξ−ap\xi-a_p and aq−ξa_q-\xi. A uniform lower bound for these distances yields twice the logarithmic contribution of the one-sided estimate. Merely saying that a point lies in an interval's interior does not supply a uniform lower bound when the point changes with the degree.

Dependencies. The interpolation identity and equations (27), (29), (31), and (31 bis). Their complete rewritten proofs are linked above.

Proof scope. Complete finite deduction, including empty sums and one-sided cases; reviewed on 6 September 2026 as component C4 of the local-chain review, which required one correction at the frozen bytes, the plus sign in display (T1) that this page now carries. The approval record of that corrected successor is not retained in this repository; the publication review confirms the corrected display.

Bears on. Problem 1153, local lower bound.