Searcharxiv⌕ Search

arXiv · 2610.13463

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

Abstract

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dakai Guo, Ruichen Qiu, Yichuan Cao, Ruyong Feng, Xiao-Shan Gao. 2026-10-09. Exact rational certificates and a Lean formalization of the eleven-variable Vasc inequality. https://arxiv.org/abs/2610.13463

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

RISR: Residual-Informed Scientific Equation Discovery with Large Language Models

Symbolic regression combines structural search with numerical fitting, but aggregate fit scores do not describe how the remaining error varies across inputs. We introduce RISR, a residual-informed method that uses these error patterns to guide formula discovery and learn which corrections are worth fitting. A residual encoder compresses aligned inputs, targets, current predictions, and residuals into continuous tokens that condition a language model to propose formulas. For subsequent refinement, a dual-view relational encoder uses additive and regularized multiplicative residuals to predict the post-fit utility of candidate corrections. We evaluate RISR on scientific tasks from the LLM-SRBench. RISR achieves 63.57% and 38.50% ID accuracy at the 1% and 0.1% pointwise relative-error tolerances, respectively. The corresponding OOD accuracies are 56.07% and 38.24%. RISR outperforms the reported baselines using the same backbone. The results show that our residual-informed approach can improve numerical equation recovery.

cs.SC↗

Parallel Integration over Simple Radical Extensions III: Antiderivatives in Terms of Special Functions

We extend the parallel integration method for mixed towers of Part~II from elementary antiderivatives to antiderivatives in special functions. The class covered is the incomplete gamma function $Γ(s,\cdot)$ at rational $s$, which contains $\Ei$, $\li$, $\Si$, $\Ci$, $\erf$ and the Fresnel integrals, together with the elliptic integrals $F$, $E$, $Π$. Each special function enters through a \emph{kernel}: a known element of the tower whose antiderivative is that function. It is either fixed by residues or added as one more column of the single linear system, and no Risch differential equation is solved. We prove where kernels can have poles; the $\erf$ kernels live in the sub-critical window of radical towers. The denominator theory, degree bounds and certificates of Part~II carry over, and new criteria decide most places that Part~II leaves to a guess. Elliptic integrals are carried by the radical, and a non-torsion residue divisor becomes a third-kind term. We prove that special functions are introduced only when necessary. Elementary answers are returned unchanged, and in strict mode a special function comes with a certificate that the integrand has no elementary integral. When no complete answer is found, a partial answer with a reduced remainder is returned. All examples are computed by a SymPy implementation and verified by differentiation.

cs.SC↗

A Finite Certificate for the Positive $n=11$ Vasc Inequality

We establish the Vasc cyclic inequality for all strictly positive real eleven-tuples by a finite exact certificate. Cyclic rotation places a minimum at the first position, and rank words together with cumulative gaps reduce the problem to $10!=3{,}628{,}800$ homogeneous integer polynomials of degree eleven. Independent coefficient reconstruction proves $3{,}358{,}617$ roots directly. The remaining $270{,}183$ roots are covered by $267{,}952$ ordinary midpoint certificates, $2{,}195$ complete binary subdivision certificates, and $36$ complete certificates containing partial sorting nodes. Each nontrivial leaf is checked by subtracting weighted AM-GM midpoint circuits from a positive multiple of the transformed polynomial and verifying every residual coefficient. Explicit word-set comparisons certify disjointness and exact coverage. We prove the soundness of the leaves and both subdivision rules, then recover the rational inequality by positive denominator clearing and continuity. The resulting proof combines explicit mathematical reductions with independently checked exact integer certificates.

cs.SC↗