System of power sums in complex numbers

Given $n$ complex numbers $z_1,z_2,\ldots,z_n$ such that $$z_1^k+z_2^k+\cdots +z_n^k=0$$ for all $k\in\mathbb{N}$. Prove that $z_1=z_2=\cdots=z_n=0$.

Solution: Lets call the sum of $k$-th powers $S_k$. Since all $S_k$-s are homogeneous polynomials we know that for any $\lambda\in\mathbb{C}$ the numbers $\lambda z_1,\lambda z_2,\ldots ,\lambda z_n$ will also fulfill these equations and call the corresponding polynomials $S_k(\lambda)$. Choose $\lambda'$, such that $|\lambda' z_i|<1$ for all $i=1,2,\ldots,n$. Now for $\lambda: \ |\lambda|\le |\lambda'|$ examine $$f(\lambda;z_i)=\sum_{k=1}^{\infty}\frac{(\lambda z_i)^k}{k}$$ This is a series for logarithm, so $$S:=\sum_{i=1}^{n}f(\lambda;z_i)=-\sum_{i=1}^{n}\log(1-\lambda z_i)=-\log((1- \lambda z_1)\cdots(1- \lambda z_n))$$
On the other hand $$S=\sum_{i=1}^{n}\sum_{k=1}^{\infty}\frac{(\lambda z_i)^k}{k}=\sum_{k=1}^{\infty}\frac{S_k(\lambda)}{k}=0$$
Thus we have $\log((1-\lambda z_1)\cdots(1-\lambda z_n))=0$ hence $$g(\lambda):=(1-\lambda z_1)\cdots(1-\lambda z_n)=1$$ for all $\lambda$ within a small disc around zero. This means that all coefficients of $g$ apart from the constant term are $0$. And these coefficients are exactly the elementary symmetric polynomials (in reverse order) of $z_1,z_2,\ldots,z_n$. So all of them are zeros - $z_1=z_2=\cdots=z_n=0$.

Comments

Post a Comment

Popular posts from this blog

Basel problem type sum, proposed by prof. Skordev

Evaluate $$\sum_{n=1}^{\infty}\frac{1}{2^n n^2}.$$ Proof. The function $$S(x):=\sum_{n=1}^{\infty}\frac{x^n}{ n^2}$$ is well defined for $x\in[-1,1]$ and thus we need to find $S(1/2)$. Using differentiation, we observe that $$S(x)=-\int_0^x\frac{\log(1-t)}{t}\text{d}t.$$ If we make change of variables in the latter integral $t\to 1-t$ we obtain $$S(x)=-\int_{1-x}^1\frac{\log t}{1-t}\text{d}t. \ \ \ \ \ (1)$$ On the other hand, using integration by parts, we obtain $$S(x)=-\int_0^x\log(1-t)\text{d}\log t=-\log t\log(1-t)\Big|_{t=0}^x-\int_0^x\frac{\log t}{1-t}\text{d}t.$$ Notice that $\displaystyle \lim_{t\to 0}\log t \log(1-t)=0$ ($\log (1-t)\sim t$ and then L'Hopital), hence $$S(x)=-\int_0^x\log(1-t)\text{d}\log t=-\log x\log(1-x)-\int_0^x\frac{\log t}{1-t}\text{d}t. \ \ \ \ \ (2)$$ Plugging $x=1/2$ and equating $(1)$ to $(2)$ we obtain $$\int_{1/2}^1\frac{\log(1-t)}{t}\text{d} t-\int_{0}^{1/2}\frac{\log(1-t)}{t}\text{d} t= \log\left(\frac{1}{2}\right)^2.$$ On the ot...
Read more

A problem proposed by prof. Babev

Consider the sequence $$a_n=\int_{n}^{n+1}\frac{\sin^2(\pi t)}{t}\text{d}t.$$ It could be proven that $$\lim_{n\to \infty}n a_n=\frac{1}{2}$$  Now we are going to prove that $$\lim_{n\to\infty}n\left(na_n-\frac{1}{2}\right)=-\frac{1}{4} $$ and show how to derive all such limits. $\textbf{Proof.}$ Since $\displaystyle\int_{n}^{n+1}\sin^2(\pi t)\text{d}{t}=\frac{1}{2}$ (for any $n\in \mathbb{N}$) we can rewrite the limit in question as $$\lim_{n\to \infty}n\left(n\left(\int_{n}^{n+1}\frac{\sin^2(\pi t)}{t}\text{d}t-\int_{n}^{n+1}\frac{\sin^2(\pi t)}{n}\text{d}t\right)\right)=\lim_{n\to \infty}n^2\left(\int_{n}^{n+1}\sin^2(\pi t)\left(\frac{1}{t}-\frac{1}{n}\right)\text{d}t\right)$$ $$=\lim_{n\to \infty}n\left(\int_{n}^{n+1}\sin^2(\pi t)\frac{n-t}{t}\text{d}t\right)$$ Changing the variables $t\to n+s$ and using periodicity of sine, the last simplifies to $$ \lim_{n\to \infty}n\int_{0}^{1}\sin^2(\pi s)\frac{-s}{n+s}\text{d}s$$ Since for $s\in[0,1]$, $\displaystyle \...
Read more

Modification on a sequence from VJIMC

The first two limits of the following problem were proposed at VJIMC, 2005, Category I. The exact value of the last limit was proposed by a user at https://artofproblemsolving.com , where you can also see his solution along other lines.  Let $(x_n)_{n\ge 2}$ be a sequence of real numbers, such that $x_2>0$ and for every $n\ge 2$ holds  $$x_{n+1}=-1+\sqrt[n]{1+nx_n}.$$ Prove consecutively that  $$1)\ \lim_{n\to\infty}x_n=0,\  \ \ 2)\ \lim_{n\to\infty}nx_n=0,\  \ \ 3)\ \lim_{n\to\infty}n^2x_n=4.$$ $\textbf{Proof.}$  $\textbf{1)}$ Clearly all the elements of the sequence are positive. The inequality $-1+\sqrt[n]{1+nx_n}<x_n$ is equivalent to $(1+nx_n)<(1+x_n)^n$, which is seen to be true after expanding, since all the summands on the right are positive. This shows that the sequence is strictly decreasing. Hence $$0<x_{n+1}=-1+\sqrt[n]{1+nx_n}\le -1+\sqrt[n]{1+nx_2},$$ and since the right hand side clearly tends to $0$ we obtain $\displaystyle\lim_...
Read more