Minimax linear approximation of a square-root endpoint profile

ID: minimax-linear-approximation-of-a-square-root-endpoint-profile

On , the chord of is . Its nonnegative gap has maximum at , as differentiation shows. Shifting the chord upward by gives error at . The Chebyshev alternation theorem therefore proves that is the unique best linear uniform approximation, with error . Endpoint differentiability is unnecessary.

New to topics? Read the docs here!