For a real continuous -periodic function , the trigonometric Chebyshev alternation theorem says that is its best uniform approximation if and only if there are distinct cyclically ordered points in one period,and a sign such thatThe best approximant exists and is unique. Alternation is cyclic: the last and first displayed extrema also have opposite signs across the closing interval. If the error is zero, and the characterization holds trivially.
The sufficiency can be seen from zero counting. A strictly improving trigonometric polynomial would have a difference from with the alternating nonzero signs at these points, forcing at least zeros on the circle. A nonzero member of has at most zeros: multiplying its Laurent expression by gives an ordinary polynomial of degree at most in . This contradiction is the alternation mechanism used in the next part.
The coefficient sum is finite, so the Weierstrass M-test makes the cosine series uniformly convergent and continuous. Put and . The indicated partial sum belongs to because its largest frequency is . Its tail satisfiesand equality holds at . Thus its supremum norm error is exactly .
At the points , , every omitted frequency is an odd integer multiple of . Indeed for ,Uniform convergence permits summing these values, givingThese are cyclically alternating extrema. Since , there are of them, so the trigonometric Chebyshev alternation theorem proves that the partial sum is the unique best approximant. Consequently the positive lacunary trigonometric series hasThe positivity of every tail coefficient makes the same tail attain its full coefficient sum with alternating signs; a triangle bound alone would not establish optimality.
Articles by others on the same topic
There are currently no matching articles.