The Crouzeix constant

Description of constant

$C_{2}$ is the Crouzeix constant (sometimes denoted $Q$). It is the smallest constant $C$ such that for every $n \ge 1$, every complex matrix $A \in \mathbb{C}^{n \times n}$, and every complex polynomial $p$ one has

\[\|p(A)\| \ \le\ C \ \max_{z \in W(A)} |p(z)|,\]

where $|\cdot|$ is the operator norm induced by the Euclidean norm (i.e. the spectral norm), and

\[W(A) := \{ v^\ast A v : v \in \mathbb{C}^n,\ \|v\|_2 = 1\}\]

is the numerical range (field of values) of $A$.

Equivalently,

\[C_{2} = \sup_{n \ge 1}\ \sup_{A \in \mathbb{C}^{n\times n}}\ \sup_{p \not\equiv 0} \frac{\|p(A)\|}{\max_{z \in W(A)} |p(z)|}.\]

Known upper bounds

Bound Reference Comments
$11.08$ [C2007] First dimension-free bound. Also holds in the completely bounded (matrix-valued) setting.
$1+\sqrt{2} \approx 2.41421$ [CP2017] Best universal upper bound prior to the [Jin2026] / [LS2026] pair. Also holds in the completely bounded setting.
$2$ [Jin2026] Jin: claimed proof of Crouzeix’s conjecture, posted on preprints.org in July 2026.
$2$ [LS2026] Lorist–Schwenninger: proof of Crouzeix’s conjecture, combining previous tools for weaker estimates with a “simple perturbation lemma for 2-dilations” applied to the iterates $f^n$ in the double-layer potential representation. The paper acknowledges [Jin2026].

Known lower bounds

Bound Reference Comments
$1$ Trivial Take $p \equiv 1$.
$2$ [C2007] Achieved by $p(z)=z$ and $A=\begin{pmatrix}0 & 2\\ 0 & 0\end{pmatrix}$, for which $W(A)$ is the unit disk.

References

Acknowledgements

Prepared with ChatGPT 5.2 Pro.