Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.1, inductive step — ∣X+hB∣≤α∣X+(h−1)B∣|X + hB| \le \alpha|X + (h-1)B|∣X+hB∣≤α∣X+(h−1)B∣ for a minimal-growth X⊆AX \subseteq AX⊆A

Proved
PlunneckeType.Abelian.theorem_3_1_step

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, BBB be finite subsets of GGG. For h≥0h \ge 0h≥0 write hB=B+⋯+BhB = B + \cdots + BhB=B+⋯+B (hhh summands) for the iterated sumset, with 0B={0}0B = \{0\}0B={0}. Let α\alphaα be a real number with

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

and let X⊆AX \subseteq AX⊆A be a nonempty subset of minimal growth under addition of BBB:

∣X+B∣∣X∣≤∣Z+B∣∣Z∣for every nonempty Z⊆A.\frac{|X + B|}{|X|} \le \frac{|Z + B|}{|Z|} \quad \text{for every nonempty } Z \subseteq A.∣X∣∣X+B∣​≤∣Z∣∣Z+B∣​for every nonempty Z⊆A.

Then for every integer h≥1h \ge 1h≥1

∣X+hB∣≤α ∣X+(h−1)B∣.|X + hB| \le \alpha\, |X + (h-1)B|.∣X+hB∣≤α∣X+(h−1)B∣.

This is the inductive step in the proof of Theorem 3.1: applied for h=1,2,…h = 1, 2, \dotsh=1,2,… it gives ∣X+hB∣≤αh∣X∣|X + hB| \le \alpha^h |X|∣X+hB∣≤αh∣X∣ with the same XXX for every hhh.

Formalization Note The minimality is stated cross-multiplied, ∣X+B∣ ∣Z∣≤∣Z+B∣ ∣X∣|X + B|\,|Z| \le |Z + B|\,|X|∣X+B∣∣Z∣≤∣Z+B∣∣X∣, which avoids division. hBhBhB is the hhh-fold sumset h • B (not the dilate {hb}\{hb\}{hb}), and h−1h - 1h−1 is natural-number subtraction, guarded by the hypothesis h≥1h \ge 1h≥1.

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

/-- Petridis, arXiv:1101.3507v3, p. 7, proof of Theorem 3.1 (the inductive step). Let `A, B` be
finite sets in an abelian group with `|A + B| ≤ α|A|`, and let `X ⊆ A` be nonempty and minimise
`|Z + B|/|Z|` over the nonempty `Z ⊆ A` (stated cross-multiplied). Then for every `h ≥ 1`,
`|X + hB| ≤ α |X + (h - 1)B|`, where `hB = h • B` is the `h`-fold sumset. -/
theorem theorem_3_1_step {G : Type*} [AddCommGroup G] [DecidableEq G] (A B X : Finset G) (α : ℝ)
    (hAB : (#(A + B) : ℝ) ≤ α * #A)
    (hXA : X ⊆ A) (hX : X.Nonempty)
    (hmin : ∀ Z ⊆ A, Z.Nonempty → (#(X + B) : ℝ) * #Z ≤ #(Z + B) * #X)
    (h : ℕ) (hh : 1 ≤ h) :
    (#(X + h • B) : ℝ) ≤ α * #(X + (h - 1) • B) := 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, proof of Theorem 3.1 (the display |X + hB| = |(h−1)B + X + B| ≤ α|X + (h−1)B|)
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