On minimal additive complements of integers
Sándor Z. Kiss,1111
Email: [email protected]. This research was supported by the
National Research, Development and Innovation Office NKFIH Grant
No. K115288. Csaba Sándor,1222
Email: [email protected]. This author was supported by the OTKA
Grant No. K109789. This paper was supported by the János Bolyai
Research Scholarship of the Hungarian Academy of Sciences.
and Quan-Hui Yang2333Email: [email protected].
This author was supported by the National Natural Science
Foundation for Youth of China, Grant No. 11501299, the Natural
Science Foundation of Jiangsu Province, Grant Nos.
BK20150889, 15KJB110014 and the Startup Foundation for Introducing
Talent of NUIST, Grant No. 2014r029.
Abstract
Let C,W⊆Z. If C+W=Z, then the set C is
called an additive complement to W in Z. If no proper
subset of C is an additive complement to W, then C is called
a minimal additive complement. Let X⊆N. If
there exists a positive integer T such that x+T∈X for all
sufficiently large integers x∈X, then we call X eventually
periodic. In this paper, we study the existence of a minimal
complement to W when W is eventually periodic or not. This
partially answers a problem of Nathanson.
-
Institute of Mathematics, Budapest
University of Technology and Economics, H-1529 B.O. Box, Hungary
-
School of Mathematics and Statistics, Nanjing University of Information
Science and Technology, Nanjing 210044, China
2010 Mathematics Subject Classifications: Primary 11B13, 11B34.
Key words and phrases: Additive complements, minimal complements,
periodic sets.
1 Introduction
Let N denote the set of nonnegative integers and Z be the set of integers. For A,B⊆Z and k∈Z, let A+B={a+b: a∈A, b∈B} and kA={ka:a∈A}.
If A+B=Z, then A is called an additive complement to
B in Z. If no proper subset of A is a complement to
B, then A is called a minimal complement to B in
Z.
It is easy to see that if A⊆Z is a (minimal) complement to B⊆Z, then A is also a (minimal) complement to B+d, d∈Z, where B+d={b+d:b∈B}.
In 2011, Nathanson [4] proved the following theorem.
Nathanson’s theorem (See [4, Theorem
8]). Let W be a nonempty, finite set of integers.
In Z, every complement to W contains a minimal
complement to W.
In the same paper, Nathanson also posed the following problem.
Problem (See [4, Problem 11]). Let
W be an infinite set of integers. Does there exist a minimal
complement to W? Does there exist a complement to W that does not
contain a minimal complement?
For the second part of the above problem, in 2012, Chen and Yang [2] gave two infinite sets W1 and W2 of integers such that there exists a complement to W1 that does not contain a minimal complement and every complement to W2 contains a minimal complement.
For the first part of the above problem, in 2012, Chen and Yang [2] proved the following results.
Theorem A (See [2, Theorem 1]). Let W be a set of integers with infW=−∞ and supW=+∞. Then there exists a minimal complement to W.
By Theorem A, now we only need to consider the cases infW>−∞
or supW<+∞. Without loss of generality, we may assume
that infW>−∞.
Theorem B (See [2, Theorem 2]). Let W={1=w1<w2<⋯} be a set of integers and
[TABLE]
(a) If limsupi→+∞(wi+1−wi)=+∞, then
there exists a minimal complement to W.
(b) If limi→+∞(wi+1−wi)=+∞, then there
does not exist a minimal complement to W.
Let W=∪k=0∞[10k,2×10k]. Then it is clear
that both limsupi→+∞(wi+1−wi)=+∞
and limsupi→+∞(wi+1−wi)=+∞ hold. Hence
limi→+∞(wi+1−wi)=+∞ in Theorem B
(b) cannot be changed to limsupi→+∞(wi+1−wi)=+∞.
In this paper, we will give further results on Nathanson’s problem
and deal with some sets W do not satisfy the conditions of
Theorem B.
First we give some definitions. Let S⊆N. Denote by Smodm the set of residues of S modulo m, i.e.,
[TABLE]
Let X⊆N. If
there exists a positive integer T such that x+T∈X for all
x∈X, then we call X periodic with period T. If
X∪C is a periodic set for some finite set C⊆N, then we call X quasiperiodic. If there exists
a positive integer T such that x+T∈X for all sufficiently
large integers x∈X, then we call X eventually
periodic with period T. Clearly, a periodic set must be
quasiperiodic and a quasiperiodic set must be eventually periodic.
If W is eventually periodic with ∣N∖W∣=+∞, then both limi→+∞(wi+1−wi)<+∞ and limi→+∞(wi+1−wi)<+∞ hold. Hence
W does not satisfy the conditions of Theorem B.
Suppose that W
is an eventually periodic set and m is a positive
period. By shifting a number, we may assume that W has the
following structure:
[TABLE]
where Xm⊆{0,1,…,m−1},Y(0)⊆Z−,Y(1) are finite sets with
Y(0) mod m⊆Xm and
(Y(1) mod m)∩Xm=∅.
For example, if W={2,4,7,8,9,12,13,17,18,22,23,27,28,…}, then by shifting a number 5, we may assume that
[TABLE]
Hence m=5, Xm={2,3}, Y(0)={−3}, Y(1)={−1,4}.
In this paper, we study that what conditions are needed to ensure the existence of a minimal complement to W. First we prove a sufficient condition.
Theorem 1**.**
Let W be defined in (1). If there exists a minimal complement
to W, then there exists C⊆{0,1,…,m−1} such that the
following two conditions hold:
(a) C+(Xm∪Y(1))modm={0,1,…,m−1};
(b) For any c∈C, there exists y∈Y(1) such that
c+y≡c′+x (mod m) for any c′∈C and x∈Xm.
Remark 1**.**
By the proof of Theorem 1,
we know that Theorem 1 also holds when Y(1) is an
infinite set with ∣Y(1)∩Z−∣<+∞.
Let m=3, Xm={0}, Y(1)⊆3N+1. By
Theorem 1, we have the following corollary.
Corollary 1**.**
Let Y⊆3N+1 and
W=3N∪Y. Then there does not exist a minimal
complement to W.
Remark 2**.**
We can choose an infinite set
Y in Corollary 1 such that W is not eventually
periodic. Hence, there exists an infinite, not eventually periodic
set W⊆N such that wi+1−wi∈{1,2,3}
for all i, and there does not exist a minimal complement to W.
Remark 3**.**
If W⊆N is a
quasiperiodic set, then Y(1)=∅ and the condition (b)
in Theorem 1 does not hold. Hence there does not exist a
minimal complement to W.
In the next step we prove a necessary condition.
Theorem 2**.**
Let W be defined in (1). Suppose that there exists C⊆{0,1,…,m−1} such that the following two conditions hold:
(a) C+(Xm∪Y(1))modm={0,1,…,m−1};
(b) For any c∈C, there exists y∈Y(1) such that c+y≡c′+x (mod m) for
any c′∈C∖{c} and x∈Xm∪Y(1).
Then there exists a minimal complement to W.
By Theorems 1 and 2, we have the following
corollary.
Corollary 2**.**
Let W=(mN+Xm)∪Y(0)∪{a},
where Xm⊆{0,1,…,m−1}, (Y(0)modm)⊆Xm and a≡x (mod m) if x∈Xm. Then there exists a minimal complement to W
if and only if there exists a subset C⊆{0,1,…,m−1} such that:
(a) C+(Xm∪{a})modm={0,1,…,m−1};
(b) For any c∈C, c+a≡c′+x (mod m), where c′∈C∖{c} and x∈Xm.
We see that Theorems 1 and 2 transfer
Nathanson’s problem into a finite modulo version when W is an eventually periodic set.
In the next theorem, we give a sufficient and necessary condition, but we
cannot bound the module.
Theorem 3**.**
Let W be defined in (1). There exists a minimal complement to W
if and only if there exists T∈Z+,m∣T,
and C⊆{0,1,…,T−1} such that
(a) C+(XT∪Y(1))modT={0,1,…,T−1}, where XT=∪i=0mT−1{im+Xm};
(b) for any c∈C, there exists y∈Y(1) such that
c+y≡c′+x (mod T) for any c′∈C∖{c} and x∈XT∪Y(1).
Finally, as a complement to Remark 2, we give the
following theorem.
Theorem 4**.**
There exists an infinite, not
eventually periodic set W⊆N such that
wi+1−wi∈{1,2} for all i and there exists a minimal
complement to W.
Now we pose two problems for further research.
Problem 1**.**
We know that Theorem 1 also holds when
Y(1) is infinite. Is Theorem 2 also true when
Y(1) is infinite?
Problem 2**.**
Does there exist an explicit formula for the upper bound of T in Theorem 3
using m,Y(0) and Y(1)?
2 Proofs
Proof of Theorem 1.
Suppose that D is a
minimal complement to W. For i∈{0,1,…,m−1}, let
Di={d∈D: d≡i (mod m)} and
[TABLE]
For any t∈{0,1,…,m−1}∖C, the set {d∈D: d≡t (mod m)}+W does not contain any sufficiently small
negative integers. It follows from D+W=Z that
C+W mod m={0,1,…,m−1}. That is, C+(Xm∪Y(1)) mod m={0,1,…,m−1}.
Next we shall prove (b). Suppose that there exists c∈C such
that for any y∈Y(1) there exist c′∈C and x∈Xm with c+y≡c′+x (mod m). We take an integer d∈D such that d≡c (mod m) and we shall prove that D∖{d} is
also a complement to W. For any integer n, write n=d′+w,
where d′∈D and w∈W.
Case 1. d′=d. Then n=d′+w∈(D∖{d})+W.
Case 2. d′=d.
Subcase 2.1. ({w} mod m)⊆Xm. In this case, there exists
a positive integer k0 such that w+km∈W for all integers
k≥k0. Since ∣Dc∩Z−∣=+∞, it follows
that there exists an integer k≥k0 such that d−km∈D.
Hence n=(d−km)+(w+km), where d−km∈D∖{d} and
w+km∈W. That is, n∈(D∖{d})+W.
Subcase 2.2. w∈Y(1). Since {c+y} mod m⊆C+Xm mod m
for any y∈Y(1) and d≡c (mod m), w∈Y(1), it follows that {n} mod m={d+w} mod m⊆C+Xm mod m. Hence
there exist a c′∈D with c′ (mod m)∈C and x∈W
with x mod m∈Xm such that n≡ c′+x (mod m). We choose a sufficiently large integer k
such that c′−km∈D, c′−km=d and x+km∈W. Hence
n=(c′−km)+(x+km), where c′−km∈D∖{d} and x+km∈W.
Hence, (D∖{d})+W=Z which contradicts the fact that D
is a minimal complement. Therefore, (b) holds.
∎
Proof of Theorem 2.
Let
C1=C+Xm mod m, C2={0,1,…,m−1}∖C1,
[TABLE]
[TABLE]
[TABLE]
By (a), we have C′+W=Z. Since C+Xm mod m=C1, it follows
that
[TABLE]
and so
(C′+(W∖Y(1)))∩C2′=∅. It follows from (b) that C2′=∅. Noting
that C′+W=Z, we have C′+Y(1)⊇C2′. Since
Y(1) is a finite set, by the proof of Nathanson’s theorem
(See [4, Theorem 4, page 2015]), there exists D′⊆C′ such
that D′+Y(1)⊇C2′ and for any d∈D′,
[TABLE]
Next we shall prove that D′ is a minimal complement to W.
For i∈C, let Di′={d∈D′:d≡i (mod m)}. First we prove that ∣Di′∩Z−∣=+∞ for all i∈C. Suppose that there exists a j∈C such that ∣Dj′∩Z−∣<+∞. By (b), there exists a y∈Y(1) such
that j+y≡c+x (mod m), where c∈C∖{j}, x∈Xm∪Y(1) and so
[TABLE]
Noting that ({j+y} mod m)⊆C+Xm mod m=C1, we have ({j+y} mod m)⊆C2. It follows that D′+Y(1)⊇C2′, a contradiction. Hence, ∣Di′∩Z−∣=+∞
for all i∈C.
Next we prove that D′ is a complement.
For any integer n∈C1′, by C+Xm mod m=C1, there exists c∈C
and x∈Xm such that n≡c+x (mod m). Since
∣Dc′∩Z−∣=+∞, there exists a sufficiently
small negative integer d∈Dc′ such that n−d>0. The congruences n≡c+x (mod m) and d≡c (mod m) imply that n−d≡x (mod m). Hence, n−d∈mN+Xm and so
[TABLE]
Hence C1′⊆D′+W. On the other hand, D′+W⊇D′+Y(1)⊇C2′. Therefore, D′+W=Z.
Finally, we prove that D′ is a minimal complement.
For any d∈D′,
we have
[TABLE]
It follows that
[TABLE]
and so
(D′∖{d})+W⊇C2′. Hence (D′∖{d})+W=Z.
Therefore, D′ is a minimal complement to W.
∎
Proof of Theorem 3.
Assume that the set W satisfies the conditions of Theorem 3.
Applying Theorem 2 with m=T, it follows that W has a
minimal complement.
Suppose that W has a minimal complement E. We
will prove that there exist a positive integer T and a set C⊆{0,1,…,T−1} satisfying the conditions of Theorem 3.
For 0≤i<m, let
[TABLE]
Let 0≤i1<i2<⋯<it<m be the sequence of
indices with ∣Eij−∣=∞. It is clear that there
exists an integer N0 such that, e∈E and e≤N0 imply that e∈Eij for some ij. It follows from Theorem 1 that Y(0)∪Y(1)=∅. Let
[TABLE]
[TABLE]
and y0=max{y+,−y−,y+−y−}. Let χE(k) denote the
characteristic function of the set E, i.e.,
[TABLE]
Let A=N0+min{0,y−}. We consider the
following vectors:
[TABLE]
It is clear that there are infinitely many vectors
vA,vA−m,…,vA−im,…, each of them has 2y0+1 coordinates, which are [math] or
1. Since there are at most 22y0+1 different vectors,
by the pigeon hole principle, there exist a vector v
and an infinite sequence 0≤k1<k2<⋯ such that vA−kim=v for all positive integer i.
Define L=A−k1m and choose a sufficiently large integer ki such that
kim−k1m≥y0
and [A−kim,A−k1m[∩Eij=∅ for every index ij. Let K=A−kim,
T=L−K and
[TABLE]
Now we shall prove that such an integer T and a set C satisfy the conditions of Theorem 3.
By definitions, K and L have the following properties.
[TABLE]
[TABLE]
[TABLE]
[TABLE]
[TABLE]
First we prove that C+(XT∪Y(1)) mod T={0,1,…,T−1}, where XT=⋃i=0mT−1{im+Xm}.
For any integer l with K≤l<L, there exist e∈E and w∈W such that l=e+w.
As w≥min{0,y−},
it follows from (2) that e=l−w<L−min{0,y−}≤N0, and so e∈Eij− for some integer ij.
Suppose that w∈Y(0)∪Y(1). Then we have y−≤w≤y+ and K−y+≤e=l−w<L−y−. We have three cases.
Case 1. K−y+≤e<K. Noting that
[TABLE]
by (5), we have e+(L−K)∈E. By K−y+≤e<K and (3), it follows that
K≤L−y+≤e+(L−K)<L. Let c=e+(L−K). Then c mod T∈C and l≡c+w (mod T).
Hence l mod T∈C+(XT∪Y(1)) mod T.
Case 2. K≤e<L. It follows that e mod T∈C and so
l mod T∈C+(XT∪Y(1)) mod T.
Case 3. L≤e<L−y−. Noting that
[TABLE]
by (5), we have e−(L−K)∈E. Since L≤e<L−y− and (3), it follows that
K≤e−(L−K)<K−y−<L. Let c=e−(L−K). Then c mod T∈C and
l≡c+w (mod T). Hence l mod T∈C+(XT∪Y(1)) mod T.
Suppose that w∈TN+XT. Since w≥0 and e=l−w<L≤N0, we have e∈Eij− for some integer
ij, and so e≡ij (mod m). It follows from (6) that
there exists an integer e′ such that e′∈Eij−, K≤e′<L and e′≡ij (mod m). Let w≡x (mod m), where x∈Xm. Obviously, l≡e+w≡ij+x≡e′+x (mod m). By
(4) there exists an integer u with 0≤u<mT
such that l≡e′+um+x (mod T). Thus l mod T∈C+(XT∪Y(1)) mod T.
Therefore, C+(XT∪Y(1)) mod T={0,1,…,T−1}.
In the next step we show that the second condition of Theorem 3
holds. For any integer e∈E with K≤e<L, there
exists a w∈W such that e+w=e′+w′ for any e′=e, e′∈E and w′∈W.
If w∈(mN+Xm)∪Y(0), by e<L≤N0 and e∈E,
then there
exists a positive integer s such that e+w=(e−sm)+(w+sm), where e−sm∈E and w+sm∈W. This is a contradiction.
Now we may assume that w∈Y(1). It is enough to prove
that e+w≡e′+w′ (mod T) for any e′(=e)∈E, K≤e′<L and w′∈XT∪(Y(1) mod T). Suppose that such e′ and w′
exist, i.e., e+w≡e′+w′ (mod T).
If w′∈XT, then e+w=e′+w′+tT for some integer t. Hence there exists a positive integer s such that
e+w=(e′−sm)+(w′+sm+tT), where
e′−sm∈E and w′+sm+tT∈W. This is a contradiction.
Now we assume w′∈Y(1). Then K+y−≤e+w,e′+w′<L+y+. By T=L−K≥y0≥y+−y−, it follows that either e+w=e′+w′ or e+w=e′+w′+T or e+w=e′+w′−T.
Case 1. e+w=e′+w′. Then we have e=e′ and w=w′, a contradiction.
Case 2. e+w=e′+w′+T. It follows that K+y−≤e′+w′<K+y+, and so
[TABLE]
By (5), we have e′+T∈E, and then e+w has another representation (e′+T)+w′.
Therefore w=w′ and e=e′+T, which contradicts with K≤e,e′<L.
Case 3. e+w=e′+w′−T. Then we have
L+y−≤e′+w′<L+y+. Thus L−y0≤L+y−−y+≤e′<L+y+−y−≤L+y0. It follows from
(5) that e′−T∈E which implies that e+w=(e′−T)+w′. Therefore w=w′ and e=e′−T, which is a contradiction because K≤e,e′<L.
The proof of Theorem 3 is completed.
∎
Proof of Theorem 4.
By induction we can construct
{di}i=1∞, {Wi}i=1∞ and
{ci}i=1∞ such that
(i) d1=−1, W1={1,2,…,12}, c1=−3;
(ii) di is the largest negative integer ∈Wi−1+{c1,c2,…,ci−1} for i≥2;
(iii) ci<di+2ci−1 for all i≥2;
(iv) for i≥2, let Wi=Wi−1∪([−2ci−1,−2ci−1]∖∪j=1i−1{−ci+dj}).
Let W=∪i=1∞Wi and C={ci}i=1∞.
Now we prove that C is a minimal complement to W.
First we prove di+1−di≤−2 for all integers i≥1.
Clearly d2=−3, d2−d1=−2. Suppose that di+1−di≤−2 for
all integers i<k (k≥2). Since
[TABLE]
[TABLE]
it follows that dk−ck, dk−1−ck∈Wk and then
dk,dk−1∈Wk+{ck}. Hence dk+1≤dk−2. By (iv), we
have wj+1−wj∈{1,2}. Since dk→−∞, by (ii) we
have (−∞,9]⊆W+C. For any integer n≥10, there
exists an i such that −ci−1≤n<−ci. Hence
[TABLE]
and so n−ci∈Wi, that is, n∈Wi+{ci}. Therefore,
W+C=Z.
Next, we prove that the complement C is minimal. For any
positive integer i, we write di=c+w with c∈C and w∈W. Now we shall prove that c=ci. By (iv), we have
di−cj∈W for all integers j>i. Hence c=cj for
all integers j>i. Since −2ci−1 is the minimal value of
W∖Wi−1 and for any positive integers j≤i−1,
di−cj≤di−ci−1<−2ci−1, it follows that
di−cj∈W∖Wi−1 for all positive integer j≤i−1. Noting that di∈Wi−1+{c1,…,ci−1}, we
have di∈W+{c1,c2,…,ci−1}. Hence c=ci.
Therefore, C is a minimal complement to W. Furthermore, by
(iii), we can choose suitable ci such that W is infinite and
not eventually periodic.
∎
3 Acknowledgement
This work was done during the third author visiting to Budapest
University of Technology and Economics. He would like to thank Dr.
Sándor Kiss and Dr. Csaba Sándor for their warm hospitality. We would like
to thank the anonymous referee very much for the detailed comments.