Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. N. Hegyvári, On complete sequences, Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 34 (1991), 7--10, identified on the source card: the setting and the unnumbered Theorem on p. 7, the proof on pp. 8--9, with Lemma 1 (p. 8) and Lemma 2 (p. 9).
Read depth. Claims checked: the definitions, the conjectures of p. 7, the Theorem and Lemma 2 were read clause by clause on the page images. The proof (pp. 8--9) was read through but not checked step by step. Nothing here is independently reviewed.
Statement
Setting (p. 7). A sequence is "called complete, if every sufficiently large integer can be expressed as the sum of distinct elements of ". is the set of finite sums of distinct terms of , so completeness means that is finite. For the paper writes
with the integer part, and for each fixed sets
a subset of (p. 8 writes its complement as ). is Lebesgue measure. Completeness is for the set written as an increasing sequence, so each value is used at most once in a sum.
Theorem (p. 7, quoted). " is measurable and either or ."
Context on p. 7. The paper places the Theorem below three conjectures, each implied by the one before it:
- Erdős and Graham's, from their 1980 monograph, p. 58: if is irrational then is complete.
- A weaker form, posed by the paper: for every fixed the set is countable.
- An even weaker one: .
The paper also restates, from the author's 1989 paper (Acta Math. Hung. 53, 149--154), that the Erdős--Graham conjecture holds when is a finite dyadic fraction and an infinite one, and the stronger conjecture stated there: if () and is an infinite dyadic fraction, then is complete. The Theorem proves neither the countability nor the measure-zero form; it shows that if the measure-zero form fails for some , then has infinite measure.
Proof pointer
Pp. 8--9. The paper reduces to ("It is clear", p. 8) and uses the binary digits of , with which or for . Measurability is the main step. With the set of giving completeness and , the paper shows that is open: for in it, every integer from some on is representable, and Lemma 1 transfers completeness to every close enough to , because the first terms agree with up to an index where the gap condition of the lemma holds. The paper says this makes open as well; for measurability it suffices that differs from the open set by a subset of the countable set (an observation of this page). The dichotomy comes from Lemma 2 (p. 9): if is incomplete then so is , since . Hence $2X_\alpha\subset X_\alpha$, so , which forces to be or . The paper's set is printed as , with in place of .
Dependencies
Lemma 1 (p. 8) and Lemma 2 (p. 9) of the same paper; nothing from other sources.
Bears on
- Problem 354: the first question asks whether the doubling floor sequences of and are complete whenever is irrational. The Theorem is a measure-theoretic statement about the exceptional set for a fixed , in the paper's set reading of completeness: is Lebesgue measurable with measure or . It does not say which alternative holds, decides no individual pair, and concerns base only, not the second question's bases .