Skip to content
Preprint

Certified Fourier rounding for the real Grothendieck inequality

Oct 2026 · 0 citations · 8 references
Mathematics Computer Science

Abstract

We give a computer-assisted proof that the real Grothendieck constant is strictly smaller than $1.77987164$. The proof provides a complete interval-arithmetic realization of Ren's five-variable construction. A finite Fourier calculation encloses every scalar coefficient through degree $403$; a fourth-derivative estimate on the entire unit circle bounds the remaining coefficient sum by $10^{-4}$. Exact rational arithmetic then certifies the final inequality. We include the transfer to all finite real matrices and arbitrary vector dimensions, the analytic quadrature errors, the rational parameters, and source code for checking and regenerating the certificate.

View source

Similar papers

Preprint Sep 2026

A computer-assisted upper bound of 1.7813 for the real Grothendieck constant

We give a computer-assisted proof that the universal real Grothendieck constant satisfies $K_G^{\mathbb R}\le 1.7813$. The construction combines an explicit odd Hermite threshold of degree $11$ with a signed correlation polynomial of degree $51$. A sufficient inverse-majorant inequality is certified by enclosing the sc...

Bo Peng · 0 citations
Preprint Oct 2026

Primal/Dual Method for the Grothendieck Constant

We determine the hundredths digit of the real Grothendieck constant by proving $1.773 \leq K_G \leq 1.7799$. Furthermore, numerical heuristics suggest the estimate $K_G \approx 1.779$. We start by simplifying the Gaussian duality theory of $K_G$, based on Hermite projection games and Krivine rounding schemes. The bound...

Steven Heilman, Chris Jones, Giulio Malavolta · 1 citation
Preprint Oct 2026

A Proof of the Third and Cubic Borwein Conjectures

We establish the coefficient sign patterns in the Third Borwein conjecture and the modulus-three Cubic Borwein conjecture. The analytic arguments apply for $n\ge1750$ and $n\ge500$, respectively. They combine exact dissections and positive coefficient identities near the boundary with saddle point estimates that preser...

Yi-Cen Ma · 1 citation · ⚡1
Preprint Oct 2026

An explicit elementary proof of no Landau--Siegel zeros

We give an elementary proof of the absence of Landau--Siegel zeros with the explicit constant $c=1/100$. For every primitive quadratic Dirichlet character $\chi$ of conductor $q\ge3$, each real zero $\beta\in(0,1)$ of $L(s,\chi)$ satisfies $(1-\beta)\log q>c$. The proof combines integer coefficient counting, polynomial...

V. Z. Guo · 0 citations
Preprint Sep 2026

An Improved Lower Bound for the Complex Grothendieck Constant

We prove $K_G^{\mathbb{C}}>1.35584631827168$ for the classical complex Grothendieck constant, closing more than one quarter of the gap between Davie's lower bound and Haagerup's upper bound. The numerical part of the proof is rigorously verified by interval arithmetic. The lower bound and the proof were discovered by t...

Sheng Guo, Ethan X. Fang, Jun-Wei Lu · 1 citation
Sep 2026

Sharper Bounds for the Complex Grothendieck Constant

We show that $1.4<K_G^{\mathbb{C}}<1.404898554746$, where $K_G^{\mathbb{C}}$ is the complex Grothendieck constant. The upper bound improves on Haagerup's bound of $1.40490913\ldots$ from 1987, and the lower bound improves on Davie's bound of $1.33807$ from 1984. The upper bound combines ideas from the real and noncommu...

Steven Heilman, Chris Jones, Giulio Malavolta · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.