Markov brothers' inequality

1

In mathematics, the Markov brothers' inequality is an inequality, proved in the 1890s by brothers Andrey Markov and Vladimir Markov, two Russian mathematicians. This inequality bounds the maximum of the derivatives of a polynomial on an interval in terms of the maximum of the polynomial. For k = 1 it was proved by Andrey Markov, and for k = 2,3,... by his brother Vladimir Markov.

The statement

Let P be a polynomial of degree ≤ n. Then for all nonnegative integers k This inequality is tight, as equality is attained for Chebyshev polynomials of the first kind.

Related inequalities

Applications

Markov's inequality is used to obtain lower bounds in computational complexity theory via the so-called "Polynomial Method".

This article is derived from Wikipedia and licensed under CC BY-SA 4.0. View the original article.

Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc.
Bliptext is not affiliated with or endorsed by Wikipedia or the Wikimedia Foundation.

Edit article