GLAESER S INEQUALITY ON AN INTERVAL. 1. Introduction

Similar documents
Houston Journal of Mathematics. c 2015 University of Houston Volume 41, No. 4, 2015

2tdt 1 y = t2 + C y = which implies C = 1 and the solution is y = 1

Taylor and Maclaurin Series. Approximating functions using Polynomials.

Taylor and Maclaurin Series. Approximating functions using Polynomials.

A VARIANT OF HOPF LEMMA FOR SECOND ORDER DIFFERENTIAL INEQUALITIES

UNIQUENESS OF nth ORDER DIFFERENTIAL SYSTEMS WITH STRONG SINGULARITY

Math 651 Introduction to Numerical Analysis I Fall SOLUTIONS: Homework Set 1

9.5. Polynomial and Rational Inequalities. Objectives. Solve quadratic inequalities. Solve polynomial inequalities of degree 3 or greater.

A NOTE ON LINEAR FUNCTIONAL NORMS

Chapter 9: Infinite Series Part 2

1 Lyapunov theory of stability

Worksheet 9. Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates.

Examples of Dual Spaces from Measure Theory

King Fahd University of Petroleum and Minerals Prep-Year Math Program Math Term 161 Recitation (R1, R2)

8.7 Taylor s Inequality Math 2300 Section 005 Calculus II. f(x) = ln(1 + x) f(0) = 0

be the set of complex valued 2π-periodic functions f on R such that

Families of Functions, Taylor Polynomials, l Hopital s

TAYLOR AND MACLAURIN SERIES

Introduction to Functional Analysis

(a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff

Analysis Comprehensive Exam Questions Fall F(x) = 1 x. f(t)dt. t 1 2. tf 2 (t)dt. and g(t, x) = 2 t. 2 t

Consequences of Continuity and Differentiability

1+t 2 (l) y = 2xy 3 (m) x = 2tx + 1 (n) x = 2tx + t (o) y = 1 + y (p) y = ty (q) y =

Section Taylor and Maclaurin Series

Unconstrained minimization of smooth functions

6.2 Fubini s Theorem. (µ ν)(c) = f C (x) dµ(x). (6.2) Proof. Note that (X Y, A B, µ ν) must be σ-finite as well, so that.

The Mean Value Inequality (without the Mean Value Theorem)

Taylor polynomials. 1. Introduction. 2. Linear approximation.

Problem set 1, Real Analysis I, Spring, 2015.

Math Review for Exam Answer each of the following questions as either True or False. Circle the correct answer.

Notes on uniform convergence

Solutions to Math 1b Midterm II

Lecture 34: Recall Defn: The n-th Taylor polynomial for a function f at a is: n f j (a) j! + f n (a)

doi: /j.jde

Pointwise and Uniform Convergence

Note: Unless otherwise specified, the domain of a function f is assumed to be the set of all real numbers x for which f (x) is a real number.

Solutions to Sample Problems for Midterm

4.9 APPROXIMATING DEFINITE INTEGRALS

Functions and Equations

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2014

2019 Spring MATH2060A Mathematical Analysis II 1

CHAPTER 10: POLYNOMIALS (DRAFT)

Solutions to Homework 2

CONTENTS. Preface Preliminaries 1

ERRATA for Calculus: The Language of Change

Precalculus. Precalculus Higher Mathematics Courses 85

We consider the problem of finding a polynomial that interpolates a given set of values:

Convex Functions and Optimization

Section 4.2: The Mean Value Theorem

A COUNTEREXAMPLE TO AN ENDPOINT BILINEAR STRICHARTZ INEQUALITY TERENCE TAO. t L x (R R2 ) f L 2 x (R2 )

Solving simple equations, a review/primer

DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO

Alg Review/Eq & Ineq (50 topics, due on 01/19/2016)

a j x j. j=0 The number R (possibly infinite) which Theorem 1 guarantees is called the radius of convergence of the power series.

Scientific Computing

Systems of Equations and Inequalities. College Algebra

MATH 100 and MATH 180 Learning Objectives Session 2010W Term 1 (Sep Dec 2010)

Homework 11. Solutions

Taylor and Maclaurin Series. Copyright Cengage Learning. All rights reserved.

We have been going places in the car of calculus for years, but this analysis course is about how the car actually works.

Bounded Derivatives Which Are Not Riemann Integrable. Elliot M. Granath. A thesis submitted in partial fulfillment of the requirements

Fourier Series. 1. Review of Linear Algebra

Let s Get Series(ous)

Analysis Comprehensive Exam Questions Fall 2008

CS 542G: Robustifying Newton, Constraints, Nonlinear Least Squares

Math Numerical Analysis

Numerical Analysis: Interpolation Part 1

1 Introduction The study of the existence of solutions of Variational Inequalities on unbounded domains usually involves the same sufficient assumptio

1.5 Approximate Identities

1. Nonlinear Equations. This lecture note excerpted parts from Michael Heath and Max Gunzburger. f(x) = 0

1. For each statement, either state that it is True or else Give a Counterexample: (a) If a < b and c < d then a c < b d.

x 2 x n r n J(x + t(x x ))(x x )dt. For warming-up we start with methods for solving a single equation of one variable.

Queens College, CUNY, Department of Computer Science Numerical Methods CSCI 361 / 761 Spring 2018 Instructor: Dr. Sateesh Mane.

Analysis II - few selective results

The function graphed below is continuous everywhere. The function graphed below is NOT continuous everywhere, it is discontinuous at x 2 and

Math 132 Mean Value Theorem Stewart 3.2

Analysis II: Basic knowledge of real analysis: Part V, Power Series, Differentiation, and Taylor Series

Math 104 Calculus 8.8 Improper Integrals. Math Yu

Math 104 Section 2 Midterm 2 November 1, 2013

PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes

MTH 299 In Class and Recitation Problems SUMMER 2016

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Practice Final Exam Solutions

Caculus 221. Possible questions for Exam II. March 19, 2002

NONTRIVIAL SOLUTIONS FOR SUPERQUADRATIC NONAUTONOMOUS PERIODIC SYSTEMS. Shouchuan Hu Nikolas S. Papageorgiou. 1. Introduction

Nonnegative functions as squares or sums of squares

Review and problem list for Applied Math I

Solutions Exam 4 (Applications of Differentiation) 1. a. Applying the Quotient Rule we compute the derivative function of f as follows:

ARE202A, Fall Contents

( f ^ M _ M 0 )dµ (5.1)

Constrained Optimization Theory

II - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

2015 Math Camp Calculus Exam Solution

164 Final Solutions 1

Semester Review Packet

A CLASS OF NEW TRIGONOMETRIC INEQUALITIES AND THEIR SHARPENINGS

Constructing Taylor Series

Chapter 3a Topics in differentiation. Problems in differentiation. Problems in differentiation. LC Abueg: mathematical economics

1 Question related to polynomials

Transcription:

GLAESER S INEQUALITY ON AN INTERVAL ADA COFFAN AND YIFEI PAN Abstract. We use elementary methods to find pointwise bounds for the first derivative of a real valued function with a continuous, bounded second derivative on an interval. 1. Introduction By Glaeser s inequality, we refer to the elementary calculus theorem that for a function f which is nonnegative on R and has continuous second derivative bounded above by >0on R, the first derivative satisfies the inequalities (1) f(x) f (x) f(x) at every point x R. The surprising part of the statement, and possibly the reason it is not more well-known, is that even though the conclusion is a pointwise inequality, the assumptions are global: f must satisfy the stated conditions on the entire number line R. The inequality f (x) f(x) is clearly false for nonnegative functions f defined only on an interval (a, b) or ray (a, ); the function f(x) =x on the interval (0, ) is an easy counterexample. We refer to the literature ([G], [LN]) for the history and various proofs of Glaeser s inequality, and we note that it and its generalizations to several variables are topics of recent research interest ([CV], [NS]) in the field of partial differential equations. The related problem of estimating the maximum value of f on R or a subinterval goes back at least to Landau ([CS]). Our goal here is to find local versions of Glaeser s pointwise inequality for f : to replace the domain R in the theorem with a subinterval of R, possibly at the expense of imposing boundary conditions or getting a weaker pointwise bound. Some further examples are instructive regarding the need for all the hypotheses in Glaeser s theorem. Given f(x) 0onaninterval(a, b), a first attempted approach might be to extend f to a nonnegative function on R, and then apply Glaeser s inequality to the extension. The example f(x) =x on (0, ) already shows what goes wrong: f does not extend to a nonnegative differentiable function on R; ifitdid,thenf (0) would have to be 1 and f would be increasing near 0 and negative for x 0, a contradiction. To avoid this issue, we could try assuming that f approaches 0 near the left endpoint, but this boundary condition by itself is still not enough for the extension to satisfy either the assumptions or the conclusion of Glaeser s inequality. Considering the example f(x) =x 3/ on (0, ), f extends to the nonnegative, differentiable function x 3/ on R, but f is unbounded and f is not bounded pointwise on (0, ) byμ f for any scalar μ. SC 010: 6D10. Keywords: Calculus, pointwise inequality. 1

ADA COFFAN AND YIFEI PAN If we consider an extra assumption: that f is increasing on an interval (a, b), in addition to satisfying f(x) 0, lim f (x) = 0, and f (x), then we get the inequalities (1) for x a + x (a, b) via a one-line proof: 1 () (f (x)) = lim f (t)f (t)dt f (t)dt f(x). w a + w a However, the increasing assumption seems too strong and it would be more satisfactory to find a result that holds even if f changes sign infinitely many times on an interval.. The inequality with boundary conditions Our main result, Theorem.1, does not assume that f is increasing; the Proof uses a method different from (), but which is still elementary. One might expect a limit condition on f at one endpoint, a, toleadtoestimatesforf that hold only near a, but it turns out that this condition (and f (x) for a<x<b) is enough to guarantee the same upper bound as (1) on the whole interval (a, b). Under the further condition that f is bounded below by B, we obtain the lower bound f (x) f(x) on a certain subinterval (a, c], where c depends on and B but not on f. For simplicity, we consider the interval I =(0,C); the result clearly can be translated to an interval (a, b). Theorem.1. Given f : I R, suppose: f(x) 0 for all x I; f (x) is continuous on I [wedenotethisbyf C (I)]; there is a constant >0so that f (x) for all x I; lim f (x) =0. x 0 + Let { } f(x) s(x) =max 1,. (C x) Then, for all x I, (3) f (x) f(x), and f (x) ( 1 f(x) s(x) + s(x) ) (4). If, in addition, there is a constant B< so that B f (x) for all x I, let { } f(x) ŝ(x) =max 1, χ (C x) ( ; B C, )(x) then f satisfies: { f (x) max Bx, ( 1 f(x) ŝ(x) + ŝ(x) )}.

GLAESER S INEQUALITY ON AN INTERVAL 3 Proof. Extending f to a continuous function on [0,C)withf (0) = 0, the ean Value Theorem applies for 0 <t<c: f (t) f (0) (5) = f (c 1 ) = f (t) =f (c 1 )t = f (t) t. t 0 Similarly, if there is a lower bound f B, then (6) Bt f (t). We refer to (5) and (6) as the linear bounds on f. Fix x I; then, for any y I, integration gives: (7) t y x f (s)dsdt = y (f (t) f (x))dt = [ f(t) tf (x) ] t=x t=y = (f(x) xf (x)) (f(y) yf (x)) = f(y) = f(x) (x y)f (x)+ y t f (s)dsdt (8) = 0 f(x) (x y)f (x)+ 1 (x y). The first line is where the assumption of the continuity of f is used, in the Fundamental Theorem of Calculus (so, the C hypothesis may be weakened as in [CS], [NS]). Line (7) is the well-known first-order Taylor polynomial with integral remainder term. The last line uses the upper bound f and the assumption f(y) 0. Let Δx = x y; then0<y<cis equivalent to x C<Δx <x, and the non-negativity of the quadratic (8) for all y I is equivalent to 1 (9) (Δx) f (x)δx + f(x) 0 for all Δx (x C, x), which (using >0) leads to three cases. Case 1. The quadratic (9) is always positive or has a double root: ( f (x)) 4 1 f(x) 0 = f (x) f(x). Case. The quadratic (9) has distinct real zeros, the lesser one is to the right of the interval (x C, x), so (f (x)) f(x) > 0and x f (x) (f (x)) f(x) = f (x) x+ (f (x)) f(x), however, this contradicts the linear bound f (x) x. Case 3. The quadratic (9) has distinct real zeros, the greater one is to the left of the interval (x C, x), so (f (x)) f(x) > 0and x C f (x)+ (f (x)) f(x) (10) = f (x) (x C) (f (x)) f(x),

4 ADA COFFAN AND YIFEI PAN which implies f (x) < 0 and establishes (3). f (x)+(c x) (f (x)) f(x) < 0 = (f (x)+(c x)) (f (x)) f(x) = f (x)(c x)+ (C x) f(x) (11) = f (x) f(x) (C x). C x The inequalities (10) and (11) are consistent only if: f(x) (C x) C x < (x C) f(x) (C x) >. The lower bounds from Cases 1 and 3 are: (1) f (x) f(x), if f(x) (C x), ( ) f(x) f (C x) (x) +, if < f(x) C x (C x). It follows from the arithmetic-geometric mean inequality that f(x) f(x) C x + (C x),so the lower bound from (13) is always less than or equal to the lower bound from (1), and they coincide when = f(x). It is elementary to check that (1) and (13) together imply (4). (C x) In the case where f B, from (10) and the linear bound (6) we can conclude Bx f (x) <(x C), and it follows that x> B C. We include the characteristic function χ ( B expression for ŝ(x) to show that Case 3 does not occur for 0 <x B C; in particular, if B 0, Case 3 does not occur for any x I. C, )(x) inthe Example.. Considering f(x) = 1 x on an interval (0,C), the upper bound (3) in the Theorem is sharp, in the sense that for some f(x), equality is achieved at every point x. However, for some other f(x) suchas 1 x + 1, the linear upper bound (5) is better. Example.3. This example shows that the lower bound can also be reached, in this case by a function that vanishes at the endpoint C. Let f(x) =x (1 x) =x x 3, on the interval (0, 1). Then f (0) = 0 and f (x) = 6x is bounded above by =andbelowbyb = 4. For x in the interval (0, 1 ( 5 1)], f(x) (1 x) =, and the Theorem s bounds (3) and (1) are: (14) 4(x x 3 ) f (x) =x 3x 4(x x 3 ). In fact, (14) holds on the larger interval (0, 8 9 ] and the upper bound holds on the whole interval (0, 1), but the lower bound from (14) is false for x close to 1. For x in the interval ( 1 ( 5 1), 1),

f(x) (1 x) >=,x> { max 4x, B = 1 3 GLAESER S INEQUALITY ON AN INTERVAL 5, and the Theorem s bounds (3), (6), and (13) are: )} = x + x 1 x 3x 4(x x 3 ). ( f(x) (1 x) + 1 x As x 1, the inequalities approach 1 1 0. From the Proof of Theorem.1, we see that Glaeser s lower bound (1) fails only for x that are close to the endpoint without the boundary condition, and that fall into Case 3. The inequality (1) can be recovered by avoiding Case 3 in two ways: first, we could replace (0,C)by(0, ) in Theorem.1; an examination of the Proof shows that Case 3 is excluded. Second, we could add another limit condition at the other endpoint of I =(0,C), lim f (x) = 0. Then there x C is another linear bound f (x) (x C), which contradicts (10), so Case 3 in the Proof of Theorem.1 is excluded again. Proposition.4. Let I denote the interval (0,C) or the ray (0, ). Given f : I R, suppose: f(x) 0 for all x I; f C (I); there is a constant >0so that f (x) for all x I; lim f (x) =0; x 0 + either I =(0, ) or lim f (x) =0. x C Then, for all x I, f(x) f (x) f(x). 3. The inequality without boundary conditions Removing all the boundary conditions on f leads to this version of the inequality, which we state for any interval (a, b). It can be proved by a straightforward adaptation of the Proof of Theorem.1. Proposition 3.1. Given f :(a, b) R, suppose: f(x) 0 for all x (a, b); f C ((a, b)); there is a constant >0so that f (x) for all x (a, b). { } { f(x) 1, (x a) and s r (x) =max 1, Let s l (x) =max f(x) (b x) }.Then,forallx (a, b), ( 1 f(x) s r (x) + s ) r(x) f (x) ( 1 f(x) s l (x) + s ) l(x). If, as in Proposition.4, there is no right endpoint b, then the lower bound f(x) holds on (a, ). For (a, b) =( R, R) andx at the midpoint 0, this is the same as the result stated in [LN]. Proposition 3.1 has Glaeser s inequality for the domain R as a limiting case, as a, b +. Example 3.. The function f(x) = 1 x on the interval ( 1, 1) gives an example where f is unbounded at both endpoints and f is concave down everywhere. For any x, allowing to decrease to 0 makes both expressions s l (x) ands r (x) greater than 1.

6 ADA COFFAN AND YIFEI PAN Acknowledgments. The authors thank anonymous referees for their comments which improved the statements of the results. References [CV] I. Capuzzo Dolcetta and A. Vitolo, C 1,α and Glaeser type estimates, Rendiconti di atematica, Serie VII, 9 (009), 17 7. R 548484 (010i:35090). [CS] C. Chui and P. Smith, A note on Landau s problem for bounded intervals, American ath. onthly (9) 8 (1975), 97 99. R 0457654 (56 #15859). [G] G. Glaeser, Racine carrée d une fonction différentiable, Ann. Inst. Fourier (Grenoble) () 13 (1963), 03 10. R 0163995 (9 #194). [LN] Y. Y. Li and L. Nirenberg, Generalization of a well-known inequality, in Contributions to Nonlinear Analysis, 365 370, Progr. Nonlinear Differential Equations Appl. 66, Birkhäuser, Basel, 006. R 187814 (006g:6030). [NS] T. Nishitani and S. Spagnolo, An extension of Glaeser inequality and its applications, OsakaJ. ath.(1) 41 (004), 145 157. R 040070 (004m:607). Department of athematical Sciences, Indiana University - Purdue University Fort Wayne, 101 E. Coliseum Blvd., Fort Wayne, IN, USA 46805-1499 E-mail address: CoffmanA@ipfw.edu URL: http://ipfw.edu/math/ College of athematics and Information Sciences, Jiangxi Normal University, Nanchang, P.R.China E-mail address: Pan@ipfw.edu