ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES

Similar documents
Invariant measures for iterated function systems

APPLICATIONS OF THE KANTOROVICH-RUBINSTEIN MAXIMUM PRINCIPLE IN THE THEORY OF MARKOV OPERATORS

Markov operators acting on Polish spaces

Asymptotic stability of an evolutionary nonlinear Boltzmann-type equation

THE SHIFT SPACE FOR AN INFINITE ITERATED FUNCTION SYSTEM

The Caratheodory Construction of Measures

The small ball property in Banach spaces (quantitative results)

Metric Spaces and Topology

Functional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...

MATH 202B - Problem Set 5

VALUATION THEORY, GENERALIZED IFS ATTRACTORS AND FRACTALS

Chapter 4. Measure Theory. 1. Measure Spaces

THEOREMS, ETC., FOR MATH 515

1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

ITERATED FUNCTION SYSTEMS WITH A GIVEN CONTINUOUS STATIONARY DISTRIBUTION

l(y j ) = 0 for all y j (1)

LECTURE 15: COMPLETENESS AND CONVEXITY

Tools from Lebesgue integration

Math 209B Homework 2

Construction of Smooth Fractal Surfaces Using Hermite Fractal Interpolation Functions. P. Bouboulis, L. Dalla and M. Kostaki-Kosta

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

Math 5210, Definitions and Theorems on Metric Spaces

A continuous operator extending fuzzy ultrametrics

Mathematics for Economists

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

1 Stochastic Dynamic Programming

THE CONLEY ATTRACTORS OF AN ITERATED FUNCTION SYSTEM

Self-Referentiality, Fractels, and Applications

HABILITATION THESIS. New results in the theory of Countable Iterated Function Systems

ON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS

Polishness of Weak Topologies Generated by Gap and Excess Functionals

Approximation of the attractor of a countable iterated function system 1

NOTES ON BARNSLEY FERN

Measurable Choice Functions

VARIATIONAL PRINCIPLE FOR THE ENTROPY

FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets

A note on the σ-algebra of cylinder sets and all that

The Hausdorff Measure of the Attractor of an Iterated Function System with Parameter

Math 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1

USING THE RANDOM ITERATION ALGORITHM TO CREATE FRACTALS

Math212a1411 Lebesgue measure.

Topological properties

Part III. 10 Topological Space Basics. Topological Spaces

(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε

Construction of recurrent fractal interpolation surfaces(rfiss) on rectangular grids

4th Preparation Sheet - Solutions

Introduction and Preliminaries

The Chaos Game on a General Iterated Function System

OPTIMAL SOLUTIONS TO STOCHASTIC DIFFERENTIAL INCLUSIONS

CHAPTER 1. Metric Spaces. 1. Definition and examples

Problem List MATH 5143 Fall, 2013

Fragmentability and σ-fragmentability

Introduction to Real Analysis Alternative Chapter 1

RECURRENT ITERATED FUNCTION SYSTEMS

Examples of Dual Spaces from Measure Theory

Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

Your first day at work MATH 806 (Fall 2015)

Chapter 2. Metric Spaces. 2.1 Metric Spaces

Aliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide

Maths 212: Homework Solutions

Course 212: Academic Year Section 1: Metric Spaces

I. The space C(K) Let K be a compact metric space, with metric d K. Let B(K) be the space of real valued bounded functions on K with the sup-norm

Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:

Recall that if X is a compact metric space, C(X), the space of continuous (real-valued) functions on X, is a Banach space with the norm

Contents. Index... 15

ON GENERALIZED-CONVEX CONSTRAINED MULTI-OBJECTIVE OPTIMIZATION

APPROXIMATE ISOMETRIES ON FINITE-DIMENSIONAL NORMED SPACES

Sets, Functions and Metric Spaces

1.4 Outer measures 10 CHAPTER 1. MEASURE

MA651 Topology. Lecture 9. Compactness 2.

Optimization and Optimal Control in Banach Spaces

Continuity of convex functions in normed spaces

Supplementary Notes for W. Rudin: Principles of Mathematical Analysis

Existence and data dependence for multivalued weakly Ćirić-contractive operators

FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS

Jensen s inequality for multivariate medians

4 Countability axioms

Exercise Solutions to Functional Analysis

ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University

MATH5011 Real Analysis I. Exercise 1 Suggested Solution

THE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS

Notes on Ordered Sets

Chapter 2 Metric Spaces

Measures. Chapter Some prerequisites. 1.2 Introduction

EQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES

A NOTE ON MULTIVALUED MEIR-KEELER TYPE OPERATORS

ON DENSITY TOPOLOGIES WITH RESPECT

Lecture 5 - Hausdorff and Gromov-Hausdorff Distance

Lebesgue Measure. Dung Le 1

A Class of Möbius Iterated Function Systems

ON A MEASURE THEORETIC AREA FORMULA

CHAPTER 9. Embedding theorems

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

PCMI LECTURE NOTES ON PROPERTY (T ), EXPANDER GRAPHS AND APPROXIMATE GROUPS (PRELIMINARY VERSION)

PREVALENCE OF SOME KNOWN TYPICAL PROPERTIES. 1. Introduction

Integration on Measure Spaces

Topological properties of Z p and Q p and Euclidean models

MASS TRANSFERENCE PRINCIPLE: FROM BALLS TO ARBITRARY SHAPES. 1. Introduction. limsupa i = A i.

Transcription:

UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XL 2002 ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES by Joanna Jaroszewska Abstract. We study the asymptotic behaviour of iterated function systems built of a finite number of contractions and positive, continuous, place dependent probabilities. We prove that these systems have some special property which is called quasistability. We also establish the existence of an invariant distribution for such systems. 1. Introduction. We study asymptotic properties of iterated function systems (IFSs) defined by a finite number of contractions and positive, continuous, place dependent probabilities. A question concerning the asymptotic behaviour of these systems arose from attempts at completing a gap in Karlin s proof of Theorem 36 in [6], where Karlin postulated the asymptotic stability of IFSs built of two affine contractions and positive, continuous probabilities. The problem of the asymptotic stability of IFSs was treated by a number of authors and solved under some additional assumptions (in comparison with the Karlin s theorem) see e.g. [2], [10]. Recently Ö. Stenflo showed incorrectness of Karlin s theorem by constructing an example of an IFS, which is built from two affine contractions and positive probabilities and has two stationary distributions. In particular, this system is not asymptotically stable. Now new questions appear. What are the limiting properties of an IFS consisting of contractions and positive continuous probabilities? Are we able to associate with such an IFS any invariant distributions? Is an invariant distribution corresponding to a given IFS unique? The purpose of this paper is to answer these questions. The organization of the paper is as follows. Section 2 contains basic definitions and facts concerning Barnsley operators and attractors defined for finite families of continuous transformations of X into itself. In Section 3 we recall some notation and definitions from the theory of Markov operators. In Section

138 4 we introduce iterated function systems and prove the main stability result, Theorem 1, which assures the quasistability of iterated function systems with contractive transformations and positive continuous probabilities. Section 5, which concludes the paper, is devoted to the problem of the existence and non-uniqueness of an invariant distribution. 2. Barnsley operators. Let (X, ρ) be a complete metric space. By P(X) we denote the space of all nonempty subsets of X. For r > 0, B(x, r) stands for the open ball with center at x and radius r and B(K, r) stands for the union of all open balls with radii r and with centers in K. By N we denote the set of positive integers. Let I be a nonempty finite set. Given a family {S i : i I} of continuous transformations from X into itself, we define the corresponding Barnsley operator F : P(X) P(X) by the formula For A, B P(X), let { (1) h (A, B) = max F (A) = i I S i (A) for A P(X). sup a A } ρ (a, B), sup ρ (b, A). b B Obviously, if A, B P(X) are bounded then h (A, B) < and h (A, B) equals the Hausdorff distance between A and B. Furthermore, for A, B P(X) we have (2) h (A, B) = h (cl A, B). In the proof of Theorem 1, we will use the following well-known fact (for a proof see [1, page 82] or [5, page 30]): Lemma 1. If {S i : i I} is a finite family of contractions with respective contractivity constants L i and F is the corresponding Barnsley operator, then ( ) (3) h (F (A), F (B)) max L i h (A, B) for A, B P(X). i I Moreover, there exists the unique nonempty compact set K X which is invariant with respect to the family {S i : i I}, i.e. (4) K = i I S i (K). The set K mentioned in the statement of the above theorem is called the attractor of the family {S i : i I}. We finish this section with a simple lemma, which we provide with the detailed proof for the reader s convenience.

139 Lemma 2. If a family {S i : i I} consists of contractions and K is the attractor corresponding to that family, then for each {i n } I N the limit (5) lim S i 1... S in (x) exists, is independent of x X and belongs to K. Moreover, for every ε > 0 the convergence in (5) is uniform over x B (K, ε). Furthermore, the function ϕ : I N K defined by the formula is onto. ϕ ({i n }) = lim S i 1... S in (x) Proof. Fix {i n } I N. To see that limit (5) exists, choose x X and k, l N, k < l. Let ε > 0 be such a number that x B (K, ε). Find c K such that ρ (x, c) < ε and set y = S ik+1... S il (c). Observe that y K and (6) ρ (S i1... S ik (x), S i1... S il (x)) ρ (S i1... S ik (x), S i1... S ik (c)) + ρ (S i1... S ik (c), S i1... S il (c)) + ρ (S i1... S il (c), S i1... S il (x)) L k ρ (x, c) + L k ρ (c, y) + L l ρ (c, x) L k (2ε + diam(k)). Thus {S i1... S in (x)} is a Cauchy sequence. Additionally, since the estimate in (6) is uniform for x B (K, ε), the convergence in (5) is also uniform. Next, from the contractivity of transformations S i (i I) we obtain that the limit (5) does not depend on x X, that is the function ϕ is well defined. From the invariance of the attractor it follows that the limit (5) belongs to K. We are left with the task of proving that ϕ is a surjection. Fix c K. Observe that (4) implies the existence of i 1 I such that c S i1 (K). Proceeding by induction we choose a sequence {i n } I N such that c S i1... S in (K) for all n N. Since K is compact and {S i1... S in (K)} is a decreasing sequence of sets containing c and diameters of these sets decrease to 0, we obtain {c} = n=1 S i 1... S in (K). Thus, if x K, then c = lim S i1... S in (x). This completes the proof. 3. Markov operators and their asymptotic behaviour. In what follows we assume that (X, ρ) is a Polish space. By B X we denote the σ-algebra of Borel subsets of X, by M(X) the family of all finite Borel measures on X and by M 1 (X) the family of all µ M(X) such that µ(x) = 1. The elements of M 1 (X) are called distributions.

140 We say that µ M(X) is concentrated on a set A B X if µ (X \ A) = 0. By M A 1 (X) we denote the set of all distributions concentrated on A. The support of µ M(X), which is defined by the formula supp µ = {x X : µ (B(x, r)) > 0 for r > 0}, turns out to be the smallest closed set on which a measure µ is concentrated. As usually, by B(X) we denote the space of all bounded Borel measurable functions f : X R and by C(X) the subspace of all bounded continuous functions. For f B(X) and µ M(X) we write f, µ = f(x)µ(dx). X Let M s (X) = {µ 1 µ 2 : µ 1, µ 2 M(X)} be the space of finite signed measures. In M s (X) we introduce the Fortet-Mourier norm given by where µ = sup { f, µ : f L(X)}, L(X) = {f C(X) : f 1, f(x) f(y) ρ (x, y) for x, y X}. An operator P : M(X) M(X) is called a Markov operator if it satisfies the following two conditions: (i) positive linearity: for λ 1, λ 2 0 and µ 1, µ 2 M(X); (ii) preservation of the norm: P (λ 1 µ 1 + λ 2 µ 2 ) = λ 1 P (µ 1 ) + λ 2 P (µ 2 ) P µ(x) = µ(x) for µ M(X). It is easy to show that a Markov operator on M(X) can be uniquely extended to a linear operator on M s (X), which transforms M(X) into itself. We say that a Markov operator P is a Feller operator if there is a linear operator U : C(X) C(X) dual to P, that is Uf, µ = f, P µ for f C(X) and µ M(X). A measure µ M(X) is called stationary (or invariant) with respect to a Markov operator P if P µ = µ. A Markov operator P is called asymptotically stable if there exists a stationary distribution µ such that (7) lim P n µ µ = 0 for µ M 1 (X). Clearly the distribution µ satisfying (7) is unique.

141 We say that a Markov operator P is quasistable on a set K, if K is nonempty closed subset of X and if (i) for every c K and for every ε > 0 there exists a number α > 0 such that (8) lim inf P n µ (B(c, ε)) α for µ M 1 (X); (ii) for every c / K there exists a number ε > 0 such that (9) lim P n µ (B(c, ε)) = 0 for µ M 1 (X). The operator P is called quasistable if there exists a set K such that P is quasistable on K. The definition of quasistability of Markov operators is quite close to the notion of the asymptotic positivity, defined in [8, page 193]. Observe, that an asymptotically stable Markov operator P with the stationary distribution µ is quasistable on the set supp µ, which is a consequence of the Alexandrov theorem (see [3, page 11]). The converse implication is not true (which follows from Theorem 1 and Theorem 4). 4. Quasistability of iterated function systems. Assume that I is a nonempty finite set (this assumption will not be repeated). By an iterated function system (shortly IFS) {(S i, p i ) : i I} we mean a family of pairs consisting of continuous maps S i : X X and p i : X [0, 1], defined for each i I and such that i I p i(x) = 1 for all x X. Given an IFS {(S i, p i ) : i I} we define the corresponding Markov operator P : M(X) M(X) by the formula (10) P µ(a) = 1 A (S i (x)) p i (x)µ(dx) for A B X, µ M(X). i I X Observe that P is a Feller operator and the dual operator U is given by Uf = i I p i (f S i ) for f C(X). To simplify the language we will say that an IFS {(S i, p i ) : i I} is asymptotically stable, quasistable or has invariant distribution if the Markov operator (10) has the corresponding property. In order to prove the main result of this section we need two simple lemmas. The first easily follows from [9, Lemma 6.2] (compare also with [7, Proposition 12.8.2]) and allows us to construct supports of iterations of a given measure. Lemma 3. Consider an IFS {(S i, p i ) : i I} with p i > 0 for i I. Let P be the corresponding Markov operator and let F be the corresponding Barnsley operator. Then supp P n µ = cl F n (supp µ) for µ M(X), n N.

142 Lemma 4. If f : X (0, ) is a continuous function and a set K X is compact, then there exist numbers β > 0 and δ > 0 such that f(x) > β for all x B(K, δ). Proof. The above statement is an obvious conclusion of the compactness of K. For every x K define numbers β x, δ x > 0 such that f(y) > β x for y B (x, 2δ x ). Let { B ( )} q x j, δ xj be a finite subcover of K chosen from j=1 the cover {B (x, δ x )} x K of K. Set β = min j=1,...,q β xj and δ = min j=1,...,q δ xj. From the triangle inequality it follows that B(K, δ) q j=1 B ( ) x j, 2δ xj, so if x B (K, δ) then f(x) > β, which completes the proof. Theorem 1. Consider an IFS {(S i, p i ) : i I} such that for each i I the transformation S i is a contraction and the function p i is positive. Then {(S i, p i ) : i I} is quasistable. Proof. Let P and U denote the Markov operator and the dual operator corresponding to a given IFS {(S i, p i ) : i I}, respectively. Let L i be a Lipschitz constant for S i, i I. Since L = max i I L i < 1, we can apply Lemma 1, by virtue of which there exists a nonempty compact set K X, invariant with respect to the family {S i : i I}. We will prove that the IFS {(S i, p i ) : i I} is quasistable with respect to K. The proof falls naturally into two parts, due to the form of the definition of the quasistability. To begin with the first part, fix c K and ε > 0. According to the properties of ϕ defined in the statement of Lemma 2, there exists {i n } I N such that c = lim S i1... S in (x) for all x B(K, ε). The convergence to the limit is uniform over x B(K, ε), so we can choose a number m N such that (11) S i1... S im (B(K, ε)) B(c, ε). Further, since K is compact, we can apply Lemma 4 to the set K and to each of the functions p ik S ik+1... S im in turn (k = 1,..., m). We obtain constants β k > 0 and δ k > 0 such that p ik S ik+1... S im (x) > β k for x B(K, δ k ), k {1,..., m}. Now let δ = min {ε, δ 1,..., δ m } and α = β 1... β m /2. Next, fix a distribution µ M 1 concentrated on a bounded subset of X, that is with the bounded supp µ. The inequality (3) gives h (F n (supp µ), K) L n h (supp µ, K) for n N. Therefore, from the finiteness of h (supp µ, K), Lemma 3 and property (2) we conclude that there exists n 0 N such that h (supp P n µ, K) δ for n n 0.

143 According to formula (1) we then have (12) supp P n µ B (K, δ) for n n 0. We are now in a position to show (8). Let n m + n 0. We have P n µ (B (c, ε)) = U m 1 B(c,ε), P n m µ = (p km )... (p k1 S k2... S km ) ( ) 1 B(c,ε) S k1... S km dp n m µ k 1,...,k m I X X (p im )... (p i1 S i2... S im ) ( 1 B(c,ε) S i1... S im ) dp n m µ. The definition of δ and inclusion (11) yield and consequently P n µ (B(c, ε)) B(K, δ) (S i1... S im ) 1 (B(c, ε)), B(K,δ) From the definition of α and (12) it follows that (13) P n µ (B(c, ε)) 2α, where n m + n 0. Letting n we obtain (p im )... (p i1 S i2... S im ) dp n m µ. lim inf P n µ (B(c, ε)) 2α > α, so (8) is proved for distributions with bounded supports. Now consider a distribution µ M 1 with an arbitrary support. Choose a bounded Borel set S X such that µ(s) 1/2. We have then µ µ S /2, where µ S M S 1 is of the form µ S µ (A S) (A) = for A B(X). µ (S) Applying (13) to µ S leads to inequalities P n µ (B(c, ε)) P n µ S (B(c, ε)) /2 α, which are true for n large enough. This completes the first part of the proof. In order to deal with the second, fix c / K and choose ε > 0 such that (14) B (K, ε) B (c, ε) =. Consider a distribution µ M 1 with a bounded support and proceeding as before find a number n 0 N such that supp P n µ B (K, ε) for n n 0.

144 Combining this with (14) we can assert that lim P n µ (B (c, ε)) = 0, which implies (9) for measures with bounded supports. Passing to the case of a distribution with unbounded support, fix such a distribution µ M 1 and a number η > 0. Next, choose such a bounded Borel set S X that µ (S) 1 η and define two distributions, µ S M S 1 and γ M 1, by the formulae Obviously and consequently µ S µ (A S) (A) = for A B(X); µ (S) γ(a) = 1 ( µ(a) (1 η) µ S (A) ) for A B(X). η lim sup P n µ (B (c, ε)) µ = (1 η) µ S + ηγ (1 η) lim P n µ S (B (c, ε)) + η lim sup P n γ (B (c, ε)) η. Since the number η is arbitrary, the last inequality completes the proof. 5. The existence and non-uniqueness of stationary distribution. In this section we will discuss the problem of the existence and non-uniqueness of an invariant distribution. We start from quoting a result proved by A. Lasota and J. A. Yorke (see [10], Theorem 3.1). Theorem 2. [Lasota Yorke Theorem] Let (K, ρ) be a metric space in which closed balls are compact and let P K : M(K) M(K) be a Feller operator. Assume that there is a compact set Y K and a distribution υ 0 M 1 (K) such that (15) lim sup ( 1 n ) n PK m υ 0 (Y ) > 0. m=1 Then P K has a stationary distribution. Using the above theorem we may prove the following sufficient condition for the existence of a stationary distribution for iterated function systems. Theorem 3. Consider an IFS {(S i, p i ) : i I} such that for every i I the transformation S i is a contraction and p i is positive. Then {(S i, p i ) : i I} has an invariant distribution.

145 Proof. Let P denote the Markov operator corresponding to {(S i, p i ):i I}. Let K be the attractor of the family {S i : i I}, existing by virtue of Lemma 1. Consider transformations M(K) υ υ X M(X) and M(X) µ µ K M(K) defined by the following formulae υ X (A) = υ (A K) for υ M(K) and A B X ; µ K = µ BK for µ M(X). Next, examine an operator P K : M(K) M(K) given by P K υ = ( P ( υ X)) K for υ M(K). Lemma 3 and the compactness of K yield that (16) supp P µ K for µ M(X) such that supp µ K. This implies that P K is a Markov operator and a Feller operator. Fix an arbitrary x 0 K. Since K is compact, from (16) it also follows that an operator P K, a set Y = K and a distribution υ 0 = δ x0 satisfy condition (15). Thus the assumptions of Theorem 2 are fulfilled. According to this theorem there exists a distribution υ M 1 (K) which is invariant for P K. The measure (υ ) X M(X) is a stationary distribution for P. Observe that if an IFS consists of contractions and positive probabilities then it is globally and locally concentrating (for definitions see [12]), which is a consequence of the Chebyshev inequality and can be proved following the main idea of the proof of Theorem 3.2 from [8]. If a given IFS is additionally nonexpansive, then it is also asymptotically stable, which follows from Theorem 3.1 from [12]. This implies the existence and uniqueness of an invariant distribution. However, in general, the assumptions of the contractivity of transformations and the positivity and continuity of probabilities of a given IFS imply neither asymptotic stability of this IFS nor the uniqueness of an invariant distribution. The counter-example illustrating the above statement is contained in Theorem 1 from [11] and is an application of the results from [4]. We quote this theorem below. Theorem 4. Let S 1 and S 2 be maps from [0, 1] into itself defined by the formulae S 1 (x) = x 3, S 2(x) = x 3 + 2 3 for x [0, 1]; Then there exists a continuous function p : [0, 1] (0, 1) such that the IFS {(S 1, p), (S 2, 1 p)} admits two different invariant distributions.

146 6. Acknowledgments. The author wishes to express her gratitude to Professor A. Lasota for suggesting the problem and numerous stimulating conversations. This research was supported by the Fundation for Polish Science. References 1. Barnsley M.F., Fractals Everywhere, Academic Press, New York, 1988. 2. Barnsley M.F., Demko S.G., Elton J.H., Geronimo J.S., Invariant measures arising from iterated function systems with place dependent probabilities, Ann. Inst. H. Poincaré, 24 (1988), 367 394. 3. Billingsley P., Convergence of Probability Measures, John Wiley, New York, 1968. 4. Bramson M., Kalikow S., Nonuniqueness in g-functions, Israel J. Math., 84 (1993), 153 160. 5. Falconer K.J., Techniques in Fractal Geometry, John Wiley, New York, 1997. 6. Karlin S., Some random walks arising in learning models. I., Pacific J. Math., 3 (1953), 725 756. 7. Lasota A., Mackey M.C., Chaos, Fractals, and Noise. Stochastic Aspects of Dynamics, Springer Verlag, New York, 1994. 8. Lasota A., Myjak J., Semifractals on Polish spaces, Bull. Pol. Ac.: Math., 46 (1998) 179 196. 9., Attractors of multifunctions, Bull. Pol. Ac.: Math., 48 (2000) 317 334. 10. Lasota A., Yorke J.A., Lower bound technique for Markov operators and iterated function systems, Random Comput. Dynamics, 2 (1994) 41 77. 11. Stenflo Ö., A note on a Theorem of Karlin, Statist. Probab. Lett., 54 (2001) 183 187. 12. Szarek T., Markov operators acting on Polish spaces, Ann. Polon. Math., 67 (1997) 247 257. Received September 10, 2001 Jagiellonian University Institute of Mathematics Reymonta 4 30-059 Kraków, Poland e-mail: jaroszew@im.uj.edu.pl