This paper determines the maximum number of eigenvalues of doubly cyclic matrices in the left half-plane and characterizes all possible counts based on fixed geometric means, confirming a conjecture in the field.
Contribution
It proves a conjecture about the eigenvalue distribution of doubly cyclic matrices and characterizes all possible numbers of eigenvalues in the left half-plane.
Findings
01
Maximum eigenvalues in left half-plane achieved by specific diagonal matrices.
02
All odd numbers up to the maximum are attainable when < .
03
Complete characterization of eigenvalue counts in relation to and \u0019.
Abstract
Fix positive numbers α and β. For the family of doubly cyclic matrices of the form diag(a1,a2,...,an)−diag(b1,b2,...,bn)Σ∗, where Σ∗ is a permutation matrix for the n-cycle 1→2, 2→3, ... ,n−1→n, n→1 [cycle notation (1, 2, ... , n-1, n)], and with fixed geometric mean α for the ak's and β for the bk's, the maximum number of eigenvalues in the left half-plane is attained by diag(α,α,...,α)−diag(β,β,...,β)Σ∗. This confirms a conjecture of C. Johnson, Z. Price, and I. Spitkovsky.' Moreover, the complete range of possibilities for the number of eigenvalues in the left half-plane is demonstrated: if α<β, then any odd number between 1 and the maximum, inclusive, is attainable, and these are the only possibiliites.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
Localization of eigenvalues of Doubly Cyclic Matrices
For a family of doubly cyclic matrices of the form \eqrefeq:dczplusex, a maximum for the number of eigenvalues in the left half-plane is attained by X∗∈\eqrefeq:idealmatrix, with α,β∈\eqrefeq:detdczp. This confirms a conjecture of C. Johnson, Z. Price, and I. Spitkovsky.
Moreover, the complete range of possibilities for the number of eigenvalues in the left half-plane is demonstrated: if α<β, then any odd number between 1 and the maximum, inclusive, is attainable.
2010 Mathematics Subject Classification:
26C10 (Primary), 15A42 (Secondary)
1. Introduction
For n∈N, n≥2, we consider matrices X∈Mn(R) of a particular form. Defining R>0=(0,∞), and fixing vectors a=(a1,…,an) and b=(b1,…,bn) in (R>0)n, we study the matrix
[TABLE]
Since
[TABLE]
the geometric means of the ak’s and bk’s play a key role. We let DC(α,β) denote the set of matrices of the form (1.1) with given geometric mean α for the ak’s and β for the bk’s.
Inspired by the occurrence of such matrices in the previous paper [JJZ*+*12], C. Johnson, Z. Price, and I. Spitkovsky, in [JPS13], consider the number of eigenvalues of such a matrix in the left half-plane. In particular, they note that for several cases (when n≤4, or cos(n2π)<βα<1), the number of eigenvalues in the left-half-plane is the same as that for αI−βΣ∗. Here, I is the identity n×n matrix and
[TABLE]
is the relevant permutation n×n matrix.
Numerical evidence presented in [JPS13] suggests that in general, the number of eigenvalues in the left half-plane for any matrix in DC(α,β) is bounded above by the corresponding value for αI−βΣ∗. In this paper, we prove this conjecture.
Theorem 1.1**.**
Fix n∈N, n≥2. Fix α,β∈R>0. Let X∈DC(α,β). Then the number of eigenvalues of X with negative real part does not exceed the number of eigenvalues of αI−βΣ∗ with negative real part, and setting X=αI−βΣ∗∈DC(α,β) allows us to attain this upper bound as a maximum among all elements of DC(α,β).
See also Remark 2.2 for an extension of the claim of this theorem.
Conjugating with nonsingular matrices preserves the spectrum. We conjugate X with the diagonal matrix
[TABLE]
Notice that 1=k=1∏nbkβ. Then with ck=βak, 1≤k≤n,
[TABLE]
The factor β>0 rescales the spectrum, but does not change the signs of the real parts of the points of the spectrum; therefore, we study X. We have simplified the parameter scheme to an n-parameter system c=(c1,c2,…,cn)∈(R>0)n, with geometric mean
[TABLE]
By cofactor expansion down the first row,
[TABLE]
As a matter of technical convenience for the later proof, we rewrite −λ as z. Thus, we analyze the roots of an algebraic equation
[TABLE]
We define
[TABLE]
and
[TABLE]
Let ν−(c) (respectively ν0(c), ν+(c), ν(c)) denote the number of solutions to (1.8) in E− (respectively E0, E+, E), counted with multiplicity.
If in the above construction, X=X∗≡αI−βΣ∗, i.e.,
[TABLE]
then X=γI−Σ∗, and the characteristic polynomial of X is
[TABLE]
Letting c∗≡(γ,γ,…,γ), we have the algebraic equation
Thus, we have reduced the main theorem to the following proposition, as we are interested in counting the number of roots of (1.8) and (1.13) with positive real part.
Theorem 1.2**.**
Fix n∈N. If c=(c1,c2,…,cn)∈(R>0)n, then
[TABLE]
In addition, we may describe the range of roots of (1.8) in the open or closed right-half-plane. To state the results succintly, note by (1.15) that the number of solutions to (1.13) is either 0 or odd, by the evenness of the cosine function, and is nonzero if γ<1=cos(0); therefore, if γ<1, we may write for some κ+, κ∈N that
[TABLE]
Theorem 1.3**.**
Fix n∈N and γ∈R+. Then the range of ν+(c) among the set of c∈R>0n with geometric mean γ is:
[TABLE]
Similarly, the range of ν(c) among these vectors is
[TABLE]
Theorem 1.4**.**
Fix n∈N and α,β∈R+. Then:
(a)
If α>β, then no X∈DC(α,β) has an eigenvalue in the closed left half-plane.
2. (b)
If α=β, then for every X∈DC(α,β), 0 is the only eigenvalue in the closed left half-plane.
3. (c)
If α<β, then X∈DC(α,β) has an odd number of eigenvalues in the open left half-plane, but no more than that of αI−βΣ∗. Moreover, for every such odd number k, some X∈DC(α,β) has exactly k eigenvalues in the open left half-plane. Similarly for the closed left half-plane.
The core of the paper (Sections 2 to 5) is devoted to proving Theorem 1.2. First, we observe that the roots of P(z;c)=1 in the right-half-plane are simple,and are bounded away from ∞ and 0 with bounds only depending on jmaxcj, jmincj, and γ; these statements are recorded in Section 2. Moreover, their number is odd. This allows us to show that the zeroes in the region of interest vary smoothly as c varies, indeed to use the Implicit Function Theorem (our variation is described in Appendix B). We therefore wish to find a path c(t) starting from any c0 to c∗, along which ν+(c(t)) is increasing. We are still wondering if a “direct” path would work, but we choose to build it step-by-step, steadily bringing the most extreme elements to meet with the next most extreme. Our rephrasing in terms of the number of distinct elements of c, and creating a path from any given c0 to one with less extreme jmaxcj and jmincj (and fewer distinct elements) is related in Section 3. In Section 4, we study the effects on the roots with positive real part, showing that they remain in the right half-plane. In the beginning of Section 5, we put the partial paths together to build the desired path from c0 to c∗ along which the number of roots of (1.8) with positive (or 0) real part is increasing. Appendix C clarifies a positivity condition used in this work. .
The end of Section 5, and Sections 6, 7, present more details about the precise behavior of the zero-counting functions, and complete the proofs of Theorems 1.3 and 1.4.
The remaining sections tighten the bounds on the range of permissible zeroes in the right-half plane, giving dimension-invariant bounds. Section 8 gives the details, and Appendix A clarifies a bound used in this work.
In this case, ν+(c)≥1, since all coefficients are real, and
[TABLE]
We further note that the function is strictly increasing on [0,∞), so this root is simple, and unique on [0,∞).
If P(w;c)=1, then by conjugation,
[TABLE]
and so w is also a root of (1.8) (of the same multiplicity). Similarly, if we consider
[TABLE]
we have that
[TABLE]
and that h is even, and increasing on [0,∞), so there exists a unique solution on the positive imaginary axis to (2.1b) (i.e., x=0); call it z=iY(c). Therefore, we have the following.
Lemma 2.1**.**
Fix c∈(R>0)n with geometric mean γ<1. Then ν+(c) and ν(c) are both odd and positive. P(z;c) has exactly one root in (0,1), and the others are not real.
Also, ∣P(z;c)∣2=1, or ∣P(z;c)∣=1, has a unique solution on the positive imaginary axis.
For γ,D∗,D∗, satisfying
[TABLE]
we define
[TABLE]
Remark 2.2**.**
In the analysis of polynomials P(z,c) and related algebraic equations, without loss of generality, we may suppose that the ck are in order, i.e.
[TABLE]
It will be useful in the technical analysis which follows. But it helps to understand that in Theorem 1.1, we can talk about anyΣ, not just Σ∗, which corresponds to an n-cycle permutation κ.
Indeed, for A=diag(a1,…,an),
[TABLE]
and
[TABLE]
see, e.g., [DF04, Section 3.5, p. 110], either Proposition 25 or the line +13.
For c∈C(γ;D∗,D∗), we may uniformly establish a root-free zone for P(z;c) in a small disk centered at the origin.
Lemma 2.3**.**
Fix 0<γ<1 and two positive real numbers D∗ and D∗, satisfying (2.6). Then for all c∈C(γ;D∗,D∗), there are no roots to (1.8) in the closed disk {ξ∈C:∣ξ∣≤d}, where
[TABLE]
Proof.
We denote by σj(c)=σj((c1,…,cn)) the jth elementary symmetric polynomial evaluated at (c1,c2,…,cn). If z is a root of (1.8), then z=0 because γ<1, as k=1∏nck=γn<1. Then by (2.1a), and Lemma 2.4
[TABLE]
so
[TABLE]
∎
For D∗>0, define the closed half-plane
[TABLE]
For c∈C(γ;D∗,D∗), we can also bound from above the size of the roots of (1.8) in Eext.
Lemma 2.4**.**
Fix n∈N and two positive real numbers D∗ and D∗, satisfying (2.6). Then for all c∈C(γ;D∗,D∗), all roots of (1.8) in Eext(D∗) are in the disk {ξ∈C:∣ξ∣<1}.
Proof.
If z=x+iy is a root of (1.8) with x≥0, y real, then by (2.1b),
[TABLE]
so ∣z∣<1. (Indeed, x>−2D∗ is all that is required here).
∎
(In Section 8 and Appendix A we give better estimates, but Lemma 2.4 is good enough for the proof of our main theorem.)
We define Ann(r,R)={z∈C:r<∣z∣<R}, the annulus centered at the origin with radii r and R. We summarize Lemmas 2.4 and 2.3 as follows.
Corollary 2.5**.**
Fix 0<γ<1, and D∗,D∗ positive reals with D∗≤γ≤D∗. Then for any c in C(γ;D∗,D∗), all zeroes of (1.8) in Eext(D∗) are also in Ann(d,1), d∈\eqrefeq:ddef.
In the sequel, it is sometimes more convenient to use a bounding box, rather than a bounding semiannulus, for the permissible range of the zeros with positive real part.
Corollary 2.6**.**
Fix 0<γ<1 and two positive real numbers D∗ and D∗, satisfying (2.6). Then for all c∈C(γ;D∗,D∗), if z∈Eext(D∗) satisfied P(z,c)=1, then w is inside the box
[TABLE]
where
[TABLE]
Proof.
If z=x+iy with x>−3D∗, y real, then by Lemma 2.4, ∣z∣<1, so x<1 and ∣y∣<1. If ∣x∣≤δ and ∣y∣≤δ, ∣z∣2=x2+y2≤2δ2=2⋅(32d)2=98d2<d2, so ∣z∣<d and we may apply
Lemma 2.3.
∎
The containing regions for the roots of P(z;c)=1 are shown in Figure 1.
We will frequently use — even without a reference — the following.
Remark 2.7**.**
If z∈C, z=0, then Rez1>0 (respectively, Rez1<0) if and only if Rez>0 (respectively, Rez<0).
Proof.
It immediately follows from the identity
[TABLE]
∎
Lemma 2.8**.**
Fix 0<γ, and let D∗,D∗∈R>0 satisfy D∗≤γ≤D∗. Then for all c∈C(γ;D∗,D∗), if w is a root of \eqrefeq:maineqn and w∈Eext(D∗), then w is a simple root of (1.8).
Proof.
Let w be a root of (1.8) in Eext(D∗). Then for all k, 1≤k≤n,
Under (2.8), we will not change the orders of the elements in the vectors, and if ck=ck+1 are identical, we will never do any change to make them nonequal. Therefore, it now behooves us only pay attention to the distinct entries in (c1,c2,…,cn). We choose to write the distinct entries in (c1,c2,…,cn) as (d0,…,dq),
[TABLE]
so that the number of distinct entries is 1+q; i.e., the number of strict inequalities in (2.8), or the number of gaps in (3.1) is q. Hereafter, we call q the diversity of the multiset. We therefore reformulate c∈Cn as a multiset with q+1 distinct entries and total weight n. For a given c, let
[TABLE]
and let
[TABLE]
In short, we present c as {d,m;q}={(dj,mj)}j=0q. In this language, we have
[TABLE]
[TABLE]
and c∗ is presented by d∗={γ,n;0}. The family C(γ;D∗,D∗) is presented by the family of multisets
[TABLE]
We now construct the basic elements of our path connecting {d,m;q} to d∗, or c to c∗. Our goal is to reduce the diversity q, i.e., the number of gaps, and maintain the geometric mean.
If q≥2, we put
[TABLE]
We have three cases:
(I)
τ=τ∗<τ∗,
2. (II)
τ∗>τ∗=τ,
3. (III)
τ∗=τ∗=τ.
We now construct a path for the sequence (2.8), or for the multiset (3.1), parameterized by t in [0,τ) and [0,τ]. We define on [0,τ)
[TABLE]
We note that the multiplicities are unchanged on [0,τ): for 0<j<q, the dj do not move, and for 0<t<τ≤τ∗, by (3.7a),
[TABLE]
similarly, dq(t)>dq−1(t) for t in [0,τ). The geometric mean is preserved:
[TABLE]
Since d0(t) is increasing and dq(t) is decreasing, we have that if {d(0),m;q} is in D(γ;D∗,D∗), then so is {d(t),m;q} for all t in (0,τ). The cases differ in the appropriate extension when t=τ.
(I)
In this case, τ=τ∗, so t→τ−limd0(t)=d1, but τ=τ∗, so t→τ−limdq(t)=dqexp(−m0τ∗)>dq−1. Therefore, the end multiset {(dj′,mj′)}j=0q′ at t=τ is defined with
[TABLE]
In short, the 0th and 1st points of the multiset (3.1) have coalesced. Again, the geometric mean is γ, by continuity, and the end multiset belongs to D(γ;D∗,D∗).
2. (II)
In this case, τ=τ∗ so t→τ−limdq(t)=d0exp(mqτ∗)=dq−1, but τ=τ∗, so t→τ−limd0(t)<d1. Therefore, the end multiset {(dj′,mj′)}j=0q′ at t=τ is defined with
[TABLE]
In short, the (q−1)st and qth points of the multiset (3.1) have coalesced. Again, the geometric mean is γ, by continuity, and the end multiset belongs to D(γ;D∗,D∗).
3. (III)
In this case, we have both the lowest 2 and upper 2 points of the multiset (3.1) coalescing. It behooves us to separate out the case q>2 (so d1=dq−1) and q=2 (where d1=dq−1).
(a)
If q>2, then q′=q−2, and the end multiset {(dj′,mj′)}j=0q′ at t=τ is defined with
[TABLE]
2. (b)
If q=2, then q′=0, and m0′=m0+m1+m2, d0′=d1. Since the geometric mean is preserved we must have d∗, a multi-singleton, our goal.
Finally, we handle the q=1 case.
(IV)
If q=1, we find τ>0 such that
[TABLE]
and set
[TABLE]
For t=τ, we change to the multi-singleton {d0′,n;0}, d0′=d0exp(m1τ)=d1exp(−m0τ). Again, since this process does not change the geometric mean, we end up at d∗={γ,n;0}.
If we wish to speak in terms of {c(t)} we always follow (3.1)– (3.3) so
[TABLE]
On each step, the coordinates of c(t) have the structure Bexp(βt) with 0<B≤D∗ and ∣β∣≤n, so the following condition holds:
[TABLE]
We summarize our desired reduction of steps as follows.
Proposition 3.1**.**
Fix positive real numbers 0<D∗≤γ≤D∗, with γ<1. Fix c0∈C(γ;D∗,D∗), c0=c∗. Then with τ defined as in (3.13) if q=1 and (3.7c) if q≥2, we have defined a C∞ function c(t):[0,τ]→C(γ;D∗,D∗) such that
(a)
c(0)=c0;
2. (b)
letting q′ denote the number of gaps in the d-notation for c(τ),
[TABLE]
Moreover, in Cases (III).(III)(b) and (IV), c(t)=c∗.
3.0.1. Extension of Path
For the technical arguments later in the paper, we will need to extend the paths d(t), c(t) beyond [0,τ]; indeed, for the Implicit Function Theorem, we wish to use complex values for t. Of course, the formulas in (3.7) – (3.8), (3.14) are valid for all t∈C, but for any ρ∈(0,2nlog3), we may simply extend it to the C-neighborhood
[TABLE]
Of course, (3.9) still holds, so the geometric mean is preserved, and by the bounds on ρ, for any real r∈[−ρ,τ+ρ]=Jρ∩R,
[TABLE]
and
[TABLE]
Similar bounds hold for dq. Therefore, for any t∈\eqrefeq:Jrhodef, we have
Similar inequalities hold for dq(t), and if q>1, then d1(t),…,dq−1(t) are still positive constants in [D∗,D∗].
We create c(t) as in (3.15), but using the initial m and Kj’s to define the multiplicities, i.e.,
[TABLE]
so that
[TABLE]
Of course, for t>τ, d0(t)>d1(t) or dq−1(t)<dq(t), but (3.21) still gives the same polynomials as the previous constructions for t∈[0,τ], and shows that the diversity is at most q. We therefore have the following.
Lemma 3.2**.**
Let c0∈C(γ;D∗,D∗), fix ρ∈(0,2nlog3), and with Jρ as in (3.18), define c(t) for t∈Jρ as in (3.21), for d(t) as in (3.8) for q>1 and (3.14) for q=1. Then c(t) is a holomorphic function on Jρ, and the image of Jρ is inside [R(D∗,D∗)]n, where
[TABLE]
and
[TABLE]
In particular, c(t)∈C(γ;2D∗,2D∗) for t∈[−ρ,τ+ρ], and c(t)∈C(γ;D∗,D∗) for t∈[0,τ].
In Case (III), part (III)(a), or Case (IV), we will not consider c(t) for t>τ.
4. Reduction of the diversity q
In the d-notation (3.1) – (3.3), our polynomial becomes
[TABLE]
In Section 3, we have chosen the path c(t) or d(t), 0≤t≤τ, which reduces the diversity q of the initial multiset
[TABLE]
to q′=q−1 or q−2 when we move to c(τ), i.e., d(τ). The polynomial (4.1) changes accordingly, and we want to understand how its roots are changing, in particular, when t is close to 0 or τ. In what follows, as in Subsection 3.0.1, c(t) is defined by (3.8) or (3.14), i.e. by (3.21), for −ρ≤τ≤τ+ρ, for small enough ρ.
Proposition 4.1**.**
Fix 0<D∗≤γ≤D∗, with γ<1. Let r=c(0)∈C(γ;D∗,D∗), and w∈E be a root of the equation
[TABLE]
Then for sufficiently small η>0, there exists an unique analytic function w(t), t∈Jη∈\eqrefeq:Jrhodef, such that
[TABLE]
If t∈[−η,τ], then w(t)∈E∩Ann(2d,1). If, in addition, Rew(t)∈[−ϵ,ϵ],
so that the lozenge-shaped neighborhood J(ρ) defined as in \eqrefeq:rhonbhddef is a subset of the rectangle Jρ∈\eqrefeq:Jrhodef.
We first note the following estimate: If ∣z∣≤2, and ∣ck(t)∣≤2D∗ for all k∈N, k≤n, then
[TABLE]
The estimate is on an appropriate domain: for z∈V, ∣z∣≤1, so for z∈Vρ with ρ<1, ∣z∣<2. For t∈Jρ, Lemma 3.2, (3.24), ensures ∣ck(t)∣≤2D∗ for all k.
We divide the next part of the proof into smaller claims.
Claim 4.2**.**
Fix 0<D∗≤γ≤D∗, with γ<1. Fix r=c(0)∈C(γ;D∗,D∗), define c(t) as in Section 3, fix t0∈[0,τ], let s=c(t0), and let w∈V∈\eqrefeq:Vset be a root of
[TABLE]
Then there exists a unique continuous function w(t):Dr(t0)→C, analytic in the interior of Dr(t0) with range in Dκ(t0), where κ, r depend only on γ, D∗, D∗, and ρ, such that
[TABLE]
Proof.
To use Appendix B, Claim B.1 on F(z;t)∈\eqrefeq:fset, we find appropriate estimates for the inequalities (B.5a), (B.5b), (B.4). Note that by ϵ+ρ≤23(12D∗)<6D∗, V(ρ)⊆Eext(D∗/2), and as mentioned above, t∈Jρ implies by Lemma 3.2 that Reck(t)≥2D∗ and ∣ck(t)∣≤3D∗ for all k.
For M1, by P(z;c(t))∈\eqrefeq:polyext, for all t∈Jρ and z∈Eext(2D∗), ∣z∣≤1+ρ<2,
For ∂t∂F, and for all cases (I) – (IV), we need only two terms:
[TABLE]
For t∈Jρ, 0<ρ<2nlog3, we have by (3.23) that Recj(t)>2D∗, or Redj(t)>2γ, so for all j, 0≤j≤q, and z∈Eext(D∗/2),
[TABLE]
Using (4.15),(4.9), and ∣z∣<2 in the final line of (4.14),
[TABLE]
Therefore, we can choose
[TABLE]
As above, we can bound the second derivatives of F(z;t)∈\eqrefeq:fset and it suffices to choose
[TABLE]
By (4.12), we have that for any particular root w∈Eext(D∗/2) of
[TABLE]
that
[TABLE]
so defining
[TABLE]
we have that
[TABLE]
With c(0)=r and c(t) defined in Section 3, and t0∈[0,t]=J, s=c(t0) choose w∈V⊆Eext(D∗/2) among the roots of (4.10). We choose
[TABLE]
Then by the Implicit Function Theorem, i.e. by Claim B.1, there exists a continuous function w(t):Dr(t)→C, analytic in the interior, with image contained on Dk(w), such that
[TABLE]
and with F(z,t)∈\eqrefeq:fset,
[TABLE]
∎
Claim 4.3**.**
In the setting of Claim 4.2, whenever t∈Dr(t0), t<τ, and w(t) is in the set
[TABLE]
we have that
[TABLE]
Proof.
We now wish to demonstrate that if t∈(t0−r,t0+r), t<τ, and Rew(t)≤ϵ, ϵ∈\eqrefeq:epsilondef, then w˙>0. For real t in this domain, by Lemma 3.2, c(t)∈C(γ;3D∗,3D∗), so when invoking Corollaries 2.5 and Corollary 2.6, we will use d(γ,3D∗) and δ(γ,3D∗).
Consider first the easier case (IV), i.e., q=1. The sum (4.20) has only two terms so
For the estimates of the sum T3 notice that, with z=x+iy,
[TABLE]
and
[TABLE]
With c=dj, 0<j<q,
[TABLE]
if ∣y∣≥δ(γ,3D∗) by
[TABLE]
Therefore, for z∈\eqrefeq:walldef, ReT3>0; moreover, since t real and in [−ρ,τ] implies c(t)∈C(γ;3D∗,3D∗), so by Corollary 2.6, ∣w(t)∣≥δ(γ,3D∗). Together with (4.44) and (4.41), this implies that
[TABLE]
and by (4.43), (4.40), and (4.38), Rew˙(t)>0 if the trajectory w(t) is in the Wall, so the root w(t) cannot leave the Box by crossing the Wall to the left
(see Figure 2).
∎
Claim 4.4**.**
In the setting of Claim 4.2, suppose that t0<τ and Rew≥0. Then w(t), restricted to [t0,t0+r], extends uniquely to a function on [t0,τ] such that
[TABLE]
Proof.
By Corollary 2.5, any root of w(t), t real, with ∣Rew(t)∣<ϵ is in the Wall. By Claim 4.3, we have that Rew˙(t)>0 if w(t) is in the Wall and t<τ. Thus, whenever ∣Rew(t)∣<ϵ and t<τ, Rew˙(t)>0.
Case 1.
If r≥τ−t0, for each η>0, we may apply Claim C.1 with h(t)=Rew(t), [a,b]=[t0,t0+τ−η], Δ=ϵ, so that Rew(t)>0 for all t∈(t0,t0+τ−η]. Thus, Rew(t)>0 for all t∈(t0,τ). In addition, Rew(τ)>0: if for some interval (τ−η,τ), Rew(t)<ϵ for t∈(τ−η,τ), then Rew˙(t)>0 for t∈(τ−η,τ), so Rew(τ)>Rew(τ−2η)>0. Otherwise, for all η>0, there exists t∈(τ−η,τ) with Rew(t)≥ϵ, so there exists an increasing sequence {tj}j=1∞ in (t0,τ) with Rew(tj)≥ϵ for all j≥1, and
[TABLE]
In all cases, Rew(t)>0 on (t0,τ].
2. Case 2.
If r<τ−t0, define
[TABLE]
K≥3 by r=22r<τ−t0. Then let
[TABLE]
and we inductively define w(t) on k=0⋃K−2Dr(tk) as follows. Put w(t)=w0(t) on Dr(t0) as in Claim 4.2. We may apply Claim C.1 with h(t)=Rew0(t), [a,b]=[t0,t1], Δ=ϵ, to ensure Rew0(t)>0 on (t0,t1].
Suppose that we have defined w(t) on k=0⋃jDr(tk), j≤K−3, and ensured that Rew(t)>0 on (t0,tj+1]; we now show how to extend the definition to k=0⋃j+1Dr(tk) and ensure positive real part on (t0,tj+2]. Since Rew(tj+1)>0 by hypothesis, we may define wj+1(t) on Dr(tj+1) by Claim 4.2, the unique function such that wj+1(tj+1)=w(tj+1) and P(wj+1(t),c(t))=1 for all t∈Dr(tj+1). We have w(tj+1)=wj+1(tj+1)∈Dr(tj)∩Dr(tj+1), so by the uniqueness statement for wj+1, wj+1(t)=wj(t) for all t in Dr(tj)∩Dr(tj+1). We extend the definition of w(t) by
[TABLE]
which is a valid definition by the equality on the overlap. Moreover, tj+2∈Dr∘(tj+1), and j≤K−3, so j+2≤K−1, so tj+2≤tK−1<τ by definition of K, and so we may apply Claim C.1 to h(t)=Rew(t), [a,b]=[t0,tj+2], Δ=ϵ to demonstrate that Rew(t)>0 on (t0,tj+2].
By induction, we have defined w(t) on k=0⋃K−2Dr(tk), such that Rew(t)>0 on (t0,tK−1]. As in our induction argument, we may expand the definition of w(t) to include Dr(tK−1), but now τ−tK−1≤t0+K(r/2)−[t0+(K−1)(r/2)]=r/2<r, so as in Case 1, we may argue that Rew(t)>0 on [tk−1,τ], hence on (t0,τ], in this last step.
∎
Remark 4.5**.**
In Claim 4.4 , we could replace “Rew≥0” by “Rew≥−ϵ” for the starting point and “Rew(t)>0” by “Rew(t)>−ϵ” for t>t0 – for in the invocations of Claim C.1, we could have taken h(t)=Rew(t)+ϵ and Δ=2ϵ, since Claim 4.3 ensures that w˙(t)>0, hence h′(t)>0, if ∣Rew(t)∣≤ϵ, i.e. 0≤h(t)≤2ϵ. Thus, we can start a little to the left of the imaginary axis and have a path on [t0,τ].
Completion of the proof of Proposition 4.1. The primary step remaining is to show an appropriate choice of η such that I can extend to all t∈Jη. By Claim 4.4, if Rew≥0, we have a nice function w(t) on [0,τ] with w(0)=w and Rew(t)>0 for t∈(0,τ]. At each point t∈[0,τ], we have an r-radius ball where the function w(t) can be extended, and the uniqueness from the Implicit Function Theorem ensures that these extensions are consistent. Therefore, w(t) exists on J(r) according to the model of (B.1). Setting η=32r, Jη∈\eqrefeq:rhonbhddef is a subset of J(r)∈\eqrefeq:Jrhodef, by the same reasoning as in the proof of Corollary 2.6.
Since η=32r≤3ρ<2nlog3, Lemma 3.2 ensures that for t∈[−η,τ+η], c(t)∈C(γ;2D∗,2D∗), and hence by Corollary 2.5 all nonnegative roots are in Ann(d(γ,2D∗),1)⊂Ann(d(γ,D∗)/2,1). The result on the sign of the derivative follows from Claim 4.3.
∎
5. Movement of the Roots
Claim 5.1**.**
ν+(c(t))* and ν(c(t)) are nondecreasing on [0,τ]*
Proof.
First, we prove the inequality on [0,τ],
[TABLE]
So far, we have talked about the trajectory w(t) of one root w(0)=w. All roots in the Box are simple by Lemma 2.8 so at no instant t do two of the ν+(c(0)) trajectories with the initial ν+(c(0)) root-points could coalesce; yet they remain in the Box and E+ (or E). New roots could come from the left, i.e, from E−={ξ∈C:Reξ<0}, but this only pushes up the number ν+(c(t)) in the right half-plane so ν+((c(0))≤ν+(c(t)), 0≤t≤τ. The same can be said about roots in E so ν(c(0))≤ν(c(t)).
We will get the full claim if we show
[TABLE]
Without changing the structure or diversity q of the multiset (3.1) – (3.3) let us only change d0 to d0=d0exp(mqt′) and dq to dq=dqexp(−m0t′). With t′<τ the inequalities
[TABLE]
will be preserved. If we proceed by the scheme of Section 3 with the initial multiset
[TABLE]
and the old multiplicities {mj}j=0q, recalculation of τ leads to
Now we can apply the work of Section 4, with the understanding that [t′,τ] is shifted by t′ to [0,τ], and (5.1) becomes the inequalities (5.2).
∎
In Section 3 we made one step {c(t)∈Rn,0≤t≤τ}, or {d(t)∈Rq+1;0≤t≤τ}, to bring the diversity q down by 1 or 2, with numbers of zeroes ν+(c), ν(c) of P(z;c)−1 in E+ and E not decreasing.
We can repeat the same construction (many times, but at most q times) if q′>0 still, treating the end–multiset of the previous set as the initial sequence (2.8), or multiset (3.1) for the next step. In this way, we get the intervals [τi,τi+1], τ0=0, Δi=τi+1−τi>0, i=0,1,…,p−1; p≤q, and the following holds.
Proposition 5.2**.**
Fix c0∈(R>0)n, with geometric mean γ. There exists a continuous, piecewise–C∞ function
[TABLE]
such that
(a)
c(0)=c0∈\eqrefeq:cbounds**
2. (b)
c(T)=c∗=(γ,γ,…,γ).
3. (c)
ν+(c(t))* and ν(c(t)) are non-decreasing functions on [0,T], i.e., for all t, t′, 0≤t′<t≤T,*
The t=0, t′=T case of (c) is precisely Theorem 1.2.
We now describe more precisely the movement of the roots. Define for t∈[0,T]
[TABLE]
Claim 5.3**.**
The counting function ν+(t) has a point of discontinuity at t=t∗ if and only if
[TABLE]
has roots on iR.
Proof.
If such roots do not exist, then define h>0 by 2h=min⎩⎨⎧3D∗,z∈CP(z,c(t∗))=1min{∣Rez∣}⎭⎬⎫. Define the region
[TABLE]
and note that by the Cauchy Integral Formula, e.g., [Con00, Section 4.7, pp. 97 – 99],
[TABLE]
Let
[TABLE]
then μ(t∗)>0, and μ(t) is continuous at t∗, so there exists ρ>0, ρ<1 such that
[TABLE]
Thus, μ(t)>0 for t∈[t∗−ρ,t∗+ρ], and the Cauchy integral
[TABLE]
is continuous on [t∗−ρ,t∗+ρ], but it is integer-valued, being the counting-function for the roots of
[TABLE]
in the interior of Gh, so η+(t) is constant. Therefore, the number of roots of (5.11) in Gh is ω(t∗) for all t in [t∗−ρ,t∗+ρ].
To show that η+(t)=ω+(t), we must show that no roots enter from the left. We know that there are no roots to (5.5) in the strip {ξ∈C:∣Reξ∣<2h}, in particular on the imaginary axis, so we consider
[TABLE]
In the same way, shrinking ρ if necessary, for t∈[t∗−ρ,t∗+ρ] there are no roots of (5.5) on ∂G0 (in particular, on the imaginary axis), and on [t∗−ρ,t∗+ρ], the function
[TABLE]
is a continuous counting-function, hence constant. η(t∗)=η+(t∗)=ω+(t∗), as there are no roots at time t∗ with small real part, so as η and η+ are constant on this interval, and there are no roots on the imaginary axis, the number of roots in G0∖Gh is 0 for all t∈[t∗−ρ,t∗+ρ]. All roots in the closed right-half-plane must be in G0 by Lemma 2.3, so we must have ω+(t)=η+(t) for t∈[t∗−ρ,t∗+ρ]. Thus, ω+(t) is constant for t∈[t∗−ρ,t∗+ρ] for some small ρ. (Since we showed there were no roots on the imaginary axis, ω+(t)=ω(t) for t∈[t∗−ρ,t∗+ρ], so the counting-function on the closed half-plane is also constant).
Suppose that (5.5) has a pure imaginary root; since solutions to (1.8) imply solutions to (2.1b), we have by Lemmas 2.1 and 2.3 that the root can only be ±iY, 1>Y>d>0, d∈\eqrefeq:ddef, only two roots, and they are simple by Lemma 2.8. Now t∗∈[0,T] can be one of three types of points:
(i)
t∗∈(tk,tk+1) for some k, 0≤k<p≤q−1;
2. (ii)
t∗=tk, 0≤k<p;
3. (iii)
t∗=T.
We need to know well the behaviour of the root w(t) with w(t∗)=iY, for t around t∗, a well-determined function for small ρ by the Implicit Function Theorem.
The case (i) is easier: with ρ, 0<ρ<21min{tk+1−t∗,t∗−tk} the path c(t), or d(t), is defined by formulas (3.8), (3.15); this is analytic on Iρ=[t∗−ρ,t∗+ρ], or even if we talk about complex t in a neighborhood of Iρ⊆C. By (4.35), K=Rew˙(t)t=t∗>0, so for ρ small enough,
[TABLE]
so
[TABLE]
Now we know the past and the future of the roots ±iY(c(t∗)): they are in E+ if t∗≤t≤t∗+ρ, and they are in E− if t∗−ρ≤t<t∗. All other roots remain in their half-planes; it can be explained as in (5.6) – (5.9) (with G−h in the place of G0). Therefore,
[TABLE]
and
[TABLE]
The case (ii), i.e, t∗=tk, 0≤k≤p−1, is more delicate because the function c(t), or d(t), at t∗ is only continuous. It is defined by different C∞ (or analytic) functions on [tk−1,tk] and [tk,tk+1]. Thus, we need to analyze them and their derivatives on [tk−1,tk) and (tk,tk+1] separately. Claim 4.3 gives us all the information; the later case (tk,tk+1] is an analogue of (0,τ], so
[TABLE]
and we can repeat (5.12) and (5.13a) to justify the claim
[TABLE]
(This also suffices for the case t∗=0, i.e., k=0). If, however, t<tk, the derivative w(t) by (4.31) or (4.38) has two factors
and Δ(t)=dq(t)−d0(t), with Δ(t)≥Δ∗>0 for some Δ∗ in the cases (I), (II), (III) (a), and Δ(t)∣t=t∗=0 in the cases (III) (b), (IV). Yet Δ(t)=dqexp(−m0t)−d0exp(mqt), and we have dtdΔt=t∗=−(m0dq+mqd0)d0emqt∗,
so
[TABLE]
Therefore, for t=t∗−h, 0≤h≤ρ, by (5.19) and (5.20),
[TABLE]
Therefore, as in Case (i), the inequalities (5.16) and (5.20) justify (5.14) and (5.15) if t∗=τk, 0≤k<p.
The case (iii) is special; it happens only if c(t)=c∗, i.e., [τp−1,T] is an analogue of [0,τ] in Cases (III)(b) or (IV). As in (5.18), a pure imaginary root comes from the left, so
[TABLE]
∎
6. Construction of multisets such that ν+(c)=1 and ν(c)=1
We have demonstrated that for all c∈(R>0)n with geometric mean γ<1, the maximum values for ν+(c) and ν(c) are achieved by c∗. The question is what the minimum value is, or could be.
As per Lemma 2.1, if the geometric mean γ<1, then ν+(c)≥1 and ν(c)≥1 by the positive real root. We now show that this lower bound is the minimum.
Proposition 6.1**.**
Fix n∈N, and fix γ∈(0,1). There exists c∈(R>0)n with geometric mean γ such that ν+(c)=ν(c)=1.
We note that for 1≤n≤4, 0<γ<1,
[TABLE]
has only one root with positive real part, as follows from (1.14), so ν+(c∗)=ν(c∗)=1. In the sequel, we assume that n≥5.
It turns out that control of the 2 extreme coordinates in c suffices to force the number of eigenvalues in the right-half-plane to be equal to 1. For convenience, let n′=n−2.
Proposition 6.2**.**
Let n∈N, n≥5, and fix c′∈(R>0)n′. Then for any γ∈(0,1), there exists a vector cext=(d0,c′,dq)∈(R>0)n with geometric mean γ and ν+(cext)=ν(cext)=1.
To begin the proof, we write c′ in d-notation as {(d′,m′)}j=0q′. We extend c′ to cext by setting q=q′+2 and choosing d0<d0′ and dq>dq′′ such that d0j=0∏q′(dj′)mj′dq=γn. Set
[TABLE]
[TABLE]
and let cext be the resulting vector in (R>0)n as created by (3.15). Altogether, setting P(z;cext)=1, we have
We rescale z as z=γw to move all the γ terms to the other side, which does not change the signs of the real parts of any zeroes; letting G=γ1 we have
[TABLE]
We will fix dj, 1≤j≤q−1, i.e., the (bj)j=1q−1 of (6.4b), and in (6.4a)
[TABLE]
and (thinking of M as our parameter, and A varying as in (6.4b) to balance the geometric mean) study the polynomial
[TABLE]
and the roots of (6.4a). Similarly to the previous, we define μ+(M) and μ(M) to be the number of roots of PM(z)=Gn in the open right-half-plane E+ and the closed half-plane E, respectively .
Claim 6.3**.**
If M∈\eqrefeq:blist is sufficiently large, and A=M⋅Bn′ as in (6.4b), then
[TABLE]
Proof.
As in Lemma 2.1, there is a guaranteed root in (0,G) by the Intermediate Value Theorem, as by (6.4b),
[TABLE]
Thus, μ(M)≥μ+(M)≥1.
Put
[TABLE]
then the interiors of the disks
[TABLE]
do not intersect, and their closures are in E−∈\eqrefeq:Esets. If, in addition, M≥Bnb12, then
[TABLE]
and the disks D0 and D1 have disjoint interior. Similarly, if M≥bq−1+2β, then the interiors of Dq−1 and Dq do not intersect, and Dq is contained in the open left-half plane. We wish to show that for 1≤j≤q,
[TABLE]
if M≥max{βBn′2,2(bq−1+β),βn−18Gn+2}. Indeed, if k=j, 0≤j,k≤q,
[TABLE]
so for w∈∂Dj, 1≤j≤q,
[TABLE]
if A1≤21β, or M≥βBn′2, and M≥2(β+bq−1). We choose
M≥max{βBn′2,2(bq−1+β),βn−18Gn+2}. Then (6.10) holds.
The first term does not exceed the third (because bj≥2jβ, j≥1, by (6.8)), so we choose
[TABLE]
Then the number of roots of PM(w)=ξ does not depend on ξ if ξ≤21w∈∂Djmin{∣PM(w)∣}, as this is the integral
[TABLE]
(see, e.g., [Con00, Section 4.7, pp. 97 – 99]). In particular, when ξ=0, this is mj, 1≤j≤q (this includes the case j=q, i.e., bq=M). Therefore, counted with multiplicity, the number of roots of Pm(w)=Gn is also mj for M as above. This holds for j=1,2,q. For such j, all such Dj are in the left half-plane, as β≤b1−b0<b1. Hence, there are j=1∑qmj=n′+1=n−1 roots in the left half-plane. Since we have already located the zero in the right-half plane, we have accounted for all roots of the nth-degree polynomial PM(w)−Gn: n−1 in the open left-half-plane, none on the imaginary axis, and 1 in the right half-plane. Thus, μ+(M)=μ(M)=1 for M as in (6.11).
∎
7. The Range of ν+(c) and ν(c)
For each (n,γ) pair, we have shown the maximum and minimum values for ν+(c) and ν(c) for all c∈(R>0)n with geometric mean γ. By Lemma 2.1, ν+(c) and ν(c), are odd integers, but we wish to show that every odd number between the minimum values and maximum values of ν+(c) and ν(c) is achieved.
For convenience, combining Lemma 2.1 and (1.15), write
[TABLE]
Corollary 7.1**.**
Fix n∈N, and γ∈(0,1), and fix c0∈(R>0)n with geometric mean γ. Let D∗=jmincj and D∗=jmaxcj. Construct c(t):[0,T]→C(γ;D∗,D∗) as defined in Sections 3 and 5. Then:
(i)
for any odd k, ν+(c)≤k≤2κ++1, there exists t=t(k)∈[0,T] with ω+(t(k))=k.
2. (ii)
for any odd ℓ, ν(c)≤ℓ≤2κ+1, there exists t(ℓ)∈[0,T] with ω(t(ℓ))=k.
Proof.
By Claim 5.3, or its proof, the jumps of ω+(t) and ω(t) are of size 2, and the points of discontnuity t∗ are where the equation (5.5) has pure imaginary roots. There are μ+=21[(2γ+1)−ν+(c)] point of discontinuity, by Lemma 2.1, named {ηj}j=1μ+, and
[TABLE]
[TABLE]
These facts on the structure of the functions ω+(t),ω(t) imply (i), (ii).
∎
Since by Proposition 6.1, we know for all (n,γ) pairs with n∈N, γ∈(0,1), there exists c0∈(R>0)n with geometric mean γ and ν+(c0)=ν(c0)=1, we may apply Corollary 7.1 to such a c0 and achieve all positive odd values less than the maximum. This proves the following.
Proposition 7.2**.**
Fix n∈N, and γ∈(0,1). Then:
(i)
for all odd k, 1≤k≤2κ++1, there exists c∈(R>0)n with ν+(c)=k.
2. (ii)
for all odd ℓ, 1≤ℓ≤2κ+1, there exists c∈(R>0)n with ν(c)=ℓ.
In the context of doubly cyclic matrices, we have the following.
Proposition 7.3**.**
Fix n∈N, and 0<α<β<1. Then:
(i)
for all odd k, 1≤k≤2κ++1, there exists X∈DC(α,β) with k roots in the open left half-plane with ν+(c)=k.
2. (ii)
for all odd ℓ, 1≤ℓ≤2κ+1, there exists X∈DC(α,β) with ℓ roots in the closed left half-plane.
Since by Lemma 2.1 and Theorem 1.2, ν+(c) (respectively, ν(c)) is odd and less than ν+(c∗) (respectively, ν(c∗)), the range is no larger than that demonstrated in Proposition 7.2, so this completes the proof of the γ<1 case of Theorem 1.3; the γ≥1 case was handled at the beginning of Section 2. Similarly, we have proven Theorem 1.4
8. Further Comments
In the proof of the main theorem we used the localization
[TABLE]
of roots of (1.8) in the right half-plane E, or in Box∈\eqrefeq:ourboxdef. We want now to improve the upper bound 1 in (8.1) and make explicit the dependence on γ=(k=1∏ncj)1/n. As in (2.15),
Therefore (in conjunction with (8.4)), as an analogue or an improvement of Lemmas 2.4, 2.3 and Corollary 2.5, we can state the following.
Claim 8.1**.**
If c∈C(γ;D∗,D∗), 1>γ≥21, and z is a root of (1.8) in the right half-plane, then
(i)
z* lies outside of the ellipsoid*
[TABLE]
or
2. (ii)
in a weaker claim,
[TABLE]
Therefore z∈Ann(54D∗(1−γ),23(1−γ)1/2).
A slight advantage over Corollary 2.5 and Lemma 2.3 is that there is no n in Claim 8.1, at least explicitly. Speaking loosely, we can say that the area of localization changes continuously when γ goes from γ>1 to γ<1.
See more on the Newton and Maclaurin Inequalities in [Nic00], [Nic04], and references therein.
Appendix B Implicit Function Theorem
Of course, the Implicit Function Theorem is well-known (see, e.g., [Rud76, Thm. 9.28, pp. 224] or [FG02, Thm. 7.6, p. 34]), but we use a version with explicit lower bounds on the neighborhoods of validity, so we give the full details below. For a convex, closed, bounded set V⊆C, put for 0<ρ<1 the ρ-neighborhood of V,
[TABLE]
Let F(z,t) be an analytic function of two variables in
[TABLE]
where J(ρ) is the C-neighborhood of J as in (B.1). Assume that
[TABLE]
is not empty, and
[TABLE]
Put
[TABLE]
Now, choose and fix κ, r such that
[TABLE]
and
[TABLE]
Claim B.1**.**
Under the assumptions and notation (B.1) – (B.7), if
[TABLE]
then there exists a unique continuous function z(t) in the closed disc
[TABLE]
analytic in the open disk Dr∘(t0), such that for t∈Dr,
we want(see (B.10a)) to find ζ(s)∈X, where X is the Banach space (A(Dr(0)),∥⋅∥∞) of functions analytic in the open disk Dr∘(0) and continuous on the closed disk Dr(0), such that
[TABLE]
where
[TABLE]
Define in X the mapping
[TABLE]
at least for functions with ∣ξ(s)∣≤ρ for all s∈Dr(0).
The ball
[TABLE]
is invariant under Φ: indeed, by (B.6), (B.7), if ∣s∣≤r≤1,
[TABLE]
Moreover, on K(κ) this mapping is contractive in the uniform norm: If ξ(s), ζ(s)∈K(κ), then
[TABLE]
where
[TABLE]
and ∣L∣≤M2κ, so
[TABLE]
i.e., Φ is contractive on (K(κ),∥⋅∥∞).
By the Contractive Mapping Principle, we have a solution ζ(s) of the equation (B.15), or the solution z(t) of (B.10b), z(t0)=t0, and (B.10a). The solution of (B.15) is unique in K(κ).
The form of the derivative (B.11) follows from implicit differentiation.
∎
Appendix C Condition for Positivity of Function
Fix a<b and let h∈C2[a,b] be a real-valued function. Suppose that there exists a positive constant Δ such that
[TABLE]
Claim C.1**.**
If h∈C2[a,b] and Δ>0 satisfies (C.1), then h(x)>0 for all x in (a,b].
Proof.
If h(a)<Δ, we have by (C.1b) that h′(a)>0, so we have Δ≥h(x)>h(a) if a≤x≤a+ρ, 0<ρ≪1. Define
[TABLE]
ω∗≥a+ρ>a by the above. Since h′(x)>0 on (a,ω), h(x)>h(a)≥0 for all x in (a,ω], and we are done; also, either ω∗=b, or ω∗<b and h(ω∗)=Δ. In the former case, h(x)>h(a) for all x in (a,b]. In the latter case, i.e., ω∗<b, we claim that
[TABLE]
Otherwise, for some y∈(ω∗,b],
[TABLE]
Then the set
[TABLE]
is not empty, and closed; therefore, it contains t∗=supT, and ω∗<t∗<y. For t, t∗<t<y, h(t)≤43Δ=h(t∗), so h′(t)>0 if t∗<t<y. In particular, letting k=h′(t∗)>0, by h∈C1 there exists a small interval [t∗,t†] with h′≥2k on [t∗,t†]. Therefore,
[TABLE]
This contradiction shows that no such y can exist, so h(x)≥2Δ for all x∈[ω∗,b].
If h(a)≥Δ, we set ω∗=a, and we see that h(x)≥2Δ for all x in (a,b]=(ω∗,b] as in the above proof.
∎
Remark C.2**.**
With a slight adjustment of the proof, we may also replace (C.2) with the stronger inequality h(x)≥Δ.
Bibliography10
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[Con 00] John B. Conway. Functions of One Complex Variable, I , volume 11 of Graduate Texts in Mathematics . Springer, 2nd edition, 2000.
2[DF 04] David S. Dummit and Richard M. Foote. Abstract Algebra . John Wiley and Sons, Inc., 3rd ed. edition, 2004.
3[FG 02] Klaus Fritzsche and Hans Grauert. From Holomorphic Functions to Complex Manifolds , volume 213 of Graduate Texts in Mathematics . Springer-Verlag, 2002.
4[HLP 52] G. H. Hardy, J. E. Littlewood, and G. Pólya. Inequalities . Cambridge, at the University Press, 2nd ed edition, 1952.
5[JJZ + 12] Clark D. Jeffries, Charles R. Johnson, Tog Zhou, Dennis A. Simpson, and William K. Kaufmann. A flexible and qualitatively stable model for cell cycle dynamics including dna damage effects. Gene Regulation and Systems Biology , (1):55 – 66, 2012.
6[JPS 13] Charles R. Johnson, Zachary Price, and Ilya M. Spitkovsky. The distribution of eigenvalues of doubly cyclic Z + superscript 𝑍 \displaystyle Z^{+} -matrices. Linear Algebra Appl. , 439(11):3576–3580, 2013.
7[Mac 29] Colin Maclaurin. A second letter from mr. colin mc laurin, professor of mathematicks in the university of edinburgh and f. r. s. to martin folkes, esq; concerning the roots of equations, with the demonstration of other rules in algebra; being the continuation of the letter published in the philisophical trancations, no 394. Phil. Transactions , 36:59 – 96, 1729.
8[Nic 00] Constantin P. Niculescu. A new look at Newton’s inequalities. JIPAM. J. Inequal. Pure Appl. Math. , 1(2):Article 17, 1–14, 2000.