Specification for group actions on Uniform spaces
Abdul Gaffar Khan1, Pramod Kumar Das2 and Tarun Das1
Abstract.
We extend specification and periodic specification to finitely generated group actions on uniform spaces using a concept of specification point. We prove that certain group actions having two distinct specification points have positive entropy. We further prove that if a group containing an infinite order element acts on an infinite Hausdorff uniform space and the action possesses periodic specification, then it is Devaney chaotic.
Key words and phrases:
Specification, Topological Entropy, Bowen Entropy, Uniform Spaces
🖂Tarun Das
[email protected]
Abdul Gaffar Khan
[email protected]
Pramod Kumar Das
[email protected]
*1**Department of Mathematics, Faculty of Mathematical Sciences, University of Delhi, Delhi, India.
* 2**School of Mathematical Sciences, Narsee Monjee Institute of Management Studies, Vile Parle, Mumbai-400056, India.
2010 Mathematics Subject Classification:
Primary 37B40 ; Secondary 37B20
1. Introduction
One of the most important and extensively studied variant of shadowing in discrete topological dynamics is known as specification. The motivation for this concept comes from the wish to trace simultaneously, finite number of finite pieces of orbits by one periodic orbit. Bowen proved [3] the usefulness of specification by studying the distribution of periodic points in the phase space. The periodicity of the tracing point made this notion to be popularly known as periodic specification among many other variants. The connection of this notion with the notion of chaos was established [11] much later than its introduction [3] by Bowen. One can see that most of the studies regarding this important variant of shadowing are on compact metric spaces. An interested reader can find a significant amount of literature in [1].
In recent years, a group of mathematicians from all over the world working to understand the validity of several important results for systems with non-compact, non-metrizable phase space. Such study gained desirable attention with the publication of [7] in which authors proved Walters’ stability theorem and a similar version of Smale’s spectral decomposition theorem for homeomorphisms on uniform spaces. In [5, 13, 14] authors studied periodic specification, weak specification and pseudo orbital specification for uniformly continuous maps on uniform spaces. At the same time, mathematicians started investigating shadowing, specification and their variants for group and semigroup actions on uniform spaces [4, 6, 10, 12].
One of the aim of this paper is to prove that periodic specification for certain group actions on infinite Hausdorff uniform space is Devaney chaotic. Another aim is to formulate the notion of Bowen entropy for finitely generated group actions on uniform spaces and then relate the positivity of entropy with the presence of specification.
In language of physics, entropy is a thermodynamical property which represents the amount of system’s thermal energy lacks to convert into mechanical work. Mathematically, it is a non-negative extended real number representing amount of information obtained by performing an experiment repeatedly. If entropy is positive, then the system is chaotic. On the other hand, a deterministic system does have zero entropy. The classification problem of dynamical systems motivated mathematicians to introduce [2] the notion of topological entropy for continuous surjective map on compact topological space similarly as the measure theoretic entropy [15] for measure preserving transformations of measure spaces. Bowen extended [15] this notion to uniformly continuous map on metric spaces. In [8], B. M. Hood showed that Bowen’s definition is already suited for uniform spaces.
2. Preliminaries
A uniform space is a pair (X,U), where X is a non-empty set and U is a collection of subsets of X×X satisfying the following properties.
- (1)
Every D∈U contains Δ(X).
2. (2)
If D∈U and E⊃D, then E∈U.
3. (3)
If D,D′∈U, then D∩D′∈U.
4. (4)
If D∈U, then D−1∈U.
5. (5)
For every D∈U there is a symmetric D′∈U such that D′∘D′⊂D.
Where Δ(X)={(x,x)∣x∈X}, D−1={(y,x)∣(x,y)∈D} and D′∘D′={(x,y)∈X×X∣ there is z∈X satisfying (x,z)∈D and (z,y)∈D′}.
If (X,U) is a uniform space, then we can generate a topology on X by characterizing that a subset Y⊂X is open if and only if for each x∈Y there is an entourage U∈U such that the cross section U[x]={y∈X∣(x,y)∈U}⊂Y. Thus, for any point x∈X and any neighbourhood G of x, one can find U∈U such that U[x]⊂G. The members of U are called entourages. An entourage D∈U is said to be symmetric if D=D−1. Observe that for any U∈U, the entourage U∩U−1 is symmetric and Un={(x,y)∣z0=x,z1,...,zn=y∈X such that (zi−1,zi)∈U for all i∈{1,2,...,n}}. The set of all symmetric entourages and the set of all open symmetric entourages are denoted by Us and U0 respectively. Two uniformities U and V on X are called uniformly equivalent if identity maps I1:(X,U)→(X,V) and I2:(X,V)→(X,U) are uniformly continuous.
A non-empty family of non-empty subsets of X is a filter base if the intersection of every pair of members of the family contains another member of the family. Observe that both Us and U0 are filter bases for the uniformity U. A directed set is a non-empty set D together with a reflexive and transitive binary relation ≤ such that for any x,y∈D there exists z∈D satisfying x≤z and y≤z. Observe that both Us and U0 are directed sets with reverse set inclusion as the binary relation. A net in X is a function f from a directed set D into X. Let A be a set and ≤ be a binary relation on A. Then, a subset B⊂A is said to be cofinal in A if for every a∈A, there is b∈B such that a≤b. It is easy to see that U0 is cofinal in Us.
Let (X,U) be a uniform space [9] and G be a finitely generated group. A map Φ:G×X→X is said to be a continuous action of G on X if the following conditions hold:
- (i)
For each g∈G, the map Φg=Φ(g,.) is a homeomorphism.
2. (ii)
Φe(x)=x for all x∈X, where e is the identity element of the group G.
3. (iii)
Φg1g2(x)=Φg1(Φg2(x)) for all x∈X and g1,g2∈G.
An action Φ is said to be uniformly continuous if for each g∈G, Φg is a uniform equivalence (Both Φg and Φg−1 are uniformly continuous). We denote the set of all uniformly continuous actions by Act(G,X). If Φ∈Act(G,X) and Ψ∈Act(G,Y), then the diagonal product Φ×Ψ∈Act(G,X×Y) is defined as (Φ×Ψ)g(x,y)=(Φg(x),Ψg(y)).
Let G1={gi∣1≤i≤m} be a finite symmetric generating set for G. We can write G=∪n≥0Gn, where G0={e} and for n≥2, g∈Gn if and only if g=gingin−1...gi1 with gij∈G1 for 1≤j≤n. So, Gn contains every element of length at most n with respect to the generating set G1. Note that if G is countably infinite, then Gk∖Gk−1=ϕ for all k∈N and if G is finite then there exists k∈N such that Gk∖Gk−1=ϕ but Gn+1∖Gn=ϕ for all n≥k.
Let dG be the word metric on G given by dG(h,g)= inf {n≥0∣h−1g∈Gn}. For A,B⊂G, define dG(A,B)= inf {dG(a,b)∣(a,b)∈A×B}. For convenience, we write dG(a,b) for dG({a},{b}). The Hausdorff distance between two subsets A and B of G is defined as dG(A,B)= max {supa∈AdG(a,B), supb∈BdG(A,b)}.
The set of all compact subsets of X is denoted by K(X). A subset W⊂X is said to be Φ-invariant if Φs(W)⊂W for all s∈G1. Action Φ is said to be transitive if for any pair of non-empty open sets U,V in X there exists g∈G such that Φg(U)∩V=ϕ.
Two actions Φ∈Act(G,X) and Ψ∈Act(G,Y) are said to be uniformly conjugate if there is a uniform equivalence T:X→Y such that TΦg=ΨgT for all g∈G. A property of an action Φ preserved under uniform conjugacy is said to be a uniform dynamical property.
3. Entropy and Specification for Group Actions
Let n be a positive integer, U∈Us and Φ∈Act(G,X). We say that a subset E of X is (n,U)-separated with respect to Φ, if for each pair of distinct points x,y in E there exists g∈Gn such that (Φg(x),Φg(y))∈/U. A subset E of X is (n,U)-spanning set for another subset F of X with respect to Φ if for each x∈F there exists y∈E such that (Φg(x),Φg(y))∈U for all g∈Gn.
For K∈K(X), let sn(U,K,Φ) be the maximal cardinality of any (n,U)-separated set contained in K and rn(U,K,Φ) be the minimal cardinality of any (n,U)-spanning set for K. Define rΦ(U,K)=n→∞limsupn1logrn(U,K,Φ) and sΦ(U,K)=n→∞limsupn1logsn(U,K,Φ).
Lemma 3.1**.**
For Φ∈Act(G,X) and K∈K(X), the following statements are true.
- (1)
For U,V∈Us with V2⊂U, we have rn(U,K,Φ)≤sn(U,K,Φ)≤rn(V,K,Φ)≤sn(V,K,Φ).
2. (2)
For U⊂V, we have rΦ(U,K)≥rΦ(V,K) and sΦ(U,K)≥sΦ(V,K).
3. (3)
limU∈Us(rΦ(U,K))=limU∈Us(sΦ(U,K))=limU∈Uo(sΦ(U,K))=limU∈Uo(rΦ(U,K)).
Proof.
(1) Let K∈K(X) and K′ be the maximal (n,U)-separated subset of K. Then, K′ is (n,U)-spanning set for K. Indeed, if there exists x∈K∖K′ such that (Φg(x),Φg(y))∈/U for all y∈K′ and some g∈Gn, then x lies in a separated set for K and so in K′ due to maximality. Therefore, rn(U,K,Φ)≤sn(U,K,Φ). Now suppose that K′′ is minimal (n,V)-spanning set for K.
So for each x∈K there exists f(x)∈K′′ such that (Φg(x),Φg(f(x)))∈V for all g∈Gn. If f(x)=f(y), then (Φg(x),Φg(y))∈V2⊂U for all g∈Gn. Since K′ is (n,U)-separated, f must be injective on K′. Therefore, ∣K′′∣≥∣K′∣ and so rn(V,K,Φ)≥sn(U,K,Φ).
(2) Since this follows from the definition, it is left as an easy exercise.
(3) Since Φ is uniformly continuous, for V∈Uo there exists W∈Uo such that (x,y)∈W implies (Φg(x),Φg(y))∈V for all g∈Gn. Then, rn(V,K,Φ) is at most the number of W-neighbourhoods require to cover K, which is finite because K is compact. Therefore, rn(U,K,Φ) and sn(U,K,Φ) are also finite. Being filter bases for U, Us and Uo are directed sets, rΦ(U,K) and sΦ(U,K) are nets in non-negative reals. Further since Uo is cofinal in Us, they give us subnets and so by (2) we get the result.
∎
Definition 3.2**.**
For Φ∈Act(G,X) and K∈K(X), set h(G1,Φ,K,U)=lim{rΦ(U,K)∣U∈Us}=lim{sΦ(U,K)∣U∈Us}=lim{rΦ(U,K)∣U∈Uo}=lim{sΦ(U,K)∣U∈Uo} and h(G1,Φ,U)=sup{h(G1,Φ,K,U)∣K∈K(X)}. The number h(G1,Φ,U) is called the entropy of Φ with respect to U and generator G1 of G.
Remark 3.3**.**
Let Φ∈Act(G,X) and G1 be the generator of G. Then for each s∈G1, the entropy of Φs is less than or equal to the entropy of Φ with respect to the generator G1.
Theorem 3.4**.**
Let Φ∈Act(G,X). If U and V are uniformly equivalent uniformities, then h(G1,Φ,U)=h(G1,Φ,V).
Proof.
Let U∈Us, then there exists V∈Vs such that whenever (x,y)∈V, we have (x,y)∈U. Choose W∈Us such that whenever (x,y)∈W, we have (x,y)∈V. If K∈K(X), then rΦ(U,K)≤rΦ(V,K)≤rΦ(W,K). Then by the definition of entropy, we can conclude that h(G1,Φ,U)=h(G1,Φ,V).
∎
Theorem 3.5**.**
If Φ∈Act(G,X) and Ψ∈Act(G,Y) are uniformly conjugate, then h(G1,Φ,U)=h(G1,Ψ,V).
Proof.
Let f:(X,U)→(Y,V) be a uniform conjugacy. By uniform continuity of f, for every V∈V there exists U∈U such that if (x,y)∈U then (f(x),f(y))∈V. Let n∈N and A is (n,U)-spanning set for compact set K with respect to Φ.
Then f(K) is compact and f(A) is (n,V)-spanning for f(K) with respect to Ψ.
Since ∣f(A)∣=∣A∣, we have rn(V,f(K),Ψ)≤rn(U,K,Φ).
Therefore, h(G1,Ψ,f(K),V)≤h(G1,Φ,K,U).
Since there is one to one correspondence between compact subsets of X and Y, we have
h(G1,Ψ,V)= sup{h(G1,Ψ,K,V):K∈K(Y)} = sup{h(G1,Ψ,f(K),V):K∈K(X)}≤ sup{h(G1,Φ, K,U):K∈K(X)} =h(G1,Φ,U). Thus, h(G1,Ψ,V)≤h(G1,Φ,U).
Similarly, one can show that h(G1,Φ,U)≤h(G1,Ψ,V).
∎
Example 3.6**.**
Let X=R be with natural uniformity generated by the euclidean metric and Φ∈Act(G,X) an equicontinuous action. Then for every ϵ>0 there exists δϵ>0 such that d(x,y)<δϵ implies d(Φg(x),Φg(y))<ϵ for all g∈G. Let K∈K(X) and A be the maximal (n,ϵ)-separated subset of K. Therefore by equicontinuity, if x,y∈A then d(x,y)>δϵ. Thus, sn(K,ϵ)≤diam(K)/δϵ and so sΦ(ϵ,K)=0. Since ϵ was chosen arbitrary, we conclude that entropy of any equicontinuous action on X is zero.
Definition 3.7**.**
Let (X,U) be a uniform space and Φ∈Act(G,X). Then z is said to be a specification point of Φ
if for every U∈Us, there exists an integer c(Uz)>0 such that for any k∈N, any finite family (Λi)i=1k of subsets of G with dG(Λi,Λj)>c(Uz) for i=j and any collection of points (xi)i=1k with x1=z, there exists a tracing point x∈X such that (Φgi(x),Φgi(xi))∈U for all gi∈Λi, 1≤i≤k. If x is a periodic point then we say that z is a periodic specification point, where a point x is said to be periodic if its orbit under Φ is finite. We say that Φ has specification if each point z∈X is a specification point with a common specification integer c(Uz) and that Φ has periodic specification if each point z∈X is a periodic specification point with a common specification integer c(Uz).
Theorem 3.8**.**
Specification and specification point does not depend on the choice of generator.
Proof.
Let G1={gi:1≤i≤p} and H1={hi:1≤i≤q} be two generators of G. Then choose N∈N such that every element of G1 can be written in terms of elements of H1 with length at most N. Suppose that Φ has specification with respect to the generator G1. To show that Φ has specification with respect to the generator H1. Let U∈Us and c(U) be a specification integer for Φ with respect to G1. Let (Λi)i=1k be a finite family of subsets of G with d(G,H1)(Λi,Λj)>Nc(U) for i=j and (xi)i=1k be points in X. Then d(G,G1)(Λi,Λj)>c(U) for i=j and hence, there exists x∈X such that (Φgi(x),Φgi(xi))∈U for all gi∈Λi and 1≤i≤k. Thus, Φ has specification with respect to the generator H1. Similarly, one can prove that z is a specification point for Φ with respect to G1 implies that it is a specification point for Φ with respect to H1.
∎
Recall that, a continuous map h:X→X is said to have specification if for every U∈Us there exists an integer p(U)≥1 such that for each k≥1, any points x1,...,xk, and any sequence of positive integers n1,...,nk and p1,...,pk with pi≥p(U) there exists a point x in X such that (hj(x),hj(x1))∈U for all 0≤j≤n1 and (hj+n1+p1+...+ni−1+pi−1(x),hj(x1))∈U for every 0≤j≤ni and 2≤i≤k.
Theorem 3.9**.**
If Φ∈Act(G,X) has specification, then for each infinite order element g∈G, Φg has specification.
Proof.
Let U∈Us and c(U) is a specification integer for Φ. Choose k∈N, points {x1,...,xk} in X, positive integers n1,...,nk and p1,...,pk such that pi≥c(U)+1 for every pi with n0=p0=0. For an infinite order element g∈G, we construct a finite generating set G1 containing g. Clearly, Λi={gj:∑m=0i−1(pm+nm)≤j≤ni+∑m=0i−1(pm+nm)} is finite for each i=1,...,k. In fact, dG(Λi,Λj)>c(U) for i=j, as g has infinite order. Let xj∗=g−∑m=0j−1(xj) for 1≤j≤k. By the specification of Φ there exists x∈X such that (Φgi(x),Φgi(xi∗))∈U for all 1≤i≤k and gi∈Λi, which is same as saying that ((Φg)j(x),(Φg)j(x1))∈U for all 0≤j≤n1 and ((Φg)j+n1+p1+...+ni−1+pi−1(x),(Φg)j(x1))∈U for all 0≤j≤ni and 2≤i≤k. Therefore, Φg has specification.
∎
Theorem 3.10**.**
Two actions Φ∈Act(G,(X,U)) and Ψ∈Act(G,(Y,V)) have specification (periodic specification) if and only if Φ×Ψ the diagonal action has specification (periodic specification).
Proof.
Let us denote the diagonal product of Φ and Ψ by φ, product uniformity W=U×V. Let W∈Ws. Set U={(x1,x2)∈X×X:(x1,y1,x2,y2)∈W for some y1,y2∈Y} and V={(y1,y2)∈Y×Y:(x1,y1,x2,y2)∈W for some x1,x2∈X}. Then U∈Us and V∈Vs. Let c(U) and c(V) be specification integers for Φ and Ψ respectively. Set c(UV)=max{c(U),c(V)}. Let {Λi}i=1k be a finite family of subsets of G with dG(Λi,Λj)>c(UV) for i=j, and {(xi,yi)}i=1k be points in X×Y. By specification of Φ and Ψ, we can choose x∈X and y∈Y such that (Φgi(x),Φgi(xi))∈U and (Ψgi(y),Ψgi(yi))∈V for all gi∈Λi and 1≤i≤k. Thus we have (φgi(x,y),φgi(xi,yi))∈W for all gi∈Λi and 1≤i≤k. Therefore, we conclude that φ has specification. Moreover, if the points x and y are periodic points for Φ and Ψ, then (x,y) is also a periodic point for φ. Thus, if Φ and Ψ have periodic specification then φ has periodic specification.
Conversely, suppose that φ has specification. Let U∈Us and V∈Vs then
W={(x,y,x′,y′)∈(X×Y)×(X×Y):(x,x′)∈U,(y,y′)∈V}∈Ws. Choose a specification integer c(W) for φ. Let {Λi}i=1k be a finite family of subsets of G with dG(Λi,Λj)>c(W) for i=j, {xi}i=1k, {yi}i=1k be points in X and Y respectively. By specification of φ there exists (x,y′)∈X×Y such that (φgi(x,y′),φgi(xi,yi))∈W for all gi∈Λi and 1≤i≤k. Thus, (Φgi(x),Φgi(xi))∈U for all gi∈Λi, 1≤i≤k. Therefore, we conclude that Φ has specification. Similarly, one can prove that Ψ has specification. Moreover if the point (x,y) is a periodic point for φ, then x and y are also periodic points for Φ and Ψ respectively. Therefore if φ has periodic specification, then both Φ and Ψ have periodic specification.
∎
Theorem 3.11**.**
Specification, periodic specification are uniform dynamical property.
Proof.
Let γ:Y→X be a uniform conjugacy between Φ∈Act(G,(X,U)) and Ψ∈Act(G,(Y,V)). So, γ is a uniform equivalence satisfying Φ∘γ=γ∘Ψ. Let U∈Us and Γ=γ×γ. By uniform continuity of Γ, there exists V∈Vs such that Γ(V)⊂U. Suppose that Ψ has specification and c(V) is a specification integer for Ψ. Let {Λi}i=1k be a finite family of subsets of G such that dG(Λi,Λj)>c(V) and {xi}i=1k be points in X. Since γ is bijection, there exists unique points {y1,...,yk} in Y such that γ(yi)=xi for 1≤i≤k. By specification of Ψ, there exists y∈Y such that (Ψgi(y),Ψgi(yi))∈V for all gi∈Λi, 1≤i≤k. If γ(y)=z, then (Ψgi(γ−1z),Ψgi(γ−1xi))=(γ−1Φgi(z),γ−1Φgi(xi))∈V. Therefore, (Φgi(z),Φgi(xi))∈U for all gi∈Λi, 1≤i≤k. Therefore, we conclude that Φ has specification. Converse follows similarly because γ is a uniform equivalence. Moreover if the point y is periodic for Ψ then z is also periodic for Φ. Therefore, if Ψ has periodic specification then Φ has periodic specification and vice versa.
∎
4. Specification implies Positive Entropy and Devaney Chaos
Recall that a continuous action is said to be Devaney chaotic if it is transitive, admits dense set of periodic points and has sensitive dependence on initial condition. In this section, our first aim is to prove that on infinite Hausdorff uniform space certain group actions having periodic specification is Devaney chaotic. Using similar steps as in the proof of Theorem 2 [4], one can prove that any transitive action admitting dense set of periodic points on infinite Hausdorff uniform space is sensitive. Therefore, it is sufficient to show that such group actions are transitive and has dense set of periodic points.
Recall that an action is said to have strong mixing property if for any pair of non-empty open sets U and V in X, cardinality of the set G(U,V)={g∈G : ΦgU∩V=ϕ} is finite.
Theorem 4.1**.**
Let G be an infinite order group and Φ∈Act(G,X). If Φ has specification, then Φ is strongly mixing and hence, transitive.
Proof.
Let V and W be non-empty open subsets of X with v∈V and w∈W.
Choose U∈Us such that U[v]⊂V and U[w]⊂W. Choose a specification integer c(U) for Φ, h=g−1 for some g∈G∖Gc(U)+1, Λ1={e} and Λ2=G∖Gc(U)+1. Set x1=v and x2=Φh(w). By specification of Φ there exists x∈X such that (Φgi(x),Φgi(xi))∈U for all gi∈Λi, 1≤i≤2. Thus, x∈V and Φh−1(x)∈W. Since g was chosen arbitrary, we get that ΦgV∩W=ϕ for all g∈G∖Gc(U)+1 and hence, Φ is strongly mixing.
∎
Theorem 4.2**.**
If G contains an element of infinite order and Φ∈Act(G,X) has periodic specification, then it has dense set of periodic points.
Proof.
Consider a finite symmetric generating set G1 containing an infinite order element s. Let x∈X, V be a neighbourhood of x. Let U∈Us be such that U[x]⊂V. Choose a specification integer c(U) for Φ. Consider {Λi=sc(U)(i−1)}i=1k and {xi}i=1k with x1=x. By periodic specification there exists a periodic point x′∈X such that (Φgi(x′),Φgi(xi))∈U for all gi∈Λi, 1≤i≤k. In particular, (x′,x)∈U. Since U is symmetric, we have x′∈V. Hence, every open set in X contains a periodic point which means the set of all periodic points of Φ is dense in X.
∎
Corollary 4.3**.**
Let G be a group containing an element of infinite order and X be an infinite Hausdorff uniform space. If Φ∈Act(G,X) has periodic specification, then it is Devaney chaotic.
Proposition 4.4**.**
Positivity of entropy of an action Φ∈Act(G,X) is independent of choice of generator.
Proof.
Let G1={gi∣1≤i≤p} and H1={hi∣1≤i≤q} be two generators. Set G=∪n≥0Gn, where G0={e} and G=∪n≥0Hn, where H0={e}.
For U∈Us, snG1(U,K,Φ) and snH1(U,K,Φ) denotes the maximal cardinality of (n,U)-separated subset of any K∈K(X), with respect to the generators G1 and H1 respectively. Then we can choose m1∈N such that G1⊂Hm1 and thus we have Gn⊂Hnm1 for all n∈N. It is easy to check that, for K∈K(X) and U∈Us, we have snm1H1(U,K,Φ)≥snG1(U,K,Φ). Hence n→∞limsupn1logsnH1(U,K,Φ)≥n→∞limsupnm11logsnm1H1(U,K,Φ)≥m11n→∞limsupn1logsnG1(U,K,Φ), implies m1sΦH1(U,K)≥sΦG1(U,K). Therefore, m1h(H1,Φ,K, U)≥h(G1,Φ,K,U) for all U∈Us and K∈K(X) and hence, m1h(H1,Φ,U)≥h(G1,Φ,U). Similarly, we can choose m2∈N such that m2h(G1,Φ,U)≥h(H1,Φ,U). Hence if entropy is positive with respect to G1 then it is positive with respect to H1 and conversely.
∎
Theorem 4.5**.**
Let (X,U) be a Hausdorff uniform space. If G contains an element of infinite order and Φ∈Act(G,X) has two distinct specification points then entropy of Φ is positive.
Proof.
Consider a finite symmetric generating set G1 containing an infinite order element s. Let x,y∈X be two distinct specification points, U∈Us such that (x,y)∈/U2 and set M=c(U)=max{c(Ux),c(Uy)}. Choose two (n+1)-tuples (z1,...,zn+1) and (z1′,...,zn+1′) with z1=x, z1′=y, zi,zi′∈{x,y} for all 2≤i≤(n+1) and Λi={sc(U)(i−1)} for all 1≤i≤(n+1). Choose z,z′∈X due to the specification at x and y respectively. First observe that z=z′.
If z=z′ then (Φgi(z),Φgi(zi))∈U and (Φgi(z),Φgi(zi′))∈U for all gi∈Λi and all 1≤i≤(n+1). For i=1 we get that (z,z1)∈U and (z,z1′)∈U implies (x,y)∈U2 which is a contradiction. Consider two (n+2)-tuples (z1,...,zn+1,zn+2) and (z1′,...,zn+1′,zn+2′) with z1=z1′∈{x,y}, zi,zi′∈{x,y} for all 2≤i≤(n+1), zn+2=Φs−(c(U)(n+1))(x), zn+2′=Φs−(c(U)(n+1))(y) and Λi={sc(U)(i−1)} for all 1≤i≤(n+2). Using the similar arguments, we can choose distinct tracing points for these tuples. Therefore, for (n+1)-tuples we can choose a distinct tracing points due to specification at x and y. Thus there are atleast 2n , (nM,U)-separated points. Therefore, h(G1,Φ,U)=sup{h(G1,Φ,K,U):K∈K(X)}≥lim{sΦ(U,K):U∈Us}=lim{n→∞limsupn1logsn(U,K,Φ):U∈Us}≥n→∞limsupn1logsn(U,K,Φ)≥n→∞limsupnM1logsnM(U,K,Φ)≥n→∞limsupnM1log2n=Mlog2>0, which completes the proof.
∎
Corollary 4.6**.**
Let G be a group containing an element of infinite order and X be a Hausdorff uniform space containing more than one point. If Φ∈Act(G,X) has specification, then the entropy of Φ is positive.
Example 4.7**.**
Let G be any finite group of cardinality C and X be arbitrary uniform space. If Φ∈Act(G,X), then Φ has specification. Now assume X={xn}n=1∞, where xn=∑i=1n(i1) with uniformity inherited from Euclidean metric. So it is a discrete uniformity. Let Dx be an entourage such that Dx[x]={x}. Let Φ be the trivial action. Then Φ has specification but does not have transitivity. Note that any compact subset K is a set having finitely many elements. Thus we have sn(U,K,ϕ)≤card(K) for every n∈N which implies sΦ(U,K)=0 for every U and K∈K(X). Hence, Φ has zero entropy. Therefore theorem 4.1 and Corollary 4.6 do not hold for finite groups.
Example 4.8**.**
Let G=Z2 with basis {e1=(1,0),e2=(0,1),e3=(−1,0),e4=(0,−1)} and X=R with uniformity generated by the Euclidean metric. Define Φ∈Act(G,X) by Φe1(x)=x+2 and Φe2(x)=x−2.
Since Φ is not transitive, by Theorem 4.1 Φ does not have specification.
Example 4.9**.**
Let G=Z2 with generator {e1=(1,0),e2=(0,1),e3=(−1,0),e4=(0,−1)} and X={xn}n=1∞, where xn=∑i=1n(i1). Suppose that X has the discrete uniformity generated by the Euclidean metric. Let Dx be an entourage such that Dx[x]={x}. Let Φ be the trivial action. One can easily check that entropy of Φ is zero, Φ is not transitive and hence, does not have specification.
Example 4.10**.**
Let G=Z2 with generator {e1=(1,0),e2=(0,1),e3=(−1,0),e4=(0,−1)} and X=R with uniformity generated by euclidean metric. Define Φ∈Act(G,X) by Φe1(x)=2x and Φe2(x)=(1/2)x. Since Φe(x) has entropy equal to log2 [13], by Remark 3.3 we get that Φ has entropy atleast log2. Since Φ is not transitive, by Theorem 4.1 Φ does not have specification. Hence, converse of Corollary 4.6 is not true.
Example 4.11**.**
Let Φ∈Act(Z,X) be an action generated by homeomorphism f on X i.e. Φn(x)=fn(x).
It is easy to see that Definition 3.7 implies the classical definition of specification for homeomorphism. Following example proves that the converse is not true.
Let Xi={0,1} be equipped with the discrete metric for all i∈Z. Let X=∏i∈ZXi be equipped with the metric D(x,y)=∑i∈Z2∣i∣d(xi,yi).
Let f be a left shift map on X i.e f(xn)=xn+1, where x=(xn)n∈Z. Clearly, f has specification [11]. We claim that Φ does not have specification. Let δ=21.
If d(x,y)<δ then (x)i=(y)i for all −1≤i≤1 and if d(x,y)<2δ then (x)0=(y)0. For each j∈N, set Λ1j={1,1+1,...,1+(j+1)} and Λ2j={1+(j+1),1+(j+2),...,1+(j+1)+(j+1)}. For generating set S={1,−1}, it is easy to see that dG(Λ1j,Λ2j)=j+1>j for all j∈N.
For each j∈N, choose x1j,x2j such that (x1j)1+(j+1)=(x2j)1+(j+1). On contrary, choose an integer c(δ)=k>0 by specification of Φ.
Choose x∈X be tracing point by specification property corresponding to {Λik}i=12 and {xik}i=12. Then d(f1+(k+1)(x),f1+(k+1)(x1k))<δ and d(f1+(k+1)(x),f1+(k+1)(x2k))<δ, which implies d(f1+(k+1)(x1k),f1+(k+1)(x2k))<2δ=1. This holds only when (x1k)1+(k+1)=(x2k)1+(k+1), which is a contradiction. Hence Φ does not have the specification property.
Acknowledgements: First author is supported by CSIR-Junior Research Fellowship (File No.-09/045(1558)/2018-EMR-I) of Government of India.