Preprint
Article

This version is not peer-reviewed.

Two Boundary-Certificate Proofs of the Crouzeix Theorem: Fiberwise Fourier Recurrence and Defect-Gram Telescoping

Submitted:

27 August 2026

Posted:

28 August 2026

You are already at the latest version

Abstract
We give two proofs of the finite-dimensional scalar Crouzeix theorem: the numerical range of every complex matrix is a 2-spectral set for polynomials and for rational functions without poles on the numerical range. Both proofs start from the positive double-layer calculus and reduce the sharp local estimate to a top singular pair, but their certificates are different. The first disintegrates the boundary density over the fibres of a finite Blaschke product, uses conjugate Cauchy companions and Fourier cancellation, and forces an impossible unbounded scalar recurrence. The second keeps the boundary variable, constructs a positive defect-Gram family, and obtains a weighted telescoping identity whose strictly positive first defect excludes norm at or above 2. We identify the common scalar moment sequence underlying the two certificates. A shared finite confluent Schur completion, real-analytic convex outer exhaustion, and intrinsic rational calculus give the global theorem. Two pinned Lean 4 developments separately kernel-check the corresponding polynomial and reduced-rational endpoints.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

For a square matrix A, the numerical range W ( A ) is a compact convex set that contains the spectrum. Crouzeix proved in 2004 that the holomorphic functional calculus over W ( A ) admits a dimension-independent bound and conjectured that the optimal universal constant is 2 [3]. His subsequent general estimate gave the constant 11.08 [4]; further structural and numerical aspects were developed in [5]. Crouzeix and Palencia later established the published universal bound 1 + 2 [6]. A broad account of the problem, its extremal formulation, and the classes known at that time is given by Bickel et al. [2].
The integral machinery behind many of these estimates begins with the operator-valued boundary representation of Delyon and Delyon [8]. Its convex-domain and numerical-range forms were developed in [1,4], and the Crouzeix–Palencia symmetrized argument was clarified in [19]. Recent treatments of the double-layer potential and configuration constants include [14,22]. These works explain both the power of the positive boundary calculus and why an estimate of a symmetrized functional calculus does not, by itself, yield the sharp constant for the unsymmetrized value f ( A ) .
Two contemporaneous 2026 preprints also announce the constant-2 theorem: Jin [10] uses an auxiliary-basis positive-real completion and ordered weighted Gramians, whereas Lorist and Schwenninger [11] use a dilation perturbation lemma together with all iterates f n . Neither announced theorem is used in the manuscript proof below. In particular, the present local argument is not deduced from the sign condition discussed in Remark 2 of [11]; its strictness is supplied by a positive first boundary defect. The proof given here is finite-dimensional and scalar-valued. It makes no claim about the complete matrix-valued version, whose relation to scalar spectral sets is discussed in [7].
The paper contains two boundary-certificate proofs. Preliminary versions were released separately by the present author as the Boundary–Fourier route [12] and the Defect–Gram route [13]. The present manuscript consolidates the two proofs, removes duplicated global reductions, and proves their precise relationship. It is therefore submitted as a substantial follow-up version of the Boundary–Fourier preprint rather than as an unrelated new manuscript. For a finite Blaschke product on a conformal carrier, it disintegrates the positive double-layer density over boundary preimages. Conjugate Cauchy companions for all powers then give exact Fourier coefficients. A sum-of-squares remainder and a top singular pair produce an affine recurrence whose orbit would be unbounded if the norm exceeded 2.
The second proof uses the same positive boundary calculus in a different way. It keeps the boundary point as the integration variable and forms a defect-Gram family from the resolvent defects f ( σ ) j I f ( A ) j ( σ I A ) 1 . Diagonal and adjacent Gram identities collapse at a top singular pair to a scalar recurrence. A geometrically weighted telescope has only nonnegative terms and a strictly positive first defect, excluding norm at or above 2.
The two arguments are genuinely different certificates, not unrelated computations. Their scalar sequences coincide after commuting holomorphic functions of A, and the positive fibre kernel in the first proof is the disintegration of one half of the boundary density in the second. We make this relationship explicit after proving both local estimates. Neither certificate is deduced from the other, and either one can be combined with the shared global reduction: a finite confluent Schur completion replaces a normalized polynomial without loss at every Jordan jet, a real-analytic strictly convex outer exhaustion passes to W ( A ) , and direct polynomial approximation of pole terms yields the rational formulation.
Section 2 establishes the required numerical-range geometry. Section 3 and Section 4 give the two local proofs, and Section 5 identifies their common objects and their distinct contradiction mechanisms. Section 6 and Section 7 carry out the shared lossless inner replacement and outer-domain limit. Section 8 proves the rational equivalence. The final sections record sharpness, the scope of the two Lean 4 developments, availability, authorship, and disclosure information.
Throughout, vectors in C n are columns, u , v = u * v , and · denotes both the Euclidean vector norm and its induced operator norm. For A C n × n , its numerical range is
W ( A ) = { x * A x : x C n , x   = 1 } .
Theorem 1.  
For every A C n × n and every polynomial p,
p ( A ) 2 max z W ( A ) | p ( z ) | .
Moreover, W ( A ) is a compact convex set containing spec ( A ) .
For a compact set K C containing spec ( A ) , call K aC-spectral set for rational functionsif
r ( A ) C max z K | r ( z ) |
for every rational function r having no pole on K, where r ( A ) is specified intrinsically in Section 8. For K = W ( A ) and any fixed C 0 , the rational estimate (2) is equivalent to its restriction to polynomials. Consequently, (1) is equivalent to the assertion that W ( A ) is a 2-spectral set for rational functions.
We prove every problem-specific ingredient. We use as foundational only the Riemann mapping theorem, the maximum-modulus principle, Schwarz’s lemma, Cauchy’s integral and derivative formulas, Jordan normal form, the singular value decomposition, the Jordan separation theorem, the conformal area formula, and elementary separation and support facts for planar compact convex sets. Standard background on conformal boundary behavior and convex support functions may be found in [18,20].

2. Geometry of the Numerical Range

Convexity is the classical Toeplitz–Hausdorff theorem [9,23]; the two-dimensional compression has the elliptical-range description of Murnaghan [17]. We include a short self-contained proof tailored to the finite-dimensional setting.
Lemma 2.  
The set W ( A ) is compact and convex, and spec ( A ) W ( A ) .
Proof. 
The unit sphere is compact and x x * A x is continuous, so W ( A ) is compact. If A v = λ v and v   = 1 , then v * A v = λ , proving spec ( A ) W ( A ) .
For convexity, take z 1 = x * A x and z 2 = y * A y , and compress A to S = span { x , y } . If dim S = 1 , then z 1 = z 2 . Suppose dim S = 2 and, in an orthonormal basis of S, write the compression as C. Put
σ 1 = 0 1 1 0 , σ 2 = 0 i i 0 , σ 3 = 1 0 0 1 .
A direct multiplication shows that the rank-one orthogonal projections on S are exactly
P ( r ) = 1 2 I + r 1 σ 1 + r 2 σ 2 + r 3 σ 3 , r = ( r 1 , r 2 , r 3 ) R 3 , | r | = 1 .
Thus the numerical range of C is
tr C 2 + L ( S 2 ) , L ( r ) = 1 2 k = 1 3 r k tr ( C σ k ) ,
where L : R 3 C R 2 is real-linear. Since ker L { 0 } ,
L ( S 2 ) = L ( B 3 ¯ ) .
Indeed, if | r | 1 , choose 0 k ker L . The quadratic function t | r + t k | 2 tends to infinity and has a minimum no larger than | r | 2 1 , so it equals 1 for some real t; then L ( r + t k ) = L ( r ) . The reverse inclusion in (3) is immediate. The image of the ball is convex. It contains z 1 , z 2 , its entire segment lies in the compression numerical range, and that compression numerical range lies in W ( A ) . Hence W ( A ) is convex.    □

3. First Local Proof: Boundary Fibres and Fourier Recurrence

Let Ω be a bounded convex domain with real-analytic strictly convex boundary and W ( A ) Ω . Let ϕ : Ω D be a conformal map. Schwarz reflection across the analytic boundary implies that ϕ extends conformally across Ω ; see [18]. Let
f = B ϕ ,
where B is a nonconstant finite Blaschke product. Thus f is analytic on a neighborhood of Ω ¯ and | f | = 1 on Ω .
Proposition 3 
(Boundary–Fourier local estimate). Every f of the form (4) satisfies
f ( A )   2 .
The assertion also holds when B is a unimodular constant.
Proof. 
Give Ω its counterclockwise orientation. 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 .
If ζ = ζ ( s ) is an arclength parametrization and f ( ζ ( s ) ) = e i t ( s ) , then
κ ( ζ ) : = t ( s ) > 0 , f ( ζ ) n ( ζ ) = f ( ζ ) κ ( ζ ) .
Indeed, B ϕ restricts to an orientation-preserving finite 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. Convexity and strict containment give
Re n ( ζ ) ¯ ( ζ I A ) 0 .
If T is strictly accretive, then
Re ( T 1 ) = T * ( ( ) ) T 1 0 .
Since
n ( ζ ) ( ζ I A ) 1 = n ( ζ ) ¯ ( ζ I A ) 1 ,
we obtain
H α : = Re α ( A ) 0 .
Let d m ( α ) = d t / ( 2 π ) be normalized arclength measure on T . Changing variables by α = f ( ζ ) on every sheet of the boundary covering and using (6), for m 0 we obtain
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 ) .
These identities may be evaluated at A. With
F = f ( A ) , G m = g m ( A ) ,
they give
T H α d m ( α ) = I , T α m H α d m ( α ) = F m + G m * 2 ( m 1 ) .
The positivity and normalization in (9)–(12) imply
F m + G m *   2 ( m 1 ) .
Indeed, for unit vectors u , v , positivity first gives | v * H α u | 2 ( v * H α v ) ( u * H α u ) , and Cauchy–Schwarz in L 2 ( d m ) then gives
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 z Ω , gives
| f ( z ) m + g m ( z ) ¯ | 2 , g m , Ω 3 .
For α T , define
P α ( z ) = 1 1 α ¯ f ( z ) , R α ( z ) = P α ( z ) K α ( z ) , C α = α I F .
At a boundary solution f ( ζ ) = α , the principal part of P α is
n ( ζ ) κ ( ζ ) ( ζ z )
by (6); hence all apparent boundary poles cancel in R α . Since P α ( z ) = m 0 α ¯ m f ( z ) m in Ω , comparison with (10) and (11) yields
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 are used; no pointwise convergence of a Fourier series is needed.
Because I α ¯ F = α ¯ C α , we have P α ( A ) = α C α 1 . The matrix C α is invertible: the maximum-modulus principle and spectral mapping give spec ( F ) = f ( spec ( A ) ) D . Direct multiplication gives
C α * Re ( P α ( A ) ) C α = I Re ( α ¯ F ) .
Using P α = K α + R α , we therefore have the exact decomposition
E α : = I Re ( α ¯ F ) = Q α + C α * Re ( R α ( A ) ) C α , Q α : = C α * H α C α 0 .
Assume for contradiction that
λ : = F   > 2 .
Choose unit singular vectors x , y such that
F x = λ y , F * y = λ x .
For every function h holomorphic on Ω , set τ ( h ) = x * h ( A ) x . Because h ( A ) commutes with F, (21) gives
y * h ( A ) y = τ ( h ) , x * h ( A ) y = 1 λ τ ( f h ) .
For m 1 , define
β m = Re τ ( f m g m ) .
These numbers are uniformly bounded. Indeed, choose a positively oriented contour γ Ω of winding number one around spec ( A ) . The holomorphic functional calculus gives
h ( A )   M h , Ω , M : = length ( γ ) 2 π max z γ ( z I A ) 1   < .
Thus (14) implies
| β m | 3 M ( m 1 ) .
The case m = 1 of (13), together with (22), gives
2 Re ( y * ( F + G 1 * ) x ) = λ + β 1 λ .
Hence
β 1 λ ( λ 2 ) < 1 .
Fix N 1 and set
v N ( α ) = x + j = 1 N α ¯ j F j 1 y .
Multiplication by C α telescopes:
w N ( α ) : = C α v N ( α ) = α x ( λ 1 ) y α ¯ N F N y .
Fourier orthogonality gives the exact identity
T v N ( α ) * E α v N ( α ) d m ( α ) = 2 λ .
For completeness, the mean of v N 2 is 1 + k = 0 N 1 F k y 2 , whereas the mean of α ¯ v N * F v N is λ + k = 1 N 1 F k y 2 .
Apply the positive decomposition (19) to v N and use (29). We get
2 λ T w N ( α ) * Re ( R α ( A ) ) w N ( α ) d m ( α ) .
Put d = λ 1 . The three Fourier exponents in w N are 1 , 0 , N . Expanding and using (16)–(17), the only nonzero pairings give
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 (22), the real part of the right side is
λ 1 λ β 1 + 1 λ β N + 1 ( λ 1 ) β N .
It follows that
β N + 1 λ ( λ 2 ) ( λ 1 ) β 1 + λ ( λ 1 ) β N .
This contradicts (25). To see it explicitly, let
q = λ ( λ 1 ) > 1 , c = λ ( λ 2 ) ( λ 1 ) β 1 ,
and define U 1 = β 1 , U N + 1 = c + q U N . Induction in (33) gives β N U N . If s = c / ( q 1 ) is the fixed point, then
( q 1 ) ( β 1 s ) = λ ( λ 2 ) ( β 1 1 ) < 0
by (20) and (26). Therefore U N = s + q N 1 ( β 1 s ) , contradicting | β N | 3 M . Hence F   2 . The constant unimodular case is immediate.    □

4. Second Local Proof: Defect-Gram Recurrence and Telescope

Let Ω C be a bounded convex domain with C 1 Jordan boundary, and assume
W ( A ) Ω .
Set A ( Ω ) = Hol ( Ω ) C ( Ω ¯ ) . We shall prove the following local estimate.
Proposition 4 
(Defect–Gram local estimate). If f A ( Ω ) and | f ( σ ) | = 1 for every σ Ω , then
f ( A )   < 2 .
Give Ω its counterclockwise orientation. At σ Ω , let n σ be the outward unit normal and put
R σ = ( σ I A ) 1 , Q σ = Re n σ ¯ ( σ I A ) , μ σ = 1 π R σ * Q σ R σ .
The resolvent exists by Lemma 2 and (35). The supporting-line property of a convex C 1 domain says
Re n σ ¯ ( σ z ) > 0 ( z W ( A ) ) .
The inequality is strict uniformly over the compact set W ( A ) . Therefore, for every unit vector v,
v * Q σ v = Re n σ ¯ ( σ v * A v ) > 0 ,
so
Q σ 0 .
For a continuous scalar function u on the boundary, define
L ( u ) = Ω u ( σ ) μ σ d s .
For h A ( Ω ) , define
g h ( z ) = 1 2 π i Ω h ( σ ) ¯ σ z d σ , z Ω .
Differentiation on compact subsets shows that g h is holomorphic. Jordan form and Cauchy’s derivative formula give
g h ( A ) = 1 2 π i Ω h ( σ ) ¯ R σ d σ .
Indeed, on a Jordan block J = λ I + N of size m the right side is
k = 0 m 1 N k 1 2 π i Ω h ( σ ) ¯ ( σ λ ) k + 1 d σ = k = 0 m 1 g h ( k ) ( λ ) k ! N k = g h ( J ) .
We also need the analytic half of Cauchy’s formula at exactly the regularity A ( Ω ) . Fix a Ω and let h t ( z ) = h ( a + t ( z a ) ) , 0 < t < 1 . Convexity gives a + t ( Ω ¯ a ) Ω , so h t is holomorphic on a neighborhood of Ω ¯ . Uniform continuity of h gives h t h uniformly on Ω ¯ as t 1 . The matrix Cauchy formula for h t , checked on each Jordan block, is
1 2 π i Ω h t ( σ ) R σ d σ = h t ( A ) .
On the left one may pass to the limit uniformly. On an interior contour surrounding spec ( A ) , uniform convergence gives h t ( A ) h ( A ) . Hence
1 2 π i Ω h ( σ ) R σ d σ = h ( A ) .
From (36),
μ σ = 1 2 π n σ R σ + n σ ¯ R σ * .
Since d σ = i n σ d s , equations (39)–(41) imply
L ( h ) = h ( A ) + g h ( A ) * .
For h = 1 , g 1 = 1 by Cauchy’s formula, and therefore
Ω μ σ d s = 2 I .
All these are ordinary norm-convergent integrals of continuous matrix-valued functions.
Put F = f ( A ) and, for j 0 , set
D j ( σ ) = ( f ( σ ) j I F j ) R σ , G j = g f j ( A ) , H j = L ( f j ) = F j + G j * ,
and
E r s = Ω D r ( σ ) * Q σ D s ( σ ) d s π ( r , s 0 ) .
Functions of A commute with R σ , and functions of A * commute with R σ * . Expanding without moving a factor across Q σ , and using (42) and (43), gives
E r s = 2 F * r F s H r * F s F * r H s + L ( f ¯ r f s ) .
This is a Gram matrix: for arbitrary vectors v 0 , , v N ,
r , s = 0 N v r * E r s v s = Ω Q σ 1 / 2 s = 0 N D s ( σ ) v s 2 d s π 0 .
On the boundary, f ¯ r f s = f s r for s r , and L ( h ¯ ) = L ( h ) * . Consequently,
E j j = 2 I G j F j F * j G j * ,
E j + 1 , j = G j + 1 F j F * ( j + 1 ) G j * + F * + G 1 .
Proof of Proposition 4 
If c = F   1 , there is nothing to prove. Suppose c > 1 . Choose unit top right and left singular vectors x , y ; thus
F x = c y , F * y = c x .
No orthogonality between x and y is asserted or needed. If q ( A ) is any holomorphic function of A, it commutes with F, and
x * q ( A ) x = c 1 y * F q ( A ) x = c 1 y * q ( A ) F x = y * q ( A ) y .
For j 1 , define
a j = Re ( y * G j F j y ) = Re ( x * G j F j x ) ,
where the equality follows from (51), and put
U j ( σ ) = D j + 1 ( σ ) x D j ( σ ) y , S j = Ω Q σ 1 / 2 U j ( σ ) 2 d s π 0 .
Equations (48) and (52) yield
x * E j + 1 , j + 1 x = 2 2 a j + 1 , y * E j j y = 2 2 a j .
For the adjacent term, (50) gives
x * G j + 1 F j y = c 1 y * G j + 1 F j + 1 y , Re x * F * ( j + 1 ) G j * y ) = c a j , x * F * y = c , x * G 1 y = c 1 y * G 1 F y .
Substitution into (49) gives
Re ( x * E j + 1 , j y ) = a j + 1 c c a j + c + a 1 c .
Expanding the square defining S j now proves the exact recurrence
S j 2 = 2 c a 1 c + ( c 1 ) a j 1 1 c a j + 1 .
The companion integral (39) and | f | = 1 give the uniform bound
G j   length ( Ω ) 2 π max σ Ω R σ   = : C Ω , A .
Because c > 1 , f cannot be constant. The maximum-modulus principle gives | f ( z ) | < 1 in Ω . By Jordan form,
spec ( F ) = { f ( λ ) : λ spec ( A ) } ;
indeed, f ( λ I + N ) is triangular with diagonal f ( λ ) . Hence the spectral radius of F is less than 1. Jordan form then gives F j   0 , and (54) implies
| a j | C Ω , A F j   0 .
Multiply (53) by c j and sum from j = 1 to N. A finite telescoping computation gives
j = 1 N S j 2 c j = 2 c a 1 c 1 c N c 1 + c 1 c a 1 c 1 c N + 1 a N + 1 .
Using (55) and simplifying,
j = 1 S j 2 c j = ( c 2 ) ( a 1 1 ) c 1 .
Let
e = x * E 11 x = Ω Q σ 1 / 2 D 1 ( σ ) x 2 d s π .
Equation (48) says e = 2 ( 1 a 1 ) , so
j = 1 S j 2 c j + c 2 2 ( c 1 ) e = 0 .
For each boundary point, every eigenvalue of F has modulus less than 1, whereas | f ( σ ) | = 1 . Thus
D 1 ( σ ) = ( f ( σ ) I F ) R σ
is invertible. Along with (37), this proves e > 0 . Furthermore,
D j + 1 ( σ ) = f ( σ ) D j ( σ ) + D 1 ( σ ) F j ,
so (50) gives
U 1 ( σ ) = D 1 ( σ ) f ( σ ) x + ( c 1 ) y .
The vector in parentheses cannot vanish. If it did, the norms of the two unit vectors and | f ( σ ) | = 1 would force c = 2 and y = f ( σ ) x ; then F x = c y would make x an eigenvector of F with an eigenvalue of modulus 2, contrary to the spectral-radius conclusion. Thus (37), invertibility of D 1 ( σ ) , and (60) give S 1 > 0 .
If c > 2 , both terms on the left of (59) are nonnegative and the second is positive, a contradiction. If c = 2 , the first term is positive because S 1 > 0 , again a contradiction. Therefore c < 2 .    □

5. Relationship Between the Two Certificates

The two local proofs organize the same positive boundary calculus in different ways. We record the exact relationship, both to clarify the shared structure and to separate the two contradiction mechanisms.
Use the hypotheses and notation of Section 3. For a boundary point ζ , write
R ζ = ( ζ I A ) 1 , Δ ζ = Re n ( ζ ) ¯ ( ζ I A ) , μ ζ = 1 π R ζ * Δ ζ R ζ .
This is precisely the density used in Section 4. The inverse-accretive identity (8) gives
μ ζ = 1 π Re n ( ζ ) ( ζ I A ) 1 .
Lemma 5 
(Fibre disintegration). For every continuous scalar function u on T ,
T u ( α ) H α d m ( α ) = 1 2 Ω u ( f ( ζ ) ) μ ζ d s .
Proof. 
Equations (7) and (61) give
H α = π f ( ζ ) = α μ ζ κ ( ζ ) .
On every sheet of the covering f : Ω T , d m = d t / ( 2 π ) = κ ( ζ ) d s / ( 2 π ) by (6). Substitution cancels κ and proves (62). Taking u = 1 also explains the normalizations T H α d m = I and Ω μ ζ d s = 2 I .    □
There is also one common scalar companion sequence. Choose the same top right singular vector x for F = f ( A ) in both proofs and use the same conjugate Cauchy companion G j = g f j ( A ) . The first proof calls its moment
β j = Re ( x * F j G j x ) ,
whereas the second calls it
a j = Re ( x * G j F j x ) .
Both F j and G j are holomorphic functions of A, so they commute. Consequently,
β j = a j ( j 1 ) .
The equality of the input data does not identify the certificates. The first proof pushes the positive density to T , subtracts the fibrewise Cayley kernel, and uses exact Fourier cancellation to derive an unstable affine orbit. It excludes F   > 2 . The second proof polarizes the defects before integrating, retains their Gram positivity term by term, and sums an exact recurrence with geometric weights. Its positive first defect also excludes the equality case F   = 2 for nonconstant boundary-inner f.
Feature Boundary–Fourier certificate Defect–Gram certificate
Positive object Fibre kernel H α 0 on T Boundary block Gram family ( E r s )
Organization Fibres of f : Ω T Powers f r , f s at each boundary point
Scalar data β j The same sequence a j
Main algebra Cayley remainder and Fourier coefficients Diagonal and adjacent Gram identities
Final contradiction Unbounded affine orbit Nonnegative weighted telescope
Excluded case F   > 2 F   2 for nonconstant f
Boundary hypothesis Real-analytic carrier and finite Blaschke pullback C 1 convex carrier and any boundary-inner f
   Thus the routes share their geometric and functional-calculus foundation but provide distinct sharp local certificates. Either local proposition is sufficient for the common globalization below.

6. Finite Confluent Inner Replacement

We next replace a normalized polynomial by one boundary-inner scalar function without changing its value at the matrix. The recursion used below is the finite multipoint form of the classical Schur algorithm [21]; all details needed here, including repeated nodes, are proved directly. For a , c D , write
b a ( z ) = z a 1 a ¯ z , τ c ( w ) = w c 1 c ¯ w .
A Schur function is a holomorphic map from D into D ¯ .
Lemma 6 
(Finite confluent Schur completion). Let s be a Schur function and let a 1 , , a N D , with repetitions allowed. There is a finite Blaschke product B of degree at most N such that
s B is divisible in Hol ( D ) by k = 1 N b a k .
A degree-zero finite Blaschke product is a unimodular constant. In particular, if a occurs m times, then B ( ) ( a ) = s ( ) ( a ) for 0 < m .
Proof. 
If q is Schur, a D , and c = q ( a ) , then either | c | = 1 , in which case q c by the maximum-modulus principle, or | c | < 1 and
( S q ) ( z ) = τ c ( q ( z ) ) b a ( z )
is Schur. The singularity is removable, and this assertion follows by applying Schwarz’s lemma to τ c q b a 1 , which fixes zero. Conversely, if r is Schur, then
q ( z ) = τ c 1 ( b a ( z ) r ( z ) ) = c + b a ( z ) r ( z ) 1 + c ¯ b a ( z ) r ( z )
is Schur and q ( a ) = c .
Starting with s 0 = s , put c k = s k 1 ( a k ) and apply (65) successively while | c k | < 1 . If | c k | = 1 at some stage, s k 1 is constant. Reconstructing by (66) for the preceding stages shows that s itself is a finite Blaschke product of degree at most k 1 ; take B = s .
If all N steps occur, choose an arbitrary unimodular constant B N and reconstruct backwards:
B k 1 ( z ) = τ c k 1 ( b a k ( z ) B k ( z ) ) , k = N , N 1 , , 1 .
Each B k 1 is rational, has no pole on D ¯ , is unimodular on D , and has degree one more than B k ; hence B = B 0 is a finite Blaschke product of degree at most N. The identity
c + u 1 + c ¯ u c + v 1 + c ¯ v = ( 1 | c | 2 ) ( u v ) ( 1 + c ¯ u ) ( 1 + c ¯ v )
shows at each backward step that s k 1 B k 1 gains the factor b a k and retains every factor of s k B k . The denominators do not vanish in D . Backward induction proves (64). Since b a has a simple zero at a, the jet assertion follows.    □
The Riemann map used below needs only continuous boundary values. This is a special case of the classical boundary-extension theory for conformal maps [18]; we include a proof at the required regularity.
Lemma 7 
(Boundary extension for smooth convex domains). If U , V are bounded convex domains with C 1 Jordan boundaries, every conformal bijection F : U V extends to a homeomorphism U ¯ V ¯ .
Proof. 
Fix ξ U and u 0 U . For every sufficiently small regular r > 0 , the set C r = U B ( ξ , r ) is one open arc separating the cap U r = U B ( ξ , r ) from u 0 . To check this locally, translate and rotate so that the boundary is the graph y = g ( x ) , where g is convex, g ( 0 ) = g ( 0 ) = 0 , and U is above the graph. On x > 0 the function x 2 + g ( x ) 2 is strictly increasing, and on x < 0 it is strictly decreasing. Thus a sufficiently small centered circle has exactly two boundary intersections and its portion in U is one arc.
The conformal area formula gives
U | F ( z ) | 2 d A ( z ) = area ( V ) < .
If ( r ) is the length of F ( C r ) , Cauchy–Schwarz and length ( C r ) 2 π r give
0 R ( r ) 2 r d r 2 π U B ( ξ , R ) | F ( z ) | 2 d A ( z ) < .
Hence there are decreasing regular radii r j 0 with ( r j ) 0 .
For such a radius, the finite-length arc F ( C r ) has endpoint limits in V ¯ . They lie on V : an interior endpoint limit would, by continuity of F 1 there, force points tending to U to converge to an interior point. The closure Γ r of F ( C r ) is either a crosscut of V or a Jordan loop meeting V only at its common endpoint, and diam Γ r ( r ) .
We use the following elementary small-crosscut observation. If such an arc Γ separates a bounded convex Jordan domain V, then, as diam Γ 0 , the component not containing a fixed v 0 V has diameter tending to zero. For distinct endpoints a , b , a circle parametrization of V and uniform continuity of it and its inverse show that one of the two boundary arcs β from a to b has diameter tending to zero with | a b | . The Jordan curve Γ β bounds one component, whose closure is contained in conv ( Γ β ) because V is convex; its diameter tends to zero. Once it is smaller than dist ( v 0 , V ) , it is the component not containing v 0 . If the endpoints agree, use the Jordan loop Γ and the same convex-hull argument.
The homeomorphism F : U V maps the two components cut off by C r j to those cut off by F ( C r j ) . Therefore
diam F ( U r j ) 0 .
The nested caps form a neighborhood basis at ξ ; their image closures are nested nonempty compact sets with diameters tending to zero. Their intersection is one point, which is the limit of F ( z ) as z U tends to ξ .
These boundary limits define a continuous extension. Indeed, if ξ k U tends to ξ , choose z k U with | z k ξ k | < 1 / k and | F ( z k ) F ( ξ k ) | < 1 / k . Then z k ξ , so F ( ξ k ) F ( ξ ) . Mixed interior-boundary sequences are handled the same way. Apply the argument also to F 1 ; the two extensions are inverse by approximation with interior points. Thus the extension is a homeomorphism.    □
Lemma 8 
(Lossless boundary-inner replacement). Let Ω be a bounded real-analytic strictly convex domain with W ( A ) Ω , and let p be a nonzero polynomial. Set
M Ω = max z Ω ¯ | p ( z ) | .
There is a finite Blaschke product B and a conformal map ϕ : Ω D , continuous on the closures, such that f = B ϕ A ( Ω ) , | f | = 1 on Ω , and
f ( A ) = p ( A ) M Ω .
The degree of B is at most the degree of the minimal polynomial of A.
Proof. 
Factor the minimal polynomial as
μ A ( z ) = j = 1 s ( z λ j ) m j , N = j = 1 s m j .
The Riemann mapping theorem gives a conformal bijection ϕ : Ω D . Lemma 7, applied also to ψ = ϕ 1 , gives homeomorphic extensions to the closures and maps Ω onto D .
Since M Ω > 0 , the function
s ( w ) = p ( ψ ( w ) ) M Ω
is a Schur function continuous on D ¯ . Put α j = ϕ ( λ j ) and apply Lemma 6 to the list in which α j occurs m j times. It gives a finite Blaschke product B of degree at most N. Let f = B ϕ . It lies in A ( Ω ) and is unimodular on the boundary.
Near λ j ,
b α j ( ϕ ( z ) ) = ( z λ j ) v j ( z ) , v j ( λ j ) = ϕ ( λ j ) 1 | α j | 2 0 .
Thus f p / M Ω has a zero of order at least m j at each λ j . Holomorphic functions with these same jets have equal matrix values: on the generalized eigenspace for λ j , write A = λ j I + N j , with N j m j = 0 , and use
h ( A ) = k = 0 m j 1 h ( k ) ( λ j ) k ! N j k .
This proves (69), including nonsemisimple A.    □

7. Real-Analytic Strictly Convex Outer Exhaustion

Lemma 9.  
Every compact convex K C , including a segment or a point, has compact real-analytic strictly convex supersets K m such that K int K m and K m K in Hausdorff distance.
Proof. 
Let
h ( θ ) = max z K Re ( e i θ z )
be the support function. In the distributional sense,
h + h 0 .
For completeness, approximate K in Hausdorff distance by convex polygons. Their support functions converge uniformly to h. A polygonal support function satisfies h + h = 0 between switching angles and has a nonnegative jump in its derivative at every switch; hence its h + h is a nonnegative atomic measure. Passing against nonnegative smooth test functions proves (70).
Let η m be periodic Poisson kernels with parameters tending to 1. They are positive real-analytic approximate identities. Set
h m 0 = h * η m , ε m = h m 0 h + 1 m , H m = h m 0 + ε m .
Then
H m + H m = ( h + h ) * η m + ε m > 0 , H m h + 1 m .
Define
γ m ( θ ) = e i θ ( H m ( θ ) + i H m ( θ ) ) .
Then γ m ( θ ) = i e i θ ( H m + H m ) , so the curve is regular. For every α ,
d d θ Re ( e i α γ m ( θ ) ) = ( H m + H m ) sin ( θ α ) .
Thus the indicated functional has its unique maximum at θ = α , with value H m ( α ) .
The curve is injective. If 0 < β α π , then
γ m ( β ) γ m ( α ) = α β i e i θ ( H m + H m ) d θ
has positive scalar projection onto i e i ( α + β ) / 2 , because the relevant cosine is nonnegative and positive in the interior. For π < β α < 2 π , use the complementary interval. Hence γ m is a real-analytic Jordan curve. Its convex hull K m has support function H m by (73); the unique support point in every direction is γ m ( α ) . Thus K m is exactly this curve and contains no nontrivial segment, so K m is strictly convex.
The support function of K + m 1 D ¯ is h + m 1 . Equation (71) and the support-half-plane description of compact convex sets give
K + m 1 D ¯ K m ,
so K int K m . Finally,
H m h 2 h * η m h + 1 m 0 .
For compact convex sets C , D , d H ( C , D ) = h C h D : the inclusion C D + δ D ¯ is equivalent, by the support-half-plane description, to h C h D + δ , and one applies this in both directions. Therefore K m K in Hausdorff distance.    □
Proof of the polynomial inequality in Theorem 1 
Put K = W ( A ) . It is compact and convex by Lemma 2. Let K m be supplied by Lemma 9, and write Ω m = int K m . If p is nonzero, then
M m = max z K m | p ( z ) | > 0 .
Lemma 8 supplies f m = B m ϕ m with f m ( A ) = p ( A ) / M m and | f m | = 1 on Ω m . Because each Ω m has real-analytic boundary, the local estimate may be obtained from either Proposition 3 or Proposition 4. The first gives p ( A ) 2 M m directly. The second gives the strict inequality when B m is nonconstant, while a constant B m gives p ( A ) = M m . Thus, by either proof route,
p ( A ) 2 M m .
Hausdorff convergence and uniform continuity of p on a fixed compact neighborhood imply
M m M K : = max z K | p ( z ) | .
Indeed, K K m gives M m M K , while every point of K m is within d H ( K m , K ) of a point of K, giving the reverse limsup. Letting m in (74) proves (1). The zero polynomial is immediate. This also covers the case of a nonzero polynomial vanishing on a segment or singleton K: every M m is positive and its limit is zero.    □

8. Rational Spectral Sets

We first make the rational functional calculus explicit. If r = a / b , where a , b are polynomials and b has no zero on a compact set K spec ( A ) , define
r ( A ) = a ( A ) b ( A ) 1 .
The matrix b ( A ) is invertible: in Jordan form, each block b ( λ I + N ) is upper triangular with diagonal entry b ( λ ) 0 . The definition is representation-independent. If a / b = c / d as rational functions, then the polynomial identity a d = b c gives a ( A ) d ( A ) = b ( A ) c ( A ) . All polynomial functions of A commute; multiplying by the commuting inverses of b ( A ) and d ( A ) gives a ( A ) b ( A ) 1 = c ( A ) d ( A ) 1 .
On a Jordan block J = λ I + N of size m, this definition agrees with the Taylor formula
r ( J ) = j = 0 m 1 r ( j ) ( λ ) j ! N j .
To see this without assuming the conclusion, Taylor’s formula modulo ( z λ ) m gives polynomials A 0 , B 0 of degree below m such that a ( z ) A 0 ( z ) and b ( z ) B 0 ( z ) modulo ( z λ ) m . Because B 0 ( λ ) 0 , the truncated Taylor polynomial of 1 / B 0 multiplies B 0 to 1 modulo ( z λ ) m . Substitution z = λ I + N therefore shows that b ( J ) 1 is the corresponding truncated Taylor polynomial, and multiplying by a ( J ) yields precisely the truncated Taylor expansion of a / b , namely (76). This proves, in particular, that repeated Jordan blocks and repeated poles in a partial-fraction expansion cause no ambiguity.
Proposition 10.  
Let A C n × n and let K C be compact and convex with spec ( A ) K . For a fixed C 0 , the following are equivalent:
p ( A ) C max K | p | for every polynomial p ; r ( A ) C max K | r | for every rational r with no pole on K .
Proof. 
Clearly (R) implies (P), because polynomials are rational functions with no finite poles. Assume (P), and let r have no pole on K. If r has no finite pole, then it is a polynomial and there is nothing to prove. We may therefore list its distinct finite poles as w 1 , , w s , all outside K. Choose ε > 0 smaller than min j dist ( w j , K ) and put
L = K + { z : | z | < ε } .
Then L is an open bounded convex neighborhood of K and L ¯ misses every pole.
Fix one pole w L ¯ . Choose z 0 L ¯ minimizing | w z | and put u = ( w z 0 ) / | w z 0 | . For z L ¯ , convexity puts z 0 + t ( z z 0 ) L ¯ for 0 t 1 . The right derivative at t = 0 of the squared distance to w is nonnegative, hence
Re ( ( ( w z 0 ) ¯ ( z z 0 ) ) 0 .
Writing d = | w z 0 | > 0 and ξ = u ¯ ( z w ) , we obtain Re d on L ¯ . Let M = max z L ¯ | ξ | and choose a real R > M 2 / ( 2 d ) . Then
| ξ + R | 2 = R 2 + 2 R Re ( + | ξ | 2 R 2 2 R d + M 2 < R 2 .
Consequently
q : = sup z L ¯ | 1 + ξ / R | < 1 ,
and the geometric expansion
1 z w = u ¯ R k = 0 1 + u ¯ ( z w ) R k
converges uniformly on L ¯ . Its partial sums are polynomials in z. Products of uniformly convergent sequences are uniformly convergent on this compact set, so powers of these partial sums approximate ( z w ) j uniformly for every positive integer j. The partial-fraction expansion of r, with every multiplicity retained, therefore yields polynomials p m satisfying
max z L ¯ | p m ( z ) r ( z ) | 0 .
It remains to justify convergence after applying the matrix calculus when A is not semisimple. Around every distinct eigenvalue λ choose a positively oriented circle | z λ | = δ λ whose closed disk lies in L and on which r is holomorphic. Cauchy’s derivative formula and (78) give, for every j 0 ,
| p m ( j ) ( λ ) r ( j ) ( λ ) | j ! δ λ j max | z λ | = δ λ | p m ( z ) r ( z ) | 0 .
For each Jordan block J = λ I + N , the polynomial Taylor formula and (76) show
p m ( J ) r ( J ) = j = 0 dim J 1 p m ( j ) ( λ ) r ( j ) ( λ ) j ! N j 0
in operator norm. There are finitely many blocks; conjugating back by one fixed Jordan similarity proves
p m ( A ) r ( A ) 0 .
Meanwhile (78) on K gives
max K | p m | max K | r | max K | p m r | 0 .
Apply (P) to p m and pass to the limit, using (80), to obtain (R) with exactly the same constant C.    □
Apply Proposition 10 with K = W ( A ) , whose compactness, convexity, and spectral inclusion were proved in Lemma 2. The polynomial estimate already proved, with C = 2 , is therefore equivalent to the rational spectral-set statement in Theorem 1. This completes the proof.

9. Sharpness

The constant cannot be reduced. Let
J = 0 1 0 0 , p ( z ) = z .
The numerical range of J is the closed disk centered at the origin with radius 1 / 2 , while p ( J ) = J = 1 . Hence
p ( J ) max z W ( J ) | p ( z ) | = 2 .

10. Formal Verification and Scope

Two Lean 4 developments [16], built on Mathlib [15], separately check the finite-dimensional scalar polynomial endpoint and a reduced-rational endpoint under immutable dependency revisions. The Boundary–Fourier closure ends at the declaration
CrouzeixFormalization.luoCrouzeixEndpoint,
and the Defect–Gram closure ends at
CrouzeixFormalization.DefectGramProof.defectGramCrouzeixEndpoint.
Both inhabit the same explicitly stated proposition type. Both import a pinned revision of the Lean package accompanying Jin [10] for lower-level numerical-range, functional-calculus, contour, and compactness infrastructure, and both separately use the vendored RMT4 development for the Riemann-mapping theorem. Neither proof closure invokes the supporting package’s separately stated constant-2 endpoint.
The Lean kernel reports exactly propext, Classical.choice, and Quot.sound for both route endpoints. The verification scripts reject sorry, admit, custom axioms, unsafe, and native_decide. The Boundary–Fourier release documents its transitive use of the pinned package’s lower-level infrastructure and its separation from that package’s endpoint. The Defect–Gram release additionally performs a recursive dependency-closure audit that rejects packaged constant-2 endpoints, positive-real completion, ordered-Gramian machinery, and the alternative route.
The formal developments and this manuscript reach the same polynomial and rational conclusions, but they are not claimed to be line-by-line translations. In particular, the manuscript uses the finite confluent completion in Lemma 6, while Lean closes the corresponding fixed-domain stage through checked finite-Blaschke limits, Schur recursion and its termination dichotomy, contour convergence, and conformal normalization. The two releases document their source-to-declaration maps and this fidelity boundary. No infinite-dimensional, matrix-valued, or completely bounded endpoint is asserted here.
The Boundary–Fourier manuscript is available as https://doi.org/10.20944/preprints202608.1661.v1. Its source, formalization, verification scripts, dependency lockfile, and source map are archived in the immutable research release https://doi.org/10.5281/zenodo.22052523 and corresponding repository tag
The corresponding Defect–Gram materials are archived under the immutable Zenodo version DOI
and the matching repository release
The two repositories record exact source hashes, releases, dependency revisions, and third-party notices sufficient to reproduce both kernel checks. The present integrated manuscript is the publication-level synthesis of those two disclosed routes. It uses no research dataset; its arXiv source package contains the complete LaTeX source for the main file and both included route files.

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 responsibility for its contents.

Funding

The author received no external funding for this work.

Acknowledgments

The author acknowledges the Lean and Mathlib communities for the theorem prover and mathematical library used in the formal development. The author also acknowledges the substantial research assistance provided by OpenAI Codex using GPT-5.6 Sol. All AI-assisted output was reviewed by the author.

Conflicts of Interest

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

Use of Artificial Intelligence

GPT-5.6 Sol (OpenAI) made substantive contributions to the discovery, development, and verification of both proof routes. Its contributions included developing and auditing the boundary-fibre kernel, Cayley-remainder Fourier cancellation, and scalar recurrence in the first route; formulating the boundary defect-Gram approach, deriving its adjacent recurrence and weighted telescoping certificate, and establishing its strict local estimate in the second; organizing the common finite-Blaschke, Schur, outer-limit, and rational reductions; and producing substantial parts of both Lean 4 formalizations and their verification infrastructure. Qinyu Luo directed the research process, selected and consolidated the proof strategy, reviewed the mathematical arguments and formal statements, supervised the verification and release process, and accepts responsibility for the published work.

References

  1. Badea, C.; Crouzeix, M.; Delyon, B. Convex domains and K-spectral sets. Math. Z. 2006, 252(no. 2), 345–365. [Google Scholar] [CrossRef]
  2. 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]
  3. Crouzeix, M. Bounds for analytical functions of matrices. Integral Equ. Oper. Theory 2004, 48, 461–477. [Google Scholar] [CrossRef]
  4. Crouzeix, M. Numerical range and functional calculus in Hilbert space. J. Funct. Anal. 2007, 244(no. 2), 668–690. [Google Scholar] [CrossRef]
  5. Crouzeix, M. Some constants related to numerical ranges. SIAM J. Matrix Anal. Appl. 2016, 37(no. 1), 420–442. [Google Scholar] [CrossRef]
  6. Crouzeix, M.; Palencia, C. The numerical range is a (1+2)-spectral set. SIAM J. Matrix Anal. Appl. 2017, 38(no. 2), 649–655. [Google Scholar] [CrossRef]
  7. Davidson, K. R.; Paulsen, V. I.; Woerdeman, H. J. Complete spectral sets and numerical range. Proc. Amer. Math. Soc. 2018, 146(no. 3), 1189–1195. [Google Scholar] [CrossRef]
  8. 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]
  9. Hausdorff, F. Der Wertvorrat einer Bilinearform. Math. Z. 1919, 3, 314–316. [Google Scholar] [CrossRef]
  10. Jin, S. The numerical range is a 2-spectral set. Prepr. 2026, 202607.1919, Version 4. [CrossRef]
  11. Lorist, E.; Schwenninger, F. L. A solution to Crouzeix’s conjecture. arXiv. 2026. Available online: https://arxiv.org/abs/2608.03841v2.
  12. Luo, Q. The sharp numerical-range spectral-set inequality. Prepr. 2026, 202608.1661, Version 1. [CrossRef]
  13. Luo, Q. A Defect-Gram Proof of the Crouzeix Theorem, Zenodo, version 1.2.0 (2026). matching GitHub research release. Available online: https://github.com/LOGIC-10/Crouzeix-Defect-Gram-Proof/releases/tag/v1.2.0. [CrossRef]
  14. Malman, B.; Mashreghi, J.; O’Loughlin, R.; Ransford, T. Double-layer potentials, configuration constants, and applications to numerical ranges. Int. Math. Res. Not. IMRN 2025, no. 8, rnaf084. [Google Scholar] [CrossRef]
  15. The Mathlib Community, The Lean mathematical library. In Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP 2020), 2020; ACM; pp. 367–381. [CrossRef]
  16. de Moura, L.; Ullrich, S. The Lean 4 theorem prover and programming language. In Automated Deduction—CADE 28, Lecture Notes in Computer Science 12699; Springer: Cham, 2021; pp. 625–635. [Google Scholar] [CrossRef]
  17. 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]
  18. Pommerenke, C. Boundary Behaviour of Conformal Maps; Grundlehren der mathematischen Wissenschaften 299; Springer: Berlin, 1992. [Google Scholar] [CrossRef]
  19. 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]
  20. Schneider, R. Convex Bodies: The Brunn–Minkowski Theory, Encyclopedia of Mathematics and its Applications 151, 2nd expanded ed.; Cambridge University Press: Cambridge, 2014. [Google Scholar] [CrossRef]
  21. Schur, I. Über Potenzreihen, die im Innern des Einheitskreises beschränkt sind. I. J. Reine Angew. Math. 1917, 147, 205–232. [Google Scholar] [CrossRef]
  22. Schwenninger, F. L.; de Vries, J. The double-layer potential for spectral constants revisited. Integral Equ. Oper. Theory 2025, 97 13, 22 pp. [Google Scholar] [CrossRef]
  23. Toeplitz, O. Das algebraische Analogon zu einem Satze von Fejér. Math. Z. 1918, 2, 187–197. [Google Scholar] [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.