Online ordering is currently unavailable due to technical issues. We apologise for any delays responding to customers while we resolve this. For further updates please visit our website: https://www.cambridge.org/news-and-insights/technical-incident Due to planned maintenance there will be periods of time where the website may be unavailable. We apologise for any inconvenience.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Published online by Cambridge University Press: 20 November 2018
The following lemma, part a) due to S. N. Bernstein and part b) due to A. A. Markov, is fundamental to the proofs of many inverse theorems in polynomial approximation theory.
LEMMA 1. [2, p. 62 and p. 67] Let ∏n denote the real polynomials of degree at most n. Let p ∈ ∏n, then
a)
b)
From the lemma one can deduce, for example:
THEOREM 1. Iƒ there is a sequence of polynomials pn ∈ ∏n and a δ > 0 so that ‖f – pn‖[a, b] ≧ A/nk + δ then f is k times continuously differentiate on (a, b).
We shall refer to inequalities, such as those of Lemma 1 that bound the derivative r′ of a rational function of degree n in terms of its supremum norm ‖r‖[a, b] and n, as Bernstein-type inequalities.
You have
Access
