Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.1 — in an abelian group, ∣A+B∣≤α∣A∣|A+B| \le \alpha|A|∣A+B∣≤α∣A∣ gives one nonempty X⊆AX \subseteq AX⊆A with ∣X+hB∣≤αh∣X∣|X + hB| \le \alpha^h|X|∣X+hB∣≤αh∣X∣ for all hhh

Proved
PlunneckeType.Abelian.theorem_3_1

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

additive-combinatoricsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1plunnecke-ruzsasumsets

Let GGG be an abelian group, written additively, and let AAA and BBB be finite subsets of GGG with AAA nonempty. Write A+B={a+b:a∈A, b∈B}A + B = \{a + b : a \in A,\ b \in B\}A+B={a+b:a∈A, b∈B}, and for h≥0h \ge 0h≥0 let hB=B+⋯+BhB = B + \cdots + BhB=B+⋯+B (hhh summands) be the iterated sumset, with 0B={0}0B = \{0\}0B={0}. Let α\alphaα be a real number such that

∣A+B∣≤α∣A∣.|A + B| \le \alpha |A|.∣A+B∣≤α∣A∣.

Then there is a nonempty subset X⊆AX \subseteq AX⊆A such that

∣X+hB∣≤αh∣X∣for every h≥0.|X + hB| \le \alpha^h |X| \qquad \text{for every } h \ge 0.∣X+hB∣≤αh∣X∣for every h≥0.

This is Petridis's strengthening of Plünnecke's inequality: the subset XXX does not depend on hhh. Combined with Ruzsa's triangle inequality it yields the Plünnecke–Ruzsa bound ∣mB−nB∣≤αm+n∣A∣|mB - nB| \le \alpha^{m+n}|A|∣mB−nB∣≤αm+n∣A∣.

Formalization Note The paper says "there exists X⊆AX \subseteq AX⊆A"; X=∅X = \emptysetX=∅ would satisfy that trivially, while the paper's XXX minimises ∣Z+B∣/∣Z∣|Z + B|/|Z|∣Z+B∣/∣Z∣, a ratio defined for nonempty ZZZ. So the statement assumes AAA nonempty and asserts XXX nonempty. "For all hhh" is read as every natural number hhh; the case h=0h = 0h=0 is the true statement ∣X∣≤∣X∣|X| \le |X|∣X∣≤∣X∣. hBhBhB is the hhh-fold sumset h • B, not the dilate {hb}\{hb\}{hb}. The quantifiers are ∃X ∀h\exists X\ \forall h∃X ∀h; the weaker ∀h ∃X\forall h\ \exists X∀h ∃X is Theorem 1.1 of the paper.


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

Preamble
import Mathlib
open scoped Pointwise
open Finset
Formal statement
namespace PlunneckeType.Abelian

/-- Petridis, *New proofs of Plünnecke-type estimates for product sets in groups*,
arXiv:1101.3507v3, p. 7, Theorem 3.1. In an abelian group, if `|A + B| ≤ α|A|` and `A` is
nonempty, then one nonempty `X ⊆ A` satisfies `|X + hB| ≤ α^h |X|` for every `h`, where
`hB = h • B` is the `h`-fold sumset (`0 • B = {0}`). The same `X` serves every `h`. Without
`X.Nonempty` the statement would be satisfied by `X = ∅`. -/
theorem theorem_3_1 {G : Type*} [AddCommGroup G] [DecidableEq G] (A B : Finset G) (α : ℝ)
    (hA : A.Nonempty) (hAB : (#(A + B) : ℝ) ≤ α * #A) :
    ∃ X ⊆ A, X.Nonempty ∧ ∀ h : ℕ, (#(X + h • B) : ℝ) ≤ α ^ h * #X := by sorry

end PlunneckeType.Abelian
Source
G. Petridis, New proofs of Plünnecke-type estimates for product sets in groups, arXiv:1101.3507v3, p. 7, Theorem 3.1
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me