Combinatorial independence and naive entropy
Hanfeng Li, Zhen Rong

TL;DR
This paper explores the concept of naive entropy in group actions, demonstrating that positive naive entropy implies chaos and untameness, while distal actions have zero naive entropy, answering a question posed by Lewis Bowen.
Contribution
It introduces the independence density for families of set tuples in group actions and establishes its implications for entropy and chaos.
Findings
Actions with positive naive entropy are Li-Yorke chaotic.
Distal actions have zero naive entropy.
The results answer a question of Lewis Bowen.
Abstract
We study the independence density for finite families of finite tuples of sets for continuous actions of discrete groups on compact metrizable spaces. We use it to show that actions with positive naive entropy are Li-Yorke chaotic and untame. In particular, distal actions have zero naive entropy. This answers a question of Lewis Bowen.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Combinatorial Independence and Naive Entropy
Hanfeng Li
and
Zhen Rong
H.L., Center of Mathematics, Chongqing University, Chongqing 401331, China.
Department of Mathematics, SUNY at Buffalo, Buffalo, NY 14260-2900, USA.
Z.R., College of Statistics and Mathematics, Inner Mongolia University of Finance and Economics, Hohhot 010000, China.
(Date: April 10, 2020)
Abstract.
We study the independence density for finite families of finite tuples of sets for continuous actions of discrete groups on compact metrizable spaces. We use it to show that actions with positive naive entropy are Li-Yorke chaotic and untame. In particular, distal actions have zero naive entropy. This answers a question of Lewis Bowen.
Key words and phrases:
Naive entropy, combinatorial independence, Li-Yorke chaos, distal action, tame action
2010 Mathematics Subject Classification:
37B40, 37B05, 37A35, 05D10
1. Introduction
Let a countably infinite group act on a compact metrizable space continuously. Motivated by the consideration in [7] for the naive entropy of measure-preserving actions, Burton introduced the naive topological entropy of in [8]. This is also studied in [11]. For a finite open cover of , denote by the minimal cardinality of subcovers of . For any nonempty finite subset of , set . The naive entropy of is defined as
[TABLE]
where ranges over nonempty finite subsets of . The naive entropy of is defined as
[TABLE]
for ranging over finite open covers of .
It is known that the naive entropy coincides with the classical topological entropy when is amenable [11, Theorem 6.8]. When is sofic, if , then the sofic topological entropy of with respect to any sofic approximation sequence of is either or [math] [8, Theorem 1.1] [34, Propositions 4.6 and 4.16]. When is nonamenable, is either [math] or [8, Section 2.2]. Thus for nonamenable , the naive entropy just describes the action as having positive entropy or zero entropy.
Initiated by the work of Blanchard [3, 4], the local entropy theory developed quickly [5, 6, 10, 12, 23, 25, 26, 27, 28, 29, 32, 33, 34, 35]. A combinatorial approach was given to this theory in [32]. It turns out that the combinatorial approach enables us to give a unified treatment for several dynamical properties. In general, one considers tuples of subsets of which have large independence sets in (see Definition 2.1 below), and then localizes to tuples of points in for which the tuple of subsets associated to any product neighborhood has large independence sets. Different largeness then corresponds to different dynamical properties. For instance, positive density corresponds to positive entropy for actions of amenable group [27, 32, 35], infinite sets corresponds to untameness [32, 35], and arbitrary large finite sets corresponds to nonnullness [32]. The correspondence between positive density and positive entropy also holds for actions of sofic groups [34, 35], though the density is defined using the sofic approximation sequence instead.
A natural question is whether positive naive entropy can be studied using combinatorial independence. Indeed a notion of density was introduced for tuples of subsets for actions of any group in [34, Definition 3.1], and the corresponding type of tuples of points in was also introduced in [34, Definition 3.2]. However, in general it is impossible to localize positive density from tuples of subsets to a tuple of points (see Proposition 5.2). The novelty in this paper is that we shall stay at the level of tuples of subsets and consider finite families of tuples of subsets instead of a single tuple (see Definition 2.2). It turns out that this characterizes positive naive entropy (Theorem 2.5), and we can use it to obtain some interesting properties of actions with positive naive entropy.
The action is said to be Li-Yorke chaotic [6, 39] if there is an uncountable set such that for any distinct , one has
[TABLE]
where is any given compatible metric on . Using measure-dynamical techniques Blanchard et al. showed first that positive entropy implies Li-Yorke chaos for continuous maps [6]. This was extended to actions of amenable groups [32, Corollary 3.19] and sofic groups [34, Corollary 8.4] using combinatorial independence. Here using independence density for finite families of tuples of subsets we extend this implication to actions of all groups.
Theorem 1.1**.**
For any countably infinite group , any continuous action of on a compact metrizable space with positive naive entropy is Li-Yorke chaotic.
For sofic groups, in fact Theorem 1.1 is stronger than [34, Corollary 8.4] since there are actions with zero sofic entropy but positive naive entropy (see the discussion at the end of Section 5).
For any -invariant Borel probability measure on , Bowen introduced the naive entropy [7, Definition 7] [8, Definition 2.2] of the measure-preserving action by
[TABLE]
where ranges over finite Borel partitions of and ranges over nonempty finite subsets of . Here for a finite Borel partition of , denotes the Shannon entropy . It is easy to check that when is amenable, coincides with the classical Kolmogorov-Sinai entropy [11, Theorem 4.2] [35, page 198]. When is nonamenable, is either [math] or [7, Theorem 2.13]. Burton showed that one always has [8, Theorem 1.3].
The action is called distal [2] if for any distinct one has , where is any given compatible metric on . Parry showed first that distal actions of have zero entropy [41]. Since distal actions cannot be Li-Yorke chaotic, it was observed in [34, Corollary 8.5] that distal actions of sofic groups have sofic entropy either or [math]. Via reduction to actions of , Burton [8, Example 2.2] showed that if contains an element with infinite order, then any distal action of has zero naive entropy. From Theorem 1.1 and the above paragraph we conclude that this holds for all groups, which answers a question of Bowen [7, Question 8].
Corollary 1.2**.**
For any countably infinite group , any distal continuous action of on a compact metrizable space has zero naive topological entropy. If is a -invariant Borel probability measure on , then the action also has zero naive entropy.
The notion of tame actions was introduced by Köhler [36] motivated by Rosenthal’s characterization of Banach spaces containing [44], and is well studied [1, 9, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 30, 32, 35, 38, 43]. Denote by the space of all continuous -valued functions on equipped with the supremum norm. The action is said to be untame if there are some and some infinite subset of such that the map for extends to a linear Banach space isomorphism from to the closed linear span of for in . Tameness can also be characterised in terms of the Ellis semigroup of . Using combinatorial independence it was shown that positive entropy actions are untame for amenable groups [32] and sofic groups [34]. Here we extend it to all groups in the context of naive entropy.
Theorem 1.3**.**
For any countably infinite group , tame continuous actions on compact metrizable spaces have zero naive entropy.
This paper is organized as follows. We introduce the independence density for finite families of subsets in Section 2, and show that positive independence density characterizes positive naive entropy. Theorems 1.1 and 1.3 are proved in Sections 3 and 4 respectively. In Section 5 we exhibit an action with positive naive entropy but no non-diagonal orbit IE-pairs. This example shows that in general one cannot localize positive density from tuples of subsets to a tuple of points.
Throughout this article, will be a countably infinite discrete group with identity element , and we fix a continuous action of on a compact metrizable space . For any set we denote by the set of nonempty finite subsets of . For each we write for .
Acknowledgments. H. L. is partially supported by NSF and NSFC grants. We are grateful to Lewis Bowen for comments.
2. Independence Density for Families of Tuples
In this section we introduce the independence density for finite families of subsets and prove Theorem 2.5.
For each , denote by the space of all -tuples of subsets of . Set , and .
Recall the notion of independence sets introduced in [32, Definition 2.1] (see also [35, Definition 8.7]).
Definition 2.1**.**
For any , we say is an independence set for if for any nonempty finite set and any map one has .
Definition 2.2**.**
For any finite , we define the independence density of to be the largest such that for every there are some with and some so that is an independence set for .
When consists of a single tuple, Definition 2.2 reduces to [34, Definition 3.1].
We say that is pairwise disjoint (closed resp.) if the sets are pairwise disjoint (closed resp.). We say that is pairwise disjoint (closed resp.) if each is pairwise disjoint (closed resp.).
For covers and of , we denote by the cover of consisting of for and . We say that is finer than if every item of is contained in some item of . The following lemma is well known, see for example the proofs of [4, Proposition 1] or [35, Lemma 12.11].
Lemma 2.3**.**
For any finite open cover of , there are and two-element open covers of such that is finer than .
Let and let be a nonempty finite set. Let be the cover of consisting of subsets of the form , where for each . For a set we write for the minimal number of sets in needed to cover . The following is the major combinatorial fact we need [32, Lemma 3.3] [35, Lemma 12.13].
Lemma 2.4**.**
Let and . There exists depending only on and such that for any finite set and with there is a with and .
The following theorem characterizes positive naive entropy in terms of finite pairwise disjoint closed families with positive independence density.
Theorem 2.5**.**
The following are equivalent:
- (1)
, 2. (2)
there is a finite pairwise disjoint closed with positive independence density, 3. (3)
there is a finite pairwise disjoint closed with positive independence density.
Proof.
(1)(2). Suppose that . Then for some finite open cover of . By Lemma 2.3 we can find two-element open covers of such that is finer than . We may assume that none of contains . For each , write as and set . Then is finite pairwise disjoint and closed. We claim that has positive independence density. Set . Then we have the constant in Lemma 2.4 depending only on and . Let . Then
[TABLE]
Thus there is some with . Consider the map defined by
[TABLE]
Then . Therefore there is some with and . Then is an independence set for . Thus has independence density at least .
(2)(3) is trivial.
(3)(1). Let be finite pairwise disjoint closed with independence density . For each , write as and set and . Then are finite open covers of . Set . We claim that . Let . Then there are some with and some such that is an independence set for . We have
[TABLE]
and hence
[TABLE]
Therefore . ∎
Let . We say that is a simple splitting of if there are some with and some and such that
[TABLE]
We say that is a splitting of if there are such that is a simple splitting of for all . Clearly splittings of pairwise disjoint families are still pairwise disjoint.
We need the following lemma [32, Lemma 3.7] [35, Lemma 12.16], which is a consequence of Karpovsky and Milman’s generalization of the Sauer-Perles-Shelah lemma [31, 45, 47].
Lemma 2.6**.**
Let . Then there is some depending only on such that for any , any simple splitting of , and any finite independence set for , there is an such that and is an independence set for at least one of and .
From Lemma 2.6 we see that for any finite with positive independence density, every simple splitting of has positive independence density. Via induction we get
Proposition 2.7**.**
Let be finite with positive independence density. Then every splitting of has positive independence density.
3. Positive Independence Density and Li-Yorke Chaos
In this section we prove Theorem 3.4, which shows that positive independence density implies Li-Yorke chaos.
Notation 3.1**.**
Let . For , we write for the tuple in consisting of for all in any order.
For , we say that is -separated if the sets for are pairwise disjoint. The following lemma is an analogue of [34, Lemma 8.2].
Lemma 3.2**.**
Let be finite with positive independence density. Let . Then there is some finite with positive independence density such that each element of is of the form for some and some -separated with .
Proof.
Denote by the independence density of . Take a -separated with .
Let . Take a maximal -separated subset of . Then , and hence
[TABLE]
Note that . By assumption we can find a with and some such that is an independence set for . For each , set . Since for is a partition of , we have
[TABLE]
Denote by the maximum of for ranging over distinct elements of . Then for each there is some with such that the sets for are pairwise disjoint. Thus
[TABLE]
and hence . Then we can find distinct with
[TABLE]
Note that , and . Thus is an independence set for . Therefore the set consisting of for and distinct has independence density at least . ∎
From Lemma 3.2 via induction on we have
Lemma 3.3**.**
Let be finite with positive independence density. Let and . Then there is some finite with positive independence density such that each element of is of the form for some and some -separated with .
Fix a compatible metric on . For , we set
[TABLE]
For finite , we set
[TABLE]
For any , clearly every finite closed has a closed splitting with diameter at most .
For , we set . For and , we set . The following is an analogue of [32, Theorem 3.18] and [34, Theorem 8.1].
Theorem 3.4**.**
Let be finite pairwise disjoint closed with positive independence density. Then there are some and a Cantor set contained in the union of the entries of such that for any finite set and any map one has
[TABLE]
Proof.
Take an increasing sequence of finite subsets of with union . We shall construct, via induction on , finite with the following properties:
- (1)
, 2. (2)
for every , there are maps and such that for every one has and each entry of contains exactly two entries of , 3. (3)
when , for every defining by for all and , we have , 4. (4)
when , for every , writing and , for any map , there is some
[TABLE]
such that for all , where , 5. (5)
for every , is pairwise disjoint and closed, 6. (6)
for every , has positive independence density.
Suppose that we have constructed such over all . Removing the elements of with some empty entry, we may assume that the entries of the elements of each are all nonempty. Since each is nonempty and finite, the inverse limit space for the maps is nonempty. Thus we can find for each such that for all . For any , set . Then for each , and each entry of contains exactly two entries of by (2), and by (3). Denote by the union of the entries of , and set . Then is a Cantor set. Since , by (2) the entries of are contained in the entries of . Thus is contained in the union of the entries of .
Let be finite, and let be a map . Let and . Take such that distinct elements of lie in distinct entries of , , and . Write and . Then there is some map such that for any , if then . Set and . Then and . By (4) there is some such that for all . For every , say for some , one has and hence
[TABLE]
Since , we have . Therefore
[TABLE]
We now construct the . We set . By assumption (5) and (6) are satisfied for . Assume that we have constructed with the above properties. Take such that for all . By Lemma 3.3 we can find a finite with positive independence density such that each element of is of the form for some and some -separated with . Let and write it as as above. Write as . Fix distinct , and take an injection . For all and , take such that , and for all , and set
[TABLE]
Then is pairwise disjoint and closed, and every independence set for is an independence set for . The family clearly satisfies the conditions (5) and (6). Setting and , the property (2) is verified. For any map , we have for all and . Since is -separated and , we have
[TABLE]
Thus the property (4) also holds. Replacing each by a suitable closed splitting of , we also make (3) hold. This finishes the induction step. ∎
Now Theorem 1.1 follows from Theorems 2.5 and 3.4.
4. Positive Independence Density and Tameness
It was shown in [34, Theorem 7.1] that if has positive independence density then has an infinite independence set. With a minor modification, the proof also works for finite families in :
Theorem 4.1**.**
Let be finite with positive independence density. Then at least one element of has an infinite independence set.
The action is untame exactly when there is a pairwise disjoint closed with an infinite independence set [35, Proposition 8.14]. Then Theorem 1.3 follows from Theorems 2.5 and 4.1.
5. An Action with Positive Naive Entropy but no non-diagonal Orbit IE-pairs
For , recall that is called an orbit IE-tuple (or orbit IE-pair when ) if for any product neighborhood of in , the tuple has positive independence density [34, Definition 3.2]. When is amenable, this is the same as IE-tuples defined in [32, Definition 3.1].
When is amenable, has positive entropy exactly when has non-diagonal IE-pairs [32, Proposition 3.9] [35, Theorem 12.19]. When is sofic and is a sofic approximation sequence for , has positive sofic entropy with respect to exactly when has non-diagonal -IE-pairs [34, Proposition 4.16] [35, Theorem 12.39]. For general , if has non-diagonal orbit IE-pairs, then from Theorem 2.5 we know that has positive naive entropy. We shall show in Proposition 5.2 that the converse fails.
Denote by the integral group ring of [42, page 3] [35, Section 13.1]. It consists of all functions with finite support. Writing as , the addition and multiplication of are defined by
[TABLE]
It also has an involution defined by
[TABLE]
For any countable left -module , its Pontryagin dual consisting of all group homomorphisms under pointwise multiplication and convergence is a compact metrizable abelian group, and acts on naturally by continuous automorphisms with for all , and . We refer the reader to [35, 40, 46] for general information on the study of .
When , we may identify with , and the induced -action on is the left shift action given by for all and .
For any submodule of , the restriction map yields a factor map (i.e. a continuous surjective -equivariant map) . For , we have the -module and denote by . One may identify with the closed -invariant subgroup of consisting of satisfying [37, page 311], where the convolution product is defined similar to (1).
Lemma 5.1**.**
Let with infinite order. Then has no non-diagonal orbit IE-pairs.
Proof.
Note that consists of exactly those satisfying for all . Let and be distinct points in . Then for some . Take open neighborhoods and of and in respectively such that . Denote by ( resp.) the set of with ( resp.). Then and are neighborhoods of and in respectively. For any distinct , if and for some , then and , which is impossible. Thus for any , if is an independence set for contained in , then . Therefore has independence density [math], whence is not an orbit IE-pair of . ∎
Now let be the rank free group with generators and .
Proposition 5.2**.**
There is an action of on a compact metrizable abelian group by continuous automorphisms such that has positive naive entropy while has no non-diagonal orbit IE-pairs. Furthermore, there is a finite pairwise disjoint closed with positive independence density such that no element of has positive independence density.
Proof.
We shall show that satisfies the conditions. From Lemma 5.1 we know that has no non-diagonal orbit IE-pairs.
Note that has a free left -submodule with generators and [42, Corollary 10.3.7.(iv)], and hence contains a -submodule isomorphic to . Therefore the action has a factor . As naive entropy does not increase under taking factors, we conclude that has positive naive entropy.
To prove the last assertion of the proposition, assume conversely that every finite pairwise disjoint closed with positive independence density has an element with positive independence density. Take a compatible metric on . Since has positive naive entropy, by Theorem 2.5 there is some finite pairwise disjoint closed with positive independence density. By the assumption there is some with positive independence density. Inductively, assume that we have found some closed with positive independence density. Take a finite closed splitting of such that . By Proposition 2.7 we know that has positive independence density. Then by assumption we can find some with positive independence density. In this way we obtain a sequence of closed elements in such that each has positive independence density and as . Writing , we may assume that for all and . Then for each , the intersection is a singleton . As , we have . Then is a non-diagonal orbit IE-pair, which is a contradiction. This proves the last assertion of the proposition. ∎
When is amenable, the independence density for each is a limit [35, page 287] and hence every finite with positive independence density has an element with positive independence density. Proposition 5.2 shows that this fails for .
From [34, Propositions 4.6 and 4.16] we know that when is sofic, if has positive sofic entropy with respect to some sofic approximation sequence of , then has a non-diagonal orbit IE-pair. Now let be an action in Proposition 5.2. As is sofic, has no non-diagonal orbit IE-pairs, and has a fixed point, we conclude that has sofic entropy zero with respect to every sofic approximation sequence of . Thus results of [34] do not tell us that is Li-Yorke chaotic or untame. On the other hand, since has positive naive entropy, Theorems 1.1 and 1.3 imply that is Li-Yorke chaotic and untame.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. -B. Aujogue. Ellis enveloping semigroup for almost canonical model sets of an Euclidean space. Algebr. Geom. Topol. 15 (2015), no. 4, 2195–2237.
- 2[2] J. Auslander. Minimal Flows and their Extensions . North-Holland Mathematics Studies, 153. Notas de Matemática [Mathematical Notes], 122. North-Holland Publishing Co., Amsterdam, 1988.
- 3[3] F. Blanchard. Fully positive topological entropy and topological mixing. In: Symbolic Dynamics and its Applications (New Haven, CT, 1991) , 95–105, Contemp. Math., 135, Amer. Math. Soc., Providence, RI, 1992.
- 4[4] F. Blanchard. A disjointness theorem involving topological entropy. Bull. Soc. Math. France 121 (1993), no. 4, 465–478.
- 5[5] F. Blanchard, E. Glasner, and B. Host. A variation on the variational principle and applications to entropy pairs. Ergodic Theory Dynam. Systems 17 (1997), no. 1, 29–43.
- 6[6] F. Blanchard, E. Glasner, S. Kolyada, and A. Maass. On Li-Yorke pairs. J. Reine Angew. Math. 547 (2002), 51–68.
- 7[7] L. Bowen. Examples in the entropy theory of countable group actions. Ergodic Theory Dynam. Systems to appear. ar Xiv:1704.06349 v 3.
- 8[8] P. Burton. Naive entropy of dynamical systems. Israel J. Math. 219 (2017), no. 2, 637–659.
