Sum-free sets

Peter J. Cameron University of St Andrews

Topological dynamics, functional equations, infinite combinatorics and probability LSE, June 2017 Three theorems

A set of natural numbers is k-AP-free if it contains no k-term arithmetic progression, and is sum-free if it contains no solution to x + y = z. Theorem (van der Waerden) For a natural number k > 2, the set N cannot be partitioned into finitely many k-AP-free sets. Theorem (Roth–Szemer´edi) For a natural number k > 2, a k-AP-free set has density zero. Theorem (Schur) The set N cannot be partitioned into finitely many sum-free sets. The missing fourth?

At first sight, one would like a theorem to complete the pattern, asserting that a sum-free set has density zero. However, this is false; the set of all odd numbers is sum-free and has density 1/2. What follows can be regarded as an attempt to find a replacement for the missing fourth theorem. Note that other people have tried to fill this gap in different ways . . . A bijection with Cantor space

The Cantor space C can be represented as the set of all (countable) sequences of zeros and ones. It carries the structure of a complete metric space (the distance between two sequences is a monotonic decreasing function of the index of the first position where they differ) or as a probability space (corresponding to a countable sequence of independent tosses of a fair coin). We define a bijection between Cantor space and the set S of all sum-free subsets of N. Given a sequence x ∈ C, we construct S as follows: Consider the natural numbers in turn. When considering n, if n is the sum of two elements already put in S, then of course n ∈/ S. Otherwise, look at the first unused element of x; if it is 1, then put n ∈ S, otherwise, leave n out of S. Delete this element of the sequence and continue. An example

I Input: 101... I Output: 1,4,... I 1 is not a sum, so take an input bit; it’s 1, so 1 ∈ S I 2 = 1 + 1, so skip I 3 is not a sum, so take an input bit; it’s 0, so 3∈ / S I 4 is not a sum, so take an input bit; it’s 1, so 4 ∈ S I 5 = 1 + 4, so skip I . . . and so on . . . Baire category

C is a complete metric space, where the distance between two sequences is a monotone decreasing function of the first position where they disagree. The notion of “almost all” in a complete metric space is a residual set; a set is residual if it contains a countable intersection of dense open sets. Thus, residual sets are non-empty (by the Baire Category Theorem); any countable collection of residual sets has non-empty intersection; a residual set meets every non-empty open set; and so on. Baire category in C

It is a straightforward exercise to show the following. I A subset X of C is open if and only if it is finitely determined, that is, for any x ∈ X, there is a finite initial segment x0 of x such that any sequence beginning with x0 belongs to X. I A subset X of C is dense if and only if it is always reachable, that is, any finite sequence is an initial segment of some element of X. So a set is residual if and only if it contains a countable intersection of sets which are finitely determined and always reachable. sf-universal sets

A sum-free set is called sf-universal if everything which is not forbidden actually occurs. Precisely, S is sf-universal if, for every A ⊆ {1, . . . , n}, one of the following occurs: I there are i, j ∈ A with i < j and j − i ∈ S; I there exists N such that S ∩ [N + 1, . . . , N + n] = N + A, where N + A = {N + a : a ∈ A}. Properties of sf-universality

Theorem The set of sf-universal sets is residual in S. Theorem (Schoen) A sf-universal set has density zero. Thus our “missing fourth theorem” asserts that almost all sum-free sets (in the sense of Baire category) have density zero. Application to Henson’s graph

Henson’s graph is the unique countable homogeneous universal triangle-free graph. Henson showed that it has automorphisms acting as cyclic shifts on the vertices, but the analogous Km-free graphs for m > 3 do not. Let S be an arbitrary subset of N. We define the Cayley graph Cay(Z, S) to have vertex set Z, with x ∼ y if and only if |y − x| ∈ S. Note that this graph admits the group Z acting as a shift automorphism on the vertex set. Theorem

I Cay(Z, S) is triangle-free if and only if S is sum-free. I Cay(Z, S) is isomorphic to Henson’s universal homogeneous triangle-free graph if and only if S is sf-universal.

So Henson’s graph has uncountably many non-conjugate shift automorphisms. Measure

In a probability space, large sets are those which have measure 1, that is, complements of null sets. Just as for Baire category, these have the properties one would expect: the intersection of countably many sets of measure 1 has measure 1; a set of measure 1 intersects every set of positive measure; and so on. The first surprise is that measure and category give entirely different answers to what a typical set looks like: Conjecture The set of sf-universal sets has measure zero. Although this is not proved yet (to my knowledge), it is certain that this set does not have measure 1. Density Given the measure on S, and our interest in density, it is natural to ask about the density of a random sum-free set. This can be investigated empirically by computing many large sum-free sets and plotting their density. Here is the rather surprising result. Sets of odd numbers The spike on the right corresponds to density 1/4 and is explained by the following theorem. Theorem

I The probability that a random sum-free set consists entirely of odd numbers is about 0.218 (in particular is non-zero). I Conditioned on this, the density of a random sum-free set is almost surely 1/4.

The intuition is: Suppose we are building a random sum-free set and have so far not seen any even numbers. I Then the odd numbers will be independent; so the next even number is very likely to be the sum of two odd numbers chosen, and so excluded. I On the other hand, the next odd number is not a sum of two chosen numbers, so we include it with probability 1/2. So the pattern tends to persist. Other positive pieces

Let Z/nZ denote the integers modulo n. We can define the notion of a sum-free set in Z/nZ in the obvious way. Such a sum-free set T is said to be complete if, for every z ∈ Z/nZ \ T, there exist x, y ∈ T such that x + y = z in Z/nZ. Now the theorem above extends as follows. Let S(n, T) denote the set of all sum-free sets which are contained in the union of the congruence classes t mod n for t ∈ T. Theorem Let T be a sum-free set in Z/nZ. I The probability of S(n, T) is non-zero if and only if n is complete. I If T is complete then, conditioned on S ∈ S(n, T), the density of S is almost surely |T|/2n. Discrete or continuous?

The next complete modular sum-free sets are {2, 3} mod 5 and {1, 4} mod 5, and {3, 4, 5} mod 8 and {1, 4, 7} mod 8.

These give “spectral lines” at 1/5 and 3/16 in the figure, for similar reasons to the odd num- bers. The density spectrum appears to be discrete above 1/6, and there is some evidence that this is so. However, a recent paper of Haviv and Levy shows the following result. Theorem The values of |T|/2n for complete sum-free sets T ⊆ Z/nZ are dense in [0, 1/6]. More pieces

Neil Calkin and I showed that the event that 2 is the only even number in S has positive (though rather small) probability. More generally, Theorem Let A be a finite set and T a complete sum-free set modulo n. Then the event A ⊆ S ⊆ A ∪ (T mod n) has positive probability. Question Is it true that a random sum-free set almost surely has a density? Is it also true that the density is strictly positive almost surely? Is it even true that a random sum-free set almost surely lies in one of the pieces so far described? Discrete or continuous? 2

Question Is it true that the density spectrum is discrete above 1/6 but has a continuous part below 1/6? The following construction is due to Calkin and Erdos.˝ Let α be an irrational number, and define S(α) to be the set of natural numbers n for which the fractional part of nα lies between 1/3 and 2/3. It is easy to see that S(α) is sum-free and has density 1/3. However this does not resolve the question, since the event S ⊆ S(α) for some α has probability zero. However, there might be other examples along these lines . . . Counting, 1

“I count a lot of things that theres no need to count,” Cameron said. “Just because that’s the way I am. But I count all the things that need to be counted.”

Richard Brautigan, The Hawkline Monster: A Gothic Western

I will look briefly at counting, and describe two conjectures I made with Paul Erdos˝ (both now proved, the first independently by Ben Green and Sasha Sapozhenko, the second by Jozsef´ Balogh, Hong Liu, Maryam Sharifzadeh, and Andrew Treglown). These results give a picture of the typical sum-free set which disagrees with both the measure-theoretic and Baire-categoric versions. Counting, 2

How many sum-free subsets of {1, . . . , n} are there?

dn e I Any set of odd numbers is sum-free; this gives 2 /2 sets. I Any set with least element more than n/2 is sum-free; this also gives 2dn/2e sets. The intersection with the previous type is small (about 2n/4). I We can find a few more sets by allowing numbers a bit smaller than n/2 and correspondingly excluding numbers close to n. Careful analysis shows that this gives about c.2n/2 sets, where c takes one of two values depending on the parity of n. The first type as we have seen contribute 0.218 . . . to the measure. The rest are invisible both to measure and to Baire category. Cameron–Erd˝os,1

Our first conjecture, now a theorem, asserted that asymptotically this accounts for everything: Theorem There are constants ce and c0 such that, if s(n) is the number of sum-free subsets of {1, . . . , n}, then

s(n) → ce or co 2n/2 as n → ∞ through even, resp. odd, values. The constants are approximately 6.0 and 6.8 but have not been evaluated accurately. Cameron–Erd˝os,2

This shows that most sum-free sets are contained in a very small number of maximal ones; e.g. a positive fraction are contained in the odd numbers. How many maximal sum-free subsets of {1, . . . , n} are there? Erdos˝ and I constructed about 2n/4 such sets and conjectured that this is the right answer. This was proved by Balogh et al., who showed: Theorem There are constants m0, m1, m2, m3 such that, if smax(n) is the number of maximal sum-free subsets of {1, . . . , n}, then

s (n) max → m 2n/4 i as n → ∞ through values congruent to i (mod 4). Rationality

An infinite sequence x is rational, or ultimately periodic, if there exist positive integers n and k such that xi+k = xi for all i ≥ n. Analogously, a sum-free set S is rational if (i ∈ S) ⇔ (i + k ∈ S) for all i ≥ n. It is easy to see that, in our bijection from sequences to sum-free sets, a sequence which maps to a rational sum-free set must itself be rational. What about the converse? Question Is it true that the image of a rational sequence is a rational sum-free set? Rationality, 2

After spending some time on this question, Neil Calkin and I conjectured that the answer is “no”. There are some rational sequences (the simplest being 01010 repeated) for which the corresponding output shows no sign of periodicity despite our computing nearly a million terms. These sets are fascinating, and seem sometimes to exhibit an “almost periodic” structure; they settle into a period, which is then broken and a longer period established, and so on. The next slide shows the integers in [1, 40000] in the sum-free set generated by 01010 repeated. Some of the structure is clearly visible in the picture. The first 40000 numbers

pppppppp pp ppp p p pppppp pppp p ppppppp pppppp pp p ppp p p pp ppp pp pp ppp pp p pp p ppppppppppppp pppppp p p pppppppp pppp p ppppppp p pp pp pp p pppppp p ppppppp ppppppp pppppppp pp pp ppp p ppppppppp pppppppp ppp ppp ppppppp ppppppp p p p pp ppppp pp ppp p pp p pppp p p p pppppppp ppp p ppppppppp pp p p p pppppp pppppppppp pp ppppp ppp pp ppp p p p ppppppppppp ppppppppppp p ppp ppppppp p pppppppppp p pppp p pp p p pppppppp p ppp ppp p pp p p pppppppp ppp p pp pp pp p ppppp ppp ppppp p pppp pp p p pp p p p p p pppppppppp pppppp p p p p pppppppp ppp pppp pp pp p pp p pppp pppppp pp ppp pp ppp ppp pp ppp p ppppp pppp ppppp pppppppp pppp ppppppppppppppppppppppppppppp p pppppp ppppppppppppppp ppp pppppp ppp pppppppp p p ppp ppppp pp p pppp ppp p pp pp pp pppp p p pppppppp ppp p pp p p pp p p ppppppp p pppp p p p pp ppppp ppp ppp p ppppp pppppppp pppp ppppppp ppppp p ppppppppppp ppp ppp pp p p pppppp pppppp ppp pp pppp ppp ppp pp pppppppppppppp p ppp ppp p p ppppp pppp pp p p pppp ppppp p p ppppppppp p ppppp p p p ppppppp ppppppp pp p pppppp pp p pp pp p pppp ppppppppppppppp p pppp pppp ppppppp p ppppppp pp pppppppppp p p p ppp pppp ppppppppp pp ppp pp ppp pp p pppppp ppppp pppp pp p pppppppp pp pppp p pppppp pppp ppp pp pp pppppppp pp p p pp pppppp ppppppp pp pp p ppp pp ppp ppp ppppp pp pp pppppp ppp pppppp pp p pp pppp pp p pppp ppp pppppp pp pppppp ppp ppp ppp ppp p ppp p p p p pppppp p ppp pp p p ppppppp p p p p pppppp pppppppp pppppp ppp pppppp pppppp p ppp pp ppppppp p p pppppp pppppp ppp pppppp pppp p ppppp pppppppppp p pp pppppppppp pp pp p p p p p pppppp pppppppp pp pp ppp ppp pppppp p p pp ppppp ppppp ppppppppp pppppppppppppppppp p p p p ppp ppp p p p ppp p p ppppppppppp p ppppppp p pp pppppppppppppp ppppppppp pp ppp p p p pppp ppp p ppppp p ppp p pp ppppppppppppppppppppppppppp ppppppppp p p p pppppp p ppppp p p p ppppp ppp pppp pppp pppp ppppppppppp pp ppp p p pppppppppppp pp pp p ppppp p p p p ppp pppp p p pppppppp ppppp ppppppppppp p p ppp ppppp pppppppp p ppp p p pp ppp pp pppp ppp pp pppp pppp p p pp pppp pp pp ppppppppp ppp p pppp ppppppp ppppppp pp ppppp p ppp p ppp ppp ppppp pppppppp pppp pp ppppppp pp ppp ppp ppppppppp p p pppp p ppp p p pp ppppppp p p pp pppppp pppppppp p p p p p pppp p pppppppp p p ppppp pppppp pp ppppp pp ppp ppppp p p p pppp ppppppp pppppp pp pp p ppppppp p p pppppppppp p ppp pp pppp pppp p p pppp p p pppppp ppppppp ppppppppp pp pppp pppp pp ppppppp ppp pppppppp pppppp ppppp pp p p p ppppp p pppp p p p pppppp ppppppp pppp pppppppp ppppp p p pp p ppppp pppppppp ppppp ppp pp p ppp ppppp pppp pppppppppppppp p pppppp ppp ppppp pp ppppppppppppp p ppp p pp p pppp ppppp ppp pp p p p ppppp pp pp p p pp pppppp pp pp p ppp ppppppp pp ppp p p p ppppp pp pp pppp p p ppppppp pp pppppp p ppp pppp ppp ppppppp p pp p ppppppp ppp pppppppp pppppp p p pp ppp ppp ppp pppp pppp ppppp pp ppppppp pp p pp pppp p p pppp p ppppppppppppppppp pppp p p pppp pp p pppppp pppppp ppppp pppppppp ppp ppp pppp pppp p pp p p p ppppppp ppp pppppppppppppppp ppppppppp p ppp ppppp pppppp p p pppppp pppp pp ppp pp pppp ppp p ppppppp p p pp pppppp p p p pp ppppp ppp p ppp p pppp p ppppppp ppp pppp pppppppp pppppp p pp pp p ppppp p ppppp ppppppppppppppp p pp pppppppp p ppppp pppp p ppp pp pppppppppppppp pppp pp p pppppp ppppppppp ppppp pppppp p pppp p pppppppppp pppp pp p p pppp ppp pp p p pp p ppp pp ppp pp pp pp pp p ppppppp pppppp p ppp ppppppp ppppppp ppppppp p pppppp ppp ppp p p ppppp pp ppppp p ppppppppppp p pppppppp ppppp ppppppppppppppppp pppp p p ppppppppppppppp p p pppp pp pp pppppp pp ppp p p pp pppp ppppppppppppp p pppp p p pppppp pp p ppp pp p ppp ppp p ppp pppppppp ppp pppp p pppppppppp p pppppppp ppp ppppppppp pp ppp pp pppppppp ppp pp pp p ppp pppp p ppp pppppp pp pp p pp ppppp pp ppppp pppppp ppppppppp p pppp pppp pppppppp pppp ppppp pppp pp p p ppp pp pppppppp ppppppppp p ppppppppp ppppppppp p ppppppppp ppppp pppp pp p p pppppp ppp ppp p p pppp ppp ppp ppp pp p pppp pp pppp ppp ppppp p p pppppp p p ppp pp p pp ppp p p ppppppppppp ppppppppp p p pppppp pppppp pp p ppppp ppppp ppppppp pp pp pp p pppppp pppppp p ppppp p pp ppppp pppppppppppp pppppppppp pppppppppp ppppppppp p pppppp p ppp p p pppp ppp ppp ppppp pp p pp p pppppp ppp pppp ppppppppppp pp ppp p p p pp pp p ppppp p ppppp pp ppppp ppp ppppp ppp pppppp pppppppppppppp ppp pp pp pppp pp ppppp ppppp pppp ppppp p pp pppppp p ppppppppp ppppp ppp ppp ppppppppppppppppp ppp ppppppp p p ppp p p p ppp pppp p ppp pppppp pp ppppp pppp p ppppp pp pp p ppp p pppp p p pp ppp ppp p p p pp pp p pppp ppppp ppppppp pppppp pppp ppppppp pp pppp ppppppppppppp pppppp pp ppp pppppppppppp ppppp p ppp ppppp p pppppppppppp p ppppp p pp pppppppp p pp p pp p pppp ppppp ppp pp pppp pp pppppp ppp ppp ppppppp p pppppp pppppppppp ppppp p p p p pp ppp pp pp ppppppppppppppp ppp ppppppp p pp ppp ppppppppp p ppp pppppppp ppppp p p ppppppp ppp p ppppppp pppppppppppppp pp pppp ppppppppppp ppp p pp ppp pp ppppppppp ppppppppppp