Some Function Problems SOLUTIONS Isabel Vogt Last Edited: May 24, 2013
|
|
- Eric Lyons
- 6 years 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 point-set 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 well-defined 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 well-defined 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 well-defined 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 counter-example 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 zero-locus 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 counter-examples 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 counter-example 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 zero-locus 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. Out-with-a-bang 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 test-geared 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 9-dimensional 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 informationSelected problems from past exams
Discrete Structures CS2800 Prelim 1 s Selected problems from past exams 1. True/false. For each of the following statements, indicate whether the statement is true or false. Give a one or two sentence
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More information2 Metric Spaces Definitions Exotic Examples... 3
Contents 1 Vector Spaces and Norms 1 2 Metric Spaces 2 2.1 Definitions.......................................... 2 2.2 Exotic Examples...................................... 3 3 Topologies 4 3.1 Open Sets..........................................
More informationSETS AND FUNCTIONS JOSHUA BALLEW
SETS AND FUNCTIONS JOSHUA BALLEW 1. Sets As a review, we begin by considering a naive look at set theory. For our purposes, we define a set as a collection of objects. Except for certain sets like N, Z,
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationFunctions Functions and Modeling A UTeach/TNT Course
Definition of a Function DEFINITION: Let A and B be sets. A function between A and B is a subset of A B with the property that if (a, b 1 )and(a, b 2 ) are both in the subset, then b 1 = b 2. The domain
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationFUNCTIONAL ANALYSIS CHRISTIAN REMLING
FUNCTIONAL ANALYSIS CHRISTIAN REMLING Contents 1. Metric and topological spaces 2 2. Banach spaces 12 3. Consequences of Baire s Theorem 30 4. Dual spaces and weak topologies 34 5. Hilbert spaces 50 6.
More informationCountability. 1 Motivation. 2 Counting
Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably
More informationMATH 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 informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationFunctions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.
Chapter 4 Functions Definition 1 Let A and B be sets. A relation between A and B is any subset of A B. Definition 2 Let A and B be sets. A function from A to B is a relation f between A and B such that
More informationEconomics 204 Fall 2011 Problem Set 2 Suggested Solutions
Economics 24 Fall 211 Problem Set 2 Suggested Solutions 1. Determine whether the following sets are open, closed, both or neither under the topology induced by the usual metric. (Hint: think about limit
More informationMid 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 informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. Determine whether the following statements are true or false. Justify your answer (i.e., prove the claim, derive a contradiction or give a counter-example). (a) (10
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationREVIEW 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 informationFunctions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014
Functions and cardinality (solutions) 21-127 sections A and F TA: Clive Newstead 6 th May 2014 What follows is a somewhat hastily written collection of solutions for my review sheet. I have omitted some
More informationINTRODUCTION TO TOPOLOGY, MATH 141, PRACTICE PROBLEMS
INTRODUCTION TO TOPOLOGY, MATH 141, PRACTICE PROBLEMS Problem 1. Give an example of a non-metrizable topological space. Explain. Problem 2. Introduce a topology on N by declaring that open sets are, N,
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27
CS 70 Discrete Mathematics for CS Spring 007 Luca Trevisan Lecture 7 Infinity and Countability Consider a function f that maps elements of a set A (called the domain of f ) to elements of set B (called
More informationMATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005
MATH 23b, SPRING 2005 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Midterm (part 1) Solutions March 21, 2005 1. True or False (22 points, 2 each) T or F Every set in R n is either open or closed
More information1.2 Functions What is a Function? 1.2. FUNCTIONS 11
1.2. FUNCTIONS 11 1.2 Functions 1.2.1 What is a Function? In this section, we only consider functions of one variable. Loosely speaking, a function is a special relation which exists between two variables.
More informationTopology Math Conrad Plaut
Topology Math 467 2010 Conrad Plaut Contents Chapter 1. Background 1 1. Set Theory 1 2. Finite and Infinite Sets 3 3. Indexed Collections of Sets 4 Chapter 2. Topology of R and Beyond 7 1. The Topology
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationAN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES
AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov
More informationMath 341 Summer 2016 Midterm Exam 2 Solutions. 1. Complete the definitions of the following words or phrases:
Math 34 Summer 06 Midterm Exam Solutions. Complete the definitions of the following words or phrases: (a) A sequence (a n ) is called a Cauchy sequence if and only if for every ɛ > 0, there exists and
More informationQuick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1
Quick Tour of the Topology of R Steven Hurder, Dave Marker, & John Wood 1 1 Department of Mathematics, University of Illinois at Chicago April 17, 2003 Preface i Chapter 1. The Topology of R 1 1. Open
More informationIntroductory Analysis 2 Spring 2010 Exam 1 February 11, 2015
Introductory Analysis 2 Spring 21 Exam 1 February 11, 215 Instructions: You may use any result from Chapter 2 of Royden s textbook, or from the first four chapters of Pugh s textbook, or anything seen
More informationMATH 13 SAMPLE FINAL EXAM SOLUTIONS
MATH 13 SAMPLE FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers.
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More information1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9
1.4 Cardinality Tom Lewis Fall Term 2006 Tom Lewis () 1.4 Cardinality Fall Term 2006 1 / 9 Outline 1 Functions 2 Cardinality 3 Cantor s theorem Tom Lewis () 1.4 Cardinality Fall Term 2006 2 / 9 Functions
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationMATH 13 FINAL EXAM SOLUTIONS
MATH 13 FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers. T F
More informationSolve EACH of the exercises 1-3
Topology Ph.D. Entrance Exam, August 2011 Write a solution of each exercise on a separate page. Solve EACH of the exercises 1-3 Ex. 1. Let X and Y be Hausdorff topological spaces and let f: X Y be continuous.
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 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 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 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 informationDefinition 1.2. Let p R n be a point and v R n be a non-zero vector. The line through p in direction v is the set
Important definitions and results 1. Algebra and geometry of vectors Definition 1.1. A linear combination of vectors v 1,..., v k R n is a vector of the form c 1 v 1 + + c k v k where c 1,..., c k R are
More informationDifferential Topology Solution Set #2
Differential Topology Solution Set #2 Select Solutions 1. Show that X compact implies that any smooth map f : X Y is proper. Recall that a space is called compact if, for every cover {U } by open sets
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
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 informationMetric spaces and metrizability
1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively
More informationTopology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski
Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology
More informationProblem 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 informationMath 3T03 - Topology
Math 3T03 - Topology Sang Woo Park April 5, 2018 Contents 1 Introduction to topology 2 1.1 What is topology?.......................... 2 1.2 Set theory............................... 3 2 Functions 4 3
More informationLecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationRED. Fall 2016 Student Submitted Sample Questions
RED Fall 2016 Student Submitted Sample Questions Name: Last Update: November 22, 2016 The questions are divided into three sections: True-false, Multiple Choice, and Written Answer. I will add questions
More informationSets and Functions. MATH 464/506, Real Analysis. J. Robert Buchanan. Summer Department of Mathematics. J. Robert Buchanan Sets and Functions
Sets and Functions MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Notation x A means that element x is a member of set A. x / A means that x is not a member of A.
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationMATH NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS
MATH. 4433. NEW HOMEWORK AND SOLUTIONS TO PREVIOUS HOMEWORKS AND EXAMS TOMASZ PRZEBINDA. Final project, due 0:00 am, /0/208 via e-mail.. State the Fundamental Theorem of Algebra. Recall that a subset K
More informationIowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.
More informationIntroduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION
Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from
More informationMath 291-2: Final Exam Solutions Northwestern University, Winter 2016
Math 29-2: Final Exam Solutions Northwestern University, Winter 206 Determine whether each of the following statements is true or false f it is true, explain why; if it is false, give a counterexample
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationMATH 201 Solutions: TEST 3-A (in class)
MATH 201 Solutions: TEST 3-A (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 informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
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 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 informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationMA 1124 Solutions 14 th May 2012
MA 1124 Solutions 14 th May 2012 1 (a) Use True/False Tables to prove (i) P = Q Q = P The definition of P = Q is given by P Q P = Q T T T T F F F T T F F T So Q P Q = P F F T T F F F T T T T T Since the
More informationTopology Final Exam. Instructor: W. D. Gillam Date: January 15, 2014
Topology Final Exam Instructor: W. D. Gillam Date: January 15, 2014 Instructions: Print your name and Topology Final Exam in the upper right corner of the first page. Also be sure to put your name in the
More informationMeasures. Chapter Some prerequisites. 1.2 Introduction
Lecture notes Course Analysis for PhD students Uppsala University, Spring 2018 Rostyslav Kozhan Chapter 1 Measures 1.1 Some prerequisites I will follow closely the textbook Real analysis: Modern Techniques
More informationP-adic Functions - Part 1
P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant
More informationProblems: Section 13-1, 3, 4, 5, 6; Section 16-1, 5, 8, 9;
Math 553 - Topology Todd Riggs Assignment 1 Sept 10, 2014 Problems: Section 13-1, 3, 4, 5, 6; Section 16-1, 5, 8, 9; 13.1) Let X be a topological space and let A be a subset of X. Suppose that for each
More informationName (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets)
MTH299 - Homework 1 Question 1. exercise 1.10 (compute the cardinality of a handful of finite sets) Solution. Write your answer here. Question 2. exercise 1.20 (compute the union of two sets) Question
More informationPart A. Metric and Topological Spaces
Part A Metric and Topological Spaces 1 Lecture A1 Introduction to the Course This course is an introduction to the basic ideas of topology and metric space theory for first-year graduate students. Topology
More informationCARDINALITY OF THE SET OF REAL FUNCTIONS WITH A GIVEN CONTINUITY SET
CARDINALITY OF THE SET OF REAL FUNCTIONS WITH A GIVEN CONTINUITY SET JIAMING CHEN AND SAM SMITH Abstract. Expanding on an old result of W. H. Young, we determine the cardinality of the set of functions
More informationMath General Topology Fall 2012 Homework 6 Solutions
Math 535 - General Topology Fall 202 Homework 6 Solutions Problem. Let F be the field R or C of real or complex numbers. Let n and denote by F[x, x 2,..., x n ] the set of all polynomials in n variables
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
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 informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
More informationMath 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 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 informationDifferential Topology Final Exam With Solutions
Differential Topology Final Exam With Solutions Instructor: W. D. Gillam Date: Friday, May 20, 2016, 13:00 (1) Let X be a subset of R n, Y a subset of R m. Give the definitions of... (a) smooth function
More informationHomework for MATH 4603 (Advanced Calculus I) Fall Homework 13: Due on Tuesday 15 December. Homework 12: Due on Tuesday 8 December
Homework for MATH 4603 (Advanced Calculus I) Fall 2015 Homework 13: Due on Tuesday 15 December 49. Let D R, f : D R and S D. Let a S (acc S). Assume that f is differentiable at a. Let g := f S. Show that
More informationCourse Summary Math 211
Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationAnalysis Comprehensive Exam Questions Fall F(x) = 1 x. f(t)dt. t 1 2. tf 2 (t)dt. and g(t, x) = 2 t. 2 t
Analysis Comprehensive Exam Questions Fall 2. Let f L 2 (, ) be given. (a) Prove that ( x 2 f(t) dt) 2 x x t f(t) 2 dt. (b) Given part (a), prove that F L 2 (, ) 2 f L 2 (, ), where F(x) = x (a) Using
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 informationAnalysis III Theorems, Propositions & Lemmas... Oh My!
Analysis III Theorems, Propositions & Lemmas... Oh My! Rob Gibson October 25, 2010 Proposition 1. If x = (x 1, x 2,...), y = (y 1, y 2,...), then is a distance. ( d(x, y) = x k y k p Proposition 2. In
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 informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationUMASS AMHERST MATH 300 SP 05, F. HAJIR HOMEWORK 8: (EQUIVALENCE) RELATIONS AND PARTITIONS
UMASS AMHERST MATH 300 SP 05, F. HAJIR HOMEWORK 8: (EQUIVALENCE) RELATIONS AND PARTITIONS 1. Relations Recall the concept of a function f from a source set X to a target set Y. It is a rule for mapping
More informationvan Rooij, Schikhof: A Second Course on Real Functions
vanrooijschikhof.tex April 25, 2018 van Rooij, Schikhof: A Second Course on Real Functions Notes from [vrs]. Introduction A monotone function is Riemann integrable. A continuous function is Riemann integrable.
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
More informationMath General Topology Fall 2012 Homework 1 Solutions
Math 535 - General Topology Fall 2012 Homework 1 Solutions Definition. Let V be a (real or complex) vector space. A norm on V is a function : V R satisfying: 1. Positivity: x 0 for all x V and moreover
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
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 informationFunctional Analysis Exercise Class
Functional Analysis Exercise Class Week 2 November 6 November Deadline to hand in the homeworks: your exercise class on week 9 November 13 November Exercises (1) Let X be the following space of piecewise
More informationIn 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 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 information