Submitted:
24 July 2026
Posted:
27 July 2026
Read the latest preprint version here
Abstract
For an \( n\times n \) complex matrix \( A \), let \( W(A)=\{x^*Ax : x\in\mathbb{C}^n,\ \lVert x\rVert_2=1\} \) be its numerical range. Here \( x^* \) denotes the conjugate transpose, \( \lVert\,\cdot\,\rVert_2 \) the Euclidean norm, and \( \lVert\,\cdot\,\rVert \) the induced operator norm. For every complex polynomial \( p \), we prove that \( [\lVert p(A)\rVert\leq 2\max_{z\in W(A)}\lvert p(z)\rvert] \) and consequently that \( W(A) \) is a \( 2 \)-spectral set for \( A \). This proves Crouzeix's conjecture, and the constant is optimal. The central new ingredient is a positive-real completion theorem: an adjoint-algebra constraint on the resolvent defect of a normalized matrix-valued Carathéodory function forces the underlying matrix to have norm at most \( 2 \). The classical positive double-layer calculus supplies such completions for matrices with simple spectrum and an algebra-generation property. Sampling the associated Herglotz kernel at half the conjugate eigenvalues and at the origin cancels the completion term and leaves a comparison of two weighted Gramians; a Stein identity yields the sharp estimate. Perturbation and smooth convex outer approximation remove all auxiliary hypotheses.
Keywords:
Crouzeix conjecture
; numerical range
; spectral set
; matrix-valued Herglotz kernel
; double-layer potential
MSC: Primary 47A25; Secondary 47A12, 15A60
1. Introduction
Let denote the complex field and, for , let denote the algebra of complex matrices. For , its numerical range is
Here denotes the conjugate transpose, denotes the spectrum, is the Euclidean norm, is the induced operator norm, and scalar moduli are denoted by . The Toeplitz–Hausdorff theorem shows that is compact and convex, and .
A compact set containing is called a C-spectral set for A if
for every rational function r with no pole on K. Our main result settles Crouzeix’s conjecture by identifying the sharp universal constant for .
Theorem 1
(Main theorem). Let , let , and let . Then
Consequently, is a 2-spectral set for A.
The factor 2 is optimal: for
one has and .
For later use, write
We use I for the identity matrix of the size dictated by context, for the adjoint, put , and let denote the unital algebra generated by T. For Hermitian matrices X and Y, we write (equivalently, ) when is positive semidefinite.
Crouzeix proved the estimate with constant 2 for matrices and formulated the general conjecture in [1]. His subsequent dimension-free theorem gave the constant [2]. After further structural and numerical work [3], Crouzeix and Palencia proved that is a -spectral set [4]. Their double-layer and Cauchy-transform argument was clarified in [5] and developed in several directions in [6,7].
The intervening literature established the conjectured constant for perturbed Jordan blocks and, more generally, scalar translates of cyclic weighted shifts, as well as for tridiagonal matrices with elliptic numerical range centered at an eigenvalue [8,9,10]. Numerical and extremal investigations appear in [11,12], and a broad account of the problem and its variants is given in [13]. Subsequent work has treated Blaschke-product level sets, cyclicity reductions, compressions of shifts, further nilpotent classes, and quantitative bounds for KMS matrices [14,15,16,17]. An alternative proof for a class of weighted shifts appears in [18]. None of the cited reductions supplies a dimension-free argument that lowers the universal bound from to 2.
1.1. Where the Earlier Mechanism Loses Sharpness
The positive boundary measure used below originates in the convex-domain integral calculus of Delyon–Delyon [19]; see also [4,20]. If B has numerical range in a smooth convex domain and f is bounded by one on , this calculus produces a unital positive map and a holomorphic Cauchy companion such that
Thus positivity directly controls a symmetrized functional calculus, not by itself. The Crouzeix–Palencia argument couples the two terms in (5), and its abstract norm estimate is sharp at . The examples in [5] show that this abstract mechanism alone cannot give 2. The corresponding general uniform-algebra theorem is likewise sharp at ; its additional unital case was proposed as a possible route to 2 in [21]. Schwenninger and de Vries revisited the double-layer method [22]. Malman et al. proved that a configuration-constant refinement gives a strict improvement for every fixed numerical-range shape; they also constructed thin quadrilaterals for which the configuration constant approaches its limiting value, so it yields no smaller universal constant [23]. Separately, continuity and compactness give a constant in every fixed matrix dimension n [24].
1.2. The New De-Symmetrization Mechanism
Our argument retains the whole Cayley family, rather than the single identity (5). It has four steps.
- 1.
- Applying toproduces a matrix-valued Carathéodory function H, meaning that and .
- 2.
- At an auxiliary stage, a vanishing perturbation arranges that and . The double-layer identity then gives the positive-real completion
- 3.
- For the approximants with simple spectrum used at that stage, diagonalization turns the unknown term in (6) into a diagonal analytic correction. We sample the Herglotz kernel of H at half the conjugate eigenvalues and add one vector sample at the origin. The latter is chosen to cancel the diagonal correction exactly.
- 4.
- The surviving positive-matrix inequality compares two weighted Gramians. Its difference is positive, and an eigenvector argument followed by a Stein identity yields .
A perturbation of f that vanishes in the limit enforces algebra generation on each approximant with simple spectrum. We first let the perturbation tend to zero, then let the simple-spectrum matrices tend to A, and finally let the outer domains converge to . These three limits remove all auxiliary hypotheses.
2. Positive-Real Kernels
Let be an -valued kernel on . We call positive if, for every finite choice and ,
We shall use the following standard matrix-valued form of the Herglotz theorem. Its kernel consequence is included to fix the normalization.
Lemma 1
(Matrix Herglotz kernel). Let be analytic with for every . Then
is a positive kernel.
Proof.
The matrix Herglotz representation gives a positive -valued measure M on , and a Hermitian matrix , such that
Indeed, for each the scalar Herglotz theorem gives a positive finite measure on and a real number such that
Uniqueness in the scalar theorem shows that, for every Borel set , the map is a nonnegative quadratic form. Indeed, uniqueness applied to the corresponding identities for the scalar functions gives, as identities of measures,
Its polarization defines
Thus M is a finite -valued measure and , so M is positive. The scalar imaginary constants polarize to the Hermitian matrix , and the scalar representations assemble to (9).
For , direct calculation gives
□
3. The Positive-Real Completion Principle
The following completion theorem is the core of the argument: it converts an algebraically constrained positive-real completion of a resolvent into the sharp norm bound.
Theorem 2
(Positive-real completion). Let have n distinct eigenvalues, all in . Let be analytic and satisfy
and
Then .
Proof.
Choose a diagonalization
The eigenvalues are distinct and belong to . Polynomial interpolation shows that
Set
By (14), for each there is a unique diagonal matrix such that
In fact,
so is analytic; moreover, because . Write . On setting , we obtain
Since , the real part of is positive semidefinite. Consequently, Lemma 1 applies to .
Define Hermitian matrices by
Let be the standard basis of , and fix . In the positive-kernel inequality use the n points and vectors
and add the point with vector
We first verify that this sample cancels the entire unknown function . The contribution of the second term in (15) to the kernel quadratic form is
It remains to calculate the contribution of . Between and its entry is
Between the eigenvalue samples and the origin, the two blocks are , and the block at the origin is . After the cancellation of , kernel positivity therefore gives
where in the second line we used , and in the last line we used . Since u was arbitrary,
Balance the diagonalization by defining
Expanding the scalar kernels in (16) into geometric series gives
Indeed, , so the sequence is bounded even when some ; the geometric weights give norm convergence. It follows that
Taking the congruence of (22) by yields
Thus , and the first series in (24) gives , contradicting with . The first series in (24) also begins with I, and hence
Finally, the first Gramian satisfies the Stein identity
Using (28), we obtain
Thus . The polar decomposition gives
where U is unitary. Therefore . □
4. The Double-Layer Completion
We now construct from the numerical range the function required by Theorem 2. The measure and companion transform used here are classical [2,4,19]. The new point is that retaining the full Cayley family yields the algebraic constraint (12).
Lemma 2
(Double-layer positive map). Let , and let be a bounded convex domain with continuously differentiable boundary and . Writing for the continuous complex-valued functions on , there is a unital positive map
such that, whenever h is holomorphic on a neighborhood of ,
where
Proof.
Orient counterclockwise. Let be the outward unit normal, let be arclength, and put
This resolvent exists because . Define the matrix-valued boundary measure
It is positive. In fact, the supporting-line property of the convex set gives
Indeed, for every unit vector , the quadratic form on the left is
because . Multiplication on the left by and on the right by turns the left side of (33) into the matrix in parentheses in (32).
Along the counterclockwise boundary, . The matrix Cauchy formula gives
Taking adjoints gives the same identity for the second layer. Hence
For , define
By (35), is unital and positive, hence *-preserving; moreover, , where
For holomorphic h, the first layer of is by Cauchy’s formula. The function in (31) is holomorphic on , so is defined by the holomorphic functional calculus. To verify the relevant integral formula without assuming that extends across , choose a positively oriented contour enclosing . Cauchy’s formula and Fubini’s theorem give
Proposition 1
(Cayley completion for an auxiliary pair). Let B and Ω be as in Lemma 2, and let f be holomorphic on a neighborhood of and satisfy
Put . If
then there is an analytic satisfying
and
Moreover, .
Proof.
The map is analytic with values in , locally uniformly on . Hence H is analytic, and . Furthermore,
The positivity and *-preservation of give .
The boundary expansion, convergent in locally uniformly for ,
and (30) yield, with norm convergence,
Since the spectral radius of is less than 1, the Neumann series for converges in norm. Subtracting it from (45) gives
Each is holomorphic on a neighborhood of . Finite-dimensional holomorphic functional calculus, equivalently Hermite interpolation followed by Cayley–Hamilton, gives . Hence
where the equality follows by taking adjoints in (39). Every partial sum on the right of (46) therefore belongs to . This algebra is finite-dimensional and hence norm closed, which proves (41). □
Corollary 1
(Auxiliary sharp bound). In Proposition 1, if has distinct eigenvalues, then .
Proof.
Apply Theorem 2 to the function H constructed in Proposition 1. □
5. Passage to Arbitrary Matrices and Proof of the Main Theorem
We now remove the hypotheses of simple spectrum, algebra generation, and boundary regularity by successive approximations.
Lemma 3
(Simple spectrum and numerical range). Matrices with n distinct eigenvalues are dense in . Moreover, for ,
Proof.
The discriminant of the characteristic polynomial is a nonzero polynomial in the matrix entries, as is seen at . Its nonvanishing set is therefore dense in , proving the first assertion. For a unit vector x,
which proves (47). □
Lemma 4
(Outer approximation). If is nonempty, compact, and convex, then there are bounded convex domains with continuously differentiable boundaries such that
where denotes the Hausdorff distance between compact sets.
Proof.
For , let
This is a bounded convex domain and its closure is the Minkowski sum , so its Hausdorff distance from K is . Identify with . The metric projection is unique and continuous. Put . For , comparison first with and then with gives
The continuity of now shows that is continuously differentiable, with real gradient . On the level set this gradient has norm and hence never vanishes. Since , the implicit-function theorem shows that is continuously differentiable. Taking for proves the lemma. □
Proof
(Proof of Theorem 1). Let A and p be arbitrary as in Theorem 1. Choose a bounded convex domain with continuously differentiable boundary such that
We first prove
Because is compactly contained in ,
Lemma 3 and (47) therefore give a sequence of matrices having simple spectrum and satisfying . Since , it is enough to prove (50) for an arbitrary such matrix B.
Write the distinct eigenvalues of B as and set
If , the polynomial vanishes on the open set and is identically zero. In the remaining case , put
For define
Then . For a pair , the equality
excludes at most one value of . There are thus only finitely many exceptional values for which the numbers fail to be distinct. Choose nonexceptional and put
Each has distinct eigenvalues. It also generates the same unital algebra as B. Indeed, , while Lagrange interpolation at the distinct points supplies a polynomial satisfying
Since B is diagonalizable, this implies . Consequently,
Corollary 1, applied to B and , gives
Letting yields , or
Letting the matrices with simple spectrum tend to A proves (50).
Apply Lemma 4 to the compact convex set , obtaining . All these closures eventually lie in one fixed compact neighborhood of K. Uniform continuity of p there and (48) give
It remains to justify the spectral-set conclusion. Let r be rational with no pole on . Since is compact and disjoint from the finite set of poles of r, choose so that the closed -neighborhood of contains no pole. Thus r is holomorphic on an open neighborhood of the compact convex set . Since is connected, polynomial Runge approximation gives polynomials converging uniformly to r on . As , choose a positively oriented contour enclosing . Uniform convergence on , together with the Cauchy integral formula for the holomorphic functional calculus, gives . Also
Apply the polynomial estimate to and pass to the limit to obtain (2) with and . □
6. Consequences and Scope
Theorem 1 immediately gives the corresponding estimate for functions holomorphic on a neighborhood of the numerical range.
Corollary 2.
Let , and let f be holomorphic on a neighborhood of . Then
Proof.
Choose so that the closed -neighborhood of lies in the open set on which f is holomorphic. Polynomial Runge approximation on this compact convex neighborhood, followed by the Cauchy integral formula for the holomorphic functional calculus, gives the assertion. □
The Hilbert-space version follows by the standard finite-dimensional compression argument; compare [13].
Corollary 3
(Hilbert-space form). Let be a complex Hilbert space, with inner product linear in the first variable, and let denote its algebra of bounded operators. For , put
Then, for every ,
Consequently, is a 2-spectral set for A.
Proof.
The assertion is immediate if . Otherwise, write . For a unit vector , let
where is the orthogonal projection onto . Induction gives
because whenever . Moreover, . Theorem 1, applied on the finite-dimensional space , therefore gives
Taking the supremum over unit vectors x proves (59).
Put . The standard inclusion shows that is defined for every rational function r without poles on K. The polynomial-approximation argument in the proof of Theorem 1, now applied to K, gives polynomials such that and
Passing to the limit in (59) proves the rational estimate and hence the spectral-set assertion. □
The conclusion also controls polynomial and rational approximation of matrix functions. Let , let f be holomorphic on a neighborhood of , and let s be either a polynomial or a rational function with no pole on . Then is holomorphic on a neighborhood of , and Corollary 2 gives
7. Discussion and Further Directions
Theorem 1 proves the original, scalar-valued Crouzeix conjecture. The most immediate strengthening is the uniform matrix-polynomial question: for every and every matrix polynomial , does one have
Here is the operator norm on , whereas is the operator norm on . The case is precisely the original conjecture proved above; uniformity in m is an additional operator-algebraic requirement. The foundational matrix-level disk estimate is due to Okubo and Ando [27]. Uniform matrix-level spectral-set bounds and their relation to numerical radius are studied in [28,29]; the constant at every matrix level follows from [4], while sharp estimates for -contractions with are developed in [30]. The extension is known with constant 2 for weighted shift matrices [18]. For block-valued inputs, the coefficients in the completion need not reduce to a single diagonal algebra, so the cancellation in (19) would require a genuinely operator-algebraic formulation.
The positive-real completion principle is independent of numerical ranges: it starts with a Carathéodory function whose resolvent defect lies in an adjoint-generated algebra. A direct infinite-dimensional version of Theorem 2, based for example on spectral measures or Riesz bases, could reveal equality cases or uniform matrix-level functional-calculus structure. The main obstacle is to replace the finite diagonal correction and Lagrange generation (55) by a stable functional-calculus condition without relying on a diagonal spectral model. Related questions for unbounded numerical ranges are studied in [31], and related abstract spectral-constant problems in [32,33].
Double-layer methods beyond numerical ranges were developed in [7], while configuration-constant refinements were introduced in [23]; see also [22] for a comparison of double-layer approaches. Annular double-layer kernels are studied in [34], while [35] develops a complementary annular realization and norm theory; elliptic domains admit structured dilation models [36]. Whenever a companion transform lands in a controlled adjoint algebra, the kernel-sampling argument may replace a triangle-inequality estimate and thereby offer a route to sharp constants for other geometric spectral sets.
With the notation of the proof of Theorem 2, if and satisfies and , then equality throughout the last operator-inequality chain in the proof of Theorem 2 forces
Analyzing these vector saturation conditions may classify extremal pairs and quantify stability near the nilpotent example (4). Such a classification must allow the nonuniqueness phenomena found in [12].
Finally, O’Loughlin and Rani extend the Crouzeix–Palencia framework to scaled q-numerical ranges, , and propose associated spectral-set problems [37]. These provide a natural testing ground for positive-real completion, although no constant-2 analogue is asserted here.
Use of Artificial Intelligence
OpenAI ChatGPT contributed the idea of sampling the matrix Herglotz kernel at half the conjugate eigenvalues and adding the origin sample that cancels the adjoint-algebra correction; this appears in the proof of Theorem 2, especially (17)–(19). It also assisted with exposition, bibliography, and typesetting. The human author assumes full responsibility for the correctness of all mathematical statements and for the integrity and accuracy of all citations.
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]
- Crouzeix, M. Some constants related to numerical ranges. SIAM J. Matrix Anal. Appl. 2016, 37, 420–442. [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]
- Ransford, T.; Schwenninger, F.L. Remarks on the Crouzeix–Palencia proof that the numerical range is a (1+2)-spectral set. SIAM J. Matrix Anal. Appl. 2018, 39, 342–345. [Google Scholar] [CrossRef]
- Caldwell, T.; Greenbaum, A.; Li, K. Some extensions of the Crouzeix–Palencia result. SIAM J. Matrix Anal. Appl. 2018, 39, 769–780. [Google Scholar] [CrossRef]
- Crouzeix, M.; Greenbaum, A. Spectral sets: Numerical range and beyond. SIAM J. Matrix Anal. Appl. 2019, 40, 1087–1101. [Google Scholar] [CrossRef]
- Greenbaum, A.; Choi, D. Crouzeix’s conjecture and perturbed Jordan blocks. Linear Algebra Appl. 2012, 436, 2342–2352. [Google Scholar] [CrossRef]
- Choi, D. A proof of Crouzeix’s conjecture for a class of matrices. Linear Algebra Appl. 2013, 438, 3247–3257. [Google Scholar] [CrossRef]
- Glader, C.; Kurula, M.; Lindström, M. Crouzeix’s conjecture holds for tridiagonal 3×3 matrices with elliptic numerical range centered at an eigenvalue. SIAM J. Matrix Anal. Appl. 2018, 39, 346–364. [Google Scholar] [CrossRef]
- Greenbaum, A.; Overton, M.L. Numerical investigation of Crouzeix’s conjecture. Linear Algebra Appl. 2018, 542, 225–245. [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]
- 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]
- Bickel, K.; Gorkin, P. Blaschke products, level sets, and Crouzeix’s conjecture. J. Anal. Math. 2024, 152, 217–254. [Google Scholar] [CrossRef]
- O’Loughlin, R.; Virtanen, J. Crouzeix’s conjecture for classes of matrices. Linear Algebra Appl. 2024, 697, 277–292. [Google Scholar] [CrossRef]
- Bickel, K.; Corbett, G.; Glenning, A.; Guan, C.; Vollmayr-Lee, M. Crouzeix’s conjecture, compressions of shifts, and classes of nilpotent matrices. Concr. Oper. 2024, 11, Paper(No. 20240004), 26 pp. [Google Scholar] [CrossRef]
- Crouzeix, M.; Greenbaum, A.; Li, K. Numerical bounds on the Crouzeix ratio for a class of matrices. Calcolo 2024, 61, Paper(No. 32), 18 pp. [Google Scholar] [CrossRef]
- Crouzeix, M.; Greenbaum, A. A new proof that the numerical range is a complete 2-spectral set for weighted shift matrices. Preprint. [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]
- Badea, C.; Crouzeix, M.; Delyon, B. Convex domains and K-spectral sets. Math. Z. 2006, 252, 345–365. [Google Scholar] [CrossRef]
- Clouâtre, R.; Ostermann, M.; Ransford, T. An abstract approach to the Crouzeix conjecture. J. Oper. Theory 2023, 90, 209–221. [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]
- Malman, B.; Mashreghi, J.; O’Loughlin, R.; Ransford, T. On the Crouzeix ratio for N×N matrices. Preprint. [CrossRef]
- Choi, D.; Greenbaum, A. Roots of matrices in the study of GMRES convergence and Crouzeix’s conjecture. SIAM J. Matrix Anal. Appl. 2015, 36, 289–301. [Google Scholar] [CrossRef]
- Chen, T.; Greenbaum, A.; Trogdon, T. GMRES, pseudospectra, and Crouzeix’s conjecture for shifted and scaled Ginibre matrices. Math. Comp. 2025, 94, 241–261. [Google Scholar] [CrossRef]
- Okubo, K.; Ando, T. Constants related to operators of class Cρ. Manuscripta Math. 1975, 16, 385–394. [Google Scholar] [CrossRef]
- Davidson, K.R.; Paulsen, V.I.; Woerdeman, H.J. Complete spectral sets and numerical range. Proc. Amer. Math. Soc. 2018, 146, 1189–1195. [Google Scholar] [CrossRef]
- Hartz, M.; McCarthy, J.E. From Clouâtre–Ostermann–Ransford to Okubo–Ando. Preprint. [CrossRef]
- Schwenninger, F.L.; de Vries, J. A sharp bound for the functional calculus of ρ-contractions. Proc. Amer. Math. Soc. 2025, 153, 4759–4768. [Google Scholar] [CrossRef]
- Crouzeix, M. Numerical ranges and spectral sets: the unbounded case. Preprint. [CrossRef]
- Schwenninger, F.L.; de Vries, J. On abstract spectral constants. In Operator and Matrix Theory, Function Spaces, and Applications; Ptak, M., Woerdeman, H.J., Wojtylak, M., Eds.; Birkhäuser/Springer: Cham, Operator Theory: Advances and Applications; 2024; Vol. 295, pp. 335–350. [Google Scholar] [CrossRef]
- Blazhko, H.; Homza, D.; Schwenninger, F.L.; de Vries, J.; Wojtylak, M. The algebraic numerical range as a spectral set in Banach algebras. Canad. J. Math. 2025, 1–25. [Google Scholar] [CrossRef]
- Jury, M.T.; Tsikalas, G. Positivity conditions on the annulus via the double-layer potential kernel. Stud. Math. 2024, 278, 233–265. [Google Scholar] [CrossRef]
- Agler, J.; Lykova, Z.A.; Young, N.J. Function theory on the annulus in the dp-norm. Integral Equ. Oper. Theory 2025, 97(Article 30), 32 pp. [Google Scholar] [CrossRef] [PubMed]
- Agler, J.; Lykova, Z.A.; Young, N.J. On the operators with numerical range in an ellipse. J. Funct. Anal. 2024, 287(Article 110556), 62 pp. [Google Scholar] [CrossRef]
- O’Loughlin, R.; Rani, J. q-numerical ranges and spectral sets. Preprint. [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 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.