This paper explores properties of null dynamical systems, demonstrating conditions under which they are equicontinuous or mean equicontinuous, and constructs examples with specific proximal relations.
Contribution
It establishes new links between nullness, distalness, and equicontinuity, and constructs examples illustrating these properties in dynamical systems.
Findings
01
Null and distal systems are equicontinuous.
02
Null systems with closed proximal relations are mean equicontinuous.
03
Constructed examples with specific proximal relations.
Abstract
In this paper, it is shown that if a dynamical system is null and distal, then it is equicontinuous. It turns out that a null system with closed proximal relation is mean equicontinuous. As a direct application, it follows that a null dynamical system with dense minimal points is also mean equicontinuous. Meanwhile, a distal system with trivial Indfip-pairs, and a non-trivial regionally proximal relation of order ∞ is constructed.
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.
Taxonomy
TopicsMathematical Dynamics and Fractals · Advanced Differential Equations and Dynamical Systems · Geometric and Algebraic Topology
Full text
Null systems in the non-minimal case
Jiahao Qiu
Wu Wen-Tsun Key Laboratory of Mathematics, USTC, Chinese Academy of Sciences and
School of Mathematics, University of Science and Technology of China,
Hefei, Anhui, 230026, P.R. China
Wu Wen-Tsun Key Laboratory of Mathematics, USTC, Chinese Academy of Sciences and
School of Mathematics, University of Science and Technology of China,
Hefei, Anhui, 230026, P.R. China
In this paper, it is shown that if a dynamical system is null and distal, then it is equicontinuous.
It turns out that a null system with closed proximal relation is mean equicontinuous.
As a direct application, it follows that a null dynamical system with dense minimal points is also mean equicontinuous.
Meanwhile, a distal system with trivial Indfip-pairs, and a non-trivial
regionally proximal relation of order ∞ is constructed.
Key words and phrases:
Null systems, mean equicontinuity, regionally proximal relation of order d
2010 Mathematics Subject Classification:
54H20, 37A25
1. Introduction
Let X be a compact metric space with a metric d, and let T be a continuous
map from X to itself.
The pair (X,T) will be called a (topological) dynamical system.
Entropy and related notions are the measurements of the complexity of a dynamical system.
Recall that a dynamical system (X,T) is null if the topological sequence entropy
is zero for any sequence. For a measurable dynamical system, the nullness is defined similarly.
Kushnirenko [20] has shown that a measure-preserving
transformation T has a discrete spectrum if and only if it is null.
Unfortunately, in the topological setting, there is no such theorem, since Goodman [13] obtained a minimal non-equicontinuous system which is null.
Under the minimality assumption, Huang, Li, Shao and Ye in [15]
showed that a minimal null system looks like a minimal equicontinuous system. Precisely, if (X,T) is a minimal null system,
π:X→Xeq is the factor map to the maximal equicontinuous factor,
then (X,T) is uniquely ergodic, π is almost 1-1 and is a measure-theoretic isomorphism. One purpose of the paper is
to show what a null system would be without the assumption of minimality.
Localizing the notion of sequence entropy, the authors in [15] defined the notion of sequence entropy pairs and
showed that for a minimal distal system the set of sequence entropy
pairs coincides with the regionally proximal relation, and thus a minimal distal null system is equicontinuous. In this paper, we will show the result remains valid without the minimality assumption, i.e.
a distal null system is equicontinuous (Theorem 3.2). In fact we can show more, i.e. a distal, non-equicontinuous system
has infinite sequence entropy (Theorem 3.4) which extends the previous result proved under the minimality assumption [15].
We remark that the methods that we use to show the above two results are different from the ones in [15].
In [22] the notion of mean equicontinuity was introduced, which is equivalent to the notion of stable in the mean in the sense of Lyapunov
given by Fomin in [6].
A dynamical system (X,T) is called mean equicontinuous if for every ε>0,
there exists a δ>0 such that whenever x,y∈X with d(x,y)<δ,
[TABLE]
It was known that a minimal mean equicontinuous system is uniquely ergodic. The authors in [22] proved that
if (X,T) is a minimal mean equicontinuous system and π:X→Xeq is the factor map to the maximal equicontinuous factor,
then π is a measure-theoretic isomorphism (it is not necessarily almost 1-1, see [5]).
We refer to [8, 9, 10, 11, 16] for further study
on mean equicontinuity and related subjects. Just recently, the authors of the current paper in [23] showed
that many results (related to mean equicontinuity) proved before
under the minimality assumption hold for general systems.
In this paper, we will show that a null dynamical system
with a closed proximal relation is mean equicontinuous (Theorem 4.3). A direct consequence is that
a null dynamical system with dense minimal points is mean equicontinuous. Note that it is easy to construct a null
dynamical system which is not mean equicontinuous. It is natural to ask if a null transitive system is mean equicontinuous.
Unfortunately, we can not answer the question in the current paper.
To get an analogue result proved before in ergodic theory, in [14] the notion of regionally proximal
relation of order d (denoted by RP[d]) was introduced by Host, Kra and Maass.
We refer to [12, 24] for the further study on the topic.
In [4], Dong, Donoso, Maass, Shao and Ye studied the properties of Indfip-pair.
They showed that
if (X,T) is a minimal distal system and (x,y)∈RP[∞]=∩d≥1RP[d],
then (x,y)∈Indfip(X,T).
Since our Theorem 3.2 can be restated as: if (X,T) is distal, RP[1] is non-trivial, then Indf(X,T) is not trivial.
It is natural to conjecture that the result proved in [4] is valid without the minimality assumption. It is surprising for us that
it is not the case. That is, we construct a distal system such that RP[∞] is not trivial,
but Indfip(X,T) is trivial (Example 5.1).
The paper is organized as follows.
In Section 2, we gather definitions and prove some initial theorems on the thickly syndetic
sets of Z+l.
We show that a distal null system is equicontinuous in Section 3.
Moreover, it turns out that a distal but not equicontinuous system
has infinite sequence entropy.
In Section 4, we prove that
a null system with closed proximal relation is mean equicontinuous and give some applications.
In the final section, we construct
a distal system with trivial Indfip-pairs, and a non-trivial
regionally proximal relation of order ∞.
Acknowledgments.
The authors would like to thank Professor X. Ye and Dr. L. Xu for helping discussions and remarks.
We also thank Jian Li, Jie Li and T. Yu for useful suggestions.
The authors were supported by NNSF of China (11431012).
2. Preliminaries
In this section we recall some notions and aspects of the theories of topological dynamical systems.
2.1. Cubes in Z+l
Denote by Z+ (N, Z, respectively)
the set of all non-negative integers (positive integers, integers, respectively).
For l∈N,
a cube in Z+l is defined by
[TABLE]
for some m∈N.
A subset
S(l)={s(k)=(n1(k),n2(k),…,nl(k)):k=1,2,…}
of Z+l
is syndetic if there is a cube
Pm(l),
such that for each element
(a1,a2,…,al)∈Z+l,
there is (p1,p2,…,pl)∈Pm(l) with
(a1+p1,a2+p2,…,al+pl)∈S(l).
We say that m is a gap of S(l).
Note that when l=1 we recover the classical definition of syndetic set in Z+.
A subset T(l)={nˉ(k)=(n1(k),n2(k),…,nl(k)):k=1,2,…}
of Z+l is thickly syndetic if for every cube
Pn(l),
there is a syndetic set Sn(l)={sˉn(k):k=1,2,…}
such that
[TABLE]
Let Ftsl be the set of all thickly syndetic sets in Z+l.
2.2. Compact metric spaces
Let (X,d) be a compact metric space.
For x∈X and ε>0, denote B(x,ε)={y∈X:d(x,y)<ε}.
Denote by the product space X×X={(x,y):x,y∈X} and the diagonal ΔX={(x,x):x∈X}.
Let U⊂X, denote the diameter of the set U by diam(U)=sup{d(x,y):x,y∈U}.
2.3. Topological dynamics
Let (X,T) be a dynamical system.
The orbit of a point x∈X, {x,Tx,T2x,…,}, is denoted by Orb(x,T).
The set of limit points
of the orbit Orb(x,T) is called the ω-limit set of x, and is denoted by ω(x,T).
If A is a non-empty closed subset of X and TA⊂A, then (A,T∣A) is called a subsystem of (X,T),
where T∣A is the restriction of T on A. If there is no ambiguity, we will use the notation T instead of T∣A.
We say that a point x∈X is recurrent if x∈ω(x,T).
The system (X,T) is called (topologically) transitive if ω(x,T)=X for some x∈X, and
such a point x is called a transitive point.
The system (X,T) is said to be minimal if every point of X is a transitive point.
A subset Y of X is called minimal if (Y,T) forms a minimal subsystem of (X,T).
A point x∈X is called minimal if it is contained in a minimal set Y or,
equivalently, if the subsystem (Orb(x,T),T) is minimal.
For x∈X and A⊂X, let N(x,A)={n∈Z+:Tnx∈A}.
If U is a neighborhood of x, then the set N(x,U) is called the set of return times of the point x
to the neighborhood U.
The following result is well-known, see [7] for example.
Lemma 2.1**.**
Let (X,T) be a dynamical system and x∈X.
Then x is minimal if and only if N(x,U) is syndetic for every neighborhood U of x.
A pair of points (x,y)∈X×X is said to be proximal
if for any ε>0, there exists a positive integer n such that d(Tnx,Tny)<ε.
Let P(X,T) denote the collection of all proximal pairs in (X,T).
The system (X,T) is called distal if the proximal relation is trivial
i.e., P(X,T)=ΔX.
The following proposition summarizes some basic properties of distal system:
The Cartesian product of a finite family of distal systems is a distal system.
2. (2)
If (X,T) is a distal system and Y is a closed and invariant subset of X,
then (Y,T) is a distal system.
Recall that a pair of points (x,y) is called regionally proximal
if for every ε>0, there exist two points x′,y′∈X
with d(x,x′)<ε and d(y,y′)<ε, and a positive integer n such that d(Tnx′,Tny′)<ε.
Let Q(X,T) be the set of all regionally proximal pairs in (X,T).
Clearly, we have P(X,T)⊂Q(X,T).
When (X,T) and (Y,S) are two dynamical systems and π:X→Y is a continuous onto map which
intertwines the actions (i.e., π∘T=S∘π),
one says that (Y,S) is a factor of (X,T) or (X,T) is an extension of (Y,S),
and π is a factor map.
If π is a homeomorphism, then we say that π is a conjugacy and
that the dynamical systems (X,T) and (Y,S) are conjugate.
If π:(X,T)→(Y,S) is a factor map, then Rπ={(x,x′)∈X×X:π(x)=π(x′)}
is closed T×T-invariant equivalence relation, that is Rπ is a closed subset of X×X and
if (x,x′)∈Rπ, then (Tx,Tx′)∈Rπ.
Conversely, if R is a closed T×T-invariant equivalence relation on X,
then the quotient space X/R is a compact metric space
and T naturally induces an action on X/R by TR([x])=[Tx].
Then (X/R,TR) forms a dynamical system and the quotient map πR:X→X/R is a factor map.
Hence there is a one-to-one correspondence between factors and closed invariant equivalence relations,
we will use them interchangeably.
2.4. Invariant measures
Let (X,T) be a dynamical system and M(X,T) be the set of T-invariant regular Borel probability measures on X.
An invariant measure is ergodic if and only if it is an extreme point of M(X,T).
Denote by Me(X,T) the set of all ergodic measure.
For μ∈M(X,T). We define the support of μ by
supp(μ)={x∈X:μ(U)>0for any neighborhood U of x}.
The support of a dynamical system (X,T), denoted by supp(X,T),
is the smallest closed subset C of X such that μ(C)=1 for all μ∈M(X,T).
Let (X,T) be a dynamical system.
We call (X,T) an E-system if it is transitive and there exists μ∈M(X,T) such that supp(μ)=X.
We say that (X,T) is uniquely ergodic if M(X,T) consists of a single measure.
2.5. Topological sequence entropy
Let A={0≤t1<t2<⋯}⊆Z+
be an increasing sequence of natural numbers and U
be a finite cover of X. The topological sequence entropy
of U with respect to (X,T) along A is
defined by
[TABLE]
where N(⋁i=1nT−tiU)
is the minimal cardinality among all cardinalities of sub-covers of ⋁i=1nT−tiU.
The topological sequence entropy of (X,T) along A is
[TABLE]
where supremum is taken over all finite open covers of X (that is, made up of open sets).
If A=N we recover standard topological entropy.
In this case we omit the superscript N.
2.6. Sequence entropy n-tuple
Given a dynamical system (X,T) and an integer n≥2, the n-th product system is the dynamical system
(X(n),T(n)), where X(n) is the cartesian product of X with itself n
times and T(n) represents the simultaneous action T in each coordinate of X(n).
The diagonal of X(n) is denoted by Δn(X)={(x,…,x)∈X(n):x∈X}.
Let (xi)i=1n∈X(n). A finite cover U={U1,…,Uk} of X
is said to be *admissible cover * with respect to (xi)i=1n if for each
1≤j≤k there exists 1≤ij≤n such that xij is not contained in the
closure of Uj.
Definition 2.3**.**
Let (X,T) be a dynamical system. An n-tuple (xi)i=1n∈X(n),n≥2, is called
a sequence entropy n-tuple if for some 1≤i,j≤n,xi=xj,
for any admissible open cover U with respect to (xi)i=1n
there exists an increasing sequence of natural numbers A
such that htopA(T,U)>0.
We denote by SEn(X,T) the set of sequence entropy n-tuples.
Denote by SEne(X,T) the set of essential sequence entropy n-tuples,
which means (x1,…,xn)∈SEn(X,T) with xi=xj,1≤i<j≤n.
Sequence entropy 2-tuples are called sequence entropy pairs.
Denote by SE(X,T) the set of all sequence entropy pairs.
Remark 2.4**.**
By the definition, it follows that
if (x1,…,xn)∈SEn(X,T),
then we have (xi1,…,xik)∈SEk(X,T)∪Δk(X)
for any 1≤i1<⋯<ik≤n,k≥2.
We have the following proposition:
Proposition 2.5**.**
[17, Proposition 3.2]**
Let (X,T) be a dynamical system.
(1)
If U={U1,…,Uk} is an open cover of X with htopA(T,U)>0
for some increasing sequence of natural numbers A, then for all 1≤i≤n
there exists xi∈Uic such that (xi)i=1n is a sequence entropy n-tuple.
2. (2)
SEn(X,T)∪Δn(X)* is a closed T(n)-invariant subset of X(n).*
3. (3)
Let π:(Y,S)⟶(X,T) be a factor map of dynamical system.
(a)
If (xi)i=1n∈SEn(X,T), then for all 1≤i≤n
there exists yi∈Y such that π(yi)=xi and (yi)i=1n∈SEn(Y,S).
Moreover, if SEne(X,T)=∅, then we have SEne(Y,S)=∅.
2. (b)
If (yi)i=1n∈SEn(Y,S) and (π(yi))i=1n∈/Δn(X),
then (π(yi))i=1n∈SEn(X,T).
Proposition 2.6**.**
[19, Theorem 5.9]**
Let (X,T) be a dynamical system and (xi)i=1n∈X(n)
with xi=xj,i=j.
If for any neighborhoods Ui of xi (i=1,…,n) respectively,
and any k∈N there is a sequence
A={0≤t1<t2<⋯<tk} of Z+
such that for any s=(s(1),…,s(k))∈{1,…,n}k,
[TABLE]
then (xi)i=1n∈SEn(X,T).
Remark 2.7**.**
By this proposition, we know that a system (X,T) is null if and only if SE(X,T)=∅.
2.7. Independence and RP[d](X)
Let (X,T) be a dynamical system and A=(A1,…,Ak) be
a tuple of subsets of X. A subset F⊂Z+ is an independence set for A if for any nonempty finite subset
J⊂F and any s=(s(j):j∈J)∈{1,2,…,k}∣J∣ we have ∩j∈JT−jAs(j)=∅.
For a finite subset {p1,…,pm} of N, the finite IP-set generated by {p1,⋯,pm}
is the set {ϵ1p1+⋯+ϵmpm:ϵi∈{0,1},1≤i≤m}\{0}.
A pair of points (x,y)∈X×X is an
Indfip-pair if and only if each A=(A1,A2), with A1 and A2
neighborhoods of x and y respectively, contains finite IP-independence sets
of length m for any m∈N.
A pair (x,y)∈X×X is said to be regionally proximal of order d if for any δ>0,
there exist x′,y′∈X and a vector n=(n1,…,nd)∈Z+d such that
d(x,x′)<δ, d(y,y′)<δ, and
d(Tn⋅ϵx′,Tn⋅ϵy′)<δ for any
ϵ=(ϵ1,…,ϵd)∈{0,1}d\{0},
where n⋅ϵ=∑i=1dϵini.
The set of regionally proximal pairs of order d is denoted by RP[d](X).
In [14] the authors showed that if the system is minimal and distal then RP[d](X) is an equivalence relation and
(X/RP[d](X),T) is the maximal d-step nilfactor of the system.
2.8. Ftsl is a filter
We recall some notions related to a family. Denote by Pl=Pl(Z+l) the collection of all subsets of Z+l.
A subset Fl of Pl is called a family, if it is hereditary upward, i.e.,
F1⊂F2 and F1∈Fl imply F2∈Fl.
A family Fl is called proper if it is a non-empty proper subset of Pl,
i.e., neither empty nor all of Pl.
A proper family Fl is called a filter if F1,F2∈Fl implies
F1∩F2∈Fl.
Recall that Ftsl the set of all thickly syndetic sets in Z+l.
Then we have the following theorem.
Proposition 2.8**.**
For l∈N, if F1,F2∈Ftsl, then we have F1∩F2∈Ftsl.
Proof.
For l∈N,
assume that F1,F2∈Ftsl.
Fix n∈N, as F1∈Ftsl,
there is a syndetic set Sn(l)={sˉn(k):k=1,2,…}
with
[TABLE]
Let m∈N be a gap of Sn(l).
Put d=m+n.
Again, as F2∈Ftsl,
there is a syndetic set Sd(l)={sˉd(k):k=1,2,…}
with
[TABLE]
For every k∈N,
there is a mk∈Pm(l) with sˉd(k)+mk∈Sn(l),
hence sˉd(k)+mk+Pn(l)⊂F1.
Thus
[TABLE]
Clearly, {sˉd(k)+mk}k=1∞ is syndetic
which implies F1∩F2∈Ftsl.
∎
By induction, we can easily obtain the following corollary.
Corollary 2.9**.**
For l,n∈N, if F1,F2,…,Fn∈Ftsl,
then ∩i=1nFi∈Ftsl.
3. Systems with sequence entropy n-tuples
In this section we will give the conditions under which a dynamical system has
a sequence entropy n-tuple.
Lemma 3.1**.**
Let X be a dynamical system with fixed points xi,i=1,2,…,n,n≥2.
If for any neighbourhood Wi of xi,i=1,2,⋯,n, there exists a minimal point y
such that for every i=1,2,⋯,n there is mi∈Z+ with Tmiy∈Wi,
then
(x1,x2,…,xn)∈SEne(X,T).
Proof.
Let Ui be a neighbourhood of xi,i=1,2,⋯,n.
There is a δ>0 with B(xi,δ)⊂Ui,i=1,2,…,n.
For a given N∈N, by the uniform continuity, there is a δ′>0 such that
d(Tju,Tjv)<δ for every 1≤j≤N and u,v∈X with d(u,v)<δ′.
We can choose a minimal point y∈X and mi∈Z+ such that
d(xi,Tmiy)<2δ′ for all i=1,2,…,n.
Put Vi=B(xi,δ′),
then N(y,Vi) is not empty,
i=1,2,…,n.
For l∈N and s∈{1,2,…,n}l, let
V(s)=∏i=1lVs(i) and U(s)=∏i=1lUs(i). Then
[TABLE]
is syndetic since y is a minimal point.
For every nˉ=(n1,n2,…,nl)∈As(l), pˉ=(p1,p2,…,pl)∈PN(l)
and i=1,2,…,l,
we have Tniy∈Vs(i).
It follows that d(Tniy,xs(i))<δ′
which implies d(Tni+piy,xs(i))<δ for every 0≤pi≤N. Thus,
Pick (n1,n2,…,nl)∈∩s∈{1,…,n}lBs(l).
Without loss of generality, assume n1<n2<⋯<nl. Then,
[TABLE]
for any s∈{1,2,…,n}l, which implies (x1,x2,…,xn)∈SEn(X,T)
by Proposition 2.6.
∎
Theorem 3.2**.**
Let (X,T) be a distal and null system, then it is equicontinuous.
Proof.
Assume that (X,T) is not equicontinuous,
then there is (x,y)∈Q(X,T)∖ΔX,
with xk,yk,z∈X and nk∈Z+,k=1,2,⋯
such that
[TABLE]
As (X,T) is distal, T is invertible and (X×X,T×T) is pointwise minimal
by Proposition 2.2.
Without loss of generality, we may assume that T−nkz→w,
then ((x,y),(w,w))∈Q(X×X,T×T) since
[TABLE]
Put x=(x,y),w=(w,w),xk=(xk,yk),z=(z,z),X=X×X
and T=T×T.
Let
[TABLE]
It is easy to see that R is
a T×T-invariant closed equivalence relation.
Let Y=X/R (i.e. we collapse Orb(x,T) to a point, and collapse Orb(w,T) to a point),
then [x],[w] are fixed points in Y.
It is easy to see limk→∞d([xk],[x])=0
and limk→∞d(Tnk[xk],[z])=0
since [w]=[z].
By Lemma 3.1, it follows that ([x],[z])∈SE(Y,T)
which implies SE(X,T)=∅.
We can choose ((c1,c2),(d1,d2))∈SE(X,T)
with c1=d1 by Proposition 2.5.
Now consider the projection π1 from X×X to the first coordinate,
again by Proposition 2.5, we have (c1,d1)∈SE(X,T).
It is a contradiction which shows the theorem.
∎
By the proof above, we can show more. That is,
if (X,T) is distal but not equicontinuous, then for every n≥2,SEne(X,T)=∅.
Before showing the statement, we need the following lemma.
Lemma 3.3**.**
Let (X,T) be a distal dynamical system with fixed points x1,x2.
If there exist points yk∈X and nk∈Z+,k=1,2,⋯ such that
[TABLE]
then for every n≥2,
SEne(X,T)=∅.
Proof.
As (X,T) is distal, yk,k=1,2,⋯ are minimal.
By Lemma 3.1, it is clear for n=2.
Let U1 and U2 be neighbourhoods of x1 and x2 respectively with U1∩U2=∅.
Claim 1**.**
Let U1′=U1∩T−1U1 and U2′=U2∩T−1U2.
There is a K∈Z+
such that
for every k≥K, we can choose lk∈Z+
with Tlkyk∈/U1′∪U2′.
Proof of the Claim.
Clearly, U1′ and U2′ are
still neighbourhoods of x1 and x2 respectively since x1 and x2 are fixed points.
As limk→∞d(yk,x1)=0, there is a K∈Z+
such that yk∈U1′ for all k≥K.
Fix k≥K,
put lk=min{n∈Z+:Tn+1yk∈U2′},
then we have Tlkyk∈/U1′.
Indeed, if Tlkyk∈U1′, we have Tlkyk,Tlk+1yk∈U1.
By the definition of lk,
it follows that Tlk+1yk∈U2′⊆U2,
it is a contradiction.
Thus Tlkyk∈/U1′∪U2′.
∎
By considering the limit points of {Tlkyk}k=K∞,
we may assume that Tlkyk→x3 as k→∞. Then, it is clear that
x3=x1,x2.
Let R1={(u,v)∈X×X:u,v∈Orb(x3,T)}∪ΔX
and it is
a T×T-invariant closed equivalence relation.
Put X1=X,X2=X1/R1, then we have x1,x2,x3
(instead of [x1],[x2],[x3])
are fixed points of X2 and limk→∞d(Tlkyk,x3)=0.
As yk is minimal in X1, so is in X2.
Again by Lemma 3.1, we have (x1,x2,x3)∈SE3(X2,T)
which implies SE3(X,T)=SE3(X1,T)=∅,
by Proposition 2.5.
Moreover, we have SE3e(X,T)=∅ since x3=x1,x2..
Now assume that x1,x2,…,xm are fixed points of Xm−1
and yk∈Xm−1,nk(1),nk(2),…,nk(m)∈Z+,nk(1)=0,k∈N
with limk→∞d(xi,Tnk(i)yk)=0,i=1,2,…,m.
Choose neighborhoods U1,U2,…,Um of x1,x2,…,xm respectively with
Ui∩Uj=∅ for 1≤i=j≤m.
Claim 2**.**
Let Ui′=Ui∩T−1Ui,i=1,2,…,m.
There is a K∈Z+
such that
for every k≥K, we can choose mk∈Z+
with Tmkyk∈/∪i=1mUi′.
Proof.
It is similar to the proof of Claim 1.
∎
By considering the limit points of {Tmkyk}k=K∞,
we may assume that Tmkyk→xm+1 as k→∞. It is clear that
xm+1=xi,i=1,2,…,m.
Let Rm−1={(u,v)∈Xm−1×Xm−1:u,v∈Orb(xm+1,T)}∪ΔXm−1.
Then it is a T×T-invariant closed equivalence relation.
Put Xm=Xm−1/Rm−1, then we have x1,x2,…,xm+1
(instead of [x1],[x2],…,[xm+1])
are fixed points of Xm and limk→∞d(Tmkyk,xm+1)=0.
Moreover, we have yk is minimal in Xm.
By Lemma 3.1, we have (x1,x2,…,xm+1)∈SEm+1(Xm,T)
and so SEm+1e(X,T)=∅ by repeatedly applying Proposition 2.5.
Thus the proof is finished by induction.
∎
Now we are ready to show our statement.
Theorem 3.4**.**
Let (X,T) be a distal but not equicontinuous system,
then for every n≥2,SEne(X,T)=∅.
Consequently, the sequence entropy of (X,T) is ∞
by the result in [18].
Proof.
Assume that
(x,y)∈Q(X,T)\ΔX
with xk,yk,z∈X and nk∈Z+,k=1,2,…
such that
[TABLE]
As (X,T) is distal,
it follows that for every k∈N,(xk,yk) is minimal in X×X
and Orb((x,y),T×T)∩ΔX=∅. By collapsing Orb((x,y),T×T) and ΔX
to points respectively, we obtain a factor (Y,S) of (X×X,T×T) which satisfies the
condition (1). This implies SEne(Y,S)=∅ for every n≥2.
Moreover, SEne(X×X,T×T)=∅ for every n≥2.
For every z∈X,
let Iz={ui:1≤i≤n2,ui=z}.
Clearly, there exists 1≤m≤n2,zj∈X,j=1,…,m
such that Izj=∅.
If m≥n, let uij∈Izj for some 1≤ij≤n2,
then ((uij,vij))j=1n∈SEne(X×X,T×T)
by Remark 2.4.
Now consider the projection π1 from X×X to the first coordinate,
it follows that (uij)j=1n∈SEne(X,T) by Proposition 2.5.
If m<n, there exists 1≤i0≤m with l=∣Izi0∣≥mn2>n.
Suppose that uij=zi0,j=1,…,l,
then ((uij,vij))j=1n∈SEne(X×X,T×T).
Now consider the projection π2 from X×X to the second coordinate,
it follows that (vij)j=1n∈SEne(X,T) by the Proposition 2.5.
Thus we complete the proof.
∎
4. Null systems and mean equicontinuity
In this section we will discuss in which case a null dynamical system is mean equicontinuous.
We start with the following characterizations of mean equicontinuous systems.
Before showing our theorem, we need the following lemmas.
Lemma 4.1**.**
[2, Corollary 1]**
If (X,T) is a dynamical system and P(X,T) is closed in X×X, then it is a
T×T-invariant closed equivalence relation.
Lemma 4.2**.**
[15, Theorem 3.1]**
If (X,T)
is a transitive not minimal E-system,
then we have SE(X,T)=∅.
Now we are ready to show
Theorem 4.3**.**
Let (X,T) be a null system.
Then the following conditions are equivalent:
(1)
P(X,T)* is closed;*
2. (2)
P(X,T)=Q(X,T);**
3. (3)
(X,T)* is mean equicontinuious.*
Proof.
By [22, Theorem 3.5] we know that (3) implies (2). It is clear that (2) implies (1). It remains to show (1) ⇒ (3).
Since P(X,T) is closed in X×X, P(X,T) is a
T×T-invariant closed equivalence relation by Lemma 4.1.
Let Y=X/P(X,T) and π:X→Y be the factor map,
then Y is the maximal distal factor.
As (X,T) is a null system, so is (Y,T) by Proposition 2.5.
Moreover, (Y,T) is equicontinuious by Theorem 3.2.
Assume the contrary (X,T) is not mean equicontinuous, then there are points
xk,yk,z∈X, positive integers nk∈N,k=1,2,⋯ and ε0>0
such that limk→∞xk=z=limk→∞yk,
and for every k∈N, we have:
[TABLE]
Let μk=nk1∑i=0nk−1δ(Tixk,Tiyk).
We may assume μk→μ as k→∞
(otherwise consider the subsequence),
where μ∈M(X×X,T×T).
We claim that μ(supp(μ)∖ΔX)>0.
Actually, d(⋅,⋅) is a continuous function on X×X, then we have when k→∞,
[TABLE]
and
[TABLE]
which implies
[TABLE]
By ergodic decomposition, we have ν(supp(μ)∖ΔX)>0
for some ergodic measure ν on X×X.
Case 1:supp(ν) is not minimal.
It follows that supp(ν)
is an E-system which is not minimal, then SE(supp(ν),T×T)=∅
by Lemma 4.2,
which implies SE(X,T)=∅.
Case 2:supp(ν) is minimal.
Assume that supp(ν)=Orb((u,v),T×T),
where (u,v)∈/ΔX.
For l∈N,
let Bl={(x,y)∈X×X:d((x,y),(u,v))<l1},
then μ(Bl)>0. Since 0<μ(Bl)≤liminfk→∞μk(Bl)
and
[TABLE]
thus there is kl,il∈N with 0≤il≤nkl−1 such that
(Tilxkl,Tilykl)∈Bl. Hence we have
[TABLE]
Let (Z,S) be the maximal equicontinuous factor of (X,T)
and π:(X,T)→(Z,S) be the factor map.
Then Rπ={(x,y)∈X×X:π(x)=π(y)}⊂P(X,T).
Fix ε>0.
As π is continuous, there is δ1>0 such that d(π(a),π(b))<3ε
whenever a,b∈Z with d(a,b)<δ1.
As (Z,S) is equicontinuous, there is δ2>0 such that d(Sna,Snb)<min{3ε,δ1}
for every n∈N
whenever a,b∈Z with d(a,b)<δ2.
Put δ=min{δ1,δ2}.
Now choose l∈N such that d(xkl,ykl)<δ2 and
d(u,Tilxkl)<δ1,d(v,Tilykl)<δ1.
Then
[TABLE]
[TABLE]
which implies π(u)=π(v).
Moreover (u,v)∈P(X,T),
Orb((u,v),T×T)∩ΔX=∅. It is a contradiction.
Thus (X,T) is mean equicontinuous.
∎
Theorem 4.4**.**
For a null system (X,T), if it has dense minimal points, then it is mean equicontinuous.
Proof.
It is sufficient to show that Q(X,T)=P(X,T) by Theorem 4.3.
If there is a pair (x,y)∈Q(X,T)∖P(X,T),
by the definition of Q(X,T), there are
xk,yk,z∈X and nk∈N,k=1,2,…
such that
[TABLE]
As the minimal points for T are dense in X,
so are for T×T in X×X (see [1]).Without loss of generality, we can assume that (xk,yk) is minimal
in X×X for every k∈N.
Put x=(x,y),xk=(xk,yk),z=(z,z) and X=X×X,T=T×T.
Since (x,y)∈/P(X,T), we have Orb(x,T)∩Orb(z,T)=∅.
Let
[TABLE]
It is easy to see that R is a closed T×T-invariant
equivalence relation on X.
Let Y=X/R, it follows that [x],[z] are
fixed points in Y and
limk→∞[xk]=[z],limk→∞Tnk[xk]=[x].
As xk is minimal in X, so is [xk] in Y.
By Lemma 3.1, we have ([x],[z])∈SE(X,T),
which implies SE(X,T)=∅ by Proposition 2.5.
It is a contradiction which shows Q(X,T)=P(X,T).
∎
Corollary 4.5**.**
Let (X,T) be a null system.
If supp(X,T)=X, then it is mean equicontinuous.
Clearly, (supp(ν),T) is minimal since a transitive and non-minimal E-system is not null [15, Theorem 3.1].
Thus the minimal points for T in X are dense
which implies (X,T) is mean equicontinuous
by Theorem 4.4.
∎
5. A counterexample
In the last part of this paper, we give the example which is mentioned in the introduction. That is,
Example 5.1**.**
There is a distal system (X,T) (consisting of periodic orbits)
such that RP[∞](X,T)=ΔX
and Indfip(X,T)=∅.
Let A∈[0,1]×[−1,1], denote the horizontal ordinate and vertical ordinate by xA and yA respectively.
We define a relation ∼ on [0,1]×[−1,1] by
(x,1)∼(x,−1) for x∈[0,1].
Clearly, it is an equivalence relation.
Assume A(x1,y1),B(x2,y2)∈[0,1]×[−1,1]/∼,
let
[TABLE]
it is easy to check that ρ is a metric on [0,1]×[−1,1]/∼.
We begin to construct (X,T) in [0,1]×[−1,1]/∼.
Step 1: Basic periodic systems.
First,
we construct basic periodic systems (Ii,Ti). Put
For every i, put Ai=(0,1),Bi=(0,0),Ci=(1,0),Di=(1,−1),
and from the construction, it is easy to see that
Ti2i+1Bi=Ci,Ti2iAi=Bi.
Step 2: Construction of (X,T).
To get the properties, we need glue all the basic periodic systems constructed above.
For compactness, it is necessary to compress them first.
Precisely, for every i,
squeeze Ii horizontally such that
the distance from Bi to Ci is 2i(i+1)1,
and horizontally translate
Bi to Bi′(2i(i+1)2i+1,0)
and Ci to Ci′(i1,0)
which is denoted by Ii′.
The map Ti′ defined on Ii′ can be induced from Ti,
that is, Ti′ keeps the relative position.
Let X=⋃i=1∞Ii′ and T be the map
from X to itself such that
T∣Ii′=Ti′ and T∣{0}×[−1,1] is identity.
Put A=limi→∞Ai′(=limi→∞Di′)
, B=limi→∞Bi′(=limi→∞Ci′)
and I={0}×[−1,1]
where Ai′(2i(i+1)2i+1,1),Di′(i1,−1).
Claim 1: For each d≥1, we have
(A,B)∈RP[d](X,T), hence (A,B)∈RP[∞](X,T).
Proof.
Fix d≥1, for every ε>0, there is an i∈N with
ρ(Bi′,B)=ρ(Ai′,A)=2i(i+1)2i+1<ε
and (1+d)di<2i.
Put nˉ=(2i,…,2di)∈Z+d.
For each α∈{0,1}d\{0},
we have
2i≤nˉ⋅α≤(1+d)di<2i.
It follows the construction that
T2i+1Bi′=Ci′,T2iAi′=Bi′,
which implies
[TABLE]
Thus
[TABLE]
which means (A,B)∈RP[d](X,T),
hence (A,B)∈RP[∞](X,T).
∎
Remark 5.2**.**
Actually, by the similar argument, we can show that
for every C∈I with C=B, (C,B)∈RP[∞](X,T).
Claim 2:
Indfip(X,T)=∅.
Proof.
If there is a pair (C,D)∈Indfip(X,T), then C,D∈I.
Indeed, as Indfip(Ii′,T)=∅ for every i∈N,
we obtain that C,D cannot belong to the same Ii′.
Now if C belongs to Ik′ for some k∈N,
we can choose the neighborhoods U,V of C,D
respectively which are small enough such that
(⋃n∈NT−nU)∩(⋃n∈NT−nV)=∅.
Therefore (C,D)∈/Indfip(X,T),
contracting the assumption.
Without loss of generality,
assume that C=(0,c),D=(0,d) with 0≤d<c≤1.
Choose k∈N such that c>k2.
Let U1,U2 be C,D neighbourhoods respectively with
diam(U1)<min{41(c−d),2k(k+1)2k+1} and
ρ(U1,U2)>43(c−d).
As (C,D)∈Indfip(X,T),
there are n1,n2∈Z+ and P∈X
with
[TABLE]
Assume that P∈Ii′ and the period of P is mi.
As P∈U1 and diam(U1)<2k(k+1)2k+1,
we obtain xP<2k(k+1)2k+1
which implies i≥k and
[TABLE]
For j=1,2,
we have nj=kjmi+rj where kj∈Z+ and
0≤rj<mi with
[TABLE]
As 4c>diam(U1)≥d(C,P)>∣c−yP∣,
we obtain yP>43c>k1>2i1.
Similarly, we also have yTr2P>2i1.
It follows the definition of Ii
that the maximal distance of two adjacent points is 2i1,
that is, ρ(TQ,Q)≤2i1, for every Q∈Ii.
We have that ρ(Tr2P,P)+2i1≥ρ(Tr2+sP,TsP) for any s∈N.
Hence
[TABLE]
As ρ(U1,U2)>43(c−d),
it follows that Tn1+n2P∈/U2.
It is a contradiction which implies the claim.
∎
6. Some open questions
Some questions concerning null systems are open. Here we state two of them.
The first one appears in [15].
Question 6.1**.**
Is a null transitive system minimal?
We conjecture that Question 6.1 has a negative answer. A question we can not solve in this paper is:
Question 6.2**.**
Is a null transitive system mean equicontinuous?
Bibliography24
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] E. Akin and E. Glasner. Residual properties and almost equicontinuity. J. d’Anal.Math. 84 (2001), 243–286.
2[2] J. Auslander. On the proximal relation in topological dynamics. Proc of the Amer Math Soci. 11 (1960), 890–895.
3[3] J. Auslander. Minimal flows and their extensions. North-Holland Mathematics Studies. 153 . North-Holland, Amsterdam, (1988).
4[4] P. Dong, S. Donoso, A. Maass, S. Shao and X. Ye, Infinite-step nilsystems, independence and complexity , Ergod. Th. and Dynam. Sys., 33 (2013), 118-143.
5[5] T. Downarowicz and E. Glasner. Isomorphic extensions and applications. Topol Methods in Nonlinear Anal. 48 (2016), 321–338.
6[6] S. Fomin. On dynamical systems with a purely point spectrum. Dokl. Akad. Nauk SSSR. 77 (1951), 29–32 (In Russian).
7[7] H. Furstenberg. Recurrence in Ergodic Theory and Combinatorial Number Theory , Princeton Univ. Press, Princeton, NJ. (1981).
8[8] F. García-Ramos. A characterization of μ 𝜇 \mu -equicontinuity for topological dynamical systems, Proc. Amer. Math. Soc. 145 (2017), no. 8, 3357–3368.