Assignment 3. Section 10.3: 6, 7ab, 8, 9, : 2, 3
|
|
- MargaretMargaret Montgomery
- 5 years ago
- Views:
Transcription
1 Andrew van Herick Math 710 Dr. Alex Schuster Sept. 21, 2005 Assignment 3 Section 10.3: 6, 7ab, 8, 9, : 2, Prove (3) : Let E X: Then x =2 E if and only if B r (x) \ E c 6= ; for all all r > 0: Proof. We ll show the forward implication by contradiction. Let x 2 (E ) c ; and suppose that B r (x) \ E c = ; for some r > 0: Note that B r (x) is non-empty as it always contains x as a member. It is not di cult to see that if y 2 B r (x) then y 2 E (otherwise y 2 E c, i.e. B r (x) \ E c 6= ;). This means B r (x) E: As B r (x) is open, by Theorem 10.34(ii) (p. 303, Wade) B r (x) E which implies that x 2 E ; a contradiction. This establishes that if x =2 E ; then B r (x) \ E c 6= ; for all all r > 0: We ll prove the reverse implication by contraposition. Suppose x 2 E : Because E is an open set in X there exists r > 0 such that B r (x) E : In particular B r (x) E, meaning that B r (x) \ E c = ;: This establishes that x 2 E implies 9r > 0 such that B r (x) \ E c = ;: By contraposition if B r (x) \ E c 6= ; for all all r > 0; then x =2 E :
2 2
3 Andrew van Herick Show that Theorem is the best possible in the following sense. (a) There exist set A; B in R such that (A [ B) 6= A [ B : (b) There exist set A; B in R such that (A \ B) 6= A \ B: Proof. (a) Choose A = [ 1; 0] and B = [0; 1] : Then (A [ B) = [ 1; 1] = ( 1; 1) 6= ( 1; 1) n f0g = ( 1; 0) [ (0; 1) = A [ B : Proof. (b) Choose A = ( 1; 0) and B = (0; 1) : Then (A \ B) = ; = ; 6= f0g = [ 1; 0] \ [0; 1] = A \ B:
4 4
5 Andrew van Herick Let Y be a subspace of X: (a) Show that a set V is open in Y if and only if there is an open set U in X such that V = U \ Y: (b) Show that a set E is closed in Y if and only if there is a closed set A in X such that E = A \ Y: Let Br Y (a) := fy 2 Y : (y; a) < rg : Proof. (a) Suppose that V is open in Y: De ne S := (r; v) 2 R + V : Br Y (v) V Choose U = S (r;v)2s B r (v) : By Theorem 3.31(i) (p. 301, Wade), U is open in X: Now we ll show that V = U \ Y: Let x 2 V. By assumption V Y; so x 2 Y: By the fact that V is open in Y; there exists r 1 > 0 such that Br Y 1 (x) V; meaning (r 1 ; x) 2 S. This means B r1 (x) U; so we have x 2 U: Hence x 2 U \ Y; which means that V U \ Y: To show the reverse containment let y 2 U \ Y: Then y 2 U, so y 2 B r2 (v 2 ) for some (r 2 ; v 2 ) 2 S: As y 2 Y; this means y 2 Br Y 2 (v 2 ) : But Br Y 2 (v 2 ) V; so y 2 V: Hence U \ Y V: This establishes the existence of an open set U in X such that V = U \ Y: Conversely suppose that there is an open set U in X such that V = U \ Y: It is easy to see that V Y: Let a 2 V: Using the fact that a 2 U; an open set in X, choose r > 0 such that B r (a) U: Let y 2 Br Y (a) : By de nition (y; a) < r; so y 2 B r (a) : In particular this means y 2 U and y 2 Y; so y 2 V: Hence, Br Y (a) V: This establishes that for all a 2 V there exists r > 0 such that Br Y (a) V: By de nition V is open in Y: Proof. (b) Suppose that E is closed in Y: This means that E c is open in Y: De ne T := (r; v) 2 R + Y \ E c : Br Y (v) E c Choose A = T (r;v)2t (B r (v)) c : Note that B r (v) c is closed for all (r; v) 2 T: By Theorem 3.31(iii) (p. 301, Wade), A is closed in X: Now we ll show that E = A\Y: Let x 2 E: By de nition x 2 Y: We ll show that x 2 A by contradiction. Suppose x 2 A c : By de Morgan s Laws for sets A c = S (r;v)2a B r (v) : By
6 6 similar logic to part (a) ; we can conclude that x 2 Br Y 3 (v 3 ) for some (r 3 ; v 3 ) 2 T: However Br Y 3 (v 3 ) E c ; meaning that x 2 E c : This contradicts our initial assumption that x 2 E: Hence x must belong to A: This means x 2 A \ Y and establishes that E A \ Y: Now we ll show the reverse containment, again by contradiction. Assume y 2 A \ Y and y 2 E c : Because E c is open in Y and y 2 Y; E c there exists r 4 > 0 such that Br Y 4 (y) E c, in particular (r 4 ; y) 2 T: As B r4 (y) S (r;v)2a B r (v) ; we have y 2 A c : This contradicts the assumption that y 2 A \ Y; meaning that y 2 E and establishing that A \ Y E: This proves the existence of a closed set A in X such that E = A \ Y: For the proof of the converse suppose there is a closed set A in X such that E = A \ Y: To show that E is closed in Y; we need to prove that E c \Y is open in Y: Clearly E c \Y Y: Let a 2 E c \ Y and note that E c \ Y = (A c [ Y c ) \ Y = (A c \ Y ) [ (Y \ Y c ) = A c \ Y Hence a 2 A c \Y: Using the fact that A c is open in X choose r 5 > 0 such that B r5 (a) A c : Note that Br Y 5 (a) B r5 (a) A c and that Br Y 5 (a) Y. Hence Br Y 5 (a) A c \ Y = E c \ Y: This establishes that for all a 2 E c \ Y there exists r > 0 such that Br Y (a) E c \ Y; or equivalently that E c is open in Y and E is closed in Y:
7 Andrew van Herick Let f : R! R: Prove that f is continuous on R if and only if f 1 (I) is open in R for every open interval I: Proof. Let f : R! R: ()) Suppose that f is continuous in R: Let I be an open interval in R: If f 1 (I) = ; then f 1 (I) is open in R: So lets assume that f 1 (I) 6= ;: If I is a nite open interval, then I = (u; v), u < v for some u; v 2 R: Let a 2 f 1 (I) and de ne " = min (f (a) u; v f (a)) ; then " > 0: Using the de nition of continuity choose > 0 such that jx aj < and x 2 R implies jf (x) f (a)j < " jf (y) Now we ll show that B (a) f 1 (I) : Let y 2 B (a) : Then jy f (a)j < ": This means aj < and y 2 R; so u < " + f (a) < f (y) < " + f (a) < v i.e. f (y) 2 I and y 2 f 1 (I) : This establishes that B (a) f 1 (I) : Thus for all a 2 f 1 (I) there exists > 0 such that B (a) f 1 (I) ; meaning that I is open in R. Similar reasoning establishes the same result if one of u; v is nite and the other in nite, i.e. I = ( 1; v) or I = (u; 1) : If neither u nor v are nite, then I = ( 1; 1) = R, meaning that f 1 (I) = R is open in R: This covers all cases and establishes that if f is continuous on R; then f 1 (I) is open in R for every open interval I: (() Conversely, suppose that f 1 (I) is open in R for every open interval I: Let a 2 R and " > 0: Then I " := (f (a) "; f (a) + ") is an open interval. By hypothesis f 1 (I " ) is open in R. As a 2 f 1 (I " ) ;(recall that f (a) 2 I e ) choose > 0 such that B (a) f 1 (I " ) : Assume that jx aj < and x 2 R: Then x 2 B (a) f 1 (I " ) ; so f (x) 2 I " : Hence f (a) " < f (x) < f (a) + " " < f (x) f (a) < "
8 8 This establishes that for all " > 0 there exists > 0 such that jx aj < and x 2 R implies jf (x) f (a)j < " meaning that f is continuous at a: By generalization f is continuous at every a 2 R; so f is continuous on R:
9 Andrew van Herick Let V be a subset of a metric space X: (a) Prove that V is open in X if and only if there is a collection of open balls fb : 2 Ag such that V = [ 2A B : (b) What happens to this result if "open" is replaced by "closed"? Proof. (a) Suppose that V is open in X: Let A := (r; x) 2 R + X : B r (x) V Choose a collection of open balls fb r (x) : (r; x) 2 Ag : Now we ll show that V = S (r;x)2a B r (x) : Suppose that v 2 V: Because V is open there exists > 0 such that B (v) V: By de nition (; v) 2 A; so B (v) [ B r (x) : (r;x)2a As v 2 B (v) ; v 2 S (r;x)2a B r (x) ; establishing that V S 2A B : To show the reverse containment, let u 2 S (r;x)2a B r (x) : Then u 2 B r0 (x 0 ) for some (r 0 ; x 0 ) 2 A: By the requirements for membership of (r 0 ; x 0 ) in A we have B r0 (x 0 ) V: This means that u 2 V and establishes that S (r;x)2a B r (x) V: As every open ball is open in X, the converse follows by Theorem 3.31 (p. 301, Wade). Proof. The result if false if "open" is replaced by "closed". Let X = R and V = N: Suppose by way of contradiction the result were true for this set assignment, then because N is closed in R, N = [ B 2A for some index set A 6= ; (otherwise N = S 2; B = ;). This means that there exists B 2 fb : 2 Ag : But B = B r (x) for some r > 0; and some x 2 R: Using the density of the irrationals we can choose z 2 RnQ; such that z 2 B r (x) : Then z 2 S 2A B = N; meaning that z is a rational number, a clear contradiction.
10 10
11 Andrew van Herick Let A; B be compact subsets of X: Prove that A [ B and A \ B are compact. Proof. Let V = fv g 2 be an open covering of A[B: Because A A[B V; V is also an open covering of A: As A is compact there exists a nite subset 0 of such that S 2 0 V A: Similarly there exists 1 such that S 2 1 V B: As 0; 1 are both nite set, it follows that 0 [ 1 is nite, that 0 [ 1 : To show that A [ B S 2 0 [ 1 V ; let x 2 A [ B: If x 2 A then x 2 V for some 2 0 : As 2 0 [ 1 ; V S 2 0 [ 1 V ; so x 2 S 2 0 [ 1 : Similar logic establishes the same result if x 2 B: Note that V is are open in X for all 2 ; i.e. for all 2 0 [ 1 This means that fv g 2 0 [ 1 is a nite open subcover of V, establishing every open covering of A[ B has a nite subcover. Equivalently A [ B is compact. Now we ll show that A \ B is compact. By Theorem (p. 308, Wade) both A and B are closed. By Theorem 10.31(iii) (p. 301, Wade) A \ B is closed. As A \ B A; a compact set, by Remark A \ B is compact.
12 12
13 Andrew van Herick Suppose that E R is compact and non-empty. Prove that sup E; inf E 2 E: Proof. By Theorem (p. 308, Wade) E is closed and bounded. By Theorem 2.26 (p. 47, Wade) R satis es the Bolzano-Weierstrass Property. It is easy to see that f : E! R de ned by f (x) = x is continuous on E: By Exercise (c) there exist points x M ; x m 2 E such that f (x M ) = sup f (x) and f (x m ) = inf f (x) : x2e x2e But f (x M ) = x M and f (x m ) = x m ; establishing that sup E; inf E 2 E:
Assignment 8. Section 3: 20, 24, 25, 30, Show that the sum and product of two simple functions are simple. Show that A\B = A B
Andrew van Herick Math 710 Dr. Alex Schuster Nov. 2, 2005 Assignment 8 Section 3: 20, 24, 25, 30, 31 20. Show that the sum and product of two simple functions are simple. Show that A\B = A B A[B = A +
More information1 The Well Ordering Principle, Induction, and Equivalence Relations
1 The Well Ordering Principle, Induction, and Equivalence Relations The set of natural numbers is the set N = f1; 2; 3; : : :g. (Some authors also include the number 0 in the natural numbers, but number
More informationa. 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 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 informationMetric Spaces. DEF. If (X; d) is a metric space and E is a nonempty subset, then (E; d) is also a metric space, called a subspace of X:
Metric Spaces DEF. A metric space X or (X; d) is a nonempty set X together with a function d : X X! [0; 1) such that for all x; y; and z in X : 1. d (x; y) 0 with equality i x = y 2. d (x; y) = d (y; x)
More informationMath 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012
Instructions: Answer all of the problems. Math 4317 : Real Analysis I Mid-Term Exam 1 25 September 2012 Definitions (2 points each) 1. State the definition of a metric space. A metric space (X, d) is set
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 informationEconomics 204 Fall 2012 Problem Set 3 Suggested Solutions
Economics 204 Fall 2012 Problem Set 3 Suggested Solutions 1. Give an example of each of the following (and prove that your example indeed works): (a) A complete metric space that is bounded but not compact.
More informationWeek 5 Lectures 13-15
Week 5 Lectures 13-15 Lecture 13 Definition 29 Let Y be a subset X. A subset A Y is open in Y if there exists an open set U in X such that A = U Y. It is not difficult to show that the collection of all
More information1 Selected Homework Solutions
Selected Homework Solutions Mathematics 4600 A. Bathi Kasturiarachi September 2006. Selected Solutions to HW # HW #: (.) 5, 7, 8, 0; (.2):, 2 ; (.4): ; (.5): 3 (.): #0 For each of the following subsets
More informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationMATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:
MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is
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 informationEC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries
EC 521 MATHEMATICAL METHODS FOR ECONOMICS Lecture 1: Preliminaries Murat YILMAZ Boğaziçi University In this lecture we provide some basic facts from both Linear Algebra and Real Analysis, which are going
More informationRings, Integral Domains, and Fields
Rings, Integral Domains, and Fields S. F. Ellermeyer September 26, 2006 Suppose that A is a set of objects endowed with two binary operations called addition (and denoted by + ) and multiplication (denoted
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationMATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.
MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions. Continuity Definition. Given a set E R, a function f : E R, and a point c E, the function f is continuous at c if
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 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 information1 Which sets have volume 0?
Math 540 Spring 0 Notes #0 More on integration Which sets have volume 0? The theorem at the end of the last section makes this an important question. (Measure theory would supersede it, however.) Theorem
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 informationNear convexity, metric convexity, and convexity
Near convexity, metric convexity, and convexity Fred Richman Florida Atlantic University Boca Raton, FL 33431 28 February 2005 Abstract It is shown that a subset of a uniformly convex normed space is nearly
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
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 informationLinear Algebra. Linear Algebra. Chih-Wei Yi. Dept. of Computer Science National Chiao Tung University. November 12, 2008
Linear Algebra Chih-Wei Yi Dept. of Computer Science National Chiao Tung University November, 008 Section De nition and Examples Section De nition and Examples Section De nition and Examples De nition
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More information2 Truth Tables, Equivalences and the Contrapositive
2 Truth Tables, Equivalences and the Contrapositive 12 2 Truth Tables, Equivalences and the Contrapositive 2.1 Truth Tables In a mathematical system, true and false statements are the statements of the
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
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 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 informationLecture 8: Basic convex analysis
Lecture 8: Basic convex analysis 1 Convex sets Both convex sets and functions have general importance in economic theory, not only in optimization. Given two points x; y 2 R n and 2 [0; 1]; the weighted
More informationMathematics 220 Homework 4 - Solutions. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B.
1. (4.46) Let A and B be sets. Prove that A B = A B if and only if A = B. Solution: We must prove the two statements: (1) if A = B, then A B = A B, and (2) if A B = A B, then A = B. Proof of (1): Suppose
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationFunctions. Chapter Continuous Functions
Chapter 3 Functions 3.1 Continuous Functions A function f is determined by the domain of f: dom(f) R, the set on which f is defined, and the rule specifying the value f(x) of f at each x dom(f). If f is
More informationDefinition 2.1. A metric (or distance function) defined on a non-empty set X is a function d: X X R that satisfies: For all x, y, and z in X :
MATH 337 Metric Spaces Dr. Neal, WKU Let X be a non-empty set. The elements of X shall be called points. We shall define the general means of determining the distance between two points. Throughout we
More informationExercises from other sources REAL NUMBERS 2,...,
Exercises from other sources REAL NUMBERS 1. Find the supremum and infimum of the following sets: a) {1, b) c) 12, 13, 14, }, { 1 3, 4 9, 13 27, 40 } 81,, { 2, 2 + 2, 2 + 2 + } 2,..., d) {n N : n 2 < 10},
More informationLecture Notes DRE 7007 Mathematics, PhD
Eivind Eriksen Lecture Notes DRE 7007 Mathematics, PhD August 21, 2012 BI Norwegian Business School Contents 1 Basic Notions.................................................. 1 1.1 Sets......................................................
More information1 Lecture 4: Set topology on metric spaces, 8/17/2012
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture : Set topology on metric spaces, 8/17/01 Definition 1.1. Let (X, d) be a metric space; E is a subset of X. Then: (i) x E is an interior
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 informationTopics in Mathematical Economics. Atsushi Kajii Kyoto University
Topics in Mathematical Economics Atsushi Kajii Kyoto University 25 November 2018 2 Contents 1 Preliminary Mathematics 5 1.1 Topology.................................. 5 1.2 Linear Algebra..............................
More information(4) Using results you have studied, show that if x, y are real numbers,
Solutions to Homework 4, Math 310 (1) Give a direct proof to show that if a, b are integers which are squares of integers, then ab is the square of an integer. Proof. We show that if a, b are integers
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 information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationShow Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page.
Formal Methods Midterm 1, Spring, 2007 Name Show Your Work! Point values are in square brackets. There are 35 points possible. Tables of tautologies and contradictions are on the last page. 1. Use truth
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationR N Completeness and Compactness 1
John Nachbar Washington University in St. Louis October 3, 2017 R N Completeness and Compactness 1 1 Completeness in R. As a preliminary step, I first record the following compactness-like theorem about
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More information2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α.
Chapter 2. Basic Topology. 2.3 Compact Sets. 2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α. 2.32 Definition A subset
More informationSample Problems for the Second Midterm Exam
Math 3220 1. Treibergs σιι Sample Problems for the Second Midterm Exam Name: Problems With Solutions September 28. 2007 Questions 1 10 appeared in my Fall 2000 and Fall 2001 Math 3220 exams. (1) Let E
More informationComputer Science Section 1.6
Computer Science 180 Solutions for Recommended Exercises Section 1.6. Let m and n be any two even integers (possibly the same). Then, there exist integers k and l such that m = k and n = l. Consequently,
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More informationSolutions to Homework Set 1
Solutions to Homework Set 1 1. Prove that not-q not-p implies P Q. In class we proved that A B implies not-b not-a Replacing the statement A by the statement not-q and the statement B by the statement
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 informationa + 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 informationProperties 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 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 informationContinuity. Matt Rosenzweig
Continuity Matt Rosenzweig Contents 1 Continuity 1 1.1 Rudin Chapter 4 Exercises........................................ 1 1.1.1 Exercise 1............................................. 1 1.1.2 Exercise
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationMath 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008
Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together
More informationMath 5210, Definitions and Theorems on Metric Spaces
Math 5210, Definitions and Theorems on Metric Spaces Let (X, d) be a metric space. We will use the following definitions (see Rudin, chap 2, particularly 2.18) 1. Let p X and r R, r > 0, The ball of radius
More informationMathematics 220 Midterm Practice problems from old exams Page 1 of 8
Mathematics 220 Midterm Practice problems from old exams Page 1 of 8 1. (a) Write the converse, contrapositive and negation of the following statement: For every integer n, if n is divisible by 3 then
More informationTheorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers
Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower
More informationTopics in Mathematical Economics. Atsushi Kajii Kyoto University
Topics in Mathematical Economics Atsushi Kajii Kyoto University 26 June 2018 2 Contents 1 Preliminary Mathematics 5 1.1 Topology.................................. 5 1.2 Linear Algebra..............................
More informationContradiction MATH Contradiction. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Contradiction Benjamin V.C. Collins James A. Swenson Contrapositive The contrapositive of the statement If A, then B is the statement If not B, then not A. A statement and its contrapositive
More informationLECTURE 12 UNIT ROOT, WEAK CONVERGENCE, FUNCTIONAL CLT
MARCH 29, 26 LECTURE 2 UNIT ROOT, WEAK CONVERGENCE, FUNCTIONAL CLT (Davidson (2), Chapter 4; Phillips Lectures on Unit Roots, Cointegration and Nonstationarity; White (999), Chapter 7) Unit root processes
More informationIn 1854, Karl Weierstrauss gave an example of a continuous function which was nowhere di erentiable: cos(3 n x) 2 n. sin(3 n x), 2
Why non-pictured analysis? CHAPTER 1 Preliminaries f is continuous at x if lim f(x + h) = f(x) h!0 and f(x + h) f(x) f is di erentiable at x if lim h!0 h Then but Di erentiability =) continuity, continuity
More informationMAS3706 Topology. Revision Lectures, May I do not answer enquiries as to what material will be in the exam.
MAS3706 Topology Revision Lectures, May 208 Z.A.Lykova It is essential that you read and try to understand the lecture notes from the beginning to the end. Many questions from the exam paper will be similar
More informationLimits and continuity
CHAPTER 4 Limits and continuity Our first goal is to define and understand lim f(x) =L. Here f : D R where D R. We want the definition to mean roughly, as x gets close to a then f(x) iscloseto L. Perhaps
More informationNOTES ON VECTOR-VALUED INTEGRATION MATH 581, SPRING 2017
NOTES ON VECTOR-VALUED INTEGRATION MATH 58, SPRING 207 Throughout, X will denote a Banach space. Definition 0.. Let ϕ(s) : X be a continuous function from a compact Jordan region R n to a Banach space
More informationA Glimpse into Topology
A Glimpse into Topology by Vishal Malik A project submitted to the Department of Mathematical Sciences in conformity with the requirements for Math 430 (203-4) Lakehead University Thunder Bay, Ontario,
More informationECARES Université Libre de Bruxelles MATH CAMP Basic Topology
ECARES Université Libre de Bruxelles MATH CAMP 03 Basic Topology Marjorie Gassner Contents: - Subsets, Cartesian products, de Morgan laws - Ordered sets, bounds, supremum, infimum - Functions, image, preimage,
More informationSobolevology. 1. Definitions and Notation. When α = 1 this seminorm is the same as the Lipschitz constant of the function f. 2.
Sobolevology 1. Definitions and Notation 1.1. The domain. is an open subset of R n. 1.2. Hölder seminorm. For α (, 1] the Hölder seminorm of exponent α of a function is given by f(x) f(y) [f] α = sup x
More informationCHAPTER 3 REVIEW QUESTIONS MATH 3034 Spring a 1 b 1
. Let U = { A M (R) A = and b 6 }. CHAPTER 3 REVIEW QUESTIONS MATH 334 Spring 7 a b a and b are integers and a 6 (a) Let S = { A U det A = }. List the elements of S; that is S = {... }. (b) Let T = { A
More informationMath 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.
Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations
More information1. From Lewis Carroll: extract a pair of premises and finish the conclusion.
Math 2200 2. Treibergs σιι First Midterm Exam Name: Sample January 26, 2011 Sample First Midterm Questions. Sept. 17, 2008 and Sept. 16, 2009. Some questions from Math 3210 Midterms of 1. From Lewis Carroll:
More informationContinuous Functions on Metric Spaces
Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationChapter 2. Metric Spaces. 2.1 Metric Spaces
Chapter 2 Metric Spaces ddddddddddddddddddddddddd ddddddd dd ddd A metric space is a mathematical object in which the distance between two points is meaningful. Metric spaces constitute an important class
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 informationSection 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 informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationProof. We indicate by α, β (finite or not) the end-points of I and call
C.6 Continuous functions Pag. 111 Proof of Corollary 4.25 Corollary 4.25 Let f be continuous on the interval I and suppose it admits non-zero its (finite or infinite) that are different in sign for x tending
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationHOMEWORK ASSIGNMENT 6
HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly
More information2. Metric Spaces. 2.1 Definitions etc.
2. Metric Spaces 2.1 Definitions etc. The procedure in Section for regarding R as a topological space may be generalized to many other sets in which there is some kind of distance (formally, sets with
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 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 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 informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More information1 Continuation of solutions
Math 175 Honors ODE I Spring 13 Notes 4 1 Continuation of solutions Theorem 1 in the previous notes states that a solution to y = f (t; y) (1) y () = () exists on a closed interval [ h; h] ; under certain
More informationMATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION. Problem 1
MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION ELEMENTS OF SOLUTION Problem 1 1. Let X be a Hausdorff space and K 1, K 2 disjoint compact subsets of X. Prove that there exist disjoint open sets U 1 and
More informationMA103 Introduction to Abstract Mathematics Second part, Analysis and Algebra
206/7 MA03 Introduction to Abstract Mathematics Second part, Analysis and Algebra Amol Sasane Revised by Jozef Skokan, Konrad Swanepoel, and Graham Brightwell Copyright c London School of Economics 206
More informationMath 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015
Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)
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 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 informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
More informationNonlinear Programming (NLP)
Natalia Lazzati Mathematics for Economics (Part I) Note 6: Nonlinear Programming - Unconstrained Optimization Note 6 is based on de la Fuente (2000, Ch. 7), Madden (1986, Ch. 3 and 5) and Simon and Blume
More informationA Course in Real Analysis. Saeed Zakeri
A Course in Real Analysis Saeed Zakeri Contents Chapter 1. Topology of Metric Spaces I 5 1.1. Basic definitions 5 1.2. Convergence 11 1.3. Continuity 12 1.4. Completeness 14 1.5. Compactness 17 1.6. Connectedness
More information