Searcharxiv⌕ Search

arXiv · 2610.24417

Certified Fourier rounding for the real Grothendieck inequality

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bo Peng. 2026-10-17. Certified Fourier rounding for the real Grothendieck inequality. https://arxiv.org/abs/2610.24417

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

KEEP EXPLORING

Related papers

Quaternionic Quantum q-Oscillator and Unbounded Subnormal Operators

In this note, we observe that the class of unbounded subnormal operators on quaternionic Hilbert spaces is a solution of quaternionic q-oscillator problem whose complex case is addressed by Szefraniec in [27]. We also address the connection of unbounded subnormal operators on quaternionic Hilbert spaces, quaternionic quantum harmonic q-oscillator and quaternionic quantum Economics using model theory of unbounded subnormal operators. Moreover, we study model theory for sub-2-normal operators on quaternionic Hilbert space.

math.FA↗

Weak type $(1,1)$ estimates for noncommutative rough singular integrals

We establish the weak type \((1,1)\) endpoint estimate for operator-valued rough singular integrals with kernels satisfying the classical \(L\log L\) integrability and cancellation conditions. This extends Seeger's endpoint theorem [{J. Amer. Math. Soc.} \textbf{9} (1996)] to the noncommutative setting. A key ingredient is an off-diagonal analysis that controls interactions between different kernel scales and avoids an additional logarithmic loss.

math.FA↗

Zero-trace index of matrices

The zero-trace index $t(A)$ of a square complex matrix $A$ is introduced. It is defined as the largest integer $k$ such that $A$ admits a $k \times k$ compression with trace zero. This concept is analogous to the zero-dilation index $d(A)$ and is closely related to the $k$-numerical range. The $k$-numerical range is characterized as an intersection of half-planes, which is used to derive a formula for $t(A)$ that reduces its computation to the Hermitian case. Conditions for $t(A) = d(A)$ are also established, and matrices satisfying $t(A) = n - 1$ are characterized. Finally, the zero-trace index is determined for several classes of matrices.

math.FA↗