Preprint
Article

This version is not peer-reviewed.

The Sharp Numerical-Range Spectral-Set Inequality

Submitted:

21 August 2026

Posted:

25 August 2026

Read the latest preprint version here

Abstract
We give a proof of the finite-dimensional scalar form of Crouzeix's conjecture: for every complex matrix A and every rational function r whose poles lie off the numerical range W(A), ||r(A)||_2 <= 2 max_{z in W(A)} |r(z)|. The argument first treats real-analytic strictly convex outer domains. It combines a positive normalized operator-valued double-layer kernel, conjugate Cauchy companions for all powers of finite Blaschke products, Fourier cancellation, and a bounded-sequence recurrence that excludes a singular value larger than 2. Schur approximation and a convex outer approximation then yield the polynomial and rational statements.
Keywords: 
;  ;  ;  ;  

The theorem below is the sharp constant-2 assertion conjectured by Crouzeix [1]. Crouzeix later obtained the dimension-free bound 11.08  [2], and the previously published general bound is 1 + 2 , due to Crouzeix and Palencia [5]. Two contemporaneous preprints also claim the sharp bound, by Jin [14] and by Lorist and Schwenninger [15]. The present proof is stated only for scalar-valued functions and finite-dimensional matrices.
Theorem 1. 
Let A ∈ C n × n , and let
W ( A ) = { x ∗ A x : x ∈ C n , ∥ x ∥ 2 = 1 } .
Then every complex polynomial p satisfies
∥ p ( A ) ∥ 2 ≤ 2 max z ∈ W ( A ) | p ( z ) | .
The same inequality holds for every rational function whose poles lie off W ( A ) . Thus W ( A ) , which is compact in finite dimensions, is a 2-spectral set for A.
Proof. 
We first prove the inequality with W ( A ) replaced by a particularly regular convex neighborhood. Let Ω be a bounded convex domain with real-analytic strictly convex boundary, and assume that W ( A ) ⋐ Ω . We shall prove
∥ h ( A ) ∥ 2 ≤ 2 ∥ h ∥ ∞ , Ω ( h ∈ H ∞ ( Ω ) ) .
The conjugate-Cauchy and positive double-layer framework used below originates in Delyon and Delyon [3] and was developed for convex spectral sets and numerical-range functional calculus in [2,4,5]. For a clarification of the symmetrized mechanism and a recent systematic treatment of the double-layer potential, see [6,7]. The finite-fiber kernel and the all-powers recurrence below are the forms used in the present argument.
We use counterclockwise orientation on ∂ Ω . At ζ ∈ ∂ Ω , let n ( ζ ) be the outward unit normal, regarded as a complex number, and let d s denote arclength. Thus
d ζ = i n ( ζ ) d s .
For a function u analytic on a neighborhood of Ω ¯ , define its conjugate Cauchy transform by
( Γ u ) ( z ) = 1 2 π i ∫ ∂ Ω u ( ζ ) ¯ ζ − z d ζ , z ∈ Ω .
We next establish the boundary kernel that drives the proof. Let ϕ : Ω → D be a conformal map. Real-analyticity of the boundary and Schwarz reflection imply that ϕ extends conformally across ∂ Ω  [8]. Let
f = B ∘ ϕ ,
where B is a nonconstant finite Blaschke product. Thus f is analytic on a neighborhood of Ω ¯ and | f | = 1 on ∂ Ω . If ζ = ζ ( s ) is an arclength parametrization and f ( ζ ( s ) ) = e i t ( s ) , then
κ ( ζ ) : = t ′ ( s ) > 0 , f ′ ( ζ ) n ( ζ ) = f ( ζ ) κ ( ζ ) .
Indeed, a finite Blaschke product restricts to an orientation-preserving covering of the unit circle. In particular, all boundary solutions of f ( ζ ) = α , α ∈ T , are simple.
For α ∈ T , put
K α ( z ) = ∑ ζ ∈ ∂ Ω f ( ζ ) = α n ( ζ ) κ ( ζ ) ( ζ − z ) .
This kernel has positive real part at A. In fact, convexity gives
Re n ( ζ ) ¯ ( ζ I − A ) ≻ 0 ,
because W ( A ) ⋐ Ω . If T is strictly accretive, then
Re ( T − 1 ) = T − ∗ ( Re T ) T − 1 ⪰ 0 .
Since
n ( ζ ) ( ζ I − A ) − 1 = n ( ζ ) ¯ ( ζ I − A ) − 1 ,
we obtain
H α : = Re K α ( A ) ⪰ 0 .
Let d m ( α ) = d t / ( 2 π ) be normalized arclength measure on T . The change of variables α = f ( ζ ) and (5) give d t = κ ( ζ ) d s on every sheet of the boundary covering. Hence, for m ≥ 0 ,
∫ T α m K α ( z ) d m ( α ) = 1 2 π ∫ ∂ Ω f ( ζ ) m n ( ζ ) ζ − z d s = 1 2 π i ∫ ∂ Ω f ( ζ ) m ζ − z d ζ = f ( z ) m ,
and, for m ≥ 1 ,
∫ T α ¯ m K α ( z ) d m ( α ) = 1 2 π i ∫ ∂ Ω f ( ζ ) m ¯ ζ − z d ζ = : g m ( z ) ,
where g m = Γ ( f m ) . These identities may be evaluated at A, since all functions involved are analytic on a neighborhood of spec ( A ) . If F = f ( A ) and G m = g m ( A ) , they yield
∫ T H α d m ( α ) = I , ∫ T α m H α d m ( α ) = F m + G m ∗ 2 ( m ≥ 1 ) .
The positivity in (8) and the first identity in (11) imply
∥ F m + G m ∗ ∥ 2 ≤ 2 ( m ≥ 1 ) .
To see this directly, for unit vectors u , v use positivity first in the pointwise inequality | v ∗ H α u | 2 ≤ ( v ∗ H α v ) ( u ∗ H α u ) , and then use Cauchy–Schwarz in L 2 ( d m ) to obtain
v ∗ ∫ T α m H α d m u ≤ ∫ T v ∗ H α v d m 1 / 2 ∫ T u ∗ H α u d m 1 / 2 = 1 .
The same scalar argument, with A replaced by any z ∈ Ω , gives
| f ( z ) m + g m ( z ) ¯ | ≤ 2 , ∥ g m ∥ ∞ , Ω ≤ 3 ( m ≥ 1 ) .
We need one more consequence of the same kernel. Define
P α ( z ) = 1 1 − α ¯ f ( z ) , R α ( z ) = P α ( z ) − K α ( z ) , C α = α I − F .
The principal part of P α at a boundary solution f ( ζ ) = α is
n ( ζ ) κ ( ζ ) ( ζ − z ) ,
by (5). Thus the apparent boundary poles cancel and R α is analytic across ∂ Ω . Furthermore,
P α ( z ) = ∑ m ≥ 0 α ¯ m f ( z ) m ( z ∈ Ω ) .
Comparing its Fourier coefficients with (9)–(10) gives
∫ T α m R α ( z ) d m ( α ) = 0 ( m ≥ 0 ) ,
∫ T α ¯ m R α ( z ) d m ( α ) = − g m ( z ) ( m ≥ 1 ) .
Only these Fourier-coefficient identities will be used; therefore no pointwise convergence of a Fourier series is required.
Since I − α ¯ F = α ¯ C α , we have P α ( A ) = α C α − 1 . Here C α is invertible: the spectral mapping theorem and the maximum principle give spec ( F ) = f ( spec ( A ) ) ⊂ D . A direct multiplication shows
C α ∗ Re ( P α ( A ) ) C α = I − Re ( α ¯ F ) .
Using P α = K α + R α , we therefore obtain the exact decomposition
E α : = I − Re ( α ¯ F ) = Q α + C α ∗ Re ( R α ( A ) ) C α , Q α : = C α ∗ H α C α ⪰ 0 .
We now prove that every f of the form (4) satisfies ∥ f ( A ) ∥ 2 ≤ 2 . Suppose, to the contrary, that
λ : = ∥ F ∥ 2 > 2 .
Choose unit singular vectors x , y such that
F x = λ y , F ∗ y = λ x .
For every function h analytic on Ω , put
τ ( h ) = x ∗ h ( A ) x .
Because h ( A ) commutes with F, (20) gives
y ∗ h ( A ) y = τ ( h ) , x ∗ h ( A ) y = 1 λ τ ( f h ) .
Indeed,
y ∗ h ( A ) y = λ − 2 x ∗ F ∗ h ( A ) F x = λ − 2 x ∗ F ∗ F h ( A ) x = x ∗ h ( A ) x ,
and the second equality follows from y = F x / λ .
For m ≥ 1 , define the real numbers
β m = Re τ ( f m g m ) .
They are bounded uniformly in m. To make this completely explicit, choose a positively oriented contour γ ⋐ Ω of winding number one around spec ( A ) . The holomorphic functional calculus gives
∥ h ( A ) ∥ 2 ≤ M ∥ h ∥ ∞ , Ω , M : = length ( γ ) 2 π max z ∈ γ ∥ ( z I − A ) − 1 ∥ 2 < ∞ .
Consequently, by (13),
| β m | ≤ ∥ ( f m g m ) ( A ) ∥ 2 ≤ 3 M ( m ≥ 1 ) .
The case m = 1 of (12), together with (21), gives
2 ≥ Re y ∗ ( F + G 1 ∗ ) x = λ + 1 λ Re τ ( f g 1 ) = λ + β 1 λ .
Thus
β 1 ≤ − λ ( λ − 2 ) < 1 .
Fix an integer N ≥ 1 and, for α ∈ T , set
v N ( α ) = x + ∑ j = 1 N α ¯ j F j − 1 y .
The sum telescopes after multiplication by C α :
w N ( α ) : = C α v N ( α ) = α x − ( λ − 1 ) y − α ¯ N F N y .
Fourier orthogonality also gives the exact identity
∫ T v N ( α ) ∗ E α v N ( α ) d m ( α ) = 2 − λ .
For completeness, the mean of ∥ v N ∥ 2 2 is
1 + ∑ k = 0 N − 1 ∥ F k y ∥ 2 2 ,
whereas the mean of α ¯ v N ∗ F v N is
λ + ∑ k = 1 N − 1 ∥ F k y ∥ 2 2 .
Their difference is precisely 2 − λ .
Applying the positive decomposition (18) to v N and using (29), we find
2 − λ ≥ ∫ T w N ( α ) ∗ Re ( R α ( A ) ) w N ( α ) d m ( α ) .
Put d = λ − 1 . The three Fourier exponents occurring in w N are 1 , 0 , − N . Expanding the right-hand side and using (15)–() shows that the only nonzero pairings are
∫ T w N ∗ R α ( A ) w N d m = d x ∗ G 1 y + x ∗ G N + 1 F N y − d y ∗ G N F N y .
By (21), the real part of (31) equals
λ − 1 λ β 1 + 1 λ β N + 1 − ( λ − 1 ) β N .
It follows from (30) that
β N + 1 ≤ − λ ( λ − 2 ) − ( λ − 1 ) β 1 + λ ( λ − 1 ) β N ( N ≥ 1 ) .
This recurrence contradicts the uniform bound (24). Indeed, set
q = λ ( λ − 1 ) > 1 , c = − λ ( λ − 2 ) − ( λ − 1 ) β 1 ,
and define U 1 = β 1 and U N + 1 = c + q U N . Induction in (33) gives β N ≤ U N . If
s = − c q − 1
is the fixed point of this affine recurrence, then
( q − 1 ) ( β 1 − s ) = λ ( λ − 2 ) ( β 1 − 1 ) < 0
by (19) and (26). Therefore
U N = s + q N − 1 ( β 1 − s ) ⟶ − ∞ .
For large N this gives β N < − 3 M , contradicting (24). The contradiction proves
∥ ( B ∘ ϕ ) ( A ) ∥ 2 ≤ 2
for every finite Blaschke product B. The assertion is immediate for a constant unimodular B.
We now pass from finite Blaschke products to all bounded analytic functions. We record the elementary approximation argument. If q : D → D ¯ is analytic, apply the Schur algorithm [9]
q 0 = q , γ j = q j ( 0 ) , q j + 1 ( z ) = q j ( z ) − γ j z ( 1 − γ j ¯ q j ( z ) ) .
As long as | γ j | < 1 , Schwarz’s lemma shows that q j + 1 is again a Schur function. At a chosen level N, replace q N by a unimodular constant and reverse the recursion by
b j ( z ) = γ j + z b j + 1 ( z ) 1 + γ j ¯ z b j + 1 ( z ) .
The resulting b 0 is a finite Blaschke product. Each reverse step in (36) raises by one the order of vanishing of the difference from the original Schur iterate. Hence b 0 − q = O ( z N ) . Since | b 0 − q | ≤ 2 , the generalized Schwarz lemma even gives
| b 0 ( z ) − q ( z ) | ≤ 2 | z | N .
If a Schur parameter is unimodular, the algorithm has already terminated in a finite Blaschke product. We have thus proved that finite Blaschke products are locally uniformly dense in the Schur class.
Given h ∈ H ∞ ( Ω ) with ∥ h ∥ ∞ , Ω ≤ 1 , apply this approximation to q = h ∘ ϕ − 1 . If B j → q locally uniformly on D , then B j ∘ ϕ → h locally uniformly on Ω . A Cauchy integral over a fixed contour surrounding spec ( A ) gives
( B j ∘ ϕ ) ( A ) ⟶ h ( A ) .
Passing to the limit in (35) proves (1).
It remains to let the regular convex domains approach W ( A ) . By the Toeplitz–Hausdorff theorem [10,11], W ( A ) is convex. The standard compression proof recalls that, in dimension at most two, the numerical range is a (possibly degenerate) elliptical disk [12]; it therefore contains the segment joining any two prescribed points of W ( A ) . Compactness follows from continuity on the unit sphere. We briefly justify the needed geometric approximation. For the support-function and curvature-measure facts used below, see [13]. For any compact convex set K ⊂ C , its support function
h K ( θ ) = max z ∈ K Re ( e − i θ z )
is continuous and the distribution h K + h K ′ ′ is a nonnegative measure. Convolve h K with a periodic Poisson kernel, add its uniform approximation error, and then add a positive constant tending to zero. The resulting real-analytic support functions h j satisfy
h j > h K , h j + h j ′ ′ > 0 , h j ⟶ h K uniformly .
The curves
ζ j ( θ ) = e i θ h j ( θ ) + i h j ′ ( θ )
bound real-analytic strictly convex domains Ω j with K ⋐ Ω j , and Ω ¯ j → K in Hausdorff distance.
Apply this construction to K = W ( A ) . From (1),
∥ p ( A ) ∥ 2 ≤ 2 max z ∈ Ω ¯ j | p ( z ) | .
Because p is continuous and Ω ¯ j → W ( A ) in Hausdorff distance, the right-hand side tends to 2 max z ∈ W ( A ) | p ( z ) | . This proves the theorem.
Finally, if r is rational and has no pole on W ( A ) , choose the domains Ω j above sufficiently close to W ( A ) that they contain no pole of r. Applying (1) directly to r on each Ω j and then taking the same Hausdorff limit gives
∥ r ( A ) ∥ 2 ≤ 2 max z ∈ W ( A ) | r ( z ) | .
This proves the stated spectral-set formulation as well.    □

Sharpness. 

The constant cannot be reduced. For
A = 0 1 0 0 , p ( z ) = z ,
the numerical range is the closed disk of radius 1 / 2 centered at the origin, whereas ∥ p ( A ) ∥ 2 = ∥ A ∥ 2 = 1 . Thus the ratio in the theorem is exactly 2.

Author Contributions

Qinyu Luo: conceptualization, methodology, formal analysis, writing—original draft, writing—review and editing, validation, supervision, and project administration. The author approved the final manuscript and accepts full responsibility for all of its contents.

Funding

The author received no external funding for this work.

Acknowledgments

The author acknowledges the substantial research assistance provided by OpenAI Codex using GPT-5.6 Sol with the Ultra reasoning setting. All AI-assisted output was reviewed and edited by the author.

AI Assistance and Contribution Statement

GPT-5.6 Sol Ultra (OpenAI), accessed through Codex, served as an AI research collaborator. It made substantial non-author contributions through adversarial line-by-line proof auditing; algebraic, Fourier-sign, boundary, and extremal-case checks; design and execution of three-route numerical cross-checks; literature and provenance verification; and English-language editing and release preparation. In accordance with current publication ethics rules, the AI system is not entered in the formal author metadata: it cannot approve the submitted version, hold copyright, or assume legal and scholarly accountability. Qinyu Luo reviewed the outputs, made the final decisions, and assumes complete responsibility for the manuscript.

Data and Code Availability

The manuscript source, compiled PDF, complete Lean 4 formalization, numerical cross-check scripts, machine-readable results, licenses, and citation metadata are available in the public GitHub repository. The immutable v0.1.0 release is permanently archived under the Zenodo version DOI 10.5281/zenodo.22052523; the concept DOI 10.5281/zenodo.22052522 identifies all versions. The GitHub tag archive and Zenodo deposit are byte-identical. The Lean project provides kernel-checked formal verification of the stated finite-dimensional scalar endpoint. The numerical computations are finite-precision falsification tests and are not proofs.

Conflicts of Interest

The author declares no conflict of interest. The views expressed are those of the author and do not necessarily represent ByteDance.

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(no. 2), 668–690. [Google Scholar] [CrossRef]
  3. Delyon, B.; Delyon, F. Generalization of von Neumann’s spectral sets and integral representation of operators. Bull. Soc. Math. Fr. 1999, 127(no. 1), 25–41. [Google Scholar] [CrossRef]
  4. Badea, C.; Crouzeix, M.; Delyon, B. Convex domains and K-spectral sets. Math. Z. 2006, 252(no. 2), 345–365. [Google Scholar] [CrossRef]
  5. 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]
  6. 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(no. 1), 342–345. [Google Scholar] [CrossRef]
  7. Schwenninger, F.L.; de Vries, J. The double-layer potential for spectral constants revisited. Integral Equ. Oper. Theory 2025, 97, 13. [Google Scholar] [CrossRef] [PubMed]
  8. Pommerenke, C. Boundary Behaviour of Conformal Maps . In Grundlehren der mathematischen Wissenschaften 299; Springer: Berlin, 1992. [Google Scholar] [CrossRef]
  9. Schur, I. Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind. I. J. Reine Angew. Math. 1917, 147, 205–232. [Google Scholar] [CrossRef]
  10. Toeplitz, O. Das algebraische Analogon zu einem Satze von Fejér. Math. Z. 1918, 2, 187–197. [Google Scholar] [CrossRef]
  11. Hausdorff, F. Der Wertvorrat einer Bilinearform. Math. Z. 1919, 3, 314–316. [Google Scholar] [CrossRef]
  12. Murnaghan, F.D. On the field of values of a square matrix. Proc. Natl. Acad. Sci. USA 1932, 18(no. 3), 246–248. [Google Scholar] [CrossRef] [PubMed]
  13. Schneider, R. Convex Bodies: The Brunn–Minkowski Theory. In Encyclopedia of Mathematics and its Applications 151, 2nd expanded ed.; Cambridge University Press: Cambridge, 2014. [Google Scholar] [CrossRef]
  14. Jin, S. The numerical range is a 2-spectral set. Prepr. 2026, 202607.1919, Version 4. [CrossRef]
  15. Lorist, E.; Schwenninger, F.L. A solution to Crouzeix’s conjecture. arXiv. 2026. Available online: https://arxiv.org/abs/2608.03841.
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.