Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (6) — a minimally growing A ⊆ B gives |BAB| ≤ α²|B|

Proved
PlunneckeType.Tao.eq6_BAB_le

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

additive-combinatoricsnon-abelian-groupsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1product-sets

Let GGG be a group, not necessarily abelian, and let BBB be a finite subset of GGG. For finite sets X,Y⊆GX, Y \subseteq GX,Y⊆G write XY={xy:x∈X, y∈Y}XY = \{xy : x \in X,\ y \in Y\}XY={xy:x∈X, y∈Y} and ∣X∣|X|∣X∣ for the number of elements of XXX. Suppose that

∣BB∣≤α∣B∣|BB| \le \alpha |B|∣BB∣≤α∣B∣

for a real number α\alphaα. Let A⊆BA \subseteq BA⊆B be a nonempty subset that grows minimally under right multiplication by BBB among the nonempty subsets of BBB, that is,

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

Then

∣BAB∣≤α2∣B∣.|BAB| \le \alpha^2 |B|.∣BAB∣≤α2∣B∣.

This is display (6) in the proof of Theorem 4.4: the minimal-growth subset AAA controls the triple product BABBABBAB, which is the input to Corollary 4.3 and is used again in the proof of Theorem 1.6.

Formalization Note The minimality condition is written cross-multiplied, ∣AB∣ ∣Z∣≤∣ZB∣ ∣A∣|AB|\,|Z| \le |ZB|\,|A|∣AB∣∣Z∣≤∣ZB∣∣A∣ for every nonempty Z⊆BZ \subseteq BZ⊆B, so that no division appears. The ratio ∣ZB∣/∣Z∣|ZB|/|Z|∣ZB∣/∣Z∣ is defined only for nonempty ZZZ, so AAA is assumed nonempty. Cardinalities are cast to R\mathbb{R}R and α\alphaα is a real number with no sign hypothesis.

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

/-- Petridis, arXiv:1101.3507v3, p. 9, display (6) in the proof of Theorem 4.4. Let `B` be a
finite set in a (not necessarily commutative) group with `|BB| ≤ α|B|`, and let `A ⊆ B` be nonempty
with `|AB|/|A| ≤ |ZB|/|Z|` for every nonempty `Z ⊆ B` (written cross-multiplied). Then
`|BAB| ≤ α²|B|`. -/
theorem eq6_BAB_le {G : Type*} [Group G] [DecidableEq G] (A B : Finset G) (α : ℝ)
    (hBB : (#(B * B) : ℝ) ≤ α * #B)
    (hAB : A ⊆ B) (hA : A.Nonempty)
    (hmin : ∀ Z ⊆ B, Z.Nonempty → (#(A * B) : ℝ) * #Z ≤ #(Z * B) * #A) :
    (#(B * A * B) : ℝ) ≤ α ^ 2 * #B := by sorry

end PlunneckeType.Tao
Source
G. Petridis, New proofs of Plünnecke-type estimates for product sets in groups, arXiv:1101.3507v3, p. 9, display (6) in the proof of Theorem 4.4
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