The complex Grothendieck constant

Description of constant

The complex Grothendieck constant (often denoted $K_G^{\mathbb{C}}$) is the smallest number $C_{10b}$ such that, for every $m,n\ge 1$ and every complex matrix $A=(a_{ij})\in\mathbb{C}^{m\times n}$,

\[\max_{\substack{u_1,\dots,u_m\in S^{\infty}\\ v_1,\dots,v_n\in S^{\infty}}} \left|\sum_{i=1}^m\sum_{j=1}^n a_{ij}\langle u_i, v_j\rangle\right| \ \le\ C_{10b}\ \max_{\substack{|s_1|=\cdots=|s_m|=1\\ |t_1|=\cdots=|t_n|=1}} \left|\sum_{i=1}^m\sum_{j=1}^n a_{ij}s_it_j\right|.\]

Here $S^{\infty}$ denotes the unit sphere in a (complex) Hilbert space, $\langle\cdot,\cdot\rangle$ is the Hermitian inner product, and $t_{1}, \ldots, t_{n}, s_{1}, \ldots, s_{m}$ are complex numbers.

Known upper bounds

Bound Reference Comments
$1.607$ [Kai1973] Bound via the method of Rietz (as cited by Haagerup).
$e^{1-\gamma}\approx 1.52621$ [P1978] Here $\gamma$ is the Euler–Mascheroni constant.
$1.40491$ [H1987] Best known general upper bound (Haagerup).

Known lower bounds

Bound Reference Comments
$1$ Trivial  
$1.338$ [D1984] Best known general lower bound (Davie; cited by Haagerup).

References

Contribution notes

Prepared with assistance from ChatGPT 5.2 Pro.