Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Jin's sixteen-page author manuscript, Theorem 6 on p. 9, proof pp. 9–12, with the upper Banach density characterization in Proposition 1 on p. 8.
For , define
Statement. For and every integer ,
The same formula holds for if . If and , only the trivial zero bound is recorded; is not defined by convention. Here is an exact -fold sum, and need not contain zero or be a basis.
Proof sketch. Put and . Upper Banach density is characterized by the following quantifiers: if and only if for every and every there is an integer interval with and density greater than (Proposition 1).
For and , Jin chooses long intervals of nearly maximal density in and . The claim on pp. 10–11 selects a block length , a starting point for a window of , and an interval of with density greater than and . Every full length- block of this interval of has density less than , while every window with has -density greater than . Failure along all large scales would either give overly dense intervals in , or allow removal of a deficient window from a dense interval of and leave arbitrarily long intervals exceeding its upper density.
After deleting the points of in the last positions of and translating to zero, each occupied length- block of a minimizing finite subset has at most elements. A chosen point in that block and the regular windows of produce a disjoint image block inside the fixed output interval, with at least elements. The finite graph ratio is therefore at least . The external [[additive_bases/jin_2014_density_versions_plunnecke_inequality/theorem_3|Theorem 3]] yields arbitrarily long output intervals of density at least
Proposition 1 and give the conclusion. Zero-density factors give the trivial cases for . If and , a fixed translate of in gives density one. For and , a fixed element of gives a translate of inside , proving the stated order-one case.
Coverage. This is a proof sketch. The selection claim, parameter choices, block endpoints, and translated finite graph construction are not rewritten in full; their source proof is pp. 9–12. None is required for Jin's complete Schnirelmann proof in Section 4. The sketch repairs one endpoint in the print. Jin's p. 11 deletes only the last positions. With that cutoff and , a retained point that starts a block has image block , which meets only at . The p. 12 bound on image points in still credits that block with of them. Deleting positions keeps every image block inside ; the block range in the proof of Theorem 7 on p. 13 leaves at least this margin. The deleted fraction is below , which is less than because for Jin's index (p. 10), so the factor is unchanged. The later group and ergodic extensions are identified in the digest.
Bears on. #35, as a distinct Banach density analog. In particular, gives the basis-form bound with upper Banach density (part of Corollary 2 on p. 14).