- The paper establishes a limit relation connecting best weighted approximations by periodic trigonometric polynomials and entire functions.
- It employs advanced localization and kernel methods to relate periodic Jacobi weights to polynomial weights on ℝ and derive asymptotic error bounds.
- The result extends classical unweighted Bernstein–Ganzburg theorems and computes sharp constants for weighted L^p approximation problems.
Bernstein–Ganzburg-Type Limit Theorem for Best Weighted Approximation
Abstract and Motivation
The paper "A Bernstein–Ganzburg limit theorem for best weighted approximation" (2607.02669) establishes a sharp limit relation connecting the errors in best weighted approximation of functions by periodic trigonometric polynomials and entire functions of exponential type. This result generalizes classical Bernstein–Ganzburg-type limit theorems to the setting of Lp spaces under Jacobi-type weights, and extends previous unweighted limits to a broader class of analytic weights. The connection enables transfer of asymptotic error bounds between periodic and entire settings—critical for understanding the precise structure of approximation in weighted environments.
Statement of Main Result
Let wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b (a≥b≥0) define the periodic Jacobi weight on (−π,π], and consider f∈Lp(R,∣x∣2adx) for 1≤p<∞. Write Tn for the space of trigonometric polynomials of degree at most n and Eσ for the set of entire functions of exponential type at most σ. The central limit relation proven is
wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b0
where wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b1 is the best weighted wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b2 approximation error by trigonometric polynomials, and wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b3 is the error associated with best wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b4 approximation by entire functions of given type with the same (now algebraic) weight. For wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b5, this recovers the result of Ganzburg, but the general weighted case is new.
Technical Approach and Proof Outline
The proof employs advanced localization and kernel methods, echoing techniques from the study of Nikol'skii constants but adapting them to the periodic weighted case. Central tools include:
- Local Scaling of Jacobi Weights: For fixed wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b6, the rescaled periodic Jacobi weight converges to the polynomial weight, i.e., wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b7 as wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b8. This underpins the reduction from the periodic case to the entire line.
- Fejér Kernel Localization: The Fejér kernel wa,b(t)=∣2sin(t/2)∣2a∣cos(t/2)∣2b9 is utilized to control the local behavior and regularization of trigonometric polynomials, ensuring asymptotic matching with entire functions. The smoothing function a≥b≥00 is constructed for tight control of the approximation and manages the spread in the periodic to entire limit transition.
- Two-Stage Limiting Argument: The error is first estimated for a general scaling parameter a≥b≥01, then shown to be insensitive as a≥b≥02 due to the uniformity of the weight convergence.
- Error Decomposition: Through careful splitting of the error—central region, kernel tail, and polynomial approximation—a precise upper and lower bound is established, both asymptotically tight, leading directly to the limit theorem.
Explicit Applications
The paper applies the main theorem to compute sharp constants in classical weighted approximation scenarios:
- For the characteristic function a≥b≥03 in the unweighted case (a≥b≥04), the sharp constant is
a≥b≥05
where a≥b≥06 solves a≥b≥07.
- For the "sine" weighted case (a≥b≥08), it is shown that
a≥b≥09
via algebraic polynomial approximation and explicit calculation using change of variables.
These calculations are realized by importing earlier results from polynomial and trigonometric approximation literature, facilitated by the established limit relation. Notably, for (−π,π]0, the asymptotic constant coincides with the natural (−π,π]1 error in weighted polynomial settings.
Implications, Significance, and Prospects
This extension of Bernstein–Ganzburg-type theorems to weighted periodic settings provides a powerful bridge between polynomial approximation on intervals and entire function approximation on the real line—each with their respective natural weights. The result gives a rigorous route to transfer sharp constants and extremal function properties between highly structured spaces. This is significant for the precise study of spectral approximation, best constants in inequalities (e.g., Markov, Bernstein, Nikol'skii), and the analysis of signal recovery in weighted norms.
In theoretical approximation theory, the theorem enriches the repertoire of equivalence principles between periodic and real-line settings under general weights. Practically, it enables computation of weighted best-approximation errors in settings where direct analysis would be cumbersome. The explicit calculation of (−π,π]2 and (−π,π]3 highlights the utility of the theorem in concrete problems.
A more ambitious extension would be to characterize (−π,π]4 for all (−π,π]5, especially for (−π,π]6 not corresponding to known explicit one-sided polynomial approximation formulas. This remains open and challenging except for some special (−π,π]7; existing literature on weighted one-sided approximation provides results in related but distinct settings.
Conclusion
The paper delivers a general and technically rigorous Bernstein–Ganzburg-type limit theorem for best weighted (−π,π]8 approximation by trigonometric polynomials in periodic weighted spaces, covering a broad class of Jacobi-type weights and connecting them asymptotically with entire function approximation. The findings not only extend classical results but also enable sharp quantitative analysis in weighted approximation, providing tools relevant for further exploration in both theoretical and applied analysis.