Preprint
Article

This version is not peer-reviewed.

The Numerical Range Is a 2-Spectral Set

Submitted:

04 August 2026

Posted:

05 August 2026

Read the latest preprint version here

Abstract
For an \( n\times n \) complex matrix \( A \), let \( W(A)=\{x^*Ax : x\in\mathbb{C}^n,\ \lVert x\rVert_2=1\} \) be its numerical range. Here \( x^* \) denotes the conjugate transpose, \( \lVert\,\cdot\,\rVert_2 \) the Euclidean norm, and \( \lVert\,\cdot\,\rVert \) the induced operator norm. For every function \( f \) holomorphic on a neighborhood of \( W(A) \), we prove that \( \lVert f(A)\rVert\leq 2\max_{z\in W(A)}\lvert f(z)\rvert \) and consequently that \( W(A) \) is a 2-spectral set for \( A \). This proves Crouzeix's conjecture, and the constant is optimal. The central ingredient is a positive-real completion theorem relative to an auxiliary eigenbasis: an adjoint-algebra constraint on the resolvent defect of a normalized matrix-valued Carathéodory function forces the underlying matrix to have norm at most 2. The classical positive double-layer calculus supplies such completions for \( f(B) \) whenever the auxiliary matrix \( B \) has simple spectrum; the eigenvalues of \( f(B) \) may repeat. Sampling the associated Herglotz kernel at half the conjugate diagonal entries and at the origin cancels the completion term's contribution and leaves a comparison of two weighted Gramians; their first nonconstant terms yield the sharp estimate. Simple-spectrum approximation and convex outer approximation by domains with continuously differentiable boundary yield the general theorem.
Keywords: 
;  ;  ;  ;  

1. Introduction

Let C denote the complex field and, for n 1 , let M n ( C ) denote the algebra of n × n complex matrices. For A M n ( C ) , its numerical range is
W ( A ) = { x * A x : x C n , x 2 = 1 } .
Here x * denotes the conjugate transpose, σ ( A ) denotes the spectrum, x 2 is the Euclidean norm, X is the induced operator norm, and scalar moduli are denoted by | · | . The set W ( A ) is compact, the Toeplitz–Hausdorff theorem makes it convex, and σ ( A ) W ( A ) . Functions holomorphic near σ ( A ) are evaluated using the holomorphic functional calculus.
A compact set K C containing σ ( A ) is called a C-spectral set for A if
r ( A ) C max z K | r ( z ) |
for every rational function r pole-free on K. Our main result settles Crouzeix’s conjecture by identifying the sharp universal constant for K = W ( A ) .
Theorem 1 
(Main theorem). Let n 1 , let A M n ( C ) , and let f be holomorphic on a neighborhood of W ( A ) . Then
f ( A ) 2 max z W ( A ) | f ( z ) | .
Consequently, W ( A ) is a 2-spectral set for A.
The factor 2 is optimal: for
N = 0 2 0 0 and p ( z ) = z ,
one has W ( N ) = { z C : | z | 1 } and N = 2 .
For later use, write
D = { z C : | z | < 1 } , T = D .
We use I for the identity matrix of the size dictated by context, X * for the adjoint, put Re X = ( X + X * ) / 2 , and let alg ( T ) denote the unital algebra generated by T. For Hermitian matrices X and Y, we write X Y (equivalently, Y X ) when Y X is positive semidefinite.
Crouzeix proved the estimate with constant 2 for 2 × 2 matrices and formulated the general conjecture in [1]. His subsequent dimension-free theorem gave the constant 11.08 [2]. After further structural and numerical work [3], Crouzeix and Palencia proved that W ( A ) is a ( 1 + 2 ) -spectral set [4]. Their double-layer and Cauchy-transform argument was clarified in [5] and developed in several directions in [6,7].
The intervening literature established the conjectured constant for perturbed Jordan blocks and, more generally, scalar translates of cyclic weighted shifts, as well as for tridiagonal 3 × 3 matrices with elliptic numerical range centered at an eigenvalue [8,9,10]. Numerical and extremal investigations appear in [11,12], and a broad account of the problem and its variants is given in [13]. Subsequent work has treated Blaschke-product level sets, cyclicity reductions, compressions of shifts, further nilpotent classes, and quantitative bounds for KMS matrices [14,15,16,17]. An alternative proof for a class of weighted shifts appears in [18]. Across these cited reductions, the best dimension-free universal bound remained 1 + 2 .

1.1. The Sharpness Barrier in the Symmetrized Calculus

The positive boundary measure used below originates in the convex-domain integral calculus of Delyon–Delyon [19]; see also [4,20]. If B has numerical range in a convex domain Ω with continuously differentiable boundary and f is bounded by one on Ω , this calculus produces a unital positive map Φ and a holomorphic Cauchy companion g f such that
2 Φ ( f ) = f ( B ) + g f ( B ) * .
Thus positivity directly controls a symmetrized functional calculus, while the target estimate concerns f ( B ) . The Crouzeix–Palencia argument couples the two terms in (5); the examples in [5] show that its abstract norm estimate is sharp at 1 + 2 . The corresponding general uniform-algebra theorem has the same sharp constant; its additional unital case was proposed as a possible route to 2 in [21]. Schwenninger and de Vries revisited the double-layer method [22]. Malman et al. proved that a configuration-constant refinement gives a strict improvement for every fixed numerical-range shape; they also constructed thin quadrilaterals for which the resulting bounds approach 1 + 2 [23]. Separately, continuity and compactness give a constant C n < 1 + 2 in every fixed matrix dimension n [24].
The key additional information is algebraic. For the approximants constructed in Section 5, the companion in (5) belongs to the algebra generated by B * , where the simple-spectrum matrix B supplies an eigenbasis that also diagonalizes f ( B ) . Treating f ( B ) and the companion jointly preserves this coupling.

1.2. Auxiliary-Basis de-Symmetrization

Our argument uses the whole Cayley family associated with (5). It has four steps.
1.
Applying Φ to
ζ 1 + w f ( ζ ) 1 w f ( ζ ) , w D ,
produces a matrix-valued Carathéodory function H, meaning that H ( 0 ) = I and Re H ( w ) 0 .
2.
For a simple-spectrum auxiliary matrix B, put T = f ( B ) . The double-layer identity gives the positive-real completion
H ( w ) ( I w T ) 1 alg ( B * ) , w D .
3.
The eigenbasis of B diagonalizes T = f ( B ) even when some values of f on the spectrum of B coincide, and it turns the unknown term in (6) into a diagonal analytic correction. We sample the Herglotz kernel of H at half the conjugate diagonal entries of T and add one vector sample at the origin. Repeated sampling points are allowed, and the origin sample cancels the diagonal correction’s contribution exactly.
4.
The surviving positive-matrix inequality compares two weighted Gramians. Its difference is positive, and an eigenvector argument followed by the first nonconstant Gramian term yields T 2 .
The proof uses two limits: simple-spectrum matrices tend to A, followed by outer domains converging to W ( A ) . Together they yield the general case.

2. Positive-Real Kernels

Let K be an M n ( C ) -valued kernel on D × D . We call K positive if, for every finite choice w 0 , , w m D and ξ 0 , , ξ m C n ,
i , j = 0 m ξ i * K ( w i , w j ) ξ j 0 .
We shall use the following standard matrix-valued form of the Herglotz theorem. Its kernel consequence is included to fix the normalization.
Lemma 1 
(Matrix Herglotz kernel). Let F : D M n ( C ) be analytic with Re F ( w ) 0 for every w D . Then
L F ( w , z ) = F ( w ) + F ( z ) * 1 w z ¯
is a positive kernel.
Proof. 
The matrix Herglotz representation gives a positive M n ( C ) -valued measure M on T , and a Hermitian matrix J F , such that
F ( w ) = i J F + T ζ + w ζ w d M ( ζ ) .
For | ζ | = 1 , direct calculation gives
1 1 w z ¯ ζ + w ζ w + ζ + z ζ z ¯ = 2 ( 1 w ζ ¯ ) ( 1 z ¯ ζ ) .
The constant i J F cancels from (8). Substituting (9) and then summing as in (7) yields
2 T i ξ i 1 w i ¯ ζ * d M ( ζ ) j ξ j 1 w j ¯ ζ 0 .

3. The Positive-Real Completion Principle

The following completion theorem is the core of the argument: it converts a positive-real completion constrained by the adjoint algebra of an auxiliary simple-spectrum matrix into the sharp norm bound.
Theorem 2 
(Positive-real completion). Let
B = S diag ( β 1 , , β n ) S 1 , T = S Λ S 1 , Λ = diag ( λ 1 , , λ n ) ,
where S is invertible, the numbers β 1 , , β n are distinct, and | λ i | 1 for every i. The numbers λ i may repeat. Let H : D M n ( C ) be analytic and satisfy
H ( 0 ) = I , Re H ( w ) 0 ( w D ) ,
and
H ( w ) ( I w T ) 1 alg ( B * ) ( w D ) .
Then T 2 .
Proof. 
Use the simultaneous diagonalizations in (11) and put G = S * S 0 . Since the β i are distinct, polynomial interpolation shows that
alg ( B * ) = ( S 1 ) * D S * : D is diagonal .
By (14), there is a unique diagonal analytic function Θ such that
H ( w ) ( I w T ) 1 = ( S 1 ) * Θ ( w ) S * .
Indeed,
Θ ( w ) = S * H ( w ) ( I w T ) 1 ( S * ) 1 ,
and Θ ( 0 ) = 0 because H ( 0 ) = I . Write Θ ( w ) = diag ( θ 1 ( w ) , , θ n ( w ) ) . On setting H ˜ ( w ) = S * H ( w ) S , we obtain
H ˜ ( w ) = G ( I w Λ ) 1 + Θ ( w ) G .
Since Re H ˜ ( w ) = S * ( Re H ( w ) ) S , the real part of H ˜ ( w ) is positive semidefinite. Consequently, Lemma 1 applies to H ˜ .
Define Hermitian matrices P , Q , Y M n ( C ) by
P i j = G i j 1 λ i ¯ λ j / 4 , Q i j = G i j 1 λ i ¯ λ j / 2 , Y = Q P .
The denominators are nonzero, and P and Q are Hermitian, because | λ i | 1 . Let e 1 , , e n be the standard basis of C n , and fix u = ( u 1 , , u n ) T C n . In the positive-kernel inequality use the n points and vectors
w i = λ i ¯ 2 , ξ i = u i e i ( 1 i n ) ,
and add the point w 0 = 0 with vector
ξ 0 = v = G 1 P u .
The points w i may coincide. Kernel positivity applies to arbitrary finite indexed lists of points and vectors, including w i = w 0 when λ i = 0 . We first verify that this sample cancels the contribution of Θ to the sampled kernel quadratic form. The contribution of the second term in (15) to the kernel quadratic form is
2 Re i = 1 n u i ¯ θ i ( w i ) ( G v ) i + j = 1 n G i j u j 1 w i w j ¯ .
Because
1 w i w j ¯ = 1 λ i ¯ λ j / 4 ,
the parenthesis in (19) is ( G v + P u ) i , which vanishes by (18).
It remains to calculate the contribution of G ( I w Λ ) 1 . Between w i and w j its ( i , j ) entry is
2 G i j ( 1 λ i ¯ λ j / 2 ) ( 1 λ i ¯ λ j / 4 ) = ( 4 Q 2 P ) i j .
After compression by the coordinate vectors e i , the two effective sample–origin blocks are G + Q , and the origin block is 2 G . After the cancellation of Θ ’s contribution, kernel positivity gives, for the prescribed vector v = G 1 P u ,
0 u v * 4 Q 2 P G + Q G + Q 2 G u v = u * ( 4 Q 2 P ) ( G + Q ) G 1 P P G 1 ( G + Q ) + 2 P G 1 P u = u * 4 Y Y G 1 P P G 1 Y u ,
Here the block quadratic form is used only on the graph v = G 1 P u ; it is not asserted to be positive for independent u and v. The last equality uses Q = P + Y . Since u was arbitrary,
4 Y Y G 1 P P G 1 Y 0 .
Balance the diagonalization by defining
T ˜ = G 1 / 2 Λ G 1 / 2 , P ^ = G 1 / 2 P G 1 / 2 , Q ^ = G 1 / 2 Q G 1 / 2 , Y ^ = Q ^ P ^ .
Expanding the scalar kernels in (16) into geometric series gives
P ^ = k = 0 4 k T ˜ * k T ˜ k , Q ^ = k = 0 2 k T ˜ * k T ˜ k .
Indeed, T ˜ k = G 1 / 2 Λ k G 1 / 2 , so the sequence ( T ˜ k ) is bounded even when some | λ j | = 1 ; the geometric weights give norm convergence. It follows that
Y ^ = k = 1 ( 2 k 4 k ) T ˜ * k T ˜ k 0 .
Taking the congruence of (22) by G 1 / 2 yields
4 Y ^ Y ^ P ^ P ^ Y ^ 0 .
Let e be an eigenvector of the Hermitian matrix P ^ , say P ^ e = α e . If α > 2 , then (26) gives
0 2 ( 2 α ) e * Y ^ e .
Since Y ^ 0 and α > 2 , (27) forces e * Y ^ e = 0 . The k = 1 term in (25) is T ˜ * T ˜ / 4 , so T ˜ e = 0 . The first series in (24) gives P ^ e = e , contradicting P ^ e = α e with α > 2 . The first series in (24) also begins with I, and hence
I P ^ 2 I .
The k = 1 term of the same series now gives
1 4 T ˜ * T ˜ P ^ I I .
Thus T ˜ 2 . The polar decomposition S = U G 1 / 2 gives
T = U T ˜ U * ,
where U is unitary. Therefore T 2 . □
Remark 1. 
The factor 1 / 2 in the sampling points (17) simultaneously produces the weights 1 / 2 and 1 / 4 in (24). Their positive difference bounds P ^ , and the first nonconstant term of P ^ then gives the sharp constant. The origin sample cancels the correction’s contribution by an exact algebraic identity. Distinct auxiliary eigenvalues identify alg ( B * ) with the diagonal algebra in the chosen basis, while the diagonal entries of T may repeat.

4. The Double-Layer Completion

We now construct from the numerical range the function required by Theorem 2. The measure and companion transform used here are classical [2,4,19]. The full Cayley family yields the algebraic constraint (13) relative to the auxiliary matrix.
Lemma 2 
(Double-layer positive map). Let B M n ( C ) , and let Ω C be a bounded convex domain with continuously differentiable boundary and W ( B ) Ω . Writing C ( Ω ) for the continuous complex-valued functions on Ω , there is a unital positive map
Φ : C ( Ω ) M n ( C )
such that, whenever h is holomorphic on a neighborhood of Ω ¯ ,
2 Φ ( h ) = h ( B ) + g h ( B ) * ,
where
g h ( z ) = 1 2 π i Ω h ( ζ ) ¯ ζ z d ζ , z Ω .
Proof. 
Orient Ω counterclockwise. Let ν ( ζ ) be the outward unit normal, let d s be arclength, and put
Z ζ = ζ I B , R ζ = Z ζ 1 .
This resolvent exists because σ ( B ) W ( B ) Ω . Define the matrix-valued boundary measure
d μ B ( ζ ) = 1 2 π ν ( ζ ) R ζ + ν ( ζ ) ¯ R ζ * d s .
It is positive. In fact, the supporting-line property of the convex set Ω ¯ gives
ν ( ζ ) Z ζ * + ν ( ζ ) ¯ Z ζ = 2 Re ν ( ζ ) ¯ Z ζ 0 .
Indeed, for every unit vector x C n , the quadratic form on the left is
2 Re ν ( ζ ) ¯ ( ζ x * B x ) 0 ,
because x * B x W ( B ) Ω . Multiplication on the left by R ζ * and on the right by R ζ turns the left side of (32) into the matrix in parentheses in (31).
Along the counterclockwise boundary, d ζ = i ν ( ζ ) d s . The matrix Cauchy formula gives
1 2 π Ω ν ( ζ ) R ζ d s = I .
Taking adjoints gives the same identity for the second layer. Hence
Ω d μ B = 2 I .
For φ C ( Ω ) , define
Φ ( φ ) = 1 2 Ω φ ( ζ ) d μ B ( ζ ) .
By (34), Φ is unital and positive, hence *-preserving; moreover, Φ ( φ ) φ , where
φ = max ζ Ω | φ ( ζ ) | .
For holomorphic h, the first layer of 2 Φ ( h ) is h ( B ) by Cauchy’s formula. The function g h in (30) is holomorphic on Ω , so g h ( B ) is defined by the holomorphic functional calculus. To verify the relevant integral formula using only the holomorphy of g h on Ω , choose a positively oriented contour Γ Ω enclosing σ ( B ) . The compact contours Γ and Ω are positively separated, so Cauchy’s formula and Fubini’s theorem give
g h ( B ) = 1 2 π i Γ g h ( z ) ( z I B ) 1 d z = 1 2 π i Ω h ( ζ ) ¯ ( ζ I B ) 1 d ζ .
Taking adjoints in (36) and using d ζ ¯ = i ν ( ζ ) ¯ d s gives the second layer of 2 Φ ( h ) . This proves (29). □
Proposition 1 
(Cayley completion for an auxiliary pair). Let B and Ω be as in Lemma 2, and let f be holomorphic on a neighborhood of Ω ¯ and satisfy
max ζ Ω ¯ | f ( ζ ) | 1 .
Put T = f ( B ) . Then there is an analytic H : D M n ( C ) satisfying
H ( 0 ) = I , Re H ( w ) 0 ( w D ) ,
and
H ( w ) ( I w T ) 1 alg ( B * ) ( w D ) .
Moreover, σ ( T ) D ¯ .
Proof. 
By (37) and spectral mapping from σ ( B ) Ω , we have σ ( T ) D ¯ . For w D , define on the boundary
c w ( ζ ) = 1 + w f ( ζ ) 1 w f ( ζ )
and put
H ( w ) = Φ ( c w ) .
The map w c w is analytic with values in C ( Ω ) , locally uniformly on D . Hence H is analytic, and H ( 0 ) = I . Furthermore,
Re c w ( ζ ) = 1 | w f ( ζ ) | 2 | 1 w f ( ζ ) | 2 0 .
The positivity and *-preservation of Φ give Re H ( w ) = Φ ( Re c w ) 0 .
For fixed w D , the same formula defines c w holomorphically on a neighborhood of Ω ¯ : on Ω ¯ one has | 1 w f | 1 | w | > 0 . Hence Lemma 2 gives
2 H ( w ) = c w ( B ) + g c w ( B ) * .
Since T = f ( B ) , the holomorphic functional calculus gives
c w ( B ) = ( I + w T ) ( I w T ) 1 = 2 ( I w T ) 1 I .
Consequently,
H ( w ) ( I w T ) 1 = 1 2 g c w ( B ) * I .
The function g c w is holomorphic on a neighborhood of σ ( B ) , so finite-dimensional holomorphic functional calculus gives g c w ( B ) alg ( B ) . Thus the right-hand side of (42) belongs to alg ( B * ) , proving (39). □
Corollary 1 
(Auxiliary sharp bound). In Proposition 1, if B has simple spectrum, then f ( B ) 2 .
Proof. 
Write
B = S diag ( β 1 , , β n ) S 1 .
Then
T = f ( B ) = S diag f ( β 1 ) , , f ( β n ) S 1 .
Since σ ( B ) Ω , the bound on f gives | f ( β i ) | 1 for every i. Apply Theorem 2 to these simultaneous diagonalizations and to the function H constructed in Proposition 1. The values f ( β i ) may repeat. □

5. Passage to Arbitrary Matrices and Proof of the Main Theorem

Successive approximations pass from the auxiliary setting to arbitrary matrices.
Lemma 3 
(Simple spectrum and numerical range). Matrices with n distinct eigenvalues are dense in M n ( C ) . Moreover, for A , B M n ( C ) ,
W ( B ) W ( A ) + { z C : | z | B A } .
Proof. 
The discriminant of the characteristic polynomial is a nonzero polynomial in the matrix entries, as is seen at diag ( 1 , , n ) . The zero set of a nonzero complex polynomial has empty interior, so its nonvanishing set is dense in M n ( C ) , proving the first assertion. For a unit vector x,
| x * ( B A ) x | B A ,
which proves (43). □
Lemma 4 
(Parallel convex domains). Let K C be nonempty, compact, and convex. For δ > 0 , the set
Ω δ = { z C : dist ( z , K ) < δ }
is a bounded convex domain with continuously differentiable boundary, and Ω ¯ δ = K + δ D ¯ .
Proof. 
The set Ω δ is bounded and convex, and its closure is the Minkowski sum K + δ D ¯ . Identify C with R 2 . The metric projection π K : C K is unique and continuous. Put d K ( z ) = dist ( z , K ) . For z , h C , comparison first with π K ( z ) and then with π K ( z + h ) gives
2 Re z + h π K ( z + h ) ¯ h | h | 2 d K ( z + h ) 2 d K ( z ) 2 2 Re z π K ( z ) ¯ h + | h | 2 .
The continuity of π K now shows that d K 2 is continuously differentiable, with real gradient 2 ( z π K ( z ) ) . On the level set d K ( z ) = δ this gradient has norm 2 δ > 0 . Since Ω δ = { d K = δ } , the implicit-function theorem shows that Ω δ is continuously differentiable. □
Proof of Theorem 1. 
Put K = W ( A ) , and let U be an open neighborhood of K on which f is holomorphic. Choose ε 0 > 0 such that the closed ε 0 -neighborhood of K lies in U. For 0 < ε < ε 0 , let
Ω ε = { z C : dist ( z , K ) < ε } .
Lemma 4 makes this a bounded convex domain with continuously differentiable boundary.
By Lemma 3, choose simple-spectrum matrices B k A . For fixed ε , all sufficiently large k satisfy B k A < ε / 2 , and then (43) gives
W ( B k ) K + ( ε / 2 ) D ¯ Ω ε .
Set
m ε = max z Ω ¯ ε | f ( z ) | .
If m ε = 0 , then f vanishes on a neighborhood of σ ( A ) , so f ( A ) = 0 and there is nothing to prove. Otherwise, apply Corollary 1 to B k and f / m ε to obtain
f ( B k ) 2 m ε .
Continuity of the holomorphic functional calculus, obtained from a fixed contour inside U, gives f ( B k ) f ( A ) . Hence
f ( A ) 2 m ε .
Put m 0 = max z K | f ( z ) | . Uniform continuity of f on the closed ε 0 -neighborhood of K gives a modulus of continuity ω f there. Since every point of Ω ¯ ε lies within ε of K,
0 m ε m 0 ω f ( ε ) .
Letting ε 0 in (44) proves (3).
Finally, a rational function pole-free on the compact set W ( A ) is holomorphic on a neighborhood of W ( A ) . Applying (3) to such functions proves (2) with K = W ( A ) and C = 2 . □

6. Consequences and Scope

The Hilbert-space extension follows by the standard finite-dimensional compression argument; compare [13].
Corollary 2 
(Hilbert-space form). Let H { 0 } be a complex Hilbert space, with inner product linear in the first variable, and let B ( H ) denote its algebra of bounded operators. For A B ( H ) , put
W ( A ) = { A x , x : x H , x = 1 } .
Then, for every p C [ z ] ,
p ( A ) 2 sup z W ( A ) | p ( z ) | .
Consequently, W ( A ) ¯ is a 2-spectral set for A.
Proof. 
The assertion is immediate if p = 0 . Otherwise, write d = deg p . For a unit vector x H , let
M x = span { x , A x , , A d x } , A x = Π x A M x ,
where Π x is the orthogonal projection onto M x . Induction gives
A x k x = A k x ( 0 k d ) ,
because A k + 1 x M x whenever k < d . Moreover, W ( A x ) W ( A ) . Theorem 1, applied on the finite-dimensional space M x , therefore gives
p ( A ) x H = p ( A x ) x H p ( A x ) 2 sup z W ( A ) | p ( z ) | .
Taking the supremum over unit vectors x proves (45).
Put K = W ( A ) ¯ . The standard inclusion σ ( A ) K shows that r ( A ) is defined for every rational function r pole-free on K. Choose a closed convex neighborhood K δ of K that contains no pole of r. Its complement is connected, so polynomial Runge approximation on K δ , followed by the Cauchy integral formula for the functional calculus, gives polynomials p j such that p j ( A ) r ( A ) and
sup z W ( A ) | p j ( z ) | sup z W ( A ) | r ( z ) | .
Passing to the limit in (45) proves the rational estimate and hence the spectral-set assertion. □
The conclusion also controls polynomial and rational approximation of matrix functions. Let A M n ( C ) , let f be holomorphic on a neighborhood of W ( A ) , and let s be either a polynomial or a rational function pole-free on W ( A ) . Then f s is holomorphic on a neighborhood of W ( A ) , and Theorem 1 gives
f ( A ) s ( A ) 2 max z W ( A ) | f ( z ) s ( z ) | .
This is the sharp universal form of the numerical-range estimate that underlies applications to GMRES and rational Krylov methods; see [7,25,26] for the role of spectral sets in those settings.

7. Discussion and Further Directions

Theorem 1 proves the scalar-valued Crouzeix conjecture. The most immediate strengthening is the uniform matrix-polynomial question: for every m 1 and every matrix polynomial F = [ f i j ] M m ( C [ z ] ) , does one have
F ( A ) 2 max z W ( A ) F ( z ) , F ( A ) = [ f i j ( A ) ] .
Here F ( A ) is the operator norm on ( C n ) m , whereas F ( z ) is the operator norm on C m . The case m = 1 is precisely the scalar theorem proved above; uniformity in m is an additional operator-algebraic requirement. The foundational matrix-level disk estimate is due to Okubo and Ando [27]. Uniform matrix-level spectral-set bounds are studied in [28], and their relation to numerical radius in [29]; the constant 1 + 2 at every matrix level follows from [4], while sharp estimates for ρ -contractions with 1 ρ 2 are developed in [30]. The extension is known with constant 2 for weighted shift matrices [18]. For block-valued inputs, the coefficients in the completion may occupy a larger operator algebra, so the cancellation in (19) would require a genuinely operator-algebraic formulation.
The positive-real completion principle is independent of numerical ranges: it starts with a Carathéodory function whose resolvent defect lies in the adjoint algebra of an auxiliary simple-spectrum matrix sharing an eigenbasis with the matrix in the resolvent. A direct infinite-dimensional extension of Theorem 2, based for example on spectral measures or Riesz bases, could reveal equality cases or uniform matrix-level functional-calculus structure. The main challenge is a stable functional-calculus formulation of the auxiliary-basis correction, valid beyond finite diagonal spectral models. Related questions for unbounded numerical ranges are studied in [31], and related abstract spectral-constant problems in [32,33].
Double-layer methods beyond numerical ranges were developed in [7], while configuration-constant refinements were introduced in [23]; see also [22] for a comparison of double-layer approaches. Annular double-layer kernels are studied in [34], while [35] develops a complementary annular realization and norm theory; elliptic domains admit structured dilation models [36]. Whenever a companion transform lands in a controlled adjoint algebra, the kernel-sampling argument may replace a triangle-inequality estimate and thereby offer a route to sharp constants for other geometric spectral sets.
With the notation of the proof of Theorem 2, if T ˜ = 2 and e C n satisfies e 2 = 1 and T ˜ e 2 = 2 , then equality throughout the final Gramian inequality in the proof of Theorem 2 forces
P ^ e = 2 e , T ˜ 2 e = 0 , P ^ T ˜ e = T ˜ e .
Analyzing these vector saturation conditions may classify extremal pairs ( A , p ) and quantify stability near the nilpotent example (4). Such a classification must allow the nonuniqueness phenomena found in [12].
Finally, O’Loughlin and Rani extend the Crouzeix–Palencia framework to scaled q-numerical ranges, 0 < | q | 1 , and propose associated spectral-set problems [37]. These provide a natural testing ground for investigating a constant-2 analogue.

AI-Assistance Disclosure

OpenAI ChatGPT contributed the idea of sampling the matrix Herglotz kernel at half the conjugate eigenvalues and adding the origin sample that cancels the adjoint-algebra correction’s contribution; this appears in the proof of Theorem 2, especially (17)–(19). It also assisted with exposition, bibliography, and typesetting. The human author assumes full responsibility for the correctness of all mathematical statements and for the integrity and accuracy of all citations.

Acknowledgments

The author thanks Elijah Winners for suggesting the auxiliary-basis simplification used in the proof of Theorem 2.

References

  1. Crouzeix, M. Bounds for analytical functions of matrices. Integral Equ. Oper. Theory 2004, 48, 461–477. [Google Scholar] [CrossRef]
  2. Crouzeix, M. Numerical range and functional calculus in Hilbert space. J. Funct. Anal. 2007, 244, 668–690. [Google Scholar] [CrossRef]
  3. Crouzeix, M. Some constants related to numerical ranges. SIAM J. Matrix Anal. Appl. 2016, 37, 420–442. [Google Scholar] [CrossRef]
  4. Crouzeix, M.; Palencia, C. The numerical range is a (1+2)-spectral set. SIAM J. Matrix Anal. Appl. 2017, 38, 649–655. [Google Scholar] [CrossRef]
  5. Ransford, T.; Schwenninger, F.L. Remarks on the Crouzeix–Palencia proof that the numerical range is a (1+2)-spectral set. SIAM J. Matrix Anal. Appl. 2018, 39, 342–345. [Google Scholar] [CrossRef]
  6. Caldwell, T.; Greenbaum, A.; Li, K. Some extensions of the Crouzeix–Palencia result. SIAM J. Matrix Anal. Appl. 2018, 39, 769–780. [Google Scholar] [CrossRef]
  7. Crouzeix, M.; Greenbaum, A. Spectral sets: Numerical range and beyond. SIAM J. Matrix Anal. Appl. 2019, 40, 1087–1101. [Google Scholar] [CrossRef]
  8. Greenbaum, A.; Choi, D. Crouzeix’s conjecture and perturbed Jordan blocks. Linear Algebra Appl. 2012, 436, 2342–2352. [Google Scholar] [CrossRef]
  9. Choi, D. A proof of Crouzeix’s conjecture for a class of matrices. Linear Algebra Appl. 2013, 438, 3247–3257. [Google Scholar] [CrossRef]
  10. Glader, C.; Kurula, M.; Lindström, M. Crouzeix’s conjecture holds for tridiagonal 3×3 matrices with elliptic numerical range centered at an eigenvalue. SIAM J. Matrix Anal. Appl. 2018, 39, 346–364. [Google Scholar] [CrossRef]
  11. Greenbaum, A.; Overton, M.L. Numerical investigation of Crouzeix’s conjecture. Linear Algebra Appl. 2018, 542, 225–245. [Google Scholar] [CrossRef]
  12. Li, K. On the uniqueness of functions that maximize the Crouzeix ratio. Linear Algebra Appl. 2020, 599, 105–120. [Google Scholar] [CrossRef]
  13. Bickel, K.; Gorkin, P.; Greenbaum, A.; Ransford, T.; Schwenninger, F.L.; Wegert, E. Crouzeix’s conjecture and related problems. Comput. Methods Funct. Theory 2020, 20, 701–728. [Google Scholar] [CrossRef]
  14. Bickel, K.; Gorkin, P. Blaschke products, level sets, and Crouzeix’s conjecture. J. Anal. Math. 2024, 152, 217–254. [Google Scholar] [CrossRef]
  15. O’Loughlin, R.; Virtanen, J. Crouzeix’s conjecture for classes of matrices. Linear Algebra Appl. 2024, 697, 277–292. [Google Scholar] [CrossRef]
  16. Bickel, K.; Corbett, G.; Glenning, A.; Guan, C.; Vollmayr-Lee, M. Crouzeix’s conjecture, compressions of shifts, and classes of nilpotent matrices. Concr. Oper. Paper No. 20240004, 26 pp. 2024, 11(No. 20240004). [Google Scholar] [CrossRef]
  17. Crouzeix, M.; Greenbaum, A.; Li, K. Numerical bounds on the Crouzeix ratio for a class of matrices. Calcolo Paper No. 32, 18 pp. 2024, 61(No. 32). [Google Scholar] [CrossRef]
  18. Crouzeix, M.; Greenbaum, A. A new proof that the numerical range is a complete 2-spectral set for weighted shift matrices. Preprint. [CrossRef]
  19. Delyon, B.; Delyon, F. Generalization of von Neumann’s spectral sets and integral representation of operators. Bull. Soc. Math. Fr. 1999, 127, 25–41. [Google Scholar] [CrossRef]
  20. Badea, C.; Crouzeix, M.; Delyon, B. Convex domains and K-spectral sets. Math. Z. 2006, 252, 345–365. [Google Scholar] [CrossRef]
  21. Clouâtre, R.; Ostermann, M.; Ransford, T. An abstract approach to the Crouzeix conjecture. J. Oper. Theory 2023, 90, 209–221. [Google Scholar] [CrossRef]
  22. Schwenninger, F.L.; de Vries, J. The double-layer potential for spectral constants revisited. Integral Equ. Oper. Theory 2025, 97(Article 13), 22 pp. [Google Scholar] [CrossRef] [PubMed]
  23. Malman, B.; Mashreghi, J.; O’Loughlin, R.; Ransford, T. Double-layer potentials, configuration constants, and applications to numerical ranges. Int. Math. Res. Not. IMRN Paper No. rnaf084, 34 pp. 2025, 2025(No. rnaf084). [Google Scholar] [CrossRef]
  24. Malman, B.; Mashreghi, J.; O’Loughlin, R.; Ransford, T. On the Crouzeix ratio for N×N matrices. Preprint. [CrossRef]
  25. Choi, D.; Greenbaum, A. Roots of matrices in the study of GMRES convergence and Crouzeix’s conjecture. SIAM J. Matrix Anal. Appl. 2015, 36, 289–301. [Google Scholar] [CrossRef]
  26. Chen, T.; Greenbaum, A.; Trogdon, T. GMRES, pseudospectra, and Crouzeix’s conjecture for shifted and scaled Ginibre matrices. Math. Comp. 2025, 94, 241–261. [Google Scholar] [CrossRef]
  27. Okubo, K.; Ando, T. Constants related to operators of class Cρ. Manuscripta Math. 1975, 16, 385–394. [Google Scholar] [CrossRef]
  28. Hartz, M.; McCarthy, J.E. From Clouâtre–Ostermann–Ransford to Okubo–Ando. Preprint. [CrossRef]
  29. Davidson, K.R.; Paulsen, V.I.; Woerdeman, H.J. Complete spectral sets and numerical range. Proc. Amer. Math. Soc. 2018, 146, 1189–1195. [Google Scholar] [CrossRef]
  30. Schwenninger, F.L.; de Vries, J. A sharp bound for the functional calculus of ρ-contractions. Proc. Amer. Math. Soc. 2025, 153, 4759–4768. [Google Scholar] [CrossRef]
  31. Crouzeix, M. Numerical ranges and spectral sets: the unbounded case. Preprint. [CrossRef]
  32. Schwenninger, F.L.; de Vries, J. On abstract spectral constants. In Operator and Matrix Theory, Function Spaces, and Applications; Ptak, M., Woerdeman, H.J., Wojtylak, M., Eds.; Birkhäuser/Springer: Cham, Operator Theory: Advances and Applications; 2024; Vol. 295, pp. 335–350. [Google Scholar] [CrossRef]
  33. Blazhko, H.; Homza, D.; Schwenninger, F.L.; de Vries, J.; Wojtylak, M. The algebraic numerical range as a spectral set in Banach algebras. Canad. J. Math. 2025, 1–25. [Google Scholar] [CrossRef]
  34. Jury, M.T.; Tsikalas, G. Positivity conditions on the annulus via the double-layer potential kernel. Stud. Math. 2024, 278, 233–265. [Google Scholar] [CrossRef]
  35. Agler, J.; Lykova, Z.A.; Young, N.J. Function theory on the annulus in the dp-norm. Integral Equ. Oper. Theory 2025, 97(Article 30), 32 pp. [Google Scholar] [CrossRef] [PubMed]
  36. Agler, J.; Lykova, Z.A.; Young, N.J. On the operators with numerical range in an ellipse. J. Funct. Anal. 2024, 287(Article 110556), 62 pp. [Google Scholar] [CrossRef]
  37. O’Loughlin, R.; Rani, J. q-numerical ranges and spectral sets. Preprint. [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings