Work

The Simultaneous Rectangle for Systems, without Homotopy: All the Solutions of a Polynomial System, Each in a Certified Ball, with a Proof That None Is Missing

Year: 2026
Type: preprint
Abstract: This note carries the simultaneous rectangle of The Simultaneous Rectangle (G8) from one polynomial to a system of n polynomial equations in n unknowns, without homotopy continuation. The points start on the solutions of a start system and are swept on the system itself with the rectangle step of order three (the three means of V29 read on Newton's line, and the part of the second-order term that the line does not see), each point deflated of its nearest neighbours. What the sweeps do not find comes from the symmetries read on the system, from runs of the step from random points, and from the law of the residues: by the formula of Euler and Jacobi the solutions found determine the moments of the missing ones, which are then eigenvalues of small matrices. Every point passes one certificate (a contraction of a ball, checked in interval arithmetic; a box by Rouché's theorem for a double solution), and the output is complete when as many disjoint balls are certified as a bound of the number of solutions. For sparse systems that bound is the mixed volume, computed by mixed cells; the note shows that one lifting, whatever it is, gives the mixed volume as soon as an exact check meets no tie, so that the count is a proof and not a probability. The measurements are those of the Rust crate pandsysroots 0.21.0. On 40,000 systems of twenty-seven families it returns what is expected on all of them and proves completeness on 39,998. On eighteen classical or large systems (cyclic, noon, Katsura, dense systems of high degree, quadrics, cubics, bilinear systems, eigenvalue problems; up to 6561 solutions and 64 unknowns) it proves completeness on every one; compared with HomotopyContinuation.jl with certification, on one machine and with default settings, it is faster on fourteen, level on two and slower on two. A benchmark of 50,000 polynomials in one unknown against the crate pandroots is included, with the limits of the method: no theorem of convergence, no certificate for a multiplicity above two, no proof of completeness for a system with a curve of solutions. The algebra of the step, the certificate, the laws used by the residues and the argument of the lifting are checked in Lean 4 with Mathlib (64 theorems, no sorry). The source archive contains the paper, the programs of the figures, the Lean files and the measurements. This note replaces the version S1 and is the companion for systems of G8 (https://doi.org/10.5281/zenodo.24257672).
Author: Ivan Besevic
Language: English
Open Access status: green
OpenAlex ID: W7235803478
Cites:
Cited by:
Related to: 10