AI-Assisted Progress on the Grothendieck Constant: A 2026 Case Study in Human-Machine Mathematical Collaboration
> *"If you can't explain it to a six-year-old, you don't really understand it yourself."* — Richard Feynman
---
A Number That Has Kept Mathematicians Awake for 70 Years
The Grothendieck constant $K_G$ was introduced in 1953 by French mathematician Alexander Grothendieck while studying tensor products of Banach spaces. For seven decades, mathematicians have known only that it lies somewhere between roughly 1.6 and 1.8 — nobody has been able to pin down its exact value, or even the first decimal place with certainty.
In August 2026, a research team from UT Austin, Princeton, and UCLA, working with a long-horizon AI research system, narrowed the interval enough to determine that the first decimal digit is 7.
---
What Does the Grothendieck Constant Measure?
A "Translation Cost" Between Continuous and Discrete Worlds
Imagine an operations researcher with 50 trucks that must each be assigned a binary route choice (go or don't go). Integer programming explodes combinatorially. A common workaround is to relax the variables to continuous values, solve the much easier linear program, then round back to integer decisions. The Grothendieck constant bounds the worst-case ratio between the rounded discrete solution and the true continuous optimum — it is the translation cost between the continuous relaxation and the discrete reality.
Bilinear Forms, Tensor Products, and Quantum Entanglement
At its core, the Grothendieck inequality states that a special class of bilinear forms has bounded behaviour, controlled by a universal constant. Informally, it quantifies the loss in a two-player game when the players are forbidden from communicating versus when they can collude.
Remarkably, this purely functional-analytic object also characterises a fundamental physics question: the gap between classical correlations and quantum correlations in Bell-type experiments. Tsirelson's 1985 work linked the constant to Bell inequalities, making $K_G$ relevant to quantum information theory, quantum computing, and quantum communication.
Why Is It So Hard?
Unlike π or e, $K_G$ has no closed-form formula. Its definition involves an optimisation over infinitely many strategies in infinite-dimensional spaces. Mathematicians have only ever obtained lower bounds (by constructing hard instances) and upper bounds (by exhibiting rounding schemes) — never an exact value.
---
The 70-Year Human Climb
Krivine's Breakthrough (1977)
Jean-Louis Krivine gave the first non-trivial bounds:
- Lower bound: $K_G \geq 1.676$
- Upper bound: $K_G \leq \dfrac{\pi}{2\log(1+\sqrt{2})} \approx 1.782$
- 1976 — Appel and Haken's four-colour theorem: the computer only verified cases.
- 2010s — Machine learning for conjecture generation in knot theory.
- 2024 — AlphaGeometry achieves IMO gold level in structured geometry.
- 2026 — AI contributes expert-validated novelty in open analysis problems with no finite search space.
- Closing the gap on $K_G$ — likely within 5–10 years.
- Generalisation — similar methods may apply to the Goemans–Williamson constant, chromatic numbers, and other Tsirelson-type bounds.
- Better AI systems — stronger metacognition, learned mathematical taste, tighter integration with formal verifiers like Lean 4.
- Beyond mathematics — the human-AI pattern is applicable wherever enormous search spaces must be combined with expert judgement: theoretical physics, drug design, materials science.
- Li, A., Saha, R., Xue, A., Chaudhuri, S., Klivans, A., Kothari, P. K., & Meka, R. (2026). *Long-Horizon AI Research for Grothendieck Constant: A Case Study in Human-AI Mathematical Collaboration*. arXiv:2608.11195.
- Saha, R., Li, A., Xue, A., et al. (2026). *New Upper and Lower Bounds for the Grothendieck Constant*. arXiv:2608.11202.
- Grothendieck, A. (1953). Résumé de la théorie métrique des produits tensoriels topologiques. *Boletim da Sociedade de Matemática de São Paulo*, 8, 1–79.
- Krivine, J.-L. (1977). Sur la constante de Grothendieck. *Comptes Rendus de l'Académie des Sciences de Paris*, A284, A445–A447.
- Naor, A., & Regev, O. (2014). Krivine schemes are optimal. *Proceedings of the AMS*, 142(12), 4315–4320.
- Tsirelson, B. S. (1985). Quantum analogues of Bell's inequalities. *Zapiski Nauchnykh Seminarov LOMI*, 142, 174–194.
- Lakatos, I. (1976). *Proofs and Refutations*. Cambridge University Press.
- Pólya, G. (1957). *How to Solve It* (2nd ed.). Princeton University Press.
- Tao, T. (2007). What is good mathematics? *Bulletin of the AMS*, 44(4), 623–634.
His constructions — later called Krivine schemes — became the foundation for all subsequent bounds.
Reeds's Improvement (1991)
J. A. Reeds refined the lower bound to ≈1.782. Naor and Regev later proved that Krivine schemes are essentially optimal within their framework, making further progress difficult.
The Quantum Information Resurgence (2000s)
Researchers discovered that replacing real numbers with complex numbers yields the complex Grothendieck constant, directly tied to Bell inequalities and the power of quantum entanglement. Knowing $K_G$ precisely would answer how much quantum mechanics can outperform classical correlations.
The 2026 Race
Just before the AI-assisted paper appeared, multiple groups — including Steven Heilman and the Jones–Malavolta team — published competing improvements from different angles.
---
How the AI Entered the Picture
Not Calculation, but Insight
The AI in this work was not crunching numbers — that would have been easy. $K_G$ has no computable closed form. Instead, the system generated novel mathematical constructions: new rounding schemes, proof strategies, and analytical frameworks that domain experts certified as genuinely new.
Long-Horizon Exploration
The system is designed for extended, persistent research:
1. Continuous search across vast strategy spaces (embeddings, rounding functions, dimensions, symmetries). 2. Learning from failure — analysing why a construction failed and adjusting parameters. 3. Context preservation — remembering thousands of prior attempts. 4. Human collaboration — humans supply direction and mathematical taste; AI supplies tireless exploration.
A Beautiful Case: From Failed Upper Bounds to a Successful Lower Bound
The most striking example in the paper is a story of failure turned into success. The team initially asked the AI to find a better upper bound by improving on Krivine's rounding scheme. The AI tried thousands of constructions — different vector embeddings, rounding functions, dimensions — and most failed to beat ≈1.782.
Human mathematicians then noticed that certain intermediate constructions exhibited a special structure with a subtle duality to the lower-bound problem. By repurposing those failed artefacts, the team attacked it from the opposite direction. The result: a new lower bound $\dfrac{6\pi}{11} \approx 1.714$.
This embodies Pólya's dictum from *How to Solve It*: if you can't solve a problem directly, solve a related one. The AI's accumulated "failures" supplied the raw material for the breakthrough.
---
The Technical Contributions
A New Kind of Lower Bound
Classical lower bounds construct a specific hard instance and prove any rounding scheme loses at least X on it. The 2026 paper instead proves a structural limitation: all asymptotically optimal Krivine-type schemes are inherently bounded, regardless of instance. AI-driven large-scale exploration helped identify the geometric bottleneck underlying this limitation.
The First Asymptotic Rounding Scheme
The paper introduces and rigorously analyses the first asymptotic rounding scheme — a family of constructions indexed by dimension whose approximation ratio converges as $d \to \infty$. Where Krivine's low-dimensional scheme compresses information and loses detail, the asymptotic scheme refines the approximation to a precise limit. AI explored the construction space; humans supplied the analytical machinery (random matrix theory, high-dimensional geometry, Fourier analysis).
Two Bounds Together Fix the First Decimal
Combined:
$$1.714 \leq K_G \leq 1.782$$
The first decimal digit is 7. The interval has narrowed by roughly one-third since Krivine. Most importantly, the result demonstrates that fully determining $K_G$ is achievable.
---
What This Means for AI and Mathematics
A Paradigm Shift in AI's Role
This is a qualitative leap: AI as a creative collaborator, not a calculator.
The Ideal "Two-Brain" Collaboration
The authors candidly discuss strengths and weaknesses.
AI strengths: tireless exploration, freedom from intuition bias, large-scale pattern recognition, rapid verification.
AI weaknesses: lacks mathematical taste, cannot sense elegance, generates plausible-looking but subtly flawed proofs, lacks metacognition about its own uncertainty.
The collaborative loop:
1. Humans set direction and choose the framework. 2. AI explores at scale. 3. Humans spot unexpected patterns. 4. AI verifies and refines. 5. Humans audit for rigor and place the result in context. 6. Repeat.
The failed-upper-bound-to-successful-lower-bound story is the canonical example of this loop in action.
Future Directions
---
The Next Chapter
Picture a Princeton office late at night. A server's blue LED flickers. The AI scrolls through the 10,000th variant of a rounding scheme. A human mathematician sips cold coffee. Suddenly an unfamiliar symmetry appears in the output. Three months later, an arXiv preprint appears.
This is not science fiction. It happened in August 2026.
As Lakatos wrote in *Proofs and Refutations*, mathematics is not a straight line from axioms to theorems but an evolutionary process of conjecture, refutation, and revision. AI makes that evolution faster, richer, and less predictable.
The first decimal digit of the Grothendieck constant is 7. The next digits remain open. The answer may already be forming in some late-night dialogue between a human and a machine.
---