Chaos, Mixing, Weakly Mixing and Exactness

Abstract

In this paper, new definitions of chaos, exact chaos, mixing chaos, and weak mixing chaos called θ-chaos, θ exact chaos, θ-mixing chaos are introduced and extended to topological spaces. Our purpose is to investigate other types of transitivity, chaos and mixing, because when we confirm not existence of θ-transitivity we confirm not existence of other types of transitive functions and its absence cannot find other types of transitivity. So the author must confirm the existence of this type of transitivity. We have proved that these chaotic definitions are all preserved under θ r-conjugation.

Share and Cite:

Kaki, M. (2018) Chaos, Mixing, Weakly Mixing and Exactness. Open Access Library Journal, 5, 1-7. doi: 10.4236/oalib.1103773.

1. Introduction

In this research paper, new types of minimal systems, transitivity and exactness are introduced and studied. This is intended as a survey article on transitivity and chaoticity of a discrete system given by θ-irresolute self-map of a topological space. On one hand, it introduces postgraduate students to the study of new types of exactness, minimal systems and chaotic maps and gives an overview of results on the topic, but, on the other hand, it covers some of the recent developments of dynamics, technology, electronic and computer science. We denote the interior and the closure of a subset A of X by I n t ( A ) and C l ( A ) respectively. By a space X, we mean a topological space ( X , τ ) . A point x X is called a θ-adherent point of A [1] , if A C l ( U ) ϕ for every open set U containing x. The set of all θ-adherent points of a subset A of X is called the θ-closure of A and is denoted by C l θ ( A ) . A subset A of X is called θ-closed if A = C l θ ( A ) . Dontchev and Maki [2] have shown that if A and B are subsets of a space X, then C l θ ( A B ) = C l θ ( A ) C l θ ( B ) and that C l θ ( A B ) = C l θ ( A ) C l θ ( B ) . Recall that a space ( X , τ ) is Hausdorff if and only if every compact set is θ-closed. The complement of a θ-closed set is called a θ-open set. The family of all θ-open sets forms a topology on X and is denoted by τ θ . This topology is coarser than τ and that a space ( X , τ ) is regular if and only if τ = τ θ [3] . Note also that the θ-closure of a given set needs not be a θ-closed set. Our purpose is to investigate some new types of transitivity, because when we confirm not existence of θ-transitivity we can’t confirm the existence of other types of transitive functions and then we can’t study chaos theory, i.e. theta-transitivity absence cannot find other types of transitive maps therefore cannot find chaotic maps. For more knowledge about transitivity and chaotic maps see references [4] and [5] .

2. Preliminaries and Definitions

Definition 2.1

A point x X is said to be A θ-interior point of A, if there exists an open set U containing x such that U C l ( U ) A .

The set of all θ-interior points of A is said to be the θ-interior of A, and is denoted by I n t θ ( A ) . It is obvious that an open set U in X is θ-open if I n t θ ( A ) = U .

Definition 2.2

1) A map h : X Y is a homeomorphism if it is continuous, bijective and has a continuous inverse.

2) A map h : X Y is θr-homeomorphism if it is bijective and thus invertible and both h and h1 are θ-irresolute.

3) The systems f : X X and g : Y Y are topologically conjugate or conjugate if there is a homeomorphism h : X Y such that h f = g h

4) The systems f : X X and g : Y Y are topologically θr conjugate or θr conjugate if there is θr-homeomorphism h : X Y such that h f = g h

Definition 2.3 A map f is said to be transitive (resp., θ-transitive [6] ) if for any non-empty open (resp., θ-open) sets U and V in X, there exists n N such that f n ( U ) V ϕ .

Kaki definition 2.4 A map f is said to be 1-transitive, if for every x , y X , there exists n N such that f n ( x ) = y .

Theorem 2.5 every 1-transitive implies transitive.

Proof:

We have to prove that for any non-empty open sets U and V in X, there exists n N such that f n ( U ) V ϕ . Now, since U and V are non-empty so there is x U and y V so there is n N such that f n ( x ) = y since f is 1-transitive and y = f n ( x ) f n ( U ) but y V , we have y f n ( U ) V i.e. f n ( U ) V ϕ .

Definition 2.6

The points x is called a non-wandering point if for every open set U containing x there is an integer n > 0 such that f n ( U ) U ϕ .

Definition 2.7

The non-wandering set of a map f, N W ( f ) , includes the points x such that for every open set U containing x there is an integer n > 0 such that f n ( U ) U ϕ .

Definition 2.8

The points x is called theta-non-wandering point if for every θ-open set U containing x there is an integer n > 0 such that f n ( U ) U ϕ .

Definition 2.9

The theta-non-wandering set of a map f, N W θ ( f ) , includes the points x such that for every θ-open set U containing x there is an integer n > 0 such that f n ( U ) U ϕ .

Proposition 2.10 Every non-wandering point is a theta-nonwandering point but not conversely.

3. Action of a Group on a Topological Space

If G is a group and X is a topological space, then a group action φ of G on X is a function φ : G × X X such that φ ( g , x ) = φ g ( x ) that satisfies the following three axioms [7] and [8]:

1) φ g is continuous, for all g in G

2) Identity: φ g ( x ) = x for all x in X. (Here, e denotes the neutral element of the group G.)

3) Compatibility φ g h ( x ) = φ g ( φ h ( x ) ) for all g, h in G and all x in X.

The group G is said to act on X (on the left). The set X is called a (left) G-set.

Definition 3.1

1) The action of G on X is called 1-transitive if X is non-empty and if for each pair x, y in X there exists a g in G such that φ g ( x ) = y .

2) The action of G on X is called topologically-transitive if X is non-empty and if for each non-empty pair U , V X , there exists a g in G such that φ g ( U ) V ϕ .

Theorem 3.2 Every 1-transitive implies topologically-transitive.

Proof: The same technique of theorem 2.5.

Definition 3.3 The action of G on X is called n-transitive if X is non-empty and if for any two ordered sets of n different points { x 1 , , x n } and { y 1 , , y n } in X there exists a g in G such that φ g ( x i ) = y i for i = 1 , , n .

Definition 3.4 The action of G on X is called topologically n-transitive if X is non-empty and if for each non-empty pair U i , V i X , such that U i U j = ϕ and V i V j = ϕ for i j there exists a g in G such that φ g ( U i ) V i ϕ for i = 1 , , n .

Definition 3.5 Relative to ϕ g a point x X is called wandering if there is an open U containing x such that ϕ g ( U ) U = ϕ for all g G .

Definition 3.6

1) A point x X is θ-recurrent if, for every θ-open set U containing x, infinitely many n N satisfy g n ( x ) U .

2) Let X be a topological space, g : X X be θ-irresolute map, then the function g is called topologically θ-strongly mixing if, given any nonempty θ-open subsets U , V X N 1 such that g n ( U ) V ϕ for all n > N .

3) A subset B of X is g-invariant if g ( B ) B . A non-empty θ-closed invariant subset B of X is θ-minimal, if C l θ ( O g ( x ) ) = B for every x B . A point x X is θ-minimal if it is contained in some θ-minimal subset of X

Theorem 3.7 if g is topologically θ-strongly mixing then it is also θ-transitive but not conversely.

Definition 3.8

1) The function f is θ-exact if, for every nonempty θ-open set U, there exists some n N such that g n ( U ) = X .

2) The function g is (topological) θ-transitive (resp., θ-mixing) if for any two nonempty θ-open sets U , V X , there exists some n N such that g n ( U ) V ϕ . (resp. g m ( U ) V ϕ for all m n ).

3) The function g is weak θ-mixing if g × g is θ-transitive on X × X

4) The θ-mixing function g : X X is pure θ-mixing if and only if there exists θ-open set U X such that g n ( U ) X .

5) The function g : X X is θ-chaotic if g is θ-transitive on X and the set of periodic points of g is θ-dense in X.

6) The function g is called θ-exact chaos (resp., θ-mixing chaos and weakly θ-mixing chaos) if g is θ-exact (resp., θ-mixing and weakly θ-mixing) and θ-chaotic function on the space X.

Theorem 3.9 Theorem 3.9 topological θ-exactness implies θ-mixing implies weakly θ-mixing implies θ-transitivity

Theorem 3.10 If f : X X and g : Y Y are topologically θr-conjugate by a θr-homeomorphism h : X Y . Then

1) The map f is θ-exact if and only if g is θ-exact

2) The map f is θ-mixing if and only if g is θ-mixing

3) The map f is θ-chaotic if and only if g is θ-chaotic

4) The map f is weakly θ-mixing if and only if g is weakly θ-mixing.

Theorem 3.11 if f : X X and g : Y Y are θr-conjugate via h : X Y . Then

1) T is θ transitive subset of X h ( T ) is θ-type transitive subset of Y;

2) T is θ-mixing subset of X h ( T ) is θ-mixing subset of Y.

Corollary A subset B in the space X is a chaotic set h ( B ) is a chaotic set in the space Y.

Proof (1)

Assume that f : X X and g : Y Y are topological systems which are topologically θr-conjugated by h : X Y . Thus, h is θr-homeomorphism (that is, h is bijective and thus invertible and both h and h−1 are θ-irresolute) and h f = g h

Suppose T is θ-type transitive subset of X. Let A, B be θ-open subsets of Y with B h ( T ) ϕ and A h ( T ) ϕ (to show g n ( A ) B φ for some n > 0 ). U = h 1 ( A ) and V = h 1 ( B ) are θ-open subsets of X since h is an θ-irresolute.

Then there exists some n > 0 such that f n ( U ) V φ since T is θ-type transitive subset of X, with U T ϕ and V T ϕ . Thus (as f h 1 = h 1 g implies f n h 1 = h 1 g n ).

ϕ f n ( h 1 ( A ) ) h 1 ( B ) = h 1 ( g n ( A ) ) h 1 (B)

Therefore, h 1 ( g n ( A ) B ) ϕ implies g n ( A ) B ϕ since h1 invertible. So h(T) is θ-type transitive subset of Y.

Proof (2)

We only prove that if T is topologically θ-mixing subset of Y then h−1(T) is also topologically θ-mixing subset of X. Let U, V be two θ-open subsets of X with U h 1 ( T ) ϕ and V h 1 ( T ) ϕ . We have to show that there is N > 0 such that for any n > N , f n ( U ) V ϕ . h 1 ( U ) and h 1 ( V ) are two θ-open sets since h is θ-irresolute with h 1 ( V ) T ϕ and h 1 ( U ) T ϕ . If the set T is topologically λ-mixing then there is N > 0 such that for any n > M, g n ( h 1 ( U ) ) h 1 ( V ) ϕ . So x g n ( h 1 ( U ) ) h 1 ( V ) . That is x g n ( h 1 ( U ) ) and x h 1 ( V ) x = g n ( y ) for y h 1 ( U ) . h ( x ) V . Thus, since h g n = f n h , so that h ( x ) = h ( g n ( y ) ) = f n ( h ( y ) ) f n ( U ) and we have h ( x ) V that is f n ( U ) V ϕ . So, h−1(T) is θ-mixing set.

Theorem 3.12 Let ( X , f ) be a topological system and A be a nonempty θ-closed set of X. Then the following conditions are equivalent.

1) A is a θ-transitive set of ( X , f ) .

2) Let V be a nonempty θ-open subset of A and U be a nonempty θ-open subset of X with U A ϕ . Then ther exists n N such that V f n ( U ) ϕ .

3) Let U be a nonempty θ-open set of X with U A ϕ . Then n N f n ( U ) is θ-dense in A.

Theorem 3.13 Let ( X , f ) be topological system and A be a nonempty θ-closed invariant set of X. Then A is a θ-type transitive set of ( X , f ) if and only if ( A , f ) is θ-type transitive set.

Proof:

) Let V 1 and U 1 be two nonempty θ-open subsets of A. For a nonempty θ-open subset U 1 of A, there exists a θ-open set U of X such that U 1 = U A Since A is a θ-type transitive set of ( X , f ) , there exists n N such that f ( V 1 ) U ϕ . Moreover, A is invariant, i.e., f ( A ) A , which implies that f ( A ) A . Therefore, f ( V 1 ) A U ϕ , i.e. f ( V 1 ) U 1 ϕ . This shows that ( A , f ) is θ-type transitive.

) Let V 1 be a nonempty θ-open set of A and U be a nonempty θ-open set of X with A U ϕ , Since U is an θ-open set of X and A U ϕ , it follows that U A is a nonempty θ-open set of A. Since ( A , f ) is topologically θ-type transitive, there exists n N such that f ( V 1 ) ( A U ) ϕ , which implies that f ( V 1 ) U ϕ . This shows that A is a θ-type transitive set of ( X , f ) .

We now introduce four definitions of dense orbit and transitivity as follows:

Definition 3.14 Let X be a topological space.

1) A map f is said to have θ-dense orbit if there exists x X such that C l θ ( O f ( x ) ) = X ;

2) A map f is said to have strictly dense orbit (resp., strictly θ-dense orbit), if there exists x X such that C l ( O f ( f ( x ) ) ) = X (resp. C l θ ( O f ( f ( x ) ) ) = X );

3) A map f is said to be ω-transitive if there exists x X such that ω ( x , f ) = X ;

4) A map f is said to be transitive (resp., θ-transitive) if for any non-empty open (resp., θ-open) sets U and V in X, there exists n N such that f n ( U ) V ϕ .

Now, we will discuss the relations between these orbits and transitivity maps in the theorem below:

Theorem 3.15

1) For any topological space X, each strictly θ-dense orbit is α θ-dense orbit, and each ω-transitive map has strictly dense orbit and it is transitive.

2) For any topological space X, each continuous map which has strictly dense orbit is ω-transitive and transitive.

Acknowledgements

First, thanks to my family for having the patience with me for having taking yet another challenge which decreases the amount of time I can spend with them. Specially, my wife who has taken a big part of that sacrifice, and also Sarmad, my son who helps me for typing my research. Thanks to all my colleagues for helping me for completing my research.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] Velicko, N.V. (1968) H-Closed Topological Spaces. (Russian) Mat. Sb. (N.S.) 70 (112) (1966), 98-112; English transl. American Mathematical Society Translations, 78, 102-118.
https://doi.org/10.1090/trans2/078/05
[2] Dontchev, J. and Maki, H. (1998) Groups of θ-Generalized Homeomorphisms and the Digital Line. Topology and Its Applications, 201-216.
[3] Jankovic, D.S. (1986) θ-Regular Spaces. International Journal of Mathematics and Mathematical Sciences, 8615-8619.
[4] Kaki, M.N.M. (2015) Chaos: Exact, Mixing and Weakly Mixing Maps. Pure and Applied Mathematics Journal, Science PG, 4, 39-42.
[5] Kaki, M.N.M. (2015) New Concepts of Alpha-Chaotic Maps. Journal of Multidisciplinary Engineering Science and Technology (JMEST), 2, 187-190.
[6] Kaki, M.N.M. (2012) Introduction to θ-Type Transitive Maps on Topological Spaces. International Journal of Basic & Applied Sciences IJBAS-IJENS, 12, 104-108.
[7] Eie & Chang (2010) A Course on Abstract Algebra. 144.
[8] https://en.wikipedia.org/wiki/Group_action#cite_note-1

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.