Introduction
More than 200 years ago, Lagrange derived an upper bound for the zeros of complex polynomials [10 , 13 ] . This bound was later found independently by Fujiwara [5 ] in 1916.
Theorem 1.1. [5 , 6 , 10 , 13 ] (Lagrange-Fujiwara Upper Bound ) Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ C [ z ] . p(z) = a_0 + a_1 z + \cdots+ a_{n-1}z^{n-1} + z^n \in\mathbb{C}[z]. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ C [ z ] . If λ ∈ C \lambda\in\mathbb{C} λ ∈ C satisfies p ( λ ) = 0 p(\lambda) = 0 p ( λ ) = 0 , then
∣ λ ∣ < 2 max 0 ≤ j ≤ n − 1 ∣ a j ∣ 1 n − j . |\lambda| < 2 \max_{0 \leq j \leq n-1} |a_j|^{\frac{1}{n-j}}. ∣ λ ∣ < 2 0 ≤ j ≤ n − 1 max ∣ a j ∣ n − j 1 .
Corollary 1.2. [5 , 6 , 10 , 13 ] (Lagrange-Fujiwara Upper Bound ) Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ C [ z ] , a n ≠ 0. p(z) = a_0 + a_1 z + \cdots+ a_{n-1}z^{n-1} + a_nz^n \in\mathbb{C}[z], \qquad a_n \ne0. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ C [ z ] , a n = 0. If λ ∈ C \lambda\in\mathbb{C} λ ∈ C satisfies p ( λ ) = 0 p(\lambda) = 0 p ( λ ) = 0 , then
∣ λ ∣ < 2 max 0 ≤ j ≤ n − 1 ∣ a j a n ∣ 1 n − j . |\lambda| < 2 \max_{0 \leq j \leq n-1} \left|\frac{a_j}{a_n}\right|^{\frac{1}{n-j}}. ∣ λ ∣ < 2 0 ≤ j ≤ n − 1 max a n a j n − j 1 .
Corollary 1.2 gives the following result.
Theorem 1.3. [5 , 6 , 10 , 13 ] (Lagrange-Fujiwara Lower Bound )
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ C [ z ] , a 0 ≠ 0 , a n ≠ 0. p(z) = a_0 + a_1 z + \cdots+ a_{n-1}z^{n-1} + a_nz^n \in\mathbb{C}[z], \qquad a_0 \ne0, \ a_n \ne0. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ C [ z ] , a 0 = 0 , a n = 0.
If λ ∈ C \lambda\in\mathbb{C} λ ∈ C satisfies p ( λ ) = 0 p(\lambda)=0 p ( λ ) = 0 , then
∣ λ ∣ > 1 2 max 1 ≤ j ≤ n ∣ a j a 0 ∣ 1 j |\lambda|>\frac{1}{2\max_{1\leq j\leq n}\left|\frac{a_j}{a_0}\right|^{\frac{1}{j}}} ∣ λ ∣ > 2 max 1 ≤ j ≤ n a 0 a j j 1 1
In 1914, Carmichael and Mason derived the following beautiful upper bound (using Hadamard theorem for determinants) for every root of a complex polynomial using the sum of the squares of the absolute values of the coefficients [3 ] .
Theorem 1.4. [3 , 4 , 8 , 11 ] (Carmichael-Mason Upper Bound ) Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ C [ z ] . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+z^n\in\mathbb{C}[z]. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ C [ z ] . If λ ∈ C \lambda\in\mathbb{C} λ ∈ C satisfies p ( λ ) = 0 p(\lambda)=0 p ( λ ) = 0 , then
∣ λ ∣ < ( 1 + ∑ j = 0 n − 1 ∣ a j ∣ 2 ) 1 2 . |\lambda|<\left(1+\sum_{j=0}^{n-1}|a_j|^2\right)^{\frac{1}{2}}. ∣ λ ∣ < ( 1 + j = 0 ∑ n − 1 ∣ a j ∣ 2 ) 2 1 .
In 1916, Kuniyeda improved Theorem 1.4 using the Holder inequality [7 ] .
Theorem 1.5. [1 , 2 , 7 , 8 , 9 , 11 , 12 ] (Kuniyeda Upper Bound ) Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ C [ z ] . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+z^n\in\mathbb{C}[z]. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ C [ z ] . If λ ∈ C \lambda\in\mathbb{C} λ ∈ C satisfies p ( λ ) = 0 p(\lambda)=0 p ( λ ) = 0 , then
∣ λ ∣ < ( 1 + ( ∑ j = 0 n − 1 ∣ a j ∣ s ) 1 s − 1 ) s − 1 s , ∀ s ∈ ( 1 , ∞ ) . |\lambda|<\left(1+\left(\sum_{j=0}^{n-1}|a_j|^s\right)^{\frac{1}{s-1}}\right)^{\frac{s-1}{s}},\qquad\forall s\in(1,\infty). ∣ λ ∣ < 1 + ( j = 0 ∑ n − 1 ∣ a j ∣ s ) s − 1 1 s s − 1 , ∀ s ∈ ( 1 , ∞ ) .
Corollary 1.6. [1 , 2 , 7 , 8 , 9 , 11 , 12 ] (Kuniyeda Upper Bound ) Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ C [ z ] , a n ≠ 0. p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+a_nz^n\in\mathbb{C}[z],\quad a_n\ne0. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ C [ z ] , a n = 0. If λ ∈ C \lambda\in\mathbb{C} λ ∈ C satisfies p ( λ ) = 0 p(\lambda)=0 p ( λ ) = 0 , then
∣ λ ∣ < ( 1 + ( ∑ j = 0 n − 1 ∣ a j a n ∣ s ) 1 s − 1 ) s − 1 s = ( 1 + ( 1 ∣ a n ∣ s ∑ j = 0 n − 1 ∣ a j ∣ s ) 1 s − 1 ) s − 1 s , ∀ s ∈ ( 1 , ∞ ) . |\lambda|<\left(1+\left(\sum_{j=0}^{n-1}\left|\frac{a_j}{a_n}\right|^s\right)^{\frac{1}{s-1}}\right)^{\frac{s-1}{s}}=\left(1+\left(\frac{1}{|a_n|^s}\sum_{j=0}^{n-1}|a_j|^s\right)^{\frac{1}{s-1}}\right)^{\frac{s-1}{s}},\qquad\forall s\in(1,\infty). ∣ λ ∣ < 1 + ( j = 0 ∑ n − 1 a n a j s ) s − 1 1 s s − 1 = 1 + ( ∣ a n ∣ s 1 j = 0 ∑ n − 1 ∣ a j ∣ s ) s − 1 1 s s − 1 , ∀ s ∈ ( 1 , ∞ ) .
Corollary 1.6 gives the following result.
Theorem 1.7. [1 , 2 , 7 , 8 , 9 , 11 , 12 ] (Kuniyeda Lower Bound ) Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ C [ z ] , a 0 ≠ 0 , a n ≠ 0. p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+a_nz^n\in\mathbb{C}[z],\quad a_0\ne0,a_n\ne0. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ C [ z ] , a 0 = 0 , a n = 0. If λ ∈ C \lambda\in\mathbb{C} λ ∈ C satisfies p ( λ ) = 0 p(\lambda)=0 p ( λ ) = 0 , then
∣ λ ∣ > 1 ( 1 + ( 1 ∣ a 0 ∣ s ∑ j = 1 n ∣ a j ∣ s ) 1 s − 1 ) s − 1 s , ∀ s ∈ ( 1 , ∞ ) . |\lambda|>\frac{1}{\left(1+\left(\frac{1}{|a_0|^s}\sum_{j=1}^{n}|a_j|^s\right)^{\frac{1}{s-1}}\right)^{\frac{s-1}{s}}},\qquad\forall s\in(1,\infty). ∣ λ ∣ > ( 1 + ( ∣ a 0 ∣ s 1 ∑ j = 1 n ∣ a j ∣ s ) s − 1 1 ) s s − 1 1 , ∀ s ∈ ( 1 , ∞ ) .
We naturally ask for versions of Theorems 1.1 and 1.5 for polynomials over Banach algebras (particularly, over C*-algebras). In this article, we derive them.
Noncommutative Lagrange-Fujiwara, Carmichael-Mason and Kuniyeda Bounds
Let A \mathcal{A} A be a unital Banach algebra and A [ z ] \mathcal{A}[z] A [ z ] be the set of all polynomials over A \mathcal{A} A . We derive a noncommutative version of Theorem 1.1 as follows.
Theorem 2.1. (Noncommutative Lagrange-Fujiwara Upper Bound ) Let A \mathcal{A} A be a unital Banach algebra. Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ A [ z ] . p(z) = a_0 + a_1 z + \cdots+ a_{n-1}z^{n-1} + z^n \in\mathcal{A}[z]. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ A [ z ] . Let u ∈ A u \in\mathcal{A} u ∈ A be such that p ( u ) = 0 p(u)=0 p ( u ) = 0 and
∥ u n ∥ = ∥ u ∥ n . (1) \lVert u^n\rVert= \lVert u\rVert^n. \tag*{(1)} ∥ u n ∥ = ∥ u ∥ n . (1) Then
∥ u ∥ < 2 max 0 ≤ j ≤ n − 1 ∥ a j ∥ 1 n − j . \lVert u\rVert< 2 \max_{0\leq j\leq n-1} \lVert a_j\rVert^{\frac{1}{n-j}}. ∥ u ∥ < 2 0 ≤ j ≤ n − 1 max ∥ a j ∥ n − j 1 .
Proof. Let u ∈ A u \in\mathcal{A} u ∈ A satisfies p ( u ) = 0 p(u)=0 p ( u ) = 0 and ∥ u n ∥ = ∥ u ∥ n \lVert u^n\rVert= \lVert u\rVert^n ∥ u n ∥ = ∥ u ∥ n . Define
M : = max 0 ≤ j ≤ n − 1 ∥ a j ∥ 1 n − j . M := \max_{0\leq j\leq n-1} \lVert a_j\rVert^{\frac{1}{n-j}}. M := 0 ≤ j ≤ n − 1 max ∥ a j ∥ n − j 1 .
Then we have
M n − j ( 2 ) ≥ ∥ a j ∥ , ∀ 0 ≤ j ≤ n − 1. (2) M^{n-j}(2) \geq\lVert a_j\rVert,\qquad\forall\,0\leq j\leq n-1. \tag*{(2)} M n − j ( 2 ) ≥ ∥ a j ∥ , ∀ 0 ≤ j ≤ n − 1. (2)
If ∥ u ∥ ≤ M \lVert u\rVert\leq M ∥ u ∥ ≤ M , then the conclusion holds. Hence we assume that ∥ u ∥ > M \lVert u\rVert> M ∥ u ∥ > M . Since p ( u ) = 0 p(u)=0 p ( u ) = 0 , we have
u n = − ( a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ) . u^n = -(a_0+a_1u+\cdots+a_{n-1}u^{n-1}). u n = − ( a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ) .
By taking the norm and using Equation (1) , we get
∥ u ∥ n = ∥ u n ∥ = ∥ − ( a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ) ∥ = ∥ a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 u ∥ + ⋯ + ∥ a n − 1 u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 ∥ ∥ u ∥ + ⋯ + ∥ a n − 1 ∥ ∥ u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 ∥ ∥ u ∥ + ⋯ + ∥ a n − 1 ∥ ∥ u ∥ n − 1 . \begin{aligned}
\lVert u\rVert^n
&= \lVert u^n\rVert
= \lVert-(a_0+a_1u+\cdots+a_{n-1}u^{n-1})\rVert\\
&= \lVert a_0+a_1u+\cdots+a_{n-1}u^{n-1}\rVert\\
&\leq\lVert a_0\rVert+\lVert a_1u\rVert+\cdots+\lVert a_{n-1}u^{n-1}\rVert\\
&\leq\lVert a_0\rVert+\lVert a_1\rVert\lVert u\rVert+\cdots+\lVert a_{n-1}\rVert\lVert u^{n-1}\rVert\\
&\leq\lVert a_0\rVert+\lVert a_1\rVert\lVert u\rVert+\cdots+\lVert a_{n-1}\rVert\lVert u\rVert^{n-1}.
\end{aligned} ∥ u ∥ n = ∥ u n ∥ = ∥ − ( a 0 + a 1 u + ⋯ + a n − 1 u n − 1 )∥ = ∥ a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 u ∥ + ⋯ + ∥ a n − 1 u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 ∥ ∥ u ∥ + ⋯ + ∥ a n − 1 ∥ ∥ u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 ∥ ∥ u ∥ + ⋯ + ∥ a n − 1 ∥ ∥ u ∥ n − 1 .
Dividing by ∥ u ∥ n \lVert u\rVert^n ∥ u ∥ n and by using Equation (2) we get
1 ≤ ∥ a 0 ∥ ∥ u ∥ n + ∥ a 1 ∥ ∥ u ∥ n − 1 + ⋯ + ∥ a n − 2 ∥ ∥ u ∥ 2 + ∥ a n − 1 ∥ ∥ u ∥ ≤ M n ∥ u ∥ n + M n − 1 ∥ u ∥ n − 1 + ⋯ + M 2 ∥ u ∥ 2 + M ∥ u ∥ = M ∥ u ∥ ( ( M ∥ u ∥ ) n − 1 + ( M ∥ u ∥ ) n − 2 + ⋯ + M ∥ u ∥ + 1 ) = M ∥ u ∥ ( 1 − ( M ∥ u ∥ ) n 1 − M ∥ u ∥ ) < M ∥ u ∥ ( 1 1 − M ∥ u ∥ ) = M ∥ u ∥ − M . \begin{aligned}
1 &\le\frac{\lVert a_0\rVert}{\lVert u\rVert^n}+\frac{\lVert a_1\rVert}{\lVert u\rVert^{n-1}}+\cdots+\frac{\lVert a_{n-2}\rVert}{\lVert u\rVert^2}+\frac{\lVert a_{n-1}\rVert}{\lVert u\rVert}\\
&\le\frac{M^n}{\lVert u\rVert^n}+\frac{M^{n-1}}{\lVert u\rVert^{n-1}}+\cdots+\frac{M^2}{\lVert u\rVert^2}+\frac{M}{\lVert u\rVert}\\
&=\frac{M}{\lVert u\rVert}\left(\left(\frac{M}{\lVert u\rVert}\right)^{n-1}+\left(\frac{M}{\lVert u\rVert}\right)^{n-2}+\cdots+\frac{M}{\lVert u\rVert}+1\right)\\
&=\frac{M}{\lVert u\rVert}\left(\frac{1-\left(\frac{M}{\lVert u\rVert}\right)^n}{1-\frac{M}{\lVert u\rVert}}\right)\\
&<\frac{M}{\lVert u\rVert}\left(\frac{1}{1-\frac{M}{\lVert u\rVert}}\right)\\
&=\frac{M}{\lVert u\rVert-M}.
\end{aligned} 1 ≤ ∥ u ∥ n ∥ a 0 ∥ + ∥ u ∥ n − 1 ∥ a 1 ∥ + ⋯ + ∥ u ∥ 2 ∥ a n − 2 ∥ + ∥ u ∥ ∥ a n − 1 ∥ ≤ ∥ u ∥ n M n + ∥ u ∥ n − 1 M n − 1 + ⋯ + ∥ u ∥ 2 M 2 + ∥ u ∥ M = ∥ u ∥ M ( ( ∥ u ∥ M ) n − 1 + ( ∥ u ∥ M ) n − 2 + ⋯ + ∥ u ∥ M + 1 ) = ∥ u ∥ M 1 − ∥ u ∥ M 1 − ( ∥ u ∥ M ) n < ∥ u ∥ M ( 1 − ∥ u ∥ M 1 ) = ∥ u ∥ − M M .
Hence
1 < M ∥ u ∥ − M . 1<\frac{M}{\lVert u\rVert-M}. 1 < ∥ u ∥ − M M .
Rearranging completes the proof. □
Note that we used the condition (1) in the proof of Theorem 2.1 . We are unable to derive the result without this assumption.
Corollary 2.2. (Noncommutative Lagrange-Fujiwara Upper Bound ) Let A A A be a unital Banach algebra. Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a n is invertible . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+a_nz^n\in A[z],\qquad a_n\text{ is invertible}. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a n is invertible . Let u ∈ A u\in A u ∈ A be such that p ( u ) = 0 p(u)=0 p ( u ) = 0 and
∥ u n ∥ = ∥ u ∥ n . \lVert u^n\rVert=\lVert u\rVert^n. ∥ u n ∥ = ∥ u ∥ n . Then
∥ u ∥ < 2 max 0 ≤ j ≤ n − 1 ∥ a n − 1 a j ∥ 1 n − j . \lVert u\rVert<2\max_{0\le j\le n-1}\left\lVert a_n^{-1}a_j\right\rVert^{\frac{1}{n-j}}. ∥ u ∥ < 2 0 ≤ j ≤ n − 1 max a n − 1 a j n − j 1 .
Corollary 2.3. Let A A A be a unital C ∗ C^* C ∗ -algebra. Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a n is invertible . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+a_nz^n\in A[z],\qquad a_n\text{ is invertible}. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a n is invertible . Let u ∈ A u\in A u ∈ A be such that p ( u ) = 0 p(u)=0 p ( u ) = 0 and u u u is normal or self-adjoint. Then
∥ u ∥ < 2 max 0 ≤ j ≤ n − 1 ∥ a n − 1 a j ∥ 1 n − j . \lVert u\rVert<2\max_{0\le j\le n-1}\left\lVert a_n^{-1}a_j\right\rVert^{\frac{1}{n-j}}. ∥ u ∥ < 2 0 ≤ j ≤ n − 1 max a n − 1 a j n − j 1 .
Corollary 2.4. (Noncommutative Lagrange-Fujiwara Lower Bound ) Let A A A be a unital Banach algebra. Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a 0 and a n are invertible . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+a_nz^n\in A[z],\qquad a_0\text{ and }a_n\text{ are invertible}. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a 0 and a n are invertible . Let u ∈ A u\in A u ∈ A be such that p ( u ) = 0 p(u)=0 p ( u ) = 0 , u u u is invertible and
∥ ( u − 1 ) n ∥ = ∥ u − 1 ∥ n . \lVert(u^{-1})^n\rVert=\lVert u^{-1}\rVert^n. ∥( u − 1 ) n ∥ = ∥ u − 1 ∥ n .
Then
1 ∥ u − 1 ∥ > 1 2 max 1 ≤ j ≤ n ∥ a 0 − 1 a j ∥ 1 j . \frac{1}{\lVert u^{-1}\rVert}>\frac{1}{2\max_{1\le j\le n}\lVert a_0^{-1}a_j\rVert^{\frac{1}{j}}}. ∥ u − 1 ∥ 1 > 2 max 1 ≤ j ≤ n ∥ a 0 − 1 a j ∥ j 1 1 .
Proof. Since u u u is invertible, we have
0 = a n + a n − 1 u − 1 + ⋯ + a 1 u − ( n − 1 ) + a 0 u − n . 0=a_n+a_{n-1}u^{-1}+\cdots+a_1u^{-(n-1)}+a_0u^{-n}. 0 = a n + a n − 1 u − 1 + ⋯ + a 1 u − ( n − 1 ) + a 0 u − n .
Define v : = u − 1 v:=u^{-1} v := u − 1 . Then
0 = a n + a n − 1 v + ⋯ + a 1 v n − 1 + a 0 v n . 0=a_n+a_{n-1}v+\cdots+a_1v^{n-1}+a_0v^n. 0 = a n + a n − 1 v + ⋯ + a 1 v n − 1 + a 0 v n .
Result follows by applying Corollary 2.2 to v v v . □
We derive a noncommutative version of Theorem 1.5 as follows.
Theorem 2.5. (Noncommutative Kuniyeda Upper Bound ) Let A A A be a unital Banach algebra. Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ A [ z ] . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+z^n\in A[z]. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + z n ∈ A [ z ] . Let u ∈ A u\in A u ∈ A be such that p ( u ) = 0 p(u)=0 p ( u ) = 0 and
∥ u n ∥ = ∥ u ∥ n . (3) \lVert u^n\rVert=\lVert u\rVert^n. \tag*{(3)} ∥ u n ∥ = ∥ u ∥ n . (3) Then
∥ u ∥ < ( 1 + ( ∑ j = 0 n − 1 ∥ a j ∥ s ) 1 s − 1 ) s − 1 s , ∀ s ∈ ( 1 , ∞ ) . \lVert u\rVert<\left(1+\left(\sum_{j=0}^{n-1}\lVert a_j\rVert^s\right)^{\frac{1}{s-1}}\right)^{\frac{s-1}{s}},\qquad\forall s\in(1,\infty). ∥ u ∥ < 1 + ( j = 0 ∑ n − 1 ∥ a j ∥ s ) s − 1 1 s s − 1 , ∀ s ∈ ( 1 , ∞ ) . Proof. Let s ∈ ( 1 , ∞ ) s\in(1,\infty) s ∈ ( 1 , ∞ ) . Define
M : = ( ∑ j = 0 n − 1 ∥ a j ∥ s ) 1 s − 1 . M:=\left(\sum_{j=0}^{n-1}\lVert a_j\rVert^s\right)^{\frac{1}{s-1}}. M := ( j = 0 ∑ n − 1 ∥ a j ∥ s ) s − 1 1 . Let u ∈ A u\in A u ∈ A satisfies p ( u ) = 0 p(u)=0 p ( u ) = 0 and ∥ u n ∥ = ∥ u ∥ n \lVert u^n\rVert=\lVert u\rVert^n ∥ u n ∥ = ∥ u ∥ n . We claim that
∥ u ∥ < ( 1 + M ) s − 1 s . \lVert u\rVert<(1+M)^{\frac{s-1}{s}}. ∥ u ∥ < ( 1 + M ) s s − 1 . Let us suppose that the claim fails. Then
∥ u ∥ ≥ ( 1 + M ) s − 1 s > 1. \lVert u\rVert\ge(1+M)^{\frac{s-1}{s}}>1. ∥ u ∥ ≥ ( 1 + M ) s s − 1 > 1. Since p ( u ) = 0 p(u)=0 p ( u ) = 0 , we have
u n = − ( a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ) . u^n=-(a_0+a_1u+\cdots+a_{n-1}u^{n-1}). u n = − ( a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ) .
By taking the norm, using the Holder inequality and using Equation (3) , we get
∥ u ∥ n = ∥ u n ∥ = ∥ − ( a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ) ∥ = ∥ a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 u ∥ + ⋯ + ∥ a n − 1 u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 ∥ ∥ u ∥ + ⋯ + ∥ a n − 1 ∥ ∥ u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 ∥ ∥ u ∥ + ⋯ + ∥ a n − 1 ∥ ∥ u ∥ n − 1 = ∑ j = 0 n − 1 ∥ a j ∥ ∥ u ∥ j ≤ ( ∑ j = 0 n − 1 ∥ a j ∥ s ) 1 s ( ∑ j = 0 n − 1 ( ∥ u ∥ j ) s s − 1 ) s − 1 s = M s − 1 s ( ∑ j = 0 n − 1 ( ∥ u ∥ s s − 1 ) j ) s − 1 s = M s − 1 s ( ( ∥ u ∥ s s − 1 ) n − 1 ∥ u ∥ s s − 1 − 1 ) s − 1 s = M s − 1 s ( ∥ u ∥ n s s − 1 − 1 ∥ u ∥ s s − 1 − 1 ) s − 1 s . \begin{aligned}
\lVert u\rVert^n &= \lVert u^n\rVert= \lVert-(a_0+a_1u+\cdots+a_{n-1}u^{n-1})\rVert\\
&= \lVert a_0+a_1u+\cdots+a_{n-1}u^{n-1}\rVert\\
&\le\lVert a_0\rVert+\lVert a_1u\rVert+\cdots+\lVert a_{n-1}u^{n-1}\rVert\\
&\le\lVert a_0\rVert+\lVert a_1\rVert\lVert u\rVert+\cdots+\lVert a_{n-1}\rVert\lVert u^{n-1}\rVert\\
&\le\lVert a_0\rVert+\lVert a_1\rVert\lVert u\rVert+\cdots+\lVert a_{n-1}\rVert\lVert u\rVert^{n-1}\\
&=\sum_{j=0}^{n-1}\lVert a_j\rVert\lVert u\rVert^j\\
&\le\left(\sum_{j=0}^{n-1}\lVert a_j\rVert^s\right)^{\frac{1}{s}}\left(\sum_{j=0}^{n-1}\left(\lVert u\rVert^j\right)^{\frac{s}{s-1}}\right)^{\frac{s-1}{s}}\\
&=M^{\frac{s-1}{s}}\left(\sum_{j=0}^{n-1}\left(\lVert u\rVert^{\frac{s}{s-1}}\right)^j\right)^{\frac{s-1}{s}}\\
&=M^{\frac{s-1}{s}}\left(\frac{\left(\lVert u\rVert^{\frac{s}{s-1}}\right)^n-1}{\lVert u\rVert^{\frac{s}{s-1}}-1}\right)^{\frac{s-1}{s}}\\
&=M^{\frac{s-1}{s}}\left(\frac{\lVert u\rVert^{\frac{ns}{s-1}}-1}{\lVert u\rVert^{\frac{s}{s-1}}-1}\right)^{\frac{s-1}{s}}.
\end{aligned} ∥ u ∥ n = ∥ u n ∥ = ∥ − ( a 0 + a 1 u + ⋯ + a n − 1 u n − 1 )∥ = ∥ a 0 + a 1 u + ⋯ + a n − 1 u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 u ∥ + ⋯ + ∥ a n − 1 u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 ∥ ∥ u ∥ + ⋯ + ∥ a n − 1 ∥ ∥ u n − 1 ∥ ≤ ∥ a 0 ∥ + ∥ a 1 ∥ ∥ u ∥ + ⋯ + ∥ a n − 1 ∥ ∥ u ∥ n − 1 = j = 0 ∑ n − 1 ∥ a j ∥ ∥ u ∥ j ≤ ( j = 0 ∑ n − 1 ∥ a j ∥ s ) s 1 ( j = 0 ∑ n − 1 ( ∥ u ∥ j ) s − 1 s ) s s − 1 = M s s − 1 ( j = 0 ∑ n − 1 ( ∥ u ∥ s − 1 s ) j ) s s − 1 = M s s − 1 ( ∥ u ∥ s − 1 s − 1 ( ∥ u ∥ s − 1 s ) n − 1 ) s s − 1 = M s s − 1 ( ∥ u ∥ s − 1 s − 1 ∥ u ∥ s − 1 n s − 1 ) s s − 1 .
Hence
∥ u ∥ n s s − 1 ≤ M ∥ u ∥ n s s − 1 − 1 ∥ u ∥ s s − 1 − 1 . \lVert u\rVert^{\frac{ns}{s-1}}\le M\frac{\lVert u\rVert^{\frac{ns}{s-1}}-1}{\lVert u\rVert^{\frac{s}{s-1}}-1}. ∥ u ∥ s − 1 n s ≤ M ∥ u ∥ s − 1 s − 1 ∥ u ∥ s − 1 n s − 1 .
Rearranging,
∥ u ∥ s s − 1 − 1 ≤ M ∥ u ∥ n s s − 1 − 1 ∥ u ∥ n s s − 1 = M ( 1 − 1 ∥ u ∥ n s s − 1 ) < M . \lVert u\rVert^{\frac{s}{s-1}}-1\le M\frac{\lVert u\rVert^{\frac{ns}{s-1}}-1}{\lVert u\rVert^{\frac{ns}{s-1}}}=M\left(1-\frac{1}{\lVert u\rVert^{\frac{ns}{s-1}}}\right)<M. ∥ u ∥ s − 1 s − 1 ≤ M ∥ u ∥ s − 1 n s ∥ u ∥ s − 1 n s − 1 = M ( 1 − ∥ u ∥ s − 1 n s 1 ) < M .
Therefore
( 1 + M ) s − 1 s ≤ ∥ u ∥ < ( 1 + M ) s − 1 s (1+M)^{\frac{s-1}{s}}\le\lVert u\rVert<(1+M)^{\frac{s-1}{s}} ( 1 + M ) s s − 1 ≤ ∥ u ∥ < ( 1 + M ) s s − 1
which is a contraction. Hence claim holds which completes the proof. □
Note that we used the condition (3) in the proof of Theorem 2.5. We are unable to derive the result without this assumption.
Corollary 2.6. (Noncommutative Kuniyeda Upper Bound ) Let A A A be a unital Banach algebra. Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a n is invertible . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+a_nz^n\in A[z],\qquad a_n\text{ is invertible}. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a n is invertible . Let u ∈ A u\in A u ∈ A be such that p ( u ) = 0 p(u)=0 p ( u ) = 0 and
∥ u n ∥ = ∥ u ∥ n . \lVert u^n\rVert=\lVert u\rVert^n. ∥ u n ∥ = ∥ u ∥ n .
Then
∥ u ∥ < ( 1 + ( ∑ j = 0 n − 1 ∥ a n − 1 a j ∥ s ) 1 s − 1 ) s − 1 s ≤ ( 1 + ( ∥ a n − 1 ∥ s ∑ j = 0 n − 1 ∥ a j ∥ s ) 1 s − 1 ) s − 1 s , ∀ s ∈ ( 1 , ∞ ) . \lVert u\rVert< \left(1+\left(\sum_{j=0}^{n-1}\lVert a_n^{-1}a_j\rVert^s\right)^{\frac{1}{s-1}}\right)^{\frac{s-1}{s}} \le\left(1+\left(\lVert a_n^{-1}\rVert^s\sum_{j=0}^{n-1}\lVert a_j\rVert^s\right)^{\frac{1}{s-1}}\right)^{\frac{s-1}{s}}, \qquad\forall s\in(1,\infty). ∥ u ∥ < 1 + ( j = 0 ∑ n − 1 ∥ a n − 1 a j ∥ s ) s − 1 1 s s − 1 ≤ 1 + ( ∥ a n − 1 ∥ s j = 0 ∑ n − 1 ∥ a j ∥ s ) s − 1 1 s s − 1 , ∀ s ∈ ( 1 , ∞ ) .
Corollary 2.7. (Noncommutative Kuniyeda Lower Bound) Let A \mathcal A A be a unital Banach algebra. Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a 0 and a n are invertible . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+a_nz^n\in\mathcal A[z],\qquad a_0\text{ and }a_n\text{ are invertible}. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a 0 and a n are invertible . Let u ∈ A u\in\mathcal A u ∈ A be such that p ( u ) = 0 p(u)=0 p ( u ) = 0 , u u u is invertible and
∥ ( u − 1 ) n ∥ = ∥ u − 1 ∥ n . \lVert(u^{-1})^n\rVert=\lVert u^{-1}\rVert^n. ∥( u − 1 ) n ∥ = ∥ u − 1 ∥ n . Then
1 ∥ u − 1 ∥ > 1 ( 1 + ( ∑ j = 1 n ∥ a 0 − 1 a j ∥ s ) 1 s − 1 ) s − 1 s ≥ 1 ( 1 + ( ∥ a 0 − 1 ∥ s ∑ j = 1 n ∥ a j ∥ s ) 1 s − 1 ) s − 1 s . \frac{1}{\lVert u^{-1}\rVert}>\frac{1}{\left(1+\left(\sum_{j=1}^{n}\lVert a_0^{-1}a_j\rVert^s\right)^{\frac{1}{s-1}}\right)^{\frac{s-1}{s}}}\ge\frac{1}{\left(1+\left(\lVert a_0^{-1}\rVert^s\sum_{j=1}^{n}\lVert a_j\rVert^s\right)^{\frac{1}{s-1}}\right)^{\frac{s-1}{s}}}. ∥ u − 1 ∥ 1 > ( 1 + ( ∑ j = 1 n ∥ a 0 − 1 a j ∥ s ) s − 1 1 ) s s − 1 1 ≥ ( 1 + ( ∥ a 0 − 1 ∥ s ∑ j = 1 n ∥ a j ∥ s ) s − 1 1 ) s s − 1 1 .
Corollary 2.8. (Noncommutative Carmichael-Mason Upper Bound) Let A \mathcal A A be a unital Banach algebra. Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a n is invertible . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+a_nz^n\in\mathcal A[z],\qquad a_n\text{ is invertible}. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a n is invertible . Let u ∈ A u\in\mathcal A u ∈ A be such that p ( u ) = 0 p(u)=0 p ( u ) = 0 and
∥ u n ∥ = ∥ u ∥ n . \lVert u^n\rVert=\lVert u\rVert^n. ∥ u n ∥ = ∥ u ∥ n . Then
∥ u ∥ < ( 1 + ∑ j = 0 n − 1 ∥ a n − 1 a j ∥ 2 ) 1 2 ≤ ( 1 + ∥ a n − 1 ∥ 2 ∑ j = 0 n − 1 ∥ a j ∥ 2 ) 1 2 . \lVert u\rVert<\left(1+\sum_{j=0}^{n-1}\lVert a_n^{-1}a_j\rVert^2\right)^{\frac{1}{2}}\le\left(1+\lVert a_n^{-1}\rVert^2\sum_{j=0}^{n-1}\lVert a_j\rVert^2\right)^{\frac{1}{2}}. ∥ u ∥ < ( 1 + j = 0 ∑ n − 1 ∥ a n − 1 a j ∥ 2 ) 2 1 ≤ ( 1 + ∥ a n − 1 ∥ 2 j = 0 ∑ n − 1 ∥ a j ∥ 2 ) 2 1 .
Corollary 2.9. (Noncommutative Carmichael-Mason Lower Bound) Let A \mathcal A A be a unital Banach algebra. Let
p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a 0 and a n are invertible . p(z)=a_0+a_1z+\cdots+a_{n-1}z^{n-1}+a_nz^n\in\mathcal A[z],\qquad a_0\text{ and }a_n\text{ are invertible}. p ( z ) = a 0 + a 1 z + ⋯ + a n − 1 z n − 1 + a n z n ∈ A [ z ] , a 0 and a n are invertible . Let u ∈ A u\in\mathcal A u ∈ A be such that p ( u ) = 0 p(u)=0 p ( u ) = 0 , u u u is invertible and
∥ ( u − 1 ) n ∥ = ∥ u − 1 ∥ n . \lVert(u^{-1})^n\rVert=\lVert u^{-1}\rVert^n. ∥( u − 1 ) n ∥ = ∥ u − 1 ∥ n . Then
1 ∥ u − 1 ∥ > 1 ( 1 + ∑ j = 1 n ∥ a 0 − 1 a j ∥ 2 ) 1 2 ≥ 1 ( 1 + ∥ a 0 − 1 ∥ 2 ∑ j = 1 n ∥ a j ∥ 2 ) 1 2 . \frac{1}{\lVert u^{-1}\rVert}>\frac{1}{\left(1+\sum_{j=1}^{n}\lVert a_0^{-1}a_j\rVert^2\right)^{\frac{1}{2}}}\ge\frac{1}{\left(1+\lVert a_0^{-1}\rVert^2\sum_{j=1}^{n}\lVert a_j\rVert^2\right)^{\frac{1}{2}}}. ∥ u − 1 ∥ 1 > ( 1 + ∑ j = 1 n ∥ a 0 − 1 a j ∥ 2 ) 2 1 1 ≥ ( 1 + ∥ a 0 − 1 ∥ 2 ∑ j = 1 n ∥ a j ∥ 2 ) 2 1 1 .
Conclusions
Over two centuries ago, Lagrange established an upper bound for the zeros of complex polynomials [10 , 13 ] . In 1916, Fujiwara found this bound independently [5 ] .
In 1914, Carmichael and Mason derived an upper bound for the zeros of complex polynomials [3 ] .
In 1916, Kuniyeda improved Carmichael-Mason bound [7 ] .
In this article, we derived noncommutative versions of Lagrange-Fujiwara and Kuniyeda bounds.
References