Some Function Problems SOLUTIONS Isabel Vogt Last Edited: May 24, 2013

 Eric Lyons
 5 months ago
 Views:
Transcription
1 Some Function Problems SOLUTIONS Isabel Vogt Last Edited: May 24, 23 Most of these problems were written for my students in Math 23a/b at Harvard in 2/22 and 22/23. They cover basic function theory, countability, differential calculus, and pointset topology.. T/F: The function q : R R given by is nowhere continuous. q(x) = { x : x Q : x / Q FALSE This interesting function is actually continuous at! Let s see why: In order for q to be continuous at, ɛ >, δ > s.t. y R, y < δ q(y) q() < ɛ Well, q() =, so we just need an appropriate δ such that for all y < δ, q(y) < ɛ. Claim: for all ɛ let δ = ɛ. Let s check the requirements. There are two possibilities, y Q 2 and y / Q For y / Q, q(y) = < ɛ For y Q, q(y) = y < ɛ 2 So q is continuous at! < ɛ 2. T/F: The space of results of infinite coin flips (i.e. vectors where the i th position is H/T depending on the result of the flip) is countably infinite. FALSE Imagine a new coin flip vector f whose i th position is H if the i th coin flip of the i th flip vector was T and conversely T if it was H. This differs in at least one position from every counted flip vector. Thus the set is not countable  i.e. it is uncountable infinite.
2 3. Let f be a function f : D C. (a) We can think of the function as merely a set of ordered pairs (x, y). What set must this be a subset of? A function is merely an ordered pair (x, f(x)) where x D and f(x) C. So S f (the function f as a set) is a subset of the Cartesian product D C. (b) Let D = C = Q. And let f be any function f : D C. Thinking of f as a set, what is its cardinality? Prove your answer. By definition of being a function, f is welldefined for all x D. So this means that x D, (x, f(x)) S f, and if x = x, then f(x) = f(x ) uniqueness. Thus we can create a bijection between the set S f and D which is merely (x, f(x)) x. This is injective and surjective by the above conditions on f. Thus S f must be of the same cardinality as D  in this case countably infinite. (c) Let D = C = Q. What is the cardinality of the set of functions f : D C. Justify your answer (it might help to think of what we call a similar set). What we are concerned with is the set of all possible sets {S f } f for functions f : Q Q. First note that we can map to any subset of Q with our function f. Thus the set P(Q) injects/imbeds into our set {S f } f (note that this is not surjective because the image does not uniquely determine the map). And the cardinality of P(Q) is uncountably infinite (Cantor proved this for P(N) and the result follows for our case). Thus our set {S f } f is uncountable. (d) Let D be an uncountable set, C = {}. How many different welldefined functions f are there? What can you say about this/these function(s) (i.e. injectivity, surjectivity, bijectivity)? There are two (trivial) subsets of {}  namely {} and φ. Thus the only possibilities for functions are the zero map f : x Q and the trivial subset (D φ) which is the empty set. However, from the definition of a function, x D, f(x) C such that f : x f(x). This is not satisfies by {}. So the only map is the zero function f. The map f is obviously necessarily surjective but not injective. (e) Let D = φ and C be a countable set. How many different welldefined functions f are there? Justify your answer based upon the your answer to part (a). If such an f exists is it injective? Surjective? In this case ({}, Q) is a function (vacuously) as there does not exist counterexample points in {} which are not mapped to the codomain. The map φ is quite interesting in 2
3 how many properties are vacuously true! The definition of injective is f(x ) = f(x 2 ) x = x 2. In order for f to not be injective, there must exits f(x ) = f(x 2 ) with x x 2, but there doesn t exist f(x ) or f(x 2 ) as counterexamples! But for surjectivity, the definition says y Q, x {} such that f(x) = y. In this case we can not find x {} so this is false  it is not surjective. ( ) x 4. T/F: Given a continuous function f with f : R y 2 R, if the Jacobian matrix at a R 2 exists, then f is differentiable at a, and its derivative is given by [Jf(a)]. FALSE Take the function f(x, y) = x2 y, with f(, ) =. This function is continuous at the origin, x 2 +y 2 and both partials exist, but it is not differentiable there. 5. T/F: f is continuous at x if and only if ɛ >, δ > such that f(b δ (x )) B ɛ (f(x )). TRUE This is merely a restatement of the definition of continuity, i.e. f is continuous if and only if ɛ >, δ > such that x y < δ implies that f(x ) f(y ) < ɛ. The first condition is that y is in a δneighborhood of x (i.e. B δ (x )) and the second condition says that this ball is mapped to an ɛneighborhood of f(x ). 6. T/F: If f : R 2 R 2 is differentiable and [Df()] is not invertible, then there is no differentiable function g : R 2 R 2 such that TRUE By the chain rule we know that: So at v = we have (g f)( x) = x [D(g f( x)] h = [Dg(f( x))][df( x)] h [D(g f()] h = [Dg(f())][Df()] h In order for (g f)( x) = x, we would have [D(g f()] = I. Thus: [Dg(f())][Df()] = I But by definition this would mean that [Df()] is invertible as it is square and has a left inverse. This is a contradiction, thus no such g exists and the statement is true. 7. T/F: A set F is closed implies that all points in F are accumulation points. FALSE It is tempting to say this, since the definition we are going with for a closed set is one which contains all its accumulation points, but there is a big distinction here  that does not mean that all points are accumulation points. Take F = {}. This is clearly a closed set, but F contains no other points than, so it is not an accumulation point of the set. 3
4 8. T/F: For f and g differentiable functions from R 2 R FALSE f g x y = f g y x This is so terribly false, I just threw it on here to make sure no one thinks about partial derivatives as fractions. As a counter example take f(x, y) = x and g(x, y) = y. Then the left product is and the right is. 9. T/F: Every convergent subsequence of a sequence {a i } defined on a compact set C converges to the same limit a C. FALSE Consider the sequence x i = cos iπ for i N. This infinite sequence lives in the compact 2 interval [, ], and it thus has a convergent subsequence. There are, however, two possible sequences  all the even terms for which x 2k = + and all the odd terms for which x 2 2k+ =. 2 They, of course, do not converge to the same limit.. Suppose g : R 2 R 3 is a function such that the directional derivatives at x along v, v 2, and v 3 are e, e 2, and e 3 respectively. What can we say about g? Prove your claim. In R 2, three vectors can t be independent. Thus { v, v 2, v 3 } must be dependent. Without loss of generality let v 3 = a v + a 2 v 2. Then, [Dg(x )] v 3 = a [Dg(x )] v + a 2 [Dg(x )] v 2 But, e 3 a e + a 2 e 2, because they are independent. Thus the derivative can not be a linear function, and g is not differentiable at x!. (a) Define the zerolocus in R 2 of the polynomial f(x, y) = y x 2 to be the set of points G f = {x, y R f(x, y ) = }. Is the set G f open or closed as a subset of R 2? Similarly to a straight line, the curve is closed as its complement is open. Alternatively, it contains all of its accumulation points, as any accumulation point necessarily satisfies the above locus equation. (b) It is one thing to claim that ( ) there is an open set, and another thing to actually construct 3 one. Given a point a =, we wish to construct the largest ball B r (a) around this point such all points in this ball are in the complement of G f  ie B r (a) R 2 C. Find an equation that will determine the maximum r of this ball in two ways: 4
5 2. Let i. Finding an extreme value of the distance function between the point a and the parabola A general point on the parabola will be of the form (a, a 2 ). So the distance we are looking for is [ ] 3 a a 2 To make out lives easier, we know that the distance function will achieve a maximum or a minimum at the same value of a as its square (why?), so we can choose to optimize for the square: d(a) 2 = (3 a) 2 + ( a 2 ) 2 = a 4 a 2 6a + d(d(a)) = 4a 3 2a 6 da So we are looking for solutions to the equation 2a 3 a 3 = ii. Use the concept that the shortest line between a point and a line will be a perpendicular. We can use the derivative as a linear approximation to the function locally. Thus at any point (a,[ a 2 ),] the parabola looks like a linear function described by a vector in the direction. So we take the displacement vector between our point and 2a [ ] 3 a this arbitrary point on the parabola to be a 2. The shortest distance is going to be when these two are perpendicular, i.e. when the dot product is. In other words: [ ] [ ] 3 a 2a a 2 = 3 a + 2a 2a 3 = Or simply 2a 3 a 3 =  the same equation as defined above! f is defined to be at ( ). f ( ) x = x3 y 2 + x 4 y. y x 4 + y 4 (a) Using the definition of continuity, prove that f is continuous at ( ). 5
6 ( ) (b) Show that both partial derivatives are zero at but that the function is not differentiable there. Note: You must work from the definition of differentiable. D f(, ) = lim (f( + h, ) f(, )) = lim h h h h = D 2 f(, ) = lim (f(, + h) f(, )) = lim h h h h = But for the directional derivative h = (h, h): [Df(, )] h = lim h h (h5 h ) = 4 As we know, +, so it is not linear and the derivative does not exist. 3. The topological definition of a continuous function is as follows: f : D R C R is continuous open sets A C, f (A) is open in D Using the standard metric topology of open sets with which you are familiar, show that this definition is equivalent to the ɛδ definition with which you are familiar (Hint: you may want to use the formulation given in a true/false question above). Why does this not contradict the counterexamples you found on HW 7  i.e. the open sets that are not mapped to open sets? First we show that the standard definition implies the topological definition. So we assume that for a given continuous function f, for all x This is equivalent to saying that ɛ >, δ > such that x y < δ f(x) f(y) < ɛ ɛ >, δ >, f(b δ (x)) B ɛ (f(x)) Given any A open set in C, we want to show that f (A) D is open. Or more precisely, given any y A, as A is open, we know that B γ (y) A. So we want to show that f (B γ (y)) is open in D. It suffices for us to show that given any x f (B γ (y)) there exists a r such that B r (x) f (B γ (y)). 6
7 We simply find an ɛ > such that B ɛ (f(x)) B γ (y). This implies that there exists δ > such that f(b δ (x)) B ɛ (f(x)) B γ (y) B δ (x) f (B ɛ (f(x)) f (B γ (y)) let r = δ, B r (x) f (B γ (y) which completes the proof. Now we prove that the topological definition implies the standard definition. For a given x C, and ɛ >, we know an open set in C  namely B ɛ (f(x)). For f continuous, we know this means that f (B ɛ (f(x))) is open in D. Thus for x f (B ɛ (f(x))), r > such that B r (x) f (B ɛ (f(x))). Now we simply let δ = r, and derive which completes the proof. B δ (x) f (B ɛ (f(x))) f(b δ (x)) B ɛ (f(x)) 4. T/F: Let X and Y be sets with A, A 2 X. For all functions f : X Y as subsets of Y. And for B, B 2 Y, as subsets of X. FALSE f(a A 2 ) = f(a ) f(a 2 ) f (B B 2 ) = f (B ) f (B 2 ) The first of these statements is false, while the second is true (one of the reasons why inverses images are considerably nicer to work with). The true statement is f(a A 2 ) f(a ) f(a 2 ) When this fails to be equality, it will be because f isn t injective. A counterexample for the inclusion in both directions is the following function f : S S for S := {, 2, 3} defined by f() = 2, f(2 = 2), f(3) = 3. We can form 2 sets A = {, 3} and A 2 = {2, 3}. Then A A 2 = {3} and f(a A 2 ) = {3}. But f(a ) = {2, 3} and f(a 2 ) = {2, 3} so f(a ) f(a 2 ) = {2, 3}. Clearly these are not equal. x ( ) 5. T/F: Let h y x = 2 y y z 2. By the implicit function theorem, at the point we have z a continuously differentiable function i locally expressing x and z in terms of y to give the 7
8 locus of points whose image under h is ( ). FALSE The point is not in the zerolocus of h. 6. T/F: If a : N R is a sequence converging to, then for any b : N R, the sequence (a i b i ), for i N converges to FALSE This would be true if b i were bounded. Outwithabang counter example: a i = i, b i = e i Subtle counter example: a i = i, b i = i 7. Give an example of a continuous function f : R R such that the restriction of the domain of f to Z R is a continuous map, or prove that one does not exist. EXAMPLE Perhaps continuous functions on Z make you uncomfortable (rightly so) but think about this, what you really need for continuity, is to be able to zoom in in the codomain. This is you ɛ > part. However, if this doesn t actually force you to squish in on values in the domain, no problem. As an example, take the zero map. 8. Give an example of a function g : R R that has a local inverse at every point, but for which no global inverse exists, or prove that one does not exist. NO EXAMPLE If there is a local inverse at every point then g is never zero, meaning g is monotonic. Thus there is a global inverse. 9. For F,..., F n... closed sets such that F i R 2, let F = i F i Give an example of a function f : F R which is differentiable, or prove that one does not exist. NO EXAMPLE No differentiable functions on closed sets, and the infinite intersection of closed sets is closed. 8
9 2. Give an example of a sequence of vectors v, v 2,... R n which is convergent but the length of each vector is not uniformly bounded by some M, or prove that one does not exist. NO EXAMPLE Every such sequence will be uniformly bounded. To be convergent to v we need which means that for any v n with n > N: ɛ >, N > s.t. n > N, v n v < ɛ v n = v n v + v v n v + v < ɛ + v And we only have finitely many vectors less than v N so we simply take the max: M = max{ v i } i<n And then M = max{ v, M } +. This must work as the length condition is for all epsilon. So surely > ɛ. 2. Give an example of a surjective map g : Q R which injects into its image, or prove that one does not exist. NO EXAMPLE Nope, that would mean g was bijective, but Q and R don t have the same cardinality. 22. The Inverse and Implicit Function Theorems (a) As I am sure you can imagine, the implicit function theorem has many important practical applications. Here is a somewhat whimsical one: The school district s curriculum committee has accurately calculated that if they provide x units of instruction in testgeared material and y units of instruction in academic exploration they achieve test scores S and student happiness H given by the function ( ) S H = f ( ) x y ( ) x = 3 + xy /2 y 2 4x /2 Currently the curriculum is dictating educational time such that x = 4, y =, S = 68, H = 7. Fearing trouble with reelection due to student unhappiness, the committee wants to moderately increase H to 2 and only decrease S to 63. Use the inverse function theorem to determine appropriate values of x and y that will approximate their desired output. How accurate is your answer? Why? The final answer is ( ) x = y ( )
10 (b) Call X the space of linear transformationsa : R 2 R 2 with determinant +. Show that locally you can parameterize the passive variable(s) of X in terms of the active variable(s). X is the locus of the function F : R 4 R given by F : A det(a) The Jacobian is given by [DF (A)] = [ d c b a ] This is onto except for a = b c = d =, which is not even in X, so we are good! (c) Call Y the space of linear transformations B : R 3 R 3 such that B B T = I (B is known as a orthogonal matrix). How would you apply the implicit function theorem to locally parameterize Y? i. Using the following statement: All matrices A Y satisfy the equation AA T I =, thus I have a function F : R 9 R 9 given by F : A AA T I for which Y is the locus. Is the matrix [DF ] ever onto? As written, no, because Y is not 9dimensional and thus can not span R 9. ii. How do you resolve this? Think about what you know about AA T. Because AA T is symmetric we only need to consider the upper triangle. Our space Y is the locus of the function G : R 9 R 6 given by this comparison. In this case, if you work out the Jacobian, you find that it is everywhere onto.
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 informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMSTEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111  Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationOnetoone functions and onto functions
MA 3362 Lecture 7  Onetoone and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of onetoone and onto Onetoone functions and onto functions At the level of set theory, there are
More information447 HOMEWORK SET 1 IAN FRANCIS
7 HOMEWORK SET 1 IAN FRANCIS For each n N, let A n {(n 1)k : k N}. 1 (a) Determine the truth value of the statement: for all n N, A n N. Justify. This statement is false. Simply note that for 1 N, A 1
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationMetric Space Topology (Spring 2016) Selected Homework Solutions. HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y)
Metric Space Topology (Spring 2016) Selected Homework Solutions HW1 Q1.2. Suppose that d is a metric on a set X. Prove that the inequality d(x, y) d(z, w) d(x, z) + d(y, w) holds for all w, x, y, z X.
More informationMath 117: Topology of the Real Numbers
Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few
More informationCHAPTER 6. Limits of Functions. 1. Basic Definitions
CHAPTER 6 Limits of Functions 1. Basic Definitions DEFINITION 6.1. Let D Ω R, x 0 be a limit point of D and f : D! R. The limit of f (x) at x 0 is L, if for each " > 0 there is a ± > 0 such that when x
More informationCartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) : (a A) and (b B)}. The following points are worth special
More information1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3
Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationMATH PRACTICE EXAM 1 SOLUTIONS
MATH 2359 PRACTICE EXAM SOLUTIONS SPRING 205 Throughout this exam, V and W will denote vector spaces over R Part I: True/False () For each of the following statements, determine whether the statement is
More informationCHAPTER 5. The Topology of R. 1. Open and Closed Sets
CHAPTER 5 The Topology of R 1. Open and Closed Sets DEFINITION 5.1. A set G Ω R is open if for every x 2 G there is an " > 0 such that (x ", x + ") Ω G. A set F Ω R is closed if F c is open. The idea is
More informationMATH 201 Solutions: TEST 3A (in class)
MATH 201 Solutions: TEST 3A (in class) (revised) God created infinity, and man, unable to understand infinity, had to invent finite sets.  Gian Carlo Rota Part I [5 pts each] 1. Let X be a set. Define
More informationMath 300: Final Exam Practice Solutions
Math 300: Final Exam Practice Solutions 1 Let A be the set of all real numbers which are zeros of polynomials with integer coefficients: A := {α R there exists p(x) = a n x n + + a 1 x + a 0 with all a
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More informationReal Analysis  Notes and After Notes Fall 2008
Real Analysis  Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start
More informationProblems: Section 131, 3, 4, 5, 6; Section 161, 5, 8, 9;
Math 553  Topology Todd Riggs Assignment 1 Sept 10, 2014 Problems: Section 131, 3, 4, 5, 6; Section 161, 5, 8, 9; 13.1) Let X be a topological space and let A be a subset of X. Suppose that for each
More informationMany of you got these steps reversed or otherwise out of order.
Problem 1. Let (X, d X ) and (Y, d Y ) be metric spaces. Suppose that there is a bijection f : X Y such that for all x 1, x 2 X. 1 10 d X(x 1, x 2 ) d Y (f(x 1 ), f(x 2 )) 10d X (x 1, x 2 ) Show that if
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationSome Background Material
Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary  but important  material as a way of dipping our toes in the water. This chapter also introduces important
More informationTHE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS
THE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS RALPH HOWARD DEPARTMENT OF MATHEMATICS UNIVERSITY OF SOUTH CAROLINA COLUMBIA, S.C. 29208, USA HOWARD@MATH.SC.EDU Abstract. This is an edited version of a
More informationContribution 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 informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions
Math 50 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 205 Homework #5 Solutions. Let α and c be real numbers, c > 0, and f is defined
More informationNotes. Functions. Introduction. Notes. Notes. Definition Function. Definition. Slides by Christopher M. Bourke Instructor: Berthe Y.
Functions Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Section 2.3 of Rosen cse235@cse.unl.edu Introduction
More informationMath 396. Bijectivity vs. isomorphism
Math 396. Bijectivity vs. isomorphism 1. Motivation Let f : X Y be a C p map between two C p premanifolds with corners, with 1 p. Assuming f is bijective, we would like a criterion to tell us that f 1
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationWalker Ray Econ 204 Problem Set 3 Suggested Solutions August 6, 2015
Problem 1. Take any mapping f from a metric space X into a metric space Y. Prove that f is continuous if and only if f(a) f(a). (Hint: use the closed set characterization of continuity). I make use of
More informationEconomics 204 Fall 2011 Problem Set 1 Suggested Solutions
Economics 204 Fall 2011 Problem Set 1 Suggested Solutions 1. Suppose k is a positive integer. Use induction to prove the following two statements. (a) For all n N 0, the inequality (k 2 + n)! k 2n holds.
More informationSequences. 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(a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff
Chapter 4: Functional Limits and Continuity Definition. Let S R and f : S R. (a) For an accumulation point a of S, the number l is the limit of f(x) as x approaches a, or lim x a f(x) = l, iff ε > 0, δ
More informationContinuity. 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 information1 Takehome exam and final exam study guide
Math 215  Introduction to Advanced Mathematics Fall 2013 1 Takehome exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationMath 110, Spring 2015: Midterm Solutions
Math 11, Spring 215: Midterm Solutions These are not intended as model answers ; in many cases far more explanation is provided than would be necessary to receive full credit. The goal here is to make
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationf(x) f(z) c x z > 0 1
INVERSE AND IMPLICIT FUNCTION THEOREMS I use df x for the linear transformation that is the differential of f at x.. INVERSE FUNCTION THEOREM Definition. Suppose S R n is open, a S, and f : S R n is a
More informationIntroduction to Real Analysis
Introduction to Real Analysis Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Sets Sets are the basic objects of mathematics. In fact, they are so basic that
More information1 Proof techniques. CS 224W Linear Algebra, Probability, and Proof Techniques
1 Proof techniques Here we will learn to prove universal mathematical statements, like the square of any odd number is odd. It s easy enough to show that this is true in specific cases for example, 3 2
More informationDifferentiation. f(x + h) f(x) Lh = L.
Analysis in R n Math 204, Section 30 Winter Quarter 2008 Paul Sally, email: sally@math.uchicago.edu John Boller, email: boller@math.uchicago.edu website: http://www.math.uchicago.edu/ boller/m203 Differentiation
More informationGRE Math Subject Test #5 Solutions.
GRE Math Subject Test #5 Solutions. 1. E (Calculus) Apply L Hôpital s Rule two times: cos(3x) 1 3 sin(3x) 9 cos(3x) lim x 0 = lim x 2 x 0 = lim 2x x 0 = 9. 2 2 2. C (Geometry) Note that a line segment
More informationMath 13, Spring 2013, Lecture B: Midterm
Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # Email address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.
More informationMath 361: Homework 1 Solutions
January 3, 4 Math 36: Homework Solutions. We say that two norms and on a vector space V are equivalent or comparable if the topology they define on V are the same, i.e., for any sequence of vectors {x
More informationHomework 3 Solutions, Math 55
Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}
More informationChapter 3: Theory Review: Solutions Math 308 F Spring 2015
Chapter : Theory Review: Solutions Math 08 F Spring 05. What two properties must a function T : R m R n satisfy to be a linear transformation? (a) For all vectors u and v in R m, T (u + v) T (u) + T (v)
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 810 proofs It will take place on Tuesday, December 11, from 10:30 AM  1:30 PM, in the usual room Topics
More informationand problem sheet 6
228 and 55 problem sheet 6 Solutions to the following seven exercises and optional bonus problem are to be submitted through gradescope by 2:0AM on Thursday 9th October 207. There are also some practice
More informationANALYSIS QUALIFYING EXAM FALL 2017: SOLUTIONS. 1 cos(nx) lim. n 2 x 2. g n (x) = 1 cos(nx) n 2 x 2. x 2.
ANALYSIS QUALIFYING EXAM FALL 27: SOLUTIONS Problem. Determine, with justification, the it cos(nx) n 2 x 2 dx. Solution. For an integer n >, define g n : (, ) R by Also define g : (, ) R by g(x) = g n
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More informationMORE 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 informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationIntroduction. Chapter 1. Contents. EECS 600 Function Space Methods in System Theory Lecture Notes J. Fessler 1.1
Chapter 1 Introduction Contents Motivation........................................................ 1.2 Applications (of optimization).............................................. 1.2 Main principles.....................................................
More informationMH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then
MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever
More informationExtra Problems for Math 2050 Linear Algebra I
Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as
More informationFilters in Analysis and Topology
Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into
More informationFunctions If (x, y 1 ), (x, y 2 ) S, then y 1 = y 2
Functions 432008 Definition. A function f from a set X to a set Y is a subset S of the product X Y such that if (, y 1 ), (, y 2 ) S, then y 1 = y 2. Instead of writing (, y) S, you usually write f()
More informationTOPOLOGY TAKEHOME CLAY SHONKWILER
TOPOLOGY TAKEHOME CLAY SHONKWILER 1. The Discrete Topology Let Y = {0, 1} have the discrete topology. Show that for any topological space X the following are equivalent. (a) X has the discrete topology.
More informationSection 31. The Separation Axioms
31. The Separation Axioms 1 Section 31. The Separation Axioms Note. Recall that a topological space X is Hausdorff if for any x,y X with x y, there are disjoint open sets U and V with x U and y V. In this
More informationFoundations Revision Notes
oundations Revision Notes hese notes are designed as an aid not a substitute for revision. A lot of proofs have not been included because you should have them in your notes, should you need them. Also,
More informationMath 117: Continuity of Functions
Math 117: Continuity of Functions John Douglas Moore November 21, 2008 We finally get to the topic of ɛ δ proofs, which in some sense is the goal of the course. It may appear somewhat laborious to use
More informationProblems for Chapter 3.
Problems for Chapter 3. Let A denote a nonempty set of reals. The complement of A, denoted by A, or A C is the set of all points not in A. We say that belongs to the interior of A, Int A, if there eists
More informationWeek 4: Differentiation for Functions of Several Variables
Week 4: Differentiation for Functions of Several Variables Introduction A functions of several variables f : U R n R is a rule that assigns a real number to each point in U, a subset of R n, For the next
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationBonus Homework. Math 766 Spring ) For E 1,E 2 R n, define E 1 + E 2 = {x + y : x E 1,y E 2 }.
Bonus Homework Math 766 Spring ) For E,E R n, define E + E = {x + y : x E,y E }. (a) Prove that if E and E are compact, then E + E is compact. Proof: Since E + E R n, it is sufficient to prove that E +
More information4.1 Realvalued functions of a real variable
Chapter 4 Functions When introducing relations from a set A to a set B we drew an analogy with coordinates in the xy plane. Instead of coming from R, the first component of an ordered pair comes from
More informationWhat to remember about metric spaces
Division of the Humanities and Social Sciences What to remember about metric spaces KC Border These notes are (I hope) a gentle introduction to the topological concepts used in economic theory. If the
More informationMore Books At www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com www.goalias.blogspot.com
More information1. For each statement, either state that it is True or else Give a Counterexample: (a) If a < b and c < d then a c < b d.
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 informationProblem 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 informationAnswers in blue. If you have questions or spot an error, let me know. 1. Find all matrices that commute with A =. 4 3
Answers in blue. If you have questions or spot an error, let me know. 3 4. Find all matrices that commute with A =. 4 3 a b If we set B = and set AB = BA, we see that 3a + 4b = 3a 4c, 4a + 3b = 3b 4d,
More informationAn Introduction to NonStandard Analysis and its Applications
An Introduction to NonStandard Analysis and its Applications Kevin O Neill March 6, 2014 1 Basic Tools 1.1 A Shortest Possible History of Analysis When Newton and Leibnitz practiced calculus, they used
More informationWritten Homework # 4 Solution
Math 516 Fall 2006 Radford Written Homework # 4 Solution 12/10/06 You may use results form the book in Chapters 1 6 of the text, from notes found on our course web page, and results of the previous homework.
More information(D) Introduction to order types and ordinals
(D) Introduction to order types and ordinals Linear orders are one of the mathematical tools that are used all over the place. Wellordered sets are a special kind of linear order. At first sight wellorders
More informationCHENNAI MATHEMATICAL INSTITUTE Postgraduate Programme in Mathematics MSc/PhD Entrance Examination 18 May 2015
Instructions: CHENNAI MATHEMATICAL INSTITUTE Postgraduate Programme in Mathematics MSc/PhD Entrance Examination 18 May 2015 Enter your Registration Number here: CMI PG Enter the name of the city where
More informationSets are one of the basic building blocks for the types of objects considered in discrete mathematics.
Section 2.1 Introduction Sets are one of the basic building blocks for the types of objects considered in discrete mathematics. Important for counting. Programming languages have set operations. Set theory
More informationAn Introduction to Real Analysis. John K. Hunter 1
An Introduction to Real Analysis John K. Hunter Department of Mathematics, University of California at Davis The author was supported in part by the NSF. Thanks to Janko Gravner for a number of corrections
More informationDepartment of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016
Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2016 1. Please write your 1 or 2digit exam number on
More informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
More informationInfinite constructions in set theory
VI : Infinite constructions in set theory In elementary accounts of set theory, examples of finite collections of objects receive a great deal of attention for several reasons. For example, they provide
More informationvan Rooij, Schikhof: A Second Course on Real Functions
vanrooijschikhofproblems.tex December 5, 2017 http://thales.doa.fmph.uniba.sk/sleziak/texty/rozne/pozn/books/ van Rooij, Schikhof: A Second Course on Real Functions Some notes made when reading [vrs].
More informationADVANCED CALCULUS  MTH433 LECTURE 4  FINITE AND INFINITE SETS
ADVANCED CALCULUS  MTH433 LECTURE 4  FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationMATH 6102: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 6102: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More informationIntroduction to Mathematical Analysis I. Second Edition. Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam
Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere Nguyen Mau Nam Introduction to Mathematical Analysis I Second Edition Beatriz Lafferriere Gerardo Lafferriere
More informationAdvanced Calculus I Chapter 2 & 3 Homework Solutions October 30, Prove that f has a limit at 2 and x + 2 find it. f(x) = 2x2 + 3x 2 x + 2
Advanced Calculus I Chapter 2 & 3 Homework Solutions October 30, 2009 2. Define f : ( 2, 0) R by f(x) = 2x2 + 3x 2. Prove that f has a limit at 2 and x + 2 find it. Note that when x 2 we have f(x) = 2x2
More informationM4P52 Manifolds, 2016 Problem Sheet 1
Problem Sheet. Let X and Y be ndimensional topological manifolds. Prove that the disjoint union X Y is an ndimensional topological manifold. Is S S 2 a topological manifold? 2. Recall that that the discrete
More informationA function is a special kind of relation. More precisely... A function f from A to B is a relation on A B such that. f (x) = y
Functions A function is a special kind of relation. More precisely... A function f from A to B is a relation on A B such that for all x A, there is exactly one y B s.t. (x, y) f. The set A is called the
More informationMATHS 730 FC Lecture Notes March 5, Introduction
1 INTRODUCTION MATHS 730 FC Lecture Notes March 5, 2014 1 Introduction Definition. If A, B are sets and there exists a bijection A B, they have the same cardinality, which we write as A, #A. If there exists
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationCHAPTER VIII HILBERT SPACES
CHAPTER VIII HILBERT SPACES DEFINITION Let X and Y be two complex vector spaces. A map T : X Y is called a conjugatelinear transformation if it is a reallinear transformation from X into Y, and if T (λx)
More informationINFINITY: CARDINAL NUMBERS
INFINITY: CARDINAL NUMBERS BJORN POONEN 1 Some terminology of set theory N := {0, 1, 2, 3, } Z := {, 2, 1, 0, 1, 2, } Q := the set of rational numbers R := the set of real numbers C := the set of complex
More informationAfter taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain.
Lecture 1: August 25 Introduction. Topology grew out of certain questions in geometry and analysis about 100 years ago. As Wikipedia puts it, the motivating insight behind topology is that some geometric
More informationCHAPTER I THE RIESZ REPRESENTATION THEOREM
CHAPTER I THE RIESZ REPRESENTATION THEOREM We begin our study by identifying certain special kinds of linear functionals on certain special vector spaces of functions. We describe these linear functionals
More informationSupplementary Material for MTH 299 Online Edition
Supplementary Material for MTH 299 Online Edition Abstract This document contains supplementary material, such as definitions, explanations, examples, etc., to complement that of the text, How to Think
More informationPart IA. Numbers and Sets. Year
Part IA Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2017 19 Paper 4, Section I 1D (a) Show that for all positive integers z and n, either z 2n 0 (mod 3) or
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime
More information