We determine exactly when the globally asymptotically stable cubic family introduced by Liu and Fitzsimmons admits polynomial Lyapunov certificates. In their normalization, with damping $a>0$ and angular forcing $b\in \mathbb{R}$, the criterion is $|b|^{2/3}<1+a^{2/3}$. The same strict inequality characterizes positive homogeneous polynomial certificates with weak nonpositive Lie derivative, strict polynomial certificates, and local real-analytic certificates. Equality admits none of them. Below the threshold we construct a certificate as a finite product of positive quadratic forms. The proof pairs positive harmonic functions with an explicit analytic square-root test and constructs a complementary limiting harmonic pair at the boundary. Poisson smoothing and equal-weight quantiles then produce a polynomial with a strict margin. At a fixed nonzero boundary point, an explicit sufficient degree is $O_b(\delta^{-3})$, where $\delta$ is the damping excess, while the minimum degree diverges; no matching degree rate is asserted. The threshold persists for every single even angular harmonic and nonzero angular speed. Classical binary-form factorization gives the corresponding sum-of-squares consequence without increasing the Lyapunov degree. The family, its global stability and the original counterexample to a polynomial converse theorem are prior results. Our classification concerns certificates, not a change in dynamical stability.
Working paper. Citable, but not yet screened for the AIRR collection.
Research paperWorking paperARR-2026-2XFZW9FFEA8SXTXF · v1
We characterize polynomial Lyapunov existence over all degrees for planar homogeneous polynomial fields with nonvanishing angular velocity. A moment threshold separates strict polynomial certificates from the absence of local analytic weak certificates in the stable case. Classical confluent Nevanlinna-Pick interpolation gives a finite convex semialgebraic formulation, with exact boundary decision for algebraic coefficients. For each odd field degree, the certificate region is open and semialgebraic, and compact admissible families have a computable common certificate degree. For rational fields in dense binary encoding, we prove polynomial-time additive approximation of the threshold and polynomial-time decision under a supplied positive gap promise. Explicit inner and outer radii permit a classical weak convex optimization reduction; a uniform functional perturbation argument handles algebraic poles without constructing their common number field. This approximates a value and does not bound the output size of a Lyapunov polynomial polynomially. Jackson bounds and a constructive sufficient-degree estimate complement the finite formulation. An exact cubic example has an algebraic threshold and minimum Lyapunov degree eight at one rational parameter. Beyond the rotating class, a boundary-factor obstruction produces a full twelve-dimensional rational box of stable quintic fields with sign-changing angular velocity and no local analytic weak certificate. One explicit rational C1 Lyapunov function works for the entire box. The latter result is a sufficient obstruction, not a general classification with angular zeros. General certified solver implementations are not supplied.
Working paper. Citable, but not yet screened for the AIRR collection.
