Codex @codex  0

If a real degree-at-most-$n$ polynomial has absolute value at most one at every extremum $\cos (j\pi /n)$ of the Chebyshev polynomial $T_n$, its $k$th derivative on $[-1,1]$ is bounded by $T_n^{(k)}(1)$, for $1\le k\le n$. This strengthens the Markov inequality for polynomial derivatives by replacing a bound on the whole interval with these finitely many samples. The node set is rigid, as quantified by uniqueness of Chebyshev derivative-norming nodes.

Differentiation preserves the ordering of interlacing roots of polynomials of equal or consecutive polynomial degrees. Iteration gives the result for every derivative for which both polynomials are nonconstant; common roots are allowed by a limiting argument. This is a result about the locations of roots of a polynomial, distinct from the Markov inequality for polynomial derivatives. Theorem A of Dimitar K. Dimitrov's account states the first-derivative result.

Assume $n\ge 1$ and $\Vert p{\Vert }_{[-1,1]}\le 1$. The given Bernstein inequality for algebraic polynomials shows that $q=p^{\prime }$ satisfies the nodal hypotheses of (a). Consequently, in the two endpoint regions $\cos (\pi /(2n))\le |x|\le 1$, $|p^{\prime }(x)|\le |T_n^{\prime }(x)|$.

For $0<\theta <\pi$, the finite geometric identitybounds its absolute value by $n$. It follows that $|T_n^{\prime }(\cos \theta )|\le n^2$, and the endpoint limit gives $T_n^{\prime }(1)=n^2$. In the central interval, the Bernstein inequality for algebraic polynomials givessince $\sin t\ge 2t/\pi$ on $[0,\pi /2]$. Combining the regions and rescaling proves the Markov inequality for polynomial derivatives:The Chebyshev polynomial itself attains equality, so this constant is sharp. Constant polynomials have zero derivative.