Crouzeix's Conjecture in Matrix Analysis
- Crouzeix's Conjecture is a hypothesis in operator theory stating that the numerical range of a matrix bounds its holomorphic functional calculus with a sharp constant of 2.
- Recent advances, including the Crouzeix–Palencia bound, verify the conjecture for various matrix classes and reveal deep connections with spectral sets, conformal mappings, and extremal functions.
- Techniques such as Cauchy integrals, Blaschke products, and random matrix asymptotics provide practical insights for extending the conjecture and refining operator norm estimates.
Crouzeix’s conjecture is the assertion that the numerical range of a matrix controls its holomorphic functional calculus with the sharp universal constant $2$. For a square complex matrix , with numerical range
the conjecture states that
for every polynomial . It lies at the intersection of numerical range theory, spectral sets, operator model theory, and matrix function estimates. The best general theorem currently available is the Crouzeix–Palencia bound , while the sharp constant $2$ is known only in special classes and asymptotic regimes (Bickel et al., 2020).
1. Statement, variants, and basic framework
The conjecture is most commonly formulated for polynomials, but the same inequality is equivalent to corresponding statements for functions analytic on a neighborhood of , and also for functions in , the algebra of functions analytic on and continuous on 0. If it holds for matrices, then it extends to bounded operators on Hilbert space; if it holds for polynomials, then Mergelyan approximation extends it to suitable analytic functions on 1 (Bickel et al., 2020).
A standard spectral-set reformulation introduces, for an open set 2 containing 3,
4
Crouzeix’s conjecture is precisely the claim that
5
In this language, 6 is conjectured to be a 7-spectral set for every matrix. The strongest general theorem presently cited in the literature is
8
the Crouzeix–Palencia bound (Chen et al., 2023).
A stronger, completely bounded version replaces scalar polynomials by matrix-valued polynomials 9 and asks for
0
Special-case proofs often establish this stronger form. In the same circle of ideas, an equivalent numerical-radius formulation is available: the conjectured constant 1 is equivalent to the sharp bound
2
where 3 is the numerical radius (Glader et al., 2017).
2. Spectral-set machinery and extremal structure
A central analytic tool is the Cauchy integral representation
4
valid when 5 contains 6. In the Crouzeix–Palencia framework one also defines a companion transform
7
and, after arclength parametrization 8, the Hermitian kernel
9
For 0, positivity properties of 1 yield the universal 2 estimate. For regions strictly inside 3, positivity may fail, and modified estimates introduce scalar correction terms built from the smallest eigenvalue of 4 (Chen et al., 2023).
The geometry becomes especially transparent for disks. If 5 contains 6, then the associated scalar transform collapses to a constant,
7
and the Caldwell–Greenbaum–Li singular-vector argument yields the exact disk bound
8
This disk case is a recurring local model in perturbative arguments for “nearly circular” numerical ranges (Chen et al., 2023).
The extremal viewpoint is equally important. For a simply connected domain 9, an extremal function for 0 is a function 1 maximizing 2. Such extremals have the form
3
where 4 is conformal and 5 is a finite Blaschke product of degree at most 6. Associated extremal vectors satisfy strong orthogonality identities; for example, if 7, then an associated extremal unit vector 8 satisfies
9
There is also a representation theorem: for an extremal pair 0, there exists a unique probability measure 1 on 2 such that
3
with additional cancellation identities when 4. These results clarify why extremal Blaschke products, conformal maps, and singular vectors are structurally central to the conjecture (Bickel et al., 2020).
3. Verified classes and sharp extremal mechanisms
A substantial literature verifies the conjectured constant 5 for specific matrix classes. The following families are explicitly established in the cited works.
| Matrix class | Hypothesis | Conclusion |
|---|---|---|
| 6 matrices | none | conjecture holds |
| 7 tridiagonal constant-diagonal matrices | equivalently, elliptic numerical range centered at an eigenvalue | complete 8-spectral set |
| Contractions with separated eigenvalues | 9 | conjecture holds |
| Cyclic weighted shifts $2$0 | none | complete $2$1-spectral set |
| Some unicritical compressed shifts | degree $2$2 or $2$3, explicit parameter ranges | conjecture holds |
For contractions with distinct eigenvalues in $2$4, the relevant separation parameter is the pseudohyperbolic separation constant
$2$5
and if $2$6, then one obtains
$2$7
for every $2$8, hence the conjecture follows a fortiori since $2$9 (Bickel et al., 2020).
For 0 matrices with elliptic numerical range centered at an eigenvalue, equivalently tridiagonal matrices with constant diagonal,
1
the conjecture is proved in the strong completely bounded form by combining an explicit conformal map from the ellipse to the disk with carefully constructed similarity transforms of condition number 2 (Glader et al., 2017).
For cyclic weighted shifts
3
a recent alternative proof shows
4
so 5 is a complete 6-spectral set. Moreover, if 7, then the constant is actually strict: 8 The proof exploits rotational symmetry of 9, the identity 0 for the normalized Riemann map 1, and an extremal-pair argument within the Crouzeix–Palencia decomposition (Crouzeix et al., 18 Aug 2025).
The sharpness problem is illuminated by the structure of half-radial matrices, defined by
2
where 3 is the numerical radius. These are exactly the equality cases for the identity polynomial 4. They are characterized by a rigid block form
5
with 6 and 7. For monomials 8, equality
9
holds exactly when 0 is half-radial and 1. In dimension 2, equality for 3 characterizes the Crabb–Choi–Crouzeix matrix, and more generally monomial extremality forces a Crabb–Choi–Crouzeix block. This identifies a concrete extremal mechanism behind the sharp constant 4 (Hnetynkova et al., 2018).
4. Reductions, inheritance principles, and operator models
Several recent results reorganize the conjecture by showing that many matrix constructions preserve validity of the 5-bound. If 6 satisfies the conjecture, then so do all affine images 7, the transpose 8, and the adjoint 9. The class is also closed under direct sums, and every rank-one matrix satisfies the conjecture. Tensoring with a normal matrix preserves the property as well: if 00 is normal and 01 satisfies the conjecture, then both 02 and 03 satisfy it (O'Loughlin et al., 2023).
These closure properties feed into a reduction to cyclic matrices. A vector 04 is cyclic for 05 if
06
and 07 is cyclic if it has such a vector. The key reduction is that the full conjecture holds if and only if it holds for cyclic matrices. More precisely, if it holds for all cyclic matrices, then it holds for all matrices. In dimension 08, every non-cyclic matrix already satisfies the conjecture, because the extremal norm behavior compresses to a 09- or 10-dimensional subspace where the conjecture is known (O'Loughlin et al., 2023).
A functional-model reformulation makes the cyclic case more specific. If 11 is cyclic and 12 is cyclic for 13, then one defines
14
with 15, and introduces the differentiation operator
16
For cyclic 17, this operator is unitarily equivalent to 18. Consequently, Crouzeix’s conjecture holds in full generality if and only if it holds for these differentiation operators on finite-dimensional spaces of entire functions (O'Loughlin et al., 2023).
A further operator-model reduction appears for symmetric matrices. In dimension 19, the conjecture for symmetric matrices is equivalent to the conjecture for truncated Toeplitz operators on three-dimensional model spaces, and even to the analytic-symbol subclass. This ties one finite-dimensional corner of the conjecture directly to model-space operator theory (O'Loughlin et al., 2023).
5. Compressions of shifts, Blaschke products, and level-set variants
For a finite Blaschke product
20
the model space
21
has dimension 22, and the compressed shift
23
provides a canonical finite-dimensional model operator. These compressions are central because they realize the completely non-unitary defect-one contractions and offer a highly structured testing ground for Crouzeix-type inequalities (Bickel et al., 2021).
A weaker but natural specialization is the level set Crouzeix conjecture (LSC). If 24 and 25 are finite Blaschke products with 26, then 27; if the full conjecture held for 28, it would force
29
Equivalently, with
30
the level-set formulation is
31
A decisive sufficient condition is pseudohyperbolic-disk containment: if
32
then LSC holds for every 33 of degree 34 (Bickel et al., 2021).
This framework has yielded several concrete results. LSC is proved for all unicritical test Blaschke products 35; for all pairs with unicritical 36 of degree 37 or 38; for every degree-39 40 against 41; and for the case where 42 and 43 has two connected components. The arguments rely on level-set rigidity for finite Blaschke products, pseudohyperbolic geometry, and explicit inner curves inside 44 (Bickel et al., 2021).
Subsequent work extends these methods to further families of model matrices and related nilpotent matrices. For the repeated-zero degree-45 family
46
the numerical range 47 contains a pseudohyperbolic disk of radius 48, which implies LSC for all 49. For the degree-50 family
51
one obtains a contained pseudohyperbolic disk of radius 52, again sufficient for LSC for all 53. There are also degree-54 families
55
for which, for each fixed 56, LSC holds for all 57 sufficiently close to 58, and explicit thresholds are given for 59 (Bickel et al., 2023).
The same circle of ideas also produces full, not merely level-set, Crouzeix results for some nilpotent matrices associated with repeated-zero model operators. For instance, certain 60 KMS-type nilpotent matrices satisfy the conjecture on explicit parameter intervals such as 61, and related families
62
satisfy the conjecture for 63 on explicit 64-ranges obtained via similarity-to-Jordan-block estimates (Bickel et al., 2023).
6. Random matrices, algorithms, computation, and open directions
A recent asymptotic result verifies a restricted form of the conjecture for complex Ginibre matrices. If 65 is an 66 complex Ginibre matrix normalized so that the circular law fills the unit disk, then
67
Equivalently, for every 68,
69
eventually almost surely. This is not a proof of the full conjecture: it is restricted to a random ensemble, asymptotic in 70, probabilistic, and relies on the fact that 71 becomes nearly circular. The proof combines asymptotic circularity
72
uniform resolvent bounds on annuli, and a perturbative disk argument in the Crouzeix–Palencia/Caldwell–Greenbaum–Li framework (Chen et al., 2023).
The same work shows how this asymptotic 73-spectral-set behavior enters GMRES. For systems
74
the ideal-GMRES residual satisfies, almost surely as 75,
76
with an alternative pseudospectral bound
77
Here the numerical range yields the asymptotically optimal constant 78, while pseudospectra provide explicit spectral sets with usually worse constants (Chen et al., 2023).
Crouzeix-type bounds also appear in optimization. In nonlinear acceleration of multistep methods, including momentum and primal-dual schemes, the local linearized iteration operator 79 is generally non-symmetric. The RNA analysis reduces performance to norms of matrix polynomials 80, and Crouzeix’s inequality converts this into the planar approximation problem
81
Consequently, acceleration performance is controlled by a Chebyshev problem on the numerical range of a nonsymmetric operator. This is the mechanism that extends numerical-range-based acceleration theory beyond symmetric fixed-point maps (Bollapragada et al., 2018).
Computational work on the Crouzeix ratio
82
provides another perspective. Extensive nonsmooth optimization experiments, totaling nearly half a million runs and about 83 million evaluations, found many locally minimal values strictly between 84 and 85, but none below 86. The same locally minimal values frequently appear in both real and complex formulations, and approximate nonsmooth stationarity was verified numerically using near-active local maximizers on 87. These computations strongly support the conjecture that the global minimum of the Crouzeix ratio is 88, equivalently that the optimal universal constant is 89 (Overton, 2021).
A broader extension replaces the classical numerical range by the scaled 90-numerical range
91
and develops spectral-set bounds through a generalized Crouzeix–Palencia framework. In this setting one proposed 92-analogue is
93
which recovers the classical conjecture at 94 (O'Loughlin et al., 16 Mar 2026).
The central open problem remains the original universal 95-bound for arbitrary matrices. Several subsidiary questions sharpen the landscape. One asks whether the class of matrices satisfying the conjecture is closed under addition; a positive answer would imply the full conjecture, since rank-one matrices already satisfy it. Another asks whether extremal behavior can always be compressed to dimension 96, a mechanism that would force the conjecture by reduction to the 97 case. In the model-operator direction, open problems include characterizing extremal Blaschke-product degrees and the relation between norm-extremal and numerical-radius-extremal functions. In the random-matrix direction, it remains unknown whether large Ginibre matrices might asymptotically satisfy a better constant 98; numerics in that setting suggest the possibility of 99, but no proof is known (O'Loughlin et al., 2023).