Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimal Polynomial Approximants (OPA)

Updated 7 July 2026
  • 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 ff, one seeks a polynomial pnp_n of degree at most nn that minimizes 1pf\|1-pf\| in a prescribed function-space norm; more generally, one may minimize gpf\|g-pf\| for a fixed target gg. In Hilbert spaces this is an orthogonal projection problem, while in HpH^p, Ap\ell_A^p, 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 Hω2H^2_\omega, an OPA is defined by

pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.

If pnp_n0 and

pnp_n1

then pnp_n2 is the orthogonal projection of pnp_n3 onto the finite-dimensional subspace pnp_n4, where pnp_n5 denotes the polynomials of degree at most pnp_n6 (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 pnp_n7 (Bénéteau et al., 2021).

A broader formulation replaces the target pnp_n8 by an arbitrary pnp_n9, defining the nn0th OPA to nn1 by

nn2

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 nn3 becomes explicit in spaces where nn4 (Felder, 2020).

The Banach-space version is formally similar but geometrically different. In nn5, nn6, the OPA nn7 minimizes nn8, and uniqueness follows from uniform convexity rather than Hilbert orthogonality (Centner et al., 2023). The same metric-projection interpretation appears in nn9, where

1pf\|1-pf\|0

for 1pf\|1-pf\|1, and the approximant is the unique minimizer of 1pf\|1-pf\|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

1pf\|1-pf\|3

the coefficients satisfy a Gram-system or normal-equation formulation. If

1pf\|1-pf\|4

then 1pf\|1-pf\|5 in the classical 1pf\|1-pf\|6 problem (Bénéteau et al., 2021). In the generalized setting 1pf\|1-pf\|7, the coefficient vector solves

1pf\|1-pf\|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

1pf\|1-pf\|9

If gpf\|g-pf\|0 is an orthonormal basis for gpf\|g-pf\|1, then

gpf\|g-pf\|2

and in gpf\|g-pf\|3 this identifies OPA with reproducing kernels and reversed orthogonal polynomials on the unit circle (Bénéteau et al., 2021). The formula

gpf\|g-pf\|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 gpf\|g-pf\|5 is a monic polynomial of degree gpf\|g-pf\|6 with simple zeros gpf\|g-pf\|7, then the residual gpf\|g-pf\|8 can be written in terms of a fixed gpf\|g-pf\|9 kernel Gram matrix

gg0

and

gg1

This reduces the problem to inversion of a matrix whose size depends on gg2, not on gg3, and yields explicit coefficient formulas and distance formulas such as

gg4

(Bénéteau et al., 2019). For gg5, 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 gg6 in a scale of spaces on the unit ball with kernel gg7 (Sargent et al., 2020).

3. Banach-space theory in gg8, gg9, and HpH^p0

Outside the Hilbert setting, the OPA problem becomes genuinely nonlinear. In HpH^p1, HpH^p2, the minimizer exists and is unique because HpH^p3 is uniformly convex, but orthogonality must be replaced by Birkhoff–James orthogonality (Centner et al., 2023). James’s criterion gives

HpH^p4

and this criterion underlies the characterization of OPA in HpH^p5 and HpH^p6 alike (Cheng et al., 2023).

A central substitute for the Hilbert-space Pythagorean theorem is a family of HpH^p7-Pythagorean inequalities. The HpH^p8 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 HpH^p9 minimizing Ap\ell_A^p0, and the degree-one approximant satisfies nonlinear identities involving integral quantities such as

Ap\ell_A^p1

with analogous formulas for Ap\ell_A^p2 and Ap\ell_A^p3, 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 Ap\ell_A^p4, the metric projections Ap\ell_A^p5 converge in norm to the metric projection of Ap\ell_A^p6 onto the invariant subspace Ap\ell_A^p7, and the map Ap\ell_A^p8 is continuous for fixed Ap\ell_A^p9; for bounded Hω2H^2_\omega0, Hω2H^2_\omega1 uniformly on Hω2H^2_\omega2 when Hω2H^2_\omega3 (Cheng et al., 2023).

The Hω2H^2_\omega4 extension places OPA in a still wider framework. For Hω2H^2_\omega5, Hω2H^2_\omega6 is defined by

Hω2H^2_\omega7

Existence holds for all Hω2H^2_\omega8, uniqueness holds for Hω2H^2_\omega9, and uniqueness can fail for pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.0 and pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.1 (Centner, 2021). In pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.2, one recovers the Hilbert-space orthogonality system and a first-degree zero-free criterion: pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.3 For general pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.4, the characterizing equations become

pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.5

which is the pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.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 pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.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 pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.8, the minimal possible modulus of an OPA zero is governed by the nonlinear extremal quantity

pn=argmindegpn1pfHω2.p_n=\arg\min_{\deg p\le n}\|1-pf\|_{H^2_\omega}.9

and a major result identifies pnp_n00 with half the norm of a Jacobi matrix pnp_n01: pnp_n02 Hence there exists an OPA zero in the open unit disk if and only if pnp_n03 (Bénéteau et al., 2016). In Dirichlet-type spaces pnp_n04, this yields a dichotomy: if pnp_n05, OPA zeros stay outside pnp_n06; if pnp_n07, zeros may occur inside pnp_n08 (Bénéteau et al., 2016).

In Banach spaces the geometry changes substantially. In pnp_n09, pnp_n10, pnp_n11, the set of all possible OPA zeros is exactly

pnp_n12

for some constant pnp_n13; thus the excluded disk has radius strictly between pnp_n14 and pnp_n15, and extra zeros inside pnp_n16 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 pnp_n17, the full zero-free theory for pnp_n18 remains incomplete, but several strong results are known. If pnp_n19 is inner, or if pnp_n20 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 pnp_n21 (Centner et al., 2023). More generally, if pnp_n22, pnp_n23, and pnp_n24, then all OPA pnp_n25 are zero-free in a disk centered at the origin whose radius is controlled by the degree-zero error: pnp_n26 (Centner, 2021). The same work states the conjectural picture explicitly: if pnp_n27, pnp_n28, and pnp_n29, then pnp_n30 should be zero-free in pnp_n31 (Centner, 2021).

Recent work on metric projections in pnp_n32 reframes the zero question through invariant subspaces. If pnp_n33 with pnp_n34, then the zeros of pnp_n35 eventually leave every compact subset of pnp_n36 as pnp_n37, and if pnp_n38 are the zeros of pnp_n39 in pnp_n40, then their product satisfies an explicit lower bound involving pnp_n41 and the inner factor pnp_n42 of pnp_n43 (Bénéteau et al., 11 Nov 2025). The same paper identifies as a central open problem whether OPA in pnp_n44, pnp_n45, can have zeros in pnp_n46; in pnp_n47, they cannot (Bénéteau et al., 11 Nov 2025).

In the Hardy pnp_n48 case, the zeros of OPA can also be studied through orthogonal polynomials on the unit circle. For the boundary weight pnp_n49, the OPA are reversed OPUC, and their zeros therefore lie outside pnp_n50. For generalized Jacobi-type weights, the zeros satisfy explicit electrostatic balance laws, with repelling charges at singular points on pnp_n51, an attracting charge at the origin, and additional charges at zeros of an electrostatic partner polynomial pnp_n52 (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, pnp_n53 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,

pnp_n54

(Bénéteau et al., 2021). This connects approximation of pnp_n55 to shift-invariant subspaces and to the larger problem of identifying cyclic vectors.

For polynomial pnp_n56 in weighted Hardy-type Hilbert spaces, boundary and compact-set convergence can be made highly explicit. If pnp_n57 is a polynomial with simple zeros and no zeros in pnp_n58, then in pnp_n59 or pnp_n60 the sequence pnp_n61 is uniformly bounded in the Wiener algebra norm, hence uniformly bounded on pnp_n62, and

pnp_n63

uniformly on compact subsets of pnp_n64 (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 pnp_n65 (Bénéteau et al., 2019).

The projection onto the full invariant subspace generated by pnp_n66 is the limit object behind these finite approximants. In general reproducing kernel Hilbert spaces on the disk, the projections pnp_n67 converge strongly to pnp_n68, and stabilization occurs precisely when this limiting projection is already achieved by a finite polynomial multiple (Felder, 2020). For pnp_n69, the following are equivalent after some index pnp_n70: the OPA are truncations of a single power series, the OPA stabilize, and pnp_n71 (Felder, 2020). Stabilization is further characterized by a rigid inner-type factorization

pnp_n72

where pnp_n73 is pnp_n74-inner (Felder, 2020).

Inner functions occupy an extreme position in this theory. In reproducing kernel Hilbert spaces with orthogonal monomials, an pnp_n75-inner function pnp_n76 satisfies

pnp_n77

and then every OPA to pnp_n78 is constant; moreover,

pnp_n79

(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 pnp_n80. For a closed pnp_n81-invariant subspace pnp_n82, the metric projection

pnp_n83

governs the asymptotics of the finite-dimensional approximants pnp_n84 (Bénéteau et al., 11 Nov 2025). When pnp_n85 is factored into inner and outer parts, the exact distance from pnp_n86 to the invariant subspace is

pnp_n87

and, for pnp_n88, the projection is generally not inner but of the form

pnp_n89

(Bénéteau et al., 11 Nov 2025). This marks a sharp departure from the pnp_n90 theory.

A nonlinear universality phenomenon also appears. If pnp_n91 is closed of measure zero, then the set of pnp_n92 whose OPA have subsequences universal on pnp_n93 is pnp_n94-dense in pnp_n95; 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 pnp_n96 (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 pnp_n97 with dense polynomials and bounded coordinate shifts, one fixes an ordering of monomials pnp_n98, defines pnp_n99, and sets

nn00

The coefficients solve a Gram system

nn01

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 nn02 in a scale of unit-ball spaces with kernel nn03, 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, nn04 leads to OPA of the form

nn05

for a one-variable approximant nn06 (Sargent et al., 2020).

The notion also extends beyond scalar analytic-function spaces. For rational matrix functions nn07, one may seek the best polynomial approximation to nn08 from the Krylov space nn09. The Arnoldi-OR method computes

nn10

so nn11 for the degree-nn12 polynomial that is optimal in the nn13-norm (Chen et al., 2023). The resulting least-squares problem is built from Arnoldi Hessenberg matrices and requires nn14 extra Arnoldi steps (Chen et al., 2023).

A different operator-valued extension appears in the nn15-product treatment of non-autonomous linear ODEs. There the target is the nn16-resolvent action nn17, approximated by nn18-polynomials

nn19

that minimize a nn20-norm induced by the nn21-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

nn22

(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 nn23: one seeks a polynomial nn24 minimizing nn25, 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).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (16)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Optimal Polynomial Approximants (OPA).