Skip to main content
QUICK REVIEW

[논문 리뷰] Local Bernstein theory, and lower bounds for Lebesgue constants

T. Tao|arXiv (Cornell University)|2026. 03. 23.
Holomorphic and Operator TheoryMathematics인용 수 0
한 줄 요약

The paper localizes Bernstein theory to rectangular regions to derive sharp lower bounds for Lebesgue constants of Lagrange interpolation on subintervals, answering Erdős–Turán questions and obtaining asymptotically sharp integral bounds.

ABSTRACT

Classical (or ``global'') Bernstein theory establishes sharp control on entire functions of exponential type that are bounded and real-valued on the real axis. We localize some of this theory to rectangular regions $\{ x+iy: x \in I, 0 \leq y \leq y_0 \}$, showing that Bernstein-type bounds with acceptable errors can continue to hold for functions holomorphic in such rectangles, bounded and real-valued on the lower edge of the rectangle, at most exponentially large on the upper edge, and at most double exponentially large on the vertical sides. As a consequence of these bounds, we are able to localize the Erdős lower bound $\sup_{x \in [-1,1]} λ(x) \geq \frac{2}π \log n - O(1)$ on the Lebesgue constant of interpolation on $C([-1,1])$ to shorter intervals $I$ than $[-1,1]$, answering a question of Erdős and Turán. By using suitably weighted versions of the residue theorem, we also obtain the asymptotically sharp lower bound $\int_I λ(x)\ dx \geq \frac{4|I|}{π^2} \log n - o(\log n)$ for integral variants of such constants, answering a further question of Erdős.

연구 동기 및 목표

  • Motivate and develop a local version of Bernstein theory applicable to rectangles in the complex plane.
  • Localize global Bernstein bounds to short intervals while controlling error terms.
  • Derive fixed-interval lower bounds for Lebesgue constants in interpolation, answering Erdős–Turán questions.
  • Establish asymptotically sharp integral bounds for integral variants of Lebesgue-type constants.
  • Connect local behavior of polynomials to global interpolation error bounds.

제안 방법

  • Define and utilize local Bernstein inequalities and their stronger forms in rectangle R+(I,y0).
  • Apply the residue theorem with weighted variants to localize bounds and connect to oscillatory (sinusoidal-like) behavior.
  • Decompose Lebesgue function into macroscopic, mesoscopic, and microscopic contributions and bound each part.
  • Use a blended function technique combining sinusoidal and P(z) behavior to control zero distribution and residues.
  • Prove Theorem 1.10 giving sup-norm and integral bounds for Lebesgue constants on I.
  • Provide a trigonometric toy model (Theorem 1.13) and develop lemmas (e.g., Lemma 1.14) to illustrate mechanism.]
  • table_headers:[]
  • table_rows:[]
  • research_questions:[

실험 결과

연구 질문

  • RQ1Can Bernstein-type bounds be localized to rectangles while maintaining useful error terms?
  • RQ2Do lower bounds for Lebesgue constants on [-1,1] extend to shorter intervals I within [-1,1]?
  • RQ3Can one obtain asymptotically sharp lower bounds for integral variants of Lebesgue-type constants on I?
  • RQ4How do macroscopic, mesoscopic, and microscopic contributions to the Lebesgue function interact under localization?
  • RQ5What role do weighted residue arguments play in proving local lower bounds for interpolation constants?

주요 결과

  • Local Bernstein theory yields inequalities with explicit error terms on rectangles: |f′(x)| ≤ Aλ(1+O(e^{−πL/(4y0)})+O(1/(λ min(y0,L)))) and |f(x)+if′(x)/λ| ≤ A(1+O(e^{−πL/(4y0)})+O(1/(λ min(y0,L))).
  • A local Duffin–Schaeffer bound: |f(x+iy)| ≤ A(1+O(e^{−πL/(4y0)})) cosh((1+O(1/(λ min(y0,L)))) λy).
  • Main result (Theorem 1.10): for fixed interval I, large n, and nodes in [-1,1], sup_{x∈I} λ(x) ≥ (2/π) log n − O(1) and ∫_{I} λ(x) dx ≥ (4|I|/π^2) log n − o(log n).
  • Corollary 1.11 shows a dense set of points x* with λ^{(n)}(x*) ≥ (2/π) log n − ω(n) for infinitely many n.
  • A trigonometric toy model (Theorem 1.13) provides sharp bounds for sums involving P and P′ at nodes, illustrating the mechanisms behind the main results.

이 논문 읽기

누빈트 뷰어에서 원문을 열고, 읽으면서 궁금한 곳을 바로 물어보세요.

누빈트에서 이 논문 읽기

이 리뷰는 AI가 논문 원문을 바탕으로 만들었습니다. 인용하기 전에 원문을 확인해 주세요.