The Other Markov’s Inequality
Summary
The post explains Markov’s inequality for polynomials on [-1,1], contrasts simple power functions with Chebyshev polynomials, and presents a general domain version. It then applies the bound to derive lower-degree requirements for approximating functions like e^{-t} on large intervals, illustrating polynomial inapproximability and connections to Chebyshev interpolation.