Borel complexity of the family of attractors for weak IFSs
arXiv:2111.01921
Abstract
This paper is an attempt to measure the difference between the family of iterated function systems attractors and a broader family, the set of attractors for weak iterated function systems. We discuss Borel complexity of the set wIFS of attractors for weak iterated function systems acting on (as a subset of the hyperspace of all compact subsets of equipped in the Hausdorff metric). We prove that wIFS is -hard in , for all . In particular, wIFS is not (in contrast to the family IFS of attractors for classical iterated function systems acting on , which is ). Moreover, we show that in the one-dimensional case, wIFS is an analytic subset of .