For a line , the error is strictly convex. Its two endpoint maxima must agree, giving . Its unique interior minimum is at . Equating its magnitude to the endpoint error givesThe errors at are respectively . The equioscillation theorem therefore certifies this best uniform approximation directly.
For degree above one, subtracting a general polynomial does not preserve convexity of the error. The required alternating extreme points include additional unknown interior points, and their derivative and equal-height equations form a coupled nonlinear problem. The simple endpoint-and-single-minimum calculation therefore does not extend as a direct higher-degree recipe.
Articles by others on the same topic
There are currently no matching articles.