MATH 351 Solutions: TEST 3-B 23 April 2018 (revised)

Similar documents
Sections 2.2 & 2.3 Limit of a Function and Limit Laws

1 Solutions to selected problems

û s L u t 0 s a ; i.e., û s 0

MATH 4330/5330, Fourier Analysis Section 6, Proof of Fourier s Theorem for Pointwise Convergence

Question 1: Question 2: Topology Exercise Sheet 3

Math 2142 Exam 1 Review Problems. x 2 + f (0) 3! for the 3rd Taylor polynomial at x = 0. To calculate the various quantities:

Random variables. A random variable X is a function that assigns a real number, X(ζ), to each outcome ζ in the sample space of a random experiment.

EXERCISES FOR SECTION 1.5

MODULE 3 FUNCTION OF A RANDOM VARIABLE AND ITS DISTRIBUTION LECTURES PROBABILITY DISTRIBUTION OF A FUNCTION OF A RANDOM VARIABLE

ES.1803 Topic 22 Notes Jeremy Orloff

Hamilton- J acobi Equation: Weak S olution We continue the study of the Hamilton-Jacobi equation:

An Introduction to Malliavin calculus and its applications

SMT 2014 Calculus Test Solutions February 15, 2014 = 3 5 = 15.

KEY. Math 334 Midterm I Fall 2008 sections 001 and 003 Instructor: Scott Glasgow

REAL ANALYSIS I HOMEWORK 3. Chapter 1

SOLUTIONS TO ECE 3084

Challenge Problems. DIS 203 and 210. March 6, (e 2) k. k(k + 2). k=1. f(x) = k(k + 2) = 1 x k

Asymptotic instability of nonlinear differential equations

Limits at Infinity. Limit at negative infinity. Limit at positive infinity. Definition of Limits at Infinity Let L be a real number.

Optimality Conditions for Unconstrained Problems

Oscillation of an Euler Cauchy Dynamic Equation S. Huff, G. Olumolode, N. Pennington, and A. Peterson

Homework sheet Exercises done during the lecture of March 12, 2014

arxiv: v2 [math.ap] 16 Oct 2017

23.5. Half-Range Series. Introduction. Prerequisites. Learning Outcomes

Hamilton- J acobi Equation: Explicit Formulas In this lecture we try to apply the method of characteristics to the Hamilton-Jacobi equation: u t

MATH 128A, SUMMER 2009, FINAL EXAM SOLUTION

TEACHER NOTES MATH NSPIRED

KEY. Math 334 Midterm III Winter 2008 section 002 Instructor: Scott Glasgow

EE 315 Notes. Gürdal Arslan CLASS 1. (Sections ) What is a signal?

The Fundamental Theorems of Calculus

Math 334 Test 1 KEY Spring 2010 Section: 001. Instructor: Scott Glasgow Dates: May 10 and 11.

Example on p. 157

2. Nonlinear Conservation Law Equations

arxiv: v1 [math.fa] 9 Dec 2018

Intermediate Differential Equations Review and Basic Ideas

3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon

t 2 B F x,t n dsdt t u x,t dxdt

CHAPTER 2 Signals And Spectra

4 Sequences of measurable functions

Lecture Notes 2. The Hilbert Space Approach to Time Series

4. Advanced Stability Theory

A New Kind of Fuzzy Sublattice (Ideal, Filter) of A Lattice

SELBERG S CENTRAL LIMIT THEOREM ON THE CRITICAL LINE AND THE LERCH ZETA-FUNCTION. II

Chapter 7: Solving Trig Equations

Ann. Funct. Anal. 2 (2011), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:

CHAPTER 2: Mathematics for Microeconomics

Solutions to Assignment 1

Existence of multiple positive periodic solutions for functional differential equations

Monotonic Solutions of a Class of Quadratic Singular Integral Equations of Volterra type

INTEGRALS. Exercise 1. Let f : [a, b] R be bounded, and let P and Q be partitions of [a, b]. Prove that if P Q then U(P ) U(Q) and L(P ) L(Q).

Guest Lectures for Dr. MacFarlane s EE3350 Part Deux

KEY. Math 334 Midterm III Fall 2008 sections 001 and 003 Instructor: Scott Glasgow

Evans PDE Solutions, Chapter 2

On Two Integrability Methods of Improper Integrals

An Excursion into Set Theory using a Constructivist Approach

Essential Microeconomics : OPTIMAL CONTROL 1. Consider the following class of optimization problems

Inventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions

Representation of Stochastic Process by Means of Stochastic Integrals

Approximation Algorithms for Unique Games via Orthogonal Separators

Math 334 Fall 2011 Homework 11 Solutions

Heat kernel and Harnack inequality on Riemannian manifolds

Hybrid Control and Switched Systems. Lecture #3 What can go wrong? Trajectories of hybrid systems

Undetermined coefficients for local fractional differential equations

MATH 31B: MIDTERM 2 REVIEW. x 2 e x2 2x dx = 1. ue u du 2. x 2 e x2 e x2] + C 2. dx = x ln(x) 2 2. ln x dx = x ln x x + C. 2, or dx = 2u du.

6.2 Transforms of Derivatives and Integrals.

Let us start with a two dimensional case. We consider a vector ( x,

SOLUTIONS TO ASSIGNMENT 2 - MATH 355. with c > 3. m(n c ) < δ. f(t) t. g(x)dx =

Expert Advice for Amateurs

Answers to QUIZ

Properties Of Solutions To A Generalized Liénard Equation With Forcing Term

Finish reading Chapter 2 of Spivak, rereading earlier sections as necessary. handout and fill in some missing details!

Bernoulli numbers. Francesco Chiatti, Matteo Pintonello. December 5, 2016

arxiv: v1 [math.pr] 19 Feb 2011

Mathematics 805 Final Examination Answers

MATH 5720: Gradient Methods Hung Phan, UMass Lowell October 4, 2018

A Note on Superlinear Ambrosetti-Prodi Type Problem in a Ball

Chapter 2. First Order Scalar Equations

Y 0.4Y 0.45Y Y to a proper ARMA specification.

Section 3.5 Nonhomogeneous Equations; Method of Undetermined Coefficients

Laplace Transform. Inverse Laplace Transform. e st f(t)dt. (2)

Matrix Versions of Some Refinements of the Arithmetic-Geometric Mean Inequality

Hamilton Jacobi equations

Engineering Letter, 16:4, EL_16_4_03

Second-Order Differential Equations

Math 10B: Mock Mid II. April 13, 2016

Differential Equations

INTRODUCTION TO MACHINE LEARNING 3RD EDITION

Math Final Exam Solutions

Cash Flow Valuation Mode Lin Discrete Time

Essential Maps and Coincidence Principles for General Classes of Maps

(1) (2) Differentiation of (1) and then substitution of (3) leads to. Therefore, we will simply consider the second-order linear system given by (4)

Convergence of the Neumann series in higher norms

International Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN

Omega-limit sets and bounded solutions

ENGI 9420 Engineering Analysis Assignment 2 Solutions

Lecture 20: Riccati Equations and Least Squares Feedback Control

MA 214 Calculus IV (Spring 2016) Section 2. Homework Assignment 1 Solutions

Vehicle Arrival Models : Headway

Chapter 6. Systems of First Order Linear Differential Equations

Supplementary Material

Transcription:

MATH Soluions: TEST -B April 8 (revised) Par I [ ps each] Each of he following asserions is false. Give an eplici couner-eample o illusrae his.. If H: (, ) R is coninuous, hen H is unbounded. Le H() = (, ).. If f: R R and g: R R are uniformly coninuous funcions, hen fg is uniformly coninuous on R. Le f() = g() = for all real. Then f and g are uniformly coninuous. However, (fg)() = which is no uniformly coninuous on R.. Given wo funcions f: [, ] R and g: [, ] R such ha each is nowhere coninuous on [, ], hen fg canno be coninuous everywhere on [, ]. if Q Le f() = g() = { if Q Then (fg)() = for all real.. If G: [, ] R is coninuous hen, for every cr, he se S = { [, ]: G() = c} canno be counably infinie. Define G() = { sin if (, ] if =. Le I = (, ). If g: I R is coninuous hen g(i) is no a compac inerval. Le g() = sin(). Then g(i) = [-, ]. 6. Le F: R R be coninuous and le A, B R. Then F(A B) = F(A) F(B). Le F: R R be defined by F() = for all R. Le A = {, } and B = {, -}. Then F(A B) = F({}) = {}. Bu F(A) F(B) = {, }{, }={, }.

7. If wo funcions, f: R R and g: R R saisfy he condiions ha hen g f() eiss and equals. f() = and g() = Le f() = for all R. Le g( ) if if 8. There does no eis a funcion f: R R ha is coninuous only a =. Le f() = D() where D is he Dirichle funcion defined by: if Q D() = { if Q. If F: [, ] R is coninuous and {bn} is a sequence in [, ] for which {F(bn)} converges hen {bn} mus converge. Define F() = for all [, ]. Define b n = { if n Z+ is even if n Z + is odd If S and T are sequenially compac subses of R, hen S T ={S T} is sequenially compac. Le S = [, ] and Le T = {}. Then S T = (, ], which is cerainly no sequenially compac.. Le h: [, ] R be a funcion ha achieves a maimum value on he inerval [, ]. Then he funcion F() = (h()) also achieves a maimum value on he inerval [, ]. if < Define h() = { if = Noe ha h has a maimum value of on [, ] bu ha (h()) has no maimum on [, ].. There does no eis a funcion f: R R ha is coninuous everywhere ecep a a counably infinie se of poins. Le D() denoe he Dirichle funcion defined by:

if Q D() = { if Q Le g()= D() (sin ). Then g is coninuous only a poins of he form n where n Z.. There does no eis a funcion H: (, ) R ha is bijecive. Define H() = an π( ). Le f: (, ) R be coninuous and le {an} be a Cauchy sequence in (, ). Then {f(an)} is a Cauchy sequence. Le f() = /. Le n = /n. Par II [ ps each] Insrucions: Selec any of he following 7 problems. You may answer more han o obain era credi.. Le f: (, ) R (a) Le p (, ). Wrie he negaion of he saemen f: (, ) R is coninuous a = p. (Noe: f is no coninuous a p is no a sufficien answer. Use and in your answer.) Since he definiion of coninuiy of f a = p is: ε > δ > such ha f() f(p) < ε whenever (, ) and p < δ. The logical negaion of his senence is: ε > δ > (, ) such ha f() f(p) ε and p < δ. (b) Wrie he negaion of he saemen f: (, ) R is uniformly coninuous on (, ). (Noe: f is no uniformly coninuous on R is no a sufficien answer. Use and in your answer.) Since he definiion of uniform coninuiy of f on (, ) is: ε > δ > such ha f(a) f(b) < ε whenever a, b (,) and a b < δ. The logical negaion of his senence is: ε > δ > a, b (, ) such ha f(a) f(b) ε and a b < δ.. Le < a < b and le f be a posiive funcion defined on [a, b]. If f saisfies he Inermediae Value Propery on [a, b], prove ha saisfies he Inermediae Value Propery on [a, b]. f

The definiion of is: () = for all [a, b]. f f f() Now suppose is a number beween (a) and (b), inclusive. f f Then β lies beween f(a) and f(b), inclusive. Since f saisfies he IVP, c [a, b] such ha f(c) = β. Bu his means ha (c) = β. f Hence we have shown ha saisfies he IVP. f. Le f: (, ) R be funcion for which f() =. Prove ha f() sin =. Soluion: Le > be given. Then: f ( ) K such ha K f ( ). Thus K f ( )sin f ( )sin f ( ). Hence we obain f ( )sin. Le G: [, ] R be coninuous. We know from he Boundedness Theorem ha = sup G([, ]) eiss. Le {an} be a sequence of poins in [, ] saisfying (a) G(an) > /n for all n. Mus i follow ha {an} converge? Eplain! No, le G() = for all [, ]. Then = sup G([, ]) =. Define a n = ½ +(-½) n. Then G(a n ) = > /n for all n. And ye { a n } diverges. (b) Suppose ha an p. Prove ha G(p) =. Soluion: Suppose ha an p. Since [, ] is sequenially compac, i follows ha p[, ]. Now, since G is coninuous on [, ], i is sequenially coninuous. Thus G(an) G(p) (using he fac ha p[, ]). Since G(an) > /n for all n, we may invoke he Squeeze Theorem o obain ha G(an) eiss, and ha G(an) =. Now, since G(p) = G(an), we obain: G(p) =.

. Le f: [, ] [, ] be a coninuous funcion. Prove ha here eiss a poin p[a, b] such ha f(p) = p. Hin: Consider he funcion G() = f(). Soluion: Define h: [, ] R as follows: h() = f() for all [, ]. Now since f and he ideniy funcion are coninuous, h mus be coninuous by he lineariy heorem. Ne noe ha h() = f(), by definiion of f, and ha h() = f(). Now, if eiher h() = or h() =, hen we are done, for i follows ha eiher f() = or f() =. So le us assume ha h() < and h() >. Then, invoking Bolzano s Theorem, here eiss p[a, b] such ha h(p) =. And so, f(p) = p. (Noe: p is called a Fied Poin of f.) 6.. ) ( d g Le Prove ha g() eiss and find is value. Soluion: We claim ha ) ( g Observe ha, since : Thus: (**) d d d Now d d and so: as d Finally, applying he Squeeze Theorem o (**), we find ha. ) ( is his and eiss g 7. Le G: (a, b) R be a uniformly coninuous funcion and le {n} be a Cauchy sequence in (a, b). Prove ha {G(n)} is a Cauchy sequence.

Le ε > be given. Since G is uniformly coninuous, δ > such ha p, q (a, b) p q < δ G(p) G(q) < ε. Since {n} is a Cauchy sequence, n m < δ for m, n. Thus for a given ε > δ > such ha G( n ) G( m ) < ε for m, n. 6