Ohrimenko+ / Barnsley. Superfractals
.pdf240 |
Semigroups on sets, measures and pictures |
with insight into the observed visual richness of some orbital pictures and help us to imagine, for example, the ever changing diversity of the flowers in Figure 3.21 as the horizon is approached.
Later, in Chapter 4, when we are discussing the theory and applications of fractal tops, we will attach great significance to the code spaces of orbital pictures; we will find that they correspond to special subsets of fractal sets and that they have applications in computer graphics.
The addresses and panels of an orbital picture
The orbital picture P = O(P0) possesses a very interesting and useful code space. To reveal this structure, we decompose P into special ‘tiles’, which we call panels, defined in the following manner. We define a sequence of subsets {Dn }∞n=0 inductively in terms of the canonical sequence {Pn = fσ (n)
D0 = DP0 , Pn = P0 P1 · · · Pn and Dn for n = 0, 1, 2, . . .
Notice that D0 is nonempty. Let {Dnk }kK=0 denote the subsequence of {Dn }∞n=0 which consists of those Dn that are nonempty, where K ≥ 0 is either a finite integer or else ∞. We will write {0, 1, 2, . . . , K } when K = ∞ to denote the set
{0, 1, 2, . . . }.
D e f i n i t i o n 3.5.10 Let {Dnk }kK=0 be defined as above. A panel of the orbital picture P = O(P0) is defined to be a picture of the form
|
|
|
|
Qnk = Pn |
k |Dnk |
for some k {0, 1, 2, . . . , K }. |
|
|
|
|
|||||||
The code σ (nk ) |
|
|
|
|
|
, as in Definition 3.5.2, is defined to be the address |
|||||||||||
of the panel |
|
{1,2,...,N } |
|
|
|
|
|
|
|
|
|
||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||
|
|
|
|
|
|
|
|
|
|
Qσ (nk ) := Qnk . |
|
|
|
|
|
|
|
The set of panels of the orbital picture is the set denoted by |
|
|
|
|
|||||||||||||
Ppanels (P0) = {P |
: P = Qnk |
for some k {0, 1, 2, . . . , K }}. |
|
||||||||||||||
When k |
≥ |
1 and Pn |
k |
overlaps P |
, the panel Qn |
k |
is the segment of the |
||||||||||
picture Pn |
k |
|
|
|
|
|
|
nk −1 |
|
nk −1 = |
|
|
f1(P0) |
|
|||
|
that ‘sticks out from underneath’ the picture P |
P0 |
|
|
|||||||||||||
f2(P0) · · · fσ (nk −1)(P0). Clearly P is the disjoint union of the pictures in the sequence {Qnk }kK=0, and we have
P = kK=0 Qnk ,
where the order in which the panels are combined, in the tops union kK=0 Qnk , makes no difference.
3.5 Orbits of pictures under IFS semigroups |
241 |
|||||||||
Let denote { |
1,2,...,N } and let denote {1,2,...,N }. Then let us define |
|
||||||||
|
|
= { |
σ (n |
k |
) : k |
{ |
0, 1, 2, . . . , K |
}} |
|
|
|
P0 |
|
|
|
|
|
||||
to be the set of addresses of the orbital picture P = O(P0), so that |
|
|||||||||
|
|
Ppanels |
= Qσ : σ P0 |
. |
|
|
||||
Let P0 denote the closure of P0 in the natural topology on ; see Chapter 1. Let
P0 = P0 ∩ .
Then P0 is the set of points in the closure of P0 that are not in P0 . We call
P0 = P0 P0
the code space of the orbital picture P = O(P0).
In the above definition we assume, as elsewhere, that when we are given an orbital picture we know the condensation set and semigroup by which it is generated.
E x e r c i s e 3.5.11 |
Prove that P0 is a closed subset of . |
E x e r c i s e 3.5.12 |
Consider the code space P0 of the orbital picture of P0 |
when the IFS is {R2; f1(x, y) = 12 x, 12 y , f2(x, y) = ( 12 (x + 1), 12 y)}. Show that the set attractor A of the IFS is the closed line segment that connects the points
x = 0 and x = 1 on the x-axis. Let C R2 be a nonempty closed set such that A ∩ C = . Show that A C = and that A = .
Shift transformation on the code space of an orbital picture
The following theorem says that the space P0 P0 is mapped into itself by the shift transformation. This enables us to define certain topological invariants of orbital pictures.
T h e o r e m 3.5.13 |
Let P denote the orbital picture of P0 under the IFS |
|||||||
semigroup |
f |
, f |
,..., f |
N } |
(X). Let |
P0 |
|
denote the code space of P. Let |
|
S{ 1 |
2 |
|
|
P0 |
|||
|
|
|
|
|
S : → |
|||
denote the shift operator on code space discussed at the end of Chapter 2. Then
S P0 P0 P0 P0 ;
in particular, |
|
|
S P0 |
P0 and S P0 |
P0 . |
242 |
|
|
|
|
|
|
|
|
|
|
|
|
|
Semigroups on sets, measures and pictures |
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||||||||||||||||||||||||||||||||
P r o o f |
|
|
Let |
|
|
|
|
|
P0 |
|
|
|
|
|
|
= |
then, by the definition of the action of the |
|||||||||||||||||||||||||||||||||||||||||||||||||
|
|
σ |
|
|
|
|
|
|
. If σ |
|
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||
shift transformation, S(σ ) |
= |
|
|
|
|
|
|
|
P0 |
|
|
| |
|
| = |
1 then |
S(σ ) |
= |
|
|
|
|
|
P0 |
. If |
| |
|
|
| = |
||||||||||||||||||||||||||||||||||||||
|
|
σ |
|
|
|
|
. If |
|
σ |
|
|
|
|
|
|
|
|
|
|
|
σ |
|
|
|||||||||||||||||||||||||||||||||||||||||||
n > 1, let us write σ |
|
= |
σ1σ2 |
σ3 |
|
· · · |
σn |
|
|
. Then Dc(σ |
σ |
σ |
3 |
|
σ |
|
) |
= |
. Recall that |
|||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
{ |
|
|
|
}l=0 |
|
|
|
|
|
|
|
|
|
|
|
|
P0 |
|
|
= |
|
|
|
1 |
|
2 |
|
··· |
|
n |
|
|
|
|
|
|
|
|
|
|
|||||||||||||||||
|
|
|
|
|
|
|
|
|
Dl |
|
is defined, as above, by Dl |
|
|
|
l \ |
|
|
|
l−1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||||||||||||||||||||||||||
the sequence |
|
|
∞ |
|
|
|
DP |
|
|
DP |
|
|
. We need to prove |
|||||||||||||||||||||||||||||||||||||||||||||||||||||
that the address S(σ ) = σ2σ3 · · · σn corresponds to a panel, that is, Dc(σ2σ3···σn ) |
= . |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
So, |
|
suppose |
|
that |
|
|
Dc(σ2σ3···σn ) = . Since |
Dc(σ1σ2σ3···σn ) |
= it follows that |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||
we can find x Dc(σ1σ2σ3···σn ). Thus there exists x0 DP0 |
= D0 such that x = |
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
fσ1 ( fσ2σ3···σn (x0)). Since Dc(σ2σ3···σn ) = it follows that |
|
fσ2σ3···σn (x0) / Dc(σ2σ3···σn ). |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
But fσ2σ3 |
··· |
σn |
(x0) |
|
DPc(σ |
σ |
|
σ |
|
) , |
which |
implies |
that |
|
fσ2σ3 |
··· |
σn (x0) |
|
DP |
|
|
|
|
. |
||||||||||||||||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2 |
|
3··· n |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
c(σ2σ3···σn ) |
|||||||||||||
Noting |
|
that |
|
|
|
Dc(σ2 |
σ3 |
··· |
σn ) |
= |
DP |
|
|
|
|
|
|
DP |
|
|
|
|
, |
we |
|
have |
|
fσ2σ3 |
··· |
σn (x0) |
|
|||||||||||||||||||||||||||||||||||
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
c(σ2σ3···σn ) \ |
|
|
|
c(σ2σ3···σn )−1 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|||||||||||||||||||||
DP |
|
|
|
|
|
|
. Therefore |
|
fσ2σ3 |
··· |
σn |
(x0) |
= |
fσ (x0) for some σ |
|
with c(σ ) < |
||||||||||||||||||||||||||||||||||||||||||||||||||
c(σ2σ3 |
···σn )−1 |
|
|
− |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
|
|
|
|
|
= |
|
|
σ1 |
|
|
|
|
|
P0 |
|
|
|
|
1 |
|
|
||||||||||||||||||||
c(σ2σ3 |
· · · |
σn ) |
1. |
|
It |
|
follows |
|
that |
|
|
= |
|
( fσ |
(x0)) |
|
|
|
|
0 |
) |
|
|
|
|
|
|
|
|
|||||||||||||||||||||||||||||||||||||
c(σ1 |
2 |
|
|
3 · · · |
|
|
n |
), which implies that D |
c(σ1σ2σ3···σn ) = |
|
, |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
||||||||||||||||||||||||||||||||||||
|
σ |
σ |
|
|
|
|
σ |
|
|
|
|
|
|
|
|
|
|
|
|
|
which is a contradiction. |
|||||||||||||||||||||||||||||||||||||||||||||
We conclude that Dc(σ2σ3···σn ) = , that Qc(S(σ )) is indeed a panel and hence that S(σ ) P0 . This proves that S( P0 ) P0 .
Finally, using the continuity of S : → , we have S( P0 ) P0 .
It is appropriate here to mention the transformation of the colours of a picture by means of a mapping C : C → C, where C is the colour space. Let P = C. Then C(P) is the picture whose domain is DP and whose colour at the point x DP is C(P(x)). The key distinction between C(P) where C : C → C and H (P) where H : X → X lies with the domains of H and C.
Typically the colour space C is discrete and so we can endow it with the discrete topology. But it may be for example {(R, G, B) R3 : 0 ≤ R, G, B ≤ 255}, in which case we can give it the natural topology of R3. In any case, it makes sense for us to refer to a homeomorphism C : C → C.
D e f i n i t i o n 3.5.14 Two pictures P, P are said to be topologically
equivalent iff there is a homeomorphism |
H : X |
→ |
X and a homeomorphism |
|
|
||
C : C → C such that |
|
|
|
P = C(H (P)).
E x e r c i s e 3.5.15 Show that C(H (P)) = H (C(P)).
Figure 3.30 provides an illustration of two different-looking pictures that are topologically equivalent. The following theorem tells us that if two pictures are topologically equivalent and one of them is an orbital picture then the other is also an orbital picture, with the same code space structure.
T h e o r e m 3.5.16 Let P and P be topologically equivalent pictures. Let P be the orbital picture of P0 C under the IFS semigroup S{ f1, f2,..., fN }. Then P
3.5 Orbits of pictures under IFS semigroups |
243 |
Figure 3.30 These two leaves are related by a homeomorphism. If one is an orbital picture then the other can also be represented as an orbital picture, with the same code space structure.
is the orbital picture of P0 = C(H (P0)) under the IFS semigroup
S{H f1 H −1,H f2 H −1,...,H fN H −1}
where H × C : X × C → X × C is the homeomorphism that provides the equivalence between P and P. In particular, both orbital pictures have the same code space structure; that is,
P0 |
= P0 |
and P0 |
= P0 . |
|
|
|
|
P r o o f This result follows immediately once it is shown that P is the orbital
picture of P0 = C(H (P0)) under the IFS semigroup S{H f1 H −1,H f2 H −1,...,H fN H −1}. But this is a direct consequence of the fact that a homeomorphism is one-to-one
and invertible, which in turn implies that Q is a panel of the orbital picture of P0 iff Q = C(H (Q)) is a panel of the orbital picture of P0 = C(H (P0)) under the IFS semigroup S{H f1 H −1,H f2 H −1,...,H fN H −1} and that the addresses of these two panels are the same. Notice that the continuity of H ensures that the functions in the IFS
{X; f 1 |
, f 2, . . . , f N }, where f n = H fn H −1 for n = 1, 2, . . . , N , are continuous |
||||||
|
|
{ |
1 |
2 |
N } |
are continuous. |
|
when those of |
|
X; f |
, f |
, . . . , f |
|
||
Two orbital pictures equivalent to each other are illustrated in Figure 3.31. This invariance of the code space of an orbital picture under homeomorphism,
as expressed in Theorem 3.5.16, together with Theorem 3.5.13 enables us to define certain real numbers which are unchanged by homeomorphisms and which may capture the visual richness of the orbital picture. These topological invariants arise from deep within dynamical systems theory; see for example [56] and references therein. We summarize them, for shift transformations, in what follows.
244 |
Semigroups on sets, measures and pictures |
|
Symbolic invariants of orbital pictures |
The mapping |
|
|
S : P0 P0 → P0 P0 |
is a continuous mapping from a compact metric space into itself. Hence, from [56], pp. 105–9, we discover that it possesses:
(i) a well-defined number of periodic points, of period n,
Cn (P0) := ( σ P0 P0 : S◦n (σ ) = σ ( |
|
for each n = 1, 2, 3, . . . ; |
||||||
(ii) a well-defined( |
growth rate for periodic cycles( |
, |
|
|
||||
|
|
|
log2 Cn (P0) |
|||||
|
CP0 := lim sup |
|
|
|
|
|
; |
|
|
|
|
n |
|
|
|||
|
n→∞ |
|
|
|
|
|
|
|
(iii) a well-defined ζ -function (the zeta-function), |
|
|
|
|||||
|
∞ |
Cn (P0) |
||||||
|
) |
|
|
zn , |
||||
|
ζP0 (z) = exp |
= |
1 |
n |
|
|||
|
n |
|
|
|
|
|||
|
|
|
|
|
|
|
||
where z C and the series converges for |z| < (loge 2)CP0 ; (iv) a well-defined topological entropy
hP0 := htop(S : P0 → P0 ).
The topological entropy htop of a dynamical system f : X → X is defined formally in the next part of the subsection. We use log2 rather than loge in our definitions because we are interested in questions relating to information theory.
We may refer to the quantities Cn (P0), CP0 , ζP0 (z) and hP0 as being associated with the orbital picture from which the dynamical system arises; so for example we will say in full that hP0 is the symbolic entropy of the orbital picture of
P0 under the IFS semigroup S{ f1, f2,..., fN }. More briefly, we may say that hP0 is the entropy of P modulo P0.
Notice that Cn (P0) ≥ 1 because S( ) = . Also, Cn (P0) N n + 1 because the number of periodic points of period n for S : {1,2,...,N } → {1,2,...,N } is N n . It follows that
0 ≤ CP0 ≤ log2 N .
The zeta-function of an orbital picture always possesses singularities on the circle |z| = 2−CP0 and may be a meromorphic function on the whole complex plane. For example, when P0 = {1,2,...,N } we have CP0 = log2 N and
ζP0 (z) exp !z |
∞ |
N n zn & |
|
exp z . |
|||||
|
) |
|
|
= |
|
|
|
|
|
= |
+ n |
1 |
n |
1 |
− |
N z |
|||
|
= |
|
|
|
|
|
|
|
|
3.5 Orbits of pictures under IFS semigroups |
245 |
Figure 3.31 These two images correspond to orbital pictures which are homeomorphic to the orbital picture represented at the bottom left of Figure 3.33, so the topological entropies are the same. The fractal dimensions of their limit sets are quite different, however.
Zeta-functions associated with dynamical systems have been much studied; see for example [83]. I have mentioned the zeta-function of an orbital picture because it seems to me such an extraordinary thing that we can assign, in a meaningful manner based on the analysis of patterns, an analytic function to a class of pictures, albeit pictures of a quite special type.
We discuss formally the topological entropy in the next part of the subsection. In some cases, it is equal to the growth rate of periodic orbits
hP0 = CP0
and can be estimated accurately; see Figure 3.32. This is true, for example, when S :P0 → P0 is related, in an appropriate way, to a transitive topological Markov shift; see [56], p. 176, and [77].
A simple example of a code space associated with an orbital picture is provided by the orbital picture in Figure 3.3, for which
|
= { |
, 1, 11, 111, 1111, . . . |
} |
and |
P0 = { |
11111 |
· · · } |
. |
P0 |
|
|
|
|
In this case the growth rate of periodic cycles and the symbolic entropy are zero. For the orbital picture in Figure 3.21 the symbolic entropy and the growth rate of periodic orbits is − log2 0.7 = 0.5145 · · · We were able to compute this entropy, and the entropies of the orbital pictures in Figure 3.32, because in each case the mapping S : P0 → P0 is related to the piecewise linear mapping Rβ :
[0, 1] → [0, 1] defined by
Rβ (x) = (β x) mod 1,
246 |
Semigroups on sets, measures and pictures |
where β (1, ∞) is a parameter. The topological entropy of Rβ (x) is log2 β. See for example [77] and [82] and also [88].
E x e r c i s e 3.5.17 On the basis of your own guesses, arrange, in order of increasing growth rate of periodic cycles, the orbital pictures illustrated in Figure 3.33. Some close-ups are shown in Figure 3.34. Provide a rationale for your guesses.
Aside: Topological entropy of a dynamical system
You could skip this section on a first reading, but you should come back to it later. Here we follow [56], p. 108. Topological entropy is the most important numerical invariant related to the diversity or ‘growth’ of orbits of points. It represents the number of orbits of points, under the dynamical system, that are distinguishable with arbitrarily fine but finite precision. Let f : X → X be a continuous mapping from a compact metric space (X, d) to itself. Define an increasing sequence of
metrics {dn : X × X → [0, ∞)}∞n=1 by
dn (x, y) = max d F◦k (x), F◦k (y) .
0≤k≤n−1
You should verify that this equation does indeed define a metric for each n {1, 2, 3, . . . }. Let
Bn (x, ) = {y X : dn (x, y) < }
denote the open ball of centre x and radius > 0 in the metric dn . Let Nn ( ) denote the minimum number of such balls needed to cover X. This number is finite because X is compact. Let
1
hd ( f, ) = lim sup n log2 Nn ( ).
n→∞
This is a monotone decreasing function of (0, 1) and hence has a finite or infinite limit as approaches zero through positive values. The topological entropy of the dynamical system f : X →X is defined to be
htop( f ) := |
lim |
h |
d |
( f, ). |
|
→ |
0, >0 |
|
|
||
|
|
|
|
|
|
The remarkable fact is that this quantity is independent of the metric, so long as the metric defines the same topology. See [56], p. 109.
The following theorem gives some properties of the topological entropy that
may be useful towards its calculation in specific examples. |
|
|
|
|
|
|
||||||||||||
T h e o r e m 3.5.18 |
Let f : X → X be a continuous mapping from a compact |
|||||||||||||||||
metric space (X, d) to itself. Let m ≥ 1 be an integer. |
|
|
|
|
|
|
|
|
||||||||||
(i) If |
Y |
|
X is closed and such that |
f (Y) |
= |
Y then h |
top |
( f |
| |
Y ) |
≤ |
h |
top |
( f ). |
||||
|
m |
|
|
Y ) : i |
|
|
|
|
|
|
|
|||||||
htop |
( f ) max htop( f |
|
1, 2, . . . , m . |
|
|
|
= 1, 2, . . . , m, then |
|||||||||||
(ii) If |
X = |
i=1 |
Yi , where Yi is closed and f |
(Yi ) = Yi for i |
||||||||||||||
|
|
|
= |
{ |
|
| i |
= |
|
|
} |
|
|
|
|
|
|
|
|
3.5 Orbits of pictures under IFS semigroups |
247 |
Figure 3.32 Four ‘buttercup field’ orbital pictures, with estimates of their entropies and diversities, modulo the buttercup. In these cases the entropy tells the growth rate of the number of periodic cycles of little pictures, i.e. panels, as you approach the horizon. The diversity tells how many non-homeomorphic segments of the buttercup are contained in the set of panels. See Definition 3.5.29.
(iii)htop( f ◦m ) = mhtop( f ).
(iv)If f : X→X is a continuous mapping from a compact metric space (X, d) to
itself then f : htop( f × f ) = htop( f ) + htop( f ). |
|
P r o o f See [56], p. 111. |
|
When the domain of a picture P C is compact, we may define the topological entropy of P to be the greatest lower bound for the set of entropies of all the homeomorphisms H × C : X × C → X × C such that
H (C(P)) = P.
That is,
h(P) := inf{htop(H × C : X × C → X × C) : H (C(P)) = P}. (3.5.14)
248 |
Semigroups on sets, measures and pictures |
This quantity is a topological invariant and may correlate with the amount of information needed to describe the picture in terms of a dynamical system. However, h(P) takes no account of the amount of information needed to describe transformations H × C whose entropies are close to h(P).
Dynamics on panels and orbital pictures
Theorem 3.5.13 allows us to construct a dynamical system on the panels of an orbital picture. We simply define
T : Ppanels → Ppanels
by
T (Qσ ) = QS(σ ) for all Qσ Ppanels ,
where we recall that Qσ := Qc(σ ), where c is the counting function in Equation (3.5.2) in Definition 3.5.2, giving the canonical ordering. We now define an addressing function
|
φ : P0 |
→ Ppanels |
|
||
by |
|
|
|
|
|
φ(σ ) |
= |
Q |
for all σ |
|
. |
|
σ |
|
P0 |
||
Then φ is one-to-one and onto; hence φ is invertible.
The relationship between the action of T on Ppanels and S on P0 may be represented by the diagram
P0 |
φ Ppanels |
|
S ↓ |
↔ |
↓ T . |
P0 |
↔φ |
Ppanels |
Here we have used double-headed arrows to emphasize that φ : P0 invertible.
The action of T on the space of panels may be extended to yield a mapping on the orbital picture itself, T : P → P, by defining T : DP → DP as
T (x) |
= |
f −1(x) when x |
|
D |
Qσ |
, for all Q |
σ |
P |
panels |
. |
|
σ1 |
|
|
|
|
Then the orbital picture P is mapped into itself by T : DP → DP, that is,
T (P) P.
(In particular, when T : DP → DP is continuous, we have
h(P) ≤ htop(T : P → P) ≤ hP0 ,
