Functions based on sin ( π. and cos

Size: px
Start display at page:

Download "Functions based on sin ( π. and cos"

Transcription

1 Functions based on sin and cos. Introduction In Complex Analysis if a function is differentiable it has derivatives of all orders. In Real Analysis the situation is very different. Using sin (π/ and cos (π/ it is possible, for any m 1, to construct a function, f, which has m derivatives on R but for which f (m+1 ( does not exist for all x R. Though f (m ( will not be differentiable for all x R we can construct it so that it is continuous on all of R, or even not continuous on all of R. The functions. Define, for n Z, { x n sin if x 0 f n ( = 0 if x = 0. and g n ( = { x n cos if x 0 0 if x = 0. There functions have derivatives of all orders on R \ {0}. The interest comes when x = 0. Continuity on R. If n 1 then lim x 0 f n ( and lim x 0 f n ( do not exist. In fact, write n = m with m 1, then with k Z, ( 1 f n = (k m sin (kπ = 0, k ( ( m (( f n = sin k + 1 ( m π = ( 1 g n k, since m 1, (1 = (k m cos (kπ = (k m ( f n k, since m 1, ( ( m (( = cos k + 1 π = 0. 1

2 Lemma If n 1 then lim x 0 f n ( does not exist. Proof Assume that lim x 0 f n ( exists, called l say. Choose ε = 1 in the definition of limit to find δ > 0 such that 0 < x 0 < δ f n ( l < 1. But then, for these x we have f n ( = f n ( l + l f n ( l + l 1 + l. (3 Choose k Z sufficiently large such that / (4k + < δ and ( / > 1 + l. Then we get a contradiction since, by (3, 1/k < δ implies f n (1/k 1 + l which by (1 implies ( / 1 + l. So we have both ( / > 1 + l and ( / 1 + l, a contradiction. Hence the last assumption is false and thus lim x 0 f 1 ( does not exist. Similarly you can show that if n 1 then lim x 0 g n ( does not exist. If n = 0 then for x 0, f 0 ( = sin (π/ which has no limit as x 0, as seen in the notes. Similarly g 0 ( = cos (π/ has no limit as x 0. If n 1 then f n ( and g n ( are continuous only on R \ {0}. f 0 ( and g 0 ( are continuous only on R \ {0}. If n 1 then we can combine 1 sin 1 and x n x n x n to get x n x n sin x n. Then as x 0 the Sandwich Rule shows that lim x 0 f n ( = 0. Similarly for g n, hence For n 1, the f n ( and g n ( are continuous on R.

3 Differentiability. First derivatives. If n 0 the functions f n and g n are not continuous at x = 0 and are thus differentiable only on R \ {0}. If n 1 then, for x = 0, we look at the definition of derivative as a limit f n ( f n (0 lim x 0 x 0 = lim x n 1 sin = lim f n 1 (. (4 x 0 x x 0 As we ve seen above, this limit exists only when n 1 1, i.e. n, when the value is 0. Similarly for g n, hence If n = 1 then f 1 (0 and g 1 (0 are not defined and so f 1 and g 1 are differentiable only on R \ {0}. If n, then (4 and the similar result for g n give f n (0 = 0 and g n (0 = 0. Thus f n and g n are differentiable at x = 0 and thus on R. Continuity of the First derivatives. If n 1 then f n (0 and g n (0 do not exist so f n and g n are continuous only on R \ {0}. If x 0 then, from the definition we have, for all n 1, f n ( = nx n 1 sin πx n cos. (5 which is continuous on R \ {0}. Similarly for g n. With n = 1, (5becomes f 1 ( = sin πx 1 cos Lemma lim x 0 f 1 ( and lim x 0 g 1 ( do not exist. Proof We only show this for f 1 and leave g 1 to the Student. Note that for any k Z we have ( 1 f 1 = sin (kπ kπ cos (kπ = kπ. (6 k 3

4 Assume that lim x 0 f 1 ( exists, called l say. Choose ε = 1 in the definition of limit to find δ > 0 such that 0 < x 0 < δ f ( l < 1. But then, for these x we have f ( = f ( l + l f ( l + l 1 + l. (7 Choose k Z sufficiently large such that 1/k < δ and kπ > 1+ l. Then we get a contradiction since, by (7, 1/k < δ implies f (1/k 1 + l which by (6 implies kπ 1 + l. So we have both kπ > 1 + l and kπ 1 + l, a contradiction. Hence the last assumption is false and thus lim x 0 f 1 ( does not exist. If n = then (5 becomes f ( = x sin π cos. Lemma lim x 0 f ( and lim x 0 g ( do not exist. Proof We only show this for f and leave g to the Student. Note that for any k Z we have ( 1 f f k ( 1 k + 1 = sin (kπ π cos (kπ = π, (8 k = sin ((k + 1 π π cos ((k + 1 π = π. (9 k + 1 Assume that lim x 0 f ( exists, called l say. Choose ε = π/ in the definition of limit to find δ > 0 such that 0 < x 0 < δ f ( l < π/. (10 Choose k Z sufficiently large such that 1/k < δ for then (10 implies f (1/k l < π/, i.e. π l < π/ by (8. Next choose k Z sufficiently large such that 1/ (k + 1 < δ for then (10 implies f (1/ (k + 1 l < π/, i.e. by (8. π l < π/ 4

5 So l is both close to π and π! We see this contradiction more clearly by using the triangle inequality to say π = π = π l + π + l π l + π + l < π/ + π/ = π. This contradiction means that the last assumption is false and thus lim x 0 f ( does not exist. If n 3 then the Sandwich Rule gives both of lim x 0 nxn 1 sin = 0 and lim πx n cos x x 0 x Thus lim x 0 f n ( = 0 = f n (0. All the above also hold for g n, hence If n = then f and g are continuous only on R \ {0}. If n 3, then f n and g n are continuous on R. We can sum up the above as f n and g n are continuous on R iff n 1, f n and g n are differentiable on R iff n, f n and g n are continuous on R iff n 3. = 0. Higher Derivatives. Note that if x 0 then (5 can be written as Similarly Differentiating (11 then gives f ( n ( = nf n 1 ( πg n ( f n ( = nf n 1 ( πg n (. (11 g n ( = ng n 1 ( + πf n (. (1 = n ((n 1 f n ( πg n 3 ( π ((n g n 3 ( + πf n 4 ( on substituting (11 and (1, = n (n 1 f n ( π (n g n 3 ( + π f n 4 (, (13 on collecting terms. 5

6 Continue by differentiating (13 to get f (3 n ( = n (n 1 f n ( π (n g n 3 ( + π f n 4 ( = n (n 1 ((n f n 3 ( πg n 4 ( π (n ((n 3 g n 4 ( + πf n 5 ( +π ((n 4 f n 5 ( πg n 6 ( = n (n 1 (n f n 3 ( π ( 3n 9n + 6 g n 4 ( π (n + f n 5 ( π 3 g n 6 (. Though the details look complicated, these few results indicate that on continued differentiating, f n (j ( will be a sum of f n j, g n j 1, f n j, g n j 3, etc. down to either f n j if j even or g n j if j odd. In particular, the properties of f n (j will come from the properties of the f n k or g n k, j k j. Thus f n (j ( will be continuous on R iff all the f n k and g n k, j k j are continuous, which by above is equivalent to n j 1, i.e. j n 1. Similarly f n (j ( will be differentiable on R iff all the f n k and g n k, j k j are differentiable, which by above is equivalent to n j, i.e. j n. Hence f (j n ( is continuous on R iff j n 1, f (j n ( is differentiable on R iff j n. Example If n = k + 1, then f n (k ( is continuous on R but is differentiable only on R \ {0}. If n = l then f (l 1 n only on R \ {0}. ( is differentiable on R, but f n (l ( is differentiable Example If you required a function that is differentiable on R 100 times but not 101 times, and with a 100th derivative that is continuous on all of R choose f 01.. If you required a function that is differentiable on R 100 times but not 101 times, and with a 100th derivative that is not continuous on all of R choose f 0.. Finally. In the examples if something goes wrong, i.e. non-continuous or non-differentiable, it happens at x = 0. By looking at f n (x a the problems will occur at x = a. By summing over a, we get functions with problems that occur in subsets of R. Further, using the ideas that Wierestrass uses to give continuous functions nowhere differentiable, we can sum over countable 6

7 sets of a. This leads to some very interesting pathological functions, i.e. f differentiable m times but for which f (m is nowhere differentiable. Finally, Finally Examples are sometimes given using f n,m ( = x n sin and g x m n,m ( = x n cos. x m I leave it to the Student to check the properties of these functions. 7

Examples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.

Examples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case. s of the Fourier Theorem (Sect. 1.3. The Fourier Theorem: Continuous case. : Using the Fourier Theorem. The Fourier Theorem: Piecewise continuous case. : Using the Fourier Theorem. The Fourier Theorem:

More information

,... We would like to compare this with the sequence y n = 1 n

,... We would like to compare this with the sequence y n = 1 n Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.

More information

Sequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R.

Sequences. Limits of Sequences. Definition. A real-valued sequence s is any function s : N R. Sequences Limits of Sequences. Definition. A real-valued sequence s is any function s : N R. Usually, instead of using the notation s(n), we write s n for the value of this function calculated at n. We

More information

1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N

1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems

More information

Part 3.3 Differentiation Taylor Polynomials

Part 3.3 Differentiation Taylor Polynomials Part 3.3 Differentiation 3..3.1 Taylor Polynomials Definition 3.3.1 Taylor 1715 and Maclaurin 1742) If a is a fixed number, and f is a function whose first n derivatives exist at a then the Taylor polynomial

More information

Part 2 Continuous functions and their properties

Part 2 Continuous functions and their properties Part 2 Continuous functions and their properties 2.1 Definition Definition A function f is continuous at a R if, and only if, that is lim f (x) = f (a), x a ε > 0, δ > 0, x, x a < δ f (x) f (a) < ε. Notice

More information

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0. For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.

More information

MA677 Assignment #3 Morgan Schreffler Due 09/19/12 Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1:

MA677 Assignment #3 Morgan Schreffler Due 09/19/12 Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1: Exercise 1 Using Hölder s inequality, prove Minkowski s inequality for f, g L p (R d ), p 1: f + g p f p + g p. Proof. If f, g L p (R d ), then since f(x) + g(x) max {f(x), g(x)}, we have f(x) + g(x) p

More information

h(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote

h(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function

More information

MATH20101 Real Analysis, Exam Solutions and Feedback. 2013\14

MATH20101 Real Analysis, Exam Solutions and Feedback. 2013\14 MATH200 Real Analysis, Exam Solutions and Feedback. 203\4 A. i. Prove by verifying the appropriate definition that ( 2x 3 + x 2 + 5 ) = 7. x 2 ii. By using the Rules for its evaluate a) b) x 2 x + x 2

More information

Solutions to Homework Assignment 2

Solutions to Homework Assignment 2 Solutions to Homework Assignment Real Analysis I February, 03 Notes: (a) Be aware that there maybe some typos in the solutions. If you find any, please let me know. (b) As is usual in proofs, most problems

More information

REVIEW FOR THIRD 3200 MIDTERM

REVIEW FOR THIRD 3200 MIDTERM REVIEW FOR THIRD 3200 MIDTERM PETE L. CLARK 1) Show that for all integers n 2 we have 1 3 +... + (n 1) 3 < 1 n < 1 3 +... + n 3. Solution: We go by induction on n. Base Case (n = 2): We have (2 1) 3 =

More information

Sequences. We know that the functions can be defined on any subsets of R. As the set of positive integers

Sequences. We know that the functions can be defined on any subsets of R. As the set of positive integers Sequences We know that the functions can be defined on any subsets of R. As the set of positive integers Z + is a subset of R, we can define a function on it in the following manner. f: Z + R f(n) = a

More information

Infinite Continued Fractions

Infinite Continued Fractions Infinite Continued Fractions 8-5-200 The value of an infinite continued fraction [a 0 ; a, a 2, ] is lim c k, where c k is the k-th convergent k If [a 0 ; a, a 2, ] is an infinite continued fraction with

More information

3 Measurable Functions

3 Measurable Functions 3 Measurable Functions Notation A pair (X, F) where F is a σ-field of subsets of X is a measurable space. If µ is a measure on F then (X, F, µ) is a measure space. If µ(x) < then (X, F, µ) is a probability

More information

Similar to sequence, note that a series converges if and only if its tail converges, that is, r 1 r ( 1 < r < 1), ( 1) k k. r k =

Similar to sequence, note that a series converges if and only if its tail converges, that is, r 1 r ( 1 < r < 1), ( 1) k k. r k = Infinite Series We say an infinite series a k converges to s if its sequence of initial sums converges to s, that is, lim( n a k : n N) = s. Similar to sequence, note that a series converges if and only

More information

Mathematics 242 Principles of Analysis Solutions for Problem Set 5 Due: March 15, 2013

Mathematics 242 Principles of Analysis Solutions for Problem Set 5 Due: March 15, 2013 Mathematics Principles of Analysis Solutions for Problem Set 5 Due: March 15, 013 A Section 1. For each of the following sequences, determine three different subsequences, each converging to a different

More information

CSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4

CSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4 CSE 20 Lecture 4: Introduction to Boolean algebra Reminder First quiz will be on Friday (17th January) in class. It is a paper quiz. Syllabus is all that has been done till Wednesday. If you want you may

More information

PRINCIPLE OF MATHEMATICAL INDUCTION

PRINCIPLE OF MATHEMATICAL INDUCTION Chapter 4 PRINCIPLE OF MATHEMATICAL INDUCTION 4.1 Overview Mathematical induction is one of the techniques which can be used to prove variety of mathematical statements which are formulated in terms of

More information

CLASS NOTES FOR APRIL 14, 2000

CLASS NOTES FOR APRIL 14, 2000 CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class

More information

MATH 202B - Problem Set 5

MATH 202B - Problem Set 5 MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there

More information

Proof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof:

Proof Terminology. Technique #1: Direct Proof. Learning objectives. Proof Techniques (Rosen, Sections ) Direct Proof: Proof Terminology Proof Techniques (Rosen, Sections 1.7 1.8) TOPICS Direct Proofs Proof by Contrapositive Proof by Contradiction Proof by Cases Theorem: statement that can be shown to be true Proof: a

More information

Math 140A - Fall Final Exam

Math 140A - Fall Final Exam Math 140A - Fall 2014 - Final Exam Problem 1. Let {a n } n 1 be an increasing sequence of real numbers. (i) If {a n } has a bounded subsequence, show that {a n } is itself bounded. (ii) If {a n } has a

More information

Principles of Real Analysis I Fall VII. Sequences of Functions

Principles of Real Analysis I Fall VII. Sequences of Functions 21-355 Principles of Real Analysis I Fall 2004 VII. Sequences of Functions In Section II, we studied sequences of real numbers. It is very useful to consider extensions of this concept. More generally,

More information

Math 421, Homework #9 Solutions

Math 421, Homework #9 Solutions Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and

More information

Mid Term-1 : Practice problems

Mid Term-1 : Practice problems Mid Term-1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to

More information

Divisibility = 16, = 9, = 2, = 5. (Negative!)

Divisibility = 16, = 9, = 2, = 5. (Negative!) Divisibility 1-17-2018 You probably know that division can be defined in terms of multiplication. If m and n are integers, m divides n if n = mk for some integer k. In this section, I ll look at properties

More information

1 Functions of Several Variables 2019 v2

1 Functions of Several Variables 2019 v2 1 Functions of Several Variables 2019 v2 11 Notation The subject of this course is the study of functions f : R n R m The elements of R n, for n 2, will be called vectors so, if m > 1, f will be said to

More information

Math 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M

Math 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem

More information

MATH 5640: Fourier Series

MATH 5640: Fourier Series MATH 564: Fourier Series Hung Phan, UMass Lowell September, 8 Power Series A power series in the variable x is a series of the form a + a x + a x + = where the coefficients a, a,... are real or complex

More information

Functional Analysis Exercise Class

Functional Analysis Exercise Class Functional Analysis Exercise Class Wee November 30 Dec 4: Deadline to hand in the homewor: your exercise class on wee December 7 11 Exercises with solutions Recall that every normed space X can be isometrically

More information

Functional Analysis, Math 7320 Lecture Notes from August taken by Yaofeng Su

Functional Analysis, Math 7320 Lecture Notes from August taken by Yaofeng Su Functional Analysis, Math 7320 Lecture Notes from August 30 2016 taken by Yaofeng Su 1 Essentials of Topology 1.1 Continuity Next we recall a stronger notion of continuity: 1.1.1 Definition. Let (X, d

More information

Continuity. Chapter 4

Continuity. Chapter 4 Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

More information

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page. Formal Methods Name: Key Midterm 2, Spring, 2007 Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.. Determine whether each of

More information

MATH 360 Final Exam Thursday, December 14, a n 2. a n 1 1

MATH 360 Final Exam Thursday, December 14, a n 2. a n 1 1 MATH 36 Final Exam Thursday, December 4, 27 Name. The sequence ta n u is defined by a and a n (a) Prove that lim a n exists by showing that ta n u is bounded and monotonic and invoking an appropriate result.

More information

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.

More information

Contribution of Problems

Contribution of Problems Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions

More information

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets

Characterisation of Accumulation Points. Convergence in Metric Spaces. Characterisation of Closed Sets. Characterisation of Closed Sets Convergence in Metric Spaces Functional Analysis Lecture 3: Convergence and Continuity in Metric Spaces Bengt Ove Turesson September 4, 2016 Suppose that (X, d) is a metric space. A sequence (x n ) X is

More information

Lecture 2: Proof Techniques Lecturer: Lale Özkahya

Lecture 2: Proof Techniques Lecturer: Lale Özkahya BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 2: Proof Techniques Lecturer: Lale Özkahya Resources: Kenneth Rosen, Discrete Mathematics and App. cs.colostate.edu/

More information

7 About Egorov s and Lusin s theorems

7 About Egorov s and Lusin s theorems Tel Aviv University, 2013 Measure and category 62 7 About Egorov s and Lusin s theorems 7a About Severini-Egorov theorem.......... 62 7b About Lusin s theorem............... 64 7c About measurable functions............

More information

x 0 + f(x), exist as extended real numbers. Show that f is upper semicontinuous This shows ( ɛ, ɛ) B α. Thus

x 0 + f(x), exist as extended real numbers. Show that f is upper semicontinuous This shows ( ɛ, ɛ) B α. Thus Homework 3 Solutions, Real Analysis I, Fall, 2010. (9) Let f : (, ) [, ] be a function whose restriction to (, 0) (0, ) is continuous. Assume the one-sided limits p = lim x 0 f(x), q = lim x 0 + f(x) exist

More information

2 2 + x =

2 2 + x = Lecture 30: Power series A Power Series is a series of the form c n = c 0 + c 1 x + c x + c 3 x 3 +... where x is a variable, the c n s are constants called the coefficients of the series. n = 1 + x +

More information

Calculus: What is a Limit? (understanding epislon-delta proofs)

Calculus: What is a Limit? (understanding epislon-delta proofs) Calculus: What is a Limit? (understanding epislon-delta proofs) Here is the definition of a limit: Suppose f is a function. We say that Lim aa ff() = LL if for every εε > 0 there is a δδ > 0 so that if

More information

Midterm Review Math 311, Spring 2016

Midterm Review Math 311, Spring 2016 Midterm Review Math 3, Spring 206 Material Review Preliminaries and Chapter Chapter 2. Set theory (DeMorgan s laws, infinite collections of sets, nested sets, cardinality) 2. Functions (image, preimage,

More information

Continuity. Chapter 4

Continuity. Chapter 4 Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

More information

The reference [Ho17] refers to the course lecture notes by Ilkka Holopainen.

The reference [Ho17] refers to the course lecture notes by Ilkka Holopainen. Department of Mathematics and Statistics Real Analysis I, Fall 207 Solutions to Exercise 6 (6 pages) riikka.schroderus at helsinki.fi Note. The course can be passed by an exam. The first possible exam

More information

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers. MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

Properties of the Integers

Properties of the Integers Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c. Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

Problem 1: Compactness (12 points, 2 points each)

Problem 1: Compactness (12 points, 2 points each) Final exam Selected Solutions APPM 5440 Fall 2014 Applied Analysis Date: Tuesday, Dec. 15 2014, 10:30 AM to 1 PM You may assume all vector spaces are over the real field unless otherwise specified. Your

More information

Lecture 3 - Tuesday July 5th

Lecture 3 - Tuesday July 5th Lecture 3 - Tuesday July 5th jacques@ucsd.edu Key words: Identities, geometric series, arithmetic series, difference of powers, binomial series Key concepts: Induction, proofs of identities 3. Identities

More information

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques

CS 360, Winter Morphology of Proof: An introduction to rigorous proof techniques CS 30, Winter 2011 Morphology of Proof: An introduction to rigorous proof techniques 1 Methodology of Proof An example Deep down, all theorems are of the form If A then B, though they may be expressed

More information

MAS221 Analysis Semester Chapter 2 problems

MAS221 Analysis Semester Chapter 2 problems MAS221 Analysis Semester 1 2018-19 Chapter 2 problems 20. Consider the sequence (a n ), with general term a n = 1 + 3. Can you n guess the limit l of this sequence? (a) Verify that your guess is plausible

More information

MA131 - Analysis 1. Workbook 4 Sequences III

MA131 - Analysis 1. Workbook 4 Sequences III MA3 - Analysis Workbook 4 Sequences III Autumn 2004 Contents 2.3 Roots................................. 2.4 Powers................................. 3 2.5 * Application - Factorials *.....................

More information

Thus f is continuous at x 0. Matthew Straughn Math 402 Homework 6

Thus f is continuous at x 0. Matthew Straughn Math 402 Homework 6 Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some

More information

Axioms for the Real Number System

Axioms for the Real Number System Axioms for the Real Number System Math 361 Fall 2003 Page 1 of 9 The Real Number System The real number system consists of four parts: 1. A set (R). We will call the elements of this set real numbers,

More information

1. Is the set {f a,b (x) = ax + b a Q and b Q} of all linear functions with rational coefficients countable or uncountable?

1. Is the set {f a,b (x) = ax + b a Q and b Q} of all linear functions with rational coefficients countable or uncountable? Name: Instructions. Show all work in the space provided. Indicate clearly if you continue on the back side, and write your name at the top of the scratch sheet if you will turn it in for grading. No books

More information

Proofs Not Based On POMI

Proofs Not Based On POMI s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 12, 2018 Outline 1 Non POMI Based s 2 Some Contradiction s 3

More information

Complex Analysis Homework 9: Solutions

Complex Analysis Homework 9: Solutions Complex Analysis Fall 2007 Homework 9: Solutions 3..4 (a) Let z C \ {ni : n Z}. Then /(n 2 + z 2 ) n /n 2 n 2 n n 2 + z 2. According to the it comparison test from calculus, the series n 2 + z 2 converges

More information

2 (Bonus). 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?

2 (Bonus). 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? MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due 9/5). Prove that every countable set A is measurable and µ(a) = 0. 2 (Bonus). Let A consist of points (x, y) such that either x or y is

More information

means is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.

means is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S. 1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for

More information

A Basic Course in Real Analysis Prof. P. D. Srivastava Department of Mathematics Indian Institute of Technology, Kharagpur

A Basic Course in Real Analysis Prof. P. D. Srivastava Department of Mathematics Indian Institute of Technology, Kharagpur A Basic Course in Real Analysis Prof. P. D. Srivastava Department of Mathematics Indian Institute of Technology, Kharagpur Lecture - 36 Application of MVT, Darbou Theorem, L Hospital Rule (Refer Slide

More information

Section 1.8 The Growth of Functions. We quantify the concept that g grows at least as fast as f.

Section 1.8 The Growth of Functions. We quantify the concept that g grows at least as fast as f. Section 1.8 The Growth of Functions We quantify the concept that g grows at least as fast as f. What really matters in comparing the complexity of algorithms? We only care about the behavior for large

More information

Proofs of Mathema-cal Statements. A proof is a valid argument that establishes the truth of a statement.

Proofs of Mathema-cal Statements. A proof is a valid argument that establishes the truth of a statement. Section 1.7 Proofs of Mathema-cal Statements A proof is a valid argument that establishes the truth of a statement. Terminology A theorem is a statement that can be shown to be true using: definitions

More information

5.9 Representations of Functions as a Power Series

5.9 Representations of Functions as a Power Series 5.9 Representations of Functions as a Power Series Example 5.58. The following geometric series x n + x + x 2 + x 3 + x 4 +... will converge when < x

More information

Chapter 1 Review of Equations and Inequalities

Chapter 1 Review of Equations and Inequalities Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Fall 2017 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books. Applied Analysis APPM 44: Final exam 1:3pm 4:pm, Dec. 14, 29. Closed books. Problem 1: 2p Set I = [, 1]. Prove that there is a continuous function u on I such that 1 ux 1 x sin ut 2 dt = cosx, x I. Define

More information

Section Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence.

Section Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence. Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence. Example Determine the Maclaurin series of f (x) = e x and its the interval of convergence. f n (0)x n Recall from

More information

Chapter 5. Measurable Functions

Chapter 5. Measurable Functions Chapter 5. Measurable Functions 1. Measurable Functions Let X be a nonempty set, and let S be a σ-algebra of subsets of X. Then (X, S) is a measurable space. A subset E of X is said to be measurable if

More information

1 Predicates and Quantifiers

1 Predicates and Quantifiers 1 Predicates and Quantifiers We have seen how to represent properties of objects. For example, B(x) may represent that x is a student at Bryn Mawr College. Here B stands for is a student at Bryn Mawr College

More information

Solutions to Math 41 First Exam October 18, 2012

Solutions to Math 41 First Exam October 18, 2012 Solutions to Math 4 First Exam October 8, 202. (2 points) Find each of the following its, with justification. If the it does not exist, explain why. If there is an infinite it, then explain whether it

More information

56 CHAPTER 3. POLYNOMIAL FUNCTIONS

56 CHAPTER 3. POLYNOMIAL FUNCTIONS 56 CHAPTER 3. POLYNOMIAL FUNCTIONS Chapter 4 Rational functions and inequalities 4.1 Rational functions Textbook section 4.7 4.1.1 Basic rational functions and asymptotes As a first step towards understanding

More information

. Then g is holomorphic and bounded in U. So z 0 is a removable singularity of g. Since f(z) = w 0 + 1

. Then g is holomorphic and bounded in U. So z 0 is a removable singularity of g. Since f(z) = w 0 + 1 Now we describe the behavior of f near an isolated singularity of each kind. We will always assume that z 0 is a singularity of f, and f is holomorphic on D(z 0, r) \ {z 0 }. Theorem 4.2.. z 0 is a removable

More information

Section 1.7 Proof Methods and Strategy. Existence Proofs. xp(x). Constructive existence proof:

Section 1.7 Proof Methods and Strategy. Existence Proofs. xp(x). Constructive existence proof: Section 1.7 Proof Methods and Strategy Existence Proofs We wish to establish the truth of xp(x). Constructive existence proof: - Establish P(c) is true for some c in the universe. - Then xp(x) is true

More information

Solutions to Practice Final 3

Solutions to Practice Final 3 s to Practice Final 1. The Fibonacci sequence is the sequence of numbers F (1), F (2),... defined by the following recurrence relations: F (1) = 1, F (2) = 1, F (n) = F (n 1) + F (n 2) for all n > 2. For

More information

IV.3. Zeros of an Analytic Function

IV.3. Zeros of an Analytic Function IV.3. Zeros of an Analytic Function 1 IV.3. Zeros of an Analytic Function Note. We now explore factoring series in a way analogous to factoring a polynomial. Recall that if p is a polynomial with a zero

More information

Lebesgue Integration: A non-rigorous introduction. What is wrong with Riemann integration?

Lebesgue Integration: A non-rigorous introduction. What is wrong with Riemann integration? Lebesgue Integration: A non-rigorous introduction What is wrong with Riemann integration? xample. Let f(x) = { 0 for x Q 1 for x / Q. The upper integral is 1, while the lower integral is 0. Yet, the function

More information

Warm-up Quantifiers and the harmonic series Sets Second warmup Induction Bijections. Writing more proofs. Misha Lavrov

Warm-up Quantifiers and the harmonic series Sets Second warmup Induction Bijections. Writing more proofs. Misha Lavrov Writing more proofs Misha Lavrov ARML Practice 3/16/2014 and 3/23/2014 Warm-up Using the quantifier notation on the reference sheet, and making any further definitions you need to, write the following:

More information

MORE ON CONTINUOUS FUNCTIONS AND SETS

MORE ON CONTINUOUS FUNCTIONS AND SETS Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly

More information

211 Real Analysis. f (x) = x2 1. x 1. x 2 1

211 Real Analysis. f (x) = x2 1. x 1. x 2 1 Part. Limits of functions. Introduction 2 Real Analysis Eample. What happens to f : R \ {} R, given by f () = 2,, as gets close to? If we substitute = we get f () = 0 which is undefined. Instead we 0 might

More information

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

Problem set 1, Real Analysis I, Spring, 2015. Problem set 1, Real Analysis I, Spring, 015. (1) Let f n : D R be a sequence of functions with domain D R n. Recall that f n f uniformly if and only if for all ɛ > 0, there is an N = N(ɛ) so that if n

More information

Outline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer

Outline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer L11: Numbers Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing March 5-8, 2018 1 Goals and Assumptions 2 Real Numbers 3 Rational and Irrational Assumptions We rely the following assumptions:

More information

Section 3.2 The Growth of Functions. We quantify the concept that g grows at least as fast as f.

Section 3.2 The Growth of Functions. We quantify the concept that g grows at least as fast as f. Section 3.2 The Growth of Functions We quantify the concept that g grows at least as fast as f. What really matters in comparing the complexity of algorithms? We only care about the behavior for large

More information

REAL AND COMPLEX ANALYSIS

REAL AND COMPLEX ANALYSIS REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any

More information

THE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES

THE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES THE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES PHILIP GADDY Abstract. Throughout the course of this paper, we will first prove the Stone- Weierstrass Theroem, after providing some initial

More information

17. Convergence of Random Variables

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

More information

Section 21. The Metric Topology (Continued)

Section 21. The Metric Topology (Continued) 21. The Metric Topology (cont.) 1 Section 21. The Metric Topology (Continued) Note. In this section we give a number of results for metric spaces which are familar from calculus and real analysis. We also

More information

Solutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa

Solutions Manual for Homework Sets Math 401. Dr Vignon S. Oussa 1 Solutions Manual for Homework Sets Math 401 Dr Vignon S. Oussa Solutions Homework Set 0 Math 401 Fall 2015 1. (Direct Proof) Assume that x and y are odd integers. Then there exist integers u and v such

More information

Seunghee Ye Ma 8: Week 2 Oct 6

Seunghee Ye Ma 8: Week 2 Oct 6 Week 2 Summary This week, we will learn about sequences and real numbers. We first define what we mean by a sequence and discuss several properties of sequences. Then, we will talk about what it means

More information

Elementary Probability. Exam Number 38119

Elementary Probability. Exam Number 38119 Elementary Probability Exam Number 38119 2 1. Introduction Consider any experiment whose result is unknown, for example throwing a coin, the daily number of customers in a supermarket or the duration of

More information

Name: Student ID: Instructions:

Name: Student ID: Instructions: Instructions: Name: CSE 322 Autumn 2001: Midterm Exam (closed book, closed notes except for 1-page summary) Total: 100 points, 5 questions, 20 points each. Time: 50 minutes 1. Write your name and student

More information

1. Propositions: Contrapositives and Converses

1. Propositions: Contrapositives and Converses Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement

More information

Proof by Contradiction

Proof by Contradiction Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving

More information

Math 112 (Calculus I) Midterm Exam 3 KEY

Math 112 (Calculus I) Midterm Exam 3 KEY Math 11 (Calculus I) Midterm Exam KEY Multiple Choice. Fill in the answer to each problem on your computer scored answer sheet. Make sure your name, section and instructor are on that sheet. 1. Which of

More information

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.

Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1. Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence

More information

Limits and Continuity

Limits and Continuity Chapter Limits and Continuity. Limits of Sequences.. The Concept of Limit and Its Properties A sequence { } is an ordered infinite list x,x,...,,... The n-th term of the sequence is, and n is the index

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need

More information

Math 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx.

Math 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx. Math 321 Final Examination April 1995 Notation used in this exam: N 1 π (1) S N (f,x) = f(t)e int dt e inx. 2π n= N π (2) C(X, R) is the space of bounded real-valued functions on the metric space X, equipped

More information

1230, notes 16. Karl Theodor Wilhelm Weierstrass, November 18, / 18

1230, notes 16. Karl Theodor Wilhelm Weierstrass, November 18, / 18 1230, notes 16 Karl Theodor Wilhelm Weierstrass, 1815-1897 November 18, 2014 1 / 18 1230, notes 16 Karl Theodor Wilhelm Weierstrass, 1815-1897 Left university without a degree (ignored what he was supposed

More information