Sums of linear transformations in higher dimensions
Akshat Mudgal

TL;DR
This paper establishes sharp lower bounds on the size of sumsets formed by linear transformations of finite sets in higher dimensions, improving previous results and demonstrating the bounds' optimality.
Contribution
It proves new sharp bounds for sumsets involving linear transformations in higher dimensions, extending and refining earlier work by Balog and Shakan.
Findings
Lower bounds for sumsets with coprime coefficients in -dimensional space.
Sharp bounds for sumsets involving linear transformations without invariant subspaces in -dimensional space.
Improved understanding of the structure of sumsets under linear transformations.
Abstract
In this paper, we prove the following two results. Let be a natural number and be co-prime integers such that . Then there exists a constant depending only on and such that for any finite subset of that is not contained in a translate of a hyperplane, we have The main term in this bound is sharp and improves upon an earlier result of Balog and Shakan. Secondly, let be a linear transformation such that does not have any invariant one-dimensional subspace of . Then for all finite subsets of , we have for some absolute constant . The main term in this result is sharp as well.
Peer Reviews
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.
Sums of Linear Transformations in higher dimensions
Akshat Mudgal
School of Mathematics, University of Bristol, University Walk, Clifton, Bristol BS8 1TW, United Kingdom
Abstract.
In this paper, we prove the following two results. Let be a natural number and be co-prime integers such that . Then there exists a constant depending only on and such that for any finite subset of that is not contained in a translate of a hyperplane, we have
[TABLE]
The main term in this bound is sharp and improves upon an earlier result of Balog and Shakan. Secondly, let be a linear transformation such that does not have any invariant one-dimensional subspace of . Then for all finite subsets of , we have
[TABLE]
for some absolute constant . The main term in this result is sharp as well.
Key words and phrases:
Additive combinatorics, Sum of dilates, Inverse theorem, Sum of rotations
2010 Mathematics Subject Classification:
11B13, 11B30, 11P70
1. Introduction
Let be finite subsets of , for some . We define
[TABLE]
Furthermore, for all real numbers , and , we define
[TABLE]
and for all ,
[TABLE]
We define dimension of a set to be the dimension of the affine subspace spanned by . Our first result is on sums of dilates.
Theorem 1.1**.**
Let be a natural number and be co-prime integers such that . Further, let be a finite -dimensional subset of . Then there exists a constant depending only on and such that
[TABLE]
The constant in Theorem 1.1 is sharp as witnessed by the following example. Let be the standard basis for . For each , define
[TABLE]
An easy computation shows that
[TABLE]
In the case , a generalization of Theorem 1.1 to sums of several dilates with a better error term was proved by Shakan [22]. Furthermore, when , previously best known lower bounds for were by Balog and Shakan [2]. When and , they showed that
[TABLE]
Furthermore, in the same paper, they showed that when and ,
[TABLE]
which they conjectured to be true for all .
Conjecture 1.2**.**
Let be natural numbers such that and let be a finite -dimensional set. Then
[TABLE]
We observe that Theorem 1.1 implies Conjecture 1.2 with a slightly worse error term.
Our second result is about sums of linear transformations in . Firstly, given and , we define
[TABLE]
We give lower bounds for where and such that does not have any invariant one-dimensional subspace of .
Theorem 1.3**.**
Let be a finite subset of . Furthermore, let be a linear transformation such that has no real eigenvalues. Then there exists an absolute constant , such that
[TABLE]
In particular, we can choose for some , where rotates vectors in counterclockwise by angle . As , we see that has no real eigenvalues.
Corollary 1.4**.**
Let be a finite subset of and . Then we have
[TABLE]
for some absolute constant .
The main term in our lower bound is sharp as witnessed by the following example. Let
[TABLE]
and . In this case, we see that
[TABLE]
and thus
[TABLE]
Note that if , one can take to be a -dimensional arithmetic progression and show that
[TABLE]
which is best possible, as for any two finite, non-empty subsets of , one has
[TABLE]
Further, if one restricts to be -dimensional and , the best lower bound that can be shown is
[TABLE]
which follows from a result of Ruzsa [16, Corollary 1.1]. It is sharp for and as the set
[TABLE]
demonstrates. Hence when and is -dimensional, the best lower bound that we can get is . Corollary 1.4 implies that for all other values of , one can get a stronger lower bound for .
We will deduce Theorem 1.1 and Theorem 1.3 from a structure theorem for sets with few sums of linear transformations.
Theorem 1.5**.**
Let be a positive real number and let be a natural number. Further, let be a finite subset of and be an invertible linear transformation. If
[TABLE]
then there exist parallel lines in , and constants and depending only on such that
[TABLE]
and
[TABLE]
We note that the problem of looking at sums of dilates in vector spaces is a generalisation of estimating lower bounds for sums of dilates of subsets of integers. Originally, Konyagin and Łaba [11] worked on sets of the form for and transcendental . Subsequently, Nathanson [13] gave lower bounds for when and . Different variants of this problem were tackled by many authors (see [1], [4], [5], [6], [10] and [12]) and in particular, the general case of estimating for co-prime integers was first treated by Bukh [3]. Bukh gave a lower bound for size of such sets and the main term in Bukh’s bound was sharp. The final improvement for Bukh’s error term was given by Shakan [22]. As previously mentioned, this result was generalised to -dimensional subsets of by Balog and Shakan in [2]. We refer the reader to [1], [3] and [22] for a more detailed introduction to this problem.
We remark that there are multiple variants of this problem that are currently unsolved and are of independent interest. In [11, Corollary 3.7], Konyagin and Łaba proved that for any transcendental real number and finite set such that , one has
[TABLE]
They further showed that there exist arbitrarily large sets with
[TABLE]
There were subsequent improvements to Konyagin and Łaba’s result by Sanders [18], [19] and Schoen [21]. In particular, Sanders [19, Theorem 11.8] showed that one can improve Konyagin and Łaba’s lower bound to
[TABLE]
It would be interesting to find the exact shape of a sharp lower bound for when is a transcendental real number.
Similarly, one might be interested in estimates for when is an algebraic number and . As Shakan remarks in [22, Question 1.2], this is closely related to a conjecture of Bukh that asks for lower bounds for where and are linear transformations from to .
Conjecture 1.6**.**
Let be linear transformations from to that do not share a non-trivial invariant subspace and satisfy
[TABLE]
Then for any , we have
[TABLE]
We observe that one can conjecture a similar result for linear transformations from to . In §5, we present a structure theorem, that is, Theorem 5.2, which makes partial progress towards an analogue of Conjecture 1.6 in . Furthermore, Theorem 5.2 implies Theorem 1.3 in a straightforward manner, which in itself, shows that Conjecture 1.6 is true when and are linear transformations from to with as the identity matrix and .
Lastly, this problem can also be considered in the finite field setting, that is, given a prime and , we look at where . When , the question is answered by the Cauchy–Davenport theorem. But for general values of , the question remains open, with partial results in [14] and [15].
We now outline the structure of our paper. We dedicate §2 to present some preliminary results that we will use in our paper. In §3 we will prove Theorem 1.5. We use §4 to combine Theorem 1.5 with some counting arguments from Combinatorial Geometry to show Theorem 1.1. Lastly, in §5, we prove Theorem 5.2 and Theorem 1.3.
2. Preliminaries
In our proof of Theorem 1.5, we will use two standard inequalities to move from sum of dilates to sumsets. The first of these two inequalities was originally shown by Ruzsa [17]. We mention these results as stated in [23, Lemma 2.6] and [23, Corollary 2.12].
Lemma 2.1**.**
Suppose that are three finite sets in some abelian group . Then
[TABLE]
and
[TABLE]
Another important ingredient for the proof of Theorem 1.5 will be the following generalisation of Freiman’s theorem on sets with small doubling to arbitrary abelian groups by Green and Ruzsa [8]. In order to state the result, we have to give some additional definitions. Given an abelian group , we define a proper progression of arithmetic dimension and size as
[TABLE]
where and are elements of such that all the sums in the progression are distinct. We further define a coset progression to be a set of the form where is a proper progression and is a subgroup of . It is important to not confuse the arithmetic dimension of a progression as defined above and the dimension of a subset of as defined earlier to be the dimension of the affine subspace spanned by . We now state Green and Ruzsa’s result [8, Theorem 1.1].
Lemma 2.2**.**
Let be a subset of an abelian group such that . Then is contained in a coset progression of arithmetic dimension and size , for some constant .
As a remark, we note that Lemma 2.2 has been quantitatively improved by many authors (for instance, see [20], [21]). In particular, much work has been done on improving the dependence of and on . At the same time, we observe that Theorem 1.5 refers to the existence of constants , and such that the theorem holds and does not deal with the quantitative dependence of and on . Thus, for our purposes, it suffices to use Lemma 2.2 as stated.
Note that if the group is torsion free, then the finite subgroup must be trivial for finite . Thus if is a subset of or and has small doubling, then must lie in a proper progression of bounded arithmetic dimension and size proportional to size of .
In our proof of Theorem 1.1, we will frequently use a straightforward consequence of a result of Shakan [22, Theorem 1.1].
Lemma 2.3**.**
Given distinct co-prime integers there exists a constant such that for every finite subset of , one has
[TABLE]
In fact, Balog and Shakan give an explicit upper bound for the additive constant . In [22], Shakan remarks that results like Lemma 2.3 can be extended to by using a result from [23, Lemma 5.25]. For completeness, we record the same below.
Lemma 2.4**.**
Given distinct co-prime integers there exists a constant such that for every finite subset of , one has
[TABLE]
Note that as sums of dilates are preserved under invertible linear transformations, we can deduce that given a finite -dimensional set and distinct co-prime integers and , there exists a constant such that one has
[TABLE]
Another result which we will use is a result on -dimensional sumsets in by Ruzsa [16, Corollary 1.1].
Lemma 2.5**.**
Let be finite, non-empty subsets of such that and . Then we have
[TABLE]
In some instances, we will also use a more general lower bound for sumsets of arbitrary finite sets in . Thus, given any finite, non-empty sets , we have
[TABLE]
Lastly, in §5, we will use a result of Grynkiewicz and Serra [9, Theorem 1.3].
Lemma 2.6**.**
Let be finite, non-empty subsets, let be a line, let be the number of lines parallel to which intersect , and let be the number of lines parallel to that intersect . Then
[TABLE]
3. The structure theorem
In this section, we will prove Theorem 1.5. We begin by moving from estimates on sums of dilates to bounds on sumsets.
Lemma 3.1**.**
Let be a positive real number and let be a natural number. Further, let be a finite subset of and be an invertible linear transformation. If
[TABLE]
then
[TABLE]
Proof.
Fixing , let be a finite subset of such that . We apply with , and . Thus, we have
[TABLE]
which gives us
[TABLE]
As is invertible, we have . Thus we deduce that
[TABLE]
Using with , we get
[TABLE]
Our next objective is to deduce Theorem 1.5 from .
Lemma 3.2**.**
Let be a finite subset of with where is large enough. If
[TABLE]
for some , then there exist parallel lines in , and constants and depending only on such that
[TABLE]
and
[TABLE]
Proof.
Let be a finite subset of which satisfies . From the note following Lemma 2.2, we deduce that is contained in a proper progression , of arithmetic dimension and size , where and depend only on . We write as
[TABLE]
where and are elements of such that all the sums in the progression are distinct.
Without loss of generality, we suppose . Note that as contains , we must have , which further implies that . We define the arithmetic progression as
[TABLE]
We note that our progression can be seen as a collection of translates of the arithmetic progression . Because is proper, all of these translates are disjoint and thus we have
[TABLE]
Lastly, as is covered by disjoint translates of , we define to be the translate of containing the most elements of . By the pigeonhole principle, we find that contains at least
[TABLE]
elements of .
Until now, we have shown that if our set has small doubling, then a significant portion of its elements are contained in a -dimensional progression. Our next goal is to show that unless almost all of is similarly structured, grows faster than just linearly in .
We let be the line in that contains the arithmetic progression . We begin by covering with translates of . Thus we have
[TABLE]
where are parallel lines. We write . Without loss of generality, we can assume that
[TABLE]
Let be a natural number such that
[TABLE]
We define . Note that
[TABLE]
and thus
[TABLE]
Further, we see that
[TABLE]
We combine this with and to show that
[TABLE]
We replace with , and with to get Lemma 3.2. ∎
We note that upon combining Lemma 3.1 and Lemma 3.2, we can deduce Theorem 1.5.
4. Proof of Theorem 1.1
We will take ideas from the proof of Freiman’s lemma [7, section 1.14] as given in [23, Lemma 5.13] and modify them to prove our own result.
Let and be co-prime integers such that . Let be large enough and . We note that and thus, define to be the scalar matrix , where is the identity matrix. As lies in , we apply Lemma 3.1 to get
[TABLE]
Our next step is to apply Lemma 3.2 with . Thus, we can find parallel lines and constants , and depending only on and such that
[TABLE]
and
[TABLE]
Note that there is a natural upper bound for in terms of as
[TABLE]
Thus We write
[TABLE]
Note that we can cover with translates of , say, . As for each , the line must contain at least one element of , we have
[TABLE]
This, together with the estimates on , implies that
[TABLE]
where is some positive constant that only depends only on and . Thus we have proved that if , then can be written as
[TABLE]
where are parallel lines in and for some constants and .
For ease of notation, we define as a positive constant depending only on and such that
[TABLE]
where is the constant referenced in Lemma 2.4.
Proposition 4.1**.**
Let be a natural number and be co-prime integers such that . Further, let be parallel lines in . Suppose is a finite -dimensional subset of such that
[TABLE]
Then we have
[TABLE]
where .
We note that by combining the preceding discussion with and Proposition 4.1, we can deduce Theorem 1.1 for .
Proof of Proposition 4.1.
We will prove our proposition by double induction, first on , that is, the dimension of and then on , that is, the number of lines that make up . For any choice of and , we have as is a -dimensional set. Let be the statement of Proposition 4.1 for -dimensional sets which can be covered by parallel lines. Our base cases will be for all and for all . In our inductive step, we will prove that if and are true, then holds. We will thus conclude that holds for all such that .
For ease of notation, let for all . We note that Lemma 2.4 implies for all . Thus our remaining base case is for all . This is easy to show since in this case, the sets are disjoint for all . Hence for our -dimensional set , we have
[TABLE]
We use to estimate and we use to estimate . Thus, we get
[TABLE]
We now proceed with the inductive step, that is, for any such that , we assume that and are true, and then prove . Thus let be a finite, -dimensional subset of , such that , where are parallel. As all the ’s are parallel, let be the hyperplane orthogonal to and let denote the point of intersection of and for each . We write Without loss of generality, we can assume that is an extreme point of , that is, it is a vertex on the convex hull of . We define , and to be the convex hull of . Note that dimension of in is at least . Our proof divides into two cases now, depending on the dimension of .
We first consider the case when is -dimensional. This implies that is -dimensional, and since lies outside of , there exist distinct points in such that for all , the line segment joining and lies outside . In particular, for each , the points
[TABLE]
lie outside of . For each , let the corresponding line in containing be . Then this implies that the two lines
[TABLE]
do not intersect . Thus, we get distinct lines
[TABLE]
which do not intersect . By , we have that
[TABLE]
where . Moreover, by , we have
[TABLE]
Lastly, for each , we have the trivial bound
[TABLE]
Summing the above for all , we get
[TABLE]
Combining , and with the fact that the lines mentioned in do not intersect , we get that
[TABLE]
Hence when is -dimensional, Proposition 4.1 holds.
Our second case is when is -dimensional. In this case, we note that as is -dimensional, can not intersect the affine subspace generated by , which means that , , and are pairwise disjoint sets. We claim that
[TABLE]
We now prove our claim. We first assume that . In this subcase, we use Lemma 2.5 which implies that
[TABLE]
and
[TABLE]
Combining these two estimates, we get .
Thus, we now assume that . As for all , the lines , , and are pairwise disjoint, we have the following decomposition.
[TABLE]
Note that as is -dimensional, we must have . If , we have
[TABLE]
If , then we observe that as is covered by lines, with each line containing at least one element of , we have . Using this, we show that
[TABLE]
In either case, we have
[TABLE]
which, together with , implies that
[TABLE]
that is, holds.
Thus when is -dimensional, we have shown that holds. By , we deduce that
[TABLE]
From our definition of , we note that , and thus, we have
[TABLE]
Combining this with and , we get that
[TABLE]
∎
5. Proof of Theorem 1.3
We begin this section with a preliminary lemma on sums of linear transformations of one-dimensional sets.
Lemma 5.1**.**
Let be a linear transformation such that has no real eigenvalues. Furthermore, let and be two parallel lines in . Then for all finite subsets and , we have
[TABLE]
Proof.
Let and satisfy
[TABLE]
Rearranging the above, we get that
[TABLE]
We observe that if is a non-zero vector, then and where is the unit vector parallel to , and and are suitably chosen non-zero real numbers. Thus we have
[TABLE]
This implies that
[TABLE]
which contradicts the hypothesis that has no real eigenvalues. Thus, , and consequently, . Hence, we see that all pair wise sums of the form , with and , are distinct. This implies that
[TABLE]
We now prove another structure theorem which classifies sets that have a small , where does not have real eigenvalues.
Theorem 5.2**.**
Let be a linear transformation such that has no real eigenvalues. Furthermore, let be a constant and be a finite subset of such that
[TABLE]
and is large enough. Then there is a partition such that the following implications hold.
- (1)
There exist parallel lines such that
[TABLE]
where and are constants depending only on . 2. (2)
We have
[TABLE] 3. (3)
We have
[TABLE] 4. (4)
There exist parallel lines such that and are not parallel, and
[TABLE] 5. (5)
We have
[TABLE]
We remark that Theorem 1.3 is a straightforward consequence of Theorem 5.2. This can be seen by setting and applying Theorem 5.2. We combine implication from Theorem 5.2 and the fact that
[TABLE]
for all , to get
[TABLE]
We set to get Theorem 1.3. Thus it suffices to show that Theorem 5.2 is true.
Proof of Theorem 5.2.
Let , where is large enough and let be a linear transformation such that has no real eigenvalues. We suppose that .
We now apply Theorem 1.5 with . Thus we get parallel lines in , and constants and depending only on such that
[TABLE]
and
[TABLE]
We set and . For ease of notation, we write for . If , then by Lemma 5.1, we have
[TABLE]
which contradicts . Thus we must have , and consequently, we prove and in Theorem 5.2.
From , we deduce that
[TABLE]
if is large enough. Hence
[TABLE]
As in the proof of Theorem 1.1, there is a natural upper bound for in terms of as
[TABLE]
Consequently, we get
[TABLE]
Thus we have proven in Theorem 5.2.
We now divide into equivalence classes with respect to , that is, we write
[TABLE]
where each lies in a unique translate of , and for all . As does not have any real eigenvalues, is not parallel to for all . Thus each translate of can contain at most elements of . This gives us
[TABLE]
Combining this with , we deduce that
[TABLE]
Lastly, we can trivially bound above by . Our set up to apply Lemma 2.6 is now ready. We set , , in Lemma 2.6. Noting that as is invertible, we have . Thus, implies that
[TABLE]
Using the respective lower bounds and for and , we show that
[TABLE]
We now prove that
[TABLE]
If the above does not hold, we see that
[TABLE]
We combine this with , and the fact that , to get
[TABLE]
when is large enough. This contradicts and thus, must hold.
We note that and give us
[TABLE]
Combining the above with and , we get
[TABLE]
Furthermore, we use and to show that
[TABLE]
Thus, we have
[TABLE]
and consequently, in Theorem 5.2 holds.
Lastly, in , we decomposed into a disjoint union of equivalence classes such that each lies in a unique translate of . As is invertible and invertible linear transformations preserve parallel lines, we can write
[TABLE]
where are parallel lines. Moreover, and are not parallel lines since is parallel to and does not have any invariant one-dimensional subspace of . This, together with , proves in Theorem 5.2. ∎
As previously mentioned, we note that Theorem 5.2 makes partial progress towards an analogue of Conjecture 1.6 in . In particular, we set and show that if , then should be nicely distributed on an almost-rectangular grid formed by vectors parallel to and .
Funding. This work was supported by a studentship sponsored by a European Research Council Advanced Grant under the European Union’s Horizon 2020 research and innovation programme via grant agreement No. 695223.
Acknowledgements. This work was done partly while the author was a visiting undergraduate at University of Bristol under the supervision of Julia Wolf and partly as a PhD student at University of Bristol under the supervision of Trevor Wooley. The author would like to thank both Julia and Trevor for their guidance and direction. The author would also like to thank the referee for many helpful comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Balog, G. Shakan, On the sum of dilations of a set , Acta Arith. 164 (2014), no. 2, 153-162.
- 2[2] A. Balog, G. Shakan, Sum of dilates in vector spaces , North-West. Eur. J. Math. 1 (2015), 46-54.
- 3[3] B. Bukh, Sums of dilates , Combin. Probab. Comput. 17 (2008), no. 5, 627-639.
- 4[4] J. Cilleruelo, Y.O. Hamidoune, O. Serra, On sums of dilates , Combin. Probab. Comput. 18 (2009), no. 6, 871-880.
- 5[5] J. Cilleruelo, M. Silva, C. Vinuesa, A sumset problem , J. Comb. Number Theory 2 (2010), no. 1, 79-89.
- 6[6] S. Du, H. Cao, Z. Sun, On a sumset problem for integers , Electron. J. Combin. 21 (2014), no. 1, Paper 1.13, 25 pp.
- 7[7] G. A. Freiman, Foundations of a structural theory of set addition , Translated from the Russian. Translations of Mathematical Monographs, Vol 37. American Mathematical Society, Providence, R. I., 1973. vii+108 pp.
- 8[8] B. Green, I. Z. Ruzsa, Freiman’s theorem in an arbitrary abelian group , J. Lond. Math. Soc. (2) 75 (2007), no. 1, 163-175.
