Cairns 2007
Cairns 2007
JOURNAL OF MATHEMATICS
Volume 37, Number 2, 2007
c
Copyright 2007 Rocky Mountain Mathematics Consortium
371
372 G. CAIRNS, A. KOLGANOVA AND A. NIELSEN
For flows and single maps, the three notions k-transitive for k ∈ N,
weak mixing and elastic are all equivalent, while we will see that,
for general group actions, the three conditions are distinct. The aim
of this paper is to give an essentially self-contained discussion of the
relations between the six conditions: strongly mixing, k-transitive for
all k, weakly mixing, elastic, totally transitive and transitive. We also
examine their inheritance properties, and the special cases of actions
of abelian groups and actions which are chaotic in the sense that they
are transitive and the points with finite orbit form a dense set. See
Theorems 1, 2 and 3. The general conclusion is that, for abelian groups,
the relations between the six conditions have the same equivalences
as they do for flows and single maps, while the assumption that an
action (of a not necessarily abelian group) is chaotic has an even greater
combining effect on the conditions.
The sections of this paper are: Section 1, Brief review of transitivity,
Section 2, Logical implications between the notions, Section 3, Exam-
ples, Section 4, Inheritance of notions (a) under semi-conjugacy, (b)
from and by subgroups, (c) when taking products, (d) when passing to
hyperspace, Section 5, Actions of abelian groups and Section 6, Chaotic
actions.
The next result is well known, see [20, Theorem 9.22], and is often
presented for continuous maps of spaces, see for example, [29, Prop.
I.11.4]:
S = {g ∈ G; gU ∩ Vi = ∅ for all i = 1, . . . , k}
Now recall:
It is easy to see that the class of sets having the Baire property is a
σ-algebra. We state the following simple lemma without proof:
For more information on sets with the Baire property, see [32], [33,
Chapter 4], [9, Chapter XII.8] and Exercise 6 of [9, Chapter IX.5].
Note that for sets A with the Baire property, the presentation A =
B ∪ (U \C) is not unique. Obviously one can suppose in general that
B ∩ U = ∅ and that C ⊆ U , but this still doesn’t eliminate the lack of
uniqueness. In particular, there exist sets A with the Baire property
for which one can write A = B ∪ (U \C) and A = B ∪ (U \C ), where
B, B , C, C are meager and U, U are open, and U = U . For example,
the interval A = (0, 1) can be written as ∅∪A, and as {1/2}∪U , where
U = (0, (1/2)) ∪ ((1/2), 1). Nevertheless, there is a “canonical” way to
write a set with the Baire property, as the following lemma shows:
The following result is probably well known, but we could not find its
proof in the literature. It was stated without proof by Oxtoby in [33].
strongly mixing
transitive
and the “second countable Baire” hypothesis is only used in the proof
that weak mixing implies total transitivity.
k
k
M = Gx = gi Hx = gi Hx.
i=1 i=1
TOPOLOGICAL TRANSITIVITY AND MIXING NOTIONS 381
for all g, x ∈ G and f : G → {0, 1}. It is well known and not difficult
to see that this action is strongly mixing [24].
4. Inheritance of notions.
Proof. Parts (b), (c), (d) and (f) are obvious. For (e), note that if
H is totally transitive, and K is a finite index subgroup of G, then
H ∩ K has finite index in H and so H ∩ K is transitive and thus K is
transitive.
For (a), choose a right transversal {g1 = id, g2 , . . . , gl } of H in G;
G = Hg1 ∪ · · · ∪ Hgl .
Let U and V be nonempty open subsets of M and consider the set
{g ∈ G; gU ∩ V = ∅} = {g ∈ Hgi ; gU ∩ V = ∅}
i=1,... ,l
= {hgi ; h ∈ H and h(gi U ) ∩ V = ∅}
i=1,... ,l
= {h ∈ H; h(gi U ) ∩ V = ∅}gi .
i=1,... ,l
Proof. Parts (a) and (e) are obvious; part (a) is given in [24]. Parts
(b) and (d) follow from the following:
TOPOLOGICAL TRANSITIVITY AND MIXING NOTIONS 385
Parts (c) and (d) are well known. For (c), let G be the group
of homeomorphisms of R, and let H be the subgroup of orientation
preserving homeomorphisms; see Examples 3 and 4. For (f), let G be
the group R∗ of nonzero reals, acting by multiplication on the real line,
and let H be the positive reals R+∗ , see Example 1.
Note that the above proposition gives examples which show that
Proposition 4 (a) fails without the finite index hypothesis. Indeed,
suppose that G is strongly mixing M . Then G2 is not strongly mixing
on M 2 , as we remarked above, but the diagonal action of G is strongly
mixing on M 2 by Proposition 6(a). That is, on M 2 , the diagonal
subgroup {(g, g); g ∈ G} ≤ G2 is strongly mixing, but the group G2
isn’t.
that is, just the nonempty compact subsets contained in the open ball
Bε (x) of (M, d). Similarly, for points x1 , . . . , xn ∈ M , the open ball
Bε ({x1 , . . . , xn }) in K(M ) is
The following result generalizes results for the case of a single map
in [7, 37], see [17, 21, 28] for related results.
TOPOLOGICAL TRANSITIVITY AND MIXING NOTIONS 389
Φ̂ weakly mixing Φ̂ elastic
Φ̂ totally transitive
Φ̂ transitive
Φ totally transitive
Φ transitive
of g such that gBε/2 (xi ) ∩ Bε/2 (yi ) = ∅ is finite. Therefore, all but
finitely many g ∈ G satisfy gBε/2 (xi ) ∩ B(ε/2) (yi ) = ∅, i ∈ {1, . . . , n}.
Consider one such g. For i ∈ {1, . . . , n} let xi ∈ Bε/2 (xi ) and yi =
gxi ∈ Bε/2 (yi ), and put S = {x1 , . . . , xn }, T = gS = {y1 , . . . , yn }.
Then
ε ε
h(A, S ) ≤ h(A, S) + h(S, S ) < + = ε,
2 2
and, likewise, h(B, T ) < ε. Since T = gS , we have gBε (A) ∩ Bε (B) =
∅.
Φ k-transitive for all k ⇒ Φ̂ k-transitive for all k. Consider 2k
balls of (K(M ), h): Bε (Ai ), Bε (Bi ), i ∈ {1, . . . , k}. Cover each Ai and
Bi by n balls of (M, d), all of radius ε/2 and with centers xij ∈ Ai ,
yij ∈ Bi . Since Φ is kn-transitive, some g ∈ G satisfies gBε/2 (xij ) ∩
Bε/2 (yij ) = ∅, for all i ∈ {1, . . . , k}, j ∈ {1, . . . , n}. Arguing as in the
previous paragraph, this g also satisfies gBε (Ai ) ∩ Bε (Bi ) = ∅, for all
i ∈ {1, . . . , k}.
Φ̂ transitive ⇒ Φ elastic. Suppose Bε (x), Bε (x1 ), . . . , Bε (xn ) are
open balls of (M, d). We must find a g such that gB( x) ∩ Bε (xi ) =
∅, for all i ∈ {1, . . . , n}. Since Φ̂ is transitive there is a g such
that gBε ({x}) ∩ Bε ({x1 , . . . , xn }) = ∅ in K(M ). That is, from the
discussion immediately before the proposition, there is A ∈ K(M ) with
A ⊆ Bε (x), gA ⊆ ∪i Bε (xi ) and gA ∩ Bε (xi ) = ∅, for all i ∈ {1, . . . , n}.
But this also means gBε (x) ∩ Bε (xi ) = ∅, for all i ∈ {1, . . . , n}, as
required.
g2 U2 ∩ U1 = ∅ and g2 V2 ∩ V1 = ∅.
U = gk Uk ∩ · · · ∩ g2 U2 ∩ U1 = ∅,
g1 U1 ∩ U2 = ∅ and g1 U1 ∩ V2 = ∅,
6. Chaotic actions.
REFERENCES
33. J.C. Oxtoby, Measure and category, 2nd ed., Grad. Texts in Math., Springer-
Verlag, New York, 1980.
34. J. Peters and T. Pennings, Chaotic extensions of dynamical systems by
function algebras, J. Math. Anal. Appl. 159 (1991), 345 360.
35. K.E. Petersen, Disjointness and weak mixing of minimal sets, Proc. Amer.
Math. Soc. 24 (1970), 278 280.
36. D.J.S. Robinson, A course in the theory of groups, Springer-Verlag, New
York, 1993.
37. H. Román-Flores, A note on transitivity in set-valued discrete systems, Chaos
Solitons Fractals 17 (2003), 99 104.