Monic Chebyshev extremal polynomial (source code)

= Monic Chebyshev extremal polynomial

For an integer $n\geq1$, the <monic polynomial> $2^{1-n}T_n$ uniquely minimizes the <uniform norm> on $[-1,1]$ among real <monic polynomials> of degree $n$. The minimum norm is $2^{1-n}$. The normalization uses the leading coefficient $2^{n-1}$ of the <Chebyshev polynomial> $T_n$.

At the $n+1$ alternating extrema of $T_n$, a strictly smaller competitor would make its difference from $2^{1-n}T_n$ change sign at least $n$ times. That difference has degree at most $n-1$, a contradiction; the <equioscillation theorem> also gives uniqueness. The degree-zero case is separate: the only <monic polynomial> of degree zero is $1$, whose norm is $1$, not $2$.