Getting on For all the preceding functions, discuss, whenever possible, whether local min and max are global.

Save this PDF as:

Size: px
Start display at page:

Download "Getting on For all the preceding functions, discuss, whenever possible, whether local min and max are global."

Transcription

1 Problems Warming up Find the domain of the following functions, establish in which set they are differentiable, then compute critical points. Apply 2nd order sufficient conditions to qualify them as local ma, min, saddle or can t tell.. f, y = 3 + y y. 2. f, y = lny 2y 2 3. f, y = y 2 2y. f, y = y 3 y 2 + 3y + 2y f, y = 3 + y 5 3 3y f, y = 2 8y + e y 7. f, y = ln 2 + y 2 y 8. f, y = e 2 +y y 9. f, y = 2 y 2 0. f, y = lny 2 2 3y 2. f, y = y f, y = 2 y + y f, y = ln y 2 +y 2 Getting on For all the preceding functions, discuss, whenever possible, whether local min and ma are global.

2 Answer to problems Altogether, we answer the warming up and the getting on part. Solution to # The function f, y = 3 + y y, is defined by a polinomial, hence is differentiable infinte times, with continuous derivatives on R 2. Gradient is + y + 3 f, y = 2 + y 2 + 2y Critical points are solutions to + y y 2 = 0 + 2y = 0 that is the set Z = 0,, 0; 0, 23 }, 2 ; 2, 2 Hessian matri is D 2 6 2y + f, y = 2y + 2 det D 2 f0, 0 = 0 = 6 < 0, 0; 0 saddle point. 2 det D 2 f0, 0 = = 6 < 0, 0; saddle point. 3 det D 2 f2, 2 = = 32 > 0 and a, = 8 > 0, 2; 2 local min. 3 det D 2 f 2 3, 2 = = 32 3 > 0 and a, = 8 < 0, 2 3 ; 2 local ma. 3 Local are not global, ma and min. To prove it, it suffices to observe that and inf R f, = f, = while sup f, = + R Solution to #2. The function f, y = lny 2y 2, Hessian is defined on the open set D =, y R 2 : > 0, y > 0 }, y R 2 : < 0, y < 0 } where it is infinite times continuously differentiable. Gradient is f, y = y + y Critical points are solutions to = 0 y + y = 0 2

3 which solutions are [ [ =, y = 2], and =, y = 2] so that the set of critical points is singleton Z =, } 2 Hessian matri is D 2 f, y = y 2 so that D 2 f 0, 2 = which is negative definite,, local ma. Note that no global min eists: if it eisted, as D is an open set, it would be also a local min, but no local min eists. On the other hand, there is no global ma either. Indeed, for < 0 and y = we have lim f, = lim f t, = lim t + ln t + t 2 = +. t + Remark. Note that the function is *not* concave on D, since D is not a conve set; f is concave on the subset of the domain, y R 2 : > 0, y > 0 } where it attains maimum, but the same conclusion cannot be drawn on the whole domain. Solution to #3 f, y = y 2 2y,, 2 2 = 0 Gradient is f, y =, 2y 2 = = 0 Solution is: [ =, y = ] 2y 2 = Hessian is, f conve, global min 0 2 Ma does not eist f, y = 2 + y 2 2 so that Solution to # lim f, = = + sup f = + R 2. f, y = y 3 y 2 + 3y + 2y 3 2, 6 + 3y Gradient is f, y = 3 2y 3y y = 0 [ Critical points 3 2y 3y = 0, = 97+ 2, y = Hessian is D 2 f, y = 3 6y , determinant: 3 97 < 0 saddle, determinant: 3 97 a local ma 3 ] [, = 97 2, y = ] 97 2

4 Not a global ma, for sup f = lim f0, a = lim a 3 a 2 2a = + R 2 a + a + No global min otherwise it should be a critical point. Indeed we can say more, that is inf f = lim f0, a = lim a 3 a 2 + 2a = R 2 a + a + Solution to #5 f, y = 3 + y 5 3 3y + 2 2,, Gradient is f, y = 3 y = 0 Critical points 3 y 5 2, 3 = 0 Solution is: [ = 3, y = 6], [ =, y = 6], [ = 3, y = ], [ =, y = ] 6 0 Hessian is D 2 f, y =, 0 6y D 2 f 3, 6 =, determinant: 2, saddle point D 2 f, 6 =, determinant: 2, local min, not globlal for inf f = D 2 f 3, = D 2 f, = Solution to #6 f, y = 2 8y + e y y 2 8 Gradient is 8 + e y + 2 Critical points, determinant: 2, local ma, not a global ma for sup f = +, determinant: 2, saddle point y 2 8 = e y + 2 = 0, if y = = 0, Solution is: = 5, = 5 + if = e y 6 = 0, y = ln 6 2y 2 8 Hessian is D 2 f = 2 8 e y D 2 f 5, 0 = D 2 f + 5, 0 = 5, 0; + 5, 0,, ln , determinant: 60, saddle point, determinant: 60, saddle point

5 2 ln D 2 f, ln 6 = ln e Solution to #7. f, y = ln 2 + y 2 y lim f a, = lim a +, determinant: 32 ln 6 > 0, local min, but not global, as [ a 2 + 8a + e ] = inf f = a + The domain of f is D = R 2 \ 0, 0}, while the gradient is 2 f, y = 2 + y 2 y, 2y 2 + y 2 Note also that: - partial derivatives are defined and continuous at every point in D, - D is an open set then f is differentiable in D. Critical points are those P, y such that f, y = 0, that is, the set of solutions of the system 2 2 +y 2 y = 0 2y 2 +y 2 = 0 Case : Assume 0 and y 0 we have 2 2 +y y = 0 2 2y 2 +y = y y = y = 2 2y 2y = y 2 2 +y 2 = 2y 2 2 2y 2 = 0 2 +y = 2 2y + y y = 0 2 +y = 2 2y The first equation is satisfied either for a = y or b = y If a pluggin into second equation we get 2y 2 = 2 y2 = y =, y = so that the system is satisfied by, and,. If b, proceding similarly we get 2y 2 = 2 y2 = that has no real solution. Case 2: Let us wonder whether 0, y with y 0, or, 0 with 0 may be a solution. In the first case we get 0 y = 0 2y y 2 0 = 0 that has no solution. Similarly one derives that, 0 with 0 cannot be a solution. Critical points of f are, and,. We now compute Hessian matri. then 2 2 y 2 y D 2 f, y = 2 +y y 2 2 y 2 2 y 2 2 +y y 2 2 D 2 f, = D 2 f, =

6 whose determinant is -, then the matri is indefinte and both critical points are saddle points. Solution to #8 f, y = e 2 +y y. a D = R 2 ; b f is differentiable in D, with gradient f, y = c Critical points are solutions to 2e 2 +y 2 2y = 0 2ye 2 +y 2 2 = 0 2e 2 +y 2 2y, 2ye 2 +y 2 2 The first equation is satisfied if one of the factors is null, that is: = 0, or 2 e 2 +y 2 2y = 0 In case, the 2nd equation gives 2ye y2 = 0 y = 0, that implies 0, 0 is critical. In case 2, we plug 2y = e 2 +y 2 into the 2nd equation, deriving 22y 2 2 = 0 2y 2 2 = 0 2y 2y + = 0, hence either 2a = 2y or 2b = 2y In both cases, plugging = ± 2y into the st equation and assuming, y 0, 0 without loss of generality, as 0,0 has been already computed as a solution, we derive e 3y2 = 2y. Now we prove that such equation has no real solution, by showing the function ϕy := e 3y2 2y, has no zeroes ϕ in R. In particular it suffices to show that ϕ is strictly positive everywhere. Surely ϕ has no zero in, 0] because in such interval e 3y2 > 0 while 2y 0, which implies ϕy > 0 for all y 0. There eist no zero of ϕ also in ]0, 2 ], that is for 0 < y /2, as y > 0 e 3y2 > and 2y so that y > 0 ϕy = e 3y2 2y > = 0, y ]0, 2 ]. What is left to check is the zeroes in ]/2, + [. Note that if we show that ϕ y > 0 for all y > /2 that is, ϕ increasing in ]/2, + [ we may derive that no zero eists in ]/2, + [, as ϕ/2 > 0 and ϕ increasing in ]/2, + [ implies ϕy ϕ/2 > 0, for all y ]/2, + [. Then we show now ϕ y > 0 for all y > /2. Note that ϕ y = 6ye 32 2, so that ϕ /2 = 3e 3/ 2 > 0. Moreover ϕ y = e 3y y 2 > 0 for all y. Then ϕ is itself increasing and positive in /2, the it is strictly positive for all y > /2. The only critical point is 0, 0. d Hessian is D 2 f, y = 2e 2 +y y ye 2 +y 2 ye 2 +y 2 2e 2 +y 2 + 2y 2 D 2 f0, 0 = Since f 0, 0 = 2 > 0, e det D 2 f0, 0 = > 0 we derive 0, 0 is a local min. Global minimization of f Weierstrass Theorem is needed, see lecture # We now discuss whether 0;0 is also a GLOBAL min. The idea is to prove that the originale problem is equivalent to maimizing f on a compact region. 6

7 As eponential function e 2 +y 2 grows, positively, at infinity faster than 2 y one may guess that indeed a global min does eist and is attained in a neighborhood of the origin. Nevertheless the assertion has to be precisely proven. We make use here of definition of global min and of Weierstrass Theorem in R n. If we show that f is coercive, that is in this case lim f = + + we may then infer that the f attains its minimum on R 2, and that the local minimizer is indeed a global minimizer. And consequently 0; 0 is shown to be the unique global minimum point for f on R 2. Why? If f coercive, there eists a radius R 0 > 0 such that inf R 2 f = inf B R0 f = min B R0 f where B R0 =, y R 2 : 2 + y 2 R 2 0}. Hence inf is indeed a min by means of Weierstrass Theorem, because f is continuous and B R0 is a compact subset of R n. Moreover, that is also a global min for f on the entire R 2. Ultimately, the minimizer has to be a critical point of f also, as it is a minimum attained on an open unbounded region. We then show that f is coercive. Let R > 0, and assume = R. Then 2 y R 3 so that for all, y B R 0; 0 one has f, y e R2 2R 3 =: ϕr Passing to limits as R +, we derive lim f, y lim + which implies that f is coercive. Solution to #9 ϕr = R + lim e R2 2R 3 = + R + f, y = 2 y 2 The domain is D =, y : y + y 0} =, y : y > 0 and + y > 0}, y : y 0 and + y 0} but f is differentiable only at D =, y : y + y > 0} =, y : y > 0 and + y > 0}, y : y < 0 and + y < 0} At any couple of type, or,, f attains the value 0 which is the minimum attainable value, hence global min points are, : R}, : R} Such points may not be met among critical points, as the function f is not differentiable at those points. A global ma does not eist, as lim f, 0 = lim =

8 Gradient is Critical points 2 y 2 y 2 y 2 Solution to #0. f, y = lny 2 2 3y 2, Domain D =, y : y > 2 + } y 2 Gradient is 2 6y + y 2 2 y 2 Critical points 2 = 0 6y + y 2 2 = 0, Solution is: P 0, P 2 0, / D, D Hessian is D 2 f 0, y 2 2 y y y = , whose determinant is: = , Then P 2 is a local ma. P 2 is the unique global maimizer. Alternative very epensive proof : f, y < ln y 3y 2 ma y> ln y 3y2 = f P 2 We now show that P 2 is a global ma. Indeed, let 0, y 0, y : y = }. Then lim f, y =,y ln = 0,y 0 so that there eists ε > 0 for instance, one may choose ε = 0.0 such that where the closed set D ε is given by for in the complement set sup D f = sup f D ε D ε =, y D : y ε}, y D D ε =, y D : < y < ε} f, y < ln ε 3y 2 < ln ε = ln 0.0 =. 60 < fp

9 Let s now show that If we do so then lim f, y =,y +,,y D sup D f = sup f = sup f D ε D ε B where B is a suitable closed ball centered at the origin and, being D ε B closed and bounded, hence compact, f would attain its ma in D ε B, hence in D, hence at P 2. Now note that y > 0, y + + y + + y + so that, if y +, then f, y < ln y 3y 2 ; if instead +, then y +, same conclusion, so that is proved. Solution to # Trivial: without any computation, 3, is the global minimizer and no local ma eists; sup f = +. Solution to #2 f, y = 2 y + y + 2,, The function is defined on D =, y : y 0} but differentiable in D o =, y : y > 0} 2 Gradient is y 2 y 2 y + 2 Critical points y 2 y = 0 y + = 0, Solution is: [ = 2, y = ] 8 Hessian is 2 = [ y2 y y 2 y 2 2 y 3 2 [ 3 ] ] = 2,y= 8 whose determinant is 2, so that 2, 8 is a local min. Nonetheless, it is not a global min. Indeed f 2, 8 = [ 2 ] y + y + 2 = = 2,y= 6 8 [ f, 00 = 2 ] y + y + 2 = 39 = Solution to #3 f, y = ln a Domain: y 2 +y 2. D =, y R 2 : =,y= 00 y 2 + y 2 > 0, 2 + y 2 0} =, y R 2 : y > 0,, y 0, 0} =, y R 2 : > 0, y > 0}, y R 2 : < 0, y < 0} 9

10 b f, y = y y 2, 2 y 2 2 +y 2 y differentiable in all D D open set and partial derivatives are continuous at every point of D. c The set of critical points Z is made of the solutions to that is y y 2 = 0 y 2 2 = 0 2 y 2 2 +y 2 y = 0 2 y 2 = 0 Z =, y D : y y + = 0} y y + = 0 =, y D : y = }, y D : y = } =, y D : y = } =, y D : y = } Let us try to apply 2nd order cpnditions. The Hessian matri is D 2 f, y = 2 y 2 y 2 +y y 2 +y 2 2 y 2 +y 2 2 y 2 2 +y y 2 y + and computed at points of Z becomes D 2 f, = so that f, < 0, but det Hf, = 0, so that 2nd order sufficient conditions do not apply. From 2nd order necessary conditions, we know that critical points cannot be local min, but could be ma or saddle. Note further that the Hessian is negative or null in the domain det D 2 f, y = y 2 + y 2 y y so that it is indefinite not conve nor concave in D Z, and negative semidefinite in Z. Indeed all points in Z are GLOBAL ma. Note that, since on D we have y > 0, then 0 < y 2 + y 2 2 as the second inequality is true y 2 0. Moreover 2 is attained at all points of Z. Hence f attains its GLOBAL ma with ma f = ln 2. The property is very easy to guess, nonetheless one may not get it at first sight. The one may start analyzing level sets Γ k of f, discovering that they are of type 2 + y 2 2αy = 0, with α =. Then, 2e k by a change of coordinates, one checks that the curve 2 + y 2 2αy = 0 describes two lines through the origin, so that all level curves are indeed of type, β for some positive β. Since f, β = ln β + β 2 and such function of β attains its ma at on the positive real ais, then the maimizing level curve was ;. 0

Math 563 Measure Theory Project 1 (Funky Functions Group) Luis Zerón, Sergey Dyachenko

Math 563 Measure Theory Project (Funky Functions Group) Luis Zerón, Sergey Dyachenko 34 Let C and C be any two Cantor sets (constructed in Exercise 3) Show that there exists a function F: [,] [,] with

Convexity. Po-Shen Loh. 25 June 2008

Conveity Po-Shen Loh 5 June 008 Warm-up Sharpening inequalities can help to reduce the number of variables Prove that inequality ( is sharper than (, for all reals, y 0 ( y y ( 6 ( y y ( 6 Then prove (,

Lecture 5 Principal Minors and the Hessian

Lecture 5 Principal Minors and the Hessian Eivind Eriksen BI Norwegian School of Management Department of Economics October 01, 2010 Eivind Eriksen (BI Dept of Economics) Lecture 5 Principal Minors and

Convexity in R N Main Notes 1

John Nachbar Washington University December 16, 2016 Convexity in R N Main Notes 1 1 Introduction. These notes establish basic versions of the Supporting Hyperplane Theorem (Theorem 5) and the Separating

1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

Math 421, Homework #5 Solutions

Math 421, Homework #5 Solutions (1) (8.3.6) Suppose that E R n and C is a subset of E. (a) Prove that if E is closed, then C is relatively closed in E if and only if C is a closed set (as defined in Definition

Limits and convergence.

Chapter 2 Limits and convergence. 2.1 Limit points of a set of real numbers 2.1.1 Limit points of a set. DEFINITION: A point x R is a limit point of a set E R if for all ε > 0 the set (x ε,x + ε) E is

Solutions to Tutorial 2 (Week 3)

THE UIVERSITY OF SYDEY SCHOOL OF MATHEMATICS AD STATISTICS Solutions to Tutorial 2 (Week 3) MATH3969: Measure Theory and Fourier Analysis (Advanced) Semester 2, 2016 Web Page: http://sydney.edu.au/science/maths/u/ug/sm/math3969/

Chapter 6 SEQUENCES. sn 1+1,s 1 =1 is again an abbreviation for the sequence { 1, 1 2, 1 } n N ε,d (s n,s) <ε.

Chapter 6 SEQUENCES 6.1 Sequences A sequence is a function whose domain is the set of natural numbers N. If s is a sequence, we usually denote its value at n by s n instead of s (n). We may refer to the

EXAM. Exam #3. Math , Fall November 22, 2002 ANSWERS

EXAM Eam #3 Math 35-02, Fall 2002 November 22, 2002 ANSWERS i 40 pts. Problem. Find the absolute maimum and absolute minimum values of the function f() = 3 4 8 3 + 2 on the interval [, 3]. To find the

TOPIC 4: DERIVATIVES

TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the

Contents. 6 Graph Sketching 87. 6.1 Increasing Functions and Decreasing Functions... 87. 6.2 Intervals Monotonically Increasing or Decreasing...

Contents 6 Graph Sketching 87 6.1 Increasing Functions and Decreasing Functions.......................... 87 6.2 Intervals Monotonically Increasing or Decreasing....................... 88 6.3 Etrema Maima

17.Convergence of Random Variables

17.Convergence of Random Variables In elementary mathematics courses (such as Calculus) one speaks of the convergence of functions: f n : R R, then n f n = f if n f n (x) = f(x) for all x in R. This is

6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )

6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a non-empty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points

Ri and. i=1. S i N. and. R R i

The subset R of R n is a closed rectangle if there are n non-empty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an

Sequences of Functions

Sequences of Functions Uniform convergence 9. Assume that f n f uniformly on S and that each f n is bounded on S. Prove that {f n } is uniformly bounded on S. Proof: Since f n f uniformly on S, then given

Limit processes are the basis of calculus. For example, the derivative. f f (x + h) f (x)

SEC. 4.1 TAYLOR SERIES AND CALCULATION OF FUNCTIONS 187 Taylor Series 4.1 Taylor Series and Calculation of Functions Limit processes are the basis of calculus. For example, the derivative f f (x + h) f

Advanced Topics in Machine Learning (Part II)

Advanced Topics in Machine Learning (Part II) 3. Convexity and Optimisation February 6, 2009 Andreas Argyriou 1 Today s Plan Convex sets and functions Types of convex programs Algorithms Convex learning

2 Sequences and Accumulation Points

2 Sequences and Accumulation Points 2.1 Convergent Sequences Formally, a sequence of real numbers is a function ϕ : N R. For instance the function ϕ(n) = 1 n 2 for all n N defines a sequence. It is customary,

2.3 Bounds of sets of real numbers

2.3 Bounds of sets of real numbers 2.3.1 Upper bounds of a set; the least upper bound (supremum) Consider S a set of real numbers. S is called bounded above if there is a number M so that any x S is less

Curve Sketching 1. Domain. Intercepts. Symmetry. Asymptotes 5. Intervals of Increase or Decrease 6. Local Maimum and Minimum Values 7. Concavity and Points of Inflection 8. Sketch the curve MATH 110 Lecture

Monotonic transformations: Cardinal Versus Ordinal Utility

Natalia Lazzati Mathematics for Economics (Part I) Note 1: Quasiconcave and Pseudoconcave Functions Note 1 is based on Madden (1986, Ch. 13, 14) and Simon and Blume (1994, Ch. 21). Monotonic transformations:

Section 3 Sequences and Limits

Section 3 Sequences and Limits Definition A sequence of real numbers is an infinite ordered list a, a 2, a 3, a 4,... where, for each n N, a n is a real number. We call a n the n-th term of the sequence.

2.3 Convex Constrained Optimization Problems

42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS

Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

Exercise 1. Let E be a given set. Prove that the following statements are equivalent.

Real Variables, Fall 2014 Problem set 1 Solution suggestions Exercise 1. Let E be a given set. Prove that the following statements are equivalent. (i) E is measurable. (ii) Given ε > 0, there exists an

Chapter 2 Limits Functions and Sequences sequence sequence Example

Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students

Gradient Methods Rafael E. Banchs INTRODUCTION This report discuss one class of the local search algorithms to be used in the inverse modeling of the time harmonic field electric logging problem, the Gradient

1. [2.3] Techniques for Computing Limits Limits of Polynomials/Rational Functions/Continuous Functions. Indeterminate Form-Eliminate the Common Factor

Review for the BST MTHSC 8 Name : [] Techniques for Computing Limits Limits of Polynomials/Rational Functions/Continuous Functions Evaluate cos 6 Indeterminate Form-Eliminate the Common Factor Find the

4.3 Connecting f ' and f '' with the graph of f Calculus

4.3 CONNECTING f ' AND f '' WITH THE GRAPH OF f First Derivative Test for Etrema We have alread determined that relative etrema occur at critical points. The behavior of the first derivative before and

MTH4100 Calculus I. Lecture notes for Week 8. Thomas Calculus, Sections 4.1 to 4.4. Rainer Klages

MTH4100 Calculus I Lecture notes for Week 8 Thomas Calculus, Sections 4.1 to 4.4 Rainer Klages School of Mathematical Sciences Queen Mary University of London Autumn 2009 Theorem 1 (First Derivative Theorem

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x

Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written

REAL ANALYSIS I HOMEWORK 2

REAL ANALYSIS I HOMEWORK 2 CİHAN BAHRAN The questions are from Stein and Shakarchi s text, Chapter 1. 1. Prove that the Cantor set C constructed in the text is totally disconnected and perfect. In other

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 20

CS 70 Discrete Mathematics and Probability Theory Fall 009 Satish Rao, David Tse Note 0 Infinity and Countability Consider a function (or mapping) f that maps elements of a set A (called the domain of

4.4 Concavity and Curve Sketching

Concavity and Curve Sketching Section Notes Page We can use the second derivative to tell us if a graph is concave up or concave down To see if something is concave down or concave up we need to look at

1. [20 Points] Evaluate each of the following limits. Please justify your answers. Be clear if the limit equals a value, + or, or Does Not Exist.

Answer Key, Math, Final Eamination, December 9, 9. [ Points] Evaluate each of the following limits. Please justify your answers. Be clear if the limit equals a value, + or, or Does Not Eist. (a lim + 6

Course 221: Analysis Academic year , First Semester

Course 221: Analysis Academic year 2007-08, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................

The Strong Markov Property

The Strong Markov Property Throughout, X := {X } denotes a Lévy process on with triple (σ), and exponent Ψ. And from now on, we let { } denote the natural filtration of X, all the time remembering that,

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

Maximum and Minimum Values

Jim Lambers MAT 280 Spring Semester 2009-10 Lecture 8 Notes These notes correspond to Section 11.7 in Stewart and Section 3.3 in Marsden and Tromba. Maximum and Minimum Values In single-variable calculus,

Scalar functions of several variables (Sect. 14.1).

Scalar functions of several variables (Sect. 14.1). Functions of several variables. On open, closed sets. Functions of two variables: Graph of the function. Level curves, contour curves. Functions of three

1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

Compactness in metric spaces

MATHEMATICS 3103 (Functional Analysis) YEAR 2012 2013, TERM 2 HANDOUT #2: COMPACTNESS OF METRIC SPACES Compactness in metric spaces The closed intervals [a, b] of the real line, and more generally the

Lecture 12 Basic Lyapunov theory

EE363 Winter 2008-09 Lecture 12 Basic Lyapunov theory stability positive definite functions global Lyapunov stability theorems Lasalle s theorem converse Lyapunov theorems finding Lyapunov functions 12

Course 214 Section 1: Basic Theorems of Complex Analysis Second Semester 2008

Course 214 Section 1: Basic Theorems of Complex Analysis Second Semester 2008 David R. Wilkins Copyright c David R. Wilkins 1989 2008 Contents 1 Basic Theorems of Complex Analysis 1 1.1 The Complex Plane........................

Math 317 HW #5 Solutions

Math 317 HW #5 Solutions 1. Exercise 2.4.2. (a) Prove that the sequence defined by x 1 = 3 and converges. x n+1 = 1 4 x n Proof. I intend to use the Monotone Convergence Theorem, so my goal is to show

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2016 LECTURE NOTES Series

ANALYTICAL MATHEMATICS FOR APPLICATIONS 206 LECTURE NOTES 8 ISSUED 24 APRIL 206 A series is a formal sum. Series a + a 2 + a 3 + + + where { } is a sequence of real numbers. Here formal means that we don

Taylor Series and Asymptotic Expansions

Taylor Series and Asymptotic Epansions The importance of power series as a convenient representation, as an approimation tool, as a tool for solving differential equations and so on, is pretty obvious.

Mathematics for Economics (Part I) Note 5: Convex Sets and Concave Functions

Natalia Lazzati Mathematics for Economics (Part I) Note 5: Convex Sets and Concave Functions Note 5 is based on Madden (1986, Ch. 1, 2, 4 and 7) and Simon and Blume (1994, Ch. 13 and 21). Concave functions

1. Sigma algebras. Let A be a collection of subsets of some fixed set Ω. It is called a σ -algebra with the unit element Ω if. lim sup. j E j = E.

Real Analysis, course outline Denis Labutin 1 Measure theory I 1. Sigma algebras. Let A be a collection of subsets of some fixed set Ω. It is called a σ -algebra with the unit element Ω if (a), Ω A ; (b)

Lecture 3: Solving Equations Using Fixed Point Iterations

cs41: introduction to numerical analysis 09/14/10 Lecture 3: Solving Equations Using Fixed Point Iterations Instructor: Professor Amos Ron Scribes: Yunpeng Li, Mark Cowlishaw, Nathanael Fillmore Our problem,

Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

CHAPTER 2. Inequalities

CHAPTER 2 Inequalities In this section we add the axioms describe the behavior of inequalities (the order axioms) to the list of axioms begun in Chapter 1. A thorough mastery of this section is essential

k=1 k2, and therefore f(m + 1) = f(m) + (m + 1) 2 =

Math 104: Introduction to Analysis SOLUTIONS Alexander Givental HOMEWORK 1 1.1. Prove that 1 2 +2 2 + +n 2 = 1 n(n+1)(2n+1) for all n N. 6 Put f(n) = n(n + 1)(2n + 1)/6. Then f(1) = 1, i.e the theorem

Course 421: Algebraic Topology Section 1: Topological Spaces

Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............

Global and Local Extrema

Global and Local Etrema Using the power of calculus, we can draw quite accurate sketches of a given function using a limited amount of information. In order to graph, and reason visually about functions,

Double Sequences and Double Series

Double Sequences and Double Series Eissa D. Habil Islamic University of Gaza P.O. Box 108, Gaza, Palestine E-mail: habil@iugaza.edu Abstract This research considers two traditional important questions,

NONLINEAR AND DYNAMIC OPTIMIZATION From Theory to Practice

NONLINEAR AND DYNAMIC OPTIMIZATION From Theory to Practice IC-32: Winter Semester 2006/2007 Benoît C. CHACHUAT Laboratoire d Automatique, École Polytechnique Fédérale de Lausanne CONTENTS 1 Nonlinear

TOPOLOGICAL PROOFS OF THE EXTREME AND INTERMEDIATE VALUE THEOREMS. Contents

TOPOLOGICAL PROOFS OF THE EXTREME AND INTERMEDIATE VALUE THEOREMS JAMES MURPHY Abstract. In this paper, I will present some elementary definitions in Topology. In particular, I will explain topological

Notes on weak convergence (MAT Spring 2006)

Notes on weak convergence (MAT4380 - Spring 2006) Kenneth H. Karlsen (CMA) February 2, 2006 1 Weak convergence In what follows, let denote an open, bounded, smooth subset of R N with N 2. We assume 1 p

1. Write the following expressions in equivalent forms not involving absolute values.

Chapter 1 The Real Numbers 1.1 The Real Number System 1. Write the following expressions in equivalent forms not involving absolute values. b. a + b a b In order to eliminate the absolute value we distinguish

4.9 Markov matrices. DEFINITION 4.3 A real n n matrix A = [a ij ] is called a Markov matrix, or row stochastic matrix if. (i) a ij 0 for 1 i, j n;

49 Markov matrices DEFINITION 43 A real n n matrix A = [a ij ] is called a Markov matrix, or row stochastic matrix if (i) a ij 0 for 1 i, j n; (ii) a ij = 1 for 1 i n Remark: (ii) is equivalent to AJ n

Math 2250 Exam #1 Practice Problem Solutions. g(x) = x., h(x) =

Math 50 Eam # Practice Problem Solutions. Find the vertical asymptotes (if any) of the functions g() = + 4, h() = 4. Answer: The only number not in the domain of g is = 0, so the only place where g could

Some Notes on Taylor Polynomials and Taylor Series

Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited

Lesson 6 Applications of Differential Calculus

Lesson 6 Applications of Differential Calculus The line tangent to the graph of a function f at ( 0, f ( 0 is the line passing through the point whose slope is f ( 0. y = f ( The slope-point equation of

MATH 10550, EXAM 2 SOLUTIONS. x 2 + 2xy y 2 + x = 2

MATH 10550, EXAM SOLUTIONS (1) Find an equation for the tangent line to at the point (1, ). + y y + = Solution: The equation of a line requires a point and a slope. The problem gives us the point so we

Practice with Proofs

Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using

0 ( x) 2 = ( x)( x) = (( 1)x)(( 1)x) = ((( 1)x))( 1))x = ((( 1)(x( 1)))x = ((( 1)( 1))x)x = (1x)x = xx = x 2.

SOLUTION SET FOR THE HOMEWORK PROBLEMS Page 5. Problem 8. Prove that if x and y are real numbers, then xy x + y. Proof. First we prove that if x is a real number, then x 0. The product of two positive

v 1. v n R n we have for each 1 j n that v j v n max 1 j n v j. i=1

1. Limits and Continuity It is often the case that a non-linear function of n-variables x = (x 1,..., x n ) is not really defined on all of R n. For instance f(x 1, x 2 ) = x 1x 2 is not defined when x

Problem 1 (10 pts) Find the radius of convergence and interval of convergence of the series

1 Problem 1 (10 pts) Find the radius of convergence and interval of convergence of the series a n n=1 n(x + 2) n 5 n 1. n(x + 2)n Solution: Do the ratio test for the absolute convergence. Let a n =. Then,

Thus, a sequence is not a Cauchy sequence if there exists ε > 0 and a subsequence (x nk : k N) with

Cauchy sequences. Definition: A sequence (x n ) is said to be a Cauchy sequence if given any ε > 0, there exists K N such that x n x m < ε for all n, m K. Thus, a sequence is not a Cauchy sequence if there

36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?

36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this

Chap2: The Real Number System (See Royden pp40)

Chap2: The Real Number System (See Royden pp40) 1 Open and Closed Sets of Real Numbers The simplest sets of real numbers are the intervals. We define the open interval (a, b) to be the set (a, b) = {x

Basic building blocks for a triple-double intermediate format

Basic building blocks for a triple-double intermediate format corrected version) Christoph Quirin Lauter February 26, 2009 Abstract The implementation of correctly rounded elementary functions needs high

3 σ-algebras. Solutions to Problems

3 σ-algebras. Solutions to Problems 3.1 3.12 Problem 3.1 (i It is clearly enough to show that A, B A = A B A, because the case of N sets follows from this by induction, the induction step being A 1...

Geometry 2: Remedial topology

Geometry 2: Remedial topology Rules: You may choose to solve only hard exercises (marked with!, * and **) or ordinary ones (marked with! or unmarked), or both, if you want to have extra problems. To have

5. ABSOLUTE EXTREMA. Definition, Existence & Calculation

5. ABSOLUTE EXTREMA Definition, Existence & Calculation We assume that the definition of function is known and proceed to define absolute minimum. We also assume that the student is familiar with the terms

In this chapter, we define continuous functions and study their properties.

Chapter 7 Continuous Functions In this chapter, we define continuous functions and study their properties. 7.1. Continuity Continuous functions are functions that take nearby values at nearby points. Definition

Analysis I. 1 Measure theory. Piotr Haj lasz. 1.1 σ-algebra.

Analysis I Piotr Haj lasz 1 Measure theory 1.1 σ-algebra. Definition. Let be a set. A collection M of subsets of is σ-algebra if M has the following properties 1. M; 2. A M = \ A M; 3. A 1, A 2, A 3,...

7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

1 Convex Sets, and Convex Functions

Convex Sets, and Convex Functions In this section, we introduce one of the most important ideas in the theory of optimization, that of a convex set. We discuss other ideas which stem from the basic definition,

If the sets {A i } are pairwise disjoint, then µ( i=1 A i) =

Note: A standing homework assignment for students in MAT1501 is: let me know about any mistakes, misprints, ambiguities etc that you find in these notes. 1. measures and measurable sets If X is a set,

Completeness I. Chapter Rational Numbers

Chapter 5 Completeness I Completeness is the key property of the real numbers that the rational numbers lack. Before examining this property we explore the rational and irrational numbers, discovering

Math 230a HW3 Extra Credit

Math 230a HW3 Extra Credit Erik Lewis November 15, 2006 1 Extra Credit 16. Regard Q, the set of all rational numbers, as a metric space, with d(p, q) = p q. Let E be the set of all p Q such that 2 < p

Sequences and Convergence in Metric Spaces

Sequences and Convergence in Metric Spaces Definition: A sequence in a set X (a sequence of elements of X) is a function s : N X. We usually denote s(n) by s n, called the n-th term of s, and write {s

Lecture 3: Convex Sets and Functions

EE 227A: Convex Optimization and Applications January 24, 2012 Lecture 3: Convex Sets and Functions Lecturer: Laurent El Ghaoui Reading assignment: Chapters 2 (except 2.6) and sections 3.1, 3.2, 3.3 of

NOTES ON MEASURE THEORY. M. Papadimitrakis Department of Mathematics University of Crete. Autumn of 2004

NOTES ON MEASURE THEORY M. Papadimitrakis Department of Mathematics University of Crete Autumn of 2004 2 Contents 1 σ-algebras 7 1.1 σ-algebras............................... 7 1.2 Generated σ-algebras.........................

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

Mathematical Economics - Part I - Optimization. Filomena Garcia. Fall Optimization. Filomena Garcia. Optimization. Existence of Solutions

of Mathematical Economics - Part I - Fall 2009 of 1 in R n Problems in Problems: Some of 2 3 4 5 6 7 in 8 Continuity: The Maximum Theorem 9 Supermodularity and Monotonicity of An optimization problem in

Assignment 7; Due Friday, November 11

Assignment 7; Due Friday, November 9.8 a The set Q is not connected because we can write it as a union of two nonempty disjoint open sets, for instance U = (, 2) and V = ( 2, ). The connected subsets are

TI-84/83 graphing calculator

TI-8/83 graphing calculator Let us use the table feature to approimate limits and then solve the problems the old fashion way. Find the following limits: Eample 1.1 lim f () Turn on your TI-8 graphing

HOLOMORPHIC FRAMES FOR WEAKLY CONVERGING HOLOMORPHIC VECTOR BUNDLES

HOLOMORPHIC FRAMES FOR WEAKLY CONVERGING HOLOMORPHIC VECTOR BUNDLES GEORGIOS D. DASKALOPOULOS AND RICHARD A. WENTWORTH Perhaps the most useful analytic tool in gauge theory is the Uhlenbeck compactness

Power Series. Chapter Introduction

Chapter 10 Power Series In discussing power series it is good to recall a nursery rhyme: There was a little girl Who had a little curl Right in the middle of her forehead When she was good She was very,

Shiqian Ma, SEEM 5121, Dept. of SEEM, CUHK 1. Chapter 2. Convex Optimization

Shiqian Ma, SEEM 5121, Dept. of SEEM, CUHK 1 Chapter 2 Convex Optimization Shiqian Ma, SEEM 5121, Dept. of SEEM, CUHK 2 2.1. Convex Optimization General optimization problem: min f 0 (x) s.t., f i (x)

Vector Spaces II: Finite Dimensional Linear Algebra 1

John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition

About the Gamma Function Notes for Honors Calculus II, Originally Prepared in Spring 995 Basic Facts about the Gamma Function The Gamma function is defined by the improper integral Γ) = The integral is

Scalar and vector potentials, Helmholtz decomposition, and de Rham cohomology

Scalar and vector potentials,, and de Rham cohomology Alberto Valli Department of Mathematics, University of Trento, Italy A. Valli Potentials,, de Rham cohomology Outline 1 Introduction 2 3 4 5 A. Valli