This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Markov brothers' inequality | |
|---|---|
| Name | Markov brothers' inequality |
| Field | Approximation theory |
| Introduced | 1890s |
| Authors | Andrey Markov; Vladimir Markov |
| Related | Bernstein inequality, Chebyshev polynomials, Runge's phenomenon |
Markov brothers' inequality The Markov brothers' inequality is a classical estimate in approximation theory bounding the derivative of a polynomial on a real interval; it gives an upper bound on the supremum norm of a derivative in terms of the supremum norm of the polynomial itself. The inequality plays a central role in the study of Chebyshev polynomials, Bernstein polynomials, and problems arising in harmonic analysis, spectral theory, numerical analysis, and complex analysis.
For any algebraic polynomial p of degree n, the Markov brothers' inequality asserts that on the interval [-1,1] one has an explicit bound of the form ||p'||_∞ ≤ n^2 ||p||_∞, where the supremum norms are taken over [-1,1]. This quantitative statement connects to classical results by Pafnuty Chebyshev, S.N. Bernstein, Carl Friedrich Gauss, Adrien-Marie Legendre, and to extremal problems studied by Dmitri Egorov and Sofia Kovalevskaya. Variants replace the interval [-1,1] with arbitrary compact subsets related to Potential theory and to sets studied by Paul Erdős and A. A. Markov's contemporaries.
The inequality is named after the Markov brothers, Andrey Markov and Vladimir Markov, who established versions of the bound in the late 19th century building on earlier extremal polynomial work by Chebyshev and continuity considerations linked to Karl Weierstrass and Bernhard Riemann. Subsequent refinements and independent rediscoveries involved Sergei Bernstein, Issai Schur, G. A. Anastassiou, and S.N. Mergelyan, while applications were noted by researchers in Paul Turán's circle and by practitioners such as John von Neumann and Norbert Wiener in contexts touching operator theory and Fourier analysis.
Proofs exploit classical tools from orthogonal polynomials theory, potential theory, and extremal problems. Standard derivations employ properties of Chebyshev polynomials, the alternation theorem of Chebyshev, and comparison principles related to Stieltjes transforms and to inequalities used by Sergei Bernstein and Issai Schur. Alternative approaches use complex analytic techniques associated with Runge's theorem, conformal mapping results of Riemann mapping theorem flavor, and energy minimization principles from logarithmic potential theory as developed by Oleg S. Parfenov and others. Operator-theoretic proofs relate the bound to spectral estimates appearing in work of John von Neumann and Marshall Stone.
Equality cases and sharpness involve scaled and shifted Chebyshev polynomials of the first kind; extremal examples are derived from the Chebyshev alternation property first investigated by Pafnuty Chebyshev and later refined by A. A. Markov and V. A. Markov. The sharp constant n^2 is achieved asymptotically and in normalized settings by Chebyshev-type polynomials; related extremal constructions reference work by S.N. Bernstein, G. A. Anastassiou, and modern treatments by Bernard Bojanov and Plamen Bojanov.
Extensions include higher-derivative versions (Markov-type bounds for p^{(k)}), inequalities on different intervals or compact sets in the complex plane studied by Akhiezer and M. S. Livsic, and weighted forms investigated by V. Totik and E. B. Saff. Related results encompass the Bernstein inequality for trigonometric polynomials, Nikol'skii-type inequalities tied to Nikolai Nikolsky, and inverse theorems in approximation theory associated with Jackson and D. Jackson. Multivariate and discrete analogues connect to problems treated by I. I. Hirschman Jr. and researchers in approximation theory communities such as Gabor Szegő's circle and modern analysts like Sergey Treil.
Applications appear in polynomial approximation error estimates used by authors of numerical analysis and in stability analyses in control theory contexts explored by Rudolf E. Kálmán and Richard Bellman. Concrete examples include bounding oscillation of interpolating polynomials linked to Runge's phenomenon and guaranteeing derivative control in spectral methods referenced by John von Neumann and Richard Courant. Further examples arise in signal processing where inequalities of Markov type inform filter design studied by Norbert Wiener and in potential-theoretic estimates for polynomial root localization examined by G. H. Hardy and J. E. Littlewood.