← All papers
First page of Exact rational certificates and a Lean formalization of the eleven-variable Vasc inequality

Exact rational certificates and a Lean formalization of the eleven-variable Vasc inequality

Dakai Guo, Ruichen Qiu, Yichuan Cao, Ruyong Feng, Xiao-Shan Gao

cs.SC Oct 9, 2026 · v1
Lean 4 with Mathlib formally verifies the polynomial certificate checks (via native_decide) and the analytic reduction yielding the eleven-variable Vasc inequality.
We prove that the cyclic sum $\sum_{i=0}^{10}(x_i-x_{i+1})/(x_{i+1}+x_{i+2})$ is nonnegative for every strictly positive real eleven-tuple, with indices taken modulo eleven. Clearing denominators reduces the problem to a homogeneous polynomial. Subtracting the smallest coordinate then separates the proof into nonnegativity of a common-translation derivative and nonnegativity on a full boundary face. We supply exact rational polynomial certificates in Gram-matrix form for both statements. The derivative certificate uses a linear multiplier, centered monomials and cyclic averaging; the boundary certificate uses a strictly positive quadratic multiplier and uncentered monomials. Their verification requires 6,069 cyclic coefficient comparisons and 34,304 literal coefficient comparisons. All 606 certificate matrices are certified by integer congruences with strictly diagonally dominant images. A Lean 4 development formally verifies the certificate checks and their connection to the original inequality. The exact certificate data, replay programs, and formal sources are publicly available.

The goal is to prove that the cyclic sum of (x_i - x_{i+1})/(x_{i+1}+x_{i+2}) over eleven strictly positive reals is nonnegative, which is the eleven-variable case of the Vasc inequality.

Clearing denominators gives a degree-eleven polynomial P. Subtracting the minimum coordinate reduces the problem to two conditions: nonnegativity of the common-translation derivative H and nonnegativity of P on the boundary face x_10=0. Exact rational Gram-matrix certificates are supplied for both conditions, and every matrix is shown positive definite by an integer congruence to a strictly diagonally dominant matrix. A Lean 4/Mathlib project proves the matrix checks and sparse-polynomial checks sound, runs the concrete checks with native_decide, and formalizes the analytic assembly.

The Lean theorem VascN11.vasc11_inequality assumes only strict positivity of the coordinates. Verification covers 6,069 cyclic and 34,304 literal coefficient comparisons and 606 certificate matrices. Standalone Python replays of the certificates finish in under 5 seconds each.

ReplayElapsed time (s)Peak RSS (MiB)
Translation4.71131.11
Boundary3.84193.29
Standalone exact replay measurements