Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T15:17:00.520Z Has data issue: false hasContentIssue false

On Explicit Decomposition for Positive Polynomials on [-1, +1] with Applications to Extremal Problems

Published online by Cambridge University Press:  20 November 2018

R. Pierre*
Affiliation:
Université Laval, Québec, Québec
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The following well known inequality was first proved by Bernstein [2].

THEOREM A. If pn(x) is a polynomial of degree n, such that |pn(x)| ≦ 1 for –1 ≦ x = +1, then

1

The dominant n(1 – x 2)–;1/2 is best possible only at the zeros of the Tchebychev polynomial

but the bound is precise at every interior point as far as the exponent of n is concerned.

Theorem A was extended to the case of higher derivatives by Duffin and Schaeffer in [4]. In that paper they make extensive use of the oscillation property of the polynomial Tn(x) and of the related function

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1984