RECURRENT ITERATED FUNCTION SYSTEMS
|
|
- Junior McCormick
- 5 years ago
- Views:
Transcription
1 RECURRENT ITERATED FUNCTION SYSTEMS ALEXANDRU MIHAIL The theory of fractal sets is an old one, but it also is a modern domain of research. One of the main source of the development of the theory of fractal sets is the discovery of a new types of fractal sets. One of the well-known examples are the attractors of iterated function systems. There are several generalization of iterated functions systems: directed-graph iterated function systems, random iterated function systems and so on. The aim of the paper is to present a generalization of iterated function systems (IFS) and of their attractors, the recurrent iterated function systems. AMS 2000 Subject Classification: 28A80. Key words: recurrent iterated function system, fractal set, Lipschitz function, contraction, autosimilar set. 1. INTRODUCTION In this section we review concepts, notation and basic results concerning iterated function systems (IFS). Details can be found in [1], [2] or [3]. Let (X, d X ) and (Y, d Y ) be two metric spaces and C(X, Y ) the set of continuous functions from X in to Y. On C(X, Y ) we will consider the generalized metric d : C(X, Y ) C(X, Y ) R + = R + {+ } defined by d(f, g) = sup d Y (f(x), g(x)). x X s For a sequence (f n ) n of elements from C(X, Y ) and f C(X, Y ), f n f u.c denotes pointwise convergence, f n f uniform convergence on compact sets, u and f n f uniform convergence (that is, convergence in the generalized metric d). For a function f : X X we denote by Lip(f) R + the Lipschitz constant associated with f, that is, Lip(f) = sup x,y X; x y d(f(x), f(y)). d(x, y) A function f is said to be a Lipschitz function if Lip(f) < + and a contraction if Lip(f) < 1. REV. ROUMAINE MATH. PURES APPL., 53 (2008), 1, 43 53
2 44 Alexandru Mihail 2 Let Con(X) = {f : X X Lip(f) < 1}. Let (X, d) be a metric space and K(X) the set of nonvoid compact subsets of X. Then K(X) with the Hausdorff-Pompeiu distance h : K(X) K(X) [0, ) defined by h(e, F ) = max(d(e, F ), d(f, E)) = min{r E B(F, r) and F B(E, r)}, where d(e, F ) = sup d(x, F ) = sup ( inf d(x, y)), is a metric space. x E x E y F (K(X), h) is a complete metric space if (X, d) is a complete metric space. (K(X), h) is compact if (X, d) is compact (see [4]). The Hausdorff-Pompeiu distance can be extended to a semidistance on P (X) with values in R + with the same definition, where P (X) is the set of nonvoid subsets of X. Concerning the Hausdorff-Pompeiu distance we have the following important properties. Proposition 1.1. Let (X, d) be a metric space, f : X X a Lipschitz function and K(X) the set of compact subsets of X. If (H i ) i I and (K i ) i I are two families of subsets of X, then 1) h( H i, K i ) = h( H i, K i ) sup h(h i, K i ); i I i I i I i I i I 2) h(f(k), f(h)) Lip(f)h(K, H) for any K, H K(X). An iterated function system, (IFS for short) consists of a metric space (X, d) and a finite family of contractions f k : X X, k {1, 2,..., n}, n N.We denote such an IFS by S = (X, (f k ) ). Its contraction constant is c S = max Lip(f k ). There are three important mathematical results concerning contractions used in the IFS theory. Theorem 1.1 (Banach Contraction Principle). Let (X, d X ) be a complete metric space and f Con(X). Then there exists a unique α X such that f(α) = α. Moreover, lim n d X(f [n] (x), α) = 0 for any x X. Theorem 1.2 (Continuity Theorem). Let (X, d X ) be a complete metric space, f, g Con(X), α the fixed point of f and β the fixed point of g. Then 1 d X (α, β) d(f, g) 1 min{lip(f), Lip(g)}. Theorem 1.3 (Collage Theorem). Let (X, d X ) be a complete metric space, f Con(X) and x X. Let α X be the unique fixed point of f.
3 3 Recurrent iterated function systems 45 Then max d X (x, α) d X(f(x), x) 1 Lip(f). With an IFS S = (X, (f k ) ) with contraction constant c S = Lip(f k ) one can associate the function F S : K(X) K(X) defined by F S (B) = n f k (B), B K(X), which is a c S -contraction. Therefore, by the Banach contraction principle, we have Theorem 1.4. Let (X, d X ) be a complete metric space and S = (X, (f k ) ) an IFS with c S = max Lip(f k ) < 1. Then there exists a unique set A(S), such that F S (A(S)) = A(S), and for every H 0 K(X) the sequence (H n ) n, where H n+1 = F S (H n ), n N, is convergent to A(S) in K(X). As for the speed of convergence we have for all n N. In particular, h(h n, A(S)) cn S 1 c S h(h 0, H 1 ), h(h 0, A(S)) 1 1 c S h(h 0, H 1 ). We also have the following result concerning the continuity of the attractor of an IFS. Theorem 1.5. Let (X, d X ) be a complete metric space and x X. Let S = (X, (f k ) ) and S = (X, (g k ) ) be two iterated function systems with contraction constants c S and c S. Then h(a(s), A(S )) max 1 d(f k, g k ) 1 min(c S, c S ). We present now the idea of our generalization. Instead of considering contractions f from X in to X in the definition of an IFS, we shall consider contractions from X 2 = X X in to X. We shall call recurrent iterated function systems (RIFS for short) this kind of iterated function systems. On X 2 we consider the distance d 2 : X 2 X 2 [0, + ) given by d 2 ((x, x 1 ), (y, y 1 )) = max{d(x, y), d(x 1, y 1 )}. Definition 1.1. Let (X, d) be a complete metric space. For a function f : X X X the number Lip(f) = d(f(x, x 1 ), f(y, y 1 )) sup x,y,x 1,y 1 X; x y or x 1 y 1 max{d(x, y), d(x 1, y 1 )} is called the Lipschitz constant of f. We have Lip(f) [0, + ].
4 46 Alexandru Mihail 4 A function f : X X X is said to be a Lipschitz function if Lip(f) < and a contraction if Lip(f) < 1. Let Con 2 (X) = {f : X X X Lip(f) < 1}. Definition 1.2. Let (X, d) be a complete metric space. A recurrent iterated function systems (RIFS for short) on X consists of a finite family of contractions (f k ), n N, with f k : X X X, and is denoted by S = (X, (f k ) ). The contraction constant of such an RIFS is c S = max Lip(f k ). 2. MAIN RESULT In this section we prove the existence of the attractor of an RIFS and also present its main properties. Definition 2.1. Let (X, d) be a metric space and f : X X X a continuous function. The function F f : K(X) K(X) K(X) defined by F f (K, H) = f(k, H) = f(k H) = {f(x, y) x K and y H} is called the set function associated with f. Let S = (X, (f k ) ) be an RIFS. The function F S : K(X) K(X) K(X) defined by F S (K, H) = n f k (K, H) is called the set function associated with S. The next result is obvious. Lemma 2.1. If (X, d X ) is a complete metric space f n, f : X X u X are continuous functions, n N, such that f n f and H, K K(X), then lim f n(h, K) = f(h, K) in K(X). n The next result is a consequence of Lemma 2.1 and Proposition 1.1. Lemma 2.2. Let (X, d X ) be a complete metric space. Let S m = (X, (fk m) ) and S = (X, (f k) ), m N, be recurrent iterated func- u f k on a dense set in X as m +, k {1, 2,..., n}, tion systems. If fk m then lim F S n n (K, H) = F S (K, H) for every H, K K(X). Lemma 2.3. Let f : X X X be a Lipschitz function. Then Lip(F f ) Lip(f). Proof. Let K, H, K 1, H 1 K(X) and r = max(h(k, K 1 ), h(h, H 1 )). Then K B(K 1, r) and H B(H 1, r). Let x K and y H. There are
5 5 Recurrent iterated function systems 47 x 1 K 1 and y 1 H 1 such that d(x, x 1 ) < r and d(y, y 1 ) < r. Then d(f(x 1, y 1 ), f(x, y)) Lip(f) max{d(x, x 1 ), d(y, y 1 )} < Lip(f)r. This means that f(x, y) B(f(x 1, y 1 ),Lip(f)r) B(f(K 1, H 1 ),Lip(f)r) which implies that f(k, H) B(f(K 1, H 1 ), Lip(f)r). In a similar way, we obtain the inclusion f(k 1, H 1 ) B(f(K, H), Lip(f)r). This means that h(f(k, H), f(k 1, H 1 )) Lip(f)r. The next result is a key one. Lemma 2.4. Let S =(X, (f k ) ) be an RIFS with c S = max Lip(f k ) < < 1. Then the set function F S : K(X) K(X) K(X) associated with S, is a c S contraction. Proof. We have ( n h(f S (K, H), F S (K 1, H 1 )) = h f k (K, H), ) f k (K 1, H 1 ) maxh(f k (K, H), f k (K 1, H 1 )) c S max(h(k, K 1 ), h(h, H 1 )). For a contraction of type f : X X X we have results similar to those of type f : X X. We shall sketch the proof and present some applications. Theorem 2.1 (Banach Contraction Principle). Let (X, d) be a complete metric space and f Con 2 (X) with contractivity factor c [0, 1). Then there exists a unique α X such that f(α, α) = α. Moreover, for any x 0, x 1 X the sequence (x n ) n 0 defined by x n+1 = f(x n, x n 1 ), n N, is convergent to α. As for the speed of convergence of (x n ) n 0 we have In particular, d(x n, α) 2c[n/2] 1 c max{d(x 0, x 1 ), d(x 1, x 2 )}. d(x 0, α) 2 1 c max{d(x 0, x 1 ), d(x 1, x 2 )}. Proof. Let z n = max{d(x n+1, x n ), d(x n, x n 1 )}. We have d(x n+1, x n ) = d(f(x n, x n 1 ), f(x n 1, x n 2 )) c max{d(x n 1, x n 2 ), d(x n, x n 1 )} = cz n 1 and d(x n+2, x n+1 ) = d(f(x n+1, x n ), f(x n, x n 1 )) c max{d(x n+1, x n ), d(x n, x n 1 )} c max{cz n 1, z n 1 } = cz n 1. Then z n+1 cz n 1. It follows that d(x n+1, x n ) c [n/2] z 1
6 48 Alexandru Mihail 6 and d(x n+p, x n ) d(x n+p, x n+p 1 ) + d(x n+p 1, x n+p 2 ) + + d(x n+1, x n ) hence c [(n+p 1)/2] z 1 + c [(n+p 2)/2] z c [n/2] z 1, d(x n+p, x n ) 2c[n/2] z 1 1 c for every p N. The rest of the proof goes in the same manner as that for the Banach contraction principle. Using Lemma 2.4 in the case of an RIFS, Theorem 2.1 becomes Theorem 2.2. Let (X, d X ) be a complete metric space and S = (X, (f k ) ) an RIFS with contraction constant c S = max Lip(f k ) < 1. Then there exists a unique A(S) K(X) such that F S (A(S), A(S)) = A(S). Moreover, for any H 0, H 1 K(X), the sequence (H n ) n 1 defined by H n+1 = F S (H n, H n 1 ), n N, is convergent to A(S). As for the speed of convergence we have h(h n, A(S)) 2c[n/2] S max{h(h 0, H 1 ), h(h 2, H 1 )}. 1 c S In particular (Collage Theorem), h(h 0, A(S)) 2 1 c S max{h(h 0, H 1 ), h(h 2, H 1 )}. We remark that A(S) = f k (A(S), A(S)) = = x A(S) f k (A(S), {x}) = x A(S) x,y A(S) f k ({x}, A(S)) = f k ({x}, {y}). Theorem 2.3 (Continuity Theorem). Let (X, d X ) be a complete metric space and f, g Con 2 (X) with fixed points α and β and contraction constants c f and c g. Then d X (α, β) min { 1 1 c f d X (f(β, β), g(β, β)), 1 d(f, g). 1 min(c f, c g ) 1 } d X (f(α, α), g(α, α)) 1 c g
7 7 Recurrent iterated function systems 49 Proof. We have d X (α, β) = d X (f(α, α), g(β, β)) d X (f(α, α), f(β, β)) + d X (f(β, β), g(β, β)) whence Similarly, we have c f d X (α, β) + d X (f(β, β), g(β, β)) c f d X (α, β) + d(f, g), d X (α, β) 1 1 c f d X (f(β, β), g(β, β)) 1 1 c f d(f, g). d X (α, β) 1 1 c g d X (f(α, α), g(α, α)) 1 1 c g d(f, g) and the conclusion follows. Using Lemma 2.4 in the case of an RIFS, Theorem 2.3 becomes Theorem 2.4 (Continuity Theorem). Let (X, d X ) be a complete metric space, and S = (X, (f k ) ) and S = (X, (g k ) ) be two RIFS with c = max Lip(f k ) < 1 and c = max Lip(g k ) < 1. Then h(a(s), A(S )) 1 1 min(c, c ) max d(f k, g k ). Another version of the continuity theorem is Theorem 2.5. Let (X, d X ) be a complete metric space and a function f : X X X. Let us consider f n Con 2 (X), where n N, with fixed point s α n. Assume c = sup c fn < 1, where c fn = Lip(f n ), and f n f on a dense n 1 set in X. Then f Con 2 (X), Lip(f) c and if α is the fixed point of f, then lim α n = α. n Proof. It follows from the hypotheses that f n u.c f on X X and c f = Lip(f) c < 1. Hence f is a contraction. By Theorem 2.3 we have d X (α, α n ) 1 1 c d X(f n (α, α), f(α, α)). Using Lemma 2.4 in the case of an RIFS, Theorem 2.5 becomes Theorem 2.6. Let (X, d X ) be a complete metric space, n N, and S m = (X, (fk m) ), m N, and S = (X, (f k ) ) recurrent iterated function systems with contraction constants c n and c 0. If sup c n = c < 1 and f m k s f k on a dense set in X X, k {1, 2,..., n}, then lim A(S n) = A(S). n n 1
8 50 Alexandru Mihail 8 3. EXAMPLES AND REMARKS Let (X, d X ) be a complete metric space, S = (X, (f k ) ) an RIFS, A(S) K(X) the attractor of S and (H n ) n N a sequence defined by H n+1 = F S (H n, H n 1 ), n N, which is convergent to A(S). We make some remarks on the monotony of the sequence (H n ) n N. If H 0 H 1 H 2, then H n 1 H n, for all n N, and A(S) = H n. In particular, if H F S (H, H) then H A(S). Let A = {x 0 there exists k such that f k (x 0, x 0 ) = x 0 } be the set of fixed points of the functions (f k ). Then A f(a, A), and so A A(S). In other words, every fixed point of a function from S is in A(S). If H 0 H 1 H 2, then H n 1 H n, for all n N, and A(S) = H n. Proposition 3.1. Let (X, d X ) be a complete metric space, S = (X, (f k ) ) a recurrent iterated function system with contraction constant c, and H K(X). If H B(F S (H, H), r) then H B ( A(S), r 1 c). Proof. Let (H n ) n N be the sequence defined by H n+1 = F S (H n, H n ), n N, and H 0 = H. As in Lemmas 2.3 and 2.4, we have by induction that H n B(H n+1, rc n ), so H B (H n, r n 1 c ). k Since H n A(S) and lim r n 1 c k = n k=0 r r 1 c, we get H B(A(S), k=0 1 c ). Proposition 3.2. Let (X, d X ) be a complete metric space, S = (X, (f k ) ) an RIFS, x 1, x 2,..., x l, y 1, y 2,..., y m A(S) and t : {1, 2,..., l + m} {1, 2,..., n} a fixed function. Let S 1 = (X, (g k ),l+m ) be the IFS defined by { ft(k) (x k, x) if k n g k (x) = f t(k) (x, y k n ) if k n + 1. Then A(S 1 ) A(S). Proof. We have g k (A(S)) = f t(k) (x k, A(S)) A(S) if k n and g k (A(S)) = f t(k) (A(S), y k n ) A(S) if k n + 1. Hence n 1 n 1 It follows that F S1 (A(S)) = g k (A(S)) A(S). l+m A(S 1 ) A(S).
9 9 Recurrent iterated function systems 51 Let (X, d X ) be a metric space and a function. f : X X X. Let us consider the function (f) : X X defined by (f)(x) = f(x, x), x X. For an RIFS S = (X, (f k ) ), let us define (S) = (X, ( (f k )) ). If S has contraction constant c, then (S) has a contraction constant less than c. Proposition 3.3. Let (X, d X ) be a complete metric space and S = (X, (f k ) ) an RIFS. Then A( (S)) A(S). Proof. It is easy to see that F (S) (H) F S (H, H) for every H K(X). Indeed F (S) (H) = (f k )(H) = {f(x, x) x H} = = {f(x, y) x H and y H} = f k (H, H) = F S (H, H). Also, for H, K K(X) such that H K we have F (S) (H) F S (K, K) since F (S) (H) F (S) (K) F S (K, K). Let H K(X) be fixed. Consider the sequences (H n ) n N and (K n ) n N defined by H 0 = H, K 0 = H, H n+1 = F S (H n, H n ), and F (S) (K n ) = K n+1, where n N. It is clear that K 0 H 0. If K n H n then K n+1 = F (S) (K n ) F S (H n, H n ) = H n+1, for all n N. Since lim n K n = A( (S)) and lim n H n = A(S), we have A( (S)) A(S). Example 1. Every IFS can be seen as an RIFS. Indeed, let S = (X, (f k ) ) be an IFS. Let S = (X, (f k ) ) be the RIFS defined by f k (x, y) = f k (x). Then A(S) = A(S). Example 2. Let X = R and let f, g : R R R be defined by f(x, y) = x 3 + y 3 and g(x, y) = x Let the RIFS S = (R, (f, g)), and let F S : K(R) K(R) K(R) be defined by F S (K, H) = f(k, H) g(k, H). The attractor of S is [0, 1]. Indeed f([0, 1], [0, 1]) = [0, 2/3] [0, 1] and g([0, 1], [0, 1]) = [2/3, 1] [0, 1], so that It follows that A(S) = [0, 1]. F S ([0, 1], [0, 1]) = [0, 1]. Example 3. Let X = R and let f, g : R R R be defined by f(x, y) = x 5 + y 5 and g(x, y) = x 5 + y Let the RIFS S = (R, (f, g)), and let F : K(R) K(R) K(R) be defined by F S (K, H) = f(k, H) g(k, H). The attractor of S is [0, 2/5] [3/5, 1].
10 52 Alexandru Mihail 10 Indeed f([0, 1], [0, 1]) = [0, 2/5] [0, 1] and g([0, 1], [0, 1]) = [3/5, 1] [0, 1], so that F S ([0, 1], [0, 1]) = [0, 2/5] [3/5, 1] [0, 1]. It follows that A(S) [0, 1] and A(S) = H n, where (H n ) n 1 is the sequence defined by H n+1 = f(h n, H n ), n N, and H 0 = [0, 1]. We remark that f(x, y) = f(y, x), g(x, y) = g(y, x), F (K, H) = F (H, K), g(x, y) = f(x, y) and g(k, H) = f(k, H) Let also t : R R be defined by t(x) = x Then (t t)(x) = x, f(t(x), t(y)) = t(g(x, y)), g(t(x), t(y)) = t(f(x, y)) and t(a(s)) = A(S). In other words the attractor of the RIFS S = (R, (f, g)) is symmetric with respect to 1/2. Then n 1 H 1 = F S ([0, 1], [0, 1]) = [0, 2/5] [3/5, 1], f([0, 2/5] [3/5, 1], [0, 2/5] [3/5, 1]) = = f([0, 2/5], [0, 2/5]) f([0, 2/5], [3/5, 1]) f([3/5, 1], [3/5, 1]) = [0, 4/25] [3/25, 7/25] [6/25, 2/5] = [0, 2/5], g([0, 2/5] [3/5, 1]) = [3/5, 1], H 2 = F (H 1, H 1 ) = f(h 1, H 1 ) g(h 1, H 1 ) = [0, 2/5] [3/5, 1] = H 1. It follows that A(S) = H 1 = [0, 2/5] [3/5, 1]. We remark that A(S) cannot be the attractor of a classical IFS with two injective functions. Such an attractor, if disconnected, must be totally disconnected. However, A(S) is the attractor of a classical IFS with four functions, namely f 0 : R R defined by f 1 : R R defined by f 2 : R R defined by f 1 (x) = f 2 (x) = and f 3 : R R defined by f 3 (x) = f 0 (x) = min{ x, 2/5}, 2 min{2/5 x 2/5, 2/5} 2 min{3/5 + x 3/5, 1} 2 min{1 x 1, 2/5} , Example 4. Let X = R and f 0, f 1 : R 2 R 2 be defined by f 0 (x, y) = ( x 3, 0) and f 1(x, y) = ( x , 0).
11 11 Recurrent iterated function systems 53 Let the IFS S = (R, (f 0, f 1 )) and A(S) = C the Cantor set. Let C 0 = f 0 (C) and C 1 = f 1 (C). Let us note that C 0 C, C 1 C, f 0 (C 0 ) C 0 and f 1 (C 1 ) C 1. Consider the RIFS S = (R, (f 0, f 1 )), where f 0 : R 2 R 2 R 2 and f 1 : R 2 R 2 R 2 are given by f 0 ((x 1, x 2 ), (y 1, y 2 )) = ( x 1 3, y 1 3 ) and f 1 ((x 1, x 2 ), (y 1, y 2 )) = ( x , 0). Then A(S) = C 0 C 0 C 1 {0}. Indeed, since f 0 (C 0 C 0 C 1 {0}) = f 0 (C 0 C 0 ) f 0 (C 1 {0}) = = f 0 (C 0 ) f 0 (C 0 ) f 0 (C 1 ) {0} C 0 C 0 C 1 {0} and f 1 (C 0 C 0 C 1 {0}) = f 1 (C 0 C 0 ) f 1 (C 1 {0}) = = f 1 (C 0 ) {0} f 1 (C 1 ) {0} = C 1 {0}, we have A(S) C 0 C 0 C 1 {0}. Since f 0 ((x 1, x 2 ), (0, 0)) = f 0 (x 1, x 2 ) and f 1 ((x 1, x 2 ), (0, 0)) = f 1 (x 1, x 2 ), we get C A(S). Also, f 0 (C C) = C 0 C 0 and f 1 (C C) = C 1 {0}. It follows that C 0 C 0 C 1 {0} A(S), which completes the proof. REFERENCES [1] M.F. Barnsley, Fractals Everywhere. Academic Press, New York, [2] K.J. Falconer, The Geometry of Fractal Sets. Cambridge Univ. Press, Cambridge, [3] K.J. Falconer, Fractal Geometry-Foundations and Applications. Wiley, [4] N Secelean, Măsură şi fractali. Ed. Univ. Sibiu, Received 1st March 2006 University of Bucharest Faculty of Mathematics and Computer Science Str. Academiei Bucharest, Romania mihail alex@yahoo.com
THE SHIFT SPACE FOR AN INFINITE ITERATED FUNCTION SYSTEM
THE SHIFT SPACE FOR AN INFINITE ITERATED FUNCTION SYSTEM ALEXANDRU MIHAIL and RADU MICULESCU The aim of the paper is to define the shift space for an infinite iterated function systems (IIFS) and to describe
More informationApproximation of the attractor of a countable iterated function system 1
General Mathematics Vol. 17, No. 3 (2009), 221 231 Approximation of the attractor of a countable iterated function system 1 Nicolae-Adrian Secelean Abstract In this paper we will describe a construction
More informationSOME REMARKS CONCERNING THE ATTRACTORS OF ITERATED FUNCTION SYSTEMS
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 44, Number 2, 2014 SOME REMARKS CONCERNING THE ATTRACTORS OF ITERATED FUNCTION SYSTEMS DAN DUMITRU AND ALEXANDRU MIHAIL ABSTRACT. The aim of this article is
More informationMetric Spaces Math 413 Honors Project
Metric Spaces Math 413 Honors Project 1 Metric Spaces Definition 1.1 Let X be a set. A metric on X is a function d : X X R such that for all x, y, z X: i) d(x, y) = d(y, x); ii) d(x, y) = 0 if and only
More informationHABILITATION THESIS. New results in the theory of Countable Iterated Function Systems
HABILITATION THESIS New results in the theory of Countable Iterated Function Systems - abstract - Nicolae-Adrian Secelean Specialization: Mathematics Lucian Blaga University of Sibiu 2014 Abstract The
More informationSummer Jump-Start Program for Analysis, 2012 Song-Ying Li
Summer Jump-Start Program for Analysis, 01 Song-Ying Li 1 Lecture 6: Uniformly continuity and sequence of functions 1.1 Uniform Continuity Definition 1.1 Let (X, d 1 ) and (Y, d ) are metric spaces and
More informationIterated function systems on functions of bounded variation
Iterated function systems on functions of bounded variation D. La Torre, F. Mendivil and E.R. Vrscay December 18, 2015 Abstract We show that under certain hypotheses, an Iterated Function System on Mappings
More informationFixed point theorems for Ćirić type generalized contractions defined on cyclic representations
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 8 (2015), 1257 1264 Research Article Fixed point theorems for Ćirić type generalized contractions defined on cyclic representations Adrian Magdaş
More informationFractals and Dimension
Chapter 7 Fractals and Dimension Dimension We say that a smooth curve has dimension 1, a plane has dimension 2 and so on, but it is not so obvious at first what dimension we should ascribe to the Sierpinski
More informationMetric Spaces Math 413 Honors Project
Metric Spaces Math 413 Honors Project 1 Metric Spaces Definition 1.1 Let X be a set. A metric on X is a function d : X X R such that for all x, y, z X: i) d(x, y) = d(y, x); ii) d(x, y) = 0 if and only
More informationGeneration of Fractals via Self-Similar Group of Kannan Iterated Function System
Appl. Math. Inf. Sci. 9, No. 6, 3245-3250 (2015) 3245 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/090652 Generation of Fractals via Self-Similar
More informationAnalysis Finite and Infinite Sets The Real Numbers The Cantor Set
Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XL 2002 ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES by Joanna Jaroszewska Abstract. We study the asymptotic behaviour
More informationNOTES ON BARNSLEY FERN
NOTES ON BARNSLEY FERN ERIC MARTIN 1. Affine transformations An affine transformation on the plane is a mapping T that preserves collinearity and ratios of distances: given two points A and B, if C is
More informationMath General Topology Fall 2012 Homework 13 Solutions
Math 535 - General Topology Fall 2012 Homework 13 Solutions Note: In this problem set, function spaces are endowed with the compact-open topology unless otherwise noted. Problem 1. Let X be a compact topological
More informationCOMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM
COMPLETE METRIC SPACES AND THE CONTRACTION MAPPING THEOREM A metric space (M, d) is a set M with a metric d(x, y), x, y M that has the properties d(x, y) = d(y, x), x, y M d(x, y) d(x, z) + d(z, y), x,
More information7. Let X be a (general, abstract) metric space which is sequentially compact. Prove X must be complete.
Math 411 problems The following are some practice problems for Math 411. Many are meant to challenge rather that be solved right away. Some could be discussed in class, and some are similar to hard exam
More informationProblem Set 5: Solutions Math 201A: Fall 2016
Problem Set 5: s Math 21A: Fall 216 Problem 1. Define f : [1, ) [1, ) by f(x) = x + 1/x. Show that f(x) f(y) < x y for all x, y [1, ) with x y, but f has no fixed point. Why doesn t this example contradict
More informationMany of you got these steps reversed or otherwise out of order.
Problem 1. Let (X, d X ) and (Y, d Y ) be metric spaces. Suppose that there is a bijection f : X Y such that for all x 1, x 2 X. 1 10 d X(x 1, x 2 ) d Y (f(x 1 ), f(x 2 )) 10d X (x 1, x 2 ) Show that if
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationA NOTE ON MULTIVALUED MEIR-KEELER TYPE OPERATORS
STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume LI, Number 4, December 2006 A NOTE ON MULTIVALUED MEIR-KEELER TYPE OPERATORS ADRIAN PETRUŞEL AND GABRIELA PETRUŞEL Dedicated to Professor Gheorghe Coman at
More informationMATH 202B - Problem Set 5
MATH 202B - Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
More informationEconomics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011
Economics 204 Summer/Fall 2011 Lecture 5 Friday July 29, 2011 Section 2.6 (cont.) Properties of Real Functions Here we first study properties of functions from R to R, making use of the additional structure
More informationMath 140A - Fall Final Exam
Math 140A - Fall 2014 - Final Exam Problem 1. Let {a n } n 1 be an increasing sequence of real numbers. (i) If {a n } has a bounded subsequence, show that {a n } is itself bounded. (ii) If {a n } has a
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #5. Solutions
Math 50 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 205 Homework #5 Solutions. Let α and c be real numbers, c > 0, and f is defined
More informationTHE INVERSE FUNCTION THEOREM
THE INVERSE FUNCTION THEOREM W. PATRICK HOOPER The implicit function theorem is the following result: Theorem 1. Let f be a C 1 function from a neighborhood of a point a R n into R n. Suppose A = Df(a)
More informationFunctional Analysis Winter 2018/2019
Functional Analysis Winter 2018/2019 Peer Christian Kunstmann Karlsruher Institut für Technologie (KIT) Institut für Analysis Englerstr. 2, 76131 Karlsruhe e-mail: peer.kunstmann@kit.edu These lecture
More informationContinuous Functions on Metric Spaces
Continuous Functions on Metric Spaces Math 201A, Fall 2016 1 Continuous functions Definition 1. Let (X, d X ) and (Y, d Y ) be metric spaces. A function f : X Y is continuous at a X if for every ɛ > 0
More informationLecture 6: Contraction mapping, inverse and implicit function theorems
Lecture 6: Contraction mapping, inverse and implicit function theorems 1 The contraction mapping theorem De nition 11 Let X be a metric space, with metric d If f : X! X and if there is a number 2 (0; 1)
More informationCONNECTEDNESS OF ATTRACTORS OF A CERTAIN FAMILY OF IFSS
CONNECTEDNESS OF ATTRACTORS OF A CERTAIN FAMILY OF IFSS FILIP STROBIN AND JAROSLAW SWACZYNA Abstract. Let X be a Banach space and f,g : X X be contractions. We investigate the set arxiv:1812.06427v1 [math.ds]
More informationB. Appendix B. Topological vector spaces
B.1 B. Appendix B. Topological vector spaces B.1. Fréchet spaces. In this appendix we go through the definition of Fréchet spaces and their inductive limits, such as they are used for definitions of function
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationMAS331: Metric Spaces Problems on Chapter 1
MAS331: Metric Spaces Problems on Chapter 1 1. In R 3, find d 1 ((3, 1, 4), (2, 7, 1)), d 2 ((3, 1, 4), (2, 7, 1)) and d ((3, 1, 4), (2, 7, 1)). 2. In R 4, show that d 1 ((4, 4, 4, 6), (0, 0, 0, 0)) =
More informationA PROOF OF A CONVEX-VALUED SELECTION THEOREM WITH THE CODOMAIN OF A FRÉCHET SPACE. Myung-Hyun Cho and Jun-Hui Kim. 1. Introduction
Comm. Korean Math. Soc. 16 (2001), No. 2, pp. 277 285 A PROOF OF A CONVEX-VALUED SELECTION THEOREM WITH THE CODOMAIN OF A FRÉCHET SPACE Myung-Hyun Cho and Jun-Hui Kim Abstract. The purpose of this paper
More informationLebesgue Integration on R n
Lebesgue Integration on R n The treatment here is based loosely on that of Jones, Lebesgue Integration on Euclidean Space We give an overview from the perspective of a user of the theory Riemann integration
More informationON THE DIAMETER OF THE ATTRACTOR OF AN IFS Serge Dubuc Raouf Hamzaoui Abstract We investigate methods for the evaluation of the diameter of the attrac
ON THE DIAMETER OF THE ATTRACTOR OF AN IFS Serge Dubuc Raouf Hamzaoui Abstract We investigate methods for the evaluation of the diameter of the attractor of an IFS. We propose an upper bound for the diameter
More informationON LINEAR RECURRENCES WITH POSITIVE VARIABLE COEFFICIENTS IN BANACH SPACES
ON LINEAR RECURRENCES WITH POSITIVE VARIABLE COEFFICIENTS IN BANACH SPACES ALEXANDRU MIHAIL The purpose of the paper is to study the convergence of a linear recurrence with positive variable coefficients
More informationTHE CONLEY ATTRACTORS OF AN ITERATED FUNCTION SYSTEM
Bull. Aust. Math. Soc. 88 (2013), 267 279 doi:10.1017/s0004972713000348 THE CONLEY ATTRACTORS OF AN ITERATED FUNCTION SYSTEM MICHAEL F. BARNSLEY and ANDREW VINCE (Received 15 August 2012; accepted 21 February
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationSelçuk Demir WS 2017 Functional Analysis Homework Sheet
Selçuk Demir WS 2017 Functional Analysis Homework Sheet 1. Let M be a metric space. If A M is non-empty, we say that A is bounded iff diam(a) = sup{d(x, y) : x.y A} exists. Show that A is bounded iff there
More informationMathematical Analysis Outline. William G. Faris
Mathematical Analysis Outline William G. Faris January 8, 2007 2 Chapter 1 Metric spaces and continuous maps 1.1 Metric spaces A metric space is a set X together with a real distance function (x, x ) d(x,
More informationSPACES ENDOWED WITH A GRAPH AND APPLICATIONS. Mina Dinarvand. 1. Introduction
MATEMATIČKI VESNIK MATEMATIQKI VESNIK 69, 1 (2017), 23 38 March 2017 research paper originalni nauqni rad FIXED POINT RESULTS FOR (ϕ, ψ)-contractions IN METRIC SPACES ENDOWED WITH A GRAPH AND APPLICATIONS
More informationLecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differenti. equations.
Lecture 9 Metric spaces. The contraction fixed point theorem. The implicit function theorem. The existence of solutions to differential equations. 1 Metric spaces 2 Completeness and completion. 3 The contraction
More informationDefinition 6.1. A metric space (X, d) is complete if every Cauchy sequence tends to a limit in X.
Chapter 6 Completeness Lecture 18 Recall from Definition 2.22 that a Cauchy sequence in (X, d) is a sequence whose terms get closer and closer together, without any limit being specified. In the Euclidean
More informationChaos induced by coupled-expanding maps
First Prev Next Last Seminar on CCCN, Jan. 26, 2006 Chaos induced by coupled-expanding maps Page 1 of 35 Yuming Shi Department of Mathematics Shandong University, China ymshi@sdu.edu.cn Collaborators:
More informationThe Hausdorff Measure of the Attractor of an Iterated Function System with Parameter
ISSN 1479-3889 (print), 1479-3897 (online) International Journal of Nonlinear Science Vol. 3 (2007) No. 2, pp. 150-154 The Hausdorff Measure of the Attractor of an Iterated Function System with Parameter
More informationConstruction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions. P. Bouboulis, L. Dalla and M. Kostaki-Kosta
BULLETIN OF THE GREEK MATHEMATICAL SOCIETY Volume 54 27 (79 95) Construction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions P. Bouboulis L. Dalla and M. Kostaki-Kosta Received
More informationSome Fixed Point Theorems for G-Nonexpansive Mappings on Ultrametric Spaces and Non-Archimedean Normed Spaces with a Graph
J o u r n a l of Mathematics and Applications JMA No 39, pp 81-90 (2016) Some Fixed Point Theorems for G-Nonexpansive Mappings on Ultrametric Spaces and Non-Archimedean Normed Spaces with a Graph Hamid
More informationTHE CONTRACTION MAPPING THEOREM, II
THE CONTRACTION MAPPING THEOREM, II KEITH CONRAD 1. Introduction In part I, we met the contraction mapping theorem and an application of it to solving nonlinear differential equations. Here we will discuss
More informationTopological Properties of Operations on Spaces of Continuous Functions and Integrable Functions
Topological Properties of Operations on Spaces of Continuous Functions and Integrable Functions Holly Renaud University of Memphis hrenaud@memphis.edu May 3, 2018 Holly Renaud (UofM) Topological Properties
More informationMath 209B Homework 2
Math 29B Homework 2 Edward Burkard Note: All vector spaces are over the field F = R or C 4.6. Two Compactness Theorems. 4. Point Set Topology Exercise 6 The product of countably many sequentally compact
More informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More informationBest proximity problems for Ćirić type multivalued operators satisfying a cyclic condition
Stud. Univ. Babeş-Bolyai Math. 62(207), No. 3, 395 405 DOI: 0.2493/subbmath.207.3. Best proximity problems for Ćirić type multivalued operators satisfying a cyclic condition Adrian Magdaş Abstract. The
More informationA Common Fixed Point Theorem for Multivalued Mappings Through T-weak Commutativity
Mathematica Moravica Vol. 10 (2006), 55 60 A Common Fixed Point Theorem for Multivalued Mappings Through T-weak Commutativity I. Kubiaczyk and Bhavana Deshpande Abstract. In this paper, we prove a common
More informationh(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote
Real Variables, Fall 4 Problem set 4 Solution suggestions Exercise. Let f be of bounded variation on [a, b]. Show that for each c (a, b), lim x c f(x) and lim x c f(x) exist. Prove that a monotone function
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 2018-2019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationHonours Analysis III
Honours Analysis III Math 354 Prof. Dmitry Jacobson Notes Taken By: R. Gibson Fall 2010 1 Contents 1 Overview 3 1.1 p-adic Distance............................................ 4 2 Introduction 5 2.1 Normed
More informationPerov s fixed point theorem for multivalued mappings in generalized Kasahara spaces
Stud. Univ. Babeş-Bolyai Math. 56(2011), No. 3, 19 28 Perov s fixed point theorem for multivalued mappings in generalized Kasahara spaces Alexandru-Darius Filip Abstract. In this paper we give some corresponding
More informationThe Heine-Borel and Arzela-Ascoli Theorems
The Heine-Borel and Arzela-Ascoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine- Borel theorem and the Arzela-Ascoli theorem. We prove them
More informationTHE HUTCHINSON BARNSLEY THEORY FOR INFINITE ITERATED FUNCTION SYSTEMS
Bull. Austral. Math. Soc. Vol. 72 2005) [441 454] 39b12, 47a35, 47h09, 54h25 THE HUTCHINSON BARNSLEY THEORY FOR INFINITE ITERATED FUNCTION SYSTEMS Gertruda Gwóźdź- Lukawska and Jacek Jachymski We show
More informationVALUATION THEORY, GENERALIZED IFS ATTRACTORS AND FRACTALS
VALUATION THEORY, GENERALIZED IFS ATTRACTORS AND FRACTALS JAN DOBROWOLSKI AND FRANZ-VIKTOR KUHLMANN Abstract. Using valuation rings and valued fields as examples, we discuss in which ways the notions of
More informationInvariant measures for iterated function systems
ANNALES POLONICI MATHEMATICI LXXV.1(2000) Invariant measures for iterated function systems by Tomasz Szarek (Katowice and Rzeszów) Abstract. A new criterion for the existence of an invariant distribution
More information7 Complete metric spaces and function spaces
7 Complete metric spaces and function spaces 7.1 Completeness Let (X, d) be a metric space. Definition 7.1. A sequence (x n ) n N in X is a Cauchy sequence if for any ɛ > 0, there is N N such that n, m
More informationĆirić type fixed point theorems
Stud. Univ. Babeş-Bolyai Math. 59(2014), No. 2, 233 245 Ćirić type fixed point theorems Adrian Petruşel Abstract. The purpose of this paper is to review some fixed point and strict fixed point results
More informationarxiv: v1 [math.ca] 13 May 2017
Invariant measures of Markov operators associated to iterated function systems consisting of ϕ-max-contractions with probabilities ariv:1705.04875v1 [math.ca] 13 May 2017 by Flavian GEORGECU, Radu MICULECU
More informationMetric Spaces. Exercises Fall 2017 Lecturer: Viveka Erlandsson. Written by M.van den Berg
Metric Spaces Exercises Fall 2017 Lecturer: Viveka Erlandsson Written by M.van den Berg School of Mathematics University of Bristol BS8 1TW Bristol, UK 1 Exercises. 1. Let X be a non-empty set, and suppose
More informationA FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS
Fixed Point Theory, (0), No., 4-46 http://www.math.ubbcluj.ro/ nodeacj/sfptcj.html A FIXED POINT THEOREM FOR GENERALIZED NONEXPANSIVE MULTIVALUED MAPPINGS A. ABKAR AND M. ESLAMIAN Department of Mathematics,
More informationFIXED POINT METHODS IN NONLINEAR ANALYSIS
FIXED POINT METHODS IN NONLINEAR ANALYSIS ZACHARY SMITH Abstract. In this paper we present a selection of fixed point theorems with applications in nonlinear analysis. We begin with the Banach fixed point
More informationHYERS-ULAM-RASSIAS STABILITY OF JENSEN S EQUATION AND ITS APPLICATION
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 16, Number 11, November 1998, Pages 3137 3143 S 000-9939(9804680- HYERS-ULAM-RASSIAS STABILITY OF JENSEN S EQUATION AND ITS APPLICATION SOON-MO JUNG
More informationUnbounded solutions of an iterative-difference equation
Acta Univ. Sapientiae, Mathematica, 9, 1 (2017) 224 234 DOI: 10.1515/ausm-2017-0015 Unbounded solutions of an iterative-difference equation Lin Li College of Mathematics, Physics and Information Engineering
More informationContraction Mappings Consider the equation
Contraction Mappings Consider the equation x = cos x. If we plot the graphs of y = cos x and y = x, we see that they intersect at a unique point for x 0.7. This point is called a fixed point of the function
More informationON FRACTAL DIMENSION OF INVARIANT SETS
ON FRACTAL DIMENSION OF INVARIANT SETS R. MIRZAIE We give an upper bound for the box dimension of an invariant set of a differentiable function f : U M. Here U is an open subset of a Riemannian manifold
More informationconverges as well if x < 1. 1 x n x n 1 1 = 2 a nx n
Solve the following 6 problems. 1. Prove that if series n=1 a nx n converges for all x such that x < 1, then the series n=1 a n xn 1 x converges as well if x < 1. n For x < 1, x n 0 as n, so there exists
More informationIterated Function Systems
1 Iterated Function Systems Section 1. Iterated Function Systems Definition. A transformation f:r m! R m is a contraction (or is a contraction map or is contractive) if there is a constant s with 0"s
More informationMath 421, Homework #9 Solutions
Math 41, Homework #9 Solutions (1) (a) A set E R n is said to be path connected if for any pair of points x E and y E there exists a continuous function γ : [0, 1] R n satisfying γ(0) = x, γ(1) = y, and
More informationA Class of Möbius Iterated Function Systems
1 A Class of Möbius Iterated Function Systems arxiv:180.0143v1 [math.ds] 30 Jan 018 Gökçe ÇAKMAK, Ali DENİZ, Şahin KOÇAK Abstract We give a procedure to produce Möbius iterated function systems (MIFS)
More informationCHAPTER 1. Metric Spaces. 1. Definition and examples
CHAPTER Metric Spaces. Definition and examples Metric spaces generalize and clarify the notion of distance in the real line. The definitions will provide us with a useful tool for more general applications
More informationGap Property of Bi-Lipschitz Constants of Bi-Lipschitz Automorphisms on Self-similar Sets
Chin. Ann. Math. 31B(2), 2010, 211 218 DOI: 10.1007/s11401-008-0350-0 Chinese Annals of Mathematics, Series B c The Editorial Office of CAM and Springer-Verlag Berlin Heidelberg 2010 Gap Property of Bi-Lipschitz
More informationIntroduction to Functional Analysis
Introduction to Functional Analysis Carnegie Mellon University, 21-640, Spring 2014 Acknowledgements These notes are based on the lecture course given by Irene Fonseca but may differ from the exact lecture
More informationSOLUTIONS TO SOME PROBLEMS
23 FUNCTIONAL ANALYSIS Spring 23 SOLUTIONS TO SOME PROBLEMS Warning:These solutions may contain errors!! PREPARED BY SULEYMAN ULUSOY PROBLEM 1. Prove that a necessary and sufficient condition that the
More informationSOME NEW FIXED POINT RESULTS IN ULTRA METRIC SPACE
TWMS J. Pure Appl. Math., V.8, N.1, 2017, pp.33-42 SOME NEW FIXED POINT RESULTS IN ULTRA METRIC SPACE LJILJANA GAJIC 1, MUHAMMAD ARSHAD 2, SAMI ULLAH KHAN 3, LATIF UR RAHMAN 2 Abstract. The purpose of
More informationSOME REMARKS ON KRASNOSELSKII S FIXED POINT THEOREM
Fixed Point Theory, Volume 4, No. 1, 2003, 3-13 http://www.math.ubbcluj.ro/ nodeacj/journal.htm SOME REMARKS ON KRASNOSELSKII S FIXED POINT THEOREM CEZAR AVRAMESCU AND CRISTIAN VLADIMIRESCU Department
More informationProblem Set 5. 2 n k. Then a nk (x) = 1+( 1)k
Problem Set 5 1. (Folland 2.43) For x [, 1), let 1 a n (x)2 n (a n (x) = or 1) be the base-2 expansion of x. (If x is a dyadic rational, choose the expansion such that a n (x) = for large n.) Then the
More information3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?
MA 645-4A (Real Analysis), Dr. Chernov Homework assignment 1 (Due ). Show that the open disk x 2 + y 2 < 1 is a countable union of planar elementary sets. Show that the closed disk x 2 + y 2 1 is a countable
More informationMidterm 1. Every element of the set of functions is continuous
Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions
More informationWhat to remember about metric spaces
Division of the Humanities and Social Sciences What to remember about metric spaces KC Border These notes are (I hope) a gentle introduction to the topological concepts used in economic theory. If the
More informationLINEAR CHAOS? Nathan S. Feldman
LINEAR CHAOS? Nathan S. Feldman In this article we hope to convience the reader that the dynamics of linear operators can be fantastically complex and that linear dynamics exhibits the same beauty and
More informationAnalysis Qualifying Exam
Analysis Qualifying Exam Spring 2017 Problem 1: Let f be differentiable on R. Suppose that there exists M > 0 such that f(k) M for each integer k, and f (x) M for all x R. Show that f is bounded, i.e.,
More informationON POSITIVE, LINEAR AND QUADRATIC BOOLEAN FUNCTIONS
Kragujevac Journal of Mathematics Volume 36 Number 2 (2012), Pages 177 187. ON POSITIVE, LINEAR AND QUADRATIC BOOLEAN FUNCTIONS SERGIU RUDEANU Abstract. In [1], [2] it was proved that a function f : {0,
More informationMEAN VALUE, UNIVALENCE, AND IMPLICIT FUNCTION THEOREMS
MEAN VALUE, UNIVALENCE, AND IMPLICIT FUNCTION THEOREMS MIHAI CRISTEA We establish some mean value theorems concerning the generalized derivative on a direction in the sense of Clarke, in connection with
More informationTHE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS
THE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS RALPH HOWARD DEPARTMENT OF MATHEMATICS UNIVERSITY OF SOUTH CAROLINA COLUMBIA, S.C. 29208, USA HOWARD@MATH.SC.EDU Abstract. This is an edited version of a
More informationMTG 5316/4302 FALL 2018 REVIEW FINAL
MTG 5316/4302 FALL 2018 REVIEW FINAL JAMES KEESLING Problem 1. Define open set in a metric space X. Define what it means for a set A X to be connected in a metric space X. Problem 2. Show that if a set
More informationExistence and data dependence for multivalued weakly Ćirić-contractive operators
Acta Univ. Sapientiae, Mathematica, 1, 2 (2009) 151 159 Existence and data dependence for multivalued weakly Ćirić-contractive operators Liliana Guran Babeş-Bolyai University, Department of Applied Mathematics,
More informationDYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS
DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS Issam Naghmouchi To cite this version: Issam Naghmouchi. DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS. 2010. HAL Id: hal-00593321 https://hal.archives-ouvertes.fr/hal-00593321v2
More informationAPPROXIMATE FIXED POINT OF REICH OPERATOR. 1. Introduction
APPROXIMATE FIXED POINT OF REICH OPERATOR D. DEY and M. SAHA Abstract. In the present paper, we study the existence of approximate fixed point for Reich operator together with the property that the ε-fixed
More informationTHE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES
THE STONE-WEIERSTRASS THEOREM AND ITS APPLICATIONS TO L 2 SPACES PHILIP GADDY Abstract. Throughout the course of this paper, we will first prove the Stone- Weierstrass Theroem, after providing some initial
More informationON PEXIDER DIFFERENCE FOR A PEXIDER CUBIC FUNCTIONAL EQUATION
ON PEXIDER DIFFERENCE FOR A PEXIDER CUBIC FUNCTIONAL EQUATION S. OSTADBASHI and M. SOLEIMANINIA Communicated by Mihai Putinar Let G be an abelian group and let X be a sequentially complete Hausdorff topological
More informationBased on the Appendix to B. Hasselblatt and A. Katok, A First Course in Dynamics, Cambridge University press,
NOTE ON ABSTRACT RIEMANN INTEGRAL Based on the Appendix to B. Hasselblatt and A. Katok, A First Course in Dynamics, Cambridge University press, 2003. a. Definitions. 1. Metric spaces DEFINITION 1.1. If
More information