The shift operator is a distinct linear operator that displaces one or more bits forward (or backward) for each basis vector in the canonical orthogonal basis of Banach space or Frechet space. It has been widely used in many fields, for example, image processing ( [1] , 2015), chaotic encryption ( [2] , 2020), symbolic dynamical systems ( [3] , 2013), and dynamic physical systems ( [4] , 1993).

The shift operator is generally divided into two categories: unilateral shift operator and bilateral shift operator. The weighted shift operator is a generalization of the shift operator. Since Grosse-Erdmann ( [5] , 1999) closely linked the hypercyclicity of operators to the topological transitivity of dynamical systems, the study of chaotic properties of shift operators has attracted more and more attention, especially in symbolic spaces. In 2010, Queffelec ( [6] ) proved that the shift operator acting on the symbol space is topologically exact, so it is topologically mixing. And “topologically weakly mixing” is equivalent to “topologically transitive”, “topologically transitive” is equivalent to “having a dense orbit”. In 2013, Wu and Zhu ( [7] ) studied chaos generated by a class of weighted shift operators. Firstly, it is proved that the weighted shift operator is weakly mixing, transitive (or hypercyclic), and Devaney chaotic are equivalent to the separability of space. Moreover, this property is preserved under iteration. Then, it is obtained that the weighted shift operator is distributional chaotic and Li-Yorke sensitive. They also studied the dynamical properties of general weighted shift operators ( [8] ). It is proved that the weighted shift operator is uniformly distributional chaotic, and this property is maintained under iteration. In addition, it is proved that the principal measure of the weighted shift operator is equal to 1. Wang ( [9] , 2018) proved that there exists an uncountable invariant distributional irregular set of weighted shift operators on normed linear spaces Σ ( X ) , which generalizes the main results of [8] .

The study of shift operators acting on symbolic dynamical systems is often more concerned with the chaotic properties of their subshifts. Constructing counterexamples is a common and highly important method in mathematical research. The unique representation of symbolic space subshifts provides a straightforward tool for constructing counterexamples in the study of dynamical systems. Consequently, symbolic space subshifts play a crucial role in exploring various chaotic processes. It is necessary to delve into the various intriguing mathematical properties of subshifts. Exploring the chaotic properties of minimal subshifts reveals the complex balance between order and unpredictability in dynamic systems. Consider the logistic map—a classic example of chaos. Through simple iterations of a mathematical function, it showcases chaotic behavior, exemplifying the butterfly effect: tiny initial changes lead to vastly different outcomes. These insights transcend conventional mathematics and physics, impacting fields like weather forecasting. By dissecting the chaotic properties of minimal subshifts, we gain effective tools to understand and harness interdisciplinary complexity. Jiang and Fa ( [10] , 1993) studied the subshifts of finite-type symbolic dynamical systems and proved that finite-type subshifts are chaotic in the sense of Li-Yorke. Inspired by [8] and [10] , Liao and Fan construct a minimal subshift of the shift operator in [11] . It is proved that this minimal subshift is distributional chaotic, and its topological entropy is zero, so it is not topological chaotic. Furthermore, it is shown that positive topological entropy and distributional chaotic are not equivalent. Fu ( [12] , 2000) proved that the one-sided subshift generated by aperiodic recursive points is chaotic in the Robinson sense. In addition, if the subshift has a periodic point, then it has an infinite permutation set. Finally, some examples are given to discuss the topological entropy of these sub-displacements. Oprocha and Wilczynski ( [13] , 2007) proved the equivalence between distributional chaotic, chaotic in the sense of Li-Yorke, positive entropy and uncountable of subshifts. Some recent studies about subshifts see ( [14] [15] ) and others.

With the development of chaos, three types of distributional chaotic (DC1,

DC2, DC3) are proposed by Balibrea in [16] . Subsequently, DC 1 2 , ( p , q ) -DC,

uniformly distributional chaotic, distributional chaotic in a sequence { p k } , and distributional chaotic in a sequence { p k * } have been proposed. Therefore, a natural problem arises. Do the subshifts constructed above is uniformly distributional chaotic or the above type of distributional chaotic? This paper answers the above questions. To address disturbances or illusions in dynamic systems, the concept of measure centrality is proposed, dividing chaos into three different levels of complexity. The perspective of hierarchical chaos will contribute to a deeper understanding of chaotic systems. It indicates that all significant dynamical states of a system are manifested in its measure centrality, where the measure centrality of a minimal system is itself, hence discussing issues on such minimal systems is meaningful. In contrast to other studies on the chaotic properties of subshifts, this paper focuses on constructed subshifts, namely the study of the distribution chaotic properties of minimal subshifts. This work aims to comprehensively explore the distribution patterns of minimal subshifts, revealing their chaotic behavior and aiding in a further understanding of the chaotic properties of subshifts from a distributional chaos perspective. In Section 2, some basic concepts and definitions are introduced. In Section 3, some necessary lemmas are given first. Then, it is proved that the subshift σ | M is uniformly

distributional chaotic. So, σ | M is DC1, DC2, DC 2 1 2 , DC3 and ( 0 , 1 ) -DC. In

addition, it is proved that σ | M is distributional chaotic in a sequence { p k } and a sequence { p k * } .

Let ( X , ‖   ⋅   ‖ ) be a Banach space on the real number field ℝ . And

Σ ( X ) = { x = ( x 0 , x 1 , ⋯ ) | x i ∈ X , i ∈ ℕ } .

Suppose that ~ be an equivalence relation on X. A family of sets consisting of all different ~ equivalence classes of X is called the quotient set of X with respect to ~, denoted by X/~.

A metric d : Σ ( X ) × Σ ( X ) → ℝ is defined as

d ( x , y ) = ∑ n = 0 + ∞ 1 2 n ‖ x n − y n ‖ 1 + ‖ x n − y n ‖

for any x = ( x 0 , x 1 , ⋯ ) ,   y = ( y 0 , y 1 , ⋯ ) .

Obviously, d is a metric on Σ ( X ) and ( Σ ( X ) , d ) is a compact metric space. The backward shift operator σ : Σ ( X ) → Σ ( X ) is defined by

σ ( x 0 , x 1 , ⋯ ) = ( x 1 , x 2 , ⋯ )

for any x = ( x 0 , x 1 , ⋯ ) ∈ Σ ( X ) . In other words, the backward shift operator is to move the symbol sequence x on the space Σ ( X ) to the left one by one. If M is a closed set and σ ( M ) ⊂ M , then σ | M : M → M is called a subshifts of σ .

A finite arrangement A = x 0 x 1 ⋯ x n − 1 of symbols in X is called a symbol segment on X, and n is the length of A, denoted by | A | = n . If B = y 0 y 1 ⋯ y m − 1 is another symbol segment, write

A B = x 0 x 1 ⋯ x n − 1 y 0 y 1 ⋯ y m − 1 ,

then AB is also a symbol segment. A is said to appear in B (or A appears in B), denoted as A ≺ B , if n ≤ m and there is 0 ≤ k ≤ m − n , such that y k + i = x i , 0 ≤ i ≤ n − 1 .

In fact, a mapping g from a symbol segment x = x 0 x 1 ⋯ to Σ ( X ) can be established as g ( x ) = ( x 0 , x 1 , ⋯ ) .

A subset

[ A ] = { y = ( y 0 , y 1 , ⋯ ) | y i = x i , 0 ≤ i ≤ n − 1 }

is called a cylinder of g ( A ) .

For a given unit element e ∈ X , denote

Σ ( D ) = { x = ( x 0 , x 1 , ⋯ ) | x i ∈ D = { 0 , e } , i ∈ ℕ } .

Let A ¯ = a ¯ 0 a ¯ 1 ⋯ a ¯ n − 1 be the inverse of a symbol segment A = a 0 a 1 ⋯ a n − 1 on D, where

a ¯ i = { 0 , if a i = e , e , if a i = 0 ,   i = 0 , 1 , ⋯ , n − 1.

Obviously, | A | = | A ¯ | and A ¯ ¯ = A . Now take a symbol segment A 0 = 0 , let A 1 be an arrangement of A 0 and A ¯ 0 , that is, A 1 = A 0 A ¯ 0 or A 1 = A ¯ 0 A 0 . Inductively, the symbol segments A 1 , A 2 , ⋯ can be defined. And for any n ≥ 1 , A n exactly a finite arrangement of all members in the symbol segment set

K n − 1 = { K 0 K 1 ⋯ K n − 1 | K i ∈ A i , A ¯ i , 0 ≤ i ≤ n − 1 } .

For any n ≥ 0 , denote

L n = | A 0 A 1 ⋯ A n | .

Let a = A 0 A 1 ⋯ , then g ( a ) ∈ Σ ( D ) . Denote M = ω ( g ( a ) , σ ) ⊂ Σ ( D ) , M is the ω -limit set of g ( a ) , obviously M is a closed set and σ ( M ) ⊂ M , i.e., through the aforementioned construction, M is obtained, where σ acts as a shift operator on the closed set M. So σ | M : M → M is a subshift of σ . In fact, Liao and Fan ( [11] , 1998) proved that it is also a minimal subshift of σ .

The concepts of several types of distributonal chaos are introduced below.

Let f be a continuous self-map on a metric space X. For any pair ( x , y ) ∈ X × X and for each n ∈ ℕ , the distribution function F x y n : ℝ → [ 0 , 1 ] is defined by

F x y n ( t ) = 1 n card { 1 ≤ i ≤ n : d ( f i ( x ) , f i ( y ) ) < t } ,

where card { A } denotes the cardinality of the set A.

Put

F x y * ( t ) = lim sup n → ∞ F x y n ( t ) ,   F x y ( t ) = lim inf n → ∞ F x y n ( t ) .

Then F x y * ( t ) is called the upper distribution function, and F x y ( t ) the lower distribution function of x and y.

If the pair ( x , y ) satisfies

(DC1) F x y * = 1 and F x y ( ϵ ) = 0 for some ϵ > 0 , or

(DC2) F x y * = 1 and F x y ( ϵ ) < 1 for any ϵ > 0 in an interval, or

(DC2 1 2 ) there exist c > 0 and r > 0 such that F x y ( t ) < c < F x y * ( t ) for any 0 < t < r , or

(DC3) F x y ( t ) < F x y * ( t ) for any t > 0 in an interval, or

((p, q)-DC) there exist r > 0 and 0 ≤ p ≤ q ≤ 1 such that

F x y ( t ) = p ,   F x y * ( t ) = q

for any 0 < t < r , then, ( x , y ) is called a distributional chaotic pair of type k ( k ∈ { 1 , 2 , 2 1 2 , 3 } ) or type ( p , q ) for f. The mapping f is said to be distributional chaotic of type k ( k ∈ { 1 , 2 , 2 1 2 , 3 } ) or type ( p , q ) if there exists an uncountable set F ⊂ X such that every pair ( x , y ) of distinct points in F is a distributional chaotic pair of type k ( k ∈ { 1 , 2 , 2 1 2 , 3 } ) or type ( p , q ) for f. f is said to be

uniformly distributional chaotic if there exist an uncountable set F ⊂ X and an ϵ > 0 such that for every pair ( x , y ) of distinct points in F, F x y * = 1 and F x y ( ϵ ) = 0 . It follows by the definition that, for a continuous map f of a compact metric space, DC1 implies DC2, and DC2 implies DC3.

Next, the definition of distributional chaotic in a sequence is given.

Definition 2.1 [17] Let X be a compact metric space, { m i } i = 1 ∞ be a strictly increasing sequence of positive integers, and f : X → X be a continuous map.

Then f is said to be distributional chaotic in a sequence { m i } i = 1 ∞ if there is an uncountable subset S ⊂ X such that for any two distinct points x , y ∈ S ,

lim sup n → ∞ 1 n card { 1 ≤ i ≤ n : d ( f m i ( x ) , f m i ( y ) ) < t } = 1

for any t > 0 and

lim inf n → ∞ 1 n card { 1 ≤ i ≤ n : d ( f m i ( x ) , f m i ( y ) ) < ϵ } = 0

for some ϵ > 0 .

And, a stronger chaotic description than distributional chaotic in a sequence is introduced, which will use the following concepts about density.

Definition 2.2 [17] Let J = { j n } n = 1 ∞ be a strictly increasing positive integer sequence. If lim n → ∞ n j n exists, then the limit is called the density of the sequence J, denoted by μ ( J ) .

For a given positive integer sequence J = { j n } n = 1 ∞ , and a positive integer m, write

C J ( m ) = card { n ≥ 1 | j n ≤ m } .

Obviously, if the density of the sequence is meaningful, then

μ ( J ) = lim m → ∞ C J ( m ) m .

Definition 2.3 [17] Let J = { j n } n = 1 ∞ be a strictly increasing sequence of positive integers and { m i } i = 1 ∞ is a subsequence of J. The upper limit

lim sup n → ∞ card { i ≥ 1 | m i ≤ j n } n

is the upper density of the sequence { m i } i = 1 ∞ relative to the sequence J, denoted by μ * ( { m i } i = 1 ∞ / J ) .

Definition 2.4 [17] A sequence J = { j n } n = 1 ∞ is said converge weakly to j if there exists a subsequence { m i } i = 1 ∞ of natural number sequence with upper density 1 such that lim i → ∞ j m i = j , denoted by lim i → ∞ * j i = j .

Definition 2.5 [17] Let X be a compact metric space, { m i } i = 1 ∞ be a strictly increasing sequence of positive integers, and f : X → X be a continuous map. f is said to be distributional chaotic in a sequence { m i * } i = 1 ∞ if there exists an uncountable set S ⊂ X such that for any positive integer l, there exist l distinct points b 1 , b 2 , ⋯ , b l ∈ X such that for any finite subset A = { a 1 , a 2 , ⋯ , a l } of l points in S, and for any mapping F : A → { b 1 , b 2 , ⋯ , b l } , the

lim i → ∞ * f m i ( a ) = F ( a )

for any a ∈ A .

From the definition of several distributional chaos mentioned above, uniformly distributional chaotic is stronger than DC1, because the number ϵ that appears in its definition does not depend on the pair ( x , y ) . And DC1 implies

DC2, DC2 implies DC 2 1 2 , DC 2 1 2 implies DC3, i.e.,

DC1 ⊂ DC2 ⊂ DC2 1 2 ⊂ DC3 ,

which in turn does not hold. Distributional chaos is obviously distributed in accordance with the natural number sequence, otherwise it does not necessarily hold.

Lemma 3.1 [11] For any n > 0 , L n = ( 2 n + 1 ) L n − 1 .

Proof. According to the definition, it can be directly verified.

Lemma 3.2 [11] For any n > 0 , a = A 0 A 1 ⋯ is an infinite arrangement of symbol segments in K n .

Proof. This lemma can be found in [11] . For the completeness of the paper, we provide its proof. The following primarily consists of proving Lemma 3.2 through mathematical induction.

For any given n > 0 , by definition, A n + 1 and A ¯ n + 1 are finite arrangement of symbol segments in K n . Suppose for some k ≥ 0 , it has been proved that A n + 1 , A ¯ n + 1 , A n + 2 , A ¯ n + 2 , ⋯ , A n + k and A ¯ n + k are all the finite symbol segments in K n has been proved. Since A n + k + 1 and A ¯ n + k + 1 are both the finite symbol segments of the form K 0 K 1 ⋯ K n ⋯ K n + k in K n , where

K 0 K 1 ⋯ K n ∈ K n ,   K n + i ∈ { A n + i , A ¯ n + i } ,   1 ≤ i ≤ k ,

they are also the finite symbol segments in K n . In this way, it is proved that for each m > n , A m and A ¯ m are finite symbol segments in K n . By the definition of a, one can get that Lemma 3.2 holds.

Lemma 3.3 There is an uncountable subset S ⊂ Σ ( D ) such that for any two distinct points x = ( x 0 , x 1 , ⋯ ) , y = ( y 0 , y 1 , ⋯ ) ∈ S , x k = y k for infinitely many k and x l ≠ y l for infinitely many l.

Proof. The key to proving Lemma 3.3 lies in defining an equivalence relation on the set Σ ( D ) , thereby obtaining uncountably many equivalence classes. Selecting one element from each equivalence class results in the construction of an uncountable set S satisfying the given conditions.

For any x = ( x 0 , x 1 , ⋯ ) , y = ( y 0 , y 1 , ⋯ ) ∈ Σ ( D ) , define a relation on the set Σ ( D ) , denoted by x ~ y , if only for a finite number of k, x k = y k , or only for a finite number of l, x l ≠ y l . It can be verified that ~ is an equivalence relation on the set Σ ( D ) . Let x ∈ Σ ( D ) , according to the above equivalence relation, it is not difficult to get a countable set { y ∈ Σ ( D ) | y ~ x } , so the quotient set Σ ( D ) / ~ is uncountable.

Therefore, one can take a representative element in each equivalence class of an uncountable set Σ ( D ) / ~ to form a subset of Σ ( D ) , denoted by S. Then, S is an uncountable set satisfying the condition.

Lemma 3.4 [18] Let X be a compact metric space and f : X → X be a continuous map. If there are two nonempty descending closed set sequences { U i } , { V i } in X and a positive integer sequence { m i } i = 1 ∞ such that

1) ∩ i = 1 ∞ U i = { a } ,   ∩ i = 1 ∞ V i = { b } and a ≠ b ;

2) f m i ( U i ) ∩ f m i ( V i ) ⊃ U i + 1 ∪ V i + 1 for any i = 1 , 2 , ⋯ ,

then f is distributional chaotic in the sequence { p k } k = 1 ∞ , where

p k = ∑ i = 1 k m i ( k ∈ ℕ ) .

Proof. This conclusion can be found in [18] . For the completeness of the paper, we provide its proof. The proof is given by constructing a sequence of positive integers { r i } i = 1 ∞ and defining a mapping φ from a set E to W .

Let W = { { W i } | W i ∈ { U i , V i } ,   i = 1 , 2 , ⋯ } , then for any { W i } ∈ W , there exists x ∈ W 1 , such that for any k ≥ 1 , f p k ( x ) ∈ W k + 1 holds, where p k = ∑ i = 1 k m i ( k ∈ ℕ ) .

The positive integer sequence { r i } i = 1 ∞ is selected, where r 1 = 1 , r n + 1 = ( 2 n + 1 ) r n , n ≥ 1 . Let S ⊂ Σ ( D ) be uncountable, such that for any different points two distinct points x = ( x 0 , x 1 , ⋯ ) , y = ( y 0 , y 1 , ⋯ ) ∈ S , there are infinitely many m such that x m ≠ y m , and there are infinitely many n such that x n ≠ y n , by Lemma 3.3, such a set E exists. Define φ : E → W by φ ( x ) = { W j } for each x = ( x 0 , x 1 , ⋯ ) ∈ S , where

W 1 = { U 1 , if   x 0 = 0 , V 1 , if   x 0 = e ,

and for any n > 1 , if r n − 1 < j ≤ r n , the

W j = { U j , if   x j = 0 , V j , if   x j = e .

For each W = { W j } ∈ φ ( E ) , it can be seen that there must be x w ∈ W 1 ⊂ X such that when k ≥ 1 , f p k ( x w ) ∈ W k + 1 holds. Let F = { x w | W ∈ φ ( E ) } . Since φ is injective, E is uncountable, so φ ( E ) is uncountable, and then F is uncountable. Therefore, it is only necessary to verify that the points in F satisfy the two conditions of Definition 2.1. Let x , y ∈ F , x ≠ y , there exists { W j } , { Z j } , such that when k ≥ 1 , there are f p k ( x ) ∈ W k + 1 and f p k ( y ) ∈ Z k + 1 .

On the one hand, there exists n i → + ∞ , such that for each i, when r n i − 1 < j ≤ r n i , W j and Z j are always different. Take ε = 1 2 d ( a , b ) , when i sufficiently large,

and r n i − 1 < j ≤ r n i , d ( U j , V j ) > ε holds. In particular, d ( f p j ( x ) , f p j ( y ) ) > ε holds. Then, for sufficiently large i, there is

1 r n i ∑ k = 1 r n i x [ 0 , ε ) ( d ( f p k ( x ) , f p k ( y ) ) ) ≤ r n i − 1 r n i = r n i − 1 ( 2 n i − 1 + 1 ) r n i − 1 → 0   ( i → ∞ ) .

This indicates that F x y ( ε ) = 0 .

On the other hand, x ≠ y also implies that there exists n j → + ∞ such that for each j, when r n i − 1 < j ≤ r n i , there is always W j = Z j , that is, W j and Z j are either U j or V j at the same time. For any t > 0 , there exists a sufficiently large j such that when r n i − 1 < j ≤ r n i , d ( U j , V j ) < t holds. In particular, d ( f p j ( x ) , f p j ( y ) ) < t holds. Then, for sufficiently large j   ( j → ∞ ) , one can get

1 r n j ∑ k = 1 r n j x [ 0 , t ) ( d ( f p k ( x ) , f p k ( y ) ) ) ≥ r n j − r n j − 1 r n j = 1 − r n j − 1 r n j = 1 − r n j − 1 ( 2 n j − 1 + 1 ) r n j − 1 → 1.

Thus F x y * ( t ) = 1 . In summary, the points in the uncountable set F satisfy the two conditions in Definition 2.1. Therefore, f is distributional chaotic in the

sequence { p k } k = 1 ∞ , where p k = ∑ i = 1 k m i ( k ∈ ℕ ) .

Lemma 3.5 [17] Let X be a compact metric space and f : X → X be a continuous map. If there are l closed set sequences { B i j } i = 1 ∞ ( j = 1 , 2 , ⋯ , l ) in X and a positive integer sequence { m i } i = 1 ∞ , such that

1) ∩ i = 1 ∞ B i j = { b j } ,   j = 1 , 2 , ⋯ , l and b j 1 ≠ b j 2 for j 1 ≠ j 2 ,

2) ∩ j = 1 l f m i ( B i j ) ⊃ ∪ j = 1 k B i + 1 j , for any i = 1 , 2 , ⋯ .

Let p k = ∑ i = 1 k m i ( k ∈ ℕ ) , then f is distributional chaotic in the sequence { p k * } k = 1 ∞ .

Proof. This result can be found in [17] . For the completeness of the paper, we provide its proof. Constructing an appropriate sequence of positive integers and defining a key mapping are the difficulties and key points of the whole proof.

Let C = { { C i } | C i ∈ { B i 1 , B i 2 , ⋯ , B i l } ,   i = 1 , 2 , ⋯ } , then for any { C i } ∈ C , there exists x ∈ C 1 , such that for any k ≥ 1 , f p k ( x ) ∈ C k + 1 holds, where p k = ∑ i = 1 k m i

( k ∈ ℕ ) . The positive integer sequence { r i } = { n ! } is selected, for any positive integer s, there must be an uncountable subset E s (by [17] ) of the symbol space E with s symbols 1 , 2 , ⋯ , s such that for any s distinct points w 1 , w 2 , ⋯ , w s in E s and any mapping

ϕ : { w 1 , w 2 , ⋯ , w s } → { 1 , 2 , ⋯ , s } .

Obviously, there are s s such mappings, denoted by ϕ l ( l = 1 , 2 , ⋯ , s s ) . Then there exists a sequence { N i l } such that

w j ( N 1 l ) = w j ( N 2 l ) = ⋯ = ϕ l ( w j ) .

Define φ : E s → C by φ ( w ) = { C j } for each w = w 1 w 2 ⋯ ∈ E s , where C 1 = B 1 w 1 and for any n > 1 , if r n − 1 < s ≤ r n , the C s = B s w n . For each C = { C j } ∈ φ ( E s ) , it can be seen that there must be x c ∈ C 1 ⊂ X such that when s ≥ 1 , f p s ( x c ) ∈ C s + 1 holds. Let D = { x c | C ∈ φ ( E s ) } . Since φ is injective, E s is uncountable, so φ ( E s ) is uncountable, and then D is uncountable.

Now we assert that D is distributional scrambled set in the sequence { p k * } k = 1 ∞ .

Indeed, for any subset D 1 = { x 1 , x 2 , ⋯ , x s } with s different points in D, there exists { C s j } such that for any s ≥ 1 , f p s ( x j ) ∈ C s + 1 j ( j = 1 , 2 , ⋯ , s ) holds. For

any F : D 1 → { b 1 , b 2 , ⋯ , b k } , take ϕ l 0 , such that b ϕ l 0 ( w j ) = F ( x j ) ( j = 1 , 2 , ⋯ , s ) . Then, when r N i − 1 l 0 < s ≤ r N i l 0 , there are f p s ( x j ) ∈ B s ϕ l 0 ( w j ) .

Thus, lim s → ∞ * f P s ( x j ) = ( x j ) for any j = 1 , 2 , ⋯ , s . By Definition 2.5, f is distributional chaotic in the sequence { p k * } k = 1 ∞ .

The following are the main conclusions of this study.

Theorem 3.1 The subshift operator σ | M is uniformly distributional chaotic.

Proof. The key uncountable set S can be obtained by lemma 3.3, and a mapping f satisfying certain conditions is defined on S, and then the set F is constructed according to the following construction method. It can be proved that F

is a distributional ϵ -scrambled set of σ | M with ϵ = 1 2 .

Let S be an uncountable subset of Σ ( D ) such that for any two distinct points x = ( x 0 , x 1 , ⋯ ) ,   y = ( y 0 , y 1 , ⋯ ) ∈ S , x k = y k for infinitely many k and x l ≠ y l for infinitely many l.

Denote a mapping f, such that f ( x ) = K 0 K 1 ⋯ for any x = ( x 0 , x 1 , ⋯ ) ∈ S , where

K i = { A i , if   x i = e , A i ¯ , if   x i = 0 ,   i = 0 , 1 , ⋯

Let h = g ∘ f ,   F = h ( S ) and L n = | K 0 K 1 ⋯ K n | . For a fixed i ∈ ℕ and arbitrarily selected K j ( 0 ≤ j ≤ i ) , there always have b i = K 0 K 1 ⋯ K i ≺ A i + 1 ≺ a . Therefore, there exists k ≥ 0 , such that the first L i symbols of σ k ( a ) are b i . That is to say, for a fixed i ∈ ℕ , there exists a k ≥ 0 such that the front L i components of σ k ( g ( a ) ) are g ( b i ) . This shows that for any x ∈ E , h ( x ) ∈ ω ( g ( a ) , σ ) = M . Therefore, F ⊂ M , and because h is injective, S is an uncountable set, so S is also an uncountable set.

Assume that F is a distributional ϵ -scrambled set of σ | M with ϵ = 1 2 . For

any pair x , y ∈ F with x ≠ y , let x ¯ = g − 1 ( x ) and y ¯ = g − 1 ( y ) . Without loss of generality, we assume x ¯ = B 0 B 1 ⋯ and y ¯ = C 0 C 1 ⋯ , where B i , C i ∈ { A i , A ¯ i } , i = 0 , 1 , ⋯ . According to the construction of S, there exist a subsequence

{ B k i } i = 1 ∞ ⊂ { B 0 , B 1 , B 2 , ⋯ } such that B k i = C k i ( i ∈ ℕ ) and a subsequence

{ B l i } i = 1 ∞ ⊂ { B 0 , B 1 , B 2 , ⋯ } such that B l i = C ¯ l i ( i ∈ ℕ ) .

First, it is easy to see that the first L k i − m components of σ m ( x ) and σ m ( y ) coincide correspondingly for L k i − 1 ≤ m ≤ L k i 2 . So

d ( σ m ( x ) , σ m ( y ) ) = ∑ n = m + ∞ 1 2 n ‖ x n − y n ‖ 1 + ‖ x n − y n ‖ = ∑ n = L k i − m + ∞ 1 2 n ‖ x n − y n ‖ 1 + ‖ x n − y n ‖ ≤ ∑ n = L k i − m + ∞ 1 2 n ≤ ∑ n = L k i 2 + ∞ 1 2 n = 1 2 L k i 2 + 1 .

Thus, for a given t > 0 , there exists a positive integer N such that d ( σ m ( x ) , σ m ( y ) ) < t for any m > N and any L k i − 1 ≤ m ≤ L k i 2 . Then,

F x y * ( t ) = lim sup n → ∞ 1 n card { 1 ≤ m ≤ n : d ( σ m ( x ) , σ m ( y ) ) < t } ≥ lim sup i → ∞ 1 L k i 2 card { 1 ≤ m ≤ L k i 2 : d ( σ m ( x ) , σ m ( y ) ) < t } ≥ lim sup i → ∞ L k i 2 − L k i − 1 L k i 2 = lim sup i → ∞ ( 1 − 2 2 k i + 1 ) = 1.

Second, it can be obtained that x m ≠ y m ∈ D = { 0 , e } for L l i − 1 ≤ m ≤ L l i . Then

d ( σ m ( x ) , σ m ( y ) ) ≥ ‖ x m − y m ‖ 1 + ‖ x m − y m ‖ = 1 2 .

So,

F x y ( 1 2 ) = lim inf n → ∞ 1 n card { 1 ≤ m ≤ n : d ( σ m ( x ) , σ m ( y ) ) < 1 2 } ≤ lim inf i → ∞ 1 L l i card { 1 ≤ m ≤ L l i : d ( σ m ( x ) , σ m ( y ) ) < 1 2 } ≤ lim inf i → ∞ L l i − 1 L l i = lim inf i → ∞ 1 2 l i + 1 = 0.

Hence, σ | M is uniformly distributional chaotic.

This proof has been completed.

Theorem 3.2 σ | M is distributional chaotic of type k ( k ∈ { 1 , 2 , 2 1 2 , 3 } ) and is ( p , q ) -distribution (where p = 0 ,   q = 1 ).

Proof. This theorem can be obtained by Theorem 3.1. Since σ | M is uniformly distributional chaotic, then σ | M is DC1. So, σ | M is also DC2 and DC3.

According to the Theorem 3.1, there exist an uncountable set F ⊂ M and a ϵ = 1 2 > 0 such that, for every pair ( x , y ) of distinct points in F, F x y * = 1 and F x y ( 1 2 ) = 0 . Take r = 1 2 , for any 0 < t < r ,

F x y ( t ) = lim inf n → ∞ 1 n card { 1 ≤ m ≤ n : d ( σ m ( x ) , σ m ( y ) ) < t } ≤ lim inf n → ∞ 1 n card { 1 ≤ m ≤ n : d ( σ m ( x ) , σ m ( y ) ) < 1 2 } ≤ lim inf i → ∞ 1 L l i card { 1 ≤ m ≤ L l i : d ( σ m ( x ) , σ m ( y ) ) < 1 2 } ≤ lim inf i → ∞ L l i − 1 L l i = lim inf i → ∞ 1 2 l i + 1 = 0.

Then, for every pair ( x , y ) of distinct points in F, there exist c > 0 and r = 1 2 > 0 such that F x y ( t ) = 0 < c < F x y * ( t ) = 1 for any 0 < t < r . Thus, σ | M is DC 2 1 2 . Take p = 0 and q = 1 , for every pair ( x , y ) of distinct points in F,

F x y ( t ) = 0 = p and F x y * ( t ) = 1 = q for any 0 < t < r . Thus, σ | M is ( 0 , 1 ) -DC.

This proof has been completed.

Theorem 3.3 The subshift operator σ | M is distributional chaotic in a sequence { p k } k = 1 ∞ .

Proof. It is proved that only the sequence satisfying the condition can be constructed. For a given x = ( x 0 , x 1 , ⋯ ) ∈ Σ ( D ) , let k = K 0 K 1 ⋯ , k ¯ = K ¯ 0 K ¯ 1 ⋯ , and L n = | K 0 K 1 ⋯ K n | , where

K i = { A i , if x i = e , A i ¯ , if x i = 0 ,   i = 0 , 1 , ⋯

Obviously, k ≠ k ¯ . Denote

U n = [ K 0 K 1 ⋯ K n − 1 ] ∩ M and V n = [ K ¯ 0 K ¯ 1 ⋯ K ¯ n − 1 ] ∩ M ,

where n = 1 , 2 , ⋯ , then it is easy to see that

∩ n = 1 ∞ U n = K 0 K 1 ⋯ = k ,   ∩ n = 1 ∞ V n = K ¯ 0 K ¯ 1 ⋯ = k ¯ ,

and

σ L n − 1 ( U n ) ∩ σ L n − 1 ( V n ) = M ⊃ U n + 1 ∪ V n + 1 ,   n = 1 , 2 , ⋯ .

Let p k = ∑ n = 1 k L n − 1 ( k ∈ ℕ ) , according to Lemma 3.4, σ | M is distributional chaotic in the sequence { p k } k = 1 ∞ .

This proof has been completed.

Theorem 3.4 The subshift operator σ | M is distributional chaotic in a sequence { p k * } ( k = 1 , 2 , ⋯ ) .

Proof. Similar to the proof of Theorem 3.3, it is sufficient to construct a sequence that satisfies the condition.

For a given x = ( x 0 , x 1 , ⋯ ) ∈ Σ ( D ) , let b = K 0 K 1 K 2 ⋯ and

b 1 = K ¯ 0 K 1 K 2 ⋯ ,   b 2 = K 0 K ¯ 1 K 2 ⋯ ,   ⋯ ,   b l = K 0 K 1 ⋯ K l − 2 K ¯ l − 1 K l ⋯ ,

L j = | K 0 K 1 ⋯ K j | ,

where

K i = { A i , if x i = e , A i ¯ , if x i = 0 ,   i = 0 , 1 , ⋯

Obviously, b 1 ≠ b 2 ≠ ⋯ ≠ b l . Denote

B 1 j = [ K ¯ 0 K 1 K 2 ⋯ K j − 1 ] ∩ M ,   B 2 j = [ K 0 K ¯ 1 K 2 ⋯ K j − 1 ] ∩ M , ⋯ , B l j = [ K 0 K 1 ⋯ K l − 2 K ¯ l − 1 K l ⋯ K j − 1 ] ∩ M ,

where j = 1 , 2 , ⋯ , then it is easy to see that

∩ i = 1 ∞ B i j = { b j } ( i = 1 , 2 , ⋯ , l ) , b j 1 ≠ b j 2 for j 1 ≠ j 2

and

∩ j = 1 l σ L j − 1 ( B i j − 1 ) = M ⊃ ∪ j = 1 k B i + 1 j

for any i = 1 , 2 , ⋯ .

Let p k = ∑ j = 1 k L j − 1 ( k ∈ ℕ ) , according to Lemma 3.5, σ | M is distributional chaotic in a sequence { p k * } ( k = 1 , 2 , ⋯ ) .

This proof has been completed.

This study investigated distributional chaoticity of minimal subshift of shift operators. The conclusions involved include DC1, DC2, DC3, DC 2 1 2 , (p,

q)-distributional chaos, uniformly distributional chaos, and distributional chaotic in a sequence. Compared with other literatures, the contents in this paper are more comprehensive.

There are many thanks to the experts for their valuable suggestions.

The authors Yuanlin Chen and Jiazheng Zhao is in Sichuan University of Science and Engineering. The corresponding author Tianxiu Lu has two affiliations, that is, Sichuan University of Science and Engineering and Key Laboratory of Bridge Non-destruction Detecting and the Engineering Computing.

This work was supported by Natural Science Foundation of Sichuan Province (No. 2023NSFSC0070) and the Opening Project of Sichuan Province University Key Laboratory of Bridge Non-destruction Detecting and the Engineering Computing (Nos. 2023QYJ06, 2023QYJ07).

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

Chen, Y.L., Lu, T.X. ad Zhao, J.Z. (2024) Distributional Chaoticity of the Minimal Subshift of Shift Operators. Journal of Applied Mathematics and Physics, 12, 1647-1660. https://doi.org/10.4236/jamp.2024.125102