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 3 on p. 3 and the proof references on p. 4. The source heading attributes the theorem to “Plünnecke, 1957.” This page records the statement used by Jin, without independently establishing that historical date.
Statement. Let , let and be integers, and suppose . For define
Then
The minimum is over a nonempty finite family of nonempty finite sets, so it is attained and every denominator is positive. The sets and need not be finite; all counted images lie in the finite interval . Neither nor a basis hypothesis is required for this theorem. For the displayed assertion has only its first term. The height-zero case has no ratios and is not used.
External dependency and proof pointer. Jin supplies no proof here. On p. 4 Jin identifies this as a consequence of the general graph inequality and points to:
- M. B. Nathanson, Additive Number Theory: Inverse Problems and the Geometry of Sumsets, Springer, 1996, Chapter 7 (Jin's reference [9]).
- I. Z. Ruzsa, “Sumsets and Structure,” in Combinatorial Number Theory and Additive Group Theory, Birkhäuser, 2009, 87–210, Chapter 1 (reference [11]).
These are precise external proof pointers. Their graph proofs have not been compiled or independently checked in this source unit. In particular, this page is not a claim that the proof in Plünnecke's unacquired 1970 article has been read.
Use in the density proof. For any nonempty , applying the theorem with gives
Thus a lower bound for the -fold image ratio of every nonempty subset of yields a lower bound for the one-fold image of itself. This is the only graph-theoretic input in [[additive_bases/jin_2014_density_versions_plunnecke_inequality/lemma_1|Lemma 1]].
Bears on. #35, through [[additive_bases/jin_2014_density_versions_plunnecke_inequality/theorem_2|Theorem 2]].