You need to know: Euclidean space , inner product
in
, unit vector in
, matrix, big O notation.
Background: In 1953, Grothendieck proved the existence of a universal constant such that, given any
matrix with real entries
and arbitrary unit vectors
in
, there are signs
such that inequality
holds. This is called the Grothendieck’s inequality. The minimal constant K for which it holds is called the Grothendieck constant, and is denoted
. See here for a version of the Grothendieck constant of a graph.
The Theorem: On 31st March 2011, Mark Braverman, Konstantin Makarychev, Yury Makarychev, and Assaf Naor submitted to arxiv a paper in which they proved the existence of a constant such that
.
Short context: The Grothendieck’s inequality, despite being innocent-looking at the first glance, turned out to be important in many areas of mathematics and applications, such as functional analysis, harmonic analysis, operator theory, quantum mechanics, and computer science. For many applications, it is important to have it with the best possible constant. However, despite substantial efforts, even the second digit of remains unknown. The best lower bound is
proved by Davie in 1984. For the upper bound, Krivine proved in 1979 that
, and conjectured that
is actually equal to this value. This conjecture was well-believed, and many researchers focused on proving the matching lower bound. The Theorem states that Krivine’s conjecture is false.
Links: Free arxiv version of the original paper is here, journal version is here.