Abstract
The Chebyshev approximation problem is usually described as to find the polynomial (or the element of an Haar subspace) which uniformly best approximates a given continuous function. Most of the theoretical results forming the basis of this theory have not been explored by members of the St Petersburg Mathematical School, founded by P. L. Chebyshev himself.
 The present article briefly wants to explain why. We show that the interests of Chebyshev and his most narrow pupil, A. A. Markov sr. focussed on a more algebraic problem, solved only in 1960s by Meyman and required techniques far away from what mathematicians were able to deal with at that time.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
