This paper explores the properties of $$-free sets using a window approach, linking their arithmetic and dynamical features to the topological and measure-theoretic characteristics of an associated set.
Contribution
It introduces a novel perspective by interpreting $$-free sets as weak model sets and characterizes their properties through the geometry of the window.
Findings
01
Tautness of $$ corresponds to Haar regularity of the window.
02
The associated dynamical system is a Toeplitz system if the window is topologically regular.
03
Proximality of the system occurs when the window has empty interior.
Abstract
Let B be an infinite subset of {1,2,…}. We characterize arithmetic and dynamical properties of the B-free set FB through group theoretical, topological and measure theoretic properties of a set W (called the window) associated with B. This point of view stems from the interpretation of the set FB as a weak model set. Our main results are: B is taut if and only if the window is Haar regular; the dynamical system associated to FB is a Toeplitz system if and only if the window is topologically regular; the dynamical system associated to FB is proximal if and only if the window has empty interior; and the dynamical system associated to FB has the "na\"ively expected" maximal equicontinuous factor if and only if the interior…
Equations324
MB:=b∈B⋃b\mathbbmZ
MB:=b∈B⋃b\mathbbmZ
FB:=\mathbbmZ∖MB.
FB:=\mathbbmZ∖MB.
Bprim:=B∖b∈B⋃b⋅(\mathbbmN∖{1}).
Bprim:=B∖b∈B⋃b⋅(\mathbbmN∖{1}).
W:={h∈H:hb=0(∀b∈B)}.
W:={h∈H:hb=0(∀b∈B)}.
US(h):={h′∈H:∀b∈S:hb=hb′}, defined for finite S⊂B and h∈H.
US(h):={h′∈H:∀b∈S:hb=hb′}, defined for finite S⊂B and h∈H.
Xη=φ(Δ(\mathbbmZ)).
Xη=φ(Δ(\mathbbmZ)).
hb=n mod b for each b∈S.
hb=n mod b for each b∈S.
h satisfies the CRT iffh∈H.
h satisfies the CRT iffh∈H.
h satisfies the B-free CRT iffh∈Δ(\mathbbmZ)∩W.
h satisfies the B-free CRT iffh∈Δ(\mathbbmZ)∩W.
AS:={gcd(b,lcm(S)):b∈B},
AS:={gcd(b,lcm(S)):b∈B},
A∞:={n∈\mathbbmN:∀S⊂B∃S′:S⊆S′:n∈AS′∖S′}.
A∞:={n∈\mathbbmN:∀S⊂B∃S′:S⊆S′:n∈AS′∖S′}.
k→∞limsup(ASk∖Sk)=A∞.
k→∞limsup(ASk∖Sk)=A∞.
HA:={h∈H:A+h=A}
HA:={h∈H:A+h=A}
Δ(1)+Hint(W)
Δ(1)+Hint(W)
dk:=j→∞limgcd(sk,ck+j), where sk:=lcm(Sk) and cl:=minimal period of MASl.
dk:=j→∞limgcd(sk,ck+j), where sk:=lcm(Sk) and cl:=minimal period of MASl.
Y:={x∈{0,1}\mathbbmZ:card(supp(x) mod b)=b−1∀b∈B}.
Y:={x∈{0,1}\mathbbmZ:card(supp(x) mod b)=b−1∀b∈B}.
W=intW⇒Xη⊆Y⇒HW=HintW.
W=intW⇒Xη⊆Y⇒HW=HintW.
d(M)=N→∞limsupN1card(M∩{1,…,N}) resp. d(M)=N→∞liminfN1card(M∩{1,…,N})
d(M)=N→∞limsupN1card(M∩{1,…,N}) resp. d(M)=N→∞liminfN1card(M∩{1,…,N})
δ(M)=N→∞limlogN1n∈M∩{1,…,N}∑n1
δ(M)=N→∞limlogN1n∈M∩{1,…,N}∑n1
B is taut⇔∀b∈B:d(MB)>d(MB∖{b})⇔∀b∈B:c−1d(MB)>c−1d(MB∖{b})⇔∀b∈B:d(McB)>d(Mc(B∖{b}))=d(McB∖{cb})⇔∀b′∈cB:d(McB)>d(McB∖{b′})⇔cB is taut.
B is taut⇔∀b∈B:d(MB)>d(MB∖{b})⇔∀b∈B:c−1d(MB)>c−1d(MB∖{b})⇔∀b∈B:d(McB)>d(Mc(B∖{b}))=d(McB∖{cb})⇔∀b′∈cB:d(McB)>d(McB∖{b′})⇔cB is taut.
B′(q)={gcd(b,q)b:b∈B},
B′(q)={gcd(b,q)b:b∈B},
c=qℓb=k⋅gcd(b,q)b∈MB′(q).
c=qℓb=k⋅gcd(b,q)b∈MB′(q).
US(h):={h′∈H:∀b∈S:hb=hb′}, defined for finite S⊂B and h∈H,
US(h):={h′∈H:∀b∈S:hb=hb′}, defined for finite S⊂B and h∈H,
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.
Full text
Dynamics of B-free sets: a view through the window
Stanisław Kasjan*∗†*
Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland
Gerhard Keller†
Department of Mathematics, University of Erlangen-Nürnberg, Germany
Mariusz Lemańczyk
Research supported by Narodowe Centrum Nauki UMO-2014/15/B/ST1/03736.Research supported by the special program of the semester
“Ergodic Theory and Dynamical Sytems in their Interactions with Arithmetic and Combinatorics”, Chair Jean Morlet, 1.08.2016-30.01.2017.
Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland
(Version of March 1, 2024)
Abstract
Let B be an infinite subset of {1,2,…}.
We characterize arithmetic and dynamical properties of the B-free set FB through
group theoretical, topological and measure theoretic properties of a set W (called the window) associated with B. This point of view stems from the interpretation of the set FB as a weak model set. Our main results are: B is taut if and only if the window is Haar regular; the dynamical system associated to FB is a Toeplitz system if and only if the window is topologically regular; the dynamical system associated to FB is proximal if and only if the window has empty interior; and the dynamical system associated to FB has the “naïvely expected” maximal equicontinuous factor if and only if the interior of the window is aperiodic.
For any given set B⊆\mathbbmN={1,2,…} one can define its set of multiples
[TABLE]
and the set of B-free numbers
[TABLE]
The investigation of structural properties of MB or, equivalently, of FB has a long history (see the monograph [10] and the recent paper [4] for references), and dynamical systems theory provides some useful tools for this. Namely, denote by η∈{0,1}\mathbbmZ the characteristic function of FB, i.e. η(n)=1 if and only if n∈FB, and consider the
orbit closure Xη of η in the shift dynamical system
({0,1}\mathbbmZ,σ), where σ stands for the left shift. Then topological dynamics and ergodic theory provide a wealth of concepts to describe various aspects of the structure of η, see [16] which originated
this point of view by studying the set of square-free numbers, and also
[1], [4] which continued this line of research.
In this paper we continue to provide a dictionary that characterizes arithmetic properties of B in terms of dynamical properties of Xη, and, as an intermediate step, also in terms of topological and measure theoretic properties of a pair (H,W) associated with the passage from B to
Xη, where H is a compact abelian group and W a compact subset of H. This latter point of view is borrowed from the theory of weak model sets, which applies here, because FB is a particular example of such a set, see e.g. [3, 13].
Finally the Chinese Remainder Theorem allows
us to interpret our dynamical results combinatorially.
In order to formulate our main results, we need to
recall some notions from the theory of sets of multiples [10]
and also to
introduce some further notation.
Let B be a non-empty subset of \mathbbmN.
•
B is primitive, if there are no b,b′∈B with b∣b′.
From any set B⊆\mathbbmN one can remove all multiples of other numbers in B, which results in the set
[TABLE]
Bprim is primitive by construction, and MB=MBprim.
•
B is taut, if δ(MB∖{b})<δ(MB) for each b∈B, where δ(MB):=limn→∞logn1∑k⩽n,k∈MBk−1
denotes the logarithmic density of this set, which is known to exist by the Theorem of Davenport and Erdös [6, 7].
So a set is taut, if removing any single point from it changes its set of multiples drastically and not only by “a few points”.
•
H~:=∏b∈B\mathbbmZ/b\mathbbmZ and Δ:\mathbbmZ→H~, Δ(n)=(n,n,…) – the canonical diagonal embedding.
•
H:=Δ(\mathbbmZ) is a compact abelian group, and we denote by mH its normalised Haar measure.
•
RΔ(1):H→H denotes the rotation by Δ(1), i.e. (RΔ(1)h)b=(hb+1) mod b for all b∈B.
•
The window is defined as
[TABLE]
•
φ:H→{0,1}\mathbbmZ is the coding function: φ(h)(n)=1, if and only if RΔ(1)nh∈W, equivalently, if and only if hb+n=0 mod b for all b∈B.
•
By S,S′⊂B we always mean finite subsets.
•
The topology on H is generated by the (open and closed) cylinder sets
[TABLE]
A recurring theme of the main results in this paper is to characterize arithmetic and dynamical properties of a B-free set FB through
group theoretical, topological and measure theoretic properties of the window W defined above.
Remark 1.1**.**
With the notation introduced above, we can write
[TABLE]
This is certainly a subset of Xφ:=φ(H), the set studied in [13] under the name MWG. In Proposition 2.2 we show that Xη=Xφ when B has light tails (see Subsection 2.5 for a definition), but we do not know whether also tautness of B suffices (see also Subsection 2.5).
1.1 Tautness as a measure theoretic property
Theorem A**.**
111The authors are indebted to J. Kułaga-Przymus for pointing out the relevance of [10, Lemma 1.17] for the proof of this theorem.
Suppose that the set B is primitive.
Then the following are equivalent:
(i)
B* is taut.*
2. (ii)
The window W is Haar regular, i.e. supp(mH∣W)=W.
Moreover, these properties imply
(iii)
Δ(\mathbbmZ)∩W=W.
The proof of the theorem is provided in Section 2.
The concept of a Haar regular window was introduced in [14] in the context of general weak model sets.
Given a set B⊂\mathbbmN, one says that h:=(hb)b∈B∈\mathbbmZB satisfies the CRT
(Chinese Remainder Theorem) if for each finite S⊂B there exists n∈\mathbbmZ such that
[TABLE]
Clearly,
[TABLE]
We are looking for solutions of (3) with n∈FB. If for h as above we can solve (3) with n=nS∈FB for all finite S⊂B, then we say that h satisfies the B-free CRT.
A necessary condition for h=(hb)b∈B to satisfy the B-free CRT is, of course, that hb=0 mod b for each b∈B, and a moment’s reflection shows that
[TABLE]
Therefore the implication (i)⇒(iii) of Theorem A is an immediate consequence of the following proposition.
Proposition 1.1**.**
Assume that B is taut. Let h∈W and S⊂B finite.
Then the set of
B-free integers n that solve n=hb mod b for b∈S has asymptotic density
mH(US(h)∩W)>0.
In Subsection 2.4 we provide a sequence B, which is not taut, but for which Δ(\mathbbmZ)∩W=W (Example 2.2). Hence (iii) of Theorem A is not equivalent to (i) and (ii). Here we provide two simpler examples which throw some light on property (iii). Denote by P⊆\mathbbmN the set of all prime numbers.
Example 1.1**.**
If B=P then H=∏p∈P\mathbbmZ/p\mathbbmZ, W is uncountable (although of Haar measure zero) and
Δ(\mathbbmZ)∩W=W,
since for each n we find p∈P such that p∣n, so n=0 mod p.
Example 1.2**.**
If B⊂P is thin, i.e. if ∑p∈B1/p<+∞, then Δ(\mathbbmZ)∩W=W in view of (4),
because each h∈H satisfies the B-free CRT. Indeed, if S⊂B is finite and
n=hb mod b for b∈S, then n+lcm(S)\mathbbmZ is the set of all solutions to this system of congruences. Moreover, if h∈W, then gcd(n,b)=1 for all b∈S. We only need to find r∈\mathbbmZ so that n+rlcm(S) is a prime number which is not in B. The latter follows from Dirichlet’s theorem:
The set of prime numbers contained in n+lcm(S)\mathbbmZ is not thin. Of course this is a special case of Theorem A.
Remark 1.2**.**
Denote by νη:=mH∘φ−1 the Mirsky measure on Xη.
There are two independent proofs of the fact that the two equivalent conditions from Theorem A imply that
the measure preserving dynamical system (Xη,σ,νη) is isomorphic to the group rotation (H,RΔ(1),mH):
In [4, Theorem F] it is proved that this is implied by (i). That it is also a direct consequence of (ii) follows - in the more general context of model sets - from [14]. The proof uses our observation that W is aperiodic (see Proposition 5.1). To see this, denote by HW:={h∈H:W+h=W} the period group of W and by HWHaar:={h∈H:mH((W+h)△W)=0} its group of Haar periods. It is easily seen that
HW=HWHaar for Haar regular W, in particular whenever the sequence B is taut. Hence, if W is aperiodic, it is also Haar aperiodic, and this is what is needed to apply the general theorem from [14] to the present context.
A word of caution is in order at this point: Althoug, in the B-free context, the window W is always aperiodic (Proposition 5.1), this is not necessarily true for its Haar regularization Wreg:=supp(mH∣W), because that window is not of the same arithmetic type as W. On the other hand, as proved in [4, Theorem C], each non-taut set B can be modified into a taut set B′ whose corresponding Mirsky measure νη′ coincides with νη (as a measure on {0,1}\mathbbmZ).
The (arithmetic!) window W′⊆H′ defined by B′ is then aperiodic and Haar regular, and we suspect that it to be
closely related to Wreg⊆H.
1.2 The proximal and the Toeplitz case
From [4, Theorem A] we know that Xη has a unique minimal subset M.
In Lemma 3.10, we prove that M=φ(Cφ), where Cφ denotes the set of continuity points of φ:H→{0,1}\mathbbmZ, see also [13, Lemma 6.3].
M is degenerate to a singleton, namely to M={(…,0,0,0,…)}, if and only if int(W)=∅ [13], and we collect a number of equivalent characterizations of this extreme case in Theorem C below.
Assuming primitivity of B and property (iii) of Theorem A, we prove the following equivalent characterizations of minimality of (Xη,σ), i.e. of M=Xη, in Subsection 3.2.
For S⊂B let
[TABLE]
and note that FAS⊆FB, because
b∣m for some b∈B implies gcd(b,lcm(S))∣m for any S⊂B.
Let
[TABLE]
In Lemma 3.2 we prove: If (Sk)k is a filtration of B with finite sets, then
[TABLE]
Theorem B**.**
Suppose that B is primitive.
Consider the following list of properties:
(B)
The window W is topologically regular, i.e. int(W)=W.
2. (B)
FB=⋃S⊂B finiteFAS.
3. (B)
A∞=∅.
4. (B)
There are no d∈\mathbbmN and no infinite pairwise
coprime set A⊆\mathbbmN∖{1} such that dA⊆B.
5. (B)
η=φ(0)* is a Toeplitz sequence (see [8], [12] for the
definition) different from (…,0,0,0,…).*
6. (B)
0∈Cφ* and
φ(0)=(…,0,0,0,…).*
7. (B)
η∈M* and η=(…,0,0,0,…).*
8. (B)
Xη* is minimal., i.e. Xη=M, and card(Xη)>1.*
9. (B)
The dynamics on Xη
is a minimal almost 1-1 extension of (H,RΔ(1)),
the rotation by Δ(1) on H.
a)
(B1) - (B6) are all equivalent,
and each of these conditions implies that B is taut.
2. b)
(B7) and (B8) are equivalent.
3. c)
Each of (B1) - (B6) implies (B9).
4. d)
(B9) implies (B7) and (B8).
5. e)
If Δ(\mathbbmZ)∩W=W (in particular if B is taut), then (B1) - (B9) are all equivalent.
Remark 1.3**.**
One ingredient of the proof of Theorem B is the observation that the set B is taut whenever η is a Toeplitz sequence. This was pointed out to us by
A. Bartnicka who also gave a proof of it, which we recall in Lemma 3.7 below.
Moreover, we can interpret the result purely arithmetically as follows: If B is primitive and satisfies (B4) then the set of elements for which the B-free CRT holds is topologically regular, i.e. it contains a dense subset of points for which all sufficiently close points satisfying the CRT satisfy also the B-free CRT.
The following characterization of regular Toeplitz sequences is included in Proposition 4.1 in
Subsection 4.2, where also the precise definition of regularity
of a Toeplitz sequence is recalled.
Proposition 1.2**.**
Assume that int(W)=W. Then the Toeplitz sequence
η is regular, if and only if mH(∂W)=0.
In Subsection 4.2 we also provide examples of sets B that give rise to regular Toeplitz sequences and others giving rise to irregular Toeplitz sequences.
Note also that
mH(∂W)=0 if and only if
infS⊂Bdˉ(MAS∖MB)=0, see
Lemma 4.3, and observe that mH(∂W)=0 implies unique ergodicity of the dynamics on Xη [13, Theorem 2c].
The next theorem is complementary to Theorem B.
Most of its equivalences follow from results in [4] and [13] and are proved in Subsection 3.3.
They do not rely on the more advanced arithmetic concept of tautness.
Theorem C**.**
The following are equivalent:
(C)
int(W)=∅**
2. (C)
⋃S⊂B finiteFAS=∅,
i.e. FAS=∅ for all finite S⊂B.
3. (C)
∀S⊂B:1∈AS.
4. (C)
B* contains an infinite pairwise coprime subset.*
5. (C)
If C⊆\mathbbmN is finite and if B⊆MC, then 1∈C.
6. (C)
M={(…,0,0,0,…)}.
7. (C)
The dynamics on Xη are proximal.
Remark 1.4**.**
Under the conditions
of Theorem C no element of W is
stable, that is, for each h staisfying the B-free CRT there is an element
h′∈\mathbbmZB arbitrarily close to h which satisfies the CRT but not the B-free
CRT.
1.3 The maximal equicontinuous factor
We finish with a result that identifies the maximal equicontinuous factor of the dynamics on Xη and answers Question 3.14 in [4].
Given a subset A⊆H, denote by
[TABLE]
the period group of A. The set A⊆H is topologically aperiodic, if HA={0}.
Observe also that Hint(A) is a closed subgroup of H, whenever A is closed [14, Lemma 6.1].
In Proposition 5.1 we prove that HW={0} whenever B is primitive.
If int(W)=∅, then of course Hint(W)=H. If int(W)=∅,
the situation is more complicated: Hint(W) is obviously always a strict subgroup of H, and very often Hint(W)={0}, but
there are examples where Hint(W) is a non-trivial strict subgroup of H, see Subsection 5.3. In any case, however, Hint(W) determines the maximal equicontinuous factor. The following is proved in [14, Theorem A2]:
[TABLE]
Let S1⊂S2⊂… be any filtration of B by finite sets.
In Subsection 5.1 we define divisors dk of lcm(Sk):
[TABLE]
By Remark 5.1 we have dksk∣dk+1sk+1 for any k.
The sequences (sk), (dk) and (ck) determine Hint(W) in the following way:
Proposition 1.3**.**
a)
[TABLE]
*is an exact sequence.*222A sequence of abelian groups and homomorphisms ...⟶Mk−1⟶fk−1Mk⟶fkMk+1→... is called exact
if the kernel of fk is equal to the image of fk−1 for any k. In particular, a sequence
0→M′⟶fM⟶gM′′→0
is exact, when f is injective, the kernel of g equals the image of f and g is surjective. We say that it is a ”short exact sequence”. In particular, the homomorphism g induces an isomorphism M′′≅M/f(M′) in this case.
**
2. b)
Hint(W)≅←lim\mathbbmZ/dksk\mathbbmZ.
3. c)
H/Hint(W)≅←lim\mathbbmZ/dk\mathbbmZ.
4. d)
Hint(W)={0}* if and only if sk=dk for each k∈\mathbbmN,
equivalently if for each b∈B there is n>0 such that b divides cn.*
Theorem D**.**
a)
The translation by (1,1,…) on H/Hint(W)≅←lim\mathbbmZ/dk\mathbbmZ is the
maximal equicontinuous factor of the dynamics on Xη.
2. b)
In case d) of Proposition 1.3,
the translation by Δ(1) on H≅←lim\mathbbmZ/sk\mathbbmZ is the maximal equicontinuous factor of the dynamics on Xη.
In Subsection 5.3 we provide a number of examples illustrating this theorem.
Remark 1.5**.**
In [4], the following set Y is defined: 333Versions of this set occur also in [15] and [2].
[TABLE]
Observe that card(supp(x) mod b)⩽b−1 for all x∈Xη and b∈B.
444Indeed, if card(supp(x) mod b)=b for some x∈Xη and b∈B,
then this happens on some integer interval [−M,M], and hence
card(supp(η) mod b)=b, which contradicts the fact that supp(η)⊆FB.
Proposition 3.27 of [4] asserts that
(H,RΔ(1)) is the maximal equicontinuous factor of (Xη,S),
whenever Xη⊆Y. Hence, in that case, HintW=HintW={0}=HW by Theorem D and Proposition 5.1. This is the second one of the following two implications:
The theorem of Davenport and Erdös [6, 7] asserts that δ(MB)=d(MB) exists for any subset B⊆\mathbbmN.
Definition 2.2**.**
B⊆\mathbbmN∖{1}* is a Behrend sequence, if δ(MB)=1.*
Recall that B is taut, if δ(MB∖{b})<δ(MB) for each b∈B.
The following is a corollary to a theorem of Behrend [5]:
Proposition 2.1**.**
A set B⊆\mathbbmN is taut, if and only if it is primitive and there are no q∈\mathbbmN and no
Behrend set A⊆\mathbbmN∖{1} such that
qA⊆B [10, Corollary 0.19].
This motivates the next definition:
Definition 2.3**.**
A set B⊆\mathbbmN is pre-taut, if there are no q∈\mathbbmN and Behrend set A⊆\mathbbmN∖{1} such that qA⊆B.
Lemma 2.1**.**
Let B⊆\mathbbmN and c∈\mathbbmN.
a)
If cB is pre-taut, then also B is pre-taut. Moreover,
B is
taut if and only if cB is taut.
2. b)
Each subset of a (pre-)taut set is (pre-)taut.
3. c)
A finite union of pre-taut sets is pre-taut.
4. d)
If B is taut, then B={1} or d(MB)=1 (possibly non-existing). Equivalently, if d(MB)=1, then B={1} or B is not taut.
5. e)
If B is pre-taut, then 1∈B or d(MB)=1 (possibly non-existing). Equivalently, if d(MB)=1, then 1∈B or B is not pre-taut.
Proof.
a) The first implication is obvious. It is also clear that B is primitive if and only if cB is primitive. Moreover,
[TABLE]
b) is obvious (see Remark 2.1).
c) follows from [10, Corollary 0.14], see also [4, Proposition 2.33].
d) Suppose that B is taut. Then B is primitive, and d(MB)=1 unless 1∈B by [10, Corollary 0.19].
Hence d(MB)=1 or B={1}.
e) follows directly from Definition 2.3 555Note that d) follows from e) and Remark 2.2..
∎
Remark 2.1**.**
B is taut if and only if it is pre-taut and primitive. If B is pre-taut, then Bprim is taut in view of Lemma 2.1b.
For q∈\mathbbmN and B⊆\mathbbmZ let
[TABLE]
and note that 1∈B′(q) if and only if q∈MB.
Lemma 2.2**.**
Let q∈\mathbbmN, B,C⊆\mathbbmZ, and qC⊆MB. Then
MC⊆MB′(q).
Proof.
Let c∈C. There are ℓ∈\mathbbmZ and b∈B such that qc=ℓb.
Since q∣ℓb, it follows that q∣ℓgcd(b,q), thus k=qℓgcd(b,q) is an integer. We have
[TABLE]
This shows that C⊆MB′(q) and hence also MC⊆MB′(q).
∎
Lemma 2.3**.**
Let B⊆\mathbbmN and q∈\mathbbmN.
a)
If B is pre-taut, then B′(q) is pre-taut.
2. b)
If B is taut, then B′(q) is a finite disjoint union of taut sets Bi′ defined below in the proof of a).
3. c)
If d(MB)=1, then d(MB′(q))=1.
4. d)
If B=⋃i=1NCi and if d(MB)=1, then d(MCi)=1 for at least one i∈{1,…,N}.
Proof.
Let I:={gcd(b,q)q:b∈B}. For i∈I
denote Bi:={b∈B:gcd(b,q)q=i} and
Bi′:={gcd(b,q)b:b∈Bi}. Then I is finite, B=⋃i∈IBi, and B′(q)=⋃i∈IBi′. Moreover,
Bi={iqb′:b′∈Bi′}=iqBi′.
a) If B is pre-taut, then all Bi are pre-taut (Lemma 2.1b), then all
Bi′ are pre-taut (Lemma 2.1a), and then B′(q) is pre-taut (Lemma 2.1c).
b) If B is taut, then all Bi are taut (Lemma 2.1b), and then all
Bi′ are taut (Lemma 2.1a).
c) As B⊆MB′(q), we have also MB⊆MB′(q).
d) If B is Behrend, then at least one of the sets Ci is Behrend [10, Corollary 0.14], and so d(MCi)=1.
Otherwise 1∈B, so that 1∈Ci for some i, whence MCi=\mathbbmZ.
∎
Lemma 2.4**.**
(compare [4, Proposition 4.25])
Assume that B⊆\mathbbmN is taut and d(MC)=1 for some C⊆\mathbbmZ. If
qC⊆MB for some q⩾1,
then b∣q for some b∈B.
Proof.
By Lemma 2.2, MC⊆MB′(q), so that d(MB′(q))=1.
Then B′(q)={1} or B′(q) is not taut (Lemma 2.1d). If B′(q)={1}, then gcd(b,q)=b for all b∈B, i.e b∣q for all b∈B, which is impossible because B is infinite. Hence B′(q) is not taut.
On the other hand, as B is taut by assumption, B′(q) is a finite union of taut sets Bi′ (Lemma 2.3b). As d(MB′(q))=1, also d(MBi′)=1 for at least one of the sets Bi′ (Lemma 2.3d), so that Bi′={1} for this set (Lemma 2.1d). This implies q∈MB.
∎
Recall that the topology on H is generated by the (open and closed) cylinder sets
[TABLE]
and recall also the definition of AS:={gcd(b,lcm(S)):b∈B}. Note that AS is finite and S⊆AS.
Lemma 2.5**.**
Let U=US(Δ(n)) for some S⊂B and n∈\mathbbmZ.
a)
If n∈MS, then U∩W=∅.
2. b)
If U∩W=∅, then n+lcm(S)⋅\mathbbmZ⊆MB∩AS.
3. c)
There is a filtration of B by finite sets S for which B∩AS=S.
4. d)
If B∩AS=S, then n∈MS iff U∩W=∅
iff n+lcm(S)⋅\mathbbmZ⊆MS.
Proof.
a) This follows immediately from the definitions of US(Δ(n)) and W.
b) For each h∈U there is b∈B such that hb=0.
As U is compact, the Heine-Borel argument produces
a finite set S′⊂B such that for each h∈U
there is b∈S′ such that hb=0.
Let s=lcm(S). This observation applies in particular to all h∈Δ(n+s\mathbbmZ)⊆US(Δ(n))=U. That means, for each k∈\mathbbmZ there is bk∈S′ such that
bk∣n+sk. In other words: n+s\mathbbmZ⊂MS′.
The set S′ need not be primitive automatically, but we can replace it w.l.o.g. by a primitive subset without changing its set of multiples. Then,
as S′ is finite, it is taut. Denote q=gcd(n,s) and C=qn+qs⋅\mathbbmZ. Then qC=n+s\mathbbmZ⊆MS′, and as
gcd(n/q,s/q)=1, d(MC)=1 (Dirichlet, see [4, Corollary 4.24]).
Now Lemma 2.4 shows that b∣q=gcd(n,s) for some b∈S′. In particular, n∈b\mathbbmZ
and b∣s=lcm(S) for that b∈S′, so that b=gcd(b,s)∈B∩AS and
n+lcm(S)⋅\mathbbmZ⊆b\mathbbmZ⊆MB∩AS.
c) It suffices to prove that for any finite S⊂B there exists a finite S′⊂B with B∩AS′=S′. So let S⊂B and S′:=B∩AS. S′ is finite, because AS is finite, and obviously S⊆S′⊆B∩AS′. As each b′∈S′⊆AS divides lcm(S), also lcm(S′) divides lcm(S). Therefore lcm(S′)=lcm(S), so that AS′=AS.
Hence S′=B∩AS′.
Let B={b1,b2,…} be primitive, and denote S1⊂S2⊂⋯⊂B a filtration of B by finite sets Sk.
Let sk=lcm(Sk).
We can assume without loss of generality that b∣sk⇒b∈Sk holds for all b∈B and all k∈\mathbbmN.
For each k∈\mathbbmN, the collection of all cylinder sets USk(h), h∈H, can be written explicitly as
[TABLE]
Suppose first that B is not taut. Then it contains a scaled copy cA of a Behrend set A⊆{2,3,…}.
Enlarging A, if necessary, we can assume that cA=B∩c\mathbbmZ. (As B is primitive, also the enlarged A does not contain the number 1.)
Let a0>1 be the smallest element of A and denote b0=ca0. Let H0={h∈H:hb0∈c\mathbbmZ}. Then H0 is open and closed, and we will show that H0∩W=∅ but mH(H0∩W)=0, so that W is not Haar regular.
First observe that (Δ(c))b0=c∈c\mathbbmZ, so that Δ(c)∈H0. Suppose for a contradiction that H0∩W=∅. Then Δ(c)∈W, i.e. there is b∈B such that c∈b\mathbbmZ. Hence cA⊆b\mathbbmZ, so that cA={b}, because b∈B and B is primitive. Hence b=ca0=b0, so that A={a0}, a contradiction, as A is Behrend.
We turn to the proof of mH(H0∩W)=0.
Let HWℓ={n∈{0,…,sℓ−1}:USℓ(Δ(n))∩H0∩W=∅}. It suffices to show that ∑n∈HWℓmH(USℓ(Δ(n))→0 as ℓ→∞. As all cylinder sets USℓ(Δ(n)) have identical Haar measure sℓ−1, this is equivalent to #HWℓ/sℓ→0 as ℓ→∞. So let ℓ be so large that b0∈Sℓ.
Denote Aℓ={a∈A:ca∣sℓ}.
As cA⊆B, the sequence (Aℓ)ℓ is increasing and exhausts the set A.
If n∈HWℓ, then n∈c\mathbbmZ and, by Lemma 2.5a, n∈FSℓ. Hence n=cn′∈FSℓ for some n′∈\mathbbmZ. Suppose for a contradiction that n′∈MAℓ, i.e. there are k∈\mathbbmZ and a∈Aℓ such that n′=ka. Then n=kca, where ca∈B and ca∣sℓ, so that ca∈Sℓ, which contradicts n∈FSℓ. Hence n′∈FAℓ so that n∈cFAℓ=c(\mathbbmZ∖MAℓ). As A is Behrend, dˉ(\mathbbmZ∖MAℓ)→0 as ℓ→∞. Hence
[TABLE]
Suppose now that B is taut.
We must show that for any k∈\mathbbmN and U∈Zk
[TABLE]
So fix some U=USk(Δ(n)) such that mH(U∩W)=0. We have to show that U∩W=∅. Observe first that USk(Δ(m))=U if and only if m∈sk\mathbbmZ+n.
For ℓ>k let
[TABLE]
where we used Lemma 2.5c for the last equality.
Observe that
[TABLE]
Hence,
for each ℓ>k,
[TABLE]
As all U′∈Zℓ have identical Haar measure mH(U′)=sℓ−1 and as mH(U∖W)=mH(U) by assumption, it follows that
[TABLE]
so that
[TABLE]
Let q=gcd(sk,n), a′=sk/q and r′=n/q. Then gcd(a′,r′)=1 and
q\mathbbmZ∩MB=q\mathbbmZ∩Mq⋅B′(q), in particular (sk\mathbbmZ+n)∩MB=(sk\mathbbmZ+n)∩Mq⋅B′(q). Hence
[TABLE]
In view of Lemma 1.17 in [10], this suffices to conclude that
B′(q) is Behrend.
On the other hand, as B is taut,
B′(q) is pre-taut (Lemma 2.3), so that 1∈B′(q) or B′(q) is not Behrend (Lemma 2.1e). Hence 1∈B′(q).
This implies
q∈MB, which in turn implies
U∩W=USk(Δ(n))∩W=∅ (the property to be proved):
Indeed, if q∈MB, then there is some b∈B with b∣q, and as q∣sk, this implies b∣sk, so that b∈Sk. From b∣q∣n we then conclude that n∈MSk, and Lemma 2.5a
implies USk(Δ(n))∩W=∅.
It remains to show that the implication (i)⇒(iii) follows from Proposition 1.1, which will be proved in the next subsection. So let h∈W.
By the proposition there exists n∈FB such that Δ(n)∈US(h), hence Δ(n)∈US(h)∩(Δ(\mathbbmZ)∩W). As this holds for all finite S⊂B, this proves the claim.
2.3 Tautification of the set B and regularization of the window W
In [4, Section 4.2] the authors provide a construction that associates to each (non-taut) set B a taut set B′ such that
FB′⊆FB but d(FB∖FB′)=0, and such that the two Mirsky measures
νη and νη′
determined by B and B′ coincide.
B and B′ determine groups H resp. H′ with windows W resp. W′, and while the window W is not Haar regular (if B is non-taut), the window W′ is Haar regular because of Theorem A.
On the abstract level one can also pass
from the window W⊆H to its Haar regularizationWreg:=supp(mH∣W) (introduced in [14]), which also determines the same Mirsky measure on {0,1}\mathbbmZ. However, Wreg will not be a window of the particular arithmetic type defined in (2), in particular it need not be aperiodic. The construction of B′ given B in [4] suggests an obvious factor map f:H→H′, and we expect that also f(Wreg)=W′, so that in this sense the regularization of W and the tautification of B are two sides of the same medal.
The following example illustrates this discussion.
Example 2.1**.**
Let P={p1,p2,…} denote the set of primes. Let B:=⋃i≥1pi2(P∖{pi}). Note that B is primitive. It is not taut, because it contains rescalings of Behrend sets. The corresponding taut set is B′={pi2:i≥1}, which generates the square-free system. 666Note that η(n)=1 at all square-free numbers and also at pik for i≥1 and k≥2.
Given h∈W, we need to show that for each finite S⊂B
the set
[TABLE]
has asymptotic density mH(US(h)∩W)>0.
By Theorem A, the tautness assumption on B implies that W is Haar regular, so that indeed
[TABLE]
Let B={b1,b2,…} and, for K≥1, WK:={g∈H:gi=0 for i=1,…,K}. Then WK is clopen and W⊆WK. Moreover, WK⊇WK+1 and ⋂KWK=W. Fix ε>0. We now choose K≥1 so that
[TABLE]
Since US(h)∩WK is clopen (and T is strictly ergodic)
[TABLE]
for all N≥N0. Moreover, we can choose N1 so that for N≥N1, we also have
[TABLE]
Indeed, if
[TABLE]
then (by setting BK={b1,…,bK}), we have
[TABLE]
Therefore, by the Davenport-Erdös theorem [10, Eq. (0.67)], we can choose first K≥1 sufficiently large so that d(MB∖MBK)<ε and then N1 so that
[TABLE]
for all N≥N1, so in particular (13) holds.
In view of (11), (12) and (13), it follows that
[TABLE]
As Tn0=Δ(n)∈US(h)∩W if and only if n∈LS(h), this finishes the proof.
∎
Example 2.2**.**
(Δ(\mathbbmZ)∩W=W does not imply tautness)
Suppose that (mk,rk), k∈\mathbbmN, is an enumeration of all coprime pairs of natural numbers. For any k choose a prime pk∈rk+mk\mathbbmZ such that pk>2k+1. Let B=P∖{pk:k∈\mathbbmN}. Clearly B is primitive, and M{pk:k∈\mathbbmN} has upper density less than or equal to ∑k=1∞1/2k+1=1/2. Thus d(MB)=1 and B is not taut [10, Corollary 0.14].
But Δ(\mathbbmZ)∩W=W. Indeed, let h=(hb)b∈B∈W and take any finite set S⊂B. We are going to show that US(h)∩W∩Δ(\mathbbmZ)=∅. Let n∈\mathbbmZ be such that n=hb mod b for b∈S. Since h∈W, b does not divide n for any b∈S, i.e. lcm(S) and n are coprime. Then (lcm(S),n)=(mk,rk) for some k, and the prime number pk belongs to arithmetic progression rk+mk\mathbbmZ=n+lcm(S)\mathbbmZ, in other words Δ(pk)∈US(Δ(n))=US(h).
Finally, Δ(pk)∈W, because the prime number pk does not belong to B and hence also not to MB.
2.5 Xη and Xφ
The set B⊆\mathbbmN has light tails, if
[TABLE]
If B has light tails, then B is taut, but the converse doses not hold [4, Section 4.3]. Here we prove:
Proposition 2.2**.**
If B has light tails, then Xη=Xφ.
Proof.
Let H=(hk)∈H and n∈\mathbbmN. We are going to show that φ(h)[−n,n]=η[l+1,l+2n+1] for some l∈\mathbbmZ. We know that φ(h)(i)=1 if and only if hj+i is not a multiple of bj for any j∈\mathbbmN. For any i∈[−n,n] such that φ(h)(i)=0 let ki be such that bki∣hki+i.
Let K∈\mathbbmN be such that the set A:={b1,…,bK} contains bki, for i∈[−n,n] and any bk with k>K has a prime factor p>2n+1.
Since h∈H, there exists m∈Z such that
[TABLE]
for all k≤K. It follows that
[TABLE]
Indeed, if i∈suppφ(h)∩[−n,n], then hk+i is not a multiple of bk for any k∈\mathbbmN. By (15) we get that m+i is not a multiple of bk for any k≤K, that is, m+i∈FA. On the other hand, if i∈/suppφ(h)∩[−n,n], then bki∣hki+i. Since ki≤K, again by (15), we obtain bki∣m+i, that is m+i∈/FA.
By [4, Proposition 5.11] 777Assume that B⊂\mathbbmN has light tails and B(n)⊂A⊂B.
Suppose that
{k+1,…,k+n}∩MA={k+i0,k+i1,…,k+ir}
(16)
for some 1≤i0,…,ir≤n, r<n. Then the density of k′∈\mathbbmN such that
{k′+1,…,k′+n}∩MB={k′+i0,k′+i1,…,k′+ir}
is positive. (Here B(n):={b∈B:p≤n for any p∈Spec(b)}. If B is primitive, then B(n) is finite.)
there exists l∈\mathbbmZ such that
[TABLE]
It follows that φ(h)[−n,n]=η[l+1,l+2n+1].
∎
We now present a Behrend set (hence a non-taut set), for which Xη is a strict subeset of Xφ.
Example 2.3**.**
Let B={p2,p3,…}={3,5,7,11,…} - the set of all odd prime numbers. Since we are in the coprime case,
[TABLE]
Now, η=φ(Δ(0)) is the characteristic function of the B-free set {±2m:m≥0}. We compute an initial block of φ(h) for
[TABLE]
We have φ(h)(0)=0,
φ(h)(1)=1, φ(h)(2)=1, φ(h)(3)=0, φ(h)(4)=0888If we add 4 to each coordinate of h, we obtain the sequence (1,0,4,4,…), whence φ(h)(4)=0., φ(h)(5)=1, φ(h)(6)=0, φ(h)(7)=0 and φ(h)(8)=1. It follows that the block 11001001 appears on φ(h). But there is no block a of length 8 appearing on η and such that 11001001≤a. Indeed, the two neighboring 1’s at the beginning of a could only appear at the positions 1,2 or -2,-1 in η. In the both cases this would force η(5)=1, which is not true. This shows that φ(h)∈Xη, although it belongs to Xφ.999Indeed, φ(h) does not even belong to Xη, the hereditary closure of Xη, see [4].
Question 2.1**.**
If B is taut, is then Xη=Xφ? 101010We recall that in case of B taut, the Mirsky measure is supported on Xη.
3 Minimality/proximality of Xη and topological properties of W
Throughout this section we assume that B is primitive.
3.1 Arithmetic of B and topology of W, part II
Recall from (5) that AS:={gcd(b,lcm(S)):b∈B}
and FAS⊆FB
for S⊂B. If S⊆S′⊂B, then the following inclusions and implications are obvious:
[TABLE]
Let E:=⋃S⊂BFAS and observe that E⊆FB.
Lemma 3.1**.**
a)
For all S⊂B and n∈\mathbbmZ we have:
US(Δ(n))⊆W⇔n∈FAS.
2. b)
If (Sk)k is a filtration of B with finite sets and limkΔ(nSk)=h (see Remark 5.2), then h∈int(W) if and only if nSk∈FASk for some k.
3. c)
For all n∈\mathbbmZ we have:
Δ(n)∈int(W)⇔n∈E .
4. d)
int(W)=∅⇔E=∅⇔∀S⊂B:FAS=∅⇔∀S⊂B:1∈AS**
Proof.
a)
As US(Δ(n)) is clopen,
[TABLE]
That the only implication is also an equivalence is a consequence of the CRT. Indeed, if gcd(c,lcm(S))∣n,
then there exist k,l∈\mathbbmZ such that l⋅c−k⋅lcm(S)=n, thus c∣n+k⋅lcm(S).
2. b)
Assume that h∈int(W), that is US(h)⊆W for some S. Then, for k such that S⊆Sk, we have
USk(Δ(nSk))=USk(h)⊆W, which is equivalent to nSk∈FASk by a). Conversely, if nSk∈FASk then, again by a), USk(Δ(nSk))=USk(h)⊆W and h∈int(W).
3. c)
Follows from a).
4. d)
Follows from c).
∎
Recall from (6) that
A∞:={n∈\mathbbmN:∀S⊂B∃S′:S⊆S′:n∈AS′∖S′}.
Lemma 3.2**.**
a)
If (Sk)k is a filtration of B with finite sets, then
[TABLE]
2. b)
For each n∈A∞ there is
a filtration (Sk)k of B with finite sets such that
[TABLE]
Proof.
a) Assume that n∈ASk∖Sk for infinitely many k, and let S⊂B.
Then there is k such that S⊆Sk and n∈ASk∖Sk. Hence n∈A∞.
Conversely, let n∈C∞. There is a finite set S1 such that n∈AS1∖S1. Assume that we have constructed sets S1⊂S2⊂…⊂Sk with the property that n∈ASi∖Si for i=1,…,k and
{1,…,k}∩B⊂Sk. Then there is a set Sk+1 containing Sk∪{k+1} and such that n∈ASk+1∖Sk+1. In this inductive way we construct a filtration (Sk)k as required.
b) follows from a).
∎
Lemma 3.3**.**
The sets E and A∞ are related by the identity
[TABLE]
Proof.
Let n∈E and chose S such that n∈FAS. Take arbitrary b∈B and c∈A∞. There exists a finite set S′ such that
S∪{b}⊆S′ and c∈AS′∖S′. Since FAS⊆FAS′, n∈FAS′, hence neither b nor c divides n.
We have proved that E⊆FB∪A∞.
In order to prove the other inclusion assume that n∈\mathbbmN and that for any S there exists cS∈AS dividing n.
As n has only finitely many divisors, it has a divisor c such that there exists a filtration (Sk)k of B such that c∈ASk for any k∈\mathbbmN. If c∈/B, then c∈ASk∖Sk for any k∈\mathbbmN. This proves n∈/FB∪A∞.
∎
Lemma 3.4**.**
A∞=∅* if and only if E=FB.*
Proof.
If A∞=∅, then E=FB by Lemma 3.3. Conversely, assume that
E=FB. Then FB⊆FA∞ by Lemma 3.3, so that
A∞⊆MA∞⊆MB. Suppose for a contradiction that there exists some n∈A∞. Then there is b∈B such that n∈b\mathbbmZ, i.e. b∣n, and there is
a finite set S=Sk⊂B such that
n∈AS∖S, see Lemma 3.2b. Hence there exists b′∈B such that n=gcd(lcm(S),b′). It follows that b∣n∣b′, which is impossible, because B is assumed to be primitive.
∎
Proposition 3.1**.**
The following conditions are equivalent:
(i)
W=int(W)**
2. (ii)
For any filtration S0⊂S1⊂…⊂B of B with finite subsets Sk, there exists a number d such that d∈ASk∖Sk, for infinitely many k∈\mathbbmN.
3. (iii)
There exists a filtration S0⊂S1⊂…⊂B of B with finite subsets Sk and there exists a number d such that d∈ASk∖Sk, for every k∈\mathbbmN.
4. (iv)
There are d∈\mathbbmN and an infinite pairwise
coprime set A⊆\mathbbmN∖{1} such that dA⊆B.
Proof.
(i)⇒(ii): Let h=(hb)∈W∖int(W). There exists S such that US(h)∩int(W)=∅. We can assume that any b∈B such that b∣lcm(S), belongs to S.111111Otherwise we can incorporate all such b’s into S, there are finitely many of them. Let n be a number such that
[TABLE]
for b∈S.
Then Δ(n+klcm(S))∈US(h), hence Δ(n+klcm(S))∈/int(W) for any k∈\mathbbmZ. This means (see Lemma 3.1) that for any finite set T, in particular for any T=Sk, the arithmetic progression n+lcm(S)\mathbbmZ is contained in MAT. Since the set AT is finite, it follows that AT contains a divisor of gcd(n,lcm(S))121212Apply Dirichlet theorem on primes in arithmetic progressions.. There is only finitely many divisors of gcd(n,lcm(S)), hence one of them, denote it by d, appears in ASk for infinitely many k. To finish the proof it is enough to observe that d∈/B (consequently, d∈/Sk, for any k). Indeed, otherwise d∈S, by our assumption on S. Moreover, d∣n and then, by (18), d∣hb, where b=d, which leads to a contradiction with the assumption h∈W.
(ii)⇒(iii): obvious
(iii)⇒(i): Assume that d∈ASk∖Sk for any k. Then d∈/MB131313Otherwise d is divisible by some b∈B. On the other hand, d divides some b′∈B as a member of ASk, which in view of the fact that B is primitive, leads to the conclusion that d=b=b′∈B. But it is not true, since d∈/Sk for any k., hence Δ(d)∈W. We prove that Δ(d)∈/int(W). It is enough to show that US0(Δ(d))∩int(W)=∅.
Assume that h=(hb)∈US0(Δ(d))∩int(W). It means that
[TABLE]
and there exists a finite set T⊂B such that UT(h)⊂W. We can assume that T=Sk for some k.
Let m∈\mathbbmZ be such that
[TABLE]
Let c∈B be such that gcd(c,lcm(Sk))=d. Clearly, c∈/Sk, since d∈/B. Since USk(h)⊂W, it follows
that there exists b∈Sk such that
[TABLE]
Indeed, otherwise there would exist l∈\mathbbmZ such that l≡hb mod b for b∈Sk and l=0 mod c, hence Δ(l)∈USk(h), but Δ(l)∈/W, a contradiction.
Thus, in view of (20),
Now, (23), (24) and (25) imply gcd(c,b)∣m, a contradiction with (22).
(iii)⇒(iv): Assume that d∈ASk∖Sk for any k. Then
[TABLE]
As d∈Sk, we have bk=d for all k.
We choose a subsequence bk1,bk2,… of (bk)k in the following way: Let k1=1, and given k1,…,kj, let
[TABLE]
Let aj=bkj/d for all j∈\mathbbmN and denote A={aj:j∈\mathbbmN}.
Then A⊆\mathbbmN and dA⊆B by construction.
Suppose that 1∈A. Then d∈B, a contradiction to
(26), as B is primitive. Hence A⊆\mathbbmN∖{1}.
It remains to prove that
A is pairwise coprime.
Suppose for a contradiction that there is a prime number p dividing some ai and aj, i<j. Then pd∣bki and pd∣bkj.
As bki∈Skj, it follows that pd∣lcm(Skj), so that pd∣gcd(bkj,lcm(Skj))=d (see (26)), which is impossible.
(iv)⇒(iii): Let d∈\mathbbmN and A={a1<a2<…} be as in (iv). Then d∈B, because B is primitive.
For k∈\mathbbmN let Sk=B∩{1,…,k}∪{dak}. As all aj are pairwise coprime, there are j1<j2<⋯∈\mathbbmN such that ajk is coprime to lcm(Sk). On the other hand, d∣lcm(Sk). Hence d=gcd(dajk,lcm(Sk))∈ASk. As d∈B, we see that d∈ASk∖Sk for all k∈\mathbbmN.
∎
Proposition 3.2**.**
The following conditions are equivalent:
(i)
W* is topologically regular, i.e. W=int(W).*
2. (ii)
There are no d∈\mathbbmN and no infinite pairwise
coprime set A⊆\mathbbmN∖{1} such that dA⊆B.
3. (iii)
A∞=∅.
4. (iv)
E=FB.
Proof.
The equivalence of (i) and (ii) follows from Proposition 3.1,
that of (iii) and (iv) from Lemma 3.4..
In view of Lemma 3.2,
Proposition 3.1 finally implies the equivalence of (i) and (iii), too.
∎
Lemma 3.5**.**
Δ(\mathbbmZ)∩(int(W)∖int(W))=∅.
Proof.
Assume Δ(m)∈int(W)∖int(W). Then for any S⊂B there exists nS∈\mathbbmZ such that Δ(nS)∈US(Δ(m))∩int(W). It means that for any S there exist: a finite set TS⊂B, (we can assume that S⊂TS), bS∈B and nS∈\mathbbmZ such that (see Lemma 3.1 c)):
∙
lcm(S)∣m−ns (that is, Δ(ns)∈US(Δ(m)))
2. ∙
gcd(bS,lcm(TS)) does not divide nS (Δ(nS) is chosen to be an element of US(Δ(m))∩int(W))
3. ∙
gcd(bS,lcm(TS))∣m (since Δ(m)∈/int(W))
Then gcd(bS,lcm(TS)) does not divide lcm(S).
Let us iterate: S0 is arbitrary and Sk+1:=TSk, ck:=lcm(Sk+1), dk:=gcd(bSk,lcm(Sk+1)).
We have:
∙
ck∣ck+1
2. ∙
dk∣m
3. ∙
dk∣ck
4. ∙
dk does not divide ck−1
Since dk∣m for every k, the sequence (lcm(d1,…dk))k stabilizes on lcm(d1,…dk0) for some k0, which means dl divides lcm(d1,…dk0), and consequently dl divides lcm(c1,…,ck0)=ck0, for any l, a contradiction.
∎
For x∈{0,1}\mathbbmZ denote suppx:={n∈\mathbbmZ:x(n)=1}. Following [4] we consider the set
[TABLE]
As suppη=FB is disjoint from b\mathbbmZ for all b∈B, we have
[TABLE]
Lemma 3.6**.**
If Δ(\mathbbmZ)∩W=W, then η∈Y.
Proof.
For b∈B and r∈{0,…,b−1} let Vb(r):={h∈H:hb=r} and observe that these sets are open and closed in H.
Hence Δ(\mathbbmZ)∩Vb(r)∩W=Vb(r)∩W, because Δ(\mathbbmZ)∩W=W.
Suppose for a contradiction that η∈Y. Then (27) implies
that there are b∈B and r∈{1,…,b−1} such that
[TABLE]
which implies that also Vb(r)∩W=∅. Hence
[TABLE]
and as Vb(r) is compact and the Vb′(0) are open, there is a finite S⊂B such that
[TABLE]
In other words, whenever hb=r for some h∈H, then hb′=0 for some b′∈S.
Applied to any h=Δ(n) this yields:
[TABLE]
Since r is not divisible by b, we can assume that b∈/S.
Let q=gcd(b,r), b~=b/q, r~=r/q. Then q(b~\mathbbmZ+r~)=b\mathbbmZ+r⊆MS, so that Mb~\mathbbmZ+r~⊆MS′(q) by Lemma 2.2. But d(Mb~\mathbbmZ+r~)=1 by Dirichlet’s theorem, whereas d(MS′(q))<1, because S′(q)⊆{1,…,maxS} is finite and 1∈/S′(q) 141414As q∣b and B is primitive, q∈/S, thus 1∈/S′(q).. This is a contradiction.
∎
Remark 3.1**.**
Together with Theorem A this shows that
η∈Y whenever B is taut. This implication was proved previously in [4, Corollary 4.27].
The reverse implication does not hold, as is shown by the next example.
Example 3.1**.**
Observe that for every k∈\mathbbmZ there exists a prime divisor pk of 5+12k such that
[TABLE]
Let
[TABLE]
Let us enumerate the elements of B as b0,b1,b2,… and b0=4,b1=6.
Observe that
[TABLE]
Since niether 2 nor 3 divides an element of the progression 5+12\mathbbmZ, in view of (28) we see that 1,2,3,11,22∈FB. It follows that
[TABLE]
We claim that
[TABLE]
It is clear that gcd(12,bk)=1 for any k≥2. Let k≥2 and take arbitrary r∈{1,…,bk−1}. There exists r′∈\mathbbmZ such that
[TABLE]
Then gcd(12bk,r′)=1 and, by Dirichlet Theorem, there exists a prime number q of the form q=12bkl+r′ for some l∈\mathbbmZ. Since, by (32), q≡1 mod 12, q∈FB by (28). Moreover, q≡r mod bk by (32).
Thus the claim (31) follows. Clearly, (31) and (30) yield η∈Y.
We shall construct h∈W such that h∈/Δ(\mathbbmZ)∩W. We denote Sk={b0,b1,…bk}. Inductively we construct a sequence (nSk) of integers satisfying:
a)
nS1=5
2. b)
lcm(Sk)∣nSk+1−nSk for k=1,2,…
3. c)
nSk∈FSk for k=1,2,…
Assume that nS1,…,nSk have been constructed. If bk+1 does not divide nSk, we set nSk+1=nSk. Otherwise we set
nSk+1=nSk+lcm(Sk). The conditions a), b), c) follow easily by induction.
Let
[TABLE]
Thanks to c), h∈W.
But
[TABLE]
the last equality by (29). (Clearly, d(MB)=1 and B is not taut.)
151515The authors are indebted to A. Bartnicka for pointing out and proving this lemma.
If B is primitive and η is a Toeplitz sequence, then B is taut.
Proof.
Suppose that B is not taut. Then there are c∈\mathbbmN and a Behrend set A such that cA⊆B. Hence
[TABLE]
because MA has density one. As B is primitive, c must be B-free.
So η(c)=1, and (since η is Toeplitz) there exists m∈\mathbbmN such that c+m\mathbbmZ⊆FB.
But then
Assume that η∈Y. If η=\mathbbm1FB is almost periodic (i.e. if the orbit closure of η is minimal), then
Xη⊆Y.
Proof.
Fix k≥1. Since η∈Y, the support of η taken mod bk misses exactly one residue class mod bk (that is, it misses zero). Let B be a block on η such that its support mod bk misses exactly one residue class mod bk. Since η is almost periodic, the block B appears on η with bounded gaps. It follows that if C is any sufficiently long block that appears on η, its support misses exactly one residue class. Clearly this property passes to limits in the product topology, so each y=limSmiη is also in Y.
∎
In general, we can define a map θ:Y→∏k≥1\mathbbmZ/bk\mathbbmZ by setting
By the definitions of φ and θ, we have θ∘φ(h)=h provided φ(h)∈Y. In particular, θ(η)=0 and θ is continuous at η. Moreover, θ is equivariant.
For any map ψ:X→Y denote by Cψ⊆X the set of continuity points of this map.
Lemma 3.9**.**
Let (X,S) and (Y,T) be compact dynamical systems and assume that (X,S) is minimal. Let ψ:X→Y be a map satisfying ψ∘S=T∘ψ. Then ψ(Cψ) is a minimal subset of Y.
Proof.
Denote by Z:={(x,ψ(x)):x∈X} the closure of the graph of ψ and note that a fibre Zx={(x,y):y∈Z} is a singleton, if and only if x∈Cψ. Let Z0:={(x,ψ(x)):x∈Cψ}. We claim that Z0⊆A whenever A is a non-empty closed S×T-invariant subset of Z. Indeed, πX(A) is a non-empty closed S-invariant subset of X, so πX(A)=X by minimality of (X,S). In particular, Cψ⊆πX(A). As all Ax⊆Zx with x∈Cψ are singletons, {(x,ψ(x)):x∈Cψ}⊆A. Hence also Z0⊆A.
This shows that Z0 is a minimal subset of X×Y (and, by the way, that it is the only minimal subset of Z). It follows that πY(Z0) is a minimal subset of Y, and so it remains to show that ψ(Cψ)⊆πY(Z0). But, for x∈Cψ, (x,ψ(x))∈Z0, and so ψ(x)∈πY(Z0).
∎
Denote by Cφ the set of all points in H at which φ:H→{0,1}\mathbbmZ is continuous.
Lemma 3.10**.**
a)
Cφ={h∈H:(h+Δ(\mathbbmZ))∩∂W=∅}.
2. b)
Cφ+Δ(1)=Cφ.
3. c)
φ(Cφ)* is the unique minimal subset M.*
Proof.
a) This is proved by direct inspection, see e.g. [13, Lemma 6.1].
We start with a list of implications, which, when suitably combined, prove the assertions a) - e) of Theorem B.
Most of these implications can be proved without assuming that B is primitive and that Δ(\mathbbmZ)∩W=W.
Therefore we indicate explicitly, for which implications we use these extra assumptions.
Proof of the equivalence of B1 – B4:
These equivalences follow from Proposition 3.2.
Proof of B1 ⇒ B6:
Observe first that 0∈H belongs to Cφ if and only if Δ(\mathbbmZ)∩∂W=∅, see Lemma 3.10. But Δ(\mathbbmZ)∩∂W=Δ(\mathbbmZ)∩(int(W)∖int(W)) in view of B1, and this intersection is empty by Lemma 3.5. As int(W)=∅ and as H=Δ(\mathbbmZ), Δ(\mathbbmZ)∩W=∅ and hence φ(0)=(…,0,0,0,…).
Proof of B6 ⇒ B5:
Let B={b1,b2,…} and assume (B6) that 0∈Cφ,
i.e. Δ(\mathbbmZ)∩∂W=∅, and η=(…,0,0,0,…).
Now, take n∈\mathbbmZ. Either n∈MB - then η(n)=0, so bs∣n for some s≥1 and η(n+jbs)=0 for each j∈\mathbbmZ. Or
n∈FB, i.e. Δ(n)∈W. As Δ(\mathbbmZ)∩∂W=∅ by assumption, this implies Δ(n)∈int(W), so that n∈E=⋃S⊂BFAS by Lemma 3.1. Hence there is a finite subset S⊂B such that n∈FAS. As lcm(AS)=lcm(S), this implies
[TABLE]
Hence η(n+jlcm(S))=1 for each j∈\mathbbmZ. This proves that η is a Toeplitz sequence
different from (…,0,0,0,…).
Proof of B5 ⇒ B1:
Assume that η is a Toeplitz sequence. Then B is taut by Lemma 3.7, hence Δ(\mathbbmZ)∩W=W by Theorem A. Now B1 follows from the chain of the next three implications.
Proof of B5 ⇒ B8:
Each Toeplitz sequence is almost periodic [8], [12, Theorem 4], i.e. its orbit closure is minimal.
Proof of B8 ⇒ B7:
If Xη=M, then η∈M, and η=(…,0,0,0,…), because otherwise the minimality of Xη implies Xη={(…,0,0,0,…)}, contradicting card(Xη)>1.
Proof of B7 ⇒ B1 (assuming that Δ(\mathbbmZ)∩W=W):
Assume that (…,0,0,0,…)=η∈M=φ(Cφ).
Then M=Xη⊆Y by Lemma 3.8, and
there is a sequence h1,h2,⋯∈Cφ such that η=limi→∞φ(hi). Consider n∈\mathbbmZ with
Δ(n)∈W, i.e. such that η(n)=1. In particular η=φ(0)=(…,0,0,0,…). Corollary 3.1 implies
limi→∞hi=limi→∞θ(φ(hi))=θ(η)=0. Then
1=η(n)=limi→∞φ(hi)(n), i.e. hi+Δ(n)∈W for all sufficiently large i. As hi∈Cφ, we have hi+Δ(\mathbbmZ)∩∂W=∅ (Lemma 3.10). Hence
hi+Δ(n)∈int(W) for all sufficiently large i, what implies
that Δ(n)=limi→∞hi+Δ(n)∈int(W).
This proves that Δ(\mathbbmZ)∩W⊆int(W).
Hence
W=Δ(\mathbbmZ)∩W⊆int(W), i.e. W is topologically regular.
Proof of B7 ⇒ B8:
As η∈M, also Xη⊆M, and hence Xη=M. As η=(…,0,0,0,…), Xη contains no fixed point. Hence card(Xη)>1.
Proof of B1 ⇒ B9 (assuming that B is primitive):
The window W is aperiodic because of Proposition 5.1, and it is topologically regular by B1. As B1 ⇒ B8, Xη is minimal. Therefore Corollary 1a) of [13], together with Lemmas 4.5 and 4.6 of the same reference, implies B9.
Proof of B9 ⇒ B8:
This is trivial.
∎
Proposition 3.3**.**
Assume that the window W is topologically regular. Then Xη⊆Y.
Proof.
We start proving that η∈Y. Assume
the contrary, that is, there are b0∈B and r∈{1,…,b0−1} such that
[TABLE]
Let a=gcd(r,b0) and r′=r/a, b0′=b0/a.
(34) yields that for any k∈\mathbbmN there exists bk∈B such that
[TABLE]
Let J={k∈\mathbbmN:r′+kb0′is prime}. By Dirichlet Theorem the set J is infinite. As B is primitive, bk does not divide a=gcd(r,b0). Hence
[TABLE]
for any k∈J.
Since a has only finitely many divisors, there exists a divisor a′ such that
[TABLE]
for infinitely many k∈J. Thus we obtain a contradiction with the condition (B4) of Theorem B, which is equivalent to (B1) W=intW. Thus η∈Y.
Assume now that x∈Xη and let b∈B.
As η∈Y, there is Nb∈\mathbbmN such that card(supp(η∣[0:Nb]) mod b)=b−1. As Xη is minimal by (B8) of Theorem B, there is
n∈\mathbbmN such that supp(x∣[n:n+Nb])=supp(η∣[0:Nb]). Hence
[TABLE]
so that x∈Y, because card(supp(x) mod b)⩽b−1 for all x∈Xη, see Footnote 4 to Remark 1.5.
∎
The equivalence of C1, C2 and C3 follows from
Lemma 3.1.
If C1 holds, i.e. if int(W)=∅, then φ(Cφ)={(…,0,0,0,…)} is a shift invariant set [13, Proposition 3.3d with Remark 3.2b], so that M=φ(Cφ)={(…,0,0,0,…)}. This is C6, and Theorem 3.8 in [4] shows that C4, C5, C6 and C7 are all equivalent.
We finish by proving C5 ⇒ C3: Consider any finite S⊂B. As B⊆MAS by definition of the set AS, C5 implies that 1∈AS.
4 The sequence B and Haar measure
4.1 Measure and density
Lemma 4.1**.**
mH(W)=1−d(MB)=dˉ(FB).
Proof.
For S⊂B denote by
US
the family of all sets US(Δ(n)) that are contained in Wc and by ∪US the union of these sets. Then
[4, Theorem 4.1]*
B is a Besicovich sequence
if and only if FB is generic for the Mirsky measure.
(As n∈FB iff Δ(n)∈W, it would be more precise to say that the sequence (Δ(n))n is generic for the Mirsky measure.)*
Proof.
If B is Besicovich, then d(FB)=mH(W), so that FB has maximal density. Hence it is generic for the Mirsky measure, see [13, Theorem 5b]. On the other hand, if FB is generic for (any) measure, then its frequency of ones converges in particular, which means that its asymptotic density exists.
∎
Lemma 4.2**.**
mH(int(W))=supSd(FAS)⩽d(E)**
Proof.
For S⊂B denote by
USo
the family of all sets US(Δ(n)) that are contained in int(W) and by ∪USo the union of these sets.
Recall from Lemma 3.1a that
#USo=#(FAS∩{1,…,lcm(S)}).
Then
[TABLE]
∎
Lemma 4.3**.**
mH(∂W)=infSdˉ(MAS∖MB)⩽infSd(MAS∖B).
Proof.
[TABLE]
∎
4.2 Regular Toeplitz sequences
Let B={b1,b2,…}. For each k≥1, consider the sequence
[TABLE]
where
[TABLE]
Then:
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Moreover, following Lemma 2.5c, there is an increasing sequence (kn) such that
[TABLE]
We assume that W⊂H is topologically regular, so by Remark 1.3, η=\mathbbm1FB is a Toeplitz sequence. We set sk:=lcm(b1,…,bk) and would like now to examine the sequence (sk) as a periodic structure of η. More precisely, we would like to see for how many n∈[1,sk], we have η(n)=η(n+jsk) for each j∈\mathbbmZ. We call any such n to be “good”. Now, if n∈FA{b1,…,bk}, then
n+sk\mathbbmZ⊂FA{b1,…,bk}, so n is good. Otherwise, n∈MA{b1,…,bk}. Then either
n∈Mb1,…,bk and then clearly η(n+jsk)=0 for each j∈\mathbbmZ, so again n is good, or
[TABLE]
Only for such n, we are not sure that n is good. Moreover, note that in view of (4.2), we have
[TABLE]
so the sequence (d(M{ck+i(k):i≥1}))k is decreasing, and so is the sequence (d(M{ck+i(k):i≥1}∖MB)).
Therefore, by taking into account (35), the infimum of this sequence is equal to the liminf, in fact to the limit and we have
[TABLE]
Definition 4.1**.**
Let
η=\mathbbm1FB be a Toeplitz sequence.
It is a regular Toeplitz sequence for the periodic structure (sk), sk=lcm(b1,…,bk), if the liminf in (36) is zero.
Now, using Lemma 4.3, the identity in (36) shows the following result.
Proposition 4.1**.**
If W is topologically regular, then η=\mathbbm1FB is a regular Toeplitz sequence for the periodic structure (sk), sk=lcm(b1,…,bk), if and only if mH(∂W)=0.
Example 4.1**.**
Assume that {bk′:k≥1} is a coprime set of odd numbers and let bk=2kbk′. Then ck+i(k)=2k for each i≥1.
Hence, we have even d(M{ck+i(k):i≥1})→0,
in particular η is a regular Toeplitz sequence for the periodic structure (sk) with
sk=2kb1′⋯bk′.
This example comes from [4].
We will now show that we can obtain Toeplitz sequences also in case mH(∂W)>0.
Example 4.2**.**
We will construct B={b1,b2,…} such that this set is thin (hence taut) and
that
limk→∞inf({ck+i(k):i≥1}∖{b1,…,bk})=∞, which, by Proposition 3.2, implies that W is topologically regular (and hence η is Toeplitz by Remark 1.3). Let δk>0 and ∑k≥1δk<1/16.
We start with b1=23 and set c1+i(1)=2 for each i≥1. Suppose that
a sequence
[TABLE]
has been defined. We require that this sequence satisfies:
[TABLE]
[TABLE]
[TABLE]
We will now show how to define ck+2(k+1), ck+3(k+1), … and then bk+1.
Recall an elementary lemma.
Lemma 4.4**.**
Let F1,F2 be finite sets of natural numbers such that gcd(f1,f2)=1 for each fi∈Fi, i=1,2.
Then d(MF1⋅F2)=d(MF1∩MF2)=d(MF1)d(MF2).
Choose P⊂P∖spec{b1,…,bk}, so that (by Lemma 4.4)
for each j=0,1,…
If 2∈/{i≥2:ck+i(k)=ck+1(k)} then repeat the same construction with the set
{i≥2:ck+i(k)=ck+2(k)}. Since (by (4.2)) the set {ck+i(k):i≥1} is finite, our construction of the sequence (ck+1+i(k+1))i is done in finitely many steps. Finally, we set bk+1:=ck+1(k)∏q∈Pq (or, if needed, bk+1:=ck+1(k)∏q∈Pqαk+1 for any αk+1∈\mathbbmN). Note that
[TABLE]
since P∩{b1,…,bk}=∅. More than that, by the construction, we also have
[TABLE]
Moreover, it is not hard to see that the new sequence
[TABLE]
satisfies (4.2)-(4.2). Furthermore, B={b1,b2,…} satisfies the other requirements mentioned at the beginning of the construction so that η is a Toeplitz sequence and W is topologically regular. Note that in our construction
d(M{c1+i(1):i≥1})=1/2. Moreover, by (4.2)
[TABLE]
for each k≥1. Finally notice that d(MB)≤∑k≥11/bk, which (by construction) can be made smaller than 1/8.
It follows that limk→∞d(MA{b1,…,bk}∖MB)>0, whence mH(∂W)>0.
5 The maximal equicontinuous factor of Xη
5.1 The period groups of W and of int(W)
Given a subset A⊆H, denote by
[TABLE]
the period group of A. The set A⊆H is topologically aperiodic, if HA={0}.
The following simple observations are proved in [14, Lemma 6.1]:
•
HA⊆HAˉ∩Hint(A).
•
If A is closed, then Hint(A)=Hint(A) is closed.
Proposition 5.1**.**
Assume that B is primitive. Then the window W is topologically aperiodic.
Proof.
Suppose that h=(hb)b∈B=0 and
[TABLE]
Since h=0, there is b∈B such that b does not divide hb. Let n:=gcd(b,hb).
Then n∈FB, as otherwise there exists b′∈B such that b′∣n; but then b′∣b a contradiction (B is assumed to be primitive). Hence Δ(n)∈W. There are x,y∈\mathbbmZ such that n=xhb+yb, whence b∣n−xhb. It follows that
Δ(n)−xh∈/W, a contradiction with (37).
∎
If W is topologically regular, then clearly int(W) is topologically aperiodic, as well. Otherwise Hint(W) may be non-trivial, as we will see in the course of this section.
If Aprim is finite, then MA is a union of finitely many arithmetic progressions. Let cA denote the period of MA, that is, the least natural number such that cA+MA=MA.
Lemma 5.1**.**
Assume that A,B⊂\mathbbmN are finite
a)
If c+MA=MA for some c∈\mathbbmN, then lcm(Aprim)∣c.
2. b)
cA=lcm(Aprim)**
3. c)
if A⊂MB then cB∣cA
Proof.
a)
For any a∈Aprim we have a+c\mathbbmZ⊆MAprim, from which it follows that
there exists a′∈Aprim such that a′∣gcd(a,c). But, as Aprim is primitive, that means that a′=a and a∣c. We conclude that lcm(Aprim)∣c.
2. b)
Clearly MA+lcm(Aprim)=MA, thus cA∣lcm(Aprim) and the assertion follows from a).
3. c)
If A⊂MB then Aprim⊂MBprim, hence lcm(Bprim)∣lcm(Aprim), and we finish by b).
∎
Lemma 5.2**.**
Assume that S⊆S′ are finite subsets of B, then AS={gcd(a,lcm(S)):a∈AS′}.
Proof.
Since lcm(S)∣lcm(S′), gcd(b,lcm(S))=gcd(gcd(b,lcm(S′)),lcm(S)) for any b∈B and the assertion follows.
∎
Let S1⊂S2⊂…⊂Sk⊂… be a filtration of B with finite sets and denote
[TABLE]
By Lemma 5.1 c) we have cl∣cl+1 for any l. It follows that, for any k, the sequence (gcd(sk,cl))l≥1 stabilizes on a
divisor dk of sk.
Clearly, since ck∣sk,
[TABLE]
Observe that
[TABLE]
Indeed, there is l0∈\mathbbmN such that dk+1=gcd(sk+1,cl) for all l>l0. Since sk∣sk+1,
we get
[TABLE]
It follows that gcd(sk,cl)=gcd(sk,dk+1) for l>l0, and (39) follows.
For j=0, (43) follows from (41), because ck∣sk.
So suppose that (43) holds for some j⩾0. Then
[TABLE]
Hence nk=0 mod gcd(sk,sk+1,ck+1+j)=gcd(sk,ck+j+1) for all k∈\mathbbmN,
i.e. (43) for j+1.
∎
Recall that Hint(W)={h∈H:int(W)+h=int(W)} denotes the period group of int(W).
Proposition 5.2**.**
a)
h∈Hint(W)* if and only if h=limkΔ(nk) for some sequence
(nk)k satisfying*
[TABLE]
Moreover, sequences (nk)k can be defined inductively: For n1 there are s1/d1 choices and, given n1,…,nk, there are precisely sk+1/lcm(sk,dk+1) many choices for nk+1.
2. b)
Hint(W)={0}* if and only if sk=dk for all k∈\mathbbmN.*
a) For each Sk denote by Wk:=⋃n∈FASkUSk(Δ(n)). Then int(W) is the increasing union of the sets Wk, see Lemma 3.1,
and USk(Δ(n))⊆Wk if and only if
USk(Δ(n))⊆int(W).
Let h=limkΔ(nk), where nk stands for nSk, which was defined in Lemma 3.1b. Then
[TABLE]
and
h∈Hint(W), if and only if
[TABLE]
Indeed, let k∈\mathbbmN, m∈FASk, and let g=(gb)b∈B be any element from USk(Δ(m))⊆int(W). Then gb=m mod b for all b∈Sk. Assume now that h∈Hint(W). Then g+h∈int(W) and
(g+h)b=m+nk mod b for all b∈Sk, so that g+h∈USk(Δ(m+nk)).
Hence USk(Δ(m))+h⊆USk(Δ(m+nk))=USk(Δ(m))+Δ(nk). In particular, USk(Δ(m)) and USk(Δ(m+nk)) have identical Haar measure, and so do USk(Δ(m))+h and USk(Δ(m+nk)). As both are open sets and one is contained in the other, they must coincide.
Hence USk(Δ(m+nk))=USk(Δ(m))+h⊆int(W)+h=int(W), so that m+nk∈FASk. This proves that FASk+nk⊆FASk. As ASk is a finite set, this implies FASk+nk=FASk.
Conversely, assume that (46)
holds, and let USk(Δ(m))⊆int(W).
Recall that this implies USk(Δ(m))⊆Wk, i.e. m∈FASk.
Hence, by assumption, also m+nk∈FASk, so that USk(Δ(m+nk))⊆Wk⊆int(W).
Let g∈USk(Δ(m)). Then gb=m mod b for all b∈Sk, so that
(g+h)b=m+nk mod b for all b∈Sk, i.e. g+h∈USk(Δ(m+nk)).
Hence USk(Δ(m))+h⊆USk(Δ(m+nk))⊆int(W).
As this argument applies to all k and all USk(Δ(m))⊆int(W),
it proves that int(W)+h⊆int(W).
The same Haar measure argument as before, applied to the open set int(W), shows that int(W)+h=int(W), i.e. h∈Hint(W).
Now we describe all sequences (nk)k∈\mathbbmN which satisfy(44) and nk∈{0,…,sk−1} for all k. Denote qk:=sk/dk.
n1:
Let n1=m1d1 for any m1∈{0,…,q1−1}.
2. n2:
n2 must be chosen such that n2=0 mod d2 and n2=n1 mod s1.
As gcd(s1,d2)=d1∣n1 in view of (39), the CRT guarantees the existence of at least one solution n2, and if n2 is one particular solution, then the set of all solutions is precisely n2+lcm(s1,d2)⋅\mathbbmZ. As n2 is to be chosen in {0,…,s2−1}, there are exactly s2/lcm(s1,d2) possible choices for n2.
3. ⋮
4. nk+1:
nk+1 must be chosen such that nk+1=0 mod dk+1 and nk+1=nk mod sk.
As gcd(sk,dk+1)=dk∣nk in view of (39), the CRT guarantees the existence of at least one solution nk+1, and if nk+1 is one particular solution, then the set of all solutions is precisely nk+1+lcm(sk,dk+1)⋅\mathbbmZ. As nk+1 is to be chosen in {0,…,sk+1−1}, there are exactly sk+1/lcm(sk,dk+1) possible choices for nk+1.
b) Hint(W)={0}⇔ there is unique choice of the numbers nk described in a) ⇔s1/d1=1 and sk+1/lcm(sk,dk+1)=1 for any k⇔dk=sk for any k, the last equivalence by Remark 5.1.
∎
If (Sk)k is a filtration of B by finite sets and if h=(hb)b∈B∈H, then we write limkΔ(nSk)=h, whenever nSk∈\mathbbmZ are numbers such that for every k∈\mathbbmN:
[TABLE]
Let us denote sk=lcm(Sk). There is an inverse system of groups
[TABLE]
The homomorphisms are the canonical projections. Observe that sk∣nSk+1−nSk for any k and the sequence (nSk+sk\mathbbmZ)k is an element of the inverse limit
←lim\mathbbmZ/sk\mathbbmZ. In this way we obtain an isomorphism of topological groups
[TABLE]
given by (nSk+sk\mathbbmZ)k↦limkΔ(nSk). Compare Remark 2.32 [4]. In particular, the inverse limit does not depend on the filtration (Sk)k.161616The last statement follows from a general property of inverse limits: the inverse limits of cofinal inverse systems are isomorphic, [9, Chapter II, Section 12].
Let βk:\mathbbmZ/sk\mathbbmZ→\mathbbmZ/dk\mathbbmZ be the map given by n+sk\mathbbmZ↦n+dk\mathbbmZ, let Mk be the kernel of βk and let αk:Mk→\mathbbmZ/sk\mathbbmZ be the canonical embedding.
There is a commutative diagram of abelian groups
[TABLE]
where fk(n+sk\mathbbmZ)=n+sk−1\mathbbmZ, fk′ is the restriction of fk to Mk and fk′′(n+dk\mathbbmZ)=n+dk−1\mathbbmZ.
The columns of the diagram are exact sequences of groups, in other words, the diagram can be interpreted as an exact sequence of inverse systems of abelian groups.
Since inverse limit is a left exact functor, see [9, Chapter II, Theorem 12.3], we obtain an exact sequence
[TABLE]
The condition (39) yields that the homomorphism γ in (50) is surjective, thus we have an exact sequence
[TABLE]
Indeed, let (nk+dk\mathbbmZ)k∈←lim\mathbbmZ/dk\mathbbmZ. By induction we construct the numbers m1,m2,… such that dk∣mk−nk and sk∣mk+1−mk, for any k. Then β((mk+sk\mathbbmZ)k)=(nk+dk\mathbbmZ)k. We set m1=n1. Assume that m1,…mk have been defined. Since dk∣nk+1−nk, dk∣mk−nk and gcd(dk+1,sk)=dk, there exists integers x,y such that xdk+1+ysk=mk−nk+1. We set mk+1=mk−ysk.
There are group isomorphisms gk:\mathbbmZ/dksk\mathbbmZ→Mk given by gk(n+dksk\mathbbmZ)=dkn+sk\mathbbmZ and making the following diagram commutative
[TABLE]
(the arrows in the upper row represent the canonical projections). It follows that there is an isomorphism
[TABLE]
By Proposition 5.2 a) it follows that ←limMk is isomorphic to Hint(W). There is an isomorphism given by σα, where σ is the isomorphism defined in Remark 5.2.
Now a), b) and c) follow from (51), (52) and Remark 5.2. In order to prove d) it is enough to note that sk=dk if and only if sk∣ck+j for some j≥0.
∎
This is an immediate corollary to Proposition 1.3.
∎
5.3 Examples
Remark 5.3**.**
Given a prime number p and m∈\mathbbmZ we denote by vp(m) be the p-valuation of m, that is, if m=0 then vp(m) is the maximal integer such that pvp(m)∣m and vp(0)=+∞. Assume that t=(tk) is a sequence of natural numbers such that tk∣tk+1 for any k. Set vp(t)=supkvp(tk). The sequence t yields an inverse system of abelian groups
[TABLE]
where the arrows represent the canonical projections n+tk+1\mathbbmZ↦n+tk\mathbbmZ.
The inverse limit ←lim\mathbbmZ/tk\mathbbmZ of this system is isomorphic to the group
[TABLE]
where Gp=\mathbbmZ/pvp(t)\mathbbmZ if vp(t)<+∞ and Gp=\mathbbmZp (the group of p-adic numbers) otherwise, i.e. when limkvp(tk)=+∞.
Our first exaxmple has a finite, non-trivial maximal equicontinuous factor and a finite set A∞.
Example 5.1**.**
B={36}∪{2p1,2p2,…}∪{3q1,3q2,…}, where p1,q1,p2,q2,… are pairwise different primes.
Let Sk={36,2p1,…,2pk,3q1,…,3qk}. Then
[TABLE]
so that
[TABLE]
In particular, the maximal equicontinuous factor of Xη is the translation by 1 on \mathbbmZ/6\mathbbmZ. Moreover, A∞={2,3}, so that ∅=int(W)=W
by Theorems B and C.
Our next example has an infinite maximal equicontinuous factor different from H and an infinite set A∞.
Example 5.2**.**
Let p1,q1,p2,q2,… be pairwise different primes. Let
[TABLE]
where
[TABLE]
That is,
[TABLE]
for k≥2.
Let Sk=B1∪…∪Bk. Then sk=lcm(Sk)=p1p22…pk2q1q22…qk2 and
[TABLE]
so that
[TABLE]
Hence
[TABLE]
so that
[TABLE]
Hence Hint(W)≅∏i=2+∞\mathbbmZ/piqi\mathbbmZ and H/Hint(W)≅∏i=1+∞\mathbbmZ/piqi\mathbbmZ are infinite compact groups.
Moreover,
[TABLE]
is infinite and does not contain the number 1, thus ∅=int(W)=W by Theorems B and C.
We end with a non-trivial example where the maximal equicontinuous factor equals H and A∞ is an infinite set.
Example 5.3**.**
Let q,p1,p2,… be pairwise different odd primes. Let
[TABLE]
where
[TABLE]
That is,
[TABLE]
for k≥1.
Let Sk=B1∪…∪Bk. Then sk=lcm(Sk)=qp1…pk and
[TABLE]
hence cASk=qp1…pk=lcm(Sk),
so that sk=ck=dk for all k. In particular
int(W) is aperiodic by Proposition 5.2.
Moreover,
[TABLE]
is infinite and does not contain the number 1, thus ∅=int(W)=W
by Theorems B and C.
Bibliography16
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] H. Abdalaoui, M. Lemańczyk, T. de la Rue, A dynamical point of view on the set of ℬ ℬ \mathcal{B} -free integers , International Mathematics Research Notices 16 (2015), 7258-7286.
2[2] M. Baake and C. Huck. Ergodic properties of visible lattice points . Proc. Steklov Inst. Math. 288 (2015), 165–188.
3[3] M. Baake, C. Huck, and N. Strungaru. On weak model sets of extremal density . Preprint (2015) ar Xiv:1512.07129 v 2, Indagationes Mathematicae (in press).
4[4] A. Bartnicka, S. Kasjan, J. Kułaga-Przymus, and M. Lemańczyk. ℬ ℬ {{\mathcal{B}}} -free sets and dynamics . Preprint (2015) Ar Xiv 1509.08010. To appear in Trans. Amer. Math. Soc.
5[5] F.A. Behrend. Generalization of an inequality of Heilbronn and Rohrbach. Bull. Amer. Math. Soc. 54 (1948), 681–684.
6[6] H. Davenport and P. Erdös. On sequences of positive integers. Acta Arithmetica 2 (1936), 147–151.
7[7] H. Davenport and P. Erdös. On sequences of positive integers. J. Indian Math. soc. (N.S.) 15 (1951), 19–24.
8[8] T. Downarowicz, Survey of odometers and Toeplitz flows , Contemporary Mathematics, Algebraic and Topological Dynamics (Kolyada, Manin, Ward eds.), vol. 385, 2005, pp. 7-38.