This paper investigates the shadowing property for free group actions on the circle, establishing conditions under which the property holds or fails based on the nature of the minimal set.
Contribution
It proves that free group actions on the circle lack shadowing if the minimal set isn't a Cantor set and constructs an example where it does, depending on the minimal set.
Findings
01
Shadowing property fails if minimal set is not a Cantor set.
02
An example with a Cantor minimal set exhibits the shadowing property.
03
Provides criteria linking minimal set structure to shadowing in group actions.
Abstract
For the free group F2 acting in S1, we will prove that if the minimal set for the action is not a Cantor set, then the action does not have the shadowing property. We will also construct an example, whose minimal set is a Cantor set, that it has the shadowing property.
Equations46
d(f(xn),xn+1)<δ,∀n∈Z.
d(f(xn),xn+1)<δ,∀n∈Z.
d(Φs(xg),xsg)<δ,∀g∈G\mboxand∀s∈S.
d(Φs(xg),xsg)<δ,∀g∈G\mboxand∀s∈S.
d(xg,Φg(y))<ε,∀g∈G.
d(xg,Φg(y))<ε,∀g∈G.
d(\Phi_{g^{n}}(x),\Phi_{g^{n}}(y))<\alpha,\ \forall n\in\mbox{$Z\!\!\!Z$}\mbox{ then }x=y.
d(\Phi_{g^{n}}(x),\Phi_{g^{n}}(y))<\alpha,\ \forall n\in\mbox{$Z\!\!\!Z$}\mbox{ then }x=y.
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
TopicsGeometric and Algebraic Topology · Mathematical Dynamics and Fractals · Advanced Operator Algebra Research
Full text
Shadowing Property for the free group acting in the circle
For the free group F2 acting in S1, we will prove that if the minimal set for the action is not a Cantor set, then the action does not have the shadowing property.
We will also construct an example, whose minimal set is a Cantor set, that it has the shadowing property.
Key words and phrases:
Group acting,shadowing, minimality.
1991 Mathematics Subject Classification:
Primary: 37B05; Secondary: 37C85 (37C50 37D20).
Jorge Iglesias∗ and Aldo Portela∗
Universidad de La República. Facultad de Ingenieria. IMERL
Julio Herrera y Reissig 565. C.P. 11300
Montevideo, Uruguay
(Communicated by )
1. Introduction.
The concepts of pseudo-orbits and shadowing property for homeomorphisms were widely investigated by many authors.
Many results are known that link expansivity and hyperbolicity, with the shadowing property. In [P] it is find a survey of the most important results. In [OT] this concept was generalized for finitely generated groups acting in a metric space X. In the said article, conditions are given that imply that an action does not have the shadowing property and examples with the shadowing property are constructed. It is also conjectured that the action of a free group of finitely generators, on a manifold M, can not have the shadowing property.
When the manifold is S1, the minimal sets are classified, being all S1, a finite set or a Cantor set. The objective of this paper is to show that when the minimal set is all S1 or a finite set, the action can not have shadowing. We will construct an example (whose minimal set is a Cantor set) that has the shadowing property; proving that what was conjectured is false.
1.1. Basic definition.
Given a group G and a set X, a dynamical system is formally define as a triplet (G,X,Φ), where Φ:G×X→X is a continuous function with Φ(g1,Φ(g2,x))=Φ(g1g2,x) for all g1,g2∈G and for all x∈X. The map Φ is called an action of G on X. Without loss of generality it is possible to associate each element of G to a homeomorphism Φg:X→X.
For every x∈X we define the orbit of x as O(x)={Φg(x):g∈G}.
A group G is finitely generated if there exists a finite set S⊂G such that for any g∈G there exist s1,...,sn∈S with g=s1.⋯.sn.
The set S is called finite generator of G. If S is a finite generator of G and for all s∈S we have that s−1∈S, then the set S is called a finite symmetric generator.
For usual dynamical systems, this is when the group is ZZ and the action is Φ(x,n)=fn(x), we say that a sequence {xn} is
δ-pseudotrajectory if
[TABLE]
It is possible to generalize this concept to a dynamical system (G,X,Φ), as follows:
A G-sequence in X is a function F:G→X. We denote this function by {xg} where F(g)=xg.
Let S be a finite symmetric generator of G. For δ>0 we say that a G-sequence {xg} is a δ-pseudotrajectory
if
[TABLE]
Given a dynamical system (G,X,Φ), Φ has the shadowing
property if for any ε>0 there exists δ>0 such that
for any δ-pseudotrajectory {xg} there exists a point y∈X with
[TABLE]
A finite symmetric generator S of G is uniformly continuous if for every ε> 0 there exists
δ>0 such that d(x,y)<δ implies d(Φs(x),Φs(y))<ε for every s∈S.
In [OT, Proposition 1] it its proved that the shadowing property does not depend on the finite symmetric generator S when is uniformly continuous.
Given a dynamical systems (G,X,Φ), we say that a map Φg is expansive if there exists α>0 such that if
Let (G,X,Φ) be a dynamical system where G be a finitely generated free group with at least two generators,
Φ is uniformly continuous and X is a non-discrete
metric space.
(1)
If for some g∈G the map Φg is expansive, then Φ does not have
shadowing.
2. (2)
If for some g∈G, g=e, the map Φg does not have shadowing, then Φ
does not have shadowing either.
We say that a point N∈X is an expansive point for g∈G if there exists α>0 such that for any δ>0 if 0<d(y,N)<δ, then there exists n\in\mbox{Z!!!Z} such d(Φgn(y),Φgn(N))>α. The number α is called expansivity constant.
In this paper we will prove the following result which in some cases is a generalization of the item 1 above.
** Lemma.*** Let (G,X,Φ) be a dynamical system where G be a finitely generated free group with at least two generators, Φ is uniformly continuous, X is a metric space and N is a non isolated expansive point for Φg for some g∈G. If there exists a connected and invariant set M for the action Φ with M⊂O(N), then Φ does not have the shadowing property.
A non-empty set M, M⊂X, is minimal if O(x)=M for any x∈M.
When X=S1 we have the following result (see for example [N]):
If M⊂S1 is a minimal set, then
one of these three possibilities occurs:
(1)
is a finite orbit of Φ,
2. (2)
is S1,
3. (3)
is a Cantor set and is the unique minimal set for Φ.
Now we consider the free group of two generators that we will denote by F2.
Let us state our main results:
Theorem A
Let (F2,S1,Φ) be a dynamical system. If M is a minimal set which is not a Cantor set, then Φ does not have the shadowing property.*
When M is a Cantor set we construct an example which it has the shadowing property. This example is easily generalizable to Sn.
2. Construction of the example
In this section, we considerer the free group F2 with finite symmetric generator S={a,a−1,b,b−1}.
We are going to construct an action Φ in S1 whose minimal set K is a Cantor and has shadowing property. The generator of the action will be Φa and Φb where Φa,Φb:S1→S1 have the following properties (see figure 1):
(1)
Φa,Φb are north-south pole homeomorphisms, with Ω(Φa)={Na,Sa}, Ω(Φb)={Nb,Sb}.
2. (2)
For Φa there exist two open balls BNa=B(Na,r1) y BSa=B(Sa,r2) such that:
•
BNa∩BSa=∅.
•
∣∣Φa(x)−Φa(y)∣∣>2∣∣x−y∣∣ for all x,y∈BNa and
∣∣Φa(x)−Φa(y)∣∣<1/2∣∣x−y∣∣ for all x,y∈BNac.
•
Φa(∂BNa)⊂BSa.
3. (3)
For Φb there exist two balls BNb=B(Nb,r3) y BNb=B(Sb,r4) with the same properties given in item 2, and with the additional condition
BNb∪BSb⊂(BNa∪BSa)c.
Let Ia=(Φa(BNa))c, Ia−1=(Φa−1(BSa))c, Ib=Φb((BNb))c and Ib−1=(Φb−1(BSb))c
The following properties are very useful for our purpose. Since they are not hard to prove we omit its proof.
For any n\in\mbox{\mathbb{N}}, An has 4.3n connected components and An+1⊂int(An).
•
The lengths of the connected components fo An goes to zero when n goes to infinity.
•
The Cantor set K=⋂n≥1An is a minimal for the action Φ generated for Φa y Φb (see [N]).
Some of our proofs are by induction in the length of the elements g∈G. Thus we need to define the length of an element g∈G.
The elements of length one are a,a−1,b and b−1. The elements of length n are obtained from the elements of length n−1 as follows: Let g=s1....sn−1 be an element of lengths n−1 with sj∈{a,a−1,b,b−1}. Then the element of length n generated by g are g′=s.g with s=(s1)−1. The length of g is denoted by ∣g∣.
It is clear that an element g∈G can be written from S in different ways, for example g=gaa−1.
Note that if g=s1....sn with sj∈{a,a−1,b,b−1}, then ∣g∣≤n. We say that g=s1....sn written in its normal form if ∣g∣=n. It is easy to prove that the normal representation is unique.
From now we will consider g∈G written in its normal form.
Lemma 2.1**.**
Let x∈/A0. If n≥2, then for any g∈G with 2≤∣g∣≤n hold:
•
Φg(x)∈A0**
•
If Φg(x)∈Is with s∈{a,a−1,b,b−1} and g=s1⋯sn, then s1=s.
Proof.
The proof is by induction in the length of g.
If ∣g∣=2 or 3, analyzing all possible cases for g the thesis is fulfilled.
Suppose that the statement is valid for all g∈G with ∣g∣≤n. Let g′∈G be with ∣g′∣=n+1.
Thus g′=sg with s∈{a,a−1,b,b−1} and ∣g∣=n.
Since ∣g∣=n, by the assumptions, Φg(x)∈A0. If Φg(x)∈Ia (the other cases are analogous), then by the second part of assumptions, we obtain that g=ag′′. Thus s=a−1, hence Φs=Φa−1. Since Φg(x)∈Ia and s∈{a,b,b−1}, by Remark 1 item 2), ΦsΦg(x)=Φg′(x)∈Is and the thesis is verified.
∎
Corollary 1**.**
For any x∈S1 we have that ♯O(x)∩A0c≤2.
Proof.
Suppose that there exists z∈O(x) with z∈A0c. Thus, by lemma above, if ∣g∣≥2, then Φg(z)∈A0.
When ∣g∣≤1 analyzing the different cases it is easy to show that there are at most two point of O(z) in A0c.
Thus, Since O(z)=O(x) we obtain the thesis.
∎
Now we will prove that this example has the shadowing property. We divide the proof in two cases. When the pseudotrajectory is contained in A0 and when it is not contained in A0.
Pseudotrajectory contained in A0. Given a pseudotrajectory {xg}, {xg}⊂A0, for any g∈G there exists s∈{a,a−1,b,b−1} such that xg∈Is.
We want to find a point y∈K such that xg∈Is iff Φg(y)∈Is for all g∈G.
Lemma 2.2**.**
There exists δ0>0 such that for any δ, with 0<δ<δ0, and {xg} a δ-pseudotrajectory contained in A0, then:
(1)
If xg∈Is, then xs−1g∈/Is−1, for s∈{a,b,a−1,b−1}.
2. (2)
If Φs(xg)∈Is′, for s,s′∈{a,b,a−1,b−1}, then xsg∈Is′.
Proof.
By Remark 1 item 3, we have that Φs(Is)∩Is−1=∅, for all s∈{a,b,a−1,b−1}. From the uniform continuity of the maps Φs and
d(xs−1g,Φs−1(xg))<δ, there exists δ1>0 such that if δ<δ1 and xg∈Is then xs−1g∈/Is−1.
Let J0,J1,J2 and J3 be the connected components of S1∖A0. Let ρ=min{∣J0∣,∣J1∣,∣J2∣,∣J3∣} where ∣Ji∣ is the lengths of the interval Ji.
Since Φs(xg),xsg∈A0 and d(xsg,Φs(xg))<δ, if δ<ρ then Φs(xg),xsg∈Is′ for s,s′∈{a,b,a−1,b−1}.
Hence, taking δ0=min{δ1,ρ} the thesis is verified.
∎
Lemma 2.3**.**
There exists δ0>0 such that, if {xg} is a δ-pseudotrajectory with 0<δ<δ0 and {xg}⊂A0, then there exists y∈K such that xg∈Is iff Φg(y)∈Is.
Proof.
Let δ0 be given by Lemma 2.2 and δ>0 with 0<δ<δ0.
Let s0∈{a,b,a−1,b−1} be such that xe∈Is0. Thus, we define T0=Is0.
Now we consider the point xs0−1.
Let s1∈{a,b,a−1,b−1} be such that xs0−1∈Is1.
Since δ<δ0, by Lemma 2.2 item 1), xs0−1∈/Is0−1. Hence s1=s0−1.
Since s1=s0−1, by Remark 1, item 2,) Φs0−1−1(Is1)=Φs0(Is1)⊂Is0.
Thus, we define T1=Φs0−1−1(Is1)⊂T0.
Consider the point xs1−1s0−1 .
Let s2∈{a,b,a−1,b−1} be such that xs1−1s0−1∈Is2.
as above we have s2=s1−1 and Φs1−1−1(Is2)⊂Is1. Thus, define T2=Φs0−1−1Φs1−1−1(Is2)⊂T1⊂T0.
Now we construct inductively a sequence of nested intervals {Tn}. Since ∣Tn∣→0, let
[TABLE]
We will prove that xg∈Is iff Φg(y)∈Is.
Clearly xe and Φe(y)=y belong to Is0.
Let s∈{a,b,a−1,b−1}.
If s=s0−1, then by Remark 1 item 2), Φs(Is0)⊂Is. By Lemma 2.2 item 2, xs and Φs(y) belong to Is.
If s=s0−1, by definition of y, xs0−1 and Φs0−1(y) belong to Is1.
By reasoning inductively the thesis is verified.
∎
Lemma 2.4**.**
Let δ0 be given by Lemma 2.2. If {xg} is a δ-pseudotrajectory with 0<δ<δ0 and {xg}⊂A0, then there exists y∈K such that
[TABLE]
Proof.
Let {xg} be a δ-pseudotrajectory . By Lemma 2.3 there exists y∈K such that xg∈Is iff Φg(y)∈Is.
let’s prove that d(xg,Φg(y))<3δ.
Suppose that there exists g0∈G such that d(xg0,Φg0(y))≥3δ. Let Is be such that xg0∈Is with s∈{a,a−1,b,b−1}. Since xg∈Is iff Φg(y)∈Is, then Φg0(y)∈Is. Recall that ∣∣Φs−1(x)−Φs−1(y)∣∣>2∣∣x−y∣∣ for all x,y∈Is.
Since
[TABLE]
Also
[TABLE]
Since d(Φs−1(xg0),xs−1g0)<δ, we obtain
[TABLE]
Thus, by reasoning inductively, there exists gn∈G such that d(xgn,Φgn(y))≥nδ. This is a contradiction because xg and Φg(y) belong to the same Is.
∎
Given ε>0, taking δ=ε/3, we have the shadowing property for any δ-pseudotrajectory contained in A0.
Pseudotrajectory not contained in A0.
Lemma 2.5**.**
There exists δ1>0 such that if {xg} is a δ-pseudotrajectory with δ<δ1, then there exist at most two elements g0,g1∈G such that xg0,xg1∈/A0.
Proof.
By Lemma 1 for all x∈S1, ♯O(x)∩A0c≤2.
Hence by uniform continuity of the maps Φs there exists δ1>0 that verifies the thesis.
∎
Lemma 2.6**.**
There exists δ2>0 such that if {xg} is a δ-pseudotrajectory with δ<δ2 and xe∈/A0, then for any g∈G with 2≤∣g∣≤n hold:
•
xg∈A0,
•
If xg∈Is, s∈{a,a−1,b,b−1} and g=s1⋯sn then s1=s.
Proof.
By Lemma 2.1 the result is true for an orbit. Thus, by uniform continuity of maps Φs there exists δ2>0 such that the thesis is verified.
∎
Let {xg} be a δ-pseudotrajectory. Without loss of generality (renaming the pseudotrajectory if necessary) we can assume that xe∈/A0.
We will prove that for any ε>0 there exists δ>0 such that, if {xg} is a δ-pseudotrajectory, then d(xg,Φg(xe))<ε for all g∈G.
The proof is by induction in the length of g.
Proof.
Let δ0 be given by Lemma 2.6. Given ε>0, let δ>0 be such that:
(1)
δ<min{δ0,ε/2},
2. (2)
If ∣g∣≤2, then
(a)
d(xg,Φg(xe))<ε and
2. (b)
If Φg(xe)∈Is, then xg∈Is, s∈{a,a−1,b,b−1}.
We will prove, by induction, that g∈G, with ∣g∣=n, and Φg(xe)∈Is then xg∈Is and d(xg,Φg(xe))<ε.
By item 2) above, we have the base case.
Let g∈G be, ∣g∣=n+1>2. Thus g=sg′, with ∣g′∣=n. Since xe∈/A0 then, by Lemma 2.6 item 2), xg′∈Is′ for some s′ and g′=s′g′′. Since ∣g∣=n and g=ss′g′′, then s′=s−1. Hence ∣∣Φs(x)−Φs(y)∣∣<1/2∣∣x−y∣∣ for all x,y∈Is′.
By assumption, Φg′(xe)∈Is′. Hence
[TABLE]
[TABLE]
Since d((xg′),Φg′(xe))<ε and δ<ε/2, follows d(xg,Φg(xe))<ε.
Since Φs∣Is′ is a contraction, xg and Φg(xe) belong to the same interval Is, s∈{a,a−1,b,b−1}.
∎
Final comments:
This example is easily generalizable to Sn. In the proofs made in this section, it was not used at all that X=S1.
A dynamic system can have a Cantor set as a minimal set and not have the shadowing property. Just take a Denjoy homeomorphism Φa and Φb=Id, and the action generated by Φa and Φb.
3. Proof of Theorem A
We will start by getting some helpful results for our proof.
Let (G,X,Φ) be a dynamical system. We say that a point N∈X is expansive point for g∈G if there exists α>0 such that for any δ>0, if 0<d(y,N)<δ, then there exists n\in\mbox{Z!!!Z} such that d(Φgn(y),Φgn(N))>α. The number α is called a expansive constant of N.
Remark 2**.**
Let N be an expansive point for Φa with expansive constat α. Let {xg} be a δ-pseudotrajectory with xam=Φam(N) for all m\in\mbox{Z!!!Z}. If there exists y∈X such that d(xg,Φg(y))<α for all g∈G, then y=N.
Lemma 3.1**.**
Let (G,X,Φ) be a dynamical system, X a metric space, N is a not isolated point and it is an expansive point for Φa. If there exists an invariant connected set M with M⊂O(N), then Φ does not have the shadowing property.
Proof.
For each s∈{a,a−1,b,b−1} let
[TABLE]
Note that F2=⋃s∈{a,a−1,b,b−1}F2s.
Consider F2s(N)={Φg(N),g∈F2s}. Since M⊂O(N), thus M⊂⋃s∈{a,a−1,b,b−1}F2s(N).
Claim:F2s(N)∩M=∅ for all s∈{a,a−1,b,b−1}.
Since M⊂⋃s∈{a,a−1,b,b−1}F2s(N) then M∩F2s0(N)=∅ for some s0∈{a,a−1,b,b−1}. Then there exists {gn}⊂F2s0 and z∈M such that Φgn(N)→z. Hence, given s∈{a,a−1,b,b−1} with s=s01 we have that sgn∈F2s and ΦsΦgn(N)→Φs(z)∈M. Then F2s(N)∩M=∅.
If s=s0−1, consider s1=s0 , s1=s0−1. As proved above F2s1(N)∩M=∅. Reasoning in a similar way to the previous case, changing s0 for s1, we conclude F2s0−1(N)∩M=∅.□
For s∈{a,a−1,b,b−1}, let As=F2s(N)∩M. Note that As is a non-empty closed set in M for all s. Since M is a connected set,
[TABLE]
Without loss of generality we can suppose that F2b(N) intersect to F2s(N) with s=b.
Suppose that Φ has the shadowing property for ε,δ, with ε<α/2 where α is the expansive constant of N for Φa.
Since F2b(N)∩F2s(N)=∅ then there exists g1,g2∈G such that
[TABLE]
Let g2=s1...sram with m\in\mbox{Z!!!Z} y sr=a.
Thus
[TABLE]
let’s g1=s1′...st′ and g2=s1...sram with m\in\mbox{Z!!!Z} and sr=a.
let’s define the δ-pseudotrajectory {xg} as follows(see figure 3):
xbg1=Φsg2(N)=Φss1...sr(Φam(N)), ( here we use that d(Φbg1(N),Φsg2(N))<δ. )
•
xs−1bg1=Φg2(N)=Φs1...sr(Φam(N)), ( here we use that s=b)
•
xs1−1s−1bg1=Φs2...sr(Φam(N)),…, xsr−1−1...s1−1s−1bg1=Φsram(N) and
•
xsr−1...s1−1s−1bg1=N′ such that d(N′,Φam(N))<δ.
From here we define the pseudotrajectory dynamically.
Since xan=Φan(N) for all n\in\mbox{Z!!!Z}, by Remark 2, if there exists y∈X such that d(xg,Φg(y))<α for all g∈G then y=N.
Since Φsr−1...s1−1s−1(Φsg2(N))=Φam(N), then Φsr−1...s1−1s−1bg1(N)=Φam(N). Hence we take N′=Φam(N)
Now ,applying by Remark 2 to point Φam(N) we obtain a contradiction.
∎
Now we state a result about the classification of homeomorphisms with the shadowing property.
Let a,b be two fixed point of a homeomorphism f:S1→S1 preserving orientation with (a,b)∩Fix(f)=∅. The interval (a,b) is an r-interval if for x∈(a,b) we have that fn(x)→a, n→−∞ and fn(x)→b, n→+∞.
The interval (a,b) is an l-interval if for x∈(a,b) we have that fn(x)→a, n→+∞ and fn(x)→b, n→−∞.
Let [f]=\{f^{m}:\ m\in\mbox{\mathbb{N}}\}.
The following result is due to Plamenevskaya (see [Pl]).
Theorem 3.2**.**
A homeomorphism f:S1→S1 has the shadowing property if and only if the family [f] contains a homeomorphism such that:
(1)
f* preserve orientation.*
2. (2)
The set Fix(f) is nowhere dense and contains at least two points.
3. (3)
For any two r-intervals (l-intervals) (a,b) and (c,d) there exists l-intervals ( correspondingly, r-intervals) (p,q) and (s,t) such that
[TABLE]
**The set S1 is the minimal set.
**
We will now prove the Theorem A for the case that S1 is the minimal set.
By Theorem 3.2, there exist m,n\in\mbox{Z!!!Z} such that the maps Φam and Φbn preserve orientation and they have at least two fixed points.
Changing, if necessary, the free group F2 by the free group F2′ generated by {am,bn}, we can assume that the maps Φa and Φb preserve orientation and they have at least two fixed points.
Again, by Theorem 3.2 there exists a r-interval or a l-interval (N,N′) for Φa. Suppose that (N,N′) is a r-interval.
By contradiction, suppose that Φ has the shadowing property for ε, δ.
Since S1 is a connected invariant set and O(N)=S1, by the proof of Lemma 3.1 there exist g1,g2∈G such that
[TABLE]
Suppose that Φbg1(N) is on the left of Φsg2(N).
Let’s write g1=s1′...st′ and g2=s1...sram with m\in\mbox{Z!!!Z} and sr=a.
Let’s define a δ-pseudotrajectory {xg} as follows:
xbg1=Φsg2(N)=Φss1...sr(Φam(N)), (here we use that d(Φbg1(N),Φsg2(N))<δ. )
•
xs−1bg1=Φg2(N)=Φs1...sr(Φam(N)), ( here we use that s=b)
•
xs1−1s−1bg1=Φs2...sr(Φam(N)),…, xsr−1−1...s1−1s−1bg1=Φsram(N) and
•
xsr−1...s1−1s−1bg1=y such that y∈(N,N′) and d(y,N)<δ.
From here we define the pseudotrajectory dynamically.
Suppose that there exist z∈S1 be such that d(xg,Φg(z))<ε for all g∈G.
Since xan=Φan(N) for all n\in\mbox{Z!!!Z} and (N,N′) is a r-interval, then z∈(N−ε,N). (see figure 4).
Since Φg preserve orientation and z is on the left of N, then Φbg1(z) is on the left of Φbg1(N). Recall that Φbg1(N) is on the left of Φsg2(N).
Then Φg2−1s−1bg1(z) is on the left of Φg2−1s−1(Φsg2(N))=N.
Since Φan(Φg2−1s−1bg1(z))∈/(N,N′) for all n≥0 y Φan(y)→N′ because (N,N′) is r-interval we obtain a contradiction.
**There exists a finite minimal set.
**First we state a lemma and the Theorem A is obtained as corollary.
Lemma 3.3**.**
Let (F2,S1,Φ) be a dynamical system. Suppose that there exist g1,g2∈F2 such that:
(1)
g1n=g2m* for all n,m\in\mbox{Z!!!Z}\setminus\{0\} and*
2. (2)
there exists N∈S1 such that Φg1(N)=Φg2(N)=N.
Then Φ does not have the shadowing property.
Proof.
Let F2′ be the subgroup of F2 generated by g1,g2. We consider the action Φ′=Φ∣F2′. Note that if the dynamical system (F2′,S1,Φ′) has not have the shadowing property then (F2,S1,Φ) has not have the shadowing property.
Since g1n=g2m for all n,m\in\mbox{Z!!!Z}\setminus\{0\} the group F2′ is isomorphic with F2.
To simplify we write Φa′=Φg1 and Φb′=Φg2.
We will prove that the lift of the dynamical system (F2′,S1,Φ′) has not have the shadowing property. Thus the dynamical system (F2′,S1,Φ′) has not have the shadowing property either.
Let (\Pi,\mbox{I!!R}) be the universal covering of S1 with \Pi:\mbox{I!!R}\to S^{1} such that Π(t)=ei2πt. Let \widetilde{N}\in\mbox{I!!R} be such that Π(N)=N and \widetilde{\Phi}_{a},\widetilde{\Phi}_{b}:\mbox{I!!R}\to\mbox{I!!R}, the lift of Φa and Φa that fix N.
Let (F^{{}^{\prime}}_{2},\mbox{I!!R},\widetilde{\Phi}) be the dynamical system where Φ is the action generated by Φa and Φb.
Note that Φ′ has the shadowing property iff Φ has the shadowing property.
We will prove that the action Φ has not have the shadowing property.
Note that the interval [N,N+1] is invariant for the action Φ. Then for all x∈[N,N+1], O(x)⊂[N,N+1].
Suppose that the action Φ has the shadowing property for ε,δ.
Recall that Φa and Φb are increasing functions.
Given x∈[N,N+1], consider a δ-pseudotrajectory as follows:
xe=x.
We have two possibilities: Φa(xe)≥xe or Φa−1(xe)≥xe. Hence there exists s1∈{a,a−1} such that Φs1(xe)≥xe
Thus, define
[TABLE]
Now consider xs1.
We have two possibilities: Φb(xs1)≥xs1 or Φb−1(xs1)≥xs1. Hence there exists s2∈{b,b−1} such that Φs2(xs1)≥xs1
Thus, define
[TABLE]
Again, consider xs2s1 and the maps Φa and Φa−1 to define the point xs3s2s1. Clearly
[TABLE]
Since O(x)⊂[N,N+1], then Φ does not have the shadowing property.
∎
Corollary 2**.**
Let (F2,S1,Φ) be a dynamical system. If there exists a finite minimal set, then Φ does not have the shadowing property.
Proof.
Let M be a finite minimal set for (F2,S1,Φ). Without loss of generality we can assume that M={N} and Φg(N)=N for all g∈F2. Thus, by Lemma 3.3Φ does not have the shadowing property.
∎
To end we give a simple example that show that Lemma 3.3 and Corollary 2 are not equivalent. Let f:S1→S1 be a irrational rotation. Consider Φa=f, Φb=f−1 and Φ the action generated by Φa and Φb. Let g1=ab and g2=ba.
Thus g1n=g2m for all m,n\in\mbox{Z!!!Z}\setminus\{0\} and Φg1=Φg2=Id. Hence for all N∈S1, Φg1(N)=Φg2(N)=N and S1 is the minimal set for the action Φ.
Bibliography4
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[N] (MR 2394157) A. Navas, Groups of circle diffeomorphisms. Translation of the 2007 Spanish edition. , Chicago Lectures in Mathematics. University of Chicago Press, Chicago, IL, 2011. xviii+290 pp. ISBN: 978-0-226-56951-2; 0-226-56951-9.
2[OT] (MR 1944405) [10.1017/S 0143385702000512] Osipov, A., Tikhomirov , S, \doititle Shadowing for actions of some finitely generated groups. , Dyn. Syst., 29 , no. 3, (2014), 337–351.
3[P] (MR 1944405) [10.1017/S 0143385702000512] Pilyugin, S, \doititle Theory of pseudo-orbit shadowing in dynamical systems. , Differ. Equ., 47 , no. 13, (2011), 1929–1938.
4[Pl] (MR 1944405) [10.1017/S 0143385702000512] Plamenevskaya, O. B., \doititle Pseudo-orbit tracing property and limit shadowing property on a circle. , Vestnik St. Petersburg Univ. Math, 30 , no. 1, (1997), 27–30.