^{1}

^{2}

In the present paper, we define and introduce some new class of topological transitive maps called topological semi-transitive, bi-supra transitive maps, semi-minimal systems and study some of its properties. The main results are the following propositions: Every semi-minimal map is a minimal map, but the converse is not necessarily true and every bi-supra transitive map is transitive map.

Let A be a subset of a topological space (X, τ). The closure and the interior of A are denoted by Cl (A) and Int (A), respectively. A subset A of a topological space (X, τ) is said to be semi open [

I n t δ ( S ) = { x ∈ X : x ∈ U ⊆ I n t ( C l ( U ) ) ⊆ S for some open set U of X }

Functions and of course irresolute functions stand among the most important notions in the whole of mathematical science. Various interesting problems arise when one considers openness. Its importance is significant in various areas of mathematics and related sciences. In 1972, Crossley and Hildebrand [

Spacing, and type styles are built-in; examples of the type styles are provided throughout this document and are identified in italic type, within parentheses, following the example. Some components, such as multi-leveled equations, graphics, and tables are not prescribed, although the various table text styles are provided. The formatter will need to create these components, incorporating the applicable criteria that follow.

Norman Levin [

Definition 2.1. Recall that a set A in ( X , τ ) is said to be semi open (written S.O.) if there exists an open set O such that O ⊆ A ⊆ C l ( O ) .

Theorem 2.2. [

Proof:

Necessity: Let A be S.O.; then O ⊆ A ⊆ C l ( O ) for some open set O. But O ⊆ I n t ( A ) and thus C l ( O ) ⊆ C l ( I n t ( A ) ) . Hence A ⊆ C l ( O ) ⊆ C l ( I n t ( A ) ) .

Sufficiency: Let A ⊆ C l ( I n t ( A ) ) . Then for O = I n t ( A ) , O ⊆ A ⊆ C l ( O ) .

Theorem 2.3. Let ( A α ) α ∈ I be a collection of S.O. sets in a topological space X. Then ∪ α ∈ I A α is S.O. in X.

Definition 2.4. [

Definition 2.5.

Let X be a topological space and x ∈ X , A ⊂ X . The Point x is called a P-limit point of A if each P-open set containing x, contains a point of A distinct from x.

We shall call the set of all P-limit points of A the P-derived set of A and denoted it by A ′ p . Therefore x ∈ A ′ p iff for every P-open set G in X such that x ∈ G implies that ( G ∩ A ) \ { x } ≠ ϕ .

Let ( X , τ ) be a topological space. By a semi-system ( S O ( X ) , f ) we mean a set of all semi-open subsets of X together with irresolute map. f : X → X . A set A ⊆ X is called f-invariant if f ( A ) ⊆ A .

Topologically semi-transitive and existence of a semi-dense orbit are two notions that play an important rule in every definition of semi-chaos.

Definition 3.1.

1) Let ( X , τ ) be a topological space, a semi-system ( S O ( X ) , f ) and f : X → X irresolute function, then f is said to be a topologically semi-transitive function if for every pair of semi-open sets U and V in X there is a positive integer n such that f n ( U ) ∩ V ≠ ϕ .

2) Let ( X , τ ) be a topological space, and f : X → X a continuous function, then f is said to be a topologically transitive function if for every pair of open sets U and V in X there is a positive integer n such that f n ( U ) ∩ V ≠ ϕ .

3) A semi-system ( S O ( X ) , f ) is said to be semi-minimal if X does not contain any non-empty, proper, semi-closed f-invariant subset. In such a case we also say that the map f itself is semi-minimal.

Given a point x in a semi-system, ( S O ( X ) , f ) , O f ( x ) = { x , f ( x ) , f 2 ( x ) , ⋯ } denotes its forward orbit (by an orbit we mean a forward orbit, and ω f ( x ) denotes its ω -limit set, i.e. the set of semi-limit points of the sequence x , f ( x ) , f 2 ( x ) , ⋯ .

Now, we introduce a new definition on minimal functions called semi-minimal and we study some new theorems associated with this new definition.

A semi-system ( S O ( X ) , f ) is called semi-minimal if X does not contain any non-empty, proper, s-closed f-invariant subset. In such a case we also say that the map f itself is semi-minimal. Another definition of semi-minimal function is that if the orbit of every point x in X is semi-dense in X then the map f is said to be semi-minimal. Let us introduce and study an equivalent new definition.

Definition 3.2. (Semi-minimal) Let X be a topological space, SO (X) be the set of all semi-open sets in X and be irresolute function on X. Then ( S O ( X ) , f ) is called semi-minimal system (or f is called semi-minimal function on X) if one of the three equivalent conditions hold:

1) The orbit of each point of X is semi-dense in X.

2) C l s ( O f ( x ) ) = X for each x ∈ X .

3) Given x ∈ X and a nonempty semi-open U in X, there exists n ∈ N such that f n ( x ) ∈ U .

Theorem 3.3. For ( S O ( X ) , f ) the following statements are equivalent:

1) f is an semi-minimal function.

2) If E is an semi-closed subset of X with f ( E ) ⊂ E , we say E is invariant. Then E = ϕ or E = X .

3) If U is a nonempty semi-open subset of X, then ∪ n = 0 ∞ f − n ( U ) = X .

Proof:

1) ⇒ 2): If A ≠ ϕ , let x ∈ A . Since A is invariant and semi-closed, i.e. C l s ( A ) = A so C l s ( O f ( x ) ) ⊂ A . On other hand C l s ( O f ( x ) ) = X .

Therefore A = X.

2) ⇒ 3) Let A = X \ ∪ n = 0 ∞ f − n ( U ) . Since U is nonempty, A ≠ X and Since U is semi-open and f is irresolute, A is semi-closed. Also f ( A ) ⊂ A , so A must be ϕ. f is irresolute, A is semi-closed. Also f ( A ) ⊂ A , so A must be an empty set.

3) ⇒ 1): Let x ∈ X and U be a nonempty semi-open subset of X. Since x ∈ X \ ∪ n = 0 ∞ f − n ( U ) . Therefore x ∈ f − n ( U ) for some n > 0. So f n ( x ) ∈ U .

Proposition 3.4. Let SO (X) be a semi-compact space without isolated point, if there exists a semi-dense orbit, that is there exists x 0 ∈ X such that the set O f ( x 0 ) is semi-dense then f is topologically semi-transitive.

Proof:

Let x 0 be such that O F ( x 0 ) is semi-dense. Given any pair U, V of semi-open sets, by semi-density there exists n such that f n ( x 0 ) ∈ U , but O F ( x 0 ) is semi-dense implies that O F ( f n ( x 0 ) ) is semi-dense, there exists m such that f m ( f n ( x 0 ) ) ∈ V . Therefore f m + n ( x 0 ) ∈ f m ( U ) ∩ V . That is f m ( U ) ∩ V ≠ ϕ . So f is topological semi-transitive.

Definition 3.5. A semi-system ( S O ( X ) , f ) is called topologically semi-mixing if for any pair U, V of non-empty semi-open sets there exists N ∈ Ν such that for all n ≥ N we have f n ( U ) ∩ V ≠ ϕ . Topologically semi-mixing conveys the idea that each semi-open set U, after iterations of f, for each semi-open set V, for all n sufficiently large, f n ( U ) intersects V.

Definition 3.6. 1) A map h : X → Y is called sr-homeomorphism if it is bijective and the map h and it’s inverse are irresolute.

2) Two semi-systems f : X → X and g : Y → Y are said to be topologically semi-conjugate if there is a sr-homeomorphism h : X → Y such that h ∘ f = g ∘ h . We will call h a topological semi-conjugacy.

Now, we proceed to prove an important proposition:

Proposition 3.7. If f : X → X and g : Y → Y are topologically sr-conjugate. Then

1) f is topologically semi-transitive if and only if g is topologically semi-transitive;

2) f is semi-minimal if and only if g is semi-minimal;

3) f is topologically semi-mixing if and only if g is topologically semi-mixing.

Proof:

Suppose f is semi-transitive. Let A, B be semi-open subsets of Y (to show g n ( A ) ∩ B ≠ ϕ for some n > 0 ). U = h − 1 ( A ) and V = h − 1 ( B ) are semi-open subsets of X since h is an irresolute.

Then there exists some n > 0 such that f n ( U ) ∩ V ≠ ϕ since f is semi-transitive. 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 h − 1 is invertible.

Proof:

Assume that f : X → X and g : Y → Y are topological semi-systems which are topologically sr-conjugated by h : Y → X . Thus, h is sr-homeomorphism (that is, h is bijective and thus invertible and both h and h − 1 are irresolute) and h ∘ g = f ∘ h that is, the following diagram commutes:

Y → g Y h ↓ ↓ h X → f X

We show that if g is semi-minimal, then f is semi-minimal. We want to show that for any x ∈ X , O f ( x ) is semi-dence. Since h is surjective, there exists x ∈ X such that y = h − 1 ( x ) . Since g is semi-minimal, O g ( y ) is semi-dence. For any non-empty semi-open subset U of X, h − 1 ( U ) is an semi-open set in X since h − 1 is irresolute because h is an sr-homeomorphism and it is non-empty since h is invertible. By semi-density of O g ( y ) there exist k in N such that

g k ( y ) ∈ h − 1 ( U ) ⇔ h ( g k ( y ) ) ∈ U

Since h is s r-conjugacy; as f ∘ h = h ∘ g implies f k ∘ h = h ∘ g k so f k ( h ( y ) ) = h ( g k ( y ) ) ∈ U thus O f ( h ( y ) ) intersects U. This holds for any non-empty semi-open set U and thus shows that O f ( x ) = O f ( h ( y ) ) is semi-dense.

Proof:

We only prove that if g is topologically semi-mixing then f is also topologically semi-mixing. Let U, V be two semi-open subsets of X. 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 semi-open sets since h is irresolute. If g is topologically semi-mixing then there is N > 0 such that for any n > M, g n ( h − 1 ( U ) ) ∩ h − 1 ( V ) ≠ ϕ . Therefore there exits x ∈ g n ( h − 1 ( U ) ) ∩ h − 1 ( V ) . That is, x ∈ g n ( h − 1 ( U ) ) and x ∈ h − 1 ( V ) if and only if x = g n ( y ) for y ∈ h − 1 ( U ) and 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, f is semi-mixing.

We have studied the relation between definitions of bispra-dense orbit and topological bisupra-transitivity. Now let X be a bisupra space and f : X → X bi-irresolute. For more knowledge about transitivity see [

Consider the following two conditions:

(biTT) for every pair of nonempty bisupra-open sets U and V in X, there is a positive integer n such that f n ( U ) ∩ V ≠ ϕ .

(biDO) there is a point x 0 ∈ X such that O f ( x 0 ) is bisupra-dense.

To study the dynamics of a self-map f : X → X means to study the qualitative behavior of the sequences { f n ( x ) } as n goes to infinity when x varies in X, where f n denotes the composition of f with itself n times.

A subset E of a bisupra space X is said to be of second category in X if E cannot be written as the countable union of subsets which are nowhere bisupra dense in X, i.e., if writing E as a union E = ∪ n ∈ N E n implies that at least one subset E n ⊂ X fails to be nowhere bisupra dense in X.

Definition 4.1. By a bisupra system we mean a pair ( X , f ) , where X is a bisupra space, and f : X → X is a bisupra irresolute function. The dynamics of the system is given by x n + 1 = f ( x n ) , x 0 ∈ X , n ∈ N and the solution passing through x is the sequence { f ( x n ) } where n ∈ N .

Definition 4.2. 1) Let x ∈ X , then the set { x , f ( x ) , f 2 ( x ) , ⋯ } is called an orbit of x under f and is denoted by O f ( x ) , so O f ( x ) is the set of points which occur on the orbit of x at some positive time, and the sequence x , f ( x ) , f 2 ( x ) , ⋯ is called the trajectory of x.

2) Let X be bisupra space, f : X → X , { f n ( x 0 ) } n = 0 ∞ be a sequence in X, and let x ∈ X . Then { f n ( x 0 ) } converges to x if for all bisupra open sets U containing x, there exists N such that for all n > N.

Any point with bisupra dense orbit is called a bisupra transitive point. A point which is not bisupra transitive is called bisupra intransitive.

3) (Bisupra Transitivity) Let X be a bisupra space with no isolated point. Given any two bisupra open sets G and H in X, there is a point x ∈ G and an n > 0 such that f n ( x ) ∈ H .

4) A system is said to be a bisupra mixing if for every pair G, H of non-empty bisupra open sets, if there exist N such that f n ( G ) ∩ H ≠ ϕ for all n > N . We can show that bisupra mixing implies weak bisupra mixing. But the converse is not nesaccerly true.

Recall that a subset A of a set X is called a bisupra-open set if A = L ∩ F , where L in SO (X) and F in PO (X). Complements of bisupra-closed sets will be called bisupra-open.

Definition 4.3. A function f : X → X is called bisupra-irresolute if the inverse image of each bisupra-open set is a bisupra-open set in X.

Let X be a bisupra space. The set of bisupra-irresolute functions on X is denoted by C b i ( X ) .

Definition 4.4. Let X be a topological space. A map f is said to have bisupra-dense orbit if there exists x ∈ X such that b i C l ( O f ( x ) ) = X .

Definition 4.5. Let X be a bisupra space, f : X → X be bisupra-irresolute map, then the set A ⊆ X is called bisupra transitive set (rsp. transitive set) if for every pair of non-empty bisupra-open (rsp. open) sets G and H in X with A ∩ G ≠ ϕ and A ∩ H ≠ ϕ there is a positive integer n such that f n ( G ) ∩ H ≠ ϕ .

Proposition 4.6. Every bisupra transitive set is transitive set.

There are the main results of the paper.

Proposition 5.1. Every semi-transitive map is a transitive map as every, but the converse not necessarily true.

Proposition 5.2. Every semi-minimal map is a minimal map, but the converse not necessarily true.

Theorem 5.3. For the system ( S O ( X ) , f ) the following statements are equivalent:

1) f is an semi-minimal map.

2) If E is a semi-closed subset of X with f ( E ) ⊂ E , we say E is invariant; then E = ϕ or E = X .

3) If U is a nonempty semi-open subset of X, then ∪ n = 0 ∞ f − n ( U ) = X .

Theorem 5.4. Every bisupra transitive map is transitive map.

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 Amir, my son who helps me for typing my research. Thanks to all my colleagues for helping me for completing my research.

The authors declare no conflicts of interest regarding the publication of this paper.

Jasim, T.H. and Murad, M.N. (2018) Bi Supra Transitive and Semi Minimal Systems. Open Access Library Journal, 5: e4749. https://doi.org/10.4236/oalib.1104749