g 2 (x) (1/3)M 1 = (1/3)(2/3)M.
|
|
- Elvin Pearson
- 5 years ago
- Views:
Transcription
1 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 closed and bounded. This is true very generally (metric spaces, for instance.) But closed bounded sets are sequentially compact only in finite dimensions. If F : C R n is continuous (where C is compact: closed and bounded), then f(c) is compact in R n. As a corollary, continuous functions on compact sets are bounded, and achieve their max and min values. Another corollary is that a continuous map on a compact set K R n is closed: maps closed subsets of K to closed subsets of R n. In particular, a bijective continuous map f : K f(k) R m is automatically a homeomorphism. The same is not true for preimages: we say a continuous map f : R n R m is proper if f 1 (C) is compact, whenever C R m is compact. This is equivalent to: f(x n ), for any sequence x n. A continuous map F : C R m defined in a compact subset C R n is uniformly continuous on C. This is easily proved by contradiction, using sequential compactness. A decreasing sequence K n K n+1 of non-empty compact sets (in R n ) has non-empty intersection (Cantor s theorem). This follows from sequential compactness: take x n K n and consider a convergent subsequence. Application. A monotone sequence f n : K R of continuous functions on a compact set (f n f n+1 on K, say) which converges pointwise to f : K R, converges uniformly to f, provided f is continuous. (Dini s theorem.) For the proof, given ɛ > 0, consider K n = {x K; f n (x) f(x) ɛ}. Since the sequence (f n ) is monotone, this is a decreasing sequence of compact sets (K n K n+1 ), yet their intersection is empty (by pointwise convergence). Thus one of the K n is empty, which is uniform convergence. Heine-Borel theorem. A set A R n is compact if, and only if, any open cover {U λ } λ Λ of C admits a finite subcovering. Proof. Let A R n satisfy this condition. Considering the cover {B 1 (x)} x A of A (by open balls of radius one) shows A is bounded. If A is not closed, let (x n ) be a sequence in A, converging to a point x 0 not in 1
2 A. Then the open sets B 1/n (x 0 ) c (complements of the closed balls at x 0 with radius 1/n) cover A. Extracting a finite subcover, we find N so that x x 0 > 1/N for all x A, contradiction. Conversely, assume A is closed and bounded, and let (U λ ) λ Λ be an open covering of A. By Lindelöf s theorem (see below) we find a countable open subcovering (U λi ) i 1 of A. Let K n = A (U λ1... U λn ) c. Then (K n ) is a decreasing sequence of compact sets, with empty intersection. By Cantor s theorem, some K N must be empty. Then (U λn ) N n=1 is a finite subcovering of A. Lindelöf s theorem. Let A R n. Any open covering of A admits a countable subcovering. Proof. Let (U λ ) λ Λ be an open covering of A. Let E = (x i ) i 1 a countable dense subset of A. Consider the countable set B of open balls B ri (x i ) with center at a point x i E, rational radius r i > 0, and contained in some U λ. We claim the sets (B ri (x i )) i 1 in the collection B cover A. Let x A. Then x U λ for some λ, and since U λ is open we may find r > 0 so that B 2r (x) U λ. Since E is dense in A, we find x i E and a rational r i > 0 so that r i < r and x x i < r i, and it is easy to see that B ri (x i ) B 2r (x) U λ, so B ri (x i ) occurs in B and x B ri (x i ). Now take an enumeration (B i ) i N of B and for each i 1 choose λ i with B i U λi to conclude. Application. f : A R n is locally Lipschitz if for each x A we may find an open ball B rx (x), so that f is Lipschitz in this ball (with some Lipschitz constant M x ): y, z B rx (x) f(y) f(z) M x y z. Exercise. If f : I R is differentiable on the interval I R, with f continuous on I, then f is locally Lipshitz on I. (This follows from the Mean Value Theorem.) Proposition. If K R n is compact and f : K R m is locally Lipschitz on K, then f is Lipschitz on K. The proof of this fact requires the notion of Lebesgue number of a pair A, U, where U = {U λ } λ Λ is an open covering of a subset A R n : a positive number > 0 so that any x, y A with x y < are contained in a single set U λ of the cover. Not every open cover of a set has a Lebesgue number: for instance the cover U 1 = (, 0), U 2 = (0, ) of A = R \ {0} doesn t have one (prove it.) 2
3 Prop. Every open cover of a compact set A R n has a Lebesgue number. (Otherwise we may find sequences (x k ), (y k ) with x k y k 1/k, but no single U λ contains both x k and y k (for any k); taking subsequential limits leads to a contradiction.) Given this fact, the proof that locally Lipschitz implies Lipschitz on each compact set follows easily. EXTENSION of continuous functions. Exercise: Let A, B R n be closed and disjoint. Define f : R n [0, 1] via: d(x, A) f(x) = d(x, A) + d(x, B). Then f is continuous, takes the value 0 exactly on A, and the value 1 exactly on B. (In Topology a function with these properties would be called a strict Urysohn function for the pair A, B.) Tietze s extension theorem for R n : Let f : A R be continuous and bounded, where A R n is closed: f(x) M in A. Then there exists a continuous extension f : R n R of f, with f M on R n. Proof Consider the sets: B = {x A; f(x) M/3}; C = {x A; f(x) M/3}, both closed in R n and disjoint. Assume first they are both non-empty. Let g 1 : R n [ M/3, M/3] be equal to M/3 in B, and to M/3 in C (Urysohn s lemma.) Then f(x) g 1 (x) 2M/3 on A. (If either B or C is empty, we may find a constant g 1 so that this inequality holds in A.) Let f 1 = f g 1. Repeating the argument with f 1 replacing f and M 1 = 2M/3 replacing M, we find g 2 : R n [ M 1 /3, M 1 /3] continuous, satisfying on A: f(x) (g 1 (x) + g 2 (x)) (2/3) 2 M, g 2 (x) (1/3)M 1 = (1/3)(2/3)M. Inductively we find a sequence g n (x) C b (R n ) satisfying on A: f(x) n g i (x) (2/3) n M, g n (x) (1/3)(2/3) n 1 M( in R n ). i=1 Thus f(x) = i=1 g i(x) converges to f pointwise in A. By the Weierstrass M-test and the second inequality, convergence is uniform in A, and we have 3
4 in R n : f(x) (M/3) i 1(2/3) i 1 = M. Remark: It is easy to see the theorem fails if we don t assume A is closed, even if f is bounded on A (example?) On the other hand, the result does extend to the case the function is unbounded (if A is closed). Proposition. Let A R n be closed, f : A R continuous. Then f admits a continuous extension f : R n R. Proof. Since R is homeomorphic to ( 1, 1), we may assume f takes values in ( 1, 1) (for example, consider f φ 1, where φ(x) = tan( 2x π ) is a homeomorphism from ( 1, 1) to R.) We know there is continuous extension g : R n [ 1, 1], g = f on A. Consider the closed set: B = g 1 ({ 1, 1}), and let h : R n [0, 1] (continuous) be a Urysohn function: h 1 on A, h 0 on B. Consider the continuous function f : R n [ 1, 1]: f(x) = h(x)g(x). Note f = f on A. On the other hand, f = ±1 at a point only if h = 1 and g = ±1 at that point; this never happens, since h = 0 at the points where g = ±1. Hence in fact f takes values in the open interval ( 1, 1), and extends f continuously to all of R n. Corollary. If A R n is any non-empty set and f : A R is uniformly continuous, then f admits a continuous extension to all of R n. (Exercise.) CONVEX FUNCTIONS Let K R n be a convex set. A function f : K R is convex if: x, y K, t [0, 1] : f(tx + (1 t)y) tf(x) + (1 t)f(y). (Strictly convex if the inequality is strict for t (0, 1).) The epigraph of f is the subset of R n+1 : E f = {(x, y) K R; y f(x)}. Exercise: (i) For any subset K R n and any function f : K R, E f is closed in R n+1 if and only if f is lower semicontinuous on K. This means: ( x 0 K)f(x 0 ) lim inf n f(x n ) if x n x 0, x n K. (ii) f is convex on K if and only if E f is a convex subset of R n+1. 4
5 Given c R, the sublevel set K c of f defined by c is: K c = {x K; f(x) c}. Exercise. (i) In general (K not nec. convex) K c is closed (or empty) for each c R if, and only if, f is lower semicontinuous. (ii) If K is convex and f is convex on K, each nonempty sub level set of f is convex. The converse is not true: for instance, if f : R R is an increasing function, each sublevel set is either empty, a half-infinite interval or the whole line (hence convex); but f itself need not be convex (say, f(x) = x 3.) Exercise. Three-slopes lemma for convex functions on the real line. m f (a, b) = f(b) f(a) b a. a < b < c m f (a, b) m f (a, c) m f (b, c). Exercise. Convex functions defined on an open interval are continuous (but this is false on other types of intervals.) Hint: Let x 0 I (open interval) and choose > 0 so that [x 0, x 0 +] I. Let M = max{f(x 0 ), f(x 0 + )}. Assume first x 0 < x < x 0 + and write: x = (1 t)x 0 + tx, x 0 = t x + t 1 + t (x 0 ), where t = x x 0. Then, by convexity: f(x) (1 t)f(x 0 ) + tf(x 0 + ), f(x 0 ) t f(x) + t 1 + t f(x 0 ). These inequalities lead respectively to: f(x) f(x 0 ) x x 0 (M f(x 0 )), x x 0 (f(x 0 ) M) f(x) f(x 0 ), and we introduce absolute values to combine them into one estimate: f(x) f(x 0 ) x x 0 M f(x 0 ). This clearly implies continuity at x 0. The case x 0 < x < x 0 is analogous. Exercise. If K R n is convex open, and f : K R is convex, then f is continuous on K. 5
6 Hint: Given x 0 K, choose > 0 so that the closed n-cube Q = Q (x 0 ) of side length 2 and center x 0 is contained in K (using the fact K is open). Let M be the maximum value of f on the finite set V of vertices of Q. Since Q is the convex hull of V, the sublevel set K M is convex and V K M, it follows that Q K M, or f(x) M for x Q. The closed ball B = {x; x x 0 } is contained in Q. For u on the unit sphere, consider the closed line segment in B: σ u = {x B; x = x 0 + tu; t }. Applying the one-dimensional estimate to this segment we find, for x σ u : f(x) f(x 0 ) x x 0 M f(x 0 ). Therefore this holds for all x B, implying continuity at x 0. (Reference: [Fleming], p.110.) Convexity and differentiability in one dimension. We consider f : I R convex, where I R is an open interval. For h > 0, denote by m f (x, x + h) = f(x+h) f(x) h the slope of the (oriented) secant to the graph of f from x to x + h. The three-slopes lemma implies this is monotone increasing in h; thus its limit as h 0 + exists, the right-derivative of f at x: f +(x) = lim h 0 + m f (x, x + h) = inf h>0 m f (x, x + h). Similarly, the left-derivative exists for each x I: f (x) = lim m f (x k, x) = sup m f (x k, x). k 0 + And since m f (x k, x) m f (x, x + h) for each h, k > 0, it follows that f (x) f +(x), for each x I. Also, if x < y are points in I and h > 0, k > 0 are chosen so that x + h = y k, we have: k>0 f (x) f +(x) m f (x, x + h) m f (y k, y) f (y) f +(y). 6
7 We see that f, f + are both monotone increasing (nondecreasing) in I, with f +(x) f (y) if x < y. And now it is easy to see that, if a I is a point of continuity of f, then f (a) = f +(a): f (a) f +(a) lim y a + f (y) = f (a). Thus f is differentiable at a. Being monotone, f is continuous at all but a countable set of points in I. We conclude: f convex in I R f differentiable in the complement of a countable set D I. 7
MAT 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 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 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 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 information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
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 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 informationMAT 544 Problem Set 2 Solutions
MAT 544 Problem Set 2 Solutions Problems. Problem 1 A metric space is separable if it contains a dense subset which is finite or countably infinite. Prove that every totally bounded metric space X is separable.
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 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 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 informationContinuity of convex functions in normed spaces
Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
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 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 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 informationx 0 + f(x), exist as extended real numbers. Show that f is upper semicontinuous This shows ( ɛ, ɛ) B α. Thus
Homework 3 Solutions, Real Analysis I, Fall, 2010. (9) Let f : (, ) [, ] be a function whose restriction to (, 0) (0, ) is continuous. Assume the one-sided limits p = lim x 0 f(x), q = lim x 0 + f(x) exist
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationReal Analysis Chapter 4 Solutions Jonathan Conder
2. Let x, y X and suppose that x y. Then {x} c is open in the cofinite topology and contains y but not x. The cofinite topology on X is therefore T 1. Since X is infinite it contains two distinct points
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
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 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 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 informationREAL AND COMPLEX ANALYSIS
REAL AND COMPLE ANALYSIS Third Edition Walter Rudin Professor of Mathematics University of Wisconsin, Madison Version 1.1 No rights reserved. Any part of this work can be reproduced or transmitted in any
More informationPart III. 10 Topological Space Basics. Topological Spaces
Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.
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 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 informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationAxioms of separation
Axioms of separation These notes discuss the same topic as Sections 31, 32, 33, 34, 35, and also 7, 10 of Munkres book. Some notions (hereditarily normal, perfectly normal, collectionwise normal, monotonically
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 informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
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 information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationMTG 5316/4302 FALL 2018 REVIEW FINAL
MTG 5316/4302 FALL 2018 REVIEW FINAL JAMES KEESLING Problem 1. Define open set in a metric space X. Define what it means for a set A X to be connected in a metric space X. Problem 2. Show that if a set
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationConvexity in R n. The following lemma will be needed in a while. Lemma 1 Let x E, u R n. If τ I(x, u), τ 0, define. f(x + τu) f(x). τ.
Convexity in R n Let E be a convex subset of R n. A function f : E (, ] is convex iff f(tx + (1 t)y) (1 t)f(x) + tf(y) x, y E, t [0, 1]. A similar definition holds in any vector space. A topology is needed
More informationconverges as well if x < 1. 1 x n x n 1 1 = 2 a nx n
Solve the following 6 problems. 1. Prove that if series n=1 a nx n converges for all x such that x < 1, then the series n=1 a n xn 1 x converges as well if x < 1. n For x < 1, x n 0 as n, so there exists
More informationU e = E (U\E) e E e + U\E e. (1.6)
12 1 Lebesgue Measure 1.2 Lebesgue Measure In Section 1.1 we defined the exterior Lebesgue measure of every subset of R d. Unfortunately, a major disadvantage of exterior measure is that it does not satisfy
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Supplement A: Mathematical background A.1 Extended real numbers The extended real number
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 information1. Let A R be a nonempty set that is bounded from above, and let a be the least upper bound of A. Show that there exists a sequence {a n } n N
Applied Analysis prelim July 15, 216, with solutions Solve 4 of the problems 1-5 and 2 of the problems 6-8. We will only grade the first 4 problems attempted from1-5 and the first 2 attempted from problems
More 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 informationBased on the Appendix to B. Hasselblatt and A. Katok, A First Course in Dynamics, Cambridge University press,
NOTE ON ABSTRACT RIEMANN INTEGRAL Based on the Appendix to B. Hasselblatt and A. Katok, A First Course in Dynamics, Cambridge University press, 2003. a. Definitions. 1. Metric spaces DEFINITION 1.1. If
More informationMA651 Topology. Lecture 10. Metric Spaces.
MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky
More informationSummer Jump-Start Program for Analysis, 2012 Song-Ying Li
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture 6: Uniformly continuity and sequence of functions 1.1 Uniform Continuity Definition 1.1 Let (X, d 1 ) and (Y, d ) are metric spaces and
More informationReal Analysis. Jesse Peterson
Real Analysis Jesse Peterson February 1, 2017 2 Contents 1 Preliminaries 7 1.1 Sets.................................. 7 1.1.1 Countability......................... 8 1.1.2 Transfinite induction.....................
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 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 informationSolutions to Tutorial 8 (Week 9)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 8 (Week 9) MATH3961: Metric Spaces (Advanced) Semester 1, 2018 Web Page: http://www.maths.usyd.edu.au/u/ug/sm/math3961/
More informationOptimization and Optimal Control in Banach Spaces
Optimization and Optimal Control in Banach Spaces Bernhard Schmitzer October 19, 2017 1 Convex non-smooth optimization with proximal operators Remark 1.1 (Motivation). Convex optimization: easier to solve,
More informationTHEOREMS, ETC., FOR MATH 515
THEOREMS, ETC., FOR MATH 515 Proposition 1 (=comment on page 17). If A is an algebra, then any finite union or finite intersection of sets in A is also in A. Proposition 2 (=Proposition 1.1). For every
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 informationOptimality Conditions for Nonsmooth Convex Optimization
Optimality Conditions for Nonsmooth Convex Optimization Sangkyun Lee Oct 22, 2014 Let us consider a convex function f : R n R, where R is the extended real field, R := R {, + }, which is proper (f never
More information4. (alternate topological criterion) For each closed set V Y, its preimage f 1 (V ) is closed in X.
Chapter 2 Functions 2.1 Continuous functions Definition 2.1. Let (X, d X ) and (Y,d Y ) be metric spaces. A function f : X! Y is continuous at x 2 X if for each " > 0 there exists >0 with the property
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 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 informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
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 informationChapter 3 Continuous Functions
Continuity is a very important concept in analysis. The tool that we shall use to study continuity will be sequences. There are important results concerning the subsets of the real numbers and the continuity
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
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 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 informationBootcamp. Christoph Thiele. Summer As in the case of separability we have the following two observations: Lemma 1 Finite sets are compact.
Bootcamp Christoph Thiele Summer 212.1 Compactness Definition 1 A metric space is called compact, if every cover of the space has a finite subcover. As in the case of separability we have the following
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 informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationMATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES
MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES PETE L. CLARK 4. Metric Spaces (no more lulz) Directions: This week, please solve any seven problems. Next week, please solve seven more. Starred parts of
More informationTHEOREMS, ETC., FOR MATH 516
THEOREMS, ETC., FOR MATH 516 Results labeled Theorem Ea.b.c (or Proposition Ea.b.c, etc.) refer to Theorem c from section a.b of Evans book (Partial Differential Equations). Proposition 1 (=Proposition
More information(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε
1. Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
More informationMost Continuous Functions are Nowhere Differentiable
Most Continuous Functions are Nowhere Differentiable Spring 2004 The Space of Continuous Functions Let K = [0, 1] and let C(K) be the set of all continuous functions f : K R. Definition 1 For f C(K) we
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 informationMath 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M
Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem
More informationContents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.
Minimization Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping. 1 Minimization A Topological Result. Let S be a topological
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 informationMAT1000 ASSIGNMENT 1. a k 3 k. x =
MAT1000 ASSIGNMENT 1 VITALY KUZNETSOV Question 1 (Exercise 2 on page 37). Tne Cantor set C can also be described in terms of ternary expansions. (a) Every number in [0, 1] has a ternary expansion x = a
More informationWe 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 informationMETRIC SPACES. Contents
METRIC SPACES PETE L. CLARK Contents 1. Metric Geometry A metric on a set X is a function d : X X [0, ) satisfying: (M1) d(x, y) = 0 x = y. (M2) For all x, y X, d(x, y) = d(y, x). (M3) (Triangle Inequality)
More informationMT804 Analysis Homework II
MT804 Analysis Homework II Eudoxus October 6, 2008 p. 135 4.5.1, 4.5.2 p. 136 4.5.3 part a only) p. 140 4.6.1 Exercise 4.5.1 Use the Intermediate Value Theorem to prove that every polynomial of with real
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 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 informationII - REAL ANALYSIS. This property gives us a way to extend the notion of content to finite unions of rectangles: we define
1 Measures 1.1 Jordan content in R N II - REAL ANALYSIS Let I be an interval in R. Then its 1-content is defined as c 1 (I) := b a if I is bounded with endpoints a, b. If I is unbounded, we define c 1
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 informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
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 informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationSemicontinuous functions and convexity
Semicontinuous functions and convexity Jordan Bell jordan.bell@gmail.com Department of Mathematics, University of Toronto April 3, 2014 1 Lattices If (A, ) is a partially ordered set and S is a subset
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 information01. Review of metric spaces and point-set topology. 1. Euclidean spaces
(October 3, 017) 01. Review of metric spaces and point-set topology Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 017-18/01
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 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 informationHomework 1 Real Analysis
Homework 1 Real Analysis Joshua Ruiter March 23, 2018 Note on notation: When I use the symbol, it does not imply that the subset is proper. In writing A X, I mean only that a A = a X, leaving open the
More informationProblem Set 5. 2 n k. Then a nk (x) = 1+( 1)k
Problem Set 5 1. (Folland 2.43) For x [, 1), let 1 a n (x)2 n (a n (x) = or 1) be the base-2 expansion of x. (If x is a dyadic rational, choose the expansion such that a n (x) = for large n.) Then the
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 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 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 informationREAL ANALYSIS I HOMEWORK 4
REAL ANALYSIS I HOMEWORK 4 CİHAN BAHRAN The questions are from Stein and Shakarchi s text, Chapter 2.. Given a collection of sets E, E 2,..., E n, construct another collection E, E 2,..., E N, with N =
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 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 informationIntroduction to Functional Analysis
Introduction to Functional Analysis Carnegie Mellon University, 21-640, Spring 2014 Acknowledgements These notes are based on the lecture course given by Irene Fonseca but may differ from the exact lecture
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More information