A Bernstein-Markov Theorem for Normed Spaces

Similar documents
Markov s Inequality for Polynomials on Normed Linear Spaces Lawrence A. Harris

Bernstein s Polynomial Inequalities and Functional Analysis

THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT

A Proof of Markov s Theorem for Polynomials on Banach spaces

4 = (0.02) 3 13, = 0.25 because = 25. Simi-

Uniform Approximation and Bernstein Polynomials with Coefficients in the Unit Interval

ORIGAMI CONSTRUCTIONS OF RINGS OF INTEGERS OF IMAGINARY QUADRATIC FIELDS

The Hilbert Schmidt version of the commutator theorem for zero trace matrices

New Classes of Positive Semi-Definite Hankel Tensors

Curious Bounds for Floor Function Sums

Alireza Kamel Mirmostafaee

3.8 Three Types of Convergence

Research Article Some Formulae of Products of the Apostol-Bernoulli and Apostol-Euler Polynomials

APPROXIMATION BY MODIFIED SZÁSZ-MIRAKYAN OPERATORS

ADVANCES ON THE BESSIS- MOUSSA-VILLANI TRACE CONJECTURE

Feature Extraction Techniques

New upper bound for the B-spline basis condition number II. K. Scherer. Institut fur Angewandte Mathematik, Universitat Bonn, Bonn, Germany.

APPROXIMATION BY GENERALIZED FABER SERIES IN BERGMAN SPACES ON INFINITE DOMAINS WITH A QUASICONFORMAL BOUNDARY

Prerequisites. We recall: Theorem 2 A subset of a countably innite set is countable.

Characterization of the Line Complexity of Cellular Automata Generated by Polynomial Transition Rules. Bertrand Stone

EXPLICIT CONGRUENCES FOR EULER POLYNOMIALS

Computational and Statistical Learning Theory

The Weierstrass Approximation Theorem

Metric Entropy of Convex Hulls

A new type of lower bound for the largest eigenvalue of a symmetric matrix

A RECURRENCE RELATION FOR BERNOULLI NUMBERS. Mümün Can, Mehmet Cenkci, and Veli Kurt

A note on the realignment criterion

arxiv: v1 [math.nt] 14 Sep 2014

List Scheduling and LPT Oliver Braun (09/05/2017)

M ath. Res. Lett. 15 (2008), no. 2, c International Press 2008 SUM-PRODUCT ESTIMATES VIA DIRECTED EXPANDERS. Van H. Vu. 1.

Block designs and statistics

Analysis of Polynomial & Rational Functions ( summary )

1. INTRODUCTION AND RESULTS

Bipartite subgraphs and the smallest eigenvalue

The Euler-Maclaurin Formula and Sums of Powers

Linear recurrences and asymptotic behavior of exponential sums of symmetric boolean functions

Chapter 6 1-D Continuous Groups

Algebraic Montgomery-Yang problem: the log del Pezzo surface case

Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs

Tail estimates for norms of sums of log-concave random vectors

Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes

A COMPLEMENTARY TRIANGLE INEQUALITY IN HILBERT AND BANACH SPACES J. B. DIAZ AND F. T. METCALF1

MODULAR HYPERBOLAS AND THE CONGRUENCE ax 1 x 2 x k + bx k+1 x k+2 x 2k c (mod m)

PREPRINT 2006:17. Inequalities of the Brunn-Minkowski Type for Gaussian Measures CHRISTER BORELL

AN ESTIMATE FOR BOUNDED SOLUTIONS OF THE HERMITE HEAT EQUATION

NON-COMMUTATIVE GRÖBNER BASES FOR COMMUTATIVE ALGEBRAS

. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe

A Better Algorithm For an Ancient Scheduling Problem. David R. Karger Steven J. Phillips Eric Torng. Department of Computer Science

1 Rademacher Complexity Bounds

Hermite s Rule Surpasses Simpson s: in Mathematics Curricula Simpson s Rule. Should be Replaced by Hermite s

Homework 3 Solutions CSE 101 Summer 2017

Non-Parametric Non-Line-of-Sight Identification 1

LATTICE POINT SOLUTION OF THE GENERALIZED PROBLEM OF TERQUEi. AND AN EXTENSION OF FIBONACCI NUMBERS.

The Fundamental Basis Theorem of Geometry from an algebraic point of view

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and

FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension

Fixed-to-Variable Length Distribution Matching

Polarization constant K(n, X) = 1 for entire functions of exponential type

ON SOME PROBLEMS OF GYARMATI AND SÁRKÖZY. Le Anh Vinh Mathematics Department, Harvard University, Cambridge, Massachusetts

ROTH S THEOREM ON ARITHMETIC PROGRESSIONS

e-companion ONLY AVAILABLE IN ELECTRONIC FORM

Computable Shell Decomposition Bounds

Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus

Descent polynomials. Mohamed Omar Department of Mathematics, Harvey Mudd College, 301 Platt Boulevard, Claremont, CA , USA,

EXISTENCE OF ASYMPTOTICALLY PERIODIC SOLUTIONS OF SCALAR VOLTERRA DIFFERENCE EQUATIONS. 1. Introduction

On Conditions for Linearity of Optimal Estimation

Infinitely Many Trees Have Non-Sperner Subtree Poset

a a a a a a a m a b a b

A Note on Online Scheduling for Jobs with Arbitrary Release Times

IN modern society that various systems have become more

Certain Subalgebras of Lipschitz Algebras of Infinitely Differentiable Functions and Their Maximal Ideal Spaces

VARIABLES. Contents 1. Preliminaries 1 2. One variable Special cases 8 3. Two variables Special cases 14 References 16

Necessity of low effective dimension

Research Article Approximate Multidegree Reduction of λ-bézier Curves

On the Dirichlet Convolution of Completely Additive Functions

A Simple Regression Problem

Holomorphic curves into algebraic varieties

A symbolic operator approach to several summation formulas for power series II

FAST DYNAMO ON THE REAL LINE

On the mean square formula of the error term in the Dirichlet divisor problem

arxiv: v1 [math.co] 19 Apr 2017

Konrad-Zuse-Zentrum für Informationstechnik Berlin Heilbronner Str. 10, D Berlin - Wilmersdorf

13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices

Computable Shell Decomposition Bounds

ON SOME MATRIX INEQUALITIES. Hyun Deok Lee. 1. Introduction Matrix inequalities play an important role in statistical mechanics([1,3,6,7]).

arxiv: v1 [math.cv] 31 Mar 2013

Symmetric properties for the degenerate q-tangent polynomials associated with p-adic integral on Z p

arxiv: v1 [cs.ds] 3 Feb 2014

Understanding Machine Learning Solution Manual

Support Vector Machines. Maximizing the Margin

Generalized eigenfunctions and a Borel Theorem on the Sierpinski Gasket.

Lecture 21. Interior Point Methods Setup and Algorithm

ON THE TWO-LEVEL PRECONDITIONING IN LEAST SQUARES METHOD

LORENTZ SPACES AND REAL INTERPOLATION THE KEEL-TAO APPROACH

arxiv: v1 [math.pr] 17 May 2009

STRONG LAW OF LARGE NUMBERS FOR SCALAR-NORMED SUMS OF ELEMENTS OF REGRESSIVE SEQUENCES OF RANDOM VARIABLES

A note on the multiplication of sparse matrices

An EGZ generalization for 5 colors

A REMARK ON PRIME DIVISORS OF PARTITION FUNCTIONS

A Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness

Transcription:

A Bernstein-Markov Theore for Nored Spaces Lawrence A. Harris Departent of Matheatics, University of Kentucky Lexington, Kentucky 40506-0027 Abstract Let X and Y be real nored linear spaces and let φ : X R be a non-negative function satisfying φ(x + y) φ(x) + y for all x, y X. We show that there exist optial constants c,k such that if P : X Y is any polynoial satisfying P (x) φ(x) for all x X, then ˆD k P (x) c,k φ(x) k whenever x X and 0 k. We obtain estiates for these constants and present applications to polynoials and ultilinear appings in nored spaces. 1. Introduction. This note considers the growth of the Fréchet derivatives of a polynoial on a nored linear space when the polynoial has restricted growth on the space. Our ain concern is with real nored linear spaces. Here we obtain an estiate for the kth derivative of a polynoial bounded by an th power where the constant c,k in our estiate is best possible even when only the special case of the real line is considered. Moreover, we show that this inequality for the real line is equivalent to a Markov inequality for hoogeneous polynoials. Our estiates are applied iteratively to obtain a bound for the values of a syetric ultilinear apping where certain of its arguents are repeated. This bound is a constant ultiple of the nor of the associated hoogeneous polynoial. Although we are unable to obtain a general forula for the constants c,k, we do establish eleentary upper and lower bounds and provide a good estiate on their asyptotic growth. We deterine the value of the constants in soe low diensional cases and find associated extreal polynoials with the aid of an interpolation forula for hoogeneous polynoials. In the case of coplex nored linear spaces, we give a siple derivation of an estiate for the kth derivative which extends an inequality given in [2, Theore 2] by allowing ore general growth conditions. For coparison with the real case, 1

we deduce an extension of an inequality of Bernstein and derive a bound for syetric ultilinear appings where certain of its arguents are repeated. In both the real and coplex cases, we show that equality holds in ost of our estiates for soe scalar-valued hoogeneous polynoial defined on two diensional l 1 space. 2. Main results. Let be a positive integer and let 0 k. We define c,k to be the supreu of the values p (k) (0) where p varies through all polynoials satisfying p(t) (1 + t ) (1) for every t R. Clearly any such polynoial p has degree at ost. Note that if p satisfies (1) then so does the polynoial q(t) = t p(1/t). Hence c,k /k! = c, k /( k)! for 0 k. In particular, c,0 = 1 and c, =!. Proposition 1. k k ( k) c,k k k! ( k ) /2 (2) k k/2 ( k) ( k)/2 for 0 k. There exists an absolute constant M such that c,k (M log ) k (3) for 0 k and > 1. Estiates (2) and (3) follow fro work of Sarantopoulos [9] and Nevai and Totik [8], respectively. See Section 5 for a proof and for values of soe of the constants. For coparison with (3), note that (2) iplies only that c,k = O( 3k/2 ). Theore 2. Let X and Y be nored linear spaces over F, where F = R or F = C. Let φ : X R be a non-negative function satisfying φ(x + y) φ(x) + y (4) for all x, y X and let P : X Y be a polynoial satisfying P (x) φ(x) (5) for all x X. If F = R then ˆD k P (x) c,k φ(x) k (6) 2

and if F = C then ˆD k P (x) k! k k ( k) k φ(x) k (7) whenever x X and 0 k. Moreover, in the case where X = l 1 (F 2 ), Y = F and φ(x) = x, for each inequality (6) and (7), there exists a hoogeneous polynoial P as above and depending on and k such that equality holds in the given inequality for soe x with φ(x) any given non-negative nuber. Basic definitions and facts concerning polynoials on nored spaces can be found in [6] and [7]. Throughout, ˆDk P (x) denotes the hoogeneous polynoial associated with the kth order Fréchet derivative D k P (x) and is given by ˆD k P (x)y = dk P (x + ty). dtk t=0 In Theore 2 and in all our other estiates we take 0 0 = 1. The hypothesis (4) of Theore 2 is satisfied, for exaple, when φ(x) = f( x ), where f : [0, ) R is a continuous non-negative function satisfying f (t) 1 for all t > 0. In particular, hypothesis (4) is satisfied when φ(x) = x and when φ(x) = (1 + x p ) 1/p, where p 1. It is easy to verify that this hypothesis is also satisfied when φ(x) = ax{1, x }. The degree of any polynoial P satisfying (5) is at ost since P (y) (M + y ), M = φ(0), for all y X by (4). Proof of Theore 2. By coposing P with a given linear functional and applying the Hahn-Banach theore, we ay suppose that Y = F. Let x, y X with y 1. Given r > φ(x), define p(α) = P (x + αry) r. Then p(α) is a polynoial with p (k) (0) = ˆD k P (x)(ry)/r and p(α) φ(x + αry) r [ ] φ(x) + α r (1 + α ) r for all α F. If F = R then p (k) (0) c,k by the definition of c,k. Hence, ˆD k P (x) c,k r k 3

for all r > φ(x), and (6) follows. If F = C, the function p(α) is entire and by the Cauchy estiates, p (k) (0) k!(1 + R) R k, for a given R > 0. Hence, ˆD k P (x) k!(1 + R) r k R k for all r > φ(x). Taking R = k/( k) when k and letting R otherwise, we obtain (7). To prove the reainder of Theore 2, recall that by definition X is F 2 with the nor x = x 1 + x 2, where x = (x 1, x 2 ). Suppose 0 k. We first consider the case F = R. It follows fro Proposition 1 that there exists a polynoial p satisfying (1) for which p (k) (0) = c,k. Define a hoogeneous polynoial P : X R of degree by P (x 1, x 2 ) = x 1 p( x 2 x 1 ) for x 1 0. (8) Then P (x) x for all x X and ˆD k P (r, 0)(0, 1) = dk P (r, t) = r k c dtk,k. t=0 Thus equality holds in (6) with x = (r, 0) for r 0. We next consider the case F = C. Define P (x 1, x 2 ) = M k x k 1 x k 2, M k = Since the geoetric ean is less than the arithetic ean, ( ) x1 k ( ) 1 x2 k x 1 + x 2, k k. (9) k k ( k) k so P (x) x for all x X. Moreover, ˆDk P (r, 0)(0, 1) = M k k!r k. Thus equality holds in (7) with x = (r, 0) for r 0. In the applications which follow, we use the notation X 1 = {x X : x 1}, P = sup{ P (x) : x X 1 } 4

when P : X Y is a polynoial. Since by definition a polynoial is a su of continuous hoogeneous polynoials, P is finite and thus clearly a nor. 3. Applications to coplex spaces. The coplex case of Theore 2 can be applied to obtain an extension of the Bernstein theore given in [2, Corollary 2] to the case x > 1. Corollary 3. Let X and Y be coplex nored linear spaces and let P : X Y be a polynoial of degree at ost. Then ˆD k P (x) ˆD k P (x) k! P, k k ( k) k x 1, k! k k ( k) P k x k, x > 1, for 0 k and x X. Moreover, for each and k there exists a nontrivial hoogeneous polynoial P as above for which equality holds in the above inequalities (for soe x X with x any given nuber 1) when X = l 1 (C 2 ) and Y = C. Proof. As in the previous proof, we ay suppose that Y = C. Since the case where P 0 is obvious, we ay also suppose that P = 1. By Theore 2, all we need to establish is that (5) holds when φ(x) = ax{1, x }. This is clear when x 1. Let x X with x > 1 and define f(λ) = λ P (x/λ) for all coplex λ 0. Then f extends to a polynoial on C satisfying f(λ) x for all λ on the circle λ = x, so by the axiu principle, P (x) = f(1) x. Thus (5) holds in all cases, as required. One can apply Corollary 3 to obtain the case p = 1 of [2, Theore 1] given next. See [3] for a discussion of this and related inequalities. Corollary 4. Let X and Y be coplex nored linear spaces and let F : X X Y be a continuous syetric -linear apping with associated hoogeneous polynoial ˆF defined by ˆF (x) = F (x,..., x). If x1,..., x n are vectors in X 1, then F (x k 1 1 x kn n ) k 1! k n! k k 1 1 k kn n! ˆF (10) for all non-negative integers k 1,..., k n with k 1 + + k n =. The constant in this inequality cannot be replaced by a saller one. Here and elsewhere, F (x k 1 1 x kn n ) = F (x 1,..., x }{{ 1,..., x } n,..., x n ). }{{} k 1 k n 5

Proof. Define f(k) = k k /k! for all non-negative integers k. By the binoial theore for hoogeneous polynoials [6, Th. 26.2.3], ( ) 1 k! ˆD k ˆF (x)y = F (x k y k ) k and hence by Corollary 3 (or Theore 2 with φ(x) = x ), F (y k x k ) f() f(k)f( k) ˆF (11) for x, y X 1 and 0 k. Now x F (x k 1 1 x k 1 ) is a hoogeneous polynoial of degree k 1 and hence (11) applies again to show that F (x k 1 1 x k 2 2 x k 1 k 2 ) f() f(k 1 )f(k 2 )f( k 1 k 2 ) ˆF for x X 1. Continuing in this way, we obtain (10). An exaple given in [2, p. 148] (which generalizes (9)) shows that the constant in (10) is best possible. 4. Applications to real spaces. The following is an iediate consequence of Theore 2 with φ(x) = 1 + x. Corollary 5. Let X and Y be real nored linear spaces. If P : X Y is a polynoial satisfying P (x) (1 + x ) for all x X, then ˆD k P (x) c,k (1 + x ) k whenever x X and 0 k. It is easy to see fro Corollary 5 with X = Y = R that c,n c,k c k,n k whenever 0 n and 0 k n. Theore 6. Let X and Y be real nored linear spaces. If P : X Y is a hoogeneous polynoial of degree, then ˆD k P c,k P for 0 k. Moreover, for each and k there exists a non-zero polynoial P as above for which equality holds when X = l 1 (R 2 ) and Y = R. 6

Corollary 7. Let X and Y be real nored linear spaces and let F : X X Y be a continuous syetric -linear apping with associated hoogeneous polynoial ˆF. If x1,..., x n are vectors in X 1, then F (x k 1 1 x kn n ) k k 1 1 k kn n ˆF (12) for all non-negative integers k 1,..., k n with k 1 + + k n =. The case n = 2 of the above corollary is essentially part (a) of the Corollary in [9]. The constants we give are rather far fro being the best. For exaple, when k 1 = 1,..., k n = 1, the constant in (12) is /2 while the best constant in this case (deterined by R. S. Martin in 1932) is /!. The proble of deterining the best constant in (12) is open. (See [3].) Proof of Theore 6 and Corollary 7. Theore 6 follows fro the fact that if P 0, Theore 2 applies with P replaced by P/ P and φ(x) = x. Thus (12) follows fro the upper bound given in Proposition 1 and the proof of Corollary 4 with f(k) = k k/2. Note that in Corollary 5, a bound on the derivative which holds for X = Y = R continues to hold when X and Y are any real nored linear spaces. According to a theore of Sarantopoulos [9, Theore 2], this is also the case with Markov s inequality for the first derivative. It is an open question whether Markov s inequality for the higher derivatives continues to hold for arbitrary real Banach spaces. However, in general, one cannot expect Bernstein-type estiates for polynoials on the real line to hold for arbitrary real (or even coplex) Banach spaces. For exaple, it was shown by S. N. Bernstein [1, p. 56] that q (t) (1 + t 2 ) 1 2 (13) for any polynoial q satisfying q(t) (1 + t 2 ) /2 for all t R. Suppose X = l 1 (R 2 ) and let P : X R be the hoogeneous polynoial defined by (9) with k = 1. Then, P (x) (1 + x 2 ) /2 for all x X since P 1. If the result analogous to (13) held for X, we would have DP (x) (1 + x 2 ) 1 2 for all x X. Now x DP (x) is a hoogeneous polynoial of degree 1. Hence, replacing x by tu, where u X with u 1 and letting t, we obtain DP (u). Thus, M 1, which is ipossible when > 1. Inequality (13) and other classical polynoial inequalities are extended to Hilbert spaces in [2] and [4]. 7

5. Estiating c,k. Proof of Proposition 1. The lower bound for c,k in (2) follows with p(t) = at k, where a is the iniu of the function (1 + t) /t k for t > 0. This iniu occurs at t = k/( k). To obtain the upper bound in (2), suppose p satisfies (1) and put q(t) = p(st), where s > 0. Then q (k) (0) = s k p (k) (0) and by the Cauchy-Schwarz inequality, Hence, q(t) (1 + s t ) (1 + s 2 ) /2 (1 + t 2 ) /2. p (k) (0) k! ( k ) (1 + s 2 ) /2 s k by k applications of (13). The iniu of the right-hand side of the above occurs when s 2 = k/( k) and this gives the asserted estiate. (Copare [9, p. 311].) To prove (3), suppose p satisfies (1) and put q(t) = p(t/). Then q is a polynoial of degree at ost satisfying ( q(t) 1 + t ) e t for all t R. By k applications of a Markov-Bernstein theore given in [8, Theore 3] with weight exp( t ), we obtain sup e t q (k) (t) (M log ) k sup e t q(t), <t< <t< where M is an absolute constant. Thus p (k) (0) = k q (k) (0) (M log ) k, copleting the proof. (I a grateful to Prof. Taás Erdélyi for providing the arguent in the above paragraph.) In view of Theores 2 and 6, it is iportant to know the value of c,k as accurately as possible, especially for the case k = 1. Below is a table of a few values with a corresponding extreal polynoial which attains this value. Note that these extreal polynoials can be converted to extreal polynoials for Theore 6 using (8). 8

c,k Extreal polynoial p(t) 1 c 1,1 = 1 t + b, b 1 2 c 2,1 = 4 c 2,1 t 3 c 3,1 = 6.976850 c 3,1 t t 3 4 c 4,1 = 6 3 c 4,1 t(1 t 2 ) c 4,2 = 36 1 2 c 4,2t 2 t 4 1 6 c 6,1 = 17.61468 c 6,1 t(1 t 2 ) 2 64t 3 c 6,3 = 595.3761 1 12 c 6,3t(1 t 2 ) 2 32t(1 + t 4 ) The values of c,1 and the corresponding extreal polynoials given in the table can be deduced fro the estiate below. Lea 8. If t 1,..., t are any distinct real nubers, then c,1 i=1 (1 + t i ) j i t i t j (14) To obtain the extreal polynoials of the table, choose the interpolation points t 1,..., t syetric with respect to the origin (with the origin included for odd values of ) and select the positive points fro t, 1/t and 1, in that order, where t > 0. The value of c,1 is obtained by iniizing over t. For exaple, when t 1 = t, t 2 = 1/t, t 3 = t 2, t 4 = t 1, where 0 < t < 1, the right-hand side of (14) reduces to f(t) = t(1 + t)4 (1 + t)4 + 1 t 4 t(1 t 4 ) = (1 + t)4 t(1 t 2 ) = (1 + t)3 t(1 t). Let a = in{f(t) : 0 < t < 1} and define p(t) = at(1 t 2 ). Then c 4,1 a by (14) and clearly p(t) (1 + t) 4 for 0 < t < 1. It follows fro the identities p( t) = p(t) and t 4 p(1/t) = p(t), that p(t) (1 + t ) 4 for all t R. Since p (0) = a, we have c 4,1 = a. By calculus, a = f(2 3) = 6 3. The entries in the table for c 4,2 and c 6,3 can be obtained fro an interpolation forula for hoogeneous polynoials given in [3, (4)]. (The oversize Γ given there is a isprint for the sybol denoting a product.) For the case of c 4,2, take the interpolation sets to be r, 0, r and s, 0, s and set t = r/s. For the case of c 6,3, take both interpolation sets to be s, r, r, s and again set t = r/s. It is easy to deduce that c 6,3 = 12(c 6,1 + 32) by coparison of the expressions being iniized; hence the last two extreal polynoials in the table are the sae. 9

Proof of Lea 8. One can deduce the estiate (14) easily fro the interpolation forula given in [3, (4)], where t 1,..., t and 1, 1 are the sets of interpolation points and where W is the hoogeneous polynoial P defined by (8). To give a direct proof, suppose p satisfies (1) and define q(t) = t p 1 ( 1 t ), where p 1 (t) = p(t) p( t). 2 Then q extends to a polynoial on R of degree at ost 1 satisfying q(t) (1 + t ) for all t R. Moreover, the coefficient of t 1 in q is the coefficient of t in p, i.e., p (0). By equating the coefficients of t 1 in both sides of the Lagrange interpolation forula for q, we obtain p (0) = q(t i ) j i(t i t j ) i=1 and (14) follows. See [5] for further discussion of the deterination of the values c,k and related probles. References [1] S. N. Bernstein, Lecons sur les Propriétés Extréales et la Meilleure Approxiation des Fonctions Analytiques d une Variable Réele, Gauthier-Villars, Paris, 1926. [2] L. A. Harris, Bounds on the derivatives of holoorphic functions of vectors, Proc. Colloq. Analysis, Rio de Janeiro, 1972, 145 163, Act. Sci. et Ind., Herann, Paris, 1975. [3], Coentary on probles 73 and 74, The Scottish Book, R. D. Mauldin, Ed., Birkhäuser 1981, 143 150. [4], Bernstein s polynoial inequalities and functional analysis, Irish Math. Soc. Bull. 36(1996), 19-33. [5], Coefficients of polynoials of restricted growth on the real line, (to appear in J. Approx. Theory). 10

[6] E. Hille and R. S. Phillips, Functional Analysis and Sei-Groups, Aer. Math. Soc. Colloq. Publ., Vol. 31, AMS, Providence, 1957. [7] L. Nachbin, Topology on Spaces of Holoorphic Mappings, Ergebnisse 47, Springer-Verlag, New York, 1969. [8] P. Nevai and V. Totik, Weighted polynoial inequalities, Constr. Approx. 2(1986), 113 127. [9] Y. Sarantopoulos, Bounds on the derivatives of polynoials on Banach spaces, Math. Proc. Cab. Phil. Soc. 110(1991), 307 312. 11