Computing Certificates in Archimedean Univariate Saturated Quadratic Modules
Jose Abel Castellanos-Joo, Deepak Kapur

TL;DR
This paper introduces a symbolic algorithm for computing certificates that verify non-negative univariate polynomials belong to saturated quadratic modules, with an implementation demonstrating improved success over existing tools.
Contribution
The paper presents a novel symbolic algorithm for computing sums of squares certificates in univariate saturated quadratic modules, including an implementation and comparison with existing methods.
Findings
Successfully computes certificates where RealCertify fails
Provides a detailed case analysis for different generator types
Implementation in Maple demonstrates practical effectiveness
Abstract
A new symbolic algorithm to compute sums of squares multipliers (certificates) to witness the membership of non-negative univariate polynomials in a saturated univariate quadratic module is presented. Certificates are first computed in terms of natural generators introduced by Kuhlmann and Marshall for an Archimedean saturated quadratic module; natural generators can be easily read-off from a semialgebraic set. In the univariate case, an Archimedean quadratic module is also a preordering since it is closed under multiplication; certificates have different representations when a polynomial is viewed as a member in a quadratic module versus in a preordering An algorithm is given to compute certificates of natural generators in terms of the original generators; it uses a construction introduced by Kuhlmann, Marshall, and Schwartz known as the ``Basic Lemma'', which splits the non-negative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
