An example concerning set addition in F_2^n
Ben Green, Daniel Kane

TL;DR
The paper constructs specific sets in a vector space over F_2 demonstrating a discrepancy between statistical and combinatorial notions of closure under addition, revealing nuanced structural properties.
Contribution
It introduces sets that are statistically almost closed under addition but far from combinatorially almost closed, highlighting differences in additive combinatorics.
Findings
Sets are statistically almost closed under addition.
Sets are not combinatorially almost closed unless subsets are very small.
Demonstrates a significant gap between statistical and combinatorial closure properties.
Abstract
We construct sets in a vector space over with the property that is "statistically" almost closed under addition by in the sense that almost always lies in when , but which is extremely far from being "combinatorially" almost closed under addition by : if , and is comparable in size to then .
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.
Taxonomy
TopicsAdvanced Topology and Set Theory
An example concerning set addition in
Ben Green
Mathematical Institute, University of Oxford
and
Daniel Kane
Department of Mathematics, University of California at San Diego
Abstract.
We construct sets in a vector space over with the property that is “statistically” almost closed under addition by in the sense that almost always lies in when , but which is extremely far from being “combinatorially” almost closed under addition by : if , and is comparable in size to then .
1. Introduction
The aim of this note is to prove the following result, which is a precise version of the claim made in the abstract.
Theorem 1.1**.**
Let . Then there are arbitrarily large finite sets in some vector space over with the property that , but such that if and satisfy then .
The sets are constructed as follows. For positive integer we take to consist of a direct product of “bands” (union of a few consecutive Hamming layers) in copies of . Then we take to consist of the standard basis vectors in . The details may be found in Section 3.
Whilst the construction is fairly simple, neither the construction nor its analysis seemed quite obvious to us and so we thought it worth recording in this short note.
2. A crude isoperimetric inequality for bands
By a band of width in we mean the union of consecutive layers, where we define the layer , where is the number of nonzero coordinates of .
Lemma 2.1**.**
Suppose that is contained in some band of width , where . Let be the set of standard basis vectors in . Then
[TABLE]
Proof.
We begin by noting that if then there are elements differing from by an element of . Each such element arises from choices of . It follows by double counting that if is some set then
[TABLE]
If then we have
[TABLE]
Thus if then
[TABLE]
Suppose that , where . Then, applying the preceding inequality with in turn and with , the claimed result follows by noting that all of the layers lie outside .
If then a very similar argument works, but we instead use the inequality
[TABLE]
for .
∎
3. The example
Let , as in the statement of Theorem 1.1. Let be odd and of size , and let be even with . Consider the vector space , and let be the standard basis consisting of elements . Let consist of the direct product of copies of the band in .
It is straightforward to show that is almost closed under addition by in the “statistical” sense.
Lemma 3.1**.**
We have . That is,
[TABLE]
Proof.
By symmetry it suffices to show that . If the projection of to the first copy of lies in , then it is evidently the case that . The probability of this event is precisely
[TABLE]
since the sizes of the layers decrease away from the middle layer. ∎
Shortly we will turn to the somewhat less immediate task of showing that is much bigger than unless is of size . We note that there are two quite distinct examples of sets of size for which there is some almost closed under addition by . Indeed
- •
If then consists of the product of the band of width , , with copies of the usual band of width . By a computation very similar to that in the proof of Lemma 3.1, we have .
- •
If then we may take to be the product of some -invariant set in the first factor with an -invariant set in the second factor and so on to obtain . Note that any band in of width does contain a set invariant under a given basis vector .
These examples, in addition to showing that we cannot improve upon our bound of , should also convince the reader that there is nothing to be gained by taking our set to live inside with differing values of : if then examples of the first type are worse, whilst if then examples of the second type are bad.
Suppose that
[TABLE]
for some and . We begin by applying a variant of the Plünnecke-Ruzsa inequality due to Ruzsa [1, Chapter 1, Proposition 7.3]. A special case of this theorem tells us that if then for any positive integer there is ,
[TABLE]
such that
[TABLE]
Now since we have
[TABLE]
where
[TABLE]
for some set . Say that is good if , and write for the set of good . We claim that if is good then
[TABLE]
The sets are disjoint for different , as all the elements of such a set, considered as a subset of , have their th coordinate, and no other, lying outside the band . It follows from this and (3.3) that
[TABLE]
and therefore we have
[TABLE]
It remains to establish the claim (3.4). To do this, identify with the standard basis vectors in , and write as a direct product . Then may be fibred as unions
[TABLE]
[TABLE]
where and, crucially, each is a band of width in . By Lemma 2.1 (with ) it follows that
[TABLE]
from which the claim follows by summing over .
4. Acknowledgements
The first author thanks Shachar Lovett for asking a question which led to this note. Lovett (personal communication) subsequently informed us that Hosseini, Impagliazzo and he observed that easier examples are available in other ambient spaces. For example, , (viewed as subsets of , or of for any ) have similar properties. In fact for this example we have and implies that . A somewhat similar example is mentioned in [2, Exercise 2.6.2].
The authors thank MSRI and the Simons Institute for providing excellent working conditions while this work was carried out. The first author is a Simons Investigator. The second author is supported by NSF CAREER award number 1553288.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] I. Z. Ruzsa, Sumsets and structure in Combinatorial number theory and additive group theory, 87–210, Adv. Courses Math. CRM Barcelona, Birkhäuser Verlag, Basel, 2009.
- 2[2] T. Tao and V .Vu, Additive Combinatorics , Cambridge Studies in Advanced Math 105 , 2006.
