Submitted:
01 September 2026
Posted:
01 September 2026
You are already at the latest version
Abstract
For a complex matrix \(A\), let \(\psi(A)\) be the norm of the polynomial functional calculus on its numerical range. We prove that \(\psi(A)=2\) only when the numerical range is a nondegenerate closed disk. The proof first extracts the equality conditions in the sharp double-layer estimate. After boundary eigenvalues are removed, an extremizer obtained from a finite Blaschke product satisfies an exact boundary-kernel identity. On a curved exposed arc this identity makes the extremizer rational. A direct resolvent argument then places every zero of its reduced numerator inside the numerical range and every pole outside; consequently its full unit lemniscate coincides with the boundary of the numerical range. The defining polynomial of the projective dual of that algebraic boundary divides the Hermitian Kippenhahn determinant. Hyperbolicity and strict convexity force the dual curve to have degree two, and its points at infinity force the resulting conic to be a circle.
Keywords:
numerical range
; Crouzeix constant
; spectral set
; rational lemniscate
; hyperbolic polynomial
MSC: 47A12; 47A25; 15A60
1. Introduction
Throughout, and denote the complex and real fields, the algebra of complex matrices, and I the identity matrix of the size dictated by context. For a matrix B, the symbols , , and denote its conjugate transpose, spectrum, and spectral radius. The notation denotes the Hilbert-space norm on vectors and the induced operator norm on bounded linear maps; on these are the Euclidean and induced Euclidean norms. We put
For scalars and functions, Re and Im have their usual pointwise meanings. For Hermitian matrices , the relation means that is positive semidefinite. We write for the interior of a planar set E and for the open unit disk. Scalar matrix coefficients are written as , where inner products are linear in the first argument. For a bounded scalar-valued function g on a set E, write .
For , set
For a polynomial p, put
For a compact convex body K, let denote the complex-valued continuous functions on K, and write
The space consists of the bounded holomorphic functions on and carries the norm . Whenever , the notation denotes the standard finite-dimensional holomorphic functional calculus, equivalently evaluation of any Hermite interpolating polynomial with the required spectral jets. The constant was introduced by Crouzeix [1], who proved for matrices and conjectured the same bound in every dimension. He subsequently obtained the first dimension-free bound [2]. The disk case is the classical Okubo–Ando theorem [3], while the positive operator-valued double-layer representation behind the general convex-domain estimates goes back to Delyon and Delyon [4]. Crouzeix and Palencia reduced the universal constant to [5].
Jin [6] and, independently, Lorist and Schwenninger [7] proved the scalar conjecture. The latter proof applies an abstract 2-dilation perturbation lemma simultaneously to all iterates in the double-layer representation. Subsequently, Åhag, Czyż, Perälä, and Virtanen established sharp square-function inequalities, the complete conjecture in dimension three, and equality, stability, and representing-measure results [8]. Their equality theory also produces a two-dimensional reducing nilpotent block and strong dimension-three restrictions.
This paper develops the equality data into an all-dimensional geometric rigidity theorem. Its central steps are rational collapse of the extremizer, identification of the full lemniscate with the numerical-range boundary, and a hyperbolic projective-dual contact count.
Theorem 1.
For every and ,
for some and some .
The proof has four steps. An equality analysis of the sharp bound produces two extremal vectors and a pointwise boundary-kernel identity. A curved exposed arc then turns that identity into a rational formula for the extremizer. A direct resolvent argument identifies its full unit lemniscate with . Finally, the Kippenhahn determinant contains the dual curve as a hyperbolic factor. A generic contact count makes the dual a conic, and the circular points at infinity then force to be a circle. A separate ingredient, strict domain monotonicity of the matrix functional-calculus norm, rules out a proper disk produced by the boundary-spectrum induction. Extensive numerical optimization by Greenbaum and Overton [10] repeatedly found stationary configurations with ratio 2 whose numerical ranges were disks; the theorem explains that pattern at exact equality.
2. Numerical-Range Preliminaries
Here and below, denotes the convex hull of E. For a Hermitian matrix B, denotes its largest eigenvalue. At a differentiability point of a convex boundary, denotes its outward unit normal; , with or without a subscript, denotes an arbitrary supporting unit normal.
Lemma 1
(Numerical-range geometry). The following facts hold.
- 1.
- is nonempty, compact, and convex.
- 2.
- If has empty interior, then A is normal and .
- 3.
-
For , , and unitary ,Also and .
- 4.
- For a finite nonempty direct sum,
- 5.
- The support function of is
Proof.
The unit sphere is compact and is continuous, proving nonemptiness and compactness. To prove convexity, take two points of and compress A to the span of corresponding unit vectors. If the points are distinct, those vectors are linearly independent; if they coincide, there is no segment to prove. It is therefore enough to know that the numerical range of a matrix is convex. After unitary triangularization such a matrix has the form . For , where and ,
These points fill the possibly degenerate ellipse with foci , hence a convex set. The two-dimensional compression is contained in , so the segment joining the original two points is contained in .
If has empty interior, its convexity places it in an affine line. If , then for all x. The complex polarization identity makes every matrix coefficient of zero. If lies in a line, a translation and a nonzero complex rotation make all quadratic forms of A real. The skew-Hermitian part then has zero quadratic form and vanishes by polarization, so the transformed matrix is Hermitian. A normal matrix satisfies
The constant polynomial gives the reverse inequality.
The affine and unitary formulas follow by changing variables in polynomials. For adjoints use , for which . For a direct sum, a unit vector decomposes into block components and its numerical value is a convex combination of block numerical values. Also ; the supremum norm on the convex hull dominates that on every block. Finally,
which is the largest eigenvalue of the displayed Hermitian matrix. □
3. An Equality-Preserving Sharp-Bound Argument
We use the equality-preserving form of the Lorist–Schwenninger iterate argument [7], which records the pointwise identities needed for rigidity.
Lemma 2
(An abstract dilation estimate). Let T act on a nonzero finite-dimensional Hilbert space. Suppose that is a contraction on another Hilbert space, is an isometry, and
are uniformly bounded and commute with T. Then .
If additionally , , , , and , then
Proof.
Put . If , the conclusion is immediate; assume . Choose a unit vector x with , and set
The defining identity gives , so the powers of T, and hence , are bounded. Put and . Commutativity of with T gives
Moreover, and Multiplying the displayed commutator identity on the left by , using , and taking real parts now gives
Telescoping, with the boundedness of , yields
On the other hand, using that is isometric and contractive,
Combining (3.1) and (3.2) gives
which is impossible for .
Now let . Equations (3.1)–(3.2) become and , so equality holds in both. For each n, the slack in the estimate preceding (3.1) is
Their positively weighted sum is zero. Thus, for every n,
Since , , and these two equalities force . Their first instance then gives . With , . Both and are unit vectors, so equality in Cauchy–Schwarz for gives . Finally . □
Proposition 1
(The sharp numerical-range estimate). For every , every , and every polynomial p,
More generally, if K is a compact convex body, , , and , then
For , the corresponding estimate is
Proof.
Normalize . Cauchy’s boundary formula below also holds when f is only in : for , the functions , , are holomorphic on a neighborhood of K and converge uniformly to f; apply the usual formula to them and pass to the limit. The positive operator-valued double-layer kernel used below originates in Delyon and Delyon [4] and appears in the Cauchy-transform form of Crouzeix and Palencia [5]; see also the recent double-layer and configuration-constant treatments in [11,12]. Parametrize the rectifiable convex Jordan curve counterclockwise by arclength. Its outward unit normal exists almost everywhere and has a measurable representative. All boundary identities below are understood arclength-almost everywhere. Put and
At a point with a normal, the supporting-half-plane property gives
Multiplication by the two resolvents shows
Since and ,
Cauchy’s formula gives ; taking adjoints gives . Therefore
The matrix field is measurable and positive semidefinite almost everywhere. Since the positive-square-root map is continuous on the cone of positive semidefinite matrices, is measurable (with arbitrary values on the exceptional null set). Consequently
defines an isometry into . Let be multiplication by f, and set . For every , Cauchy’s formula and the preceding decomposition give
because
Thus
The right side commutes with T, because every resolvent does. Also
Lemma 2 proves (3.4).
For , normalize , choose a Riemann map , and put . For , define
The Carathéodory extension of shows that , and . Moreover, locally uniformly with all derivatives. The finitely many spectral jets therefore converge, so ; applying (3.4) and passing to the limit proves the estimate.
For an arbitrary matrix A, apply (3.4) to the outer parallel convex body
which contains in its interior. For every polynomial p, uniform continuity on a fixed compact neighborhood gives . Letting proves (3.3), including the boundary-spectrum and nonsmooth cases. □
Proposition 2
(Equality data). Let have nonempty interior, let , and let be nonconstant with
Then there are orthonormal vectors such that, with ,
and, for almost every ,
Proof.
Apply the construction in Proposition 1. The spectral mapping theorem gives , because the finitely many eigenvalues of A are inside and a nonconstant inner function has modulus strictly less than 1 there. Choose x with , and put . Lemma 2 gives , , and . Here , and , so are orthonormal. The multiplication identity is exactly (3.9). □
Lemma 3
(Boundary eigenvalues reduce). If , , and , then . Consequently, with ≃ denoting unitary similarity,
where is diagonal, with the boundary eigenvalues as its diagonal entries, while .
Proof.
Choose a supporting direction , , at . Equality in the Rayleigh quotient gives
Substituting gives . Thus reduces A. Split it off and repeat. Every eigenvalue belongs to , since an eigenvector realizes it, so the remaining spectrum is in the interior. □
Lemma 4
(Conformal and finite-interpolation facts). Let Ω be a bounded convex domain.
- 1.
- There is a conformal bijection , and it extends to a homeomorphism .
- 2.
- At each of finitely many distinct points of Ω, prescribe a contiguous jet, consisting of the value and all derivatives through a fixed finite order. If these data are realized by a function of of norm at most 1, they are also realized by , where is a finite Blaschke product. If the infimum of the supremum norms over all interpolants of the prescribed data is 1, then the Schur-class interpolant is unique and is of this form.
Proof.
A bounded convex domain is a Jordan domain. The Riemann mapping theorem and the Carathéodory boundary theorem therefore give the first assertion.
Transfer the jet data to by . The confluent change-of-variables matrix between the original and transferred jets is triangular with nonzero diagonal, because . Write the distinct disk nodes as , prescribe derivatives through order , and let q be the Hermite polynomial with those jets. For a norm bound , the generalized Pick matrix used here is indexed by , , and has entries
This matrix depends only on the prescribed jets, not on the chosen Hermite representative. The finite confluent Nevanlinna–Pick theorem says that the data have an interpolant of norm at most exactly when ; see Sarason [13] and Bultheel–Lasarow [14]. At the norm bound , a positive definite matrix admits a Schur parametrization; choosing a unimodular terminal parameter gives a rational inner solution. In the scalar disk case, rational inner functions are finite Blaschke products. For general , the corresponding conclusion is times a rational inner function, obtained by rescaling the data. At the minimal norm, singularity yields the following uniqueness conclusion.
Contiguous jets at distinct nodes impose independent conditions: Hermite interpolation supplies polynomials whose normalized derivative functionals satisfy . Thus there are no hidden linear dependencies in (3.10). Now let send a holomorphic function on to the prescribed jet vector , and put
If , then is singular: if it were positive definite, continuity of (3.10) in would give for some , contradicting minimality. Let
Two bounded holomorphic functions have the same prescribed jets exactly when their difference belongs to . Thus the interpolation data form one coset of , represented on the finite-dimensional model space by an operator X commuting with the compressed shift. Sarason’s lifting theorem identifies the least interpolant norm with , so . The norm of X is attained because is finite dimensional. Sarason’s maximal-vector uniqueness theorem [13] now gives a unique norm-one interpolant and says that it is inner. Its quotient formula uses two elements of the finite-dimensional rational space , so the interpolant is rational and hence a finite Blaschke product. This also proves the uniqueness asserted in the lemma. The role of such finite-Blaschke extremizers in the matrix functional-calculus problem is developed by Crouzeix [1] and Li [9]. □
For a bounded domain and a matrix with , define
The value depends only on finitely many derivatives, those prescribed by the Jordan blocks. Montel’s theorem therefore makes the supremum a maximum. When is convex, Lemma 4 replaces an extremizer by a finite Blaschke product composed with a Riemann map, without changing .
Lemma 5
(Strict domain monotonicity). Let be bounded convex domains and suppose . If , then
Proof.
Monotonicity in the displayed direction is immediate by restriction. Suppose equality held, with common value , and choose a norm-one extremizer g on . Its norm on must be exactly 1, since otherwise rescaling its restriction gives a value larger than . Thus it is also an extremizer on .
For either domain, interpolate the finite jet of g that determines with least possible norm. A norm smaller than 1 would contradict extremality after rescaling. The uniqueness part of Lemma 4 identifies g on each domain with a finite Blaschke product composed with its Riemann map. In particular, the restriction of g to has a continuous extension to with modulus one on .
Choose . Along every ray from , convexity gives an exit radius for each domain. Since the domains differ, on some ray the first exit occurs strictly earlier; hence there is . At this interior point of , continuity of the original holomorphic function and of the boundary extension gives . The maximum-modulus principle makes g constant, which would give , a contradiction. □
4. Reduction to an Interior-Spectrum Equality Pair
Lemma 6
(Boundary-spectrum induction). Assume Theorem 1 has been proved in every size smaller than N. Let , let , and suppose . Then either K is a nondegenerate closed disk, or
Proof.
By Lemma 1, K has nonempty interior. Choose polynomials such that
Suppose A has a boundary eigenvalue. Lemma 3 gives , where is diagonal with spectrum on and . The -block of has norm at most 1, so
In particular is nonempty. Since , (4.3) and Proposition 1 give . Its size is smaller than N, so induction says that
is a closed disk of positive radius.
Apply Lemma 3 once more, now to relative to :
where is a finite diagonal block on and . The same sequence (4.2) is bounded by 1 at the eigenvalues of , all of which lie in K, so . Thus is nonempty.
Write . Since
every extreme point of belongs to the compact set . Indeed, a finite convex representation of an extreme point can contain no two distinct points with positive coefficients. The circle has infinitely many extreme points and is finite. Hence ; closedness and convexity of give
Let and . The polynomial sequence and Proposition 1 show
Indeed,
so the lower bounds follow from (4.2)–(4.4), while the upper bounds follow from the estimate in Proposition 1. If , then , and Lemma 5 contradicts (4.5). Therefore , and K is the asserted disk. If this conclusion does not occur, A has no boundary eigenvalue, which is (4.1). □
Lemma 7
(The holomorphic extremizer). Suppose has nonempty interior and . If , there is a nonconstant
where is conformal and is a finite Blaschke product, such that
Proof.
Normalized polynomials witnessing show , and Proposition 1 gives the reverse inequality. Montel compactness, followed by convergence of the finitely many spectral jets, gives an maximizer of norm at most one. Its norm is exactly one, since otherwise rescaling it would produce a matrix value of norm greater than two. Apply the finite Schur algorithm in Lemma 4 to the jet that determines its matrix value. It supplies with the same matrix value. The boundary extension of puts this function in and gives boundary modulus 1. It cannot be constant because a constant matrix has norm at most 1. □
5. From Equality to a Rational Inner Function
Lemma 8
(A curved numerical-range arc). If has interior, , and K is not a polygon, then contains an open real-analytic arc on which every supporting line exposes one point and the curvature is positive. Moreover, under , K cannot be a polygon.
Proof.
Put
By Rellich’s analytic perturbation theorem [15], for every the eigenvalues of the real-analytic Hermitian matrix family can be numbered, with multiplicity, by real-analytic functions of on a neighborhood of . Take a finite cover of the parameter circle by such intervals. On each interval, place two branches in the same class when they agree on a nonempty open subinterval; the analytic identity theorem then makes them identical on the whole interval. Choose one representative of each class and shrink slightly to a compact subinterval. The difference of any two distinct representatives is a nonzero real-analytic function and therefore has only finitely many zeros there. Subdividing at the union of these finitely many crossing points fixes the ordering of all branches; on every resulting open interval their maximum is one analytic branch. A finite cover and a common refinement give the asserted finite subdivision of the parameter circle. This is the finite-dimensional support-function form of the analytic Kippenhahn-curve description; compare [17].
At a differentiability point, the exposed boundary point is
The first identity follows by differentiating the top Rayleigh quotient; the second follows by differentiation. Convexity gives . If this function vanished identically on every analytic interval, would be constant on each interval and K would be a polygon. Otherwise analyticity supplies a subinterval on which . Formula (5.1) then gives the required regular, positively curved arc. Differentiability of the support function makes the exposed face a singleton there.
It remains to exclude a polygon when the spectrum is interior. Let be a vertex and let a unit vector realize . Two linearly independent supporting normals at the vertex give
The two independent real-linear equations imply and . Thus is a boundary eigenvalue, contradicting . □
Lemma 9
(Boundary-arc uniqueness). Let be a connected domain and let be a nonempty open regular real-analytic arc such that, near each point of , D is exactly one of the two local components cut out by the arc. If g is holomorphic on D, continuous on , and its boundary values vanish arclength-almost everywhere on , then on D.
Proof.
Every open subarc has positive arclength, so continuity first makes g zero at every point of . Near one such point, complexify a regular real-analytic parametrization of the arc. Its derivative is nonzero, so the holomorphic inverse-function theorem gives a biholomorphic coordinate that sends the arc to a real interval and the local part of D to one half-disk. In that coordinate, extend g by zero to the opposite half-disk. The extension is continuous; subdividing any triangle along the diameter and applying Cauchy’s theorem on the pieces proves Morera’s criterion. The extension is holomorphic and zero on an open half-disk, hence zero throughout the disk by the identity theorem. Thus g vanishes on a nonempty open subset of D, and connectedness gives the conclusion. □
Proposition 3
(Rational collapse). Under the hypotheses and notation of Lemma 7, let be the equality vectors from Proposition 2. Then the function f is rational on Ω. More precisely, for , set
and regard thereafter as their meromorphic adjugate continuations. Then
as an identity of meromorphic functions on Ω. Equivalently, wherever the quotient is defined, and then everywhere after removable cancellation. After cancellation, for coprime polynomials with
If adj denotes the classical adjugate and
then the reduction can be chosen so that
Proof.
Choose the arc from Lemma 8; it avoids the finite spectrum. For almost every point of that arc, let be its outward normal, , and
Equations (3.5) and (3.9) imply
Indeed, squaring the norm in (3.9) and using first gives , and hence (5.4). The vector is nonzero: R is invertible, while the orthonormality of makes . It is therefore an eigenvector of for its maximal eigenvalue. The exposed point is unique, so . Since , taking the inner product with and conjugating gives
For , put . This resolvent commutes with , and relations (3.8) give
Expanding (5.5), using and (5.6), yields
almost everywhere on the arc. The punctured domain is connected, and is holomorphic on D and continuous up to the chosen arc. Convexity supplies the local one-sidedness required by Lemma 9; that lemma gives on D, hence as a meromorphic identity on . Since at infinity, a is not the zero rational function; the identity therefore also shows that c is not identically zero. This proves (5.2).
The adjugate formulas are
The polynomial has degree exactly , with leading coefficient 1. Since , the degree of is at most . Let G be a greatest common divisor of and , and choose
Then are coprime, , and . Canceling G preserves the strict degree difference, proving (5.3). □
6. The Full Lemniscate Is the Boundary
Lemma 10
(Zeros of the transfer function). Let be the reduced rational function from Proposition 3. Then every finite zero of U lies in Ω, every zero of V lies outside K, and .
Proof.
For , put . Then . Indeed, if and , then and . Since , conjugation gives , and hence
which would put z in , a contradiction.
By the construction in Proposition 3, , so every zero of U is a zero of . Since off K and does not vanish there, U has no zero off K. Nor can V vanish at a boundary point: by coprimality, would then be unbounded along approaches from , where it equals the original function . Thus extends continuously to , agrees there with f, and has modulus one. In particular, U has no boundary zero, so all its zeros lie in . A reduced pole cannot lie in , where f is holomorphic. Hence all poles lie outside K. Finally (5.3) says exactly that . □
Proposition 4
(Full-level identity). For the reduced rational extremizer ,
Moreover does not vanish on , and is a smooth real-analytic strictly convex Jordan curve.
Proof.
Put
No pole belongs to , because in a punctured neighborhood of each pole. If , continuity and approximation from give ; strict inequality would put a neighborhood of z in . Therefore
Now , while is disjoint from . Hence the connected set is both open and closed relative to , and is one of its components.
Every component is bounded because , and it contains a zero of f. Otherwise its compact closure would avoid all zeros of f: any zero in the closure lies in and hence in . Thus would be holomorphic near , have modulus one on the boundary by (6.2), and have modulus greater than one inside, contrary to the maximum-modulus principle. Lemma 10 puts every zero in , so has no other component. This proves the first identity in (6.1).
Conversely, if and , the open mapping theorem says that every neighborhood of contains points where . Thus , and (6.2) proves the second identity in (6.1).
Suppose that at a level point. Then, in a neighborhood of ,
Choose so that , and let . For all sufficiently small , the points , , are not poles and satisfy
The first identity in (6.1) puts every in . But
because . Convexity of would then put the boundary point in , a contradiction. Hence on the level, and the implicit-function theorem makes the boundary real analytic and smooth.
Finally suppose that the boundary contained a nontrivial segment of a real line , , . The expression
is a polynomial in the real variable t. Its vanishing on an interval would make it vanish for every real t. If for some real t, the same identity would force , contrary to coprimality. The full-level identity would therefore put the entire unbounded line in , contradicting compactness. Thus the boundary has no nontrivial segment, which for a compact convex body is exactly strict convexity. □
7. The Algebraic Tangent Argument
The Hermitian determinant below is the line-coordinate polynomial introduced by Kippenhahn [16]; modern projective-dual accounts appear in [17]. Throughout this section, primal projective coordinates are ordered as , dual coordinates as , and incidence is
Thus the affine point is .
Proposition 5
(Generic hyperbolic contact count). Let be an irreducible projective curve defined over , and suppose its entire real locus is a smooth strictly convex oval in the affine chart . Let be a real irreducible homogeneous equation of the dual curve . If
then .
Proof.
Write . The normalization, conormal, and biduality theory of projective plane curves in characteristic zero gives the following generic contact description; see Tevelev [20].
- 1.
- Outside a finite subset , a smooth dual point has one smooth contact point on , and the tangent line to at that dual point recovers the contact point. This is the generic one-to-one Gauss correspondence supplied by biduality; B absorbs the singular, branch, and ramification loci.
- 2.
- Since , projection from that point,is everywhere defined and has generic degree m: a generic fiber is the intersection with a line through , and Bézout gives m points.
- 3.
- In characteristic zero this projection is separable. Equivalently, the discriminant of , viewed as a binary homogeneous polynomial in , is not identically zero. The branch values of and the projection of B therefore form a finite exceptional subset of .
- 4.
- Choose a real outside that set. Because the coefficient of is , specialization does not lower the degree. Hence there are m distinct roots , all real by hypothesis, and are smooth real points of .
- 5.
-
Biduality and the chosen coordinate order identify the unique contact point withThe polynomial and are real, so this point is real and therefore lies on the given oval.
- 6.
- A fixed unoriented normal has exactly two tangent lines to a smooth strictly convex oval: the unique support lines at the maximum and minimum of . Thus the m lines just found give . Conversely, both support lines are points of , so they are two distinct roots and . Hence .
□
Proposition 6
(Circle criterion). Let K be a compact convex body whose boundary is the full level set
where are coprime polynomials, , K is strictly convex, and does not vanish on . Writing , suppose there are Hermitian matrices such that, in the real dual coordinates associated with the line , every tangent line to an open boundary arc belongs to the projective curve
Then is a circle.
Proof.
Put . Write , , and for a polynomial S. For a homogenization , the notation means coefficientwise conjugation, with left unchanged. Put and , in the coordinate order fixed above. Let , , and homogenize the real lemniscate polynomial to degree :
Here are the usual homogenizations to their own degrees. At , use the Wirtinger derivative . Then
Here on the level and there by hypothesis, so the boundary lies in the regular locus of .
Selection of the real component. Factor over . At a regular zero exactly one irreducible factor occurrence vanishes: two vanishing factors, or a repeated vanishing factor, would make every first derivative of zero. The choice of that factor is locally constant along the boundary, because all other factors remain nonzero nearby. The boundary is connected, so one factor vanishes on all of it; let . Since has real coefficients, the coefficientwise conjugate is also a factor and vanishes at each real boundary point. Local uniqueness makes an associate of ; rescaling therefore gives real coefficients. Thus is an irreducible real projective curve, and it is smooth along the boundary.
The entire real locus. Every real affine point of is a real zero of (7.3). If there, (7.3) also forces , contradicting coprimality. Hence , and (7.1) puts the point on . The reverse inclusion holds by construction of , so
There are no additional real points at infinity. Indeed, if denotes the nonzero leading coefficient of U,
and for every nonzero real projective pair . Therefore
exactly one smooth strictly convex affine oval.
Let be the projective dual curve, the Zariski closure of the tangent lines at smooth points of , and let be its irreducible homogeneous equation, chosen with real coefficients. Tangency on an open real arc and (7.2) imply
Indeed, the Gauss image of that arc is nonconstant: a constant tangent line would contain a nontrivial boundary arc, contrary to strict convexity. Its image is therefore infinite and hence Zariski dense in the irreducible curve . The determinant vanishes on that dense set and thus on all of . The homogeneous prime ideal of a plane curve is the principal ideal , proving (7.5). Since is real, its dual is invariant under conjugation; as in the primal factor argument, can be rescaled to have real coefficients.
Set . The determinant in (7.5) equals 1 at , so . If , homogeneity gives
Thus specialization never lowers the degree in s. Specializing the polynomial divisibility (7.5) shows that every zero of is a zero of the Hermitian determinant. For real , the latter zeros are the negatives of the eigenvalues of , and are therefore real. Hence is hyperbolic with respect to in the elementary real-rootedness sense [18,19].
The exact real-locus identity above and Proposition 5 now give
Thus is an irreducible conic and is nonsingular. Writing its equation as , with an invertible symmetric matrix , its tangent at ℓ corresponds to the primal point . The envelope of those tangents is , also a conic. Since it contains the generic bidual contact points, a Zariski-dense subset of , it is .
Finally, because the defining polynomial of divides , every point of this conic at infinity must be one of
The line is not a component of : the curve is irreducible and contains its affine oval. Bézout’s theorem therefore gives total intersection multiplicity two with the line at infinity. Complex conjugation exchanges the two displayed, distinct circular points and preserves multiplicity, so each occurs once. The real homogeneous equation of the conic consequently has the form
Completing squares shows that its nonempty compact real oval is a circle. □
8. Proof of the Main Theorem
Proof
(Proof of Theorem 1). We use induction on N. For , and more generally whenever the numerical range has empty interior, Lemma 1 gives , so the hypothesis never occurs.
Assume the theorem holds for all sizes smaller than N, and let satisfy . Put . It has nonempty interior. By Lemma 6, either K is already a nondegenerate disk or . Consider the second case.
Choose as in Lemma 7, and let be the equality vectors from Proposition 2. Since an interior-spectrum numerical range cannot be a polygon, Lemma 8 provides a curved analytic boundary arc. On that arc, Proposition 3 yields
after cancellation of the meromorphic transfer identity (5.2).
Lemma 10 puts every zero of U in , every pole outside K, and gives . Proposition 4 then gives
and shows that this boundary is a smooth strictly convex rational lemniscate.
Put and . Writing , every supporting line , with , can be oriented so that . A unit vector attaining the point of support has zero quadratic form for this positive semidefinite matrix and therefore lies in its kernel. Hence
All hypotheses of Proposition 6 now hold. It follows that is a circle. Compactness and convexity make K the filled closed disk bounded by that circle.
The disk has positive radius because K has nonempty planar interior. Writing its center and radius as and gives
which completes the induction and the proof. □
Funding
This research received no external funding.
Data Availability Statement
The conversation and reasoning record, manuscript source, and Lean formalization are available at https://github.com/jinshanmu/DiskRigidity.
Acknowledgments
The author used Codex with GPT-5.6 Sol Ultra for proof development, Lean formalization, and language editing, reviewed all output, and takes full responsibility for the publication.
Conflicts of Interest
The author declares no conflicts of interest.
References
- Crouzeix, M. Bounds for analytical functions of matrices. Integral Equ. Oper. Theory 2004, 48, 461–477. [Google Scholar] [CrossRef]
- Crouzeix, M. Numerical range and functional calculus in Hilbert space. J. Funct. Anal. 2007, 244, 668–690. [Google Scholar] [CrossRef]
- Okubo, K.; Ando, T. Constants related to operators of class Cρ. Manuscripta Math. 1975, 16, 385–394. [Google Scholar] [CrossRef]
- 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]
- 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]
- Jin, S. The numerical range is a 2-spectral set. Preprints 2026, 202607.1919.v4. [Google Scholar] [CrossRef]
- Lorist, E.; Schwenninger, F.L. A solution to Crouzeix’s conjecture. arXiv 2026, arXiv:2608.03841v2, 7 pp. [Google Scholar] [CrossRef]
- Åhag, P.; Czyż, R.; Perälä, A.; Virtanen, J. Square functions and the complete Crouzeix conjecture in dimension three. arXiv 2026, arXiv:2608.27346v1. [Google Scholar] [CrossRef]
- Li, K. On the uniqueness of functions that maximize the Crouzeix ratio. Linear Algebra Appl. 2020, 599, 105–120. [Google Scholar] [CrossRef]
- Greenbaum, A.; Overton, M.L. Numerical investigation of Crouzeix’s conjecture. Linear Algebra Appl. 2018, 542, 225–245. [Google Scholar] [CrossRef]
- 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]
- 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, 2025, Paper(No. rnaf084), 34 pp. [Google Scholar] [CrossRef]
- Sarason, D. Generalized interpolation in H∞. Trans. Am. Math. Soc. 1967, 127, 179–203. [Google Scholar] [CrossRef]
- Bultheel, A.; Lasarow, A. Solution of a multiple Nevanlinna–Pick problem for Schur functions via orthogonal rational functions. Analysis 2008, 28, 95–123. [Google Scholar] [CrossRef]
- Rellich, F. Störungstheorie der Spektralzerlegung. I. Mitteilung. Analytische Störung der isolierten Punkteigenwerte eines beschränkten Operators. Math. Ann. 1937, 113, 600–619. [Google Scholar] [CrossRef]
- Kippenhahn, R. On the numerical range of a matrix. In Linear Multilinear Algebra; Zachlin, P.F.; Hochstenbach, M.E., Translators; 2008; Volume 56, pp. 185–225. [Google Scholar] [CrossRef]
- Plaumann, D.; Sinn, R.; Weis, S. Kippenhahn’s theorem for joint numerical ranges and quantum states. SIAM J. Appl. Algebra Geom. 2021, 5, 86–113. [Google Scholar] [CrossRef]
- Gårding, L. An inequality for hyperbolic polynomials. J. Math. Mech. 1959, 8, 957–965. [Google Scholar] [CrossRef]
- Helton, J.W.; Vinnikov, V. Linear matrix inequality representation of sets. Commun. Pure Appl. Math. 2007, 60, 654–674. [Google Scholar] [CrossRef]
- Tevelev, E.A. Projectively dual varieties. J. Math. Sci. 2003, 117, 4585–4732. [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. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
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.