Estimates of the Remainder in Taylor's Theorem Using the Henstock-Kurzweil Integral

When a real-valued function of one variable is approximated by its nth degree Taylor polynomial, the remainder is estimated using the Alexiewicz and Lebesgue p-norms in cases where f ⁽ⁿ⁾ or f ⁽ⁿ⁺¹⁾ are Henstock-Kurzweil integrable. When the only assumption is that f ⁽ⁿ⁾ is Henstock-Kurzweil integrable then a modified form of the nth degree Taylor polynomial is used. When the only assumption is that f ⁽ⁿ⁾ ∈ C ⁰ then the remainder is estimated by applying the Alexiewicz norm to Schwartz distributions of order 1. Research partially supported by the Natural Sciences and Engineering Research Council of Canada. An adjunct appointment in the Department of Mathematical and Statistical Sciences, University of Alberta, made valuable library and computer resources available.     

Polya's inequalities, global uniform integrability and the size of plurisubharmonic lemniscates

First we prove a new inequality comparing uniformly the relative volume of a Borel subset with respect to any given complex euclidean ballB⊂C ⁿ with its relative logarithmic capacity inC ⁿ with respect to the same ballB. An analogous comparison inequality for Borel subsets of euclidean balls of any generic real subspace ofC ⁿ is also proved. Then we give several interesting applications of these inequalities. First we obtain sharp uniform estimates on the relative size of plurisubharmonic lemniscates associated to the Lelong class of plurisubharmonic functions of logarithmic singularities at infinity onC ⁿ as well as the Cegrell class of plurisubharmonic functions of bounded Monge-Ampère mass on a hyperconvex domain Ω⊂(C ⁿ . Then we also deduce new results on the global behaviour of both the Lelong class and the Cegrell class of plurisubharmonic functions. This work was partially supported by the programmes PARS MI 07 and AI.MA 180.     

The geometry of the asymptotics of polynomial maps

The aim of this paper is to develop a theory for the asymptotic behavior of polynomials and of polynomial maps overR and overC and to apply it to the Jacobian conjecture. This theory gives a unified frame for some results on polynomial maps that were not related before. A well known theorem of J. Hadamard gives a necessary and sufficient condition on a local diffeomorphismf: R ⁿ →R ⁿ to be a global diffeomorphism. In order to show thatf is a global diffeomorphism it suffices to exclude the existence of asymptotic values forf. The real Jacobian conjecture was shown to be false by S. Pinchuk. Our first application is to understand his construction within the general theory of asymptotic values of polynomial maps and prove that there is no such counterexample for the Jacobian conjecture overC. In a second application we reprove a theorem of Jeffrey Lang which gives an equivalent formulation of the Jacobian conjecture in terms of Newton polygons. This generalizes a result of Abhyankar. A third application is another equivalent formulation of the Jacobian conjecture in terms of finiteness of certain polynomial rings withinC[U, V]. The theory has a geometrical aspect: we define and develop the theory of etale exotic surfaces. The simplest such surface corresponds to Pinchuk's construction in the real case. In fact, we prove one more equivalent formulation of the Jacobian conjecture using etale exotic surfaces. We consider polynomial vector fields on etale exotic surfaces and explore their properties in relation to the Jacobian conjecture. In another application we give the structure of the real variety of the asymptotic values of a polynomial mapf: R ² →R ² .     

Derivatives of Computable Functions

As is well known the derivative of a computable and C¹ function may not be computable. For a computable and C∞ function f, the sequence {f⁽ⁿ⁾} of its derivatives may fail to be computable as a sequence, even though its derivative of any order is computable. In this paper we present a necessary and sufficient condition for the sequence {f⁽ⁿ⁾} of derivatives of a computable and C^∞ function f to be computable. We also give a sharp regularity condition on an initial computable function f which insures the computability of its derivative f′.     

A counterexample in copositive approximation

The present paper gives a converse result by showing that there exists a functionf ∈C _[−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE _n ⁽⁰⁾ (f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E _n(f) is the ordinary best polynomial approximation off of degreen.     

Polynomials of best approximation inC[−1,1]

Equivalences between the condition |P _n ^(k) (x)|≦K(n ⁻¹√1−x ²+1/n ²) ^k n ^-a, whereP _n(x) is the bestn-th degree polynomial approximation tof(x), and the Peetre interpolation space betweenC[−1,1] and the space (1−x ²) ^k f ^(2k)(x)∈C[−1,1] is established. A similar result is shown forE _n(f)= ‖f−P _n‖ _C[−1,1]. Rates other thann ^-a are also discussed. Supported by NSERC grant A4816 of Canada.     

On the Convergence and Iterates of q-Bernstein Polynomials

The convergence properties of q-Bernstein polynomials are investigated. When q1 is fixed the generalized Bernstein polynomials _nf of f, a one parameter family of Bernstein polynomials, converge to f as n→∞ if f is a polynomial. It is proved that, if the parameter 0<q<1 is fixed, then _nf→f if and only if f is linear. The iterates of _nf are also considered. It is shown that _n^Mf converges to the linear interpolating polynomial for f at the endpoints of [0,1], for any fixed q>0, as the number of iterates M→∞. Moreover, the iterates of the Boolean sum of _nf converge to the interpolating polynomial for f at n+1 geometrically spaced nodes on [0,1].     

On the uniform modulus of continuity of certain discrete approximation operators

For a certain class of discrete approximation operators B_n^f defined on an interval I and including, e.g., the Bernstein polynomials, we prove that for all f ε C(I), the ordinary moduli of continuity of B_n^f and f satisfy ω(B_n^f; h) cω(f; h), N = 1,2,…, 0 < h < ∞, with a universal constant c > 0. A similar result is shown to hold for a different modulus of continuity which is suitable for functions of polynomial growth on unbounded intervals. Some special operators are discussed in this connection.     

An extremal property of Hermite polynomials

Let H_n be the nth Hermite polynomial, i.e., the nth orthogonal on polynomial with respect to the weight w(x)=exp(−x²). We prove the following: If f is an arbitrary polynomial of degree at most n, such that |f||H_n| at the zeros of H_n+1, then for k=1,…,n we have f^(k)H_n^(k), where · is the norm. This result can be viewed as an inequality of the Duffin and Schaeffer type. As corollaries, we obtain a Markov-type inequality in the norm, and estimates for the expansion coefficients in the basis of Hermite polynomials.     

Jackson's theorem for compact connected Lie groups

We prove that for f ε E = C(G) or L^p(G), 1 p < ∞, where G is any compact connected Lie group, and for n 1, there is a trigonometric polynomial t_n on G of degree n so that f − t_nE C_rω_r(n⁻¹,f). Here ω_r(t, f) denotes the rth modulus of continuity of f. Using this and sharp estimates of the Lebesgue constants recently obtained by Giulini and Travaglini, we obtain “best possible” criteria for the norm convergence of the Fourier series of f.     

A note on an error estimate for least squares approximation

An asymptotic expansion is obtained which provides upper and lower bounds for the error of the bestL ₂ polynomial approximation of degreen forx ⁿ⁺¹ on [–1, 1]. Because the expansion proceeds in only even powers of the reciprocal of the large variable, and the error made by truncating the expansion is numerically less than, and has the same sign as the first neglected term, very good bounds can be obtained. Via a result of Phillips, these results can be extended fromx ⁿ⁺¹ to anyfC ⁿ⁺¹[–1, 1], provided upper and lower bounds for the modulus off ⁽ⁿ⁺¹⁾ are available.     

Univalence Criteria Starting from the Method of Loewner Chains

The paper continues the work of Royster (Duke Math J 19:447–457, 1952), Mocanu [Mathematica (Cluj) 22(1):77–83, 1980; Mathematica (Cluj) 29:49–55, 1987], Cristea [Mathematica (Cluj) 36(2):137–144, 1994; Complex Var 42:333–345, 2000; Mathematica (Cluj) 43(1):23–34, 2001; Mathematica (Cluj), 2010, to appear; Teoria Topologica a Functiilor Analitice, Editura Universitatii Bucuresti, Romania, 1999] of extending univalence criteria for complex mappings to C ¹ mappings. We improve now the method of Loewner chains which is usually used in complex univalence theory for proving univalence criteria or for proving quasiconformal extensions of holomorphic mappings f : B → C ⁿ to C ⁿ . The results are surprisingly strong. We show that the usual results from the theory, like Becker’s univalence criteria remain true for C ¹ mappings and since we use a stronger form of Loewner’s theory, we obtain results which are stronger even for holomorphic mappings f : B → C ⁿ . In our main result (Theorem 4.1) we end the researches dedicated to quasiconformal extensions of K-quasiregular and holomorphic mappings f : B → C ⁿ to C ⁿ . We show that a C ¹ quasiconformal map f : B → C ⁿ can be extended to a quasiconformal map F : C ⁿ → C ⁿ , without any metric condition imposed to the map f.     

LIMIT OF ITERATES FOR BERNSTEIN POLYNOMIALS DEFINED ON A TRIANGLE

Let f∈C[0,1],and Bn(f,x) be the a-th Bernstein polynomial associated with function f.ln 1967,the limit of iterates for B.(f,x) was given by Kelisky and Rivlin.After this,Many mathematicians studied and generalized this result.But anyway,all these discussions are only for univariate case ,In this paper,the main contrlbution is that the limit of lterates for Bernstein polynomial defined on a triangle is given completely.     

Factorization for non-nevanlinna classes of analytic functions

A generalization of the Blaschke product is constructed. This product enables one to factor out the zeros of the members of certain non-Nevanlinna classes of functions analytic in the unit disc, so that the remaining (non-vanishing) functions still belong to the same class. This is done for the classesA ⁻ⁿ (0<n<∞) andB ⁻ⁿ (0<n<2) defined as follows:f ∈A ⁻ⁿ iff |f(z)|≦C _f (1−|z|)⁻ⁿ ,f ∈B ⁻ⁿ iff |f(z)|≦exp {C _f (1−|z|)⁻ⁿ }, whereC _f depends onf.     

Polynomials and Hankel matrices

Compatibility of a Hankel n × n matrix H and a polynomial f of degree m, m ? n, is defined. If m = n, compatibility means that HC^T_f=C_fH where C_f is t companion matrix of f. With a suitable generalization of C_f, this theorem is generalized to the case that m < n.     

Inversion and characterization of the hemispherical transform

Explicit inversion formulas are obtained for the hemispherical transform(FΜ)(x) = Μ{y ∃S ⁿ :x. y ≥ 0},x ∃S ⁿ, whereS ⁿ is thendimensional unit sphere in ℝⁿ⁺¹,n ≥ 2, and Μ is a finite Borel measure onS ⁿ. If Μ is absolutely continuous with respect to Lebesgue measuredy onS ⁿ, i.e.,dΜ(y) =f(y)dy, we write(F f)(x) = ∫ _{x.y> 0} f(y)dy and consider the following cases: (a)f ∃C ^∞(Sⁿ); (b)f ∃ L^p(S ⁿ), 1 ≤ p < ∞; and (c)f ∃C(Sⁿ). In the case (a), our inversion formulas involve a certain polynomial of the Laplace-Beltrami operator. In the remaining cases, the relevant wavelet transforms are employed. The range ofF is characterized and the action in the scale of Sobolev spacesL _p ^γ (Sⁿ) is studied. For zonalf ∃ L¹(S ²), the hemispherical transformF f was inverted explicitly by P. Funk (1916); we reproduce his argument in higher dimensions. Partially sponsored by the Edmund Landau Center for Research in Mathematical Analysis, supported by the Minerva Foundation (Germany).     

On the Bloch Constant for Κ-Quasiconformal Mappings in Several Complex Variables

We study the Bloch constant for Κ-quasiconformal holomorphic mappings of the unit ball B of C ⁿ . The final result we prove in this paper is: If f is a Κ-quasiconformal holomorphic mappig of B into C ⁿ such that det(f′(0)) = 1, then f(B) contains a schlicht ball of radius at least where C _n > 1 is a constant depending on n only, and as n→∞. Received June 24, 1998, Accepted January 14, 1999     

On a Conjecture Concerning Strong Unicity Constants

Let fC[−1, 1] be real-valued. We consider the sequence of strong unicity constants (γ_n(f))_n induced by the polynomials of best uniform approximation of f. It is proved that lim inf_n→∞ γ_n(f)=0, whenever f is not a polynomial.     

On the Convergence in Capacity of Rational Approximants

Let {r _n } be a sequence of rational functions deg( r _n ≤ n) that converge rapidly in measure to an analytic function f on an open set in C ^N . We show that {r _n } converges rapidly in capacity to f on its natural domain of definition W _f (which, by a result of Goncar, is an open subset of C ^N ). In particular, for f meromorphic on C ^N and analytic near zero the sequence of Padé approximants {π _n (z, f, λ)} (as defined by Goncar) converges rapidly in capacity to f on C ^N . January 14, 1999. Date revised: October 7, 1999. Date accepted: November 1, 1999.     

Negative result in pointwise 3-convex polynomial approximation

Let Δ³ be the set of functions three times continuously differentiable on [−1, 1] and such that f″′(x) ≥ 0, x ∈ [−1, 1]. We prove that, for any n ∈ ℕ and r ≥ 5, there exists a function f ∈ C ^r [−1, 1] ⋂ Δ³ [−1, 1] such that ∥f ^(r)∥ _{C[−1, 1]} ≤ 1 and, for an arbitrary algebraic polynomial P ∈ Δ³ [−1, 1], there exists x such that