An Explicit Counterexample to Tsirelson's Problem via a Linear System Game
Tsirelson's problem asks whether the closure of finite-dimensional quantum correlations C_qa equals the commuting operator correlations C_qc. The known negative answer via MIP*=RE is non-explicit. The goal is a concrete, fully specified nonlocal game that witnesses the separation.
A finitely presented Kazhdan group pair with strict compression is built from Ershov–Jaikin-Zapirain Kazhdan covers over F_5. An amalgamated double and an HNN extension then yield a nontrivial central involution that vanishes in all tracial matrix ultraproduct representations. Slofstra's embedding theorems and the wagon wheel construction turn this into a binary linear system game. The full system, the separation, and the classical value are formalized in Lean 4 with Mathlib, and the repository includes axiom audits.
The game has 1,417,152 equations in 1,889,684 variables, with three nonzero entries per row and a single nonzero right-hand-side entry. It admits a perfect commuting operator strategy while ω_qa < 1. The classical value is exactly 1 − 1/4,251,456, and the quantum gap satisfies 2^{-2^{50003}} ≤ 1 − ω_q ≤ 1/4,251,456.
