Math 209B Homework 1
|
|
- Elfrieda Robbins
- 7 years ago
- Views:
Transcription
1 Math 09B Homework Edward Burkard 3.5. Functions of Bounded Variation. 3. Signed Measures and Differentiation Exercise 30 Construct an increasing function on R whose set of discontinuities is Q. Let Q {q n } be an enumeration of the rationals. Define f by: fx) n χ [q n, )x) Let x, y R such that y < x and let q k be a rational between y and x, then: fx) fy) n χ [q n, )x) n χ [q n, )y) n n k > 0 n Thus f is an increasing function. Let q n be any rational number. Then given any δ > 0 we have: fq n + δ) fq n δ) n > 0 and thus f is discontinuous on Q since the limit of f as x q n is always bigger from the right. Now let j I. For any n we can find a η > 0 such that q i / j η, j + η) for i,..., n. Thus we have: fj + η) fj η) in+ i n+ i0 i n+ n+ n+ Letting n we have fj + η) fj η) 0; thus f is continuous at j. Therefore, f is continuous on I and discontinuous on Q. { x Exercise 3 Let fx) sin x ), x 0 0, x 0 and gx) { x sin x ), x 0 0, x 0. a. F and G are differentiable everywhere including x 0). b. F BV [, ]), but G / BV [, ]). a. Clearly both F and G are differentiable away from zero, so it remains to check that they are differentiable at zero. Check F : F 0 + h) F 0) h sin h lim lim 0 h sin h lim 0 h 0 this is proven using the squeeze theorem on the inequality: x x sin x ) x.) Check G: G0 + h) G0) h sin h 0 h sin lim lim h lim 0 h 0 this is proven using the squeeze theorem on the inequality: x x sin x ) x.) b. First I prove Example 3.5.c: If F is differenitable on R and F is bounded, then F BV [a, b]) for < a < b < ). Suppose that F K. Then by the mean value theorem on [a, b] we get that c [a, b] such that: F b) F a) F c)b a)
2 and thus F b) F a) Kb a). Let P {a x 0 < x < < x n b} be a partition of [a, b]. Then on each subinterval [x j, x j ] we can apply the MVT to get F x j ) F x j ) Kx j x j ). Thus we have: F x j ) F x j ) Kx j x j ) Kb a). j j T F b) T F a) sup{ n j F x j) F x j ) n N, a x 0 < x < < x n b} Kb a) <. Thus F is of bounded variation. { x sin Observe that f x) x cos x, x 0 0, x 0. Then we can see that f x) 4 on [, ]. Thus by the previous statement f BV [, ]). Now choose the partition of [, ] given by the points x i i+)π for i,..., n and including the points x 0 and x n let g) gx n ) + gx ) g0) k n ). Then: gx j+ ) gx j ) g) gx n ) + gx ) g0) + j0 n k n + gx j+ ) gx j ) j gx j+ ) gx j ) j n ) k n + )j j + )π + j )π j n ) k n + j + )π + j )π j Letting n we get a series that does not converge by comparison to the series n ). Thus g / BV [0, ]). Exercise 37 Suppose F : R C. There is a constant M such that F x) F y) M x y for all x, y R that is, F is Lipschitz continuous) iff F is absolutely continuous and F M a.e. ) Suppose that F is Lipschitz continuous. Then if a, b ),..., a n, b n ) are disjoint intervals such that b i a i < δ we get i F b i ) F a i ) i Thus given any ɛ > 0, if we choose δ < ɛ M Mb i a i ) Mδ. i we see that F is absolutely continuous. Observe: F F x + h) F x) M x + h x M h x) lim lim lim M h 0 h and thus F x) M. ) Assume that F is absolutely continuous and that F M. Also, WLOG assume x y. Then by theorem 3.35c we get: x x x F x) F y) F t) dt F t) dt M dt Mx y) and thus F is Lipschitz continuous. y y y
3 3 Exercise 40 Let F denote the Cantor function on [0, ], and set F x) 0 for x < 0 and F x) for x >. Let {[a n, b n ]} be an enumeration of the closed subintervals of [0, ] with rational endpoints, and let F n x) F x an b n a n ). Then G n F n is continuous and strictly increasing on [0, ], and G 0 a.e. Use Exercise If {F j } is a sequence of nonnegative increasing functions on [a, b] such that F x) F jx) < for all x [a, b], then F x) F j x) for a.e. x [a, b].) Let M n. Notice that Fnx) n n for all x R and n N. Since the series n n n converges, by Theorem 7.0 in Baby Rudin we have that n converges uniformly to G. Since the Cantor function is continuous, notice that each Fnx) is continuous, and thus the partials sums s n j x) : j F nx) n n unif. are continuous for all j. By the previous statement we ahve that s j G, and thus, by theorem 7. in Baby Rudin G is continuous. Since each Fnx) is a non-negative increasing function on R, and Gx) < for n all x R by exercise 39 of chapter 3 in Folland we have that G x) ) Fnx) F n n n x) n. But n F nx) 0 a.e. for all n. Thus we have that G x) 0 a.e. Exercise 4 A function F : a, b) R a < b ) is called convex if F λs + λ)t) λf s) + λ)f t) for all s, t a, b) and t 0, ). Geometrically, this says that the graph of F over the interval from s to t lies underneath the line segment joining x, F s)) to t, F t)).) a. F is convex iff for all s, t, s, t a, b) such that s s < t and s < t t, F t) F s) F t ) F s ) t s. b. F is convex iff F is absolutely continuous on every compact subinterval of a, b) and F is increasing on the set where it is defined). c. If F is convex and t 0 a, b), there exists β R such that F t) F t 0 ) βt t 0 ) for all t a, b). d. Jensen s Inequality) If X, M, µ) is a measure space with µx), g : X a, b) is in L µ), and F is convex on a, b), then ) F g dµ F g dµ. Let t 0 g dµ and t gx) in c), and integrate). [] a. ) Suppose that F is convex. Suppose we have s, t, s, t a, b) such that s s < t and s < t t. Let lx) t s [t x)f s) s x)f t )] be the line segment joining the points s, F s)) and t, F t )). Then we have that ls) F s) and lt ) F t ). Also, since F is convex, we have F x) lx) x [a, b]. Thus: F t) F s) the slope of a line is constant lt) F s) lt) ls) lt ) ls ) t s lt ) F s ) t s F t ) F s ) t s ) Assume for all s, t, s, t a, b) such that s s < t and s < t t F t) F s), t s F t ) F s ) t s. Let lt) be defined as above. Let s s and suppose there is a t [s, t ] such that F t) > lt). Then:
4 4 F t) F s) which contradicts our original assumption. F is convex. lt) F s) > lt) ls) lt ) ls) t s F t ) F s) t s F t ) F s ) t s b. ) Suppose F is convex on a, b). Let [s, t] a, b), and let M lim x s + F x) F t) lim x t x t. Then for δ sufficiently small we get F s + δ) F s) δ < M + and F t) F t δ) < M + δ Since F is convex, if a j, b j ) [s, t], with δ j b j a j, by part a), we have F s + δ j ) F s) δ j F b j) F a j ) δ j F t) F t δ j) δ j Then, if we let δ j < δ and M maxm +, M + ), we have F b j ) F a j ) maxf s + δ j ) F s), F t) F t δ j )) < Mδ j F x) F s) x s and M So if we choose intervals a j, b j ) such that b j a j δ, we have that each δ j < δ and so F bj ) F a j ) < Mδ j Mδ So F is absolutely continuous on [s, t]. Now, if a < s < s + h < t < t + h < b, by part a), we have and taking limits gives So F is increasing. F s + h) F s) h F t + h) F t) h F F s + h) F s) F t + h) F t) s) lim lim ) For the converse, let lx) be the line connecting a, F a )) and b, F b )), for a < a < b < b. Thus to show that F is convex, we only need to show that F x) lx) for x [a, b ]. If F is absolutely continuous, and F is increasing, then if there existed a t [a, b ] with F t) > lt), applying the mean value theorem twice would yield a c [a, t] and a d [t, b ] such that and F c) F t) F a ) t a > lt) la ) t a lb ) la ) b a F d) F b ) F t) b < lb ) lt) t b lb ) la ) t b a So c t d but F c) > F d) which contradicts the fact that F is increasing. So we must have that F is convex.
5 5 c. Suppose F is convex on a, b) and a < t 0 < b. Then we fix s < t 0 < t. Then by part a), if t 0 < t, we have F t 0 ) F s ) t 0 s F t) F t 0) F t0 ) F s ) ) F t) F t 0 ) t t 0 t 0 s t t 0 ) and if t < t 0, by part a) we have F t) F t 0 ) F t ) F t 0 ) t t 0 t F t) F t 0 ) t 0 ) So if we choose β min F t ) F t 0) t t 0, F t0) F s ) t 0 s then F t) F t 0 ) βt t 0 ) F t ) F t 0 ) t t 0 ) t t 0 ) for all t a, b). d. Let X, M, µ) be a measure space, with µx), g : X a, b) is in L µ), and F convex on a, b). If we let t 0 gdµ and t gx), and apply part c) we have ) F gx) F gdµ β gx) ) gdµ Since µx), we have that dµ, so integrating leaves constants unchanged. With this in mind, we integrate both sides and we get ) F gdµ F gdµ β gdµ β gdµ 0 So F ) gdµ F gdµ 4.. Topological Spaces. 4. Point Set Topology Exercise If cardx), there is a topology on X that is T 0 but not T. Let X be a set with more than elements. Let x X. Let T be the topology on X generated by the basis consisting of the empty set, the whole set, and all the one point sets except for the set x. Then T is a topology that is T 0 since given any point y X, y x, there is always an open set containing y but not x. But there is never an open set containing x but not y. Exercise 3 Every metric space is normal. If A, B are closed sets in the metric space X, ρ), consider the sets of points x where ρx, A) < ρx, B) or ρx, A) > ρx, B).) Let X, d) be a metric space. Let A and B be closed, disjoint subsets of X. Define à {x X ρx, A) < ρx, B)} and B {x X ρx, B) < ρx, A)}. Since A and B are closed, their complements are open, and thus if x A B C we have dx, B) > 0 which gives A à since if x A, dx, A) 0; similarly if x B we have dx, A) > 0, thus B B. Suppose that x B. Let ɛ dx, A) dx, B) > 0. Thus we can place the open ball B ɛ x) in B. We can 4 do this because given any y B ɛ x), by the triangle inequality: dy, B) dy, x) + dx, b), where b B. 4 Taking the infimum over all b B we arrive at: dy, B) inf dy, B) inf dy, x) + dx, b) inf dy, x) + inf dx, b) b B b B b B b B dy, x) + dx, B) < ɛ 4 + dx, B) < ɛ 4 + dx, A) ɛ dx, A). 4 Thus y B, therefore B is open. Similarly we have that à is open, and thus à and B are open sets surrounding A and B respectively. Thus X, d) is a metric space.
6 6 4.. Continuous Maps. Exercise 4 If X and Y are topological spaces, f : X Y is continuous iff fā) fa) for all A X iff f B) f B) for all B Y. Identify the properties as follows: a) f : X Y is continuous b) fā) fa) for all A X c) f B) f B) for all B Y a) b) Assume that f is continuous. Let A X. Let V be an open neighborhood of fx). Then f V ) is an open set in X containing x. Thus y A, y x such that y f V ). But then fy) V fa), and thus fx) fā). b) c) Assume b). Let B Y. Then f B) X. Thus by our assumption: ff B)) ff B)) B. Apply f to both sides and we get f B) f B) as desired. c) a) Assume c). Let C Y be a closed set. Then by c) we have f C) f C) f C). Thus f C) f C), which implies that f C) is closed in X. f is continuous. Exercise 5 If X is a topological space, A X is closed, and g CA) satisfies g 0 on A, then the extention of g to X defined by gx) 0 for x A C is continuous. { gx) if x A Denote the extention by gx) 0 if x A C. Let U gx) ga) be open. If 0 / U then g U) g U) which is clearly open. But if 0 U, g U) g U) A C. However, since A C is the complement of a closed set, it is open and thus g U) g U) A C is open. g is continuous. Exercise 6 Let X be a topological space, Y a Hausdorff space, and f, g continuous maps from X to Y. a. {x fx) gx)} is closed. b. If f g on a dense subset of X, then f g on all of X. a. Let C {x fx) gx)}. It suffices to show that C C : A is open. Let x A, then fx) gx). Since Y is T there are disjoint open neighborhoods U and V around fx) and gx) respectively. By the continuity of f and g, f U) and g V ) are open neighborhoods of x. Thus O : f U) g V ) is an open neighborhood of x on which fy) gy) y O. Thus y A and A is open. C is closed. b. Let the dense set be D. Then D C from part a). We know that D X so D C D X C C since C is closed. But then we have X C, and thus f g on all of X Compact Spaces. Exercise 43 For x [0, ), let a nx) n a n x) 0 or ) be the base- decimal expansion of x. If x is a dyadic rational, choose the expannsion such that a n x) 0 for n large.) Then the sequence a n in {0, } [0,) has no pointwise convergent subsequence. Hence {0, } [0,), with the product topology arising form the discrete topology on {0, }, is not sequentially compact. It is, however, compact, as we shall show in 4.6.) a n x) is the n th binary digit of x. Since binary decimal expansions are not always unique, choose them in a way so that they are i.e. for 0.a a...a n 0... instead choose the equivalent
7 7 0.a a...a n ). Now suppose {a n } has a convergent subsequence, say {a nj }. Choose y [0, ) so that { 0, j odd a nj y), j even Then {a nj } {0,, 0,, 0,,...}, which does not converge Locally Compact Hausdorff Spaces. Exercise 5 The one-point compactifcation of R n is homeomorphic to the n-sphere {x R n+ x }. First I will prove the following useful lemma: Lemma. A homeomorphism between locally compact Hausdorff spaces extends to a homeomorphism between their one-point compactifications. proof: Let X and Y be locally compact T spaces. Let f : X Y be a homeomorphism. Define X X {p} and Y Y {q} be the one-point compactifications of X and Y respectively. Define: fx) { fx), x X q, x p. It is clear that f is a bijection by construction. Recall the topology on the one-point compactification of a space T : τ {U U T open} {T \ C C T compact}. Now to show that f is continuous. Suppose that U Y is open. Then f U) f U) is open in X and thus open in X. Now suppose that C Y is compact. Then f Y \ C) f Y ) \ f C) X \ f C) which is open in X since f C) X is compact. Thus f is continuous. Moreover, f is a continuous bijection from a compact space to a T space, and thus is a homeomorphism. So by this lemma it suffices to show that R n is homeomorphic to S n \ {p}. Note that the one-point compactification of S n \ {p} is S n. Consider the map ϕ : S n \ {p} R n given by: ϕx) ϕx,..., x n+ ). x,..., x n ). This map is commonly known as Stereographic Projection. It has a well known inverse ψ : R n S n \ {p} given by ψy) ψy,..., y n ) + y y,..., y n, y ). Clearly these are both continuous as they are just quotients of polynomials. To see that they are bijective I show that their composition each way is the identity: ) y ϕψy)) ϕψy,...y n )) ϕ + y,..., y n + y, y ) y y + + y,..., y n + y ψϕx)) ψϕx,..., x n+ )) y + x + +x n x n+) x,..., x n++x n+ +x + +x n x n+) ) x x,..., x n, x + +x n x n+) x x n,...,, x ) n+ ) ) x n, x n+ )
8 8 This gives a homeomorphism between R n and S n \ {p}. Thus by the lemma above, we have that the one-point compactification of R n is homeomorphic to S n. Exercise 54 Let Q have the relative topology induced from R. a. Q is not locally compact. b. Q is σ-compact it is a countable union of singleton sets), but uniform convergence on singletons i.e., pointwise convergence) does not imply uniform convergence on compact subsets of Q. a. Suppose Q were locally compact. Let q Q. Suppose that K is a compact neighborhood of q in Q. But we have an open interval I Q such that q I I K. Now let j I. There is a sequence of rational numbers {r n } n entirely contained in I converging to j in R. Since this is a convergent sequence, all of its convergent subsequences converge to the same thing, namely j. Now notice that none of these subsequences can converge in Q because j / Q. Thus I is not sequentially compact, as it should be being a compact metric space. Thus all compact subsets of Q have empty interior which guarantees that Q cannot be locally compact. b. Consider the subset H { n n N} {0} of Q. This is compact since if you take any open cover of H, the element of the cover that contains 0 must contain all but finitely many elements of H since Q has the subspace topology, the rest follows easily. Now consider the sequence {f n } of functions on H given by f n x) x n. This converges pointwise i.e. uniformly on singletons) to fx) {, x 0, otherwise. If this were uniform convergence on H, the function it converged to would have to be continuous by Theorem 7. of Baby Rudin) since each of the f n s are continuous, however, clearly f is not continuous, thus f n unif. f. Zhang Problems ) A function F : [a, b] R is an indefinite integral i.e. F x) F a) x a F t)dt) iff F is absolutely continuous. ) Extend F to R by setting F x) 0 for x < a and F x) F b) for x > b. Then F x) 0 x / [a, b]. Thus F L m). Then by corollary 3.33 we have that F is absolutely continuous. ) Suppose that F is absolutely continuous on [a, b]. Extend F to R by setting F x) 0 for x < a and F x) F b) for x > b. Then by lemma 3.34, F BV ; and actually, moreover, F NBV since it is right continuous and F ) 0. Now by corollary 3.33, since F NBV and is absolutely continuous, F L m) and F x) x F t) dt. But F x) 0 on, a) so: F x) F a) + x where F is now viewed as a function in L [a, b], m). a F t) dt ) Show that B {B r x) r Q, x R n } forms a basis for the standard topology on R n. Why are the rationals sufficient? Let B r x) be any element of B where x x,..., x n ). Then it determines the open ball {y R n x y < r}. Consider the element x r 3, x + r 3 ) x n r 3, x n + r 3 ). This is an element of the standard basis for the standard topology on R n. Now choose any open set a, b ) a n, b n ) in the standard basis for R n. Let ɛ min i n {b i a i }. Let r be any rational number smaller than ɛ a+b 3, and let x,..., an+bn ). Then the open ball B r x) a, b ) a n, b n ). Thus this basis generates the standard topology on R. The rationals are sufficient because they are dense in R.
9 9 References [] Hemenway, Brett. brett/solutions/45b/hw.pdf
Notes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationx a x 2 (1 + x 2 ) n.
Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number
More informationPractice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationBasic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011
Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More information9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
More informationand s n (x) f(x) for all x and s.t. s n is measurable if f is. REAL ANALYSIS Measures. A (positive) measure on a measurable space
RAL ANALYSIS A survey of MA 641-643, UAB 1999-2000 M. Griesemer Throughout these notes m denotes Lebesgue measure. 1. Abstract Integration σ-algebras. A σ-algebra in X is a non-empty collection of subsets
More informationI. Pointwise convergence
MATH 40 - NOTES Sequences of functions Pointwise and Uniform Convergence Fall 2005 Previously, we have studied sequences of real numbers. Now we discuss the topic of sequences of real valued functions.
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationTHE BANACH CONTRACTION PRINCIPLE. Contents
THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,
More information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More informationn k=1 k=0 1/k! = e. Example 6.4. The series 1/k 2 converges in R. Indeed, if s n = n then k=1 1/k, then s 2n s n = 1 n + 1 +...
6 Series We call a normed space (X, ) a Banach space provided that every Cauchy sequence (x n ) in X converges. For example, R with the norm = is an example of Banach space. Now let (x n ) be a sequence
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationTOPIC 4: DERIVATIVES
TOPIC 4: DERIVATIVES 1. The derivative of a function. Differentiation rules 1.1. The slope of a curve. The slope of a curve at a point P is a measure of the steepness of the curve. If Q is a point on the
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationCHAPTER 1 BASIC TOPOLOGY
CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is
More informationMA4001 Engineering Mathematics 1 Lecture 10 Limits and Continuity
MA4001 Engineering Mathematics 1 Lecture 10 Limits and Dr. Sarah Mitchell Autumn 2014 Infinite limits If f(x) grows arbitrarily large as x a we say that f(x) has an infinite limit. Example: f(x) = 1 x
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationFollow links for Class Use and other Permissions. For more information send email to: permissions@pupress.princeton.edu
COPYRIGHT NOTICE: Ariel Rubinstein: Lecture Notes in Microeconomic Theory is published by Princeton University Press and copyrighted, c 2006, by Princeton University Press. All rights reserved. No part
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationPoint Set Topology. A. Topological Spaces and Continuous Maps
Point Set Topology A. Topological Spaces and Continuous Maps Definition 1.1 A topology on a set X is a collection T of subsets of X satisfying the following axioms: T 1.,X T. T2. {O α α I} T = α IO α T.
More informationSOLUTIONS TO ASSIGNMENT 1 MATH 576
SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts
More informationTHE CONTRACTION MAPPING THEOREM
THE CONTRACTION MAPPING THEOREM KEITH CONRAD 1. Introduction Let f : X X be a mapping from a set X to itself. We call a point x X a fixed point of f if f(x) = x. For example, if [a, b] is a closed interval
More informationMath 104: Introduction to Analysis
Math 104: Introduction to Analysis Evan Chen UC Berkeley Notes for the course MATH 104, instructed by Charles Pugh. 1 1 August 29, 2013 Hard: #22 in Chapter 1. Consider a pile of sand principle. You wish
More informationSeparation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
More informationProperties of BMO functions whose reciprocals are also BMO
Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and
More informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
More informationMathematics for Econometrics, Fourth Edition
Mathematics for Econometrics, Fourth Edition Phoebus J. Dhrymes 1 July 2012 1 c Phoebus J. Dhrymes, 2012. Preliminary material; not to be cited or disseminated without the author s permission. 2 Contents
More informationChapter 7. Continuity
Chapter 7 Continuity There are many processes and eects that depends on certain set of variables in such a way that a small change in these variables acts as small change in the process. Changes of this
More informationReal Roots of Univariate Polynomials with Real Coefficients
Real Roots of Univariate Polynomials with Real Coefficients mostly written by Christina Hewitt March 22, 2012 1 Introduction Polynomial equations are used throughout mathematics. When solving polynomials
More informationThe Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line
The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line D. Bongiorno, G. Corrao Dipartimento di Ingegneria lettrica, lettronica e delle Telecomunicazioni,
More informationINTRODUCTION TO TOPOLOGY
INTRODUCTION TO TOPOLOGY ALEX KÜRONYA In preparation January 24, 2010 Contents 1. Basic concepts 1 2. Constructing topologies 13 2.1. Subspace topology 13 2.2. Local properties 18 2.3. Product topology
More informationChapter 5. Banach Spaces
9 Chapter 5 Banach Spaces Many linear equations may be formulated in terms of a suitable linear operator acting on a Banach space. In this chapter, we study Banach spaces and linear operators acting on
More informationShape Optimization Problems over Classes of Convex Domains
Shape Optimization Problems over Classes of Convex Domains Giuseppe BUTTAZZO Dipartimento di Matematica Via Buonarroti, 2 56127 PISA ITALY e-mail: buttazzo@sab.sns.it Paolo GUASONI Scuola Normale Superiore
More informationGod created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)
Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationMicroeconomic Theory: Basic Math Concepts
Microeconomic Theory: Basic Math Concepts Matt Van Essen University of Alabama Van Essen (U of A) Basic Math Concepts 1 / 66 Basic Math Concepts In this lecture we will review some basic mathematical concepts
More informationLet H and J be as in the above lemma. The result of the lemma shows that the integral
Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;
More informationINCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
More informationLECTURE NOTES IN MEASURE THEORY. Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12)
1 LECTURE NOTES IN MEASURE THEORY Christer Borell Matematik Chalmers och Göteborgs universitet 412 96 Göteborg (Version: January 12) 2 PREFACE These are lecture notes on integration theory for a eight-week
More informationConvex analysis and profit/cost/support functions
CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m
More informationComments on Quotient Spaces and Quotient Maps
22M:132 Fall 07 J. Simon Comments on Quotient Spaces and Quotient Maps There are many situations in topology where we build a topological space by starting with some (often simpler) space[s] and doing
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 informationA new continuous dependence result for impulsive retarded functional differential equations
CADERNOS DE MATEMÁTICA 11, 37 47 May (2010) ARTIGO NÚMERO SMA#324 A new continuous dependence result for impulsive retarded functional differential equations M. Federson * Instituto de Ciências Matemáticas
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More informationRepresentation of functions as power series
Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions
More informationDISINTEGRATION OF MEASURES
DISINTEGRTION OF MESURES BEN HES Definition 1. Let (, M, λ), (, N, µ) be sigma-finite measure spaces and let T : be a measurable map. (T, µ)-disintegration is a collection {λ y } y of measures on M such
More informationMetric Spaces. Lecture Notes and Exercises, Fall 2015. M.van den Berg
Metric Spaces Lecture Notes and Exercises, Fall 2015 M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK mamvdb@bristol.ac.uk 1 Definition of a metric space. Let X be a set,
More informationCHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.
CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationPSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2
PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 Abstract. We prove a Bruckner-Garg type theorem for the fiber structure of a generic map from a continuum X into the unit interval I. We
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More information36 CHAPTER 1. LIMITS AND CONTINUITY. Figure 1.17: At which points is f not continuous?
36 CHAPTER 1. LIMITS AND CONTINUITY 1.3 Continuity Before Calculus became clearly de ned, continuity meant that one could draw the graph of a function without having to lift the pen and pencil. While this
More informationHomework # 3 Solutions
Homework # 3 Solutions February, 200 Solution (2.3.5). Noting that and ( + 3 x) x 8 = + 3 x) by Equation (2.3.) x 8 x 8 = + 3 8 by Equations (2.3.7) and (2.3.0) =3 x 8 6x2 + x 3 ) = 2 + 6x 2 + x 3 x 8
More informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
More informationLebesgue Measure on R n
8 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 informationLecture Notes on Measure Theory and Functional Analysis
Lecture Notes on Measure Theory and Functional Analysis P. Cannarsa & T. D Aprile Dipartimento di Matematica Università di Roma Tor Vergata cannarsa@mat.uniroma2.it daprile@mat.uniroma2.it aa 2006/07 Contents
More informationRolle s Theorem. q( x) = 1
Lecture 1 :The Mean Value Theorem We know that constant functions have derivative zero. Is it possible for a more complicated function to have derivative zero? In this section we will answer this question
More informationFIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.
FIRST YEAR CALCULUS WWLCHENW L c WWWL W L Chen, 1982, 2008. 2006. This chapter originates from material used by the author at Imperial College, University of London, between 1981 and 1990. It It is is
More informationHow To Understand The Theory Of Hyperreals
Ultraproducts and Applications I Brent Cody Virginia Commonwealth University September 2, 2013 Outline Background of the Hyperreals Filters and Ultrafilters Construction of the Hyperreals The Transfer
More information4.3 Lagrange Approximation
206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
More informationReference: Introduction to Partial Differential Equations by G. Folland, 1995, Chap. 3.
5 Potential Theory Reference: Introduction to Partial Differential Equations by G. Folland, 995, Chap. 3. 5. Problems of Interest. In what follows, we consider Ω an open, bounded subset of R n with C 2
More information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
More informationFixed Point Theorems in Topology and Geometry
Fixed Point Theorems in Topology and Geometry A Senior Thesis Submitted to the Department of Mathematics In Partial Fulfillment of the Requirements for the Departmental Honors Baccalaureate By Morgan Schreffler
More informationSolutions to Homework 10
Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x
More informationFixed Point Theorems
Fixed Point Theorems Definition: Let X be a set and let T : X X be a function that maps X into itself. (Such a function is often called an operator, a transformation, or a transform on X, and the notation
More informationLecture 7: Continuous Random Variables
Lecture 7: Continuous Random Variables 21 September 2005 1 Our First Continuous Random Variable The back of the lecture hall is roughly 10 meters across. Suppose it were exactly 10 meters, and consider
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationINDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationLecture Notes on Topology for MAT3500/4500 following J. R. Munkres textbook. John Rognes
Lecture Notes on Topology for MAT3500/4500 following J. R. Munkres textbook John Rognes November 29th 2010 Contents Introduction v 1 Set Theory and Logic 1 1.1 ( 1) Fundamental Concepts..............................
More informationScalar Valued Functions of Several Variables; the Gradient Vector
Scalar Valued Functions of Several Variables; the Gradient Vector Scalar Valued Functions vector valued function of n variables: Let us consider a scalar (i.e., numerical, rather than y = φ(x = φ(x 1,
More informationWalrasian Demand. u(x) where B(p, w) = {x R n + : p x w}.
Walrasian Demand Econ 2100 Fall 2015 Lecture 5, September 16 Outline 1 Walrasian Demand 2 Properties of Walrasian Demand 3 An Optimization Recipe 4 First and Second Order Conditions Definition Walrasian
More information1. Let X and Y be normed spaces and let T B(X, Y ).
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 2005-03-14 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationMATH PROBLEMS, WITH SOLUTIONS
MATH PROBLEMS, WITH SOLUTIONS OVIDIU MUNTEANU These are free online notes that I wrote to assist students that wish to test their math skills with some problems that go beyond the usual curriculum. These
More informationt := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
More informationHow To Find Out How To Calculate A Premeasure On A Set Of Two-Dimensional Algebra
54 CHAPTER 5 Product Measures Given two measure spaces, we may construct a natural measure on their Cartesian product; the prototype is the construction of Lebesgue measure on R 2 as the product of Lebesgue
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationALMOST COMMON PRIORS 1. INTRODUCTION
ALMOST COMMON PRIORS ZIV HELLMAN ABSTRACT. What happens when priors are not common? We introduce a measure for how far a type space is from having a common prior, which we term prior distance. If a type
More informationLIMITS AND CONTINUITY
LIMITS AND CONTINUITY 1 The concept of it Eample 11 Let f() = 2 4 Eamine the behavior of f() as approaches 2 2 Solution Let us compute some values of f() for close to 2, as in the tables below We see from
More information