Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Setting (pp. 1-2). A subset of an abelian semigroup is a basis (of order two) if every element is with . The basis is perfect if each element has exactly one such representation, up to the order of the summands. The representation function counts ordered representations. For a subset of an abelian group and an integer , , so is the set of doubles of elements of .
Theorem 1 (p. 2, quoted). "Let be an infinite abelian group with . (i) If is not the direct sum of a group of exponent 3 and the group of order 2, then has a perfect basis. (ii) If is the direct sum of a group of exponent 3 and the group of order 2, then does not have a perfect basis, but has a basis such that every element of has at most two representations (distinct under permuting the summands) as a sum of two elements of the basis."
The hypothesis is needed: the paper observes (p. 2) that when is infinite with , every basis (indeed every subset with ) gives some element representations of the form with ; this covers every infinite group of exponent 2. The abstract calls the theorem a complete solution of the Erdős-Turán problem for infinite groups. The proofs assume the axiom of choice (p. 3).
Source. Sergei V. Konyagin and Vsevolod F. Lev, The Erdős-Turán problem in infinite groups, arXiv:0901.1649v1 (2009); published in Additive Number Theory, Springer, New York, 2010, 195--202. Labels and pages here are those of arXiv v1: the definitions on p. 1, Theorem 1 on p. 2, Lemmas 1 and 2 on pp. 3-4, the proof on pp. 5-6. The edition read is identified on the source card.
Read depth. Claims checked: the definitions and the statement were read clause by clause on the printed pages. The proof was read but not checked step by step. Nothing here is independently reviewed.
Proof pointer
Pages 5-6, in three parts. For of exponent 3, Lemma 1 (p. 3: an infinite abelian group of prime exponent is isomorphic to for an algebraically closed field of characteristic ) reduces to , where the parabola is a perfect basis, since a representation of solves a quadratic in with one or two roots. For with of exponent 3 and of order 2, a perfect basis of together with its translate gives at most two representations, and a perfect basis of is ruled out by taking the unique representation of and doubling. In general the perfect basis is built by transfinite recursion along a well-ordering of indexed by the initial ordinal of , adding, at each successor step whose element is not yet represented, a pair with that element as their sum, subject to conditions (a)-(e) on p. 6, of which (b)-(e) keep representations unique. Lemma 2 (p. 4: if is infinite and , some has and ) supplies the pair when ; a coset argument handles ; means has exponent 3 (the first part), and makes the direct sum of a group of exponent 3 and the group of order 2, the case excluded in (i).
Dependencies
Lemma 1 (p. 3) and Lemma 2 (p. 4) of the same paper, and the standard facts of linear algebra and set theory listed on p. 3.
Bears on
- Problem 1192: the problem asks, for each , for a basis of order with . Theorem 1 concerns infinite abelian groups with and order two only; it is a group analogue of the case and says nothing about bases of .