Hermitian Polynomial: Definitions & Applications

• Hermitian polynomial is a concept encompassing various constructions that preserve spectral symmetry in matrices, complex variables, and free *-algebras.
• It is applied in polynomial filtering to isolate spectral intervals in eigenvalue problems and to design quantum algorithms using Chebyshev approximations.
• Its variants inform sums of squares representations, algebraic positivity conditions, and optimization techniques across both commutative and noncommutative settings.

Searching arXiv for recent and foundational papers on “Hermitian polynomial” across major mathematical usages. to=arxiv_search tool code 的天天彩票{"^^^^^^^^5query5 polynomial\" OR ^^^^^^^^5all:\5 symmetric polynomial\" OR ^^^^^^^^5all:\5 polynomial filtering\" OR ^^^^^^^^5all:\5 matrix polynomials\"","max_results":^^^^5all:\5query5^^^^,"sort_by":"relevance"} Relevant arXiv results include work on Hermitian polynomial filtering for eigenproblems, Hermitian symmetric polynomials and Hilbert’s ^^^^5all:\5^^^^7th problem, Hermitian sums of squares, root counting with conjugate variables, noncommutative Hermitian squares, and matrix-polynomial synthesis for Hermitian operators. A Hermitian polynomial is not a single universally fixed object. In current mathematical and computational literature, the term denotes several related but distinct constructions: a polynomial PRESERVED_PLACEHOLDER_^^^^5query5^^^^ of a Hermitian matrix or operator; a Hermitian symmetric polynomial in complex variables with a Hermitian coefficient matrix; a self-adjoint element PRESERVED_PLACEHOLDER_^^^^5all:\5^^^^ in a free PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^-algebra; specialized univariate locator and evaluator polynomials in decoding Hermitian codes; and, in some matrix-theoretic settings, the characteristic polynomial of a Hermitian matrix (&&&^^^^5query5^^^^&&&, &&&^^^^5all:\5^^^^&&&, &&&^^^^5 OR all:\5^^^^&&&, &&&^^^^5 OR all:\5^^^^&&&, &&&^^^^5 OR all:\5^^^^&&&). The unifying theme is compatibility with an involution—complex conjugation, adjoint, or spectral symmetry—but the algebraic structure, positivity notion, and applications vary substantially from one context to another.

^^^^5all:\5^^^^. Terminological scope and defining structures

In numerical linear algebra, a Hermitian matrix PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^ satisfies PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^, has a real spectrum $\lambda_1\ge \cdots \ge \lambda_n$, and admits an orthonormal eigenbasis. If $p_m$ is a real polynomial, then $p_m(A)$ is again Hermitian and diagonalizable in the same eigenbasis, with eigenvalues $p_m(\lambda_i)$ obtained by pointwise application of the polynomial to the spectrum. In this setting, “Hermitian polynomial” refers to a polynomial filter $p_m(A)$ designed to isolate prescribed spectral intervals (&&&^^^^5query5^^^^&&&).

In several complex variables, the standard object is a polynomial in PRESERVED_PLACEHOLDER_^^^^5all:\5query5^^^^ and PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5^^^^ whose coefficient matrix is Hermitian. Writing

PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5^^^^

Hermitian symmetry means PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5^^^^, equivalently that PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5^^^^ is real-valued on PRESERVED_PLACEHOLDER_^^^^5all:\55^^^^. In polarized form, bihomogeneous Hermitian symmetric polynomials correspond to Hermitian forms and admit signature invariants PRESERVED_PLACEHOLDER_^^^^5all:\5^^^^6 recording the numbers of positive and negative eigenvalues of the associated Hermitian matrix (&&&^^^^5all:\5^^^^&&&, D'Angelo et al., 2010).

In noncommutative algebra, one works in the free PRESERVED_PLACEHOLDER_^^^^5all:\5^^^^7-algebra PRESERVED_PLACEHOLDER_^^^^5all:\5^^^^8, where the involution fixes the generators and reverses words. A polynomial is Hermitian if PRESERVED_PLACEHOLDER_^^^^5all:\5^^^^9. Under evaluation on self-adjoint operators or symmetric matrices, such a polynomial remains Hermitian, and positivity is formulated through operator inequalities and sums of Hermitian squares (&&&^^^^5 OR all:\5^^^^&&&, Garcia et al., 16 Mar 2025).

Other usages are more specialized. In Hermitian code decoding, a “Hermitian polynomial” can mean a univariate error locator polynomial PRESERVED_PLACEHOLDER_^^^^5 OR all:\5query5^^^^ or error evaluator polynomial PRESERVED_PLACEHOLDER_^^^^5 OR all:\5all:\5^^^^, obtained after reducing a bivariate Hermitian-curve decoding problem to a univariate one under semi-erasure decoding (&&&^^^^5 OR all:\5^^^^&&&). In random-matrix and spectral theory, the phrase may refer to the characteristic polynomial of a Hermitian matrix, whose zeros are real and whose coefficients encode traces, moments, and spectral constraints (&&&^^^^5 OR all:\5^^^^&&&, &&&^^^^5all:\5 OR all:\5^^^^&&&).

^^^^5 OR all:\5^^^^. Hermitian matrix polynomials and spectral filtering

For Hermitian eigenvalue problems, the spectral theorem gives

PRESERVED_PLACEHOLDER_^^^^5 OR all:\5 OR all:\5^^^^

This identity makes polynomial filtering effective: one chooses PRESERVED_PLACEHOLDER_^^^^5 OR all:\5 OR all:\5^^^^ to be close to PRESERVED_PLACEHOLDER_^^^^5 OR all:\5 OR all:\5^^^^ on a target interval PRESERVED_PLACEHOLDER_^^^^5 OR all:\55^^^^ and small outside, so that PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^6 amplifies components in the invariant subspace associated with eigenvalues in PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^7 and attenuates the others. In practice, the spectrum is first mapped to PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^8 by

PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^9

and the filter is expanded in Chebyshev polynomials, which can be applied matrix-free through the three-term recurrence (&&&^^^^5query5^^^^&&&).

A central implementation is the Thick-Restart Lanczos algorithm with deflation and polynomial filtering. After each restart, selected Ritz vectors are retained, converged vectors are locked, and the filtered operator PRESERVED_PLACEHOLDER_^^^^5 OR all:\5query5^^^^ is applied through Chebyshev recurrences. The paper constructs filters by a least-squares approximation to a Dirac-PRESERVED_PLACEHOLDER_^^^^5 OR all:\5all:\5^^^^ spike centered at PRESERVED_PLACEHOLDER_^^^^5 OR all:\5 OR all:\5^^^^, uses Jackson or Lanczos PRESERVED_PLACEHOLDER_^^^^5 OR all:\5 OR all:\5^^^^-damping to reduce Gibbs oscillations, and chooses the degree PRESERVED_PLACEHOLDER_^^^^5 OR all:\5 OR all:\5^^^^ through a “bar” value PRESERVED_PLACEHOLDER_^^^^5 OR all:\55^^^^ so that PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^6 and PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^7 fall below threshold. This supports spectrum slicing, in which different subintervals are treated independently and naturally in parallel (&&&^^^^5query5^^^^&&&).

More recent work replaces fixed-degree filters by adaptive Chebyshev step filters inside filtered subspace iteration. There, a partial degree PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^8 is selected at each iteration by monitoring the ratio of filtered Ritz values, and convergence is controlled by pointwise bounds for the step-function approximation in both undamped and damped settings. The same framework incorporates a spurious Ritz-value detection criterion based on the residual norm and the distance to the interval endpoints, and accelerates the dominant filtering step with MaSpMM. On the reported benchmarks, the method achieved average speedups of approximately PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^9 over EVSL-PSI and approximately PRESERVED_PLACEHOLDER_^^^^5 OR all:\5query5^^^^ over CJ-FEAST (&&&^^^^5all:\55^^^^&&&).

The matrix-polynomial sense also appears in quantum algorithms. For a Hermitian contraction PRESERVED_PLACEHOLDER_^^^^5 OR all:\5all:\5^^^^, the identity

PRESERVED_PLACEHOLDER_^^^^5 OR all:\5 OR all:\5^^^^

allows one to rewrite powers PRESERVED_PLACEHOLDER_^^^^5 OR all:\5 OR all:\5^^^^ as PRESERVED_PLACEHOLDER_^^^^5 OR all:\5 OR all:\5^^^^, and hence any polynomial PRESERVED_PLACEHOLDER_^^^^5 OR all:\55^^^^ as PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^6. This yields a block-encoding-free synthesis of Hermitian matrix polynomials using Generalized Quantum Signal Processing and postselection, with two ancillas and success probability

PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^7

for the desired branch (&&&^^^^5all:\5^^^^6&&&).

^^^^5 OR all:\5^^^^. Hermitian symmetric polynomials in complex variables

A Hermitian symmetric polynomial is a polynomial in complex variables and their conjugates whose coefficient matrix is Hermitian. Such a polynomial admits a holomorphic decomposition

PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^8

and the signature pair PRESERVED_PLACEHOLDER_^^^^5 OR all:\5^^^^9 and rank $\lambda_1\ge \cdots \ge \lambda_n$^^^^5query5^^^^ are basic invariants. The class $\lambda_1\ge \cdots \ge \lambda_n$^^^^5all:\5^^^^ consists of squared norms, while $\lambda_1\ge \cdots \ge \lambda_n$^^^^5 OR all:\5^^^^ consists of those Hermitian symmetric polynomials for which $\lambda_1\ge \cdots \ge \lambda_n$^^^^5 OR all:\5^^^^ is positive semidefinite for every $\lambda_1\ge \cdots \ge \lambda_n$^^^^5 OR all:\5^^^^-tuple of points. One has $\lambda_1\ge \cdots \ge \lambda_n$5 (&&&^^^^5all:\5^^^^&&&).

The Hermitian analogue of Hilbert’s $\lambda_1\ge \cdots \ge \lambda_n$6-th problem asks when nonnegative Hermitian symmetric polynomials can be represented as quotients or divisors of squared norms. The positivity classes

$\lambda_1\ge \cdots \ge \lambda_n$7

are generally strict, but a central theorem establishes $\lambda_1\ge \cdots \ge \lambda_n$8: a nonnegative Hermitian symmetric polynomial divides a nonzero squared norm if and only if it is a quotient of squared norms (&&&^^^^5all:\5^^^^&&&). This is a decisive difference from the real case, where a single square multiplier suffices after Artin.

Several explicit families illustrate the fine stratification of positivity. For

$\lambda_1\ge \cdots \ge \lambda_n$9

one has $p_m$^^^^5query5^^^^ iff $p_m$^^^^5all:\5^^^^, $p_m$^^^^5 OR all:\5^^^^ iff $p_m$^^^^5 OR all:\5^^^^, and $p_m$^^^^5 OR all:\5^^^^ iff $p_m$5. Such examples show that nonnegativity does not coincide with being a squared norm, and that zero-set geometry imposes strong additional restrictions (&&&^^^^5all:\5^^^^&&&).

This theory is closely tied to CR geometry. Hermitian symmetric polynomials encode target hyperquadrics through their signature pairs, and products of indefinite Hermitian forms can exhibit striking rank collapse. Except for the trivial cases $p_m$6, $p_m$7, and $p_m$8, every signature pair can arise as the signature of a product of two indefinite Hermitian symmetric polynomials (D'Angelo et al., 2010). Quillen’s Positivstellensatz supplies another foundational bridge: if a Hermitian bihomogeneous polynomial is strictly positive on the unit sphere, then for sufficiently large $p_m$9,

$p_m(A)$^^^^5query5^^^^

and an elementary proof can be given through the eventual positive-definiteness of an associated integral operator (&&&^^^^5 OR all:\5all:\5^^^^&&&).

^^^^5 OR all:\5^^^^. Noncommutative Hermitian polynomials and sums of Hermitian squares

In the free $p_m(A)$^^^^5all:\5^^^^-algebra $p_m(A)$^^^^5 OR all:\5^^^^, Hermitian polynomials are the self-adjoint elements $p_m(A)$^^^^5 OR all:\5^^^^. If $p_m(A)$^^^^5 OR all:\5^^^^ is a tuple of self-adjoint operators or symmetric matrices, then $p_m(A)$5 is Hermitian whenever $p_m(A)$6 is. The basic positivity cone is the set of sums of Hermitian squares

$p_m(A)$7

which evaluates to positive semidefinite operators under every Hermitian substitution (&&&^^^^5 OR all:\5^^^^&&&).

This leads to noncommutative polynomial optimization. One minimizes a Hermitian nc polynomial $p_m(A)$8 subject to Hermitian constraints $p_m(A)$9, and relaxes the problem through quadratic modules

$p_m(\lambda_i)$^^^^5query5^^^^

Under Archimedean assumptions, positivity on the operator semialgebraic set implies membership in $p_m(\lambda_i)$^^^^5all:\5^^^^, and moment/localizing matrix hierarchies yield convergent semidefinite programs. In the unconstrained case, matrix positivity is equivalent to membership in $p_m(\lambda_i)$^^^^5 OR all:\5^^^^: $p_m(\lambda_i)$^^^^5 OR all:\5^^^^ for all symmetric $p_m(\lambda_i)$^^^^5 OR all:\5^^^^ if and only if $p_m(\lambda_i)$5 (&&&^^^^5 OR all:\5^^^^&&&).

The same section of the literature also studies specific Hermitian polynomials arising from complete homogeneous symmetric polynomials. If $p_m(\lambda_i)$6 denotes the fully symmetrized noncommutative lift of the even-degree complete homogeneous symmetric polynomial, then $p_m(\lambda_i)$7 is a sum of $p_m(\lambda_i)$8 Hermitian squares, and this number is minimal. Moreover, for Hermitian operators $p_m(\lambda_i)$9,

$p_m(A)$^^^^5query5^^^^

with an explicit best possible constant $p_m(A)$^^^^5all:\5^^^^ (Garcia et al., 16 Mar 2025). The result is described as a noncommutative generalization of Hunter’s positivity theorem and produces new sum-of-squares representations even in the scalar commutative case.

A notable limitation is that positivity does not extend uniformly to arbitrary symmetrized Schur polynomials. The paper gives

$p_m(A)$^^^^5 OR all:\5^^^^

as a concrete example of a fully symmetrized nc polynomial that is not positive semidefinite on Hermitian matrix pairs, underscoring that complete homogeneous symmetric polynomials occupy a special position in the noncommutative theory (Garcia et al., 16 Mar 2025).

5. Conjugate-variable, ideal-theoretic, and coding-theoretic usages

Another important usage concerns generalized polynomials in a complex variable and its conjugate. Writing

$p_m(A)$^^^^5 OR all:\5^^^^

one may regard $p_m(A)$^^^^5 OR all:\5^^^^ and impose $p_m(A)$5 only at evaluation. For systems with conjugate variables, the Hermitian Killing form

$p_m(A)$6

is a Hermitian sesquilinear form on the quotient algebra $p_m(A)$7, where $p_m(A)$8 is generated by the mixed-variable equations and their conjugates. Its signature counts “conjugated singles,” that is, true zeros $p_m(A)$9, and yields new bounds for harmonic polynomials PRESERVED_PLACEHOLDER_^^^^5all:\5query5query5^^^^. In particular, if PRESERVED_PLACEHOLDER_^^^^5all:\5query5all:\5^^^^, PRESERVED_PLACEHOLDER_^^^^5all:\5query5 OR all:\5^^^^, and PRESERVED_PLACEHOLDER_^^^^5all:\5query5 OR all:\5^^^^, then PRESERVED_PLACEHOLDER_^^^^5all:\5query5 OR all:\5^^^^ admits at most PRESERVED_PLACEHOLDER_^^^^5all:\5query55^^^^ or PRESERVED_PLACEHOLDER_^^^^5all:\5query5^^^^6 solutions depending on whether PRESERVED_PLACEHOLDER_^^^^5all:\5query5^^^^7 vanishes (&&&^^^^5 OR all:\5^^^^6&&&).

Hermitian ideals provide a related but distinct framework. In PRESERVED_PLACEHOLDER_^^^^5all:\5query5^^^^8, a Hermitian polynomial is fixed by the involution PRESERVED_PLACEHOLDER_^^^^5all:\5query5^^^^9, and one asks when it can be written as a Hermitian sum of squares modulo a Hermitian ideal PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5query5^^^^. For the one-variable ideals PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5all:\5^^^^, matrix positivity conditions on orbit Gram matrices are not only necessary but sufficient, and are equivalent to the positivity of an associated block Toeplitz matrix and to an operator-valued Riesz–Fejér factorization (&&&^^^^5 OR all:\5^^^^7&&&). This is a concrete Hermitian Positivstellensatz on a specific algebraic variety.

In coding theory, the terminology changes again. For Hermitian codes over PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5 OR all:\5^^^^, a “Hermitian polynomial” refers to the univariate error locator polynomial PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5 OR all:\5^^^^ and error evaluator polynomial PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5 OR all:\5^^^^ used after semi-erasure reduction. The central gain is that a bivariate search over PRESERVED_PLACEHOLDER_^^^^5all:\5all:\55^^^^ affine points becomes a univariate Chien-like search over PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5^^^^6 points, and the Reed–Solomon Forney formula carries over directly: PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5^^^^7 The paper explicitly notes that this meaning is unrelated to Hermite orthogonal polynomials from analysis (&&&^^^^5 OR all:\5^^^^&&&).

6. Characteristic polynomials of Hermitian matrices and related spectral constructions

In several matrix-theoretic papers, “Hermitian polynomial” means the characteristic polynomial of a Hermitian matrix. Because Hermitian spectra are real, these polynomials have real zeros, and their averages under Hermitian matrix diffusion satisfy exact diffusion-type equations: PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5^^^^8 Their integral representations lead to Airy asymptotics at soft edges and Pearcey asymptotics at cusp-merging points, while the logarithmic derivative of the averaged characteristic polynomial obeys a viscous Burgers equation (&&&^^^^5 OR all:\5^^^^&&&).

Arithmetic restrictions become prominent when the Hermitian matrix entries are roots of unity. If PRESERVED_PLACEHOLDER_^^^^5all:\5all:\5^^^^9 is a Hermitian matrix with entries in PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5query5^^^^, then

PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5all:\5^^^^

and the residue classes of PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5 OR all:\5^^^^ modulo powers of PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5 OR all:\5^^^^ satisfy explicit upper bounds. For PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5 OR all:\5^^^^ with PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\55^^^^ odd prime, for example,

PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5^^^^6

while two-adic cases exhibit additional parity-dependent structure (&&&^^^^5 OR all:\5query5^^^^&&&).

Characteristic polynomial coefficients also encode refined spectral data. Using traces PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5^^^^7 and Hankel determinants, one can reconstruct the minimal polynomial, factor the characteristic polynomial by grouping eigenvalues with the same multiplicity, and compute monotone rational approximations to the minimal eigenvalue gap and to the extremal eigenvalues. The same symbolic framework yields invariants for classifying unitary orbits of Hermitian operators (&&&^^^^5all:\5 OR all:\5^^^^&&&).

For cubic polynomials, the almost-companion-matrix approach shows that a monic cubic is the characteristic polynomial of a Hermitian PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5^^^^8 matrix if and only if its coefficients are real and the depressed discriminant satisfies PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5^^^^9. The same paper gives a complete coefficient characterization for cubic unitary ACMs and uses structured Hermitian or unitary realizations as an alternative route to root finding (&&&^^^^5 OR all:\5 OR all:\5^^^^&&&).

A different but related tradition derives orthogonal polynomials of a discrete variable from Hermitian Jacobi matrices. There, “Hermitian” refers to real symmetric tridiagonal operators PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5query5^^^^ whose eigenvalue problem produces orthogonal polynomial systems through factorization, shape invariance, and exact Heisenberg evolution. The resulting polynomials are not classical Hermite polynomials; rather, they belong to discrete families such as Krawtchouk, Hahn, Racah, Meixner, Charlier, and their PRESERVED_PLACEHOLDER_^^^^5all:\5 OR all:\5all:\5^^^^-analogues (&&&^^^^5 OR all:\5 OR all:\5^^^^&&&).