Optimal Approximants of Beurling-Selberg Type
- The paper presents explicit extremal entire functions that majorize or minorize target functions under band-limitation constraints in Fourier analysis.
- It utilizes reproducing kernel Hilbert space techniques to solve L² minimization problems and interpolate at prescribed nodes for optimized error bounds.
- Generalizations include interpolation constraints, Gaussian subordination, and multi-dimensional boxes, with applications in analytic number theory and signal processing.
Optimal approximants of Beurling–Selberg type are explicit extremal entire functions that majorize or minorize a given target—most commonly, characteristic functions of intervals (or more general sets), Gaussians, or related kernels—subject to band-limitation constraints and auxiliary optimality criteria. These constructions, rooted in the works of Beurling, Selberg, and Vaaler, are fundamental in Fourier analysis, analytic number theory, and signal processing, where precise control over approximation error, spectral constraints, and interpolation properties is required.
1. Classical Beurling–Selberg Extremal Problems
Given an interval , the classical Beurling–Selberg problem seeks entire functions (majorant , minorant ) of exponential type at most such that for all and whose Fourier transforms are supported in . The objective is to minimize the -error, i.e.,
The unique extremal solutions are explicitly given by interpolation at integers or half-integers, and their Fourier transforms exhibit the required compact support. For the interval , Selberg’s extremals are
for as determined by or , and suitable residues at the endpoints (Mukhametzhanov et al., 2020).
2. Reproducing Kernel and Hilbert Space Methodology
The construction of optimal Beurling–Selberg approximants utilizes reproducing kernels associated with band-limited Paley–Wiener spaces. For support in , the appropriate Hilbert space is , with reproducing kernel
An -admissible function with and Fourier support in admits a unique factorization with (Kelly, 2014). The extremal problem then reduces to an minimization: The unique solution corresponds to lying in the span of the reproducing kernels at and , with explicit coefficients.
3. Generalizations: Interpolation Constraints and Gaussian Subordination
Extremal approximants can be modified to enforce interpolation constraints, such as vanishing at prescribed points or matching the target at additional nodes. For example, the Carneiro–Littmann variation constructs majorants of vanishing at by adding an explicit kernel-based correction to the Selberg majorant (Kelly, 2014): where is the classical majorant and is the prescribed kernel correction. This constraint increases the -mass, typically by for small .
Gaussian subordination further extends the framework to even functions expressible as superpositions of Gaussians , and the optimal majorants/minorants are constructed through integration of the Gaussian approximants against (Carneiro et al., 2010, Carneiro et al., 2015). The minimal error is given by integrating the corresponding error constants: This methodology unifies classical cases and yields closed-form optimal constants for a wide range of kernels.
4. High- and Multi-Dimensional Box Problems
For boxes in high dimensions, one constructs minorants subject to , , maximizing (Carruth et al., 2017). Explicit constructions exist for ; for , no nontrivial minorants with positive mass are possible. These extremal functions take a separated form: where is a product of 1D Selberg extremals, and is an even polynomial chosen to enforce vanishing at prescribed lattice points. Applications include improved bounds in large-sieve type inequalities.
5. Application Domains: Analytic Number Theory, Modular Bootstrap, Signal Processing
Beurling–Selberg-type approximants underlie sharp inequalities in analytic number theory, such as explicit bounds in zero-density problems and Hilbert-type inequalities (Hejhal, 2013, Carneiro et al., 2010, Carneiro et al., 2015). In the context of modular bootstrap in conformal field theory, extremal majorants/minorants of characteristic functions yield optimal bounds on spectral densities, with explicit dependencies on the band-limit and interval width (Mukhametzhanov et al., 2020). The modular inversion argument relates the extremal integrals directly to bounds on the number of operators in a scaling window. In super-resolution, higher-order box approximants control singular values of Fisher information matrices, determining threshold separations for stable parameter recovery (Costa et al., 2022).
6. Explicit Formulas, Error Constants, and Asymptotics
Extremal functions of Beurling–Selberg type allow for explicit computation of -errors, kernel evaluations, and asymptotic rates. In classical cases, these error bounds converge as: For kernel modifications with interpolation constraints, the error increases: In multidimensional cases, errors are given by explicit sums over reproducing kernel values at zeros of associated Hermite–Biehler functions (Carneiro et al., 2015): with asymptotics controlled by Bessel zero distributions.
7. Open Problems and Extensions
Ongoing challenges include the classification of extremal minorants for boxes in higher dimensions beyond , existence and explicit construction of two-sided extremals in multivariate settings, and extension to non-box domains such as balls and simplices. Application-driven extensions involve optimizing for additional constraints, such as higher-order vanishing moments or generalized interpolation at prescribed sets, and exploiting extremal approximants in new analytic and computational frameworks (Carruth et al., 2017, Carneiro et al., 2015).
Representative Table: Classical Extremal Approximants for
| Majorant | Minorant | -Error |
|---|---|---|
| Explicit Selberg series | Explicit Selberg series |
All entries correspond to explicit formulas and error constants in the classical 1D case (Hejhal, 2013, Mukhametzhanov et al., 2020).
The theory of optimal Beurling–Selberg-type approximants is central to harmonic analysis, extremal function theory, and their analytic and computational applications, providing not only explicit constructions but also rigorous bounds and interpolation mechanisms under spectral constraints. Foundational references include Vaaler’s survey (Hejhal, 2013), Carneiro–Littmann’s Gaussian subordination framework (Carneiro et al., 2010, Carneiro et al., 2015), and Selberg’s original papers.