Acta mathematica scientia,Series A ›› 2021, Vol. 41 ›› Issue (5): 1545-1554.

Previous Articles     Next Articles

The Collectively Sensitivity and Accessible in Non-Autonomous Composite Systems

Xiaofang Yang1(),Xiao Tang2(),Tianxiu Lu1,3,*()   

  1. 1 College of Mathematics and Statistics, Sichuan University of Science and Engineering, Sichuan Zigong 643000
    2 School of Mathematical Science, Sichuan Normal University, Chengdu 610068
    3 Key Laboratory of Higher Education of Sichuan Province for Enterprise Informationalization and Internet of Things, Sichuan Zigong 643000
  • Received:2020-09-29 Online:2021-10-26 Published:2021-10-08
  • Contact: Tianxiu Lu E-mail:yxf_suse@163.com;80651177@163.com;lubeeltx@163.com
  • Supported by:
    the Science and Technology Plan of Sichuan Province(19YYJC2845);the Key Laboratory of Colleges and Universities Open Fund for Enterprise Information and Internet of Measurement and Control Technology in Sichuan Province(2020WZJ01);the Talent Introduction Program(2020RC24);the Graduate Student Innovation Fund(Y2020077)

Abstract:

In this paper, collectively sensitivity, collectively infinity sensitivity, collectively Li-Yorke sensitivity and collectively accessible are defined in the non-autonomous discrete system. First of all, it is showed that, on compact metric spaces, mapping sequence (fk)k=1 is P-chaos if and only if nN (N is the set of natural numbers and does not contain 0). Then, under the condition that f1, is uniformly convergence, it is proved that f1, is CP-chaos if and only if for any mN, f[m]1, is CP-chaos. Where P-chaos denote one of the five properties: transitivity, sensitivity, infinitely sensitivity, accessibility and exact, CP-chaos denote one of the four properties: collectively sensitivity, collectively infinity sensitivity, collectively Li-Yorke sensitivity and collectively accessible.

Key words: Non-autonomous discrete system, Composite mapping, Transitivity, Sensitivity, Accessibility

CLC Number: 

  • O193
Trendmd