Bernstein's theorem (polynomials)

Template:Short description In mathematics, Bernstein's theorem is an inequality relating the maximum modulus of a complex polynomial function on the unit disk with the maximum modulus of its derivative on the unit disk. It was proven by Sergei Bernstein while he was working on approximation theory.

Statement

Let $\underset{|z|=1}{\max }|f(z)|$ denote the maximum modulus of an arbitrary function $f(z)$ on $|z|=1$, and let $f^{\prime }(z)$ denote its derivative. Then for every polynomial $P(z)$ of degree $n$ we have

$\underset{|z|=1}{\max }|P^{\prime }(z)|\le n\underset{|z|=1}{\max }|P(z)|$.

The inequality cannot be improved and equality holds if and only if $P(z)=\alpha z^n$.

Bernstein's inequality

In mathematical analysis, Bernstein's inequality states that on the complex plane, within the disk of radius 1, the degree of a polynomial times the maximum value of a polynomial is an upper bound for the similar maximum of its derivative. Applying the theorem k times yields

$\underset{|z|\le 1}{\max }|P^{(k)}(z)|\le \frac{n!}{(n-k)!}\cdot \underset{|z|\le 1}{\max }|P(z)|.$

Similar results

Paul Erdős conjectured that if $P(z)$ has no zeros in $|z|<1$, then $\underset{|z|=1}{\max }|P^{\prime }(z)|\le \frac{n}{2}\underset{|z|=1}{\max }|P(z)|$. This was proved by Peter Lax.

M. A. Malik showed that if $P(z)$ has no zeros in $|z|<k$ for a given $k\ge 1$, then $\underset{|z|=1}{\max }|P^{\prime }(z)|\le \frac{n}{1+k}\underset{|z|=1}{\max }|P(z)|$.

See also

• Markov brothers' inequality
• Remez inequality

Further reading

• Template:Cite journal
• Template:Cite book
• Template:Cite book