Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.5 — ∣AB∣≤α∣A∣|AB| \le \alpha|A|∣AB∣≤α∣A∣ gives one nonempty X⊆AX \subseteq AX⊆A with ∣CXB∣≤α∣CX∣|CXB| \le \alpha|CX|∣CXB∣≤α∣CX∣ for every finite CCC

Proved
PlunneckeType.Abelian.theorem_1_5

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

additive-combinatoricsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1plunnecke-ruzsaproduct-sets

Let GGG be a group, not necessarily commutative, and let AAA and BBB be finite subsets of GGG with AAA nonempty. Write AB={ab:a∈A, b∈B}AB = \{ab : a \in A,\ b \in B\}AB={ab:a∈A, b∈B} for the product set and ∣⋅∣|\cdot|∣⋅∣ for cardinality. Let α\alphaα be a real number such that

∣AB∣≤α∣A∣.|AB| \le \alpha |A|.∣AB∣≤α∣A∣.

Then there is a nonempty subset X⊆AX \subseteq AX⊆A such that for every finite set C⊆GC \subseteq GC⊆G

∣CXB∣≤α ∣CX∣.|CXB| \le \alpha\, |CX|.∣CXB∣≤α∣CX∣.

This is a variant of a theorem of Ruzsa on triple products CXBCXBCXB. Its feature is that a single set XXX serves all sets CCC at once, which is what allows it to be iterated: taking CCC to be a power of BBB in an abelian group yields the Plünnecke–Ruzsa inequalities.

Formalization Note The paper's statement says only "there exists X⊆AX \subseteq AX⊆A"; since every product with the empty set is empty, X=∅X = \emptysetX=∅ would satisfy it trivially. The paper's XXX is a minimiser of the ratio ∣ZB∣/∣Z∣|ZB|/|Z|∣ZB∣/∣Z∣, which is defined for nonempty ZZZ, so the statement assumes AAA nonempty and asserts XXX nonempty. The order of the factors in CXBCXBCXB is kept: CCC multiplies on the left, BBB on the right. Cardinalities are cast to R\mathbb{R}R; α\alphaα is an arbitrary real number, as on the page.

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. 3, Theorem 1.5. In a (not necessarily commutative) group, if `|AB| ≤ α|A|`
then some nonempty `X ⊆ A` satisfies `|CXB| ≤ α|CX|` for every finite set `C`, with the same `X`
for all `C`. The paper's `X` minimises `|ZB|/|Z|` over the nonempty `Z ⊆ A`; without
`X.Nonempty` the statement would be satisfied by `X = ∅`. -/
theorem theorem_1_5 {G : Type*} [Group G] [DecidableEq G] (A B : Finset G) (α : ℝ)
    (hA : A.Nonempty) (hAB : (#(A * B) : ℝ) ≤ α * #A) :
    ∃ X ⊆ A, X.Nonempty ∧ ∀ C : Finset G, (#(C * X * B) : ℝ) ≤ α * #(C * 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. 3, Theorem 1.5 (proof pp. 6–7)
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