$k$-type Chaos for Induced Group Actions on Hyperspaces

This paper investigates the correlation between $k$-type dynamical properties of $\mathbb{Z}^d$-actions on compact metric spaces and their induced actions on the corresponding hyperspaces. We extend the classical results from discrete dynamical systems and general group actions to the specific setting of $k$-type dynamics. Specifically, we define and study $k$-type transitivity, $k$-type mixing, $k$-type weak mixing, and $k$-type Li-Yorke chaos for induced hyperspace actions, establishing that these properties transfer from the base system to the hyperspace under appropriate conditions.

💡 Research Summary

The paper studies the relationship between certain dynamical properties of a ℤᵈ‑action T on a compact metric space X and the corresponding induced action ˆT on the hyperspace Sub X (the space of non‑empty closed subsets of X equipped with the Hausdorff metric). The authors first introduce a “k‑type” order on ℤᵈ, parameterised by an integer k∈{1,…,2ᵈ}, and use it to define k‑type transitivity, k‑type weak mixing, k‑type mixing, k‑type proximal and asymptotic pairs, and finally k‑type Li‑Yorke chaos. These notions generalise the classical single‑map concepts to multi‑directional group actions.

The induced action is defined by ˆTₙ(A)=Tₙ(A) for each n∈ℤᵈ and A∈Sub X; it is a homeomorphism and respects the group law. The main results establish that each of the k‑type properties is preserved under passage from the base system to the hyperspace and vice‑versa, provided the appropriate definitions are used.

1. k‑type transitivity: If (Sub X, ˆT) is k‑type transitive, then (X, T) is also k‑type transitive. The proof relies on extending open subsets U⊂X to open subsets e(U) of the hyperspace and showing ˆTₙ(e(U))⊂e(Tₙ(U)). The converse implication follows by the same argument.

2. k‑type weak mixing: The paper proves an equivalence between weak mixing of the base action and of the induced action. A key combinatorial lemma shows that for any finite collection of open pairs (Uᵢ,Vᵢ) there exists a single group element m that simultaneously separates all pairs; this is achieved by constructing auxiliary open sets E and F and applying induction.

3. k‑type mixing: Mixing is shown to be equivalent as well. For each open pair (U,V) in the hyperspace, the authors decompose U and V into finitely many basic open sets in X, apply the mixing property of the base action to obtain finite exceptional sets Fᵢ, and then take their union to obtain a finite exceptional set F for the hyperspace. The converse direction uses the same decomposition in reverse.

4. k‑type proximal and asymptotic pairs: It is proved that a point pair (x,y) is k‑type proximal (or asymptotic) for T if and only if the corresponding singleton sets ({x},{y}) are k‑type proximal (or asymptotic) for ˆT. The argument uses the equality of the Hausdorff distance between singletons and the original metric, together with compactness arguments to extract limit points.

5. k‑type Li‑Yorke chaos: Finally, the authors show that the existence of an uncountable k‑scrambled set in X (i.e., a set where every distinct pair is k‑type Li‑Yorke) is equivalent to the existence of such a set in the hyperspace. This follows from the previous results on proximal and asymptotic pairs and the fact that taking singletons embeds X into Sub X.

Overall, the work extends classical results about transitivity, mixing, and chaos for a single continuous map to the more general setting of multi‑dimensional group actions with a refined “k‑type” ordering, and demonstrates that passing to the hyperspace does not destroy these dynamical complexities. The results provide a unified framework for studying higher‑dimensional discrete dynamics both at the point level and at the level of compact subsets.