Optimal Polynomial Approximants (OPA)
- Optimal polynomial approximants (OPA) are finite-degree polynomials that minimize the norm of 1-pf, serving as precise projection mechanisms in analytic and Banach spaces.
- They use orthogonal projections in Hilbert spaces and nonlinear metric projections in H^p and ℓ_A^p spaces, linking cyclicity with invariant subspace theory.
- OPA theory underpins explicit coefficient computations, zero-set analysis, and applications in digital filter design and inverse filtering problems.
Optimal polynomial approximants (OPA) are finite-degree polynomial inverses defined by a best-approximation problem: for a nonzero analytic function , one seeks a polynomial of degree at most that minimizes in a prescribed function-space norm; more generally, one may minimize for a fixed target . In Hilbert spaces this is an orthogonal projection problem, while in , , and related Banach spaces it becomes a nonlinear metric projection problem. The subject lies at the intersection of approximation theory, cyclicity, invariant subspaces, orthogonal polynomials, reproducing kernels, and, in applied settings, least-squares inverse filter design (Bénéteau et al., 2021, Felder, 2020).
1. Definition and geometric formulation
In the classical Hilbert-space setting, especially weighted Hardy-type spaces , an OPA is defined by
If 0 and
1
then 2 is the orthogonal projection of 3 onto the finite-dimensional subspace 4, where 5 denotes the polynomials of degree at most 6 (Bénéteau et al., 2019). This projection viewpoint is foundational: it makes existence and uniqueness immediate in Hilbert spaces and links the asymptotics of OPA to the closed shift-invariant subspace generated by 7 (Bénéteau et al., 2021).
A broader formulation replaces the target 8 by an arbitrary 9, defining the 0th OPA to 1 by
2
In this form, OPA become a general projection framework on reproducing kernel Hilbert spaces with dense polynomials and bounded shift, and the special role of the normalized kernel at the origin 3 becomes explicit in spaces where 4 (Felder, 2020).
The Banach-space version is formally similar but geometrically different. In 5, 6, the OPA 7 minimizes 8, and uniqueness follows from uniform convexity rather than Hilbert orthogonality (Centner et al., 2023). The same metric-projection interpretation appears in 9, where
0
for 1, and the approximant is the unique minimizer of 2 (Cheng et al., 2021). This distinction between orthogonal and metric projection is one of the central structural divides in the subject.
2. Hilbert-space structure, orthogonal polynomials, and explicit computation
In Hilbert spaces, OPA admit several equivalent computational descriptions. Writing
3
the coefficients satisfy a Gram-system or normal-equation formulation. If
4
then 5 in the classical 6 problem (Bénéteau et al., 2021). In the generalized setting 7, the coefficient vector solves
8
which is the basic finite-dimensional linear algebra model for OPA (Felder, 2020).
A second description uses orthogonal polynomials in the weighted inner product
9
If 0 is an orthonormal basis for 1, then
2
and in 3 this identifies OPA with reproducing kernels and reversed orthogonal polynomials on the unit circle (Bénéteau et al., 2021). The formula
4
makes the zero set of OPA identical with the zero set of the associated reproducing kernels (Bénéteau et al., 2016).
For polynomial data, the computation can become especially explicit. If 5 is a monic polynomial of degree 6 with simple zeros 7, then the residual 8 can be written in terms of a fixed 9 kernel Gram matrix
0
and
1
This reduces the problem to inversion of a matrix whose size depends on 2, not on 3, and yields explicit coefficient formulas and distance formulas such as
4
(Bénéteau et al., 2019). For 5, the same program persists but the Gram matrix is replaced by a Hankel moment matrix, reflecting the appearance of kernel derivatives rather than kernel values (Bénéteau et al., 2019).
The relation with orthogonal polynomials extends beyond one variable. In reproducing kernel Hilbert spaces on the ball and bidisk, weighted orthogonal polynomial systems still control OPA, but the recovery of the full orthogonal family from the OPA sequence can fail because the approximants may probe only a thin monomial sector (Sargent et al., 2020). Explicit closed forms are nevertheless available in special multivariable models, such as 6 in a scale of spaces on the unit ball with kernel 7 (Sargent et al., 2020).
3. Banach-space theory in 8, 9, and 0
Outside the Hilbert setting, the OPA problem becomes genuinely nonlinear. In 1, 2, the minimizer exists and is unique because 3 is uniformly convex, but orthogonality must be replaced by Birkhoff–James orthogonality (Centner et al., 2023). James’s criterion gives
4
and this criterion underlies the characterization of OPA in 5 and 6 alike (Cheng et al., 2023).
A central substitute for the Hilbert-space Pythagorean theorem is a family of 7-Pythagorean inequalities. The 8 theory uses these inequalities repeatedly to control OPA errors, coefficients, and roots when no linear projection formula is available (Centner et al., 2023). In this regime, even low-degree approximants reflect Banach-space geometry. The degree-zero approximant is a constant 9 minimizing 0, and the degree-one approximant satisfies nonlinear identities involving integral quantities such as
1
with analogous formulas for 2 and 3, from which exact expressions for the root and leading coefficient can be derived (Centner et al., 2023).
The paper "More properties of optimal polynomial approximants in Hardy spaces" develops the asymptotic and continuity theory in this Banach setting. For fixed 4, the metric projections 5 converge in norm to the metric projection of 6 onto the invariant subspace 7, and the map 8 is continuous for fixed 9; for bounded 0, 1 uniformly on 2 when 3 (Cheng et al., 2023).
The 4 extension places OPA in a still wider framework. For 5, 6 is defined by
7
Existence holds for all 8, uniqueness holds for 9, and uniqueness can fail for 0 and 1 (Centner, 2021). In 2, one recovers the Hilbert-space orthogonality system and a first-degree zero-free criterion: 3 For general 4, the characterizing equations become
5
which is the 6 analogue of the normal equations (Centner, 2021).
4. Zeros, extra zeros, and geometric constraints
The zero set of OPA is one of the most intensively studied aspects of the theory. In 7, the standard picture is rigid: OPA zeros lie outside the closed unit disk, and this can be read either from orthogonal-polynomial theory or from reproducing-kernel representations (Bénéteau et al., 2021). More generally, in weighted Hilbert spaces 8, the minimal possible modulus of an OPA zero is governed by the nonlinear extremal quantity
9
and a major result identifies 00 with half the norm of a Jacobi matrix 01: 02 Hence there exists an OPA zero in the open unit disk if and only if 03 (Bénéteau et al., 2016). In Dirichlet-type spaces 04, this yields a dichotomy: if 05, OPA zeros stay outside 06; if 07, zeros may occur inside 08 (Bénéteau et al., 2016).
In Banach spaces the geometry changes substantially. In 09, 10, 11, the set of all possible OPA zeros is exactly
12
for some constant 13; thus the excluded disk has radius strictly between 14 and 15, and extra zeros inside 16 do occur (Cheng et al., 2021). The first-degree case is extremal in this theory: a point is an OPA zero for some degree if and only if it is a zero of an optimal linear approximant (Cheng et al., 2021). The analysis proceeds through a Lagrange-multiplier recurrence and a dynamical system for the coefficient ratios of extremal polynomials (Cheng et al., 2021).
For Hardy spaces 17, the full zero-free theory for 18 remains incomplete, but several strong results are known. If 19 is inner, or if 20 is an even integer, then the root of the nontrivial degree-one OPA is bounded away from the origin by a radius depending only on 21 (Centner et al., 2023). More generally, if 22, 23, and 24, then all OPA 25 are zero-free in a disk centered at the origin whose radius is controlled by the degree-zero error: 26 (Centner, 2021). The same work states the conjectural picture explicitly: if 27, 28, and 29, then 30 should be zero-free in 31 (Centner, 2021).
Recent work on metric projections in 32 reframes the zero question through invariant subspaces. If 33 with 34, then the zeros of 35 eventually leave every compact subset of 36 as 37, and if 38 are the zeros of 39 in 40, then their product satisfies an explicit lower bound involving 41 and the inner factor 42 of 43 (Bénéteau et al., 11 Nov 2025). The same paper identifies as a central open problem whether OPA in 44, 45, can have zeros in 46; in 47, they cannot (Bénéteau et al., 11 Nov 2025).
In the Hardy 48 case, the zeros of OPA can also be studied through orthogonal polynomials on the unit circle. For the boundary weight 49, the OPA are reversed OPUC, and their zeros therefore lie outside 50. For generalized Jacobi-type weights, the zeros satisfy explicit electrostatic balance laws, with repelling charges at singular points on 51, an attracting charge at the origin, and additional charges at zeros of an electrostatic partner polynomial 52 (Orive et al., 21 Jul 2025).
5. Convergence, cyclicity, and projections onto invariant subspaces
OPA are closely tied to cyclicity. In the Hilbert-space literature, 53 is cyclic if and only if its polynomial multiples are dense, and OPA provide a concrete finite-dimensional approximation scheme for testing this density (Bénéteau et al., 2019). In the survey formulation, for Dirichlet-type and related Hilbert spaces,
54
(Bénéteau et al., 2021). This connects approximation of 55 to shift-invariant subspaces and to the larger problem of identifying cyclic vectors.
For polynomial 56 in weighted Hardy-type Hilbert spaces, boundary and compact-set convergence can be made highly explicit. If 57 is a polynomial with simple zeros and no zeros in 58, then in 59 or 60 the sequence 61 is uniformly bounded in the Wiener algebra norm, hence uniformly bounded on 62, and
63
uniformly on compact subsets of 64 (Bénéteau et al., 2019). The same paper derives explicit rate information from determinant estimates on the kernel Gram matrix and treats the previously unknown higher-multiplicity case 65 (Bénéteau et al., 2019).
The projection onto the full invariant subspace generated by 66 is the limit object behind these finite approximants. In general reproducing kernel Hilbert spaces on the disk, the projections 67 converge strongly to 68, and stabilization occurs precisely when this limiting projection is already achieved by a finite polynomial multiple (Felder, 2020). For 69, the following are equivalent after some index 70: the OPA are truncations of a single power series, the OPA stabilize, and 71 (Felder, 2020). Stabilization is further characterized by a rigid inner-type factorization
72
where 73 is 74-inner (Felder, 2020).
Inner functions occupy an extreme position in this theory. In reproducing kernel Hilbert spaces with orthogonal monomials, an 75-inner function 76 satisfies
77
and then every OPA to 78 is constant; moreover,
79
(Bénéteau et al., 2017). In several variables, the analogue is the class of weakly inner functions, for which all OPA are likewise constant, even though classical innerness and weak innerness need not coincide (Sargent et al., 2020).
The same projection mechanism underlies newer results in 80. For a closed 81-invariant subspace 82, the metric projection
83
governs the asymptotics of the finite-dimensional approximants 84 (Bénéteau et al., 11 Nov 2025). When 85 is factored into inner and outer parts, the exact distance from 86 to the invariant subspace is
87
and, for 88, the projection is generally not inner but of the form
89
(Bénéteau et al., 11 Nov 2025). This marks a sharp departure from the 90 theory.
A nonlinear universality phenomenon also appears. If 91 is closed of measure zero, then the set of 92 whose OPA have subsequences universal on 93 is 94-dense in 95; analogous statements hold in the Dirichlet space under a logarithmic-capacity-zero hypothesis (Bénéteau et al., 2018). This result is driven by simultaneous zero-free approximation on 96 (Bénéteau et al., 2018).
6. Multivariable, operator-valued, and applied extensions
The multivariable theory retains the formal definition of OPA but acquires new algebraic and geometric complications. In a reproducing kernel Hilbert space 97 with dense polynomials and bounded coordinate shifts, one fixes an ordering of monomials 98, defines 99, and sets
00
The coefficients solve a Gram system
01
but zero geometry and orthogonal-polynomial recovery become much more intricate than in one variable (Sargent et al., 2020). The strong form of the Shanks conjecture fails in multivariable weighted spaces: even zero-free target polynomials can have OPA with zeros in the bidisk (Sargent et al., 2020).
Despite these difficulties, explicit multivariable models exist. For 02 in a scale of unit-ball spaces with kernel 03, one can write down closed expressions for the weighted orthogonal polynomials, their norms, the corresponding OPA, and the optimal distance, all without reduction to the one-variable case (Sargent et al., 2020). In other cases, symmetry does permit reduction: in the Drury–Arveson space, 04 leads to OPA of the form
05
for a one-variable approximant 06 (Sargent et al., 2020).
The notion also extends beyond scalar analytic-function spaces. For rational matrix functions 07, one may seek the best polynomial approximation to 08 from the Krylov space 09. The Arnoldi-OR method computes
10
so 11 for the degree-12 polynomial that is optimal in the 13-norm (Chen et al., 2023). The resulting least-squares problem is built from Arnoldi Hessenberg matrices and requires 14 extra Arnoldi steps (Chen et al., 2023).
A different operator-valued extension appears in the 15-product treatment of non-autonomous linear ODEs. There the target is the 16-resolvent action 17, approximated by 18-polynomials
19
that minimize a 20-norm induced by the 21-inner product (Pozza, 2024). Spectral reduction converts this to a classical best polynomial approximation problem for the exponential on a compact interval, yielding geometric error bounds of the form
22
(Pozza, 2024).
The applied lineage of OPA is equally explicit. In digital filter design, the least-squares inverse problem for a stable filter is mathematically identical to the OPA problem in 23: one seeks a polynomial 24 minimizing 25, and the location of OPA zeros controls stability after reversal (Bénéteau et al., 2021). This identification is one reason OPA occupy a distinctive place between classical complex analysis and computational approximation theory.
OPA therefore form not a single theorem but a research program: a projection-theoretic mechanism that, depending on the ambient space, becomes a problem in Gram matrices, reproducing kernels, orthogonal polynomials, Jacobi matrices, Birkhoff–James geometry, invariant-subspace structure, Krylov approximation, or stable inverse design (Bénéteau et al., 2021, Bénéteau et al., 2016).