Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (pp. 13--14). A subset of an Abelian group is sum-free when no in it, not necessarily distinct, satisfy . For a set , is the largest size of a sum-free subset of ; for a sequence , is the largest length of a subsequence whose set of values is sum-free (see Proposition 1.2 for the definition in full).
Theorem 1.3 (p. 14, quoted). "For any finite Abelian group , every set of non-zero elements of satisfies . The constant is best possible. Similarly, every sequence of non-zero elements of satisfies , and the constant is optimal."
"Best possible" is shown by a family, not by a single group (p. 21): for and , and , so exceeds and tends to it as . No constant larger than holds in every finite Abelian group, while each fixed group may admit a larger one.
The paper introduces the theorem as settling, for finite Abelian groups, the problem of Babai and Sós of estimating the largest sum-free subset of elements of a general group (p. 14), and calls it the paper's main result. The abstract (p. 13) states the set case.
Related statements in Section 4. For particular groups the constant improves (pp. 23--24): for every sequence of nonzero elements of with prime, for with prime, for , each stated best possible, in when has no prime divisor congruent to modulo , and Proposition 4.3 (p. 23): "For any prime and any , every sequence of non-zero elements of the cyclic group satisfies ", whose proof the paper omits (p. 24). Proposition 4.2 (p. 22), obtained by applying Theorem 1.3 (and Proposition 4.1) repeatedly, states that any set of nonzero elements of a finite Abelian group, and any set of nonzero reals, can be partitioned into sum-free subsets. Item 5 (p. 24) extends the lower bound , with the same optimal constant, to weakly sum-free sets, which exclude only for distinct .
Source. N. Alon and D. J. Kleitman, Sum-free subsets, in: A Tribute to Paul Erdős (A. Baker, B. Bollobás and A. Hajnal, eds.), Cambridge Univ. Press (1990), 13--26, DOI 10.1017/CBO9780511983917.003, as described on the source card: the statement on p. 14, the proof in Section 3, pp. 18--21, the Section 4 statements on pp. 22--24.
Read depth. Claims checked: the statement, the optimality example and the Section 4 statements listed above were read clause by clause on the page images. The proof of the lower bound (pp. 18--20) was read for structure; the table of Lemma 3.1, whose proof the paper omits, was not recomputed. Nothing here is independently reviewed.
Proof pointer
Section 3, pp. 18--21. The lower bound is proved for sequences, which gives sets. In take the sum-free sets and . Lemma 3.1 (pp. 18--19) tabulates for the subgroups , by modulo , and gives the weighted inequality (the paper's (3.1))
Embed in , map the terms to by a uniformly random homomorphism , whose image for each is uniform on a subgroup with , and compare the expected numbers of terms landing in . The zero homomorphism lands no term in either set, so some homomorphism lands more than the average, and for ; then (3.1) gives (p. 20). Optimality comes from Theorem 3.2 (p. 21), due to Rhemtulla and Street.
Dependencies
- Theorem 3.2 (p. 21), cited from A. H. Rhemtulla and A. P. Street, Maximum sum-free sets in elementary Abelian -groups, Canad. Math. Bull. 14 (1971), 73--80: for a prime and , the largest sum-free subset of has elements. With it gives the optimality example.
- Lemma 3.1 (pp. 18--19), stated with its proof omitted as an easy case analysis.
Bears on
- Problem 792: the problem concerns sets of integers and the theorem does not bound its . The problem page uses the theorem to test a remark of Erdős's 1965 paper that his bound holds in any finite Abelian group: by the optimality example no constant above , and so not , holds in every finite Abelian group.