# Fixed Point Theorems For Set-Valued Maps

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Fixed Point Theorems For Set-Valued Maps Bachelor s thesis in functional analysis Institute for Analysis and Scientific Computing Vienna University of Technology Andreas Widder, July 2009.

2 Preface In this thesis we provide an introduction to fixed point theory for set-valued maps. It is not our goal in the present work to give an outline of the status quo of fixed point theory with all its newest achievements, but rather to give a thorough overview of the basic results in this discipline. It then should be possible for the reader to better and easier understand the newest developments as generalizations and continuations of the results we present here. After a short recollection about classical fixed point theorems for single-valued maps, we will first give an introduction to the theory of set-valued maps. We will generalize the notion of continuity for such maps and also give an example on how one can reduce problems involving set-valued maps to classical maps. We then show how to achieve fixed point theorems by using two principles: First we will generalize the well known concept of contractivity of a map. Thus we will achieve results similar to the famous Banach Fixed Point Theorem. We will also adress the question of convergence of fixed points for sequences of set-valued contraction. Then we will derive fixed point theorems for maps from geometrical properties. There, we will see generalizations of the important fixed point theorems by Schauder and Tychonoff. We will also give a small excursus to the concept of the KKM-principle and give a few examples of results, that can be achieved that way.

3 Contents 1 Classical Fixed Point Theorems The Banach Fixed Point Theorem The Schauder Fixed Point Theorem The Schaefer Fixed Point Theorem The Bourbaki-Kneser Fixed Point Theorem Set-valued Maps Continuity Selection Theorems Fixed Point Theorems for set-valued Maps. Contraction Principle Hausdorff-Metric Contractive Maps Sequences of Contractive Maps Fixed Point Theorems for set-valued Maps. Geometric Principle The KKM-Principle The Kakutani Fixed Point Theorem Generalizations Banach spaces Topological vector spaces

4 Chapter 1 Classical Fixed Point Theorems Definition 1.1 A point x of a space X is called a fixed point of a function f : X X, if f(x) = x. Many mathematical problems, originating from various branches of mathematics, can be equivalently formulated as fixed point problem, meaning that one has to find a fixed point of some function F. Fixed point theorems provide sufficient conditions under which there exists a fixed point for a given function, and thus allow us to guarantee the existence of a solution of the original problem. Because of the wide variety of uses, fixed point theorems are of great interest in many mathematical disciplines. There are four general principles by which results are achieved: 1. Contractivity: the function under consideration is Lipschitz-continuous with a Lipschitz- Constant < Geometry: the domain and/or the range of the function has certain geometrical properties (e.g. compactness or convexity). 3. Homotopy: there exists a function homotopic to a given function and a homotopy with certain properties 4. Set-Theory: the viewed space is ordered (and may have more set-theoretical properties) and the function satisfies relations between a point and its image regarding this order. Of course these are not all means by which fixed point theorems can be achieved. In some cases one can generalize these concepts, e.g. the conctractivity principle can be extended to nonexpansive cases, meaning the Lipschitz-Constant is allowed to be 1. Fixed point theorems may also arise as byproducts of, at first sight, unrelated concepts. An important example for this would be the fixed point index which arises in topological degree theory. In the following, we will give (without proofs) basic examples for a fixed point theorem belonging to The Banach Fixed Point Theorem This is probably the most well-known fixed-point theorem. This theorem is oustanding among fixed point thoerems, because it not only guarantees existence of a fixed point, but also its uniqueness, an approximative method to actually find the fixed point, and a priori and a posteriori estimates for the rate of convergence. 1

5 Definition 1.2 Let (X, d X ) and (Y, d Y ) be two metric spaces. A function f : X Y is called Lipschitz, if there exists a l > 0 such that for all x 1, x 2 X the inequality d Y (f(x 1 ), f(x 2 )) ld X (x 1, x 2 ) holds. The number k = inf{l R x 1, x 2 X, d Y (f(x 1 ), f(x 2 )) ld X (x 1, x 2 )} is called the Lipschitz constant of f. If k < 1, then f is called a contraction. Theorem 1.3 (Banach Fixed Point Theorem) Let (X, d) be a complete metric space and let f be a contraction with Lipschitz constant k. Then f has an unique fixed point. In more deatil: If x 0 X, then the sequence {x n } n=0 with x n+1 = f(x n ), n 0, converges to a uniquely defined fixed point ζ of f, and we have d(x n, ζ) k n (1 k) 1 d(x 1, x 0 ) and d(x n+1, ζ) k(1 k) 1 d(x n, x n+1 ). 1.2 The Schauder Fixed Point Theorem The fixed point theorem by Schauder is one of the most basic ones, when it comes to dealing with geometrical properties. In fact, many other fixed point theorems in this category are proven by reducing it to the Schauder Theorem. To state it, one needs the following definition: Definition 1.4 Let X and Y be Banach spaces. A function f : X Y is called compact, if f maps bounded sets to relatively compact sets. Theorem 1.5 (Schauder Fixed Point Theorem) Let X be a Banach space, M be a nonempty convex subset of X, and f : M M be continuous. If furthermore or M is closed and bounded and f compact M is compact, then f has a fixed point. Remark: This theorem stays true, if we interchange Banach space and locally convex topological vector space in the definition and the theorem. The result is then known as the Tychonoff Fixed Point Theorem. 1.3 The Schaefer Fixed Point Theorem Definition 1.6 Two continuous functions f and g from a topological space X to a topological space Y are called homotopic, if there exists a continuous function H : X [0, 1] Y with H(x, 0) = f(x) and H(x, 1) = g(x), x X. The function H is called a homotopy. There are two kinds of theorems in this category: Some deal with the question, under which conditions the existence of a fixed point is invariant under a homotopy, while others look for conditions under which a fixed point emerges. The Schaefer Theorem is of the first kind. 2

6 Theorem 1.7 (Schaefer Fixed Point Theorem) Let X be a normed space and let f : X X be continuous and compact. Define H : X [0, 1] X as H(x, α) = αf(x). If, for each α (0, 1), the set {x X : x = H(x, α)} is bounded, then f has a fixed point. Homotopic fixed point theorems and geometrical ones are often connected in some way. For example, the Schaefer Theorem can be derived from the Schauder Theorem using only geometrical means. On the other hand, the Schauder Theorem can also be derived from the Leray-Schauder fixed point index by homotopical means. 1.4 The Bourbaki-Kneser Fixed Point Theorem Fixed point theorems of this, fourth, category are applied to progressive or regressive functions (meaning x f(x) or f(x) x, respectively) or monotone functions. An interesting feature of these theorems is, that there are generally no further restrictions to the function. The Bourbaki-Kneser theorem is the most basic one of this type. It follows immediately from Zorn s Lemma. Theorem 1.8 (Bourbaki-Kneser Fixed Point Theorem) Let M be an ordered set and let f : M M satisfy x f(x) for all x M. If every totally ordered subset of M has a supremum, then f has a fixed point. Apparently, this theorem remains true, if is replaced by and supremum by infimum. It is interesting to note that the Bourbaki-Kneser Fixed Point Theorem can be used to show the equivalence of Zorn s Lemma and the Axiom of Choice. 3

7 Chapter 2 Set-valued Maps For a set Y, denote by P(Y ) the power set of Y. By a set-valued map, we mean a map T : X P(Y ) which thus assings to each point x X a subset T (x) Y. Note that a map S : X Y can be identified with a set-valued map S : X P(Y ) by setting S (x) = {S(x)}. We will refer to a map S : X Y as a single-valued map. For T : X P(Y ) and M X we define and the graph G(T ) of T will be the set T (M) = x M T (x), G(T ) = {(x, y) : x X, y T (x)}. Set-valued maps are important objects for many applications, for example in game theory or mathematical economics. They also often arise when studying certain optimization problems or when dealing with variational inequalities (for examples see Zeidler [Z1]). 2.1 Continuity We generalize the concept of continuity to set-valued maps. Definition 2.1 Let X and Y be topological spaces and T : X P(Y ) a set-valued map. 1. T is called upper semi-continuous, if for every x X and every open set V in Y with T (x) V, there exists a neighbourhood U(x) such that T (U(x)) V. 2. T is called lower semi-continuous, if for every x X, y T (x) and every neighbourhood V (y) of y, there exists a neighbourhood U(x)of (x) such that T (u) V (y), u U(x). 3. T is called continuous if it is both upper semi-continuous and lower semi-continuous. 4

8 Using simple topological arguments, these definitions can be equivalently stated in a simpler formulation. The preimage T 1 (A) of a set A Y under a set-valued map T is defined as T 1 (A) = {x X : T (x) A } Note that, unlike for single valued maps, the inclusion T (T 1 (A)) A need not hold. However, unless T 1 (A) =, we have T (T 1 (A)) A. Proposition 2.2 Let X and Y be topological spaces and T : X P(Y ) a set-valued map. 1. T is upper semi-continuous if and only if T 1 (A) is closed for all closed sets A Y. 2. T is lower semi-continuous if and only if T 1 (A) is open for all open sets A Y. Proof: 1. Suppose T is upper semi-continuous and A Y closed. Choose x (T 1 (A)) C, then T (x) A C. Since A C is open, there exists a neighbourhood U(x) of x, such that T (U(x)) A C. Therefore U(x) (T 1 (A)) C and it follows that T 1 (A) is closed. Conversely suppose T 1 (A) is closed for all closed A Y. Let x X V Y be open with T (x) V. Then V C is closed and by assumption so is T 1 (V C ). Moreover x / T 1 (V C ). Hence there exists a neighbourhood of x with U(x) (T 1 (V C )) C. This neighbourhood apparently satisfies T (U(x)) V. 2. Suppose T is lower semi-continuous and A Y open. Assume that x T 1 (A), and choose y T (x) A. Since A is open, there exists a neighbourhood of y with V (y) A. Because of the lower semi-continuity of T, there exists a neighbourhood U(x) of x with T (u) V (y) for all u U(x). This means U(x) T 1 (V (y)) T 1 (A). It follows that T 1 (A) is open. Conversely suppose T 1 (A) is open for every open set A Y. Assume that x X, y T (x) and V (y) is an open neighbourhood of y. Then T 1 (V (y)) is open and x T 1 (V (y)). Therefore there exists a neighbourhood U(x) of x with U(x) T 1 (V (y)). It follows that T (u) V (y) for all u U(x). Proposition (2.2) shows that for single-valued maps lower semi-continuity is identical with continuity in the classical sense When only dealing with subsets of the spaces X and Y the terms open and closed naturally mean open and closed in the induced topologies. In some special cases, the graph of a map can be used to characterize semi-continuity. will give an example: We Theorem 2.3 Let X and Y be compact spaces and T : X P(Y ) a set-valued mapping. Assume that T (x) is closed for all x X. Then T is upper semi-continuous if and only if G(T ) is closed in X Y. Proof: Suppose T is upper semi-continuous and choose (x, y) X Y with (x, y) / G(T ). Then y does not belong to the closed set T (x). Since Y is compact there exist two neighbourhoods V 1 of y and V 2 of T (x) with V 1 V 2 =. Since T is upper semi-continuous, we can find a neighbourhood U of x with T (U) V 2. Thus U V 1 is a neighbourhood of (x, y) with U( V 1 ) G(T ) =, and therefore G(T ) is closed. 5

9 Conversely assume that G(T ) is closed and that T is not upper semi-continuous at a point x X. Choose an open set V Y containing T (x). Note that because T is not uppersemicontinuous we can find such a set V. Let {U i } i I be the family of all neighbourhoods of x. Because T is not upper semi-continuous we have for every U j {U i } i I G(T ) (U j (Y \V )) Since G(T ), U j and Y \V are all closed the intersection is also closed and when looking at it for different U j {U i } i I it is obvious, that this intersections have the finite intersection property. Because X Y with the product topology is compact it follows, that G(T ) (U i (Y \V )). i I The only point in the intersection of all U i is x, therefore there exists y Y, such that (x, y) is in this intersection. Then y T (x) Y \V. But this contradicts our choice of V as a neighbourhood of T (x). Therefore T must be upper semi-continuous. 2.2 Selection Theorems If T : X P(Y ) is a set-valued mapping, we call a single-valued mapping t : X Y a selection of T, if t(x) T (x) for all x X. The existence of a selection is obviously equivalent to the fact, that T (x) for all x X. Often it is practical to reduce a problem involving set-valued maps to a question about singlevalued maps. Hence, selections are an important tool, and it is of interest to show existence of selections with additional properties. We will give one example of a statement of this kind. Michael s Selection Theorem This selection theorem guarantees the existence of a continuous selection. Recall, that a topological space is called paracompact if every open cover has a locally finite refinement, where a collection of sets is called locally finite, if every point of a set has a neighbourhood which intersects at most finitely many of these sets. Important examples for paracompact spaces are compact spaces, metric spaces and locally compact spaces with a countable basis. Paracompactness is an important property since it guarantees existence of partitions of unity. Recall that the family {f i } i I of continuous mappings is called a partition of unity subordinate to the open covering {O j } j J, if for every i, there is a j such that supp(f i ) O j. Furthermore, for all x X, 0 f i (x) 1 and i f i(x) = 1 hold and for fixed x there is a open set O x with x O x such that at most finitely many f i are not identically zero on O x. Theorem 2.4 Let T : X P(Y ) be a lower semi-continuous set-valued map. If X is paracompact, Y is a Banach-Space, T (x) is nonempty, closed and convex for all x X, 6

10 then there exists a continuous selection t : X Y of T. Proof: As a first step we show, that for each ɛ > 0 there exists a continuous map f : X Y such that d(f(x), T (x)) < ɛ, x X. (2.1) where d is the distance on Y induced by its norm. Fix ɛ > 0 and choose a selection m : X Y. Let B ɛ (m(x)) denote the open ball with radius ɛ and center m(x). Since T is lower semi-continuous, for each x X there exists an open neighbourhood U(x) of x such that T (u) B ɛ (m(x)), u U(x). (2.2) Since X is paracompact there exists a partition of unity {f α } subordinate to the open covering {U(x)} x X. Set f(x) = α f α (x)m(x α ), then f is a continuous function of X into Y. If f α (x) > 0 for some α, then x U(x α ) and therefore by (2.2) m(x α ) T (x) + B ɛ (0). Since T (x)+b ɛ (0) is convex, and f(x) a finite convex combination of elements from f α (x)m(x α ) with f α (x) > 0, we have f(x) T (x) + B ɛ (0). Hence d(f(x), T (x)) ɛ, i.e. f satisfies (2.1). In the second step, we construct the requested selection. Set ɛ n = 2 n. We will define inductively a sequence {f n } n N of continuous mappings f n : X Y with d(f n (x), T (x)) < ɛ n, x X, n = 1, 2,... (2.3) d(f n (x), f n 1 (x)) < ɛ n 1, x X, n = 2, 3,... (2.4) As we showed in the first step, there exists f 1 with d(f 1 (x), T (x)) < 1/2, x X. Assume that n 2 and we already have constructed f 1,..., f n 1. For each x X we define G(x) = (f n 1 (x) + B ɛn 1 (0)) T (x) By the induction hypothesis, G(x) is not empty. Since T (x) convex, so is G(x). Further G : X P(Y ) is lower semi-continuous, since f n 1 is continuous and T lower semi-continuous. So we can apply the first part of our proof also to G, since the only additional property of T is, that T (x) is closed, which was not used in that argument. Therefore there exists a continuous map f n : X Y such that (2.3) holds. By construction f n also satisfies (2.4). Since ɛ n converges, {f n } n N is a uniform Cauchy sequence and hence converges to a continuous map t : X Y. Since T (x) is closed, t is a selection of T. 7

11 Application to Differential Inclusions We now show an easy application of Michael s theorem and consider the initial value problem x (t) F (x(t), t), x(t 0 ) = x 0 (2.5) where t R and x R n. F (x, t) gives the set of all possible velocities of the system at a time t. Such differential inclusions arise when modeling systems for which we have no complete description. We are looking for a solution x : R R n. Theorem 2.5 (Generalized Peano Theorem) Suppose we have t 0 R and x 0 R n, where (x 0, t 0 ) U. Let F : U R n+1 P(R n ) be a lower semi-continuous map such that F (x, t) is a nonempty closed and convex set in R n for all (x, t) U. Then the initial value problem (2.5) has a C 1 -solution x = x(t) in a neighbourhood of t 0. Proof: By Michael s Selection Theorem there exists a continuous selection f : U R n of F. By the classical Peano Theorem, the initial value problem x (t) = f(x(t), t), x(t 0 ) = x 0 has (locally at t 0 ) a solution x(t). This function solves (2.5). 8

12 Chapter 3 Fixed Point Theorems for set-valued Maps. Contraction Principle Definition 3.1 A point x of a space X is called a fixed point of a set-valued map T : X P(X), if x T (x) For single-valued maps, we presented four principles, by which fixed point theorems can be achieved. For set-valued maps we will only consider fixed point theorems achieved due to contractivity or by geometrical means. Although there exist a few results by homotopic means, they are applicable only in very special settings. For more details, see for example Sim, Xu, Yuan [SXY]. Achieving fixed point theorems for set-valued maps by set theoretic means is also more complicated. The approach shown in the introduction certainly works only for a map from a space X into itself. Still, some results were achieved when looking for common fixed points of two set-valued maps, but only with additional assumptions about compatibility with metric values. For an example, see Beg, Butt [BB]. 3.1 Hausdorff-Metric The key to the classical Banach fixed point theorem is that one is working in a complete metric space. To get an analogous result for set-valued mappings, we have to equip the powerset of a metric space with a metric. Let (X, d) be a metric space. For each two nonempty elements M and N of P(X) we define D(x, N) = inf {d(x, y) : y N} [0, ), x M, D(M, N) = sup {D(x, N) : x M} [0, ]. Let us remark, that D(M, N) being small thus means, that each point of M is close to some point of N. The value of D(M, N) will certainly be finite, if M and N are bounded. Lemma 3.2 Let (X, d) be a metric space and let M, N, and Q be nonempty, bounded elements of P(X). Then 1. D(M, N) = 0 if and only if M N, 2. D(M, N) D(M, Q) + D(Q, N). 9

13 Proof: The first assertion follows directly from the definition of D(M, N). We come to the proof of 2. We have d(m, n) d(m, q) + d(q, n), m M, n N, q Q By taking the infimum over n N, the inequality D(m, N) d(m, q) + D(q, N), m M, q Q follows. By taking the supremum over all q Q we obtain D(m, N) D(m, Q) + D(Q, N), m M and by taking the supremum over all m M the assertion follows. In general the equality D(M, N) = D(N, M) need not hold, thus we need to symmetrize. Definition 3.3 The Hausdorff semi-metric on the family of all nonempty bounded subsets of a metric space is defined as δ(m, N) = max{d(m, N), D(N, M)}. Theorem 3.4 On the family of all nonempty bounded and closed sets of a metric space the Hausdorff semi-metric is a metric. Proof: Symmetry is built into the definition of δ, the equivalence δ(m, N) = 0 M = N holds since we restrict ourselves to closed subsets of X, and the triangle inequality since D(M, N) D(M, Q) + D(Q, M) δ(m, Q) + δ(q, N), D(N, M) D(N, Q) + D(Q, M) δ(n, Q) + δ(q, M). In the following, we will denote by CB(X) the family of all nonempty closed and bounded subsets of the metric space (X, d). Note, that different metrics on X result in different Hausdorff metrics on CB(X). The following theorem shows, that the completeness of the metric space (X, d) is preserved by going to the space (CB(X), δ). Theorem 3.5 If (X, d) is a complete metric space, then (CB(X), δ) is a complete metric space, where δ is the Hausdorff metric induced by d. Proof: Let {M n } n N be a sequence of bounded and closed subsets of X and suppose it is a Cauchy sequence with respect to δ. We define and show that M = ( (M m )) n=1 m=n lim δ(m n, M) = 0. 10

14 Boundedness of M follows easily from the definition and the fact, that {M n } is Cauchy sequence. Hence, M CB(X). For a given ɛ > 0, choose a number N ɛ such that We claim that δ(m m, M n ) < ɛ, Once this claim has been established, we obtain n, m N ɛ δ(m, M Nɛ ) 2ɛ. (3.1) δ(m, M n ) δ(m, M Nɛ ) + δ(m Nɛ, M n ) < 2ɛ + ɛ = 3ɛ, and the assertion of the theorem will follow. To prove (3.1) we need to show that: 1. D(x, M Nɛ ) 2ɛ for all x M 2. D(y, M) 2ɛ for all y M Nɛ. We first consider the set A i = {x X : D(x, M i ) ɛ}. n N ɛ Note that A i is closed. Since {M n } is a Cauchy sequence, we have M n A Nɛ for n N ɛ. By the definition of M M A i, i N ɛ and therefore M A Nɛ which implies 1. Next consider the sequence n i = N ɛ/2 i, i 0. Since {M n } is a Cauchy sequence, we can inductively construct a sequence m ni m ni M ni, i 0, m n0 = y, d(m ni, m ni 1 ) ɛ/2 i 1, i 1. The sequence {m ni } is a Cauchy sequence, because p d(m np, m nq ) ɛ 1/2 i 1 ɛ/2 q 1, p > q. i=q+1 Since (X, d) is complete there exists the limit m = lim m ni, and from the definition of M we have m M. Since by taking the limit we get d(m np, m n0 ) = d(m np, y) 2ɛ d(m, y) 2ɛ From this 2. follows. Together, we have established our claim (3.1). with 11

15 3.2 Contractive Maps We can extend the existence part of the Banach Fixed Point Theorem to set-valued contraction mappings. Theorem 3.6 Let (X, d) be a complete metric space, and let T : X CB(X) be a set-valued contraction where CB(X) is endowed with the Hausdorff metric induced by d. Then T has a fixed point. Proof: Denote by k the Lipschitz constant of T. We are going to construct a sequence {x n } n N with d(x n, x n+1 ) δ(t (x n 1 ), T (x n )) + k n, x n T (x n 1 ), n 1. (3.2) For x 0 we choose an arbitrary point of X, and for x 1 an arbitrary point of T (x 0 ). Then we can find a point x 2 T (x 1 ) such that d(x 1, x 2 ) δ(t (x 0 ), T (x 1 )) + k holds. By repating this appropriately, we can construct a sequence {x n } n N with the desired properties. From (3.2) we obtain the estimate This implies that, for any n, m 0, d(x n, x n+1 ) δ(t (x n 1 ), T (x n )) + k n kd(x n 1, x n ) + k n k(δ(t (x n 2 ), T (x n 1 )) + k n 1 ) + k n k 2 d(x n 2, x n 1 ) + 2k n k n d(x 0, x 1 ) + nk n d(x n, x n+m ) d(x n, x n+1 ) + + d(x n+m 1, x n+m ) n+m 1 l=n (k l d(x 0, x 1 ) + lk l ). Therefore {x n } n N is a Cauchy sequence. Since X is complete, it converges to some point x X. Because T is a Lipschitz mapping, this implies that T (x n ) converges to T (x). This means that for each ɛ > 0 there is an N ɛ such that for all n N ɛ Assume x / T (x). Then δ(t (x n ), T (x)) < ɛ. D(x, T (x)) = λ for some λ > 0. Choose ɛ = λ/2. Since x n+1 T (x n ), for all n N ɛ we have d(x n, x) > λ/2. This is a contradiction to x n x, and thus we have x T (x). We now give a second theorem of this kind, in which the assumptions about the contractivity of T are loosened some. In order to formulate this result, we need the two following definitions: 12

16 Definition 3.7 A complete metric space (X, d) is called ɛ-chainable, if, for any points a, b X and fixed ɛ > 0, there exists a finite set of points such that Each such set is called an ɛ-chain. a = x 0, x 1,, x n 1, x n = b d(x i 1, x i ) ɛ i = 1, 2, 3,, n. Definition 3.8 Let (X, d) be a complete metric space, and let ɛ > 0 and λ [0, 1). A set-valued mapping T : X CB(X) is called an (ɛ, λ)-uniformly local contraction if whenever d(x, y) < ɛ. δ(t (x), T (y)) λd(x, y) Theorem 3.9 Let (X, d) be an ɛ-chainable space and T : X CB(X) a set-valued (ɛ, λ)- uniformly local contraction. Then T has a fixed point. Proof: We define a new metric on X by { n } d(x, y) = inf d(x i 1, x i ) i=1 where x 0 = x, x n = y and the infimum is taken over all ɛ-chains (x 0,, x n ). It is easy to see, that d is indeed a metric on X. Since d(x, y) d(x, y) holds trivially and d(x, y) = d(x, y) if d(x, y) < ɛ, (X, d) is also a complete metric space. We denote by δ ɛ the Hausdorff metric induced by d. Let x, y X and consider an ɛ-chain x = x 0, x 1,, x n 1, x n = y. We have d(x i 1, x i ) < ɛ for i = 1, 2,, n, and since T is an (ɛ, λ)-uniformly locally contraction we have δ(t (x i 1 ), T (x i )) λd(x i 1, x i ). It follows that δ ɛ (T (x), T (y)) = n δ ɛ (T (x i 1 ), T (x i )) i=1 n δ(t (x i 1 ), T (x i )) i=1 λ n d(x i 1, x i ) i=1 Taking the infimum over all possible ɛ-chains we obtain δ ɛ (T (x), T (y)) λ d(x, y) Therefore T is a contraction mapping with respect to the metrices d and δ ɛ. Hence, we can apply Theorem (3.6). 13

17 3.3 Sequences of Contractive Maps We now want to consider the following problem: Assume we have a sequence of contractive mappings T i and a sequence x i, where for every i the point x i is a fixed point of T i. If the sequence {T i } i N converges to T 0, does {x i } i N (or at least a subsequence) converge to a fixed point of T 0? Without further assumptions, this is not the case: Suppose (X, d) = (R, d) with a metric d so R is bounded, T n (x) = R and x n = n. Then every x n is a fixed point, but there is no converging subsequence. For this reason we restrict ourselves to set-valued mappings with compact values. We will denote by K(X) the family of all nonempty compact subsets of X. Naturally K(X) CB(X), and therefore (K(X), δ) is a metric space. K(X) preserves many important properties of X: Proposition 3.10 Let δ be the Hausdorff metric on K(X) induced by the metric d of (X, d). 1. If (X, d) is a complete metric space, then (K(X), δ) is a complete metric space. 2. If (X, d) is a compact metric space, then (K(X), δ) is a compact metric space. 3. If (X, d) is a locally compact metric space, then (K(X), δ) is a locally compact metric space. Proof: 1) Let {M n } be a Cauchy sequence in K(X). Since this is naturally also a Cauchy sequence in CB(X), it follows from Theorem (3.5), that the limit lim M n exists in CB(X). We show, that M = lim n M n is compact. To do that it is sufficient to show that M is totally bounded. Let ɛ > 0 and choose N ɛ such that for all n N ɛ we have δ(m, M n ) ɛ/2. Since the sets M n are compact, we find a finite number of spheres of radius ɛ/2 which cover M Nɛ. Obviously the spheres with the same centers and radius ɛ cover M. 2) We have to show, that K(X) is totally bounded. Therefore we fix ɛ > 0. The set of open balls {B ɛ (x) x X} is an open cover of X. Since X is compact there is a finite set J such that X {B ɛ (x j ) j J}. Let Y = {x j j J}. We look at the collection of nonempty subsets of Y, P 0 (Y ) = P(Y )\{ }. Since Y is finite, so is P 0 (Y ). Also every Z P 0 (Y ) is compact and thus P 0 (Y ) K(X). We show that the balls {B ɛ (Z) Z P 0 (Y )} cover K(X). For any A K(X) let Z P 0 (Y ) be defined by We also define Z = {y Y D(y, A) < ɛ}. N ɛ (A) = {x X D(x, A) < ɛ}. Then Z N ɛ (A) by construction. We also claim that A N ɛ (Z): If not then there exists a point a A such that D(a, Z) ɛ. By our choice of Y there exists a y Y such that d(y, a) < ɛ. By definition of Z, y Z. Thus D(a, Z) < ɛ. A contradiction. Now since Z N ɛ (A) and A N ɛ (Z), we have δ(z, A) < ɛ. 3) We show that every A K(X) has a compact neighbourhood. Since A is compact in X and X is locally compact, there exist finitely many compact sets A 1, A N such that 14

18 A = N n=1 A n A. A is as a finite union of compact sets compact and thus (A, d A A ) is a compact metric space. Therefore (K(A), δ A ) is a compact metric space and in particular locally compact. So there exists a compact neighbourhood V of A in K(A). Since (K(A), δ A ) = (K(X) K(A), δ K(A) K(A) ), V is also a compact neighbourhood of A in (K(X), δ). The following lemma shows us, how we can construct a Lipschitz mapping in K(X) from a set-valued Lipschitz mapping. Lemma 3.11 Let T : X K(Y ) be a Lipschitz mapping with Lipschitz constant k. Then for any compact K X, A T (K) = T (x) x K is a compact subset of Y, i.e. A T (K) K(Y ). The thusly defined map A T :K(X) K(Y ) is a Lipschitz mapping with Lipschitz constant k. Proof: We show that every sequence of A T (K) has a convergent subsequence. Let {a i } be a sequence in A T (K). Then a i T (k i ) for some k i K. So we have a sequence {k i } in the compact set K, and therefore there exists a subsequence {k ij } which converges to some k K. Since T is a Lipschitz mapping, {T (k ij )} j=1 converges to T (k). Therefore all limit points of {a ij } lie in T (k). So to an arbitrary limit point x we can choose a subsequence of {a ij } that converges to x T (k) A T (K). Thus we have found a convergent subsequence of {a i }. So A T is well defined map K(X) K(Y ). We now show, that A T is a Lipschitz map. By using the definition of the Hausdorff metric we gain D Y (A T (F 1 ), A T (F 2 )) = sup u A T (F 1 ) = sup u A T (F 1 ) inf d Y (u, v) v A T (F 2 ) inf D Y (u, T (y)) y F 2 = sup inf D Y (T (x), T (y)) y F 2 x F 1 sup inf δ Y (T (x), T (y)) y F 2 x F 1 k sup inf d X (x, y) = kd X (F 1, F 2 ). y F 2 x F 1 Analogue we get that D Y (A T (F 2 ), A T (F 1 )) kd X (F 2, F 1 ) and thus δ Y (A T (F 1 ), A T (F 2 )) kδ X (F 1, F 2 ). To prove the main result of this section, we first need a few results about sequences of singlevalued contraction mappings. For the following three propositions, f i will denote a single-valued contraction mapping of a metric space (X, d) into itself with a fixed point a i for i = 0, 1, 2,. Proposition 3.12 If all the mappings {f i } i=1 have the same Lipschitz constant k < 1, and the sequence {f i } i=1 converges pointwise to f 0, then the sequence {a i } i=1 converges to a 0. 15

19 Proof: By the pointwise convergence, we can choose to given ɛ > 0 an N ɛ, such that d(f n (a 0 ), f 0 (a 0 )) ɛ(1 k) for all n N ɛ. Then d(a n, a 0 ) = d(f n (a n ), f 0 (a 0 )) d(f n (a n ), f n (a 0 )) + d(f n (a 0 ), f 0 (a 0 )) kd(a n, a 0 ) + ɛ(1 k) which yields d(a n, a 0 ) ɛ, n N ɛ. Proposition 3.13 If the sequence {f i } i=1 converges uniformly to f 0, then the sequence {a i } i=1 converges to a 0. Proof: To given ɛ > 0 choose N ɛ, such that for all x X and n N ɛ d(f n (x), f 0 (x)) ɛ(1 k 0 ) where k 0 < 1 is the Lipschitz constant of f 0. Then d(a i, a 0 ) = d(f i (a i ), f 0 (a 0 )) d(f i (a i ), f 0 (a i )) + d(f 0 (a i ), f 0 (a 0 )) ɛ(1 k 0 ) + k 0 d(a i, a 0 ). This yields d(a i, a 0 ) ɛ, i N ɛ. Proposition 3.14 If the space (X, d) is locally compact and the sequence {f i } i=1 converges pointwise to f 0, then the sequence {a i } i=1 converges to a 0. Proof: Let ɛ > 0 and assume ɛ is sufficiently small, so that K(a 0, ɛ) = {x X : d(a 0, x) ɛ} is a compact subset of X. Then, since {f i } i=1 is as a sequence of Lipschitz mappings equicontinuous and converges pointwise to f 0 and since K(a 0, ɛ) is compact, the sequence {f i } i=1 converges uniformly on K(a 0, ɛ) to f 0. Choose N ɛ such that if i N ɛ, then d(f i (x), f 0 (x)) (1 k 0 )ɛ for all x K(a 0, ɛ), where k 0 < 1 is the Lipschitz constant for f 0. Then, if i N ɛ and x K(a 0, ɛ), d(f i (x), a 0 ) d(f i (x), f 0 (x)) + d(f 0 (x), f 0 (a 0 )) (1 k 0 )ɛ + k 0 d(x, a 0 ) (1 k 0 )ɛ + k 0 ɛ = ɛ. This proves that if i N ɛ, then f i maps K(a 0, ɛ) into itself. Letting g i be the restriction of f i to K(a 0, ɛ) for each i N ɛ, we see that each g i is a contraction mapping of K(a 0, ɛ) into itself. Since K(a 0, ɛ) is a complete metric space, g i has a fixed point for each i N ɛ which must, from the definition of g i and the fact that f i has only one fixed point, be a i. Hence, a i K(a 0, ɛ) for each i N ɛ. It follows that the sequence {a i } i=1 of fixed points converges to a 0. 16

20 Lemma 3.15 Let (X, d) be a metric space, let T i : X CB(X) be a set-valued contraction mapping with fixed point x i for each i = 1, 2,, and let T 0 : X CB(X) be a set-valued contraction mapping. If the sequence {T i } i=1 converges pointwise to T 0 and if {x ij } j=1 is a convergent subsequence of {x i } i=1 then {x i j } j=1 converges to a fixed point of T 0. Proof: Set x 0 = lim j x ij and fix ɛ > 0. Choose N ɛ such that δ(t ij (x 0 ), T 0 (x 0 )) ɛ 2 and d(x ij, x 0 ) ɛ 2 for all j N ɛ. Then for such j, we have δ(t ij (x ij ), T 0 (x 0 )) δ(t ij (x ij ), T ij (x 0 )) + δ(t ij (x 0 ), T 0, (x 0 )) d(x ij, x 0 ) + δ(t ij (x 0 ), T 0, (x 0 )) ɛ. This shows, that lim j T ij (x ij ) = T 0 (x 0 ). And since x ij x 0 T 0 (x 0 ). T ij (x ij ) for each j, it follows, that Theorem 3.16 Let (X, d) be a complete metric space, let T i : X K(X) be a set-valued contraction mapping with fixed point x i for each i = 1, 2,, and let T 0 : X K(X) be a set-valued contraction mapping. Suppose one of the following holds: 1. Each of the mappings T i, i 1 has the same Lipschitz constant k < 1 and the sequence {T i } i=1 converges pointwise to T The sequence {T i } i=1 converges uniformly to T (X, d) is a locally compact space and the sequence {T i } i=1 converges pointwise to T 0. Then there exists a subsequence {x ij } j=1 of {x i} i=1 such that {x i j } j=1 converges to a fixed point of T 0. Proof: For each i define the map A Ti : K(X) K(X) as in Lemma (3.11). Then, A Ti is a contraction mapping and therefore has a unique fixed point F i K(X). If the sequence {T i } i=1 converges pointwise to T 0, then {T i } i=1 converges uniformly on compact subsets of X to T 0 and therefore {A Ti } i=1 converges pointwise on K(X) to A T 0. If {T i } i=1 converges uniformly to T 0, then {A Ti } i=1 converges uniformly on K(X) to A T 0. So we can use Proposition (3.12) with assumption 1, Proposition (3.13) with assumption 2 and the Propositions (3.14) and (3.10) with assumption 3 to conclude, that the sequence {F i } i=1 converges to F 0. We now show, that K = i=0 (F i) is compact. Let {y k } k=1 be a sequence in K. Then either one of the F i contains infinitely many y k or each contains only finitely many. In the first case, we can choose convergent subsequence in the compact set F i. In the second case, every limit point of {y k } k=1 must lie in F 0, because of the convergence of the sequence {F i } i=1. So we can choose a subsequence, that converges to one of these limit point. By the Banach Fixed Point Theorem (1.3), the sequence {A n T i (x i )} n=1 converges to F i. And since x i A n T i (x i ) for all n > 0, it follows that x i F i. Hence, {x i } i=1 is a sequence in the compact set K. Thus there exists a convergent subsequence {x ij } j=1 which, by Lemma (3.15), converges to x 0. 17

### Course 221: Analysis Academic year , First Semester

Course 221: Analysis Academic year 2007-08, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................

### Metric 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

### 6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )

6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a non-empty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points

### Metric 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

### Weak topologies. David Lecomte. May 23, 2006

Weak topologies David Lecomte May 3, 006 1 Preliminaries from general topology In this section, we are given a set X, a collection of topological spaces (Y i ) i I and a collection of maps (f i ) i I such

### FUNCTIONAL 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

### BANACH 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

### Course 421: Algebraic Topology Section 1: Topological Spaces

Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............

### 1 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

### Basic 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

### Metric 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

### No: 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

### Compactness in metric spaces

MATHEMATICS 3103 (Functional Analysis) YEAR 2012 2013, TERM 2 HANDOUT #2: COMPACTNESS OF METRIC SPACES Compactness in metric spaces The closed intervals [a, b] of the real line, and more generally the

### 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

### Riesz-Fredhölm Theory

Riesz-Fredhölm Theory T. Muthukumar tmk@iitk.ac.in Contents 1 Introduction 1 2 Integral Operators 1 3 Compact Operators 7 4 Fredhölm Alternative 14 Appendices 18 A Ascoli-Arzelá Result 18 B Normed Spaces

### NOTES ON MEASURE THEORY. M. Papadimitrakis Department of Mathematics University of Crete. Autumn of 2004

NOTES ON MEASURE THEORY M. Papadimitrakis Department of Mathematics University of Crete Autumn of 2004 2 Contents 1 σ-algebras 7 1.1 σ-algebras............................... 7 1.2 Generated σ-algebras.........................

### Infinite product spaces

Chapter 7 Infinite product spaces So far we have talked a lot about infinite sequences of independent random variables but we have never shown how to construct such sequences within the framework of probability/measure

### Chapter 1. Metric Spaces. Metric Spaces. Examples. Normed linear spaces

Chapter 1. Metric Spaces Metric Spaces MA222 David Preiss d.preiss@warwick.ac.uk Warwick University, Spring 2008/2009 Definitions. A metric on a set M is a function d : M M R such that for all x, y, z

### THE 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,

### Introduction 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.......................................

### Chap2: The Real Number System (See Royden pp40)

Chap2: The Real Number System (See Royden pp40) 1 Open and Closed Sets of Real Numbers The simplest sets of real numbers are the intervals. We define the open interval (a, b) to be the set (a, b) = {x

### Continuous first-order model theory for metric structures Lecture 2 (of 3)

Continuous first-order model theory for metric structures Lecture 2 (of 3) C. Ward Henson University of Illinois Visiting Scholar at UC Berkeley October 21, 2013 Hausdorff Institute for Mathematics, Bonn

### Sequences and Convergence in Metric Spaces

Sequences and Convergence in Metric Spaces Definition: A sequence in a set X (a sequence of elements of X) is a function s : N X. We usually denote s(n) by s n, called the n-th term of s, and write {s

### Convex 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

### Duality 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

### Mathematical 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.............................

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### 2.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

### 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.

### SOLUTIONS 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

### REAL ANALYSIS I HOMEWORK 2

REAL ANALYSIS I HOMEWORK 2 CİHAN BAHRAN The questions are from Stein and Shakarchi s text, Chapter 1. 1. Prove that the Cantor set C constructed in the text is totally disconnected and perfect. In other

### Polish spaces and standard Borel spaces

APPENDIX A Polish spaces and standard Borel spaces We present here the basic theory of Polish spaces and standard Borel spaces. Standard references for this material are the books [143, 231]. A.1. Polish

### 1. 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

### Math 225A, Differential Topology: Homework 3

Math 225A, Differential Topology: Homework 3 Ian Coley October 17, 2013 Problem 1.4.7. Suppose that y is a regular value of f : X Y, where X is compact and dim X = dim Y. Show that f 1 (y) is a finite

### Mathematics 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

### Ri and. i=1. S i N. and. R R i

The subset R of R n is a closed rectangle if there are n non-empty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### Lecture 1-1,2. Definition. Sets A and B have the same cardinality if there is an invertible function f : A B.

Topology Summary This is a summary of the results discussed in lectures. These notes will be gradually growing as the time passes by. Most of the time proofs will not be given. You are supposed to be able

### ON FIBER DIAMETERS OF CONTINUOUS MAPS

ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there

### CHAPTER 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

### Topology and Convergence by: Daniel Glasscock, May 2012

Topology and Convergence by: Daniel Glasscock, May 2012 These notes grew out of a talk I gave at The Ohio State University. The primary reference is [1]. A possible error in the proof of Theorem 1 in [1]

### Undergraduate 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

### Fixed Point Theorems and Applications

Fixed Point Theorems and Applications VITTORINO PATA Dipartimento di Matematica F. Brioschi Politecnico di Milano vittorino.pata@polimi.it Contents Preface 2 Notation 3 1. FIXED POINT THEOREMS 5 The Banach

### THE 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

### Notes on weak convergence (MAT Spring 2006)

Notes on weak convergence (MAT4380 - Spring 2006) Kenneth H. Karlsen (CMA) February 2, 2006 1 Weak convergence In what follows, let denote an open, bounded, smooth subset of R N with N 2. We assume 1 p

### FIBER 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

### Fixed 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

### Structure of Measurable Sets

Structure of Measurable Sets In these notes we discuss the structure of Lebesgue measurable subsets of R from several different points of view. Along the way, we will see several alternative characterizations

### Cylinder Maps and the Schwarzian

Cylinder Maps and the Schwarzian John Milnor Stony Brook University (www.math.sunysb.edu) Bremen June 16, 2008 Cylinder Maps 1 work with Araceli Bonifant Let C denote the cylinder (R/Z) I. (.5, 1) fixed

### Geometry 2: Remedial topology

Geometry 2: Remedial topology Rules: You may choose to solve only hard exercises (marked with!, * and **) or ordinary ones (marked with! or unmarked), or both, if you want to have extra problems. To have

### {f 1 (U), U F} is an open cover of A. Since A is compact there is a finite subcover of A, {f 1 (U 1 ),...,f 1 (U n )}, {U 1,...

44 CHAPTER 4. CONTINUOUS FUNCTIONS In Calculus we often use arithmetic operations to generate new continuous functions from old ones. In a general metric space we don t have arithmetic, but much of it

### Problem Set. Problem Set #2. Math 5322, Fall December 3, 2001 ANSWERS

Problem Set Problem Set #2 Math 5322, Fall 2001 December 3, 2001 ANSWERS i Problem 1. [Problem 18, page 32] Let A P(X) be an algebra, A σ the collection of countable unions of sets in A, and A σδ the collection

### BOREL SETS, WELL-ORDERINGS OF R AND THE CONTINUUM HYPOTHESIS. Proof. We shall define inductively a decreasing sequence of infinite subsets of N

BOREL SETS, WELL-ORDERINGS OF R AND THE CONTINUUM HYPOTHESIS SIMON THOMAS 1. The Finite Basis Problem Definition 1.1. Let C be a class of structures. Then a basis for C is a collection B C such that for

### Chapter 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

### Limits and convergence.

Chapter 2 Limits and convergence. 2.1 Limit points of a set of real numbers 2.1.1 Limit points of a set. DEFINITION: A point x R is a limit point of a set E R if for all ε > 0 the set (x ε,x + ε) E is

### Fixed 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

### If the sets {A i } are pairwise disjoint, then µ( i=1 A i) =

Note: A standing homework assignment for students in MAT1501 is: let me know about any mistakes, misprints, ambiguities etc that you find in these notes. 1. measures and measurable sets If X is a set,

### 4. 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,

### Math 317 HW #7 Solutions

Math 17 HW #7 Solutions 1. Exercise..5. Decide which of the following sets are compact. For those that are not compact, show how Definition..1 breaks down. In other words, give an example of a sequence

### ON A GLOBALIZATION PROPERTY

APPLICATIONES MATHEMATICAE 22,1 (1993), pp. 69 73 S. ROLEWICZ (Warszawa) ON A GLOBALIZATION PROPERTY Abstract. Let (X, τ) be a topological space. Let Φ be a class of realvalued functions defined on X.

### CHAPTER 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.,

### MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 4: Fourier Series and L 2 ([ π, π], µ) ( 1 π

MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 4: Fourier Series and L ([, π], µ) Square Integrable Functions Definition. Let f : [, π] R be measurable. We say that f

### Reference: 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

### SOLUTIONS 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

### INTRODUCTION 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

### FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 3. BANACH SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 3. BANACH SPACES CHRISTOPHER HEIL 1. Elementary Properties and Examples Notation 1.1. Throughout, F will denote either the real line R or the complex plane C.

### Separation 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

### ON 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

### Notes V General Equilibrium: Positive Theory. 1 Walrasian Equilibrium and Excess Demand

Notes V General Equilibrium: Positive Theory In this lecture we go on considering a general equilibrium model of a private ownership economy. In contrast to the Notes IV, we focus on positive issues such

### The 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,

University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible

### MEASURE 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

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### Some other convex-valued selection theorems 147 (2) Every lower semicontinuous mapping F : X! IR such that for every x 2 X, F (x) is either convex and

PART B: RESULTS x1. CHARACTERIZATION OF NORMALITY- TYPE PROPERTIES 1. Some other convex-valued selection theorems In this section all multivalued mappings are assumed to have convex values in some Banach

### Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650

### 1. Periodic Fourier series. The Fourier expansion of a 2π-periodic function f is:

CONVERGENCE OF FOURIER SERIES 1. Periodic Fourier series. The Fourier expansion of a 2π-periodic function f is: with coefficients given by: a n = 1 π f(x) a 0 2 + a n cos(nx) + b n sin(nx), n 1 f(x) cos(nx)dx

### Point 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.

### PSEUDOARCS, 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

### Fixed Point Theory. With 14 Illustrations. %1 Springer

Andrzej Granas James Dugundji Fixed Point Theory With 14 Illustrations %1 Springer Contents Preface vii 0. Introduction 1 1. Fixed Point Spaces 1 2. Forming New Fixed Point Spaces from Old 3 3. Topological

### Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

### k=1 k2, and therefore f(m + 1) = f(m) + (m + 1) 2 =

Math 104: Introduction to Analysis SOLUTIONS Alexander Givental HOMEWORK 1 1.1. Prove that 1 2 +2 2 + +n 2 = 1 n(n+1)(2n+1) for all n N. 6 Put f(n) = n(n + 1)(2n + 1)/6. Then f(1) = 1, i.e the theorem

### Math 563 Measure Theory Project 1 (Funky Functions Group) Luis Zerón, Sergey Dyachenko

Math 563 Measure Theory Project (Funky Functions Group) Luis Zerón, Sergey Dyachenko 34 Let C and C be any two Cantor sets (constructed in Exercise 3) Show that there exists a function F: [,] [,] with

### Shape 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

### MATH41112/61112 Ergodic Theory Lecture Measure spaces

8. Measure spaces 8.1 Background In Lecture 1 we remarked that ergodic theory is the study of the qualitative distributional properties of typical orbits of a dynamical system and that these properties

### Chapter 6 SEQUENCES. sn 1+1,s 1 =1 is again an abbreviation for the sequence { 1, 1 2, 1 } n N ε,d (s n,s) <ε.

Chapter 6 SEQUENCES 6.1 Sequences A sequence is a function whose domain is the set of natural numbers N. If s is a sequence, we usually denote its value at n by s n instead of s (n). We may refer to the

### 0 <β 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(Ω),

### F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

### Finite 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

### (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

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### 1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

### FIXED POINT SETS OF FIBER-PRESERVING MAPS

FIXED POINT SETS OF FIBER-PRESERVING MAPS Robert F. Brown Department of Mathematics University of California Los Angeles, CA 90095 e-mail: rfb@math.ucla.edu Christina L. Soderlund Department of Mathematics

### 1. Sigma algebras. Let A be a collection of subsets of some fixed set Ω. It is called a σ -algebra with the unit element Ω if. lim sup. j E j = E.

Real Analysis, course outline Denis Labutin 1 Measure theory I 1. Sigma algebras. Let A be a collection of subsets of some fixed set Ω. It is called a σ -algebra with the unit element Ω if (a), Ω A ; (b)

### INDISTINGUISHABILITY 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

### On linear isometries on non-archimedean power series spaces

On linear isometries on non-archimedean power series spaces Wies law Śliwa and Agnieszka Ziemkowska Abstract. The non-archimedean power series spaces A p (a, t) are the most known and important examples