4. Compactness. F i. i I
|
|
- Jayson West
- 7 years ago
- Views:
Transcription
1 4. Compactness Definition. Let X be a topological space X. A subset K X is said to be compact set in X, if it has the finite open cover property: (f.o.c) Whenever {D i } i I is a collection of open sets such that K i I D i, there exists a finite sub-collection D i1,..., D in such that K D i1 D in. An equivalent description is the finite intersection property: (f.i.p.) If {F i } i I is is a collection of closed sets such that for any finite subcollection F i1,..., F in we have K F i1... F in, it follows that K ( ) F i. A topological space (X, T ) is called compact if X itself is a compact set. i I Remark 4.1. Suppose (X, T ) is a topological space, and K is a subset of X. Equip K with the induced topology T K. Then it is straightforward from the definition that the following are equivalent: K is compact, as a subset in (X, T ); (K, T K ) is a compact space, that is, K is compact as a subset in (K, T K ). The following three results, whose proofs are immediate from the definition, give methods of constructing compact sets. Proposition 4.1. A finite union of compact sets is compact. Proposition 4.2. Suppose (X, T ) is a topological space and K X is a compact set. Then for every closed set F X, the intersection F K is again compact. Proposition 4.3. Suppose (X, T ) and (Y, S) are topological spaces, f : X Y is a continuous map, and K X is a compact set. Then f(k) is compact. The following results discuss compactness in Hausdorff spaces. Proposition 4.4. Suppose (X, T ) is toplological Hausdorff space. (i) Any compact set K X is closed. (ii) If K is a compact set, then a subset F K is compact, if and only if F is closed (in X). Proof. (i) The key step is contained in the following Claim: For every x X K, there exists some open set D x with x D x X K. Fix x X K. For every y K, using the Hausdorff property, we can find two open sets U y and V y with U y x, V y y, and U y V y =. Since we obviously have K y K V y, by compactness, there exist points y 1,..., y n K, such that K V y1 V yn. The claim immediately follows if we then define D x = U y1 U yn. 26
2 4. Compactness 27 Using the Claim we now see that we can write the complement of K as a union of open sets: X K = D x, x X K so X K is open, which means that K is indeed closed. (ii). If F is closed, then F is compact by Proposition 4.2. Conversely, if F is compact, then by (i) F is closed. Corollary 4.1. Let X be a compact Hausdorff space, let Y be a topological space, and let f : X Y be a continuous map, which is bijective. Then f is a homeomorphism, i.e. the inverse map f 1 : Y X is continuous. Proof. What we need to prove is the fact that, whenever D X is open, it follows that its preimage under f 1, that is, the set f(d) Y, is again open. To get this fact we take complements. Consider the set X D, which is closed in X. Since X is compact, by Proposition 4.2 it follows that X D is compact. By Proposition 4.3, the set f(x D) is compact in Y, and finally by Proposition 4.4 it follows that f(x D) is closed. Now we are done, because the fact that f is bijcetive gives Y f(d) = f(x D), and the fact that Y f(d) is closed means that f(d) is indeed open in Y. Proposition 4.5. Every compact Hausdorff space is normal. Proof. Let X be a compact Hausdorff space. Let A, B X be two closed sets with A B =. We need to find two open sets U, V X, with A U, B V, and U V =. We start with the following Particular case: Assume B is a singleton, B = {b}. The proof follows line by line the first part of the proof of part (i) from Proposition 4.4. For every a A we find open sets U a and V a, such that U a a, V a b, and U a V a =. Using Proposition 4.4 we know that A is compact, and since we clearly have A a A U a, there exist a 1,..., a n A, such that U a1 U an A. Then we are done by taking U = U a1 U an and V = V a1 V an. Having proven the above particular case, we proceed now with the general case. For every b B, we use the particular case to find two open sets U b and V b, with U b A, V b b, and U b V b =. Arguing as above, the set B is compact, and we have B b B V b, so there exist b 1,..., b n B, such that V b1 V bn B. Then we are done by taking U = U b1 U bn and V = V b1 V bn. Examples 4.1. A. Any closed interval of the form [a, b] is a compact set in R. To prove this, we start with an arbitrary collection D of open subsets of R, with [a, b] D D D, and we wish to find D 1,..., D n D, with D 1 D n [a, b]. To get this we consider the set M = { t (a, b] : there exist D 1,..., D n D with D 1 D n [a, t] }, so that all we need is the fact that b M. We first show that the number s = sup M also belongs to M. On the one hand, there exists some open set D D with D s, so there exists ε > 0 such that D (s ε, s + ε). On the other hand, there exists t M with s ε < t, so there exist D 1,..., D n [a, t] [a, s ε]. Since we clearly have D D 1 D n [a, s ε] (s ε, s + ε) = [a, s + ε) [a, s],
3 28 CHAPTER I: TOPOLOGY PRELIMINARIES it follows that indeed s belongs to M. Finally, by the same argument as above, it follows that the set M will also contain the intersection [s, s + ε) [a, b], which clearly forces s = b. B. The above result has a famous generalization - the Bolzano-Weierstrass Theorem - which states that a set X R is compact, if and only if (i) X is closed, and (ii) X is bounded, in the sense that there exists some C 0 such that x C, x X. The fact that every compact set X R is closed and bounded is clear (use the finite open cover property with n=1 ( n, n) = R X). Conversely, if X is closed and bounded, then X is a closed subset of some interval of the form [ C, C], which is compact by A, so X itself is compact. The Bolzano-Weierstarss Theorem has the following important consequence. Proposition 4.6. Let X be a compact space, and let f : X R be a continuous function. Then f attains its maximum and minimum values, in the sense that there exist points x 1, x 2 X, such that f(x 1 ) f(x) f(x 2 ), x X. Proof. Consider the set K = f(x) which is compact in R. Since K is bounded, the quantities t 1 = inf K and t 2 = sup K are finite. Since K is closed, both t 1 and t 2 belong to K, so there exist x 1, x 2 X such that t 1 = f(x 1 ) and t 2 = f(x 2 ). The following is a useful technical result, which deals with the notion of uniform convergence. Theorem 4.1 (Dini). Let X be a compact space, let (f n ) n=1 be a sequence of continuous functions f n : X R. Assume the sequence (f n ) n=1 is monotone, in the sense that either ( ) f 1 f 2..., or ( ) f 1 f Assume f : X R is another continuous function, with the property that the sequence (f n ) n=1 converges pointwise to f, that is: lim f n(x) = f(x), x X. n Then the sequence (f n ) n=1 is converges uniformly to f, in the sense that [ lim max f n(x) f(x) ] = 0. n x X Proof. Replacing f n with f n f, we can assume that f = 0, which means that we have lim n f n (x) = 0, x X. Replacing (if necessary) f n with f n, we can also assume that the sequence (f n ) n 1 satisfies ( ). In particular, each f n is non-negative. For each n 1, let us define s n = max x X f n (x), so that what we need to prove is the fact that lim n s n = 0. Using ( ) it is clear that we have the inequalities s 1 s 2 0, so the desired result is equivalent to showing that inf{s n : n 1} = 0.
4 4. Compactness 29 We are going to prove this equality by contradiction. Assume there exists some ε > 0, such that s n ε, n 1. For each integer n 1, let us define the set F n = {x X : f n (x) ε}, ( ) so that (use Proposition 4.6) F n. Since F n = fn 1 [ε, ), it is clear that Fn is closed, for every n 1. Using ( ) it is obvious that we have the inclusions F 1 F 2..., so using the the finite intersection property, it follows that F n. n=1 But this leads to a contradiction, because if we pick an element x n=1 F n, then we will have f n (x) ε, n 1, and then the equality lim n f n (x) = 0 is impossible. Comment. The reader is strongly encouraged to try to work the two exercises below, before reading Theorems 4.2 and 4.3. Strictly speaking these results do not require the more sofosticated machinery employed in these two theorems. Exercise 1. Let X be a compact space. Equip the product space X R with the product topology (here R is equipped with the standard topology). Prove that a set of the form K = X [a, b] is compact in X R. Hint: Start with an arbitrary collection D of open subsets of X R, with X [a, b] D D D, and prove there exist D 1,..., D n D, with D 1 D n X [a, b]. Argue as above, by considering the set M = { t (a, b] : there exist D 1,..., D n D with D 1 D n X [a, t] }, and prove that b M, by showing first that sup M M. Exercise 2. Let n 1 be an integer, and equip R n with the product topology, where R is equipped with the standard topology. A. Prove that closed boxes of the form B = [a 1, b 1 ] [a n, b n ] are compact in R n. B. Consider the coordinate maps π k : R n R, k = 1,..., n. Declare a set X R n bounded, if all sets π k (X) R, k = 1,..., n, are bounded. Prove the general Bolzano-Weierstrass Theorem: a set X R n is compact, if and only if X is closed and bounded. C. Prove that a set X C is compact, if and only if X is closed and bounded, in the sense that there exists some constant C 0, such that ζ C, ζ X. Hints: A. Use induction and the preceding Exercise. B. Argue exactly as in Example 4.1.B. C. Analyze the two notions of boundedness (the coordinate definition given in B, and the absolute value definition given in C) and show that they are equivalent, under the canonical homeomorphism R 2 C. Besides the two equivalent conditions (f.o.c) and (f.i.p.), there are some other useful characterizations of compactness, listed in the following.
5 30 CHAPTER I: TOPOLOGY PRELIMINARIES Theorem 4.2. Let (X, T ) be a topological space. The following are equivalent: (i) X is compact. (ii) (Alexander sub-base Theorem) There exists a sub-base S with the finite open cover property: (s) For any collection {S i i I} S with X = i I S i, there exists a finite sub-collection {S i1, S i2,..., S in } (for some finite sequence of indices i 1, i 2,..., i n I) such that X = S i1 S i2 S in. (iii) Every ultrafilter in X is convergent. (iv) Every net in X has a convergent subnet. Proof. (i) (ii). This is obvious. (In fact any sub-base has the open cover property.) (ii) (iii). Let U be an ultrafilter on X. Assume U is not convergent to any point x X. By Proposition 3.2 it follows that, for each x X, one can find a set S x S with S x x, but such that S x U. Using property (s), one can find a finite collection of points x 1,..., x n X, such that (1) S x1 S xn = X. Since S xp U, it means that X S xp belongs to U, for every p = 1,..., n. Then, using (1), we get U (X S x1 ) (X S xn ) =, which is impossible. (iii) (iv). Assume condition (iii) holds, and let (x λ ) λ Λ be some net in X. Denote by Φ the collection of all finite subsets of Λ (including the empty set), and define, for each F Φ, the sets Λ F = {λ Λ : λ µ, mu F }, G F = {x λ : λ Λ F } (use the convention Λ = Λ). Since we obviously have Λ F1 Λ F2 = Λ F1 F 2, F 1, F 2 Φ, we get the equalities G F1 G F2 = G F1 F 2, F 1, F 2 Φ, which prove the fact that the collection G = {G F } F Φ is a filter in X. Let U be then some ultrafilter with U G. By the hypothesis (iii), the ultrafilter U is convergent to some point x X, which means that U contains the collection N x of all neighborhoods of x. In particular, we get the fact that (2) N G F, N N x, F Φ. We are now in position to define a subnet of (x λ ) λ Λ, which will prove to be convergent to x. Consider the set Σ = {(N, λ) N x Λ : x λ N}, equipped with the ordering { N1 N (N 1, λ 1 ) (N 2, λ 2 ) 2 λ 1 λ 2 Let us remark that Σ is a directed set. Indeed, if we start with two elements σ 1 = (N 1, λ 1 ) and σ 2 = (N 2, λ 2 ) in Σ, then using (2) with N = N 1 N 2, and F = {λ 1, λ 2 }, we get the existence of some λ Λ with λ λ 1, λ λ 2, and such
6 4. Compactness 31 that x λ N. This means that the pair σ = (N, λ) belongs to Σ, and it also satisfies σ σ 1, σ σ 2. Consider also the map φ : Σ (N, λ) λ Λ. Again using (2), it follows that φ is a directed map. Define then the net (y σ ) σ Σ by y σ = x φ(σ), σ Σ. By construction, (y σ ) σ Σ is a subnet of (x λ ) λ Λ. We show now that (y σ ) σ Σ is convergent to x. Start with some arbitrary neighborhood N of x. Use (2) with F =, to find some λ N Λ, such that x λn N. Put σ N = (N, λ N ). If σ = (V, λ) Σ is such that σ σ N, then in particular we have x λ M N, i.e. y σ N. In other words we have y σ N, σ σ N, thus proving that (y σ ) σ Σ is indeed convergent to x. (iv) (i). Assume (iv), and let us prove that X has the finite intersection property (f.i.p.). Let {F i } i I is is a collection of closed sets such that for any finite sub-collection F i1,..., F in we have F i1... F in, and let us prove that i I F i. Denote by Ω the collection of all finite non-empty subsets of I, and define, for each J Ω, the non-empty closed set F J = i J F i. With this notation, what we have to prove is the fact that J Ω F J. The advantage here is the fact that Ω is directed (by inclusion). Since F J, for each J Ω, we can choose an element x J F J. This way (use the Axiom of Choice) we can construct a net (x J ) J Ω. Using (iv) there exists a subnet (y σ ) σ Σ φ (x J ) J Ω which is convergent to some point x X. In order to finish the proof, it suffices to show that x F J, J Ω. As above, denote by N x the collection of all neighborhoods of x. Since each F J is closed, all we need to prove is the fact that N F J, N N x, J Ω. Fix N N x and J Ω. On the one hand, since φ : Σ Ω is a directed map, there exists σ 1 Σ, such that φ(σ) J, σ σ 1. On the other hand, since (y σ ) σ Σ is convergent to x, there exists some σ 2 Σ, such that y σ N, σ σ 2. If we choose σ Σ such that σ σ 1 and σ σ 2, then on the one hand we have y σ = x φ(σ) F φ(σ) F J (here we use the fact that, for J, J 1 Ω, one has J 1 J F J1 F J ), and on the other hand we also have y σ N. This means precisely that y σ N F J. An interesting application of the above result is the following: Theorem 4.3 (Tihonov). Suppose one has a familiy (X i, T i ) i I of compact topological spaces. Then the product space X i is compact in the product topology. Proof. We are going to use the ultrafilter characterization (iii) from the preceding Theorem. Let U be an ultrafilter on X = X i. Denote by π i : X X i, i I the coordinate maps. Since each X i is compact, it follows that, for every i I, the ultrafilter π i (U) (in X i ) is convergent to some point x i X i. If we form the element x = (x i ) i I X, this means that π i (U) is convergent to π i (x), for every i I. Then, by the ultrafilter characterization of the product topology (see section 3) it follows that U is convergent to x. i I i I
7 32 CHAPTER I: TOPOLOGY PRELIMINARIES Comment. Another interesting application of Theorem 4.2 is the following construction. Suppose (X, T ) is a compact Hausdorff space, and (x i ) i I X is an arbitray family of elements. (Here I is an arbitrary set.) Suppose U is an ultrafilter on I. If we regard the family (x i ) i I simply as a function f : I X, then we can construct the ultrafilter f (U) on X. More explicitly f (U) = { W X : the set {i I : x i W } belongs to U }. Since X is compact Hausdorff, the ultrafilter f (U) is convergent to some unique point x X. This point is denoted by lim U x i.
MA651 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
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 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 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 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 informationEMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE DEGREES
EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-enumeration DEGREES MARIYA I. SOSKOVA AND IVAN N. SOSKOV 1. Introduction One of the most basic measures of the complexity of a
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 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 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 informationNotes 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 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 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 informationLinear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
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 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 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 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 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 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 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 informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
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 informationUniversity of Miskolc
University of Miskolc The Faculty of Mechanical Engineering and Information Science The role of the maximum operator in the theory of measurability and some applications PhD Thesis by Nutefe Kwami Agbeko
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 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 informationThis asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.
3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but
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 informationMathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
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 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 informationMINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS. denote the family of probability density functions g on X satisfying
MINIMIZATION OF ENTROPY FUNCTIONALS UNDER MOMENT CONSTRAINTS I. Csiszár (Budapest) Given a σ-finite measure space (X, X, µ) and a d-tuple ϕ = (ϕ 1,..., ϕ d ) of measurable functions on X, for a = (a 1,...,
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 informationLectures 5-6: Taylor Series
Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,
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 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 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
More information3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
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 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 information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
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 informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationTree sums and maximal connected I-spaces
Tree sums and maximal connected I-spaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal 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 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 informationLemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S.
Definition 51 Let S be a set bijection f : S S 5 Permutation groups A permutation of S is simply a Lemma 52 Let S be a set (1) Let f and g be two permutations of S Then the composition of f and g is a
More informationMinimal R 1, minimal regular and minimal presober topologies
Revista Notas de Matemática Vol.5(1), No. 275, 2009, pp.73-84 http://www.saber.ula.ve/notasdematematica/ Comisión de Publicaciones Departamento de Matemáticas Facultad de Ciencias Universidad de Los Andes
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 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 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 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 informationFIBER PRODUCTS AND ZARISKI SHEAVES
FIBER PRODUCTS AND ZARISKI SHEAVES BRIAN OSSERMAN 1. Fiber products and Zariski sheaves We recall the definition of a fiber product: Definition 1.1. Let C be a category, and X, Y, Z objects of C. Fix also
More information0 <β 1 let u(x) u(y) kuk u := sup u(x) and [u] β := sup
456 BRUCE K. DRIVER 24. Hölder Spaces Notation 24.1. Let Ω be an open subset of R d,bc(ω) and BC( Ω) be the bounded continuous functions on Ω and Ω respectively. By identifying f BC( Ω) with f Ω BC(Ω),
More informationGENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
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 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 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 informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationTOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS
TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms
More informationLEARNING OBJECTIVES FOR THIS CHAPTER
CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
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 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 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 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 informationCHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
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 informationFIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3
FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges
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 informationElements of probability theory
2 Elements of probability theory Probability theory provides mathematical models for random phenomena, that is, phenomena which under repeated observations yield di erent outcomes that cannot be predicted
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 informationTiers, Preference Similarity, and the Limits on Stable Partners
Tiers, Preference Similarity, and the Limits on Stable Partners KANDORI, Michihiro, KOJIMA, Fuhito, and YASUDA, Yosuke February 7, 2010 Preliminary and incomplete. Do not circulate. Abstract We consider
More informationFormal Languages and Automata Theory - Regular Expressions and Finite Automata -
Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March
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 informationThe sum of digits of polynomial values in arithmetic progressions
The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France E-mail: stoll@iml.univ-mrs.fr
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationHandout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
More informationA CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE
A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE DANIEL A. RAMRAS In these notes we present a construction of the universal cover of a path connected, locally path connected, and semi-locally simply
More informationRIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES
RIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES GAUTAM BHARALI AND INDRANIL BISWAS Abstract. In the study of holomorphic maps, the term rigidity refers to certain types of results that give us very specific
More informationA domain of spacetime intervals in general relativity
A domain of spacetime intervals in general relativity Keye Martin Department of Mathematics Tulane University New Orleans, LA 70118 United States of America martin@math.tulane.edu Prakash Panangaden School
More information