Volume 2008, Article ID 312876,11pages doi:10.1155/2008/312876
Research Article
Applications of Fixed Point Theorems in the Theory of Generalized IFS
Alexandru Mihail and Radu Miculescu
Department of Mathematics, Bucharest University, Bucharest, Academiei Street 14, 010014 Bucharest, Romania
Correspondence should be addressed to Radu Miculescu,[email protected] Received 9 February 2008; Accepted 22 May 2008
Recommended by Hichem Ben-El-Mechaiekh
We introduce the notion of a generalized iterated function systemGIFS, which is a finite family of functionsfk:Xm→X, whereX, dis a metric space andm∈N. In case thatX, dis a compact metric space and the functionsfkare contractions, using some fixed point theorems for contractions fromXmtoX, we prove the existence of the attractor of such a GIFS and its continuous dependence in thefk’s.
Copyrightq2008 A. Mihail and R. Miculescu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
1. Introduction
We start with a short presentation of the notion of an iterated function systemIFS, one of the most common and most general ways to generate fractals. This will serve as a framework for our generalization of an iterated function system.
Then, we introduce the notion of a GIFS, which is a finite family of functionsfk:Xm→X, whereX, dis a metric space andm∈N. In case thatX, dis a compact metric space and the functionsfkare contractions, using some fixed point theorems for contractions fromXmtoX, we prove the existence of the attractor of such a GIFS and its continuous dependence in the fk’s.
IFSs were introduced in their present form by Hutchinsonsee 1 and popularized by Barnsleysee2. In the last period, IFSs have attracted much attention being used from researchers who work on autoregressive time series, engineer sciences, physics, and so forth.
For applications of IFSs in image processing theory, in the theory of stochastic growth models, and in the theory of random dynamical systems, one can consult3–5.
There is a current effort to extend Hutchinson’s classical framework for fractals to more general spaces and infinite IFSs.
Let us mention some papers containing results on this direction.
Results concerning infinite iterated function systems have been obtained for the case when the attractor is compactsee, e.g.,6where the case of a countable iterated function system on a compact metric space is considered. In 7, we provide a general framework where attractors are nonempty closed and bounded subsets of topologically complete metric spaces and where the IFSs may be infinite, in contrast with the classical theorysee2, where only attractors that are compact metric spaces and IFSs that are finite are considered.
Gw ´o´zd´z-Łukawska and Jachymski 8 discuss the Hutchinson-Barnsley theory for infinite iterated function systems.
Łozi ´nski et al.9introduce the notion of quantum iterated function systemsQIFSs which is designed to describe certain problems of nonunitary quantum dynamics.
K¨aenm¨aki 10 constructs a thermodynamical formalism for very general iterated function systems.
Le´sniak11presents a multivalued approach of infinite iterated function systems.
2. Preliminaries
Notations. LetX, dXandY, dYbe two metric spaces.
As usual,CX, Ydenotes the set of continuous functions fromXtoY, andd:CX, Y× CX, Y→RR∪ {∞}, defined by
df, g sup
x∈XdY
fx, gx
, 2.1
is the generalized metric onCX, Y.
For a sequence fnn of elements of CX, Y and f ∈ CX, Y, fn →−s f denotes the pointwise convergence,fn−−→u·c fdenotes the uniform convergence on compact sets, andfn−→u f denotes the uniform convergence, that is, the convergence in the generalized metricd.
Definition 2.1. LetX, dbe a complete metric space and letm ∈ N. For a functionf : Xm
×mk1X→X, the number inf
c:d f
x1, . . . , xm
, f
y1, . . . , ym
≤cmax d
x1, y1, . . . , d
xm, ym
, ∀x1, . . . , xm, y1, . . . , ym∈X 2.2 which is the same as
sup d
f
x1, . . . , xm , f
y1, . . . , ym : max
d x1, y1
, . . . , d
xm, ym
, 2.3
where the sup is taken overx1, . . . , xm, y1, . . . , ym∈Xsuch that max
d x1, y1
, . . . , d xm, ym
>0, 2.4 is denoted byLipfand is called the Lipschitz constant off.
A function f : Xm→X is called a Lipschitz function ifLipf < ∞and a Lipschitz contraction ifLipf<1.
A functionf:Xm→Xis said to be a contraction if d
f
x1, . . . , xm , f
y1, . . . , ym
<max d
x1, y1 , . . . , d
xm, ym
, 2.5
for everyx1, x2, . . . , xm, y1, y2, . . . , ym∈X, such thatxi/yifor somei∈ {1,2, . . . , n}.
LConmXdenotes the set
f:Xm −→ X:Lipf<1
2.6 and ConmXdenotes the set
f:Xm −→ X:f is a contraction
. 2.7
Remark 2.2. It is obvious that
LConmX⊆ConmX. 2.8
Notations.PXdenotes the family of all subsets of a given setXandP∗Xdenotes the set PX\ {∅}.
For a subsetAofPX, byA∗we meanA\ {∅}.
Given a metric space X, d, KXdenotes the set of compact subsets ofX andBX denotes the set of closed bounded subsets ofX.
Remark 2.3. It is obvious that
KX⊆ BX⊆ PX. 2.9
Definition 2.4. For a metric spaceX, d, one considers on P∗Xthe generalized Hausdorff- Pompeiu pseudometrich:P∗X× P∗X→0,∞defined by
hA, B max
dA, B, dB, A inf
r∈0,∞:A⊆BB, r, B⊆BA, r
, 2.10
where
BA, r
x∈X:dx, A< r , dA, B sup
x∈Adx, B sup
x∈A
y∈Binfdx, y
. 2.11
Remark 2.5. The Hausdorff-Pompeiu pseudometric is a metric onB∗Xand, in particular, on K∗X.
Remark 2.6. The metric spacesB∗X, handK∗X, hare complete, provided thatX, dis a complete metric spacesee2,7,12. Moreover,K∗X, his compact, provided thatX, d is a compact metric spacesee2.
The following proposition gives the important properties of the Hausdorff-Pompeiu pseudometricsee2,13.
Proposition 2.7. LetX, dXandY, dYbe two metric spaces. Then iifHandKare two nonempty subsets ofX, then
hH, K h
H, K
; 2.12
iiifHii∈I andKii∈I are two families of nonempty subsets ofX, then
h
i∈I
Hi,
i∈I
Ki
≤sup
i∈I h Hi, Ki
; 2.13
iiiifHandKare two nonempty subsets ofXandf:X→Xis a Lipschitz function, then h
fK, fH
≤LipfhK, H. 2.14
Definition 2.8. Let X, d be a complete metric space and let m ∈ N. A generalized iterated function systemin short a GIFSonXof orderm, denoted byS X,fkk1,n, consists of a finite family of functionsfkk1,n, fk:Xm→Xsuch thatf1, . . . , fn∈ConmX.
Definition 2.9. Letf :Xm→Xbe a continuous function. The functionFf : K∗Xm→ K∗X defined by
Ff
K1, K2, . . . , Km f
K1×K2× · · · ×Km
f
x1, x2, . . . , xm
:xj ∈Kj, ∀j∈ {1, . . . , m} 2.15 is called the set function associated to the functionf.
Definition 2.10. GivenS X,fkk1,na generalized iterated function system onX of order m, the functionFS:K∗Xm→ K∗Xdefined by
FS
K1, K2, . . . , Km n
k1
Ffk
K1, K2, . . . , Km
2.16
is called the set function associated toS.
Lemma 2.11. For a sequencefnnof elements ofCXm, Xandf ∈CXm, Xsuch thatfn→u fand forK1, K2, . . . , Km∈ K∗X, one has
fn
K1×K2× · · · ×Km
−→f
K1×K2× · · · ×Km
2.17
inK∗X, h.
Proof. Indeed, the conclusion follows from the below inequality:
h fn
K1× · · · ×Km , f
K1× · · · ×Km
≤ sup
x1∈K1,...,xm∈Km
d fn
x1, . . . , xm , f
x1, . . . , xm
, 2.18
which is valid for alln∈N.
Proposition 2.12. LetX, dXandY, dYbe two metric spaces and letfn, f ∈CX, Ybe such that supn≥1Lipfn<∞andfn s
−
→fon a dense set inX.
Then
Lipf≤sup
n≥1 Lip fn
, fn u.c
−−−→f. 2.19
Proof. SetM:supn≥1Lipfn.
Let us considerA{x∈X|fmx→fx}, which is a dense set inX, letKbe a compact set inX, and letε >0.
Sincefis uniformly continuous onK, there existsδ∈0, ε/3M1such that ifx, y∈K anddXx, y< δ, then
dY
fx, fy
< ε
3. 2.20
SinceKis compact, there existx1, x2, . . . , xn∈Ksuch that K⊆ n
i1
B
xi,δ 2
. 2.21
Taking into account the fact thatAis dense inX, we can choosey1, y2, . . . , yn ∈Asuch thaty1∈Bx1, δ/2, . . . , yn∈Bxn, δ/2.
Since, for alli ∈ {1, . . . , n}, limm→ ∞fmyi fyi, there exists mε ∈ Nsuch that for everym∈N, m≥mε,we have
dY
fm
yi
, f yi
< ε
3, 2.22
for everyi∈ {1, . . . , n}.
Forx∈K, there existsi∈ {1, . . . , n}, such thatx∈Bxi, δ/2and therefore dX
x, yi
≤dX x, xi
dX xi, yi
< δ 2δ
2 < δ, 2.23
so
dY f
yi , fx
< ε
3. 2.24
Hence, form≥mε, we have dY
fmx, fx
≤dY
fmx, fm
yi dY
fm yi
, f yi
dY f
yi , fx
≤MdX
x, yi
ε 3ε
3
≤M ε
3M12ε 3 < ε.
2.25
Consequently, asxwas arbitrarily chosen inK, we infer thatfn→u fonK, so
fn−−→u·c f. 2.26
The inequalityLipf≤supn≥1Lipfnis obvious.
FromLemma 2.11andProposition 2.12, usingProposition 2.7iiwe obtain the follow- ing lemma.
Lemma 2.13. LetX, dXbe a complete metric space, letm∈N, letSj X,fkjk1,n, wherej∈N∗, and let S X,fkk1,nbe generalized iterated function systems of orderm, such that, for allk ∈ {1, . . . , n}, fkj→−s fkon a dense subset ofXm.
Then, for everyK1, K2, . . . , Km∈ K∗X, FSj
K1, K2, . . . , Km
−→FS
K1, K2, . . . , Km
, 2.27
inK∗X, h.
3. The existence of the attractor of a GIFs for contractions
In this section,mis a natural number,X, dis a compact metric space, andS X,fkk1,n is a generalized iterated function system onXof orderm.
First, we prove thatFS :K∗Xm→ K∗Xis a contractionProposition 3.1, then, using some results concerning the fixed points of contractions fromXmtoXTheorem 3.4, we prove the existence of the attractor of S Theorem 3.5and its continuous dependence in the fk’s Theorem 3.7.
The following proposition is crucial.
Proposition 3.1. FS:K∗Xm→ K∗Xis a contraction.
Proof. ByProposition 2.7, we have h
FS
K1, K2, . . . , Km , FS
H1, H2, . . . , Hm h
n
k1
fk
K1×K2× · · · ×Km ,
n k1
fk
H1×H2× · · · ×Hm
h n
k1
Ffk
K1, K2, . . . , Km
,
n k1
Ffk
H1, H2, . . . , Hm
≤max h
f1
K1× · · · ×Km
, f1
H1× · · · ×Hm
, . . . , h fn
K1× · · · ×Km
,
fn
H1× · · · ×Hm
≤max h
H1, K1
, . . . , h Hm, Km
,
3.1
for allK1, . . . , Km, H1, . . . , Hm∈ K∗X.
It remains to prove that the above inequality is strict.
Let K1, K2, . . . , Km, H1, H2, . . . , Hm ∈ K∗X be fixed such that Ki/Hi for some i ∈ {1,2, . . . , m}.
Since h
FS
K1, . . . , Km , FS
H1, . . . , Hm max
d FS
K1, . . . , Km , FS
H1, . . . , Hm , d
FS
H1, . . . , Hm , FS
K1, . . . , Km , 3.2 we can suppose, by using symmetry arguments, that
h FS
K1, . . . , Km
, FS
H1, . . . , Hm
d FS
K1, . . . , Km
, FS
H1, . . . , Hm
, 3.3
that is,
h n
k1
fk
K1× · · · ×Km ,
n k1
fk
H1× · · · ×Hm
d n
k1
fk
K1× · · · ×Km
,
n k1
fk
H1× · · · ×Hm
.
3.4
Let us note that for every K1, K2, . . . , Km ∈ K∗X, since f1, . . . , fn are continuous functions,FSK1, K2, . . . , Km n
k1fjK1, K2, . . . , Kmis a compact set.
Since for all K1, K2, . . . , Km, H1, H2, . . . , Hm ∈ K∗X, the product topological space {1,2, . . . , n} ××mj1Kj, where{1,2, . . . , n}is endowed with the discrete topology, is compact and the functiont:{1,2, . . . , n} ××mj1Kj→R, given by
t
k, x1, x2, . . . , xm
d fk
x1, x2, . . . , xm
, FS
H1, H2, . . . , Hm
, 3.5
is continuous and d
FS
K1, K2, . . . , Km , FS
H1, H2, . . . , Hm d
n
k1
fj
K1, K2, . . . , Km , FS
H1, H2, . . . , Hm
sup
j,x1,x2,...,xm∈{1,2,...,n}××mj1Kj
d fj
x1, x2, . . . , xm , FS
H1, H2, . . . , Hm
sup
j,x1,x2,...,xm∈{1,2,...,n}××mj1Kj
t
k, x1, x2, . . . , xm
, FS
H1, H2, . . . , Hm
,
3.6
it follows that there existk∈ {1,2, . . . , n}, x1∈K1, x2∈K2, . . . ,andxm∈Kmsuch that d
fkx1, . . . , xm
, FS
H1, . . . , Hm
d FS
K1, . . . , Km
, FS
H1, . . . , Hm
h
FS
K1, . . . , Km
, FS
H1, . . . , Hm
.
3.7
Let us also note that since for allk∈ {1, . . . , n}, the functiontk:Hk→R, given by tky d
xk, y
, 3.8
is continuous,Hkis a compact set, anddxk, Hk inf{dxk, y : y∈Hk}, it follows that there existsyk∈Hksuch that
d xk, yk
d xk, Hk
, 3.9
thus
d xk, yk
d xk, Hk
≤d
Kk, Hk
≤h
Kk, Hk
. 3.10
Now we are able to prove that h
FS
K1, K2, . . . , Km
, FS
H1, H2, . . . , Hm
<max h
H1, K1
, . . . , h
Hm, Km
, 3.11
for allK1, K2, . . . , Km, H1, H2, . . . , Hm∈ K∗Xsuch thatKi/Hifor somei∈ {1,2, . . . , m}.
Indeed, we have h
FS
K1, K2, . . . , Km , FS
H1, H2, . . . , Hm d
fk
x1, x2, . . . , xm
, FS
H1, H2, . . . , Hm
d
fk
x1, x2, . . . , xm ,
n k1
fk
H1×H2× · · · ×Hm
inf d
fk
x1, . . . , xm , fk
y1, . . . , ym
:k∈ {1,2, . . . , n}, y1∈H1, . . . , ym∈Hm
≤d fk
x1, . . . , xm , fk
y1, . . . , ym .
3.12
Ifxkyk, for allk∈ {1,2, . . . , n}, then h
FS
K1, K2, . . . , Km , FS
H1, H2, . . . , Hm
0, 3.13 so the above claim is true.
Otherwise, we have h
FS
K1, K2, . . . , Km , FS
H1, H2, . . . , Hm
≤d fk
x1, . . . , xm , fk
y1, . . . , ym
<max d
x1, yk , . . . , d
xm, ym max
d x1, H1
, . . . , d
xm, Hm
≤max d
K1, H1 , . . . , d
Km, Hm
≤max h
K1, H1 , . . . , h
Km, Hm ,
3.14
for allK1, K2, . . . , Km, H1, H2, . . . , Hm∈ K∗Xsuch thatKi/Hifor somei∈ {1,2, . . . , m}.
Let us recall the following result.
Theorem 3.2. For a contractionf:X→X,there exists a uniqueα∈Xsuch thatfα α.
For everyx0∈X, the sequencexkk≥0, defined by xk1f
xk
, 3.15
for allk∈N, is convergent toα.
Moreover, iffj : X→X, wherej ∈ N, are contractions having the fixed points αj, such that fj→−s fon a dense subset ofX, then
jlim→ ∞αjα. 3.16
Let us mention that the first part ofTheorem 3.2is due to Edelsteinsee14.
Theorem 3.3. Letf:X→Xbe a function having the property that there existsp∈N∗such thatfp is a contraction.
Then there exists a uniqueα∈Xsuch thatfα αand, for anyx0 ∈X, the sequencexkk≥0 defined byxk1fxkis convergent toα.
Proof. It is clear thatfp has a unique fixed pointα∈X and, for everyy0 ∈X, the sequence ykk≥1defined byyk1fpykis convergent toα.
In particular fory0j fjx0, where x0 ∈ X and j ∈ {0,1, . . . , p−1}, the sequence ynjfnpjx0n≥0is convergent toα.
It follows that the sequencexkk≥0, defined byxk1fxk, is convergent toα.
Since every fixed point offis a fixed point offp, it follows thatαis the unique fixed point off.
Theorem 3.4. Given a contractionf:Xm→X, there exists a uniqueα∈Xsuch that
fα, α, . . . , α α. 3.17
For everyx0, x1, . . . , xm−1∈X, the sequencexkk≥0defined by
xkmf
xkm−1, xkm−2, . . . , xk
, 3.18
for allk∈N, is convergent toα.
Moreover, if for everyj∈N, fj:Xm→Xis a contraction andαjis the unique point ofXhaving the property that
fj
αj, αj, . . . , αj
αj, 3.19
then
jlim→ ∞αjα, 3.20
provided thatfj→−s fon a dense subset ofXm.
Proof. Letg:X→Xandgj:X→Xbe the functions defined by gx fx, x, . . . , x,
gjx fjx, x, . . . , x, 3.21
for everyx∈X.
Thengandgjare contractions.
It follows, usingTheorem 3.2, that there exist uniqueα∈Xandαj∈Xsuch that
αgα fα, α, . . . , α, αjg
αj f
αj, αj, . . . , αj ,
jlim→ ∞αjα.
3.22
The functionh:Xm→Xm, given by h
x0, x1, . . . , xm−1
x1, x2, . . . , xm−1, f
x0, x1, . . . , xm−1
x1, x2, . . . , xm−1, xm
, 3.23
for allx0, x1, . . . , xm−1∈X, fulfills the conditions ofTheorem 3.3takingpm.
Therefore, there existsβ1, β2, . . . , βm∈Xmsuch that h
β1, β2, . . . , βm
β1, β2, . . . , βm
, 3.24
so
β1β2· · ·βmf
β1, β2, . . . , βm
. 3.25
Hence,
β1β2· · ·βmα. 3.26
Then,
l→ ∞limhl
x0, x1, . . . , xm−1 lim
l→ ∞
xl, xl1, . . . , xlm−1
α, α, . . . , α, 3.27 so we conclude our claim.
Using Proposition 3.1, Theorem 3.4, and Lemma 2.13, we obtain the following two results.
Theorem 3.5. Given a generalized iterated function system of ordermS X,fkk1,n, there exists a uniqueAS∈ K∗Xsuch that
FS
AS, AS, . . . , AS
AS. 3.28 Moreover, for anyH0, H1, . . . , Hm−1∈ K∗X, the sequenceHnn≥0, defined by
HnmFS
Hnm−1, Hnm−2, . . . , Hn
, 3.29
for alln∈N, is convergent toAS.
Definition 3.6. Letmbe a fixed natural number, letX, dbe a compact metric space, and let S X,fkk1,nbe a generalized iterated function system onXof orderm.
The unique setASgiven by the previous theorem is called the attractor of the GIFSS.
Theorem 3.7. IfS X,fkk1,nandSj X,fkjk1,n, wherej ∈N, are GIFS of ordermsuch that, for everyk∈ {1,2, . . . , n},fkj→−s fkon a dense set inXm, then
A Sj
−→AS. 3.30
Acknowledgments
The authors want to thank the referees whose generous and valuable remarks and comments brought improvements to the paper and enhanced clarity. The work was supported by GAR 30/2007.
References
1 J. E. Hutchinson, “Fractals and self-similarity,” Indiana University Mathematics Journal, vol. 30, no. 5, pp. 713–747, 1981.
2 M. F. Barnsley, Fractals Everywhere, Academic Press Professional, Boston, Mass, USA, 2nd edition, 1993.
3 J. H. Elton and M. Piccioni, “Iterated function systems arising from recursive estimation problems,”
Probability Theory and Related Fields, vol. 91, no. 1, pp. 103–114, 1992.
4 B. Forte and E. R. Vrscay, “Solving the inverse problem for function/image approximation using iterated function systems—I: theoretical basis,” Fractals, vol. 2, no. 3, pp. 325–334, 1994.
5 L. Montrucchio and F. Privileggi, “Fractal steady states in stochastic optimal control models,” Annals of Operations Research, vol. 88, pp. 183–197, 1999.
6 N.-A. Secelean, “Countable iterated function systems,” Far East Journal of Dynamical Systems, vol. 3, no. 2, pp. 149–167, 2001.
7 R. Miculescu and A. Mihail, “Lipscomb’s spaceωAis the attractor of an infinite IFS containing affine transformations ofl2A,” Proceedings of the American Mathematical Society, vol. 136, no. 2, pp. 587–592, 2008.
8 G. Gw ´o´zd´z-Łukawska and J. Jachymski, “The Hutchinson-Barnsley theory for infinite iterated function systems,” Bulletin of the Australian Mathematical Society, vol. 72, no. 3, pp. 441–454, 2005.
9 A.Łozi ´nski, K. ˙Zyczkowski, and W. Słomczy ´nski, “Quantum iterated function systems,” Physical Review E, vol. 68, no. 4, Article ID 046110, 9 pages, 2003.
10 A. K¨aenm¨aki, “On natural invariant measures on generalised iterated function systems,” Annales Academiæ Scientiarium Fennicæ. Mathematica, vol. 29, no. 2, pp. 419–458, 2004.
11 K. Le´sniak, “Infinite iterated function systems: a multivalued approach,” Bulletin of the Polish Academy of Sciences. Mathematics, vol. 52, no. 1, pp. 1–8, 2004.
12 K. J. Falconer, The Geometry of Fractal Sets, vol. 85 of Cambridge Tracts in Mathematics, Cambridge University Press, Cambridge, UK, 1986.
13 K. J. Falconer, Fractal Geometry: Mathematical Foundations and Applications , John Wiley & Sons, Chichester, UK, 1990.
14 M. Edelstein, “On fixed and periodic points under contractive mappings,” Journal of the London Mathematical Society, vol. 37, pp. 74–79, 1962.