arXiv:2610.10248
An Explicit Counterexample to Tsirelson's Problem via a Linear System Game
Minbo Gao, Tianshi Yu, Lihong Zhi
Abstract
We construct an explicit binary linear system game that separates $C_{qa}$, the closure of the set of finite dimensional quantum correlations, from $C_{qc}$, the set of commuting operator correlations. The game admits a perfect commuting operator strategy, while every correlation in $C_{qa}$ has a success probability strictly less than 1. This provides a concrete counterexample to Tsirelson's problem in its approximation form. The defining system has 1417152 equations in 1889684 variables, with exactly three nonzero coefficients per equation and a single nonzero entry on the right hand side. We also compute the classical value exactly. The complete system is specified in Lean 4, and the separation and exact classical value are formalized using Mathlib.
AI Summary
Tsirelson’s approximation problem asks whether commuting-operator correlations can always be approximated by finite-dimensional tensor-product correlations, i.e. whether $C_{qa}=C_{qc}$. Following the known negative resolution, this paper specifies a concrete binary linear system game exhibiting the separation, rather than establishing its existence through recursive game compression. The system has $1{,}417{,}152$ equations and $1{,}889{,}684$ variables, exactly three variables per equation, and one nonzero right-hand-side entry. With uniform sampling of its $4{,}251{,}456$ incidences, the game satisfies $\omega_q=\omega_{qa}<1=\omega_{qc}$. Its classical value is exactly $1-1/4{,}251{,}456$, and the stated dimension-independent quantum-gap bounds are $2^{-2^{50003}}\leq1-\omega_q\leq1/4{,}251{,}456$. The construction starts from finitely presented Kazhdan groups with a strictly compressed subgroup. A normalization theorem obstructs matrix-ultraproduct representations of a specified element in an amalgamated double. An HNN extension converts this obstruction into a nontrivial central involution, and involution substitution and wagon-wheel embeddings transfer it to a solution group. Nontriviality supplies a perfect commuting strategy; uniform asymptotic triviality in approximate matrix representations excludes quantum value one. Column parity proves classical inconsistency, while an explicit strategy loses exactly one incidence. The accompanying Lean 4 development reportedly proves the final separation, classical value, and quantitative gap without additional mathematical hypotheses. Its scope is narrower than some intermediate manuscript statements: it does not formalize full injectivity into the solution group or the full approximate-representation equivalence. The explicit lower-gap proof is supplied through repository declarations rather than derived in the manuscript; the quantum value itself is not determined.
Generative AI tools (GPT 6 Astra and Fable 5.1) were used to assist with mathematical exploration and proof development
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 31 pages