COHERENT LISTS AND CHAOTIC SETS

摘要

In this article we apply (recently extended by Kato and Akin) an elegant method of Iwanik (which adopts independence relations of Kuratowski and Mycielski) in the construction of various chaotic sets. We provide "easy to track" proofs of some known facts and establish new results as well. The main advantage of the presented approach is that it is easy to verify each step of the proof, when previously it was almost impossible to go into all the details of the construction (usually performed as an inductive procedure). Furthermore, we are able extend known results on chaotic sets in an elegant way. Scrambled, distributionally scrambled and chaotic sets with relation to various notions of mixing are considered.