localization and perturbations of roots to systems of...
TRANSCRIPT
Hindawi Publishing CorporationInternational Journal of Mathematics and Mathematical SciencesVolume 2012, Article ID 653914, 9 pagesdoi:10.1155/2012/653914
Research ArticleLocalization and Perturbations of Roots to Systemsof Polynomial Equations
Michael Gil’
Department of Mathematics, Ben Gurion University of the Negev, P.O. Box 653, Beer-Sheva 84105, Israel
Correspondence should be addressed to Michael Gil’, [email protected]
Received 20 March 2012; Accepted 28 May 2012
Academic Editor: Andrei Volodin
Copyright q 2012 Michael Gil’. This is an open access article distributed under the CreativeCommons Attribution License, which permits unrestricted use, distribution, and reproduction inany medium, provided the original work is properly cited.
We establish estimates for the sums of absolute values of solutions of a zero-dimensionalpolynomial system. By these estimates, inequalities for the counting function of the roots arederived. In addition, bounds for the roots of perturbed systems are suggested.
1. Introduction and Statements of the Main Results
Let us consider the system:
f(x, y)= g(x, y)= 0, (1.1)
where
f(x, y)=
m1∑
j=0
n1∑
k=0
ajkxm1−jyn1−k (am1n1 /= 0),
g(x, y)=
m2∑
j=0
n2∑
k=0
bjkxm2−jyn2−k (bm2n2 /= 0).
(1.2)
The coefficients ajk, bjk are complex numbers.The classical Bezout and Bernstein theorems give us bounds for the total number
of solutions of a polynomial system, compared to [1, 2]. But for many applications, it isvery important to know the number of solutions in a given domain. In the present paper
2 International Journal of Mathematics and Mathematical Sciences
we establish estimates for sums of absolute values of the roots of (1.1). By these estimates,bounds for the number of solutions in a given disk are suggested. In addition, we discussperturbations of system (1.1). Besides, bounds for the roots of a perturbed system aresuggested.
We use the approach based on the resultant formulations, which has a long history;the literature devoted to this approach is very rich, compared to [1, 3, 4]. We combine it withthe recent estimates for the eigenvalues of matrices and zeros of polynomials. The problem ofsolving polynomial systems and systems of transcedental equations continues to attract theattention of many specialists despite its long history. It is still one of the burning problemsof algebra, because of the absence of its complete solution, compared to the very interestingrecent investigations [2, 5–8] and references therein. Of course we could not survey the wholesubject here.
A pair of complex numbers (x, y) is a solution of (1.1) if f(x, y) = g(x, y) = 0.Besides x will be called an X-root coordinate (corresponding to y) and y a Y -root coordinate(corresponding to x). All the considered roots are counted with their multiplicities.
Put
aj(y)=
n1∑
k=0
ajkyn1−k (
j = 0, . . . , m1), bj
(y)=
n2∑
k=0
bjkyn2−k (
j = 0, . . . , m2). (1.3)
Then
f(x, y)=
m1∑
j=0
aj(y)xm1−j ,
g(x, y)=
m2∑
j=0
bj(y)xm2−j .
(1.4)
Withm = m1 +m2 introduce them ×m Sylvester matrix
S(y)=
⎛
⎜⎜⎜⎜⎜⎜⎜⎜⎜⎜⎜⎝
a0 a1 a2 · · · am1−1 am1 0 0 · · · 00 a0 a1 · · · am1−2 am1−1 am1 0 · · · 0· · · · · · · · · · · · · ·0 0 0 · · · a0 a1 a2 a3 · · · am1
b0 b1 b2 · · · bm2−1 bm2 0 0 · · · 00 b0 b1 · · · bm2−2 bm2−1 bm2 0 · · · 0· · · · · · · · · · · ·0 0 0 · · · b0 b1 b2 b3 · · · bm2
⎞
⎟⎟⎟⎟⎟⎟⎟⎟⎟⎟⎟⎠
, (1.5)
with ak = ak(y) and bk = bk(y). Put R(y) = detS(y) and consider the expansion:
R(y)=
n∑
k=0
Rkyn−k, where n := degR
(y). (1.6)
International Journal of Mathematics and Mathematical Sciences 3
Furthermore, denote
θ(R) :=
⎡
⎣ 12π
∫2π
0
∣∣∣∣∣R(eit)R0
∣∣∣∣∣
2
dt − 1
⎤
⎦
1/2
. (1.7)
Clearly,
θ(R) ≤ sup|y|=1
∣∣∣∣∣R(y)
R0
∣∣∣∣∣, R0 = lim
y→∞R(y)
yn, R0 =
12π
∫2π
0e−intR
(eit)dt. (1.8)
Thanks to the Hadamard inequality, we have
∣∣R(y)∣∣2 ≤
(m1∑
k=0
∣∣ak(y)∣∣2)m2
(m2∑
k=0
∣∣bk(y)∣∣2)m1
. (1.9)
Assume that
Rn /= 0. (1.10)
Theorem 1.1. The Y -root coordinates yk of (1.1) (if, they exist), taken with the multiplicities andordered in the decreasing way: |yk| ≥ |yk+1|, satisfy the estimates:
j∑
k=1
∣∣yk∣∣ < θ(R + 1) + j
(j = 1, 2, . . . , n
). (1.11)
If, in addition, condition (1.10) holds, then
j∑
k=1
1∣∣yk∣∣ <
R0(θ(R) + 1)Rn
+ j(j = 1, 2, . . . , n
), (1.12)
where yk are the Y -root coordinates of (1.1) taken with the multiplicities and ordered in the increasingway: |yk| ≤ |yk+1|.
This theorem and the next one are proved in the next section. Note that another boundfor∑j
k=1 |yk| is derived in [9, Theorem 11.9.1]; besides, in the mentioned theorem aj(·) andbj(·) have the sense different from the one accepted in this paper.
From (1.12) it follows that
minkyk >
Rn
R0(θ(R) + 1) + Rn. (1.13)
So the disc |y| ≤ Rn/(R0(θ(R) + 1) + Rn) is zero free.
4 International Journal of Mathematics and Mathematical Sciences
To estimate the X-root coordinates, assume that
inf|y|≤θ(R)+1
∣∣a0(y)∣∣ > 0 (1.14)
and put
ψf = sup|y|=θ(R)+1
1∣∣a0(y)∣∣
⎡
⎣m1∑
j=1
∣∣aj(y)∣∣2⎤
⎦
1/2
. (1.15)
Theorem 1.2. Let condition (1.14) holds. Then theX-root coordinates xk(y0) of (1.1) correspondingto a Y -root coordinate y0 (if they exist), taken with the multiplicities and ordered in the decreasingway, satisfy the estimates:
j∑
k=1
∣∣xk(y0)∣∣ < ψf + j
(j = 1, 2, . . . ,min{m1, m2}
). (1.16)
In Theorem 1.2 one can replace f by g.Furthermore, since yk are ordered in the decreasing way, by Theorem 1.1 we get j|yj | <
j + θ(R) and
∣∣yj∣∣ < rj := 1 +
θ(R)j
(j = 1, . . . , n
). (1.17)
Thus (1.1) has in the disc {z ∈ C : |z| ≤ rj} no more than n− j Y -root coordinates. If we denoteby νY (r) the number of Y -root coordinates of (1.1) in Ωr := {z ∈ C : |z| ≤ r} for a positivenumber r, then we get
Corollary 1.3. Under condition (1.10), the inequality νY (r) ≤ n − j + 1 is valid for any
r ≤ 1 +θ(R)j
. (1.18)
Similarly, by Theorem 1.2, we get the inequality:
∣∣xj(y0)∣∣ ≤ 1 +
ψf
j
(j = 1, 2, . . . ,min{m1, m2}
). (1.19)
Denote by νX(y0, r) the number of X-root coordinates of (1.1) in Ωr , corresponding to a Ycoordinate y0.
Corollary 1.4. Under conditions (1.14), for any Y -root coordinate y0, the inequality:
νX(y0, r
) ≤ min{m1, m2} − j + 1(j = 1, 2, . . . ,min{m1, m2}
)(1.20)
International Journal of Mathematics and Mathematical Sciences 5
is valid, provided
r ≤ 1 +ψf
j. (1.21)
In this corollary also one can replace f by g.
2. Proofs of Theorems 1.1 and 1.2
First, we need the following result.
Lemma 2.1. Let P(z) := zn + c1zn−1 + · · · + cn be a polynomial with complex coefficients. Then itsroots zk(P) ordered in the decreasing way satisfy the inequalities:
j∑
k=1
|zk(P)| ≤[
12π
∫2π
0
∣∣∣P(eit)∣∣∣
2dt − 1
]1/2+ j
(j = 1, . . . , n
). (2.1)
Proof. As it is proved in [9, Theorem 4.3.1] (see also [10]),
j∑
k=1
|zk(P)| ≤[
n∑
k=1
|ck|2]1/2
+ j. (2.2)
But thanks to the Parseval equality, we have
n∑
k=1
|ck|2 + 1 =12π
∫2π
0
∣∣∣P(eit)∣∣∣
2dt. (2.3)
Hence the required result follows.
Proof of Theorem 1.1. The bound (1.11) follows from the previous lemma with P(y) =R(y)/R0. To derive bound (1.12) note that
R(y)= Rny
nW
(1y
), where W(z) =
1Rn
n∑
k=0
Rkzk =
n∑
k=0
dkzn−k, (2.4)
with dk = Rn−k/Rn. So any zero z(W) ofW(z) is equal to 1/y, where y is a zero of R(y). Bythe previous lemma
j∑
k=1
|zk(W)| <[
12π
∫2π
0
∣∣∣W(eit)∣∣∣
2dt − 1
]1/2+ j
(j = 1, . . . , n
). (2.5)
6 International Journal of Mathematics and Mathematical Sciences
Thus,
j∑
k=1
1∣∣yk∣∣ <
[12π
∫2π
0
∣∣∣W(eit)∣∣∣2dt − 1
]1/2+ j
(j = 1, . . . , n
). (2.6)
But W(z) = znR(1/z)/Rn. Thus, |W(eit)| = (1/Rn)|R(e−it)|. This proves the required result.
Proof of Theorem 1.2. Due to Theorem 1.1, for any fixed Y -root coordinate y0 we have theinequality:
∣∣y0∣∣ ≤ θ(R) + 1. (2.7)
We seek the zeros of the polynomial:
f(x, y0
)=
m1∑
j=0
aj(y0)xm1−j . (2.8)
Besides, due to (1.14) and (2.7), a0(y0)/= 0. Put
Q(x) =f(x, y0
)
a0(y0) , θQ :=
1∣∣a0(y0)∣∣
⎡
⎣m1∑
j=1
∣∣aj(y0)∣∣2⎤
⎦
1/2
. (2.9)
Clearly,
Q(x) = xm1 +1
a0(y0)m1∑
j=1
aj(y0)xm1−j . (2.10)
Due to the above mentioned [9, Theorem 4.3.1] we have
j∑
k=1
∣∣xk(y0)∣∣ < θQ + j
(j = 1, 2, . . . , n
). (2.11)
But according to (2.7), θQ ≤ ψf . This proves the theorem.
3. Perturbations of Roots
Together with (1.1), let us consider the coupled system:
f(x, y)= g(x, y)= 0, (3.1)
International Journal of Mathematics and Mathematical Sciences 7
where
f(x, y)=
m1∑
j=0
n1∑
k=0
ajkxm1−jyn1−k,
g(x, y)=
m2∑
j=0
n2∑
k=0
bjkxm2−jyn2−k.
(3.2)
Here ajk, bjk are complex coefficients. Put
aj(y)=
n1∑
k=1
ajkyn1−k (
j = 0, . . . , m1),
bj(y)=
n2∑
k=0
bjkyn2−k (
j = 0, . . . , m2).
(3.3)
Let S(y) be the Sylvester matrix defined as above with aj(y) instead of aj(y), and bj(y)instead of bj(y), and put R(y) = det S(y). It is assumed that
deg R(y)= degR
(y)= n. (3.4)
Consider the expansion:
R(y)=
n∑
k=0
Rkyn−k. (3.5)
Due to (3.4), R0 /= 0. Denote
q(R, R
):=
⎡
⎣ 12π
∫2π
0
∣∣∣∣∣R(eit)R0
− R(eit)
R0
∣∣∣∣∣
2
dt
⎤
⎦
1/2
,
η(R) =[θ2(R) + n − 1
]1/2.
(3.6)
Clearly,
q(R, R
)≤ max
|z|=1
∣∣∣∣∣R(y)
R0− R(y)
R0
∣∣∣∣∣. (3.7)
Theorem 3.1. Under condition (3.4), for any Y -root coordinate y0 of (3.1), there is a Y -rootcoordinate y0 of (1.1), such that
∣∣y0 − y0∣∣ ≤ μR, (3.8)
8 International Journal of Mathematics and Mathematical Sciences
where μR is the unique positive root of the equation:
yn = q(R, R
)n−1∑
k=0
ηk(R)yn−k−1√k!
. (3.9)
To prove Theorem 3.1, for a finite integer n, consider the polynomials:
P(λ) =n∑
k=0
ckλn−k, P(λ) =
n∑
k=0
ckλn−k (c0 = c0 = 1), (3.10)
with complex coefficients. Put
q0 =
[n∑
k=1
|ck − ck|2]1/2
,
η(P) =
[n∑
k=1
|ck|2 + n − 1
]1/2.
(3.11)
Lemma 3.2. For any root z(P) of P(y), there is a root z(P) of P(y), such that |z(P)−z(P)| ≤ r(q0),where r(q0) is the unique positive root of the equation
yn = q0n−1∑
k=0
ηk(P)yn−k−1√k!
. (3.12)
This result is due to Theorem 4.9.1 from the book [9] and inequality (9.2) on page 103of that book.
By the Parseval equality we have
n∑
k=0
|ck|2 = 12π
∫2π
0
∣∣∣P(eit)∣∣∣
2dt,
q20 =12π
∫2π
0
∣∣∣P(eit)− P(eit)∣∣∣
2dt ≤ max
|z|=1
∣∣∣P(y) − P(y)
∣∣∣2.
(3.13)
Thus
η2(P) =12π
∫2π
0
∣∣∣P(eit)∣∣∣
2dt + n − 2 ≤ max
|z|=1
∣∣P(y)∣∣2 + n − 2. (3.14)
The assertion of Theorem 3.1 now follows from in the previous lemma with P(y) =R(y)/R0 andP(y) = R(y)/R0.
International Journal of Mathematics and Mathematical Sciences 9
Further more, denote
pR := q(R, R
)n−1∑
k=0
ηk(R)√k!
,
δR :=
{n√pR if pR ≤ 1,
pR if pR > 1.
(3.15)
Due to Lemma 1.6.1 from [11], the inequality μR ≤ δR is valid. Now Theorem 3.1 implies thefollowing.
Corollary 3.3. Under condition (3.4), for any Y -root coordinate y0 of (3.1), there is a Y -rootcoordinate y0 of (1.1), such that |y0 − y0| ≤ δR.
Similarly, one can consider perturbations of the X-root root coordinates.To evaluate the quantity R(y) − R(y) one can use the following result: let A and B two
complex n × n-matrices. Then
|det(A) − det(B)| ≤ N2(A − B)nn/2
(1 +
12(N2(A + B) +N2(A − B))
)n, (3.16)
where N22(A) = TraceA∗A is the Hilbert-Schmidt norm and A∗ is the adjoint to A. For the
proof of this inequality see [12]. Taking B = S(y), A = S(y)we get a bound for |R(z) − R(z)|.
References
[1] I. M. Gel’fand, M. M. Kapranov, and A. V. Zelevinsky, Discriminants, Resultants, and MultidimensionalDeterminants, Mathematics: Theory & Applications, Birkhauser, Boston, Mass, USA, 1994.
[2] B. Sturmfels, “Solving algebraic equations in terms ofA-hypergeometric series,”Discrete Mathematics,vol. 210, no. 1–3, pp. 171–181, 2000.
[3] B. Mourrain, “Computing the isolated roots by matrix methods,” Journal of Symbolic Computation, vol.26, no. 6, pp. 715–738, 1998, Symbolic numeric algebra for polynomials.
[4] B. Sturmfels, Solving Systems of Polynomial Equations, vol. 97 of CBMS Regional Conference Series inMathematics, American Mathematical Society, Providence, RI, USA, 2002.
[5] W. Forster, “Homotopies for systems of polynomial equations,” Acta Mathematica Vietnamica, vol. 22,no. 1, pp. 107–122, 1997.
[6] J. McDonald, “Fiber polytopes and fractional power series,” Journal of Pure and Applied Algebra, vol.104, no. 2, pp. 213–233, 1995.
[7] J. McDonald, “Fractional power series solutions for systems of equations,” Discrete & ComputationalGeometry, vol. 27, no. 4, pp. 501–529, 2002.
[8] Z. K. Wang, S. L. Xu, and T. A. Gao,Algebraic Systems of Equations and Computational Complexity Theory,vol. 269 ofMathematics and Its Applications, Kluwer Academic Publishers, Dordrecht, TheNetherlands,1994.
[9] M. Gil’, Localization and Perturbation of Zeros of Entire Functions, vol. 258 of Lecture Notes in Pure andApplied Mathematics, CRC Press, Boca Raton, Fla, USA, 2010.
[10] M. I. Gil’, “Bounds for counting functions of finite order entire functions,” Complex Variables andElliptic Equations, vol. 52, no. 4, pp. 273–286, 2007.
[11] M. I. Gil’, Operator Functions and Localization of Spectra, vol. 1830 of Lecture Notes in Mathematics,Springer, Berlin, Germany, 2003.
[12] M. I. Gil’, “A bound for functions defined on a normed space,” Journal of Physics A, vol. 40, no. 15, pp.4087–4091, 2007.
Submit your manuscripts athttp://www.hindawi.com
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
MathematicsJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Mathematical Problems in Engineering
Hindawi Publishing Corporationhttp://www.hindawi.com
Differential EquationsInternational Journal of
Volume 2014
Applied MathematicsJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Probability and StatisticsHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Journal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Mathematical PhysicsAdvances in
Complex AnalysisJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
OptimizationJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
CombinatoricsHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
International Journal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Operations ResearchAdvances in
Journal of
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Function Spaces
Abstract and Applied AnalysisHindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
International Journal of Mathematics and Mathematical Sciences
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
The Scientific World JournalHindawi Publishing Corporation http://www.hindawi.com Volume 2014
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Algebra
Discrete Dynamics in Nature and Society
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Decision SciencesAdvances in
Discrete MathematicsJournal of
Hindawi Publishing Corporationhttp://www.hindawi.com
Volume 2014 Hindawi Publishing Corporationhttp://www.hindawi.com Volume 2014
Stochastic AnalysisInternational Journal of