Construction of functions with the given cluster sets


 Richard Parsons
 2 years ago
 Views:
Transcription
1 arxiv: v1 [math.gn] 23 Feb 2016 Construction of functions with the given cluster sets Oleksandr V. Maslyuchenko Instytute of Mathematics Academia Pomeraniensis in Słupsk Słupsk, Poland Denys P. Onypa Department of Mathematical Analysis Chernivtsi National University Chernivtsi, Ukraine Abstract In this paper we continue our research of functions on the boundary of their domain and obtain some results on cluster sets of functions between topological spaces. In particular, we prove that for a metrizable topological space X, a dense subspace Y of a metrizable compact space Y, a closed nowhere dense subset L of X, an upper continuous compactvalued multifunction Φ : L Y and a set D X \L such that L D, there exists a function f : D Y such that the cluster set f(x) is equal to Φ(x) for any x L. 1 Introduction The notion of a cluster set was first formulated by Painleve [1] in the study of analytic functions of a complex variable. A fundamental research of cluster sets of analytic functions was carried out in [2]. Actually, the notion of cluster sets is a topological notion which characterizes a behavior of a function on the boundary of the domain of this function. The oscillation [3] is 2015 Mathematics Subject Classification: Primary 54C30; Secondary 54C10. Key words and phrases: cluster set, locally connected space. 1
2 2 O. Maslyuchenko and D. Onypa another limit characteristic of functions which is tightly connected with the notion of cluster sets. Namely, the oscillation is the diameter of the cluster set. The problem of the construction of functions with the given oscillation was investigated in [3, 4, 5, 6, 7, 8, 9, 10]. In [11] we researched the question on the limit oscillation of locally stable functions defined on open subsets of reals. In [12] we proved that for any upper semicontinuous function f : F [0;+ ], which is defined on the boundary F = G\G of some open subset G of a metrizable space X, there is a continuous function g : G R such that the oscillation ω g (x) is equal to f(x) for x F. In this paper we deal with the question about the construction of functions with the given cluster sets. Let F be a multifunction from X to Y. Recall, that the domain of F is domf = {x X : F(x) }. In the case when domf = D we write F : D Y. The graph grf of F is a subset of X Y which is defined by grf = {x} F(x). x X So, we have that domf is the projection of grf on X. Definition 1.1. LetX andy be topological spaces,d X andf : D Y. The cluster set of f at a point x X is called f(x) = U U x f(u D), where U x denotes the collection of all neighborhoods of x in X. The corresponding multifunction f we call the cluster multifunction of f. It is not hard to show that the graph grf of the cluster multifunction f is the closure of the graph grf of f. In general, D = domf domf D. Let Y be a compact space. By the Kuratowski theorem [13] the projection on X of any closed subset of X Y is closed in X. So, the domain of f is a closed subset of X as the projection of grf = grf. Then domf = D. It is easy to prove that f is continuous if and only if f(x) = {f(x)} for any x D. Moreover, if Y is a metric compact, then the oscillation ω f (x) of f at a point x D is equal to the diameter diam f(x) of the cluster set f(x). So, we deal with the following problem.
3 Construction of functions with given cluster sets 3 Problem 1.2. Let X be a topological space and Y be a dense subspace of a compact space Y, D X and L D \ D. Describe all multifunctions Φ : L Y such that there exists a function f : D Y with f(x) = Φ(x) for any x L. Proposition 3.2 and Theorem 4.3 give an answer on this problem in the case when X and Y are metrizable spaces and L is a closed nowhere dense subset of X. 2 σdiscrete sets Definition 2.1. A subset S of a space X is called discrete if for any x S there exists a neighborhood U of x in X such that U S = {x}; an εnet if for any x X there exists y S such that d(x,y) < ǫ; εseparated if s t X ε for any different points s,t S; separated if it is εseparated for some ε > 0; σdiscrete if there exists a sequence of discrete sets S n such that S = S n. Proposition 2.2. Let X be a metrizable space and ε > 0. Then there exists an εseparated εnet S in X. Proof. Since the εseparability is a property of finite character, using the TeichmüllerTukey lemma [13, p.8] we build a maximal εseparated set S. Then the maximality of S implies that S is an εnet. Proposition 2.3. Let X be a metrizable space. Then there exist separated sets A n such that A = A n is a dense subset of X. In particular, the set A is σdiscrete and dense in X. Proof. Using Proposition 2.2 we pick an 1separated 1net A n n n for any n and put A = A n. Obviously, the set A is dense. Since every separated set is discrete, then A is σdiscrete as a union of separated sets.
4 4 O. Maslyuchenko and D. Onypa Proposition 2.4. Let X be a metrizable space and S X. Then the following statements are equivalent: (i) S is σdiscrete; (ii) there exists a sequence of separated sets S n such that S = (iii) for any infinitesimal sequence of positive numbers ε n there exists a sequence of sets S n such that S n is ε n separated for any n and S = S n ; (iv) there exists a sequence of closed discrete sets S n in X such that S = S n. Proof. Prove that (i) implies (ii). Since S is σdiscrete, there is a sequence of discrete sets A n such that S = A n. Using Proposition 2.3 we pick separated setsa n,m such that m=1 S n ; A n,m is dense ina n. AsA n is a discrete set, so every dense set in it equals A n. Therefore, we have that A n = A n,m. m=1 Renumber N 2 = {(n k,m k ) : k N}. Put B k = A nk,m k and S k = B k \ B j j<k for any k N. The sequence (S k ) is desired. Prove that (ii) implies (iii). Let S = T n, where T n is δ n separated. Fix an infinitesimal sequence of positive numbers ε n. Since ε n 0, there is n 1 such that ε n1 < δ 1. Analogically there is n 2 > n 1 such that ε n2 < δ 2. Continuing the process we have that for any k N there is n k > n k 1 such that ε nk < δ k. Thus, the set T k is ε nk separated. Finally, put S n = T k if n = n k for some k N and S n = otherwise. Obviously, (iii) implies (iv), because every separated set is closed. The implication (iv) (i) is clear. Proposition 2.5. Let X and Y be metrizable spaces, Y be compact, M X Y be a σdiscrete set. Then a projection pr X M is σdiscrete. Proof. According to Proposition 2.4 we have that every σdiscrete set is a union of closed discrete sets. Thus, it is enough to show that projection of closed discrete set is closed and discrete. Let M be a closed discrete subset of X. Show that pr X M = S is closed and discrete. Let M be some subset of M. Since M is discrete and closed, the set M is closed in X Y. By the Kuratowski theorem [13, Theorem ] we conclude that S = pr X M is closed in X. Therefore, all subsets of S is closed in X. Thus, we have that S is closed and discrete.
5 Construction of functions with given cluster sets 5 3 Cluster sets of a function with a discrete domain For a metric space (X,d), a point a X, a nonempty set A X and ε > 0 we denote d(a, A) = inf d(a,x) and x A B(a,ε) = {x X : d(x,a) < ε}, B[a,ε] = {x X : d(x,a) ε}, B(A,ε) = {x X : d(x,a) < ε}, B[A,ε] = {x X : d(x,a) ε}. We also use more exact notations: B X (a,ε), B X (A,ε), B X [a,ε], B X [A,ε]. Proposition 3.1. Let X be a metrizable space, F be a nonempty closed subset of X, A be separable subset of X such that F A. Then there exist a sequence of points x n A such that F is equal to the set {x m : m n} of all limit points of (x n ). Proof. Without loss of generality we may assume that X = A. So, X is a separable metrizable space. Then by [13, Theorem 4.3.5] we can choose a totally bounded metric on X. Let S k be a finite 1 net in X. Pick s S 2k k. Since A is dense in X, there is a s A such that d(x,a s ) < 1. Put 2k A k = {a s : s S k }. Then A k is a finite 1 net in X. Consider finite sets k B k = A k B(F, 1 ). Let k B 1 = {x 1,...,x n1 },B 2 = {x n1 +1,...,x n2 },...,B k = {x nk 1 +1,...,x nk },... Show that the sequence (x n ) is desired. Since {x m : m > n k } = {x m : m > n k } B[F, 1 ]. So, k B j j>k B(F, 1 ), we have that k m=1 {x n : n m} = {x n : n n k } k=1 B[F, 1] = F. k Let x F. Then there exists y k A k such that d(x,y k ) < 1 k. Thus, y k A k B(F, 1 k ) = B k. Then there exists m k such that n k 1 < m k n k and y k = x mk. Therefore, (y k ) is a subsequence of (x n ) and y k x. So, x is a limit point of x n. Recall, that a multifunction Φ : X Y is called upper continuous if for any point x X and for any open set V with Φ(x) V there exists a neighborhood U of x in X with Φ(U) V. k=1
6 6 O. Maslyuchenko and D. Onypa Proposition 3.2. Let X be a topological space, Y be a compact, D X and f : D Y. Then f : D Y is an upper continuous compactvalued multifunction. Proof. For any x D we have that f(x) = f(u). So, f(x) is a closed U U x subset of a compact space Y. Therefore, f(x) is compact. Prove that f is upper continuous. Let x 0 D and let V be an open neighborhood of f(x 0 ). Put F = {f(u D) : U is a neighborhood of x 0 }. Then f(x 0 ) = F V. Since Y is compact, there exist F 1,F 2,...,F n F n such that F k V. Choose U k U x0 such that F k = f(u k ). Put U 0 = int n n k=1 k=1 k=1 U k. Then U 0 is a neighborhood of x 0 and f(u 0 D) n F k V. Therefore, for any x U 0 D we have that f(x) = f(u 0 ) V. So, f is upper continuous at x 0. k=1 f(u k ) = U U x f(u) Theorem 3.3. Let X be a metrizable space, Y be a dense subset of a metrizable compact Y, L be a closed nowhere dense subset of X, D = X \L and Φ : L Y be an upper continuous compactvalued multifunction. Then there is a set A such that A is discrete in D, A\A = L, and there exists a function f : A Y, such that f(x) = Φ(x) for any x L. Proof. Using Proposition 2.3 for a metrizable space grf we conclude that there exists a σdiscrete set M, which is dense in grf. Then M is σdiscrete in X Y too. By Proposition 2.5 we have that the projection S = pr X M is σdiscrete in X. Furthermore, L = pr X grφ pr X M pr X M = S. Then S is a dense subset of L. By Theorem 2.4 there exists a sequence of 3 separated sets S n n such that S = S n. Set T n = S m for any n N. Now we construct families of points x s,k and y s,k where s S, k N, satisfying the following conditions: (1) x s,k D for any s S and k N; m<n (2) d(x s,k,s) < 1 n for any n N,s S n and k N; (3) x s,k s as k for any s S;
7 Construction of functions with given cluster sets 7 (4) x s,k x t,j if (s,k) (t,j); (5) y s,k Y for any s S and k N; (6) Φ(s) is the set of limit points of sequence (y s,k ) k=1 for any s S; (7) d(y s,k,φ(s)) < 1 n for any n N,s S n and k N. Fix s S 1 and put D s = B(s,1) D. Since D = X, s D s. Thus, s D s \D s. Therefore, there exists a sequence of different points x s,k D s, that tends to s. So, we have that conditions (1) (3) hold. Since a family of balls (B(s,1)) s S1 is discrete, then a family of sets (D s ) s S1 is discrete too. Thus, the condition (4) holds. Assume that points x s,k are constructed for some number n > 1 and for any s T n and k N, so that conditions (1) (4) hold. Fix s S n and put D s = B(s, 1 n ) D \{x t,j : t T n,j N}. Prove that s D s. Let A t = {x t,j : j N} for any t T n. Since x t,j t, A t = A t {t}. So s / A t for any t T n. For any m < n a family of balls (B(t, 1 )) m t S m is discrete. Besides, by the condition (2) we have that A t B(t, 1) if m < n and t S m m. Then a family (A t ) t Sm is discrete as m < n. Since T n = S m, we have that a family (A t ) t Tn is locally finite. m<n In this case, A t = A t s. t T n t T n So, a set U = X \ t T n A t = X \{x t,j : t T n,j N} is a neighborhood of s. Since D = X, s B(s, 1 n ) D. Thus, s B(s, 1 n ) D U = D s. Next, taking into account that s / D s, we have that s D s \ D s. Therefore, there exists a sequence of different points x s,k D s that tends to s. So, the conditions (1) (3) hold. Besides, x s,k x t,j as t T n, k,j N. Since a family of balls (B(s, 1 n )) s S n is discrete, we have that a family (D s ) s Sn is discrete too. Therefore, the condition (4) holds. Construct points y s,k. Fix n N and s S n. A set B Y (Φ(s), 1 n ) is an open neighborhood of a set Φ(s) in Y and Y is dense in Y. Then for a set Y s = B Y (Φ(s), 1 n ) we have that Y s = B Y (Φ(s), 1 n ) Y. Then Φ(s) Y s.
8 8 O. Maslyuchenko and D. Onypa Since every metrizable compact is a hereditarily separable, we have that the set Y s is separable. Using Proposition 3.1 with F = Φ(s) and A = Y s we conclude that there exists a sequence of points y s,k Y s such that Φ(s) is the set of limit points of (y s,k ) k=1. Therefore, the conditions (5) (7) hold. Put A = {x s,k : s S,k N} and check that A \ A = L. Firstly, by (3) we have that S A. Thus, L = S A. Secondly, by (1) we have that L A =. Thus, L A\A. Prove inverse inclusion. For any s S put A s = {x s,k : k N}. By (3) we have that A s = A s {s}. Since a family of balls (B(s, 1)) n s S n is discrete, a family (A s ) s Sn is discrete too. So, A s = A s = (A s {s}) = S n ( A s ) for every number n. s S n s S n s S n s S n Besides, by (2) we have that for any m n and s S m we have an inclusion A s B(s, 1) B[L, 1]. Hence, A m n s B[L, 1 ] for any number n. n m ns S m So, A = A s A s = A s A s m<n s S m m n s S m m<n s S m m n s S m (S m A s ) B[L, 1] B[L, 1] A. n n m<n s S m Therefore, A\A B[L, 1 ] for any n. Hence, A\A B[L, 1 ] = L. n n Define a function f : A Y by f(x s,k ) = y s,k for s S and k N and show that f is desired. Fix s 0 L and find out that f(s 0 ) = Φ(s 0 ). Prove that f(s 0 ) Φ(s 0 ). Pick ε > 0 and show that f(s 0 ) B(Φ(s 0 ),2ε). Since Φ is upper continuous, then there exists a neighborhood U 0 of s 0 X such that (8) Φ(U 0 L) B(Φ(s 0 ),ε). Choose δ > 0 such that B(s 0,2δ) U 0 and find a number n 0 such that 1 n 0 < δ and 1 n 0 < ε. Put U 1 = B(s 0,δ) and prove that (9) d(f(x),φ(s 0 )) < 2ε as x (A\T n0 ) U 1. Let x A\T n0 = S n such that x U 1. Then x = x s,k for some n n 0, n n 0 k N and s S n. Since x s,k U 1, then d(x s,k,s 0 ) < δ. Next, by (2) we have that d(x s,k,s) < 1 1 n n 0 < δ. Thus, d(s 0,s) < 2δ. So, s B(s 0,2δ) U 0. Therefore, s U 0 L. By (8) we have that Φ(s) B(Φ(s 0 ),ε). But f(x) = y s,k. By (7) we have that d(f(x),φ(s)) = d(y s,k,φ(s)) < 1 1 n n 0 < ε.
9 Construction of functions with given cluster sets 9 Thus, there is y Φ(s) such that d(f(x),y)) < ε. But d(y,φ(s 0 )) < ε, because y Φ(s) B(Φ(x 0 ),ε). Therefore, d(f(x),φ(s 0 )) < 2ε. So, (9) holds. As was remarked previously, (A s ) s Tn0 is a locally finite. Besides, by (3) we have that A s = A s {s}. Thus, by (4) we have that (A s ) s Tn0 is disjoint. So, we have that (A s ) s Tn0 is discrete. Let us show that there is a neighborhood U 2 U 1 of a point s 0 X such that (10) d(f(x),φ(s 0 )) < 2ε as x T n0 U 2. Firstly, consider the case when s 0 / T n0. Then for any t T n0 we have that s 0 / {t} A t = A t. Thus, s 0 / A t = A t. Then there is a t T n0 t T n0 neighborhood U 2 of s 0 such that U 2 A t = as t T n0. Therefore, the condition (10) holds. Now consider the case when s 0 T n0. Since s 0 A s0 {s 0 } = A s0 and a family (A s ) s Tn0 is discrete, we have that there is a neighborhood U 3 U 1 of a point s 0 such that U 3 A s = as s T n0 \{s 0 }. Next, by (6) we have that Φ(s 0 ) is a set of limit points of a sequence (y s0,k) k=1. Thus, there is k 0 N such that (11) d(y s0,k,φ(s 0 )) < 2ε for any k k 0. Put U 2 = U 3 \ {x s0,k : k < k 0 }. Then we have that U 2 T n0 {x s0,k : k k 0 }. Thus, (10) implies (11). Therefore, there is a neighborhood U 2 U 1 of s 0 such that a condition (10) hold. Thus, by (9) and (10) we have that d(f(x),φ(s 0 )) < 2ε as x A U 2. So f(a U 2 ) B(Φ(s 0 ),2ε). Hence, we have that f(s 0 ) = U U s0 f(a U) f(a U 2 ) B[Φ(s 0 ),2ε] for any ε > 0. Since Φ(s 0 ) is closed, we have that f(s 0 ) B[Φ(s 0 ),2ε] = Φ(s 0 ). ε>0 Let us find out that Φ(s 0 ) f(s 0 ). It is sufficient to show that Φ(s 0 ) f(u A) for any open neighborhood U of s 0. Fix some open neighborhood U 0 of s 0 and a point y 0 Φ(s 0 ). Show that y 0 f(u 0 A). Pick an open neighborhood V 0 of y 0 and show that V 0 f(u 0 A). Since (s 0,y 0 ) grφ = M, (U 0 V 0 ) M. Thus, there is a point
10 10 O. Maslyuchenko and D. Onypa (s,y) M (U 0 V 0 ). Then s pr X M = S, s U 0 and y Φ(s) V 0. Next, by (3) we have that there exists k 0 N such that x s,k U 0 as k k 0. By (6) we have that y is a limit point of a sequence (y s,k ) k=1. Thus, there exists k k 0 such that y s,k V 0. So, we have that x s,k U 0 A and f(x s,k ) = y s,k V 0 f(u 0 A). Hence, V 0 f(u A), and thus, y 0 f(u 0 A). 4 The main result Lemma 4.1. Let X be a metrizable topological space, Y be a dense subspace of a metrizable compact space Y, L be a closed nowhere dense subset of X, Φ : L Y be an upper continuous compactvalued multifunction and D X \L such that L D. Then there exists a function f : D Y such that f(x) Φ(x). Proof. Let x D and r(x) = d(x,l) = inf d(x,y) > 0. Then there exists y L h(x) L such that d(x,h(x)) < 2r(x). Since Y is dense in Y, there is a point f(x) B Y (Φ(h(x)),r(x)) Y. Let us show that f : D Y is desired. Let a L, ε > 0 and V = B Y (Φ(a), ε ). Since Φ is upper continuous, 2 then there is δ > 0 such that δ < ε and for a neighborhood U 0 = B X (a,δ) we have that Φ(U 0 L) V. Let U 1 = B X (a, δ). Pick x U 3 1 D. Then r(x) = d(x,l) d(x,a) < δ 2δ. Therefore, d(x,h(x)) < 2r(x) <. Thus, 3 3 d(a,h(x)) < d(a,x) + d(x,h(x)) < δ + 2δ = δ. Hence, h(x) U Besides, r(x) < δ < ε < ε. Thus, f(x) B Y (Φ(h(x)),r(x)) B Y (Φ(h(x)), ε). 2 Therefore, there exists y Φ(h(x)) such that d(f(x),y) < ε. Next, 2 y Φ(h(x)) Φ(U 0 D) V = B Y (Φ(a), ε ). Then there exists 2 z Φ(a) such that d(y,z) < ε. In this case, we have that d(f(x),z) < 2 d(f(x),y) + d(y,z) < ε. Thus, f(x) B Y (Φ(a),ε) for any x U 1 D. Hence, f(u 1 D) B Y (Φ(a),ε) B Y [Φ(a),ε]. Thus, f(a) = {f(u D) : U U a } f(u 1 D) B Y [Φ(a),ε] for any ε > 0. Therefore, f(a) B Y [Φ(a),ε] = Φ(a), because a set Φ(a) is closed. ε>0 Lemma 4.2. Let (M, ) be a directed set, (A m ) m M and (B m ) m M be decreasing sequences of sets. Then (A m B m ) ( A m ) ( B m ). Proof. Let x m M m M m M m M (A m B m ). Then for any m M we have that x A m B m. That is x A m or x B m. Let K = {k M : x A k } and L = M \K. Then for any l L we have that x B l.
11 Construction of functions with given cluster sets 11 Assume that K is cofinal. Then for any m M there is k K such that m k. If m M then m k for some k M and thus, x A k A m. Therefore, x A m for any m. Thus, x A m. Let K is not cofinal. Then m M there exists m 0 M such that for any k K we have that m 0 k. ( ) Check that a set L is cofinal. Pick m M. Since M is a directed set, there exists l M such that l m and l m 0. Then by ( ) we have that l / K. That is l M \K = L. So, L is cofinal. If m M then there exists l L such that m l and thus, x B l B m. Therefore, x B m. m M Theorem 4.3. Let X be a metrizable topological space, Y be a dense subspace of a metrizable compact space Y, L be a closed nowhere dense subset of X, Φ : L Y be an upper continuous compactvalued multifunction and D X \L such L D. Then there exists a function f : D Y such that f(x) = Φ(x) for any x L. Proof. By Theorem 3.3 we have that there exists a closed discrete set D 1 D and a functionf 1 : D 1 Y such thatd 1 \D 1 = L andf 1 (x) = Φ(x) as x L. Put D 2 = D \ D 1, L 2 = D 2 L and Φ 2 = Φ L2. Obviously, that L 2 is closed and nowhere dense and Φ 2 is an upper continuous compactvalued multifunction, moreover L 2 D 2. Thus, by Lemma 4.1 there exists a function f 2 : D 2 Y such that f 2 (x) Φ 2 (x) = Φ(x) as x L 2. Define a function f : D Y as follows: f(x) = { f1 (x), if x D 1, f 2 (x), if x D 2 ; for any x D = D 1 D 2. Check that f is desired. Fix x 0 D and show that f(x 0 ) = Φ(x 0 ). Firstly, let us find out that f(x 0 ) Φ(x 0 ). Indeed, taking into account that x 0 L D 1 and D 1 D we have that f(x 0 ) = {f(u D) : U U x0 } {f(u D 1 ) : U U x0 } = {f 1 (U D 1 ) : U U x0 } = f 1 (x 0 ) = Φ(x 0 ). Check that f(x 0 ) Φ(x 0 ). Consider the case when x 0 L\L 2. In this case we have that x 0 / D 2. Thus, there exists a neighborhood U 0 of x 0 such that U 0 D 2 =. Then for U U 0 we have that U D = U D 1. Therefore, f(x 0 ) = {f(u D) : U U x0 } = {f(u D) : U U 0,U U x0 }
12 12 O. Maslyuchenko and D. Onypa = {f(u D 1 ) : U U 0,U U x0 } = {f 1 (U D) : U U x0 } = f 1 (x 0 ) = Φ(x 0 ). Let x 0 L 2. Using Lemma 4.2 for a directed set (M, ) = (U x0, ), decreasing families A U = f(u D 1 ) and B U = f(u D 2 ), where U U x0, we have that f(x 0 ) = {f(u D) : U U x0 } = {f(u D 1 ) f(u D 2 ) : U U x0 } {f(u D 1 ) : U U x0 } {f(u D 2 ) : U U x0 } = {f 1 (U D 1 ) : U U x0 } {f 2 (U D 2 ) : U U x0 } = f 1 (x 0 ) f 2 (x 0 ) Φ(x 0 ). References [1] P. Painleve, Lecons sur la theorie analytique des equations differentielles professees a Stockholm 1895, Paris, [2] E. F. Collingwood and A. J. Lohwater, The theory of cluster sets, Cambridge Univ. Press, Cambridge, [3] P. Kostyrko Some properties of oscillation, Math. Slovaca 30 (1980), [4] J. Ewert, S. Ponomarev, On the existance of ωprimitives on arbitrary metric spaces, Math. Slovaca 53 (2003), [5] Z. Duszynski, Z. Grande and S. Ponomarev, On the ω primitives, Math. Slovaka 51 (2001), [6] S. Kowalczyk, The ωproblem, Diss. math. (Rozpr. mat.) 501 (2014), [7] Maslyuchenko O. V., Maslyuchenko V. K. The construction of a separately continuous function with given oscillation. Ukr. Math. J. 50 (1998), no. 7, (in Ukrainian) [8] Maslyuchenko O. V. The oscillation of quasicontinuous functions on pairwise attainable spaces // Houston Journal of Mathematics 35 (2009), no. 1,
13 Construction of functions with given cluster sets 13 [9] Maslyuchenko O. V. The construction of ωprimitives: strongly attainable spaces. Mat. Visn. Nauk. Tov. Im. Shevchenka 6 (2009), (in Ukrainian) [10] Maslyuchenko O. V. The construction of ωprimitives: the oscillation of sum of functions. Mat. Visn. Nauk. Tov. Im. Shevchenka 5 (2008), (in Ukrainian) [11] O. Maslyuchenko and D. Onypa, Limit oscillations of locally constant functions, Buk. Math. J. 1 (2013), no. 34, (in Ukrainian) [12] O. Maslyuchenko and D. Onypa, Limit oscillations of continuous functions, Carp. math. publ. (submitted for publication). [13] R. Engelking, General topology, Sigma Series in Pure Mathematics 6, Berlin, 1989.
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 nonempty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points
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 informationRi and. i=1. S i N. and. R R i
The subset R of R n is a closed rectangle if there are n nonempty 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
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 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 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 information{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
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 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 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 informationChapter 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
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 MenGen 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 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 informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationSOME TYPES OF CONVERGENCE OF SEQUENCES OF REAL VALUED FUNCTIONS
Real Analysis Exchange Vol. 28(2), 2002/2003, pp. 43 59 Ruchi Das, Department of Mathematics, Faculty of Science, The M.S. University Of Baroda, Vadodara  390002, India. email: ruchid99@yahoo.com Nikolaos
More informationCompactness 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
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 informationBOREL SETS, WELLORDERINGS OF R AND THE CONTINUUM HYPOTHESIS. Proof. We shall define inductively a decreasing sequence of infinite subsets of N
BOREL SETS, WELLORDERINGS 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
More informationCourse 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...............
More informationDegree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
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 informationx 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
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 informationTopology 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]
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 informationMath212a1010 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.
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 informationCourse 221: Analysis Academic year , First Semester
Course 221: Analysis Academic year 200708, 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................
More informationSequences 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 nth term of s, and write {s
More informationAnalytic Sets Vadim Kulikov Presentation 11 March 2008
Analytic Sets Vadim Kulikov Presentation 11 March 2008 Abstract. The continuous images of Borel sets are not usually Borel sets. However they are measurable and that is the main purpose of this lecture.
More informationSOME RESULTS ON HYPERCYCLICITY OF TUPLE OF OPERATORS. Abdelaziz Tajmouati Mohammed El berrag. 1. Introduction
italian journal of pure and applied mathematics n. 35 2015 (487 492) 487 SOME RESULTS ON HYPERCYCLICITY OF TUPLE OF OPERATORS Abdelaziz Tajmouati Mohammed El berrag Sidi Mohamed Ben Abdellah University
More informationPolish 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
More informationGeometrical Characterization of RNoperators between Locally Convex Vector Spaces
Geometrical Characterization of RNoperators between Locally Convex Vector Spaces OLEG REINOV St. Petersburg State University Dept. of Mathematics and Mechanics Universitetskii pr. 28, 198504 St, Petersburg
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS 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 the identity, such that (i) the
More informationNotes 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
More informationFuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
More informationMath 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
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 informationON A MIXED SUMDIFFERENCE EQUATION OF VOLTERRAFREDHOLM TYPE. 1. Introduction
SARAJEVO JOURNAL OF MATHEMATICS Vol.5 (17) (2009), 55 62 ON A MIXED SUMDIFFERENCE EQUATION OF VOLTERRAFREDHOLM TYPE B.. PACHPATTE Abstract. The main objective of this paper is to study some basic properties
More informationOpen and Closed Sets
Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.
More informationProf. Girardi, Math 703, Fall 2012 Homework Solutions: Homework 13. in X is Cauchy.
Homework 13 Let (X, d) and (Y, ρ) be metric spaces. Consider a function f : X Y. 13.1. Prove or give a counterexample. f preserves convergent sequences if {x n } n=1 is a convergent sequence in X then
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 informationON TOPOLOGICAL SEQUENCE ENTROPY AND CHAOTIC MAPS ON INVERSE LIMIT SPACES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXVIII, 2(1999), pp. 205 211 205 ON TOPOLOGICAL SEQUENCE ENTROPY AND CHAOTIC MAPS ON INVERSE LIMIT SPACES J. S. CANOVAS Abstract. The aim of this paper is to prove the
More informationOn Integer Additive SetIndexers of Graphs
On Integer Additive SetIndexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A setindexer of a graph G is an injective setvalued function f : V (G) 2 X such that
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 informationPSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2
PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 Abstract. We prove a BrucknerGarg type theorem for the fiber structure of a generic map from a continuum X into the unit interval I. We
More informationON 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.
More informationF. 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
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 informationSEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
More information1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
More informationResearch Article Stability Analysis for HigherOrder 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 HigherOrder Adjacent Derivative
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 informationChap2: 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
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 informationHow many miles to βx? d miles, or just one foot
How many miles to βx? d miles, or just one foot Masaru Kada Kazuo Tomoyasu Yasuo Yoshinobu Abstract It is known that the Stone Čech compactification βx of a metrizable space X is approximated by the collection
More informationAcknowledgements: I would like to thank Alekos Kechris, who told me about the problem studied here.
COMPACT METRIZABLE GROUPS ARE ISOMETRY GROUPS OF COMPACT METRIC SPACES JULIEN MELLERAY Abstract. This note is devoted to proving the following result: given a compact metrizable group G, there is a compact
More informationWeak 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
More informationProblem 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
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 informationNOTES 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.........................
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 informationDEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSIONFREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsionfree abelian groups, one of isomorphism
More informationGeometry 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
More informationChapter 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
More informationInfinite 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
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationTree sums and maximal connected Ispaces
Tree sums and maximal connected Ispaces 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 information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on realclosed fields These notes develop the algebraic background needed to understand the model theory of realclosed fields. To understand these notes, a standard graduate course in algebra is
More informationTHE ROBUSTNESS AGAINST DEPENDENCE OF NONPARAMETRIC TESTS FOR THE TWOSAMPLE LOCATION PROBLEM
APPLICATIOES MATHEMATICAE,4 (1995), pp. 469 476 P. GRZEGORZEWSKI (Warszawa) THE ROBUSTESS AGAIST DEPEDECE OF OPARAMETRIC TESTS FOR THE TWOSAMPLE LOCATIO PROBLEM Abstract. onparametric tests for the twosample
More informationTopics in weak convergence of probability measures
This version: February 24, 1999 To be cited as: M. Merkle, Topics in weak convergence of probability measures, Zb. radova Mat. Inst. Beograd, 9(17) (2000), 235274 Topics in weak convergence of probability
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 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 informationSome stability results of parameter identification in a jump diffusion model
Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss
More information1. Let X and Y be normed spaces and let T B(X, Y ).
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: NVP, Frist. 20050314 Skrivtid: 9 11.30 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationStructure 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
More informationON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More information1 Completeness of a Set of Eigenfunctions. Lecturer: Naoki Saito Scribe: Alexander Sheynis/Allen Xue. May 3, 2007. 1.1 The Neumann Boundary Condition
MAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 11: Laplacian Eigenvalue Problems for General Domains III. Completeness of a Set of Eigenfunctions and the Justification
More information1. Introduction. PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1
Publ. Mat. 45 (2001), 69 77 PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1 Bernard Coupet and Nabil Ourimi Abstract We describe the branch locus of proper holomorphic mappings between
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 informationNONMEASURABLE ALGEBRAIC SUMS OF SETS OF REALS
NONMEASURABLE ALGEBRAIC SUMS OF SETS OF REALS MARCIN KYSIAK Abstract. We present a theorem which generalizes some known theorems on the existence of nonmeasurable (in various senses) sets of the form X+Y.
More informationP NP for the Reals with various Analytic Functions
P NP for the Reals with various Analytic Functions Mihai Prunescu Abstract We show that nondeterministic machines in the sense of [BSS] defined over wide classes of real analytic structures are more powerful
More informationREAL 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
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 informationP (A) = lim P (A) = N(A)/N,
1.1 Probability, Relative Frequency and Classical Definition. Probability is the study of random or nondeterministic experiments. Suppose an experiment can be repeated any number of times, so that we
More informationFinitely Additive Dynamic Programming and Stochastic Games. Bill Sudderth University of Minnesota
Finitely Additive Dynamic Programming and Stochastic Games Bill Sudderth University of Minnesota 1 Discounted Dynamic Programming Five ingredients: S, A, r, q, β. S  state space A  set of actions q(
More informationINTRODUCTION TO DESCRIPTIVE SET THEORY
INTRODUCTION TO DESCRIPTIVE SET THEORY ANUSH TSERUNYAN Mathematicians in the early 20 th century discovered that the Axiom of Choice implied the existence of pathological subsets of the real line lacking
More informationarxiv:math/0510680v3 [math.gn] 31 Oct 2010
arxiv:math/0510680v3 [math.gn] 31 Oct 2010 MENGER S COVERING PROPERTY AND GROUPWISE DENSITY BOAZ TSABAN AND LYUBOMYR ZDOMSKYY Abstract. We establish a surprising connection between Menger s classical covering
More informationOur goal first will be to define a product measure on A 1 A 2.
1. Tensor product of measures and Fubini theorem. Let (A j, Ω j, µ j ), j = 1, 2, be two measure spaces. Recall that the new σ algebra A 1 A 2 with the unit element is the σ algebra generated by the
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
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 informationThe HenstockKurzweilStieltjes type integral for real functions on a fractal subset of the real line
The HenstockKurzweilStieltjes 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 informationk=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
More informationQuasi Contraction and Fixed Points
Available online at www.ispacs.com/jnaa Volume 2012, Year 2012 Article ID jnaa00168, 6 Pages doi:10.5899/2012/jnaa00168 Research Article Quasi Contraction and Fixed Points Mehdi Roohi 1, Mohsen Alimohammady
More informationChapter 2 Limits Functions and Sequences sequence sequence Example
Chapter Limits In the net few chapters we shall investigate several concepts from calculus, all of which are based on the notion of a limit. In the normal sequence of mathematics courses that students
More informationSome other convexvalued 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 convexvalued selection theorems In this section all multivalued mappings are assumed to have convex values in some Banach
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 information8.1 Examples, definitions, and basic properties
8 De Rham cohomology Last updated: May 21, 211. 8.1 Examples, definitions, and basic properties A kform ω Ω k (M) is closed if dω =. It is exact if there is a (k 1)form σ Ω k 1 (M) such that dσ = ω.
More information