You are currently viewing a new version of our website. To view the old version click .
Mathematics
  • Article
  • Open Access

15 November 2019

On ω-Limit Sets of Zadeh’s Extension of Nonautonomous Discrete Systems on an Interval

and
1
College of Information and Statistics, Guangxi University of Finance and Economics, Nanning 530003, China
2
Guangxi Key Laboratory Cultivation Base of Cross-border E-commerce Intelligent Information Processing, Nanning 530003, China
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Fuzzy Sets, Fuzzy Logic and Their Applications

Abstract

Let I = [ 0 , 1 ] and f n be a sequence of continuous self-maps on I which converge uniformly to a self-map f on I. Denote by F ( I ) the set of fuzzy numbers on I, and denote by ( F ( I ) , f ^ ) and ( F ( I ) , f ^ n ) the Zadeh’s extensions of ( I , f ) and ( I , f n ) , respectively. In this paper, we study the ω -limit sets of ( F ( I ) , f ^ n ) and show that, if all periodic points of f are fixed points, then ω ( A , f ^ n ) F ( f ^ ) for any A F ( I ) , where ω ( A , f ^ n ) is the ω -limit set of A under ( F ( I ) , f ^ n ) and F ( f ^ ) = { A F ( I ) : f ^ ( A ) = A } .

1. Introduction

Research for the dynamical properties of nonautonomous discrete systems on a metric space is very interesting (see [1,2,3,4,5,6,7,8,9,10,11]). In [12], Kempf investigated the ω -limit sets of a sequence of continuous self-maps f n on I which converge uniformly to a self-map f on I and showed that, if P ( f ) = F ( f ) , then ω ( x , f n ) is a closed subset of I with ω ( x , f n ) F ( f ) for any x I , where F ( f ) and P ( f ) are the set of fixed points of f and the set of periodic points of f, respectively, and ω ( x , f n ) is the set of ω -limit points of x under ( X , f n ) . Further, Cánovas [13] showed that, if f n is a sequence of continuous self-maps on I which converge uniformly to a self-map f on I and P ( f ) = F ( f 2 s ) for some s N , then ω ( x , f n ) = k = 1 2 s [ p k , q k ] F ( f 2 s ) with f ( [ p k , q k ] ) = [ p k + 1 , q k + 1 ] ( 1 k 2 s 1 ) and f ( [ p 2 s , q 2 s ] ) = [ p 1 , q 1 ] for any x I . In [14], we studied the ω -limit sets of a sequence of continuous self-maps f n on a tree T which converge uniformly to a self-map f on T and showed that, if P ( f ) = F ( f ) , then ω ( x , f n ) is a closed connected subset of T with ω ( x , f n ) F ( f ) for any x T .
It is well known [15] that the discrete dynamical system ( X , f ) naturally induces a dynamical system ( F ( X ) , f ^ ) , where F ( X ) is the set of all fuzzy sets on a metric space X and f ^ is the Zadeh’s extension of continuous self-maps f on X. It is natural to ask how the dynamical properties of f is related to the dynamical properties of f ^ . Already, there are many results for this question so far; see, e.g., References [16,17,18,19,20,21] and the related references therein, where different chaotic properties and topological entropies of Zadeh’s extensions of continuous seif-maps on metric spaces were considered. Our aim in this paper is to study the ω -limit sets of Zadeh’s extensions of nonautonomous discrete systems on intervals.

2. Preliminaries

Throughout this paper, let ( X , d ) be a metric space, write I = [ 0 , 1 ] , and denote by N the set of all positive integers. Let C 0 ( X ) be the set of all continuous self-maps on X. For a given f C 0 ( X ) , let f n + 1 = f f n for any n N . We call F ( f ) = { x X : f ( x ) = x } the set of fixed points of f and P ( f ) = { x X : f n ( x ) = x for some n N } the set of periodic points of f.
Let f n C 0 ( X ) ( n N ) and F 0 be the identity map of X, and write
F n = f n f n 1 f 1 for   any n N .
y X is called the ω -limit point of x ( X ) under ( X , f n ) if there are n 1 < n 2 < < n k < such that
lim k F n k ( x ) = y .
Denote by ω ( x , f n ) the set of ω -limit points of x under ( X , f n ) . We write f n f if f n converges uniformly to f.
Now, let us recall some definitions for fuzzy theory which are from [15].
Definition 1.
Let X be a metric space. A mapping A : X [ 0 , 1 ] is called a fuzzy set on X. For each fuzzy set A and each α ( 0 , 1 ] , A α = { t X : A ( t ) α } is called an α-level set of A and A 0 = { t X : A ( t ) > 0 } ¯ is called the support of A, where B ¯ means the closure of subset B of X.
Definition 2.
A fuzzy set A on I is said to be a fuzzy number if it satisfies the following conditions:
(1) 
A 1 ;
(2) 
A is an upper semicontinuous function;
(3) 
For any t 1 , t 2 I and any λ [ 0 , 1 ] , A ( λ t 1 + ( 1 λ ) t 2 ) min { A ( t 1 ) , A ( t 2 ) } ;
(4) 
A 0 is compact.
Let F ( I ) denote the set of fuzzy numbers on I. It is known that α -level set A α of A determines the fuzzy number A and that every A α is a closed connected subset of I. If A I , then A F ( I ) with A α = [ A , A ] for any α [ 0 , 1 ] .
For any A , B F ( I ) with A α = [ A l , α , A r , α ] and B α = [ B l , α , B r , α ] for any α ( 0 , 1 ] , we define the metric of A and B as follows:
D ( A , B ) = sup α ( 0 , 1 ] max { | A l , α B l , α | , | A r , α B r , α | } .
Obviously, we have
D ( A , B ) = sup α ( 0 , 1 ] max { sup x A α d ( x , B α ) , sup y B α d ( y , A α ) } H ( A α , B α ) ,
where d ( x , J ) = inf y J d ( x , y ) for any x I and J I . It is known that ( F ( I ) , D ) is a complete metric space (refer to [15]).
Let f C 0 ( I ) . We define the Zadeh’s extension f ^ : F ( I ) F ( I ) of f for any x I and A F ( I ) by
( f ^ ( A ) ) ( x ) = sup f ( y ) = x A ( y ) .
It follows from [15] that f is continuous if and only if f ^ is continuous, and it follows from [22] (Lemma 2.1) that
[ f ^ ( A ) ] α = f ( A α )
for any A F ( I ) and α ( 0 , 1 ] . In this paper, we will show the following theorem.
Theorem 1.
Let f n be a sequence of continuous self-maps on I with f n f . If P ( f ) = F ( f ) , then ω ( A , f ^ n ) F ( f ^ ) for any A F ( I ) .

3. Proof of the Main Result

In this section, we let f C 0 ( I ) and f ^ is the Zadeh’s extension of f. Let F ^ 0 be the identity map of F ( I ) and for any n N , we write
F ^ n = f ^ n f ^ n 1 f ^ 1 .
Lemma 1.
Assume that f n C 0 ( I ) for any n N with f n f . Then, f ^ n f ^ on F ( I ) .
Proof. 
Since f n f on I, it follows that, for any ε > 0 , there is an N N such that, when n N , we have
| f ( x ) f n ( x ) | < ε 2
for any x I , which implies that, for any B I , we have d ( z , f n ( B ) ) < ε / 2 for any z f ( B ) and d ( z , f ( B ) ) < ε / 2 for any z f n ( B ) . Thus when n N , we have
D ( f ^ ( A ) , f ^ n ( A ) ) = sup α ( 0 , 1 ] H ( f ( A α ) , f n ( A α ) ) ε 2 < ε
for any A F ( I ) . Lemma 1 is proven.  □
Lemma 2.
Assume that f n C 0 ( I ) for any n N with f n f . If B ω ( A , f ^ n ) for some A F ( I ) , then ω ( x , f n ) B α for any α ( 0 , 1 ] and x A α .
Proof. 
Let B ω ( A , f ^ n ) and α ( 0 , 1 ] . Let n 1 < n 2 < < n k < such that
lim k D ( F ^ n k ( A ) , B ) = 0 .
Then,
lim k H ( F n k ( A α ) , B α ) = 0 .
Let x A α . By taking a subsequence, we let lim k F n k ( x ) = y ω ( x , f n ) . If y B α , then ε = d ( y , B α ) > 0 . Since lim k H ( F n k ( A α ) , B α ) = 0 , there is an N N such that, when n k > N , we have
H ( F n k ( A α ) , B α ) < ε 2 ,
which implies d ( F n k ( x ) , B α ) < ε / 2 and lim k F n k ( x ) y since F n k ( x ) F n k ( A α ) . This is a contradiction. Thus, y B α . Lemma 2 is proven.  □
Proposition 1.
Assume that f n C 0 ( I ) for any n N with f n f and P ( f ) = F ( f ) . Then, the following statements hold:
(1) 
If B ω ( A , f ^ n ) for some A F ( I ) , then f ( B α ) B α ω ( x , f n ) F ( f ) for any α ( 0 , 1 ] and x A α .
(2) 
If B ω ( A , f ^ n ) for some A F ( I ) , then B ω ( A , f ^ n ) B α ω ( x , f n ) is a connected subset of I for any α ( 0 , 1 ] and x A α .
Proof. 
It follows from Theorem 1 and Lemma 2.  □
Lemma 3
(See [14] (Lemma 2)). Assume that f C 0 ( I ) with F ( f ) = P ( f ) . Then, for any x I and n N , f n ( x ) > x if f ( x ) > x and f n ( x ) < x if f ( x ) < x .
Now, we show the main result of this paper.
Proof of Theorem 1.
Let B ω ( A , f ^ n ) . For any α ( 0 , 1 ] , write B α = [ a α , b α ] and f ( B α ) = [ c α , d α ] . Let n 1 < n 2 < < n k < such that
lim k D ( F ^ n k ( A ) , B ) = 0 .
By f ^ C 0 ( F ( I ) ) , we see that, for any ε > 0 , there is an δ = δ ( ε ) > 0 such that, if D ( B , C ) < δ with C F ( I ) , then
D ( f ^ ( B ) , f ^ ( C ) ) < ε 3 .
By Lemma 1, we see that there is an N = N ( ε ) N such that, when n N , we have
D ( f ^ ( W ) , f ^ n ( W ) ) ε 3
for any W F ( I ) . Take r = n k N such that D ( F ^ r ( A ) , B ) < δ . Thus,
D ( f ^ ( B ) , F ^ r + 1 ( A ) ) D ( f ^ ( B ) , f ^ ( F ^ r ( A ) ) ) + D ( f ^ ( F ^ r ( A ) ) , F ^ r + 1 ( A ) ) 2 ε 3 .
In the following, we show that a α = c α and b α = d α . For convenience, write a α = a , b α = b , c α = c , and d α = d .
(i) We will show c a . Assume on the contrary that c > a . Then, by Proposition 1, we see c b .
We claim that there is an u ( a , 1 ] such that f ( u ) = a . Indeed, if f ( [ a , 1 ] ) ( a , 1 ] , then let ε = min { d ( a , f ( [ a , 1 ] ) ) , c a } > 0 . By Equation (3), we see F r + 1 ( A α ) [ a + ε / 3 , 1 ] . It follows from Equation (2) that
H ( f ( F r + 1 ( A α ) ) , F r + 2 ( A α ) ) ε 3 .
Thus, F r + 2 ( A α ) [ a + ε / 3 , 1 ] . Continuing in this fashion, we have that F n ( A α ) [ a + ε / 3 , 1 ] for any n r + 1 , which contradicts Equation (1). The claim is proven.
Let u = min { x ( a , 1 ] : f ( x ) = a } . Then, u > b since f ( [ a , b ] ) = [ c , d ] and u > d (Otherwise, if b < u d , then there exists an u 1 [ a , b ] and u 2 [ u 1 , u ] such that u 1 = f ( u 2 ) < u 2 d = f ( u 1 ) . This contradicts Lemma 3.). By Lemma 3, we see f ( [ a , u ] ) [ a , u ) . Write
p = max { b , d , max f ( [ a , u ] ) } , ε 1 = ( u p ) / 2 , q = min { c , min f ( [ a , p + ε 1 ] ) } , ε = min { ( q a ) / 2 , ε 1 } .
By Equation (3), we see F r + 1 ( A α ) [ q ε , p + ε 1 ] . It follows from Equation (2) that
H ( f ( F r + 1 ( A α ) ) , F r + 2 ( A α ) ) ε 3 .
Thus, F r + 2 ( A α ) [ q ε , p + ε 1 ] . Continuing in this fashion, we have that F n ( A α ) [ q ε , p + ε 1 ] for any n r + 1 , which contradicts Equation (1).
(ii) In similar fashion, we can show d b .
(iii) We will show that, if c = a , then d = b . Assume on the contrary that d > b . Let u = max { z [ a , b ] : f ( z ) = d } and e = min { z [ a , b ] : f ( z ) = a } . Then, we have e < u (Otherwise, if e > u , then there is an w [ u , e ] satisfying u = f ( w ) < w < d = f 2 ( w ) . This contradicts Lemma 3.) and f ( a ) < u .
We claim that there is an v ( u , 1 ] such that f ( v ) = u . Indeed, if p = min f ( [ u , 1 ] ) > u , then let ε = min { ( d b ) / 2 , d ( u , p ) } > 0 . By Equation (3), we see
D ( f ^ ( B ) , F ^ r + 1 ( A ) ) 2 ε 3 .
If F n ( A α ) [ a , u ] for any n r + 1 , then we have d 2 ε / 3 F n ( A α ) for any n r + 1 , which contradicts Equation (1). If F n ( A α ) [ a , u ] = for some n r + 1 , then let m = min { F n ( A α ) [ a , u ] = : n r + 1 } . Thus, F m ( A α ) ( u , 1 ] , and it follows from Equation (2) that
H ( f ( F m ( A α ) ) , F m + 1 ( A α ) ) ε 3 ,
which implies F m + 1 ( A α ) [ p ε / 3 , 1 ] ( u , 1 ] . Continuing in this fashion, we obtain that F n ( A α ) [ p ε / 3 , 1 ] ( u , 1 ] for any n m , which contradicts Equation (1). The claim is proven.
Let v = min { x ( u , 1 ] : f ( x ) = u } . Then, by Lemma 3, we see d < v and p = max f ( [ u , v ] ) < v .
If there is an w [ 0 , a ) satisfying f ( w ) = u , then let w = max { x [ 0 , a ) : f ( x ) = u } . By Lemma 3, we see q = min f ( [ w , a ] ) > w and f ( [ w , v ] ) = [ q , p ] . Write
ε 1 = ( v p ) / 2 , z = min f ( [ u , p + ε 1 ] ) > u , ε = min { ( d b ) / 2 , ( q w ) / 2 , ( z u ) / 2 , ε 1 } .
By Equation (3), we see
D ( f ^ ( B ) , F ^ r + 1 ( A ) ) 2 ε 3 .
This implies F r + 1 ( A α ) [ q ε , p + ε 1 ] . If F n ( A α ) [ a , u ] for any n r + 1 , then we have d 2 ε / 3 F n ( A α ) for any n r + 1 , which contradicts Equation (1). If F n ( A α ) [ a , u ] = for some n r + 1 , then let m = min { F n ( A α ) [ a , u ] = : n r + 1 } . Thus, F m ( A α ) ( u , p + ε 1 ] , and it follows from Equation (2) that
H ( f ( F m ( A α ) ) , F m + 1 ( A α ) ) ε 3 ,
which implies F m + 1 ( A α ) [ z ε / 3 , p + ε 1 ] ( u , p + ε 1 ] . Continuing in this fashion, we obtain that F n ( A α ) [ z ε / 3 , p + ε 1 ] ( u , p + ε 1 ] for any n m , which contradicts Equation (1).
If max f ( [ 0 , a ] ) < u , then f ( [ 0 , v ] ) = [ 0 , p ] . Using the similar arguments as ones developed in the above given proof, we also obtain a conclusion which contradicts Equation (1).
(iv) We will show c = a . Assume on the contrary that c < a . Then by claim (ii), we see b d . Using the similar arguments as ones developed in the proof of claim (iii), we can obtain b < d . Let ε = min { ( a c ) / 2 , ( d b ) / 2 } . By Equation (3), we see F r + 1 ( A α ) [ a ε , b + ε ] . It follows from Equation (2) that
H ( f ( F r + 1 ( A α ) ) , F r + 2 ( A α ) ) ε 3 .
Thus, F r + 2 ( A α ) [ a ε , b + ε ] . Continuing in this fashion, we have that F n ( A α ) [ a ε , b + ε ] for any n r + 1 , which contradicts Equation (1).
By claims (iii) and (iv), we see f ( B α ) = B α for any α ( 0 , 1 ] , which implies f ( B ) = B . Theorem 1 is proven. □
Using the similar arguments as ones developed in the proofs of Proposition 1.4 of [13] and Theorem 1, we may show the following result.
Corollary 1.
Let f n C 0 ( I ) for any n N with f n f . If P ( f ) = F ( f 2 s ) for some s N , then ω ( A , f ^ n ) F ( f ^ 2 s ) for any A F ( I ) .
The following example illustrates that there are f n C 0 ( I ) for any n N such that f n f with P ( f ) = F ( f ) and ω ( A , f ^ n ) = for some A F ( I ) .
Example 1.
Let f C 0 ( I ) with f ( 1 ) = 1 > 0 = f ( 0 ) and x < f ( x ) for any x ( 0 , 1 ) and f n f for any n N . Thus, f n f . We define A F ( I ) for any x I by
A ( x ) = x + 1 .
By calculation, we have A α = [ 0 , 1 α ] for any α ( 0 , 1 ] and f n ( A 1 ) = { 0 } for any n N . In the following, we assume that α ( 0 , 1 ) and let f n ( A α ) = [ a n ( α ) , b n ( α ) ] . Then, a n ( α ) = 0 for any n N and b n ( α ) b n + 1 ( α ) 1 for any n N and b n ( α ) 1 . Since b ( α ) = 1 is not left continuous at α = 1 , by Theorem 2.1 of [23], there is not a B F ( I ) such that B α = [ a ( α ) , b ( α ) ] = [ 0 , 1 ] for any α ( 0 , 1 ] . Thus, ω ( A , f ^ ) = .

4. Conclusions

In this paper, we investigated the ω -limit sets of Zadeh’s extensions of a nonautonomous discrete system f n on an interval which converges uniformly to a map f and show that, if P ( f ) = F ( f ) , then ω ( A , f ^ n ) F ( f ^ ) for any A F ( I ) .

Author Contributions

Conceptualization, G.S. and T.S.; methodology, G.S. and T.S.; validation, G.S. and T.S.; formal analysis, G.S.; writing—original draft preparation, T.S.; writing—review and editing, G.S. and T.S.; funding acquisition, G.S. and T.S.; the final form of this paper is approved by all authors.

Funding

This work is supported by NNSF of China (11761011) and NSF of Guangxi (2018GXNSFAA294010 and 2016GXNSFAA380286) and by SF of Guangxi University of Finance and Economics (2019QNB10).

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Balibrea, F.; Oprocha, P. Weak mixing and chaos in nonautonomous discrete systems. Appl. Math. Lett. 2012, 25, 1135–1141. [Google Scholar] [CrossRef]
  2. Dvorakova, J. Chaos in nonautonomous discrete dynamical systems. Commun. Nonlinear Sci. Numer. Simul. 2012, 17, 4649–4652. [Google Scholar] [CrossRef]
  3. Kawan, C.; Latushkin, Y. Some results on the entropy of non-autonomous dynamical systems. Dynam. Syst. Inter. J. 2016, 31, 251–279. [Google Scholar] [CrossRef]
  4. Lan, Y.; Peris, A. Weak stability of non-autonomous discrete dynamical systems. Topo. Appl. 2018, 250, 53–60. [Google Scholar] [CrossRef]
  5. Liu, L.; Chen, B. On ω-limit sets and attracton of non-autonomous discrete dynamical systems. J. Korean Math. Soc. 2012, 49, 703–713. [Google Scholar] [CrossRef]
  6. Liu, L.; Sun, Y. Weakly mixing sets and transitive sets for non-autonomous discrete systems. Adv. Differ. Equ. 2014, 2014, 217. [Google Scholar] [CrossRef]
  7. Ma, C.; Zhu, P.; Lu, T. Some chaotic properties of non-autonomous discrete fuzzy dynamical systems. In Proceedings of the 2016 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), Vancouver, BC, Canada, 24–29 July 2016; pp. 46–49. [Google Scholar]
  8. Miralles, A.; Murillo-Arcila, M.; Sanchis, M. Sensitive dependence for non-autonomous discrete dynamical systems. J. Math. Anal. Appl. 2018, 463, 268–275. [Google Scholar] [CrossRef]
  9. Murillo-Arcila, M.; Peris, A. Mixing properties for nonautonomous linear dynamics and invariant sets. Appl. Math. Lett. 2013, 26, 215–218. [Google Scholar] [CrossRef]
  10. Rasouli, H. On the shadowing property of nonautonomous discrete systems. Int. J. Nonlinear Anal. Appl. 2016, 7, 271–277. [Google Scholar]
  11. Tang, X.; Chen, G.; Lu, T. Some iterative properties of (F-1, F-2)-chaos in non-autonomous discrete systems. Entropy 2018, 20, 188. [Google Scholar] [CrossRef]
  12. Kempf, R. On Ω-limit sets of discrete-time dynamical systems. J. Differ. Equ. Appl. 2002, 8, 1121–1131. [Google Scholar] [CrossRef]
  13. Cánovas, J.S. On ω-limit sets of non-autonomous discrete systems. J. Differ. Equ. Appl. 2006, 12, 95–100. [Google Scholar] [CrossRef]
  14. Sun, T. On ω-limit sets of non-autonomous discrete systems on trees. Nonlinear Anal. 2008, 68, 781–784. [Google Scholar] [CrossRef]
  15. Kupka, J. On fuzzifications of discrete dynamical systems. Inform. Sci. 2011, 181, 2858–2872. [Google Scholar] [CrossRef]
  16. Boroński, J.P.; Kupka, J. The topology and dynamics of the hyperspaces of normal fuzzy sets and their inverse limit spaces. Fuzzy Sets Sys. 2017, 321, 90–100. [Google Scholar] [CrossRef]
  17. Cánovas, J.S.; Kupka, J. Topological entropy of fuzzified dynamical systems. Fuzzy Sets Sys. 2011, 165, 67–79. [Google Scholar] [CrossRef]
  18. Cánovas, J.S.; Kupka, J. On the topological entropy on the space of fuzzy numbers. Fuzzy Sets Sys. 2014, 257, 132–145. [Google Scholar] [CrossRef]
  19. Cánovas, J.S.; Kupka, J. On fuzzy entropy and topological entropy of fuzzy extensions of dynamical systems. Fuzzy Sets Sys. 2017, 309, 115–130. [Google Scholar] [CrossRef]
  20. Kim, C.; Chen, M.; Ju, H. Dynamics and topological entropy for Zadeh’s extension of a compact system. Fuzzy Sets Syst. 2017, 319, 93–103. [Google Scholar] [CrossRef]
  21. Yan, K.; Zeng, F. Conditional fuzzy entropy of fuzzy dynamical systems. Fuzzy Sets Sys. 2018, 342, 138–152. [Google Scholar] [CrossRef]
  22. Papaschinopoulos, G.; Papadopoulos, B.K. On the fuzzy difference equation xn+1 = A + xn/xnm. Fuzzy Sets Sys. 2002, 129, 73–81. [Google Scholar] [CrossRef]
  23. Wu, C.; Zhang, B. Embedding problem of noncompact fuzzy number space E(I). Fuzzy Sets Sys. 1999, 105, 165–169. [Google Scholar] [CrossRef]

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.