Infinite-step nilsystems, independence and complexity
Abstract
An ∞-step nilsystem is an inverse limit of minimal nilsystems. In this article is shown that a minimal distal system is an ∞-step nilsystem if and only if it has no nontrivial pairs with arbitrarily long finite IP-independence sets. Moreover, it is proved that any minimal system without nontrivial pairs with arbitrarily long finite IP-independence sets is an almost one to one extension of its maximal ∞-step nilfactor, and each invariant ergodic measure is isomorphic (in the measurable sense) to the Haar measure on some ∞-step nilsystem. The question if such a system is uniquely ergodic remains open. In addition, the topological complexity of an ∞-step nilsystem is computed, showing that it is polynomial for each nontrivial open cover.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.