Distributional chaos in dendritic and circular Julia sets (Q2348509): Difference between revisions

Consider a discrete dynamical system \((X,f)\) defined by the iteration of a function \(f\) acting over a (compact) metric space \(X\). Intuitively, such a system is said to exhibit chaotic behavior if pairs of nearby points have orbits that tend to separate after a certain number of iterations. \textit{B. Schweizer} and \textit{J. Smítal} [Trans. Am. Math. Soc. 344, No. 2, 737--754 (1994; Zbl 0812.58062)] introduced the notion of distributional chaos, based on the idea of a ``distributional scrambled pair \((x,y)\)'' that is, a pair of distinct points \(x,y \in X\) that satisfy both the upper and lower density conditions, namely \[ \limsup_{n\to\infty} \frac{1}{n} \left| \{ 0\leq k<n~|~d(f^k(x),f^k(y))<t\}\right| =1 \] for every \(t>0\), and for some \(t>0\), \[ \liminf_{n\to\infty} \frac{1}{n} \left| \{ 0\leq k<n~|~d(f^k(x),f^k(y))<t\}\right|=0. \] If the set of all distributional scrambled pairs is uncountable in \(X\), then \(f\) is said to be distributionally chaotic of type 1. Moreover, if there exists a value \(t'>0\) for which the lower distribution equals zero for all distributional scrambled pairs, then the chaos is said to be uniform. Based on the description of shift-invariant subspaces of kneading sequences developed by \textit{S. Baldwin} [J. Fixed Point Theory Appl. 7, No. 1, 201--222 (2010; Zbl 1205.37021)], the authors study distributional chaos of certain quadratic polynomial maps \(f_c(z)=z^2+c\) when restricted to their Julia sets. If the Julia set of \(f_c\) is a dendrite, the authors show that \(f_c\) is distributionally chaotic of type 1 and in fact, such chaos is uniform. The same conclusion is derived whenever \(f_c\) has a parabolic or attracting cycle and the kneading sequence of the critical value is acceptable with respect to an abstract space of infinite sequences in two digits and two wildcards. Since distributional chaos is invariant under conjugacy when restricted to compact metric spaces [\textit{F. Martínez-Giménez} et al. J. Math. Anal. Appl. 351, No. 2, 607--615 (2009; Zbl 1157.47008)], the authors show the existence of a uncountable set of distributional scrambled pairs for the shift map acting on its corresponding sequence space.