Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Display (9) — with A minimal and B ⊆ A⁻¹AT, |Bʰ| ≤ α⁶|BTBʰ⁻²| for h > 2

Proved
PlunneckeType.Tao.eq9_Bh_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. Write XYXYXY for the product set of finite sets X,Y⊆GX, Y \subseteq GX,Y⊆G, X−1={x−1:x∈X}X^{-1} = \{x^{-1} : x \in X\}X−1={x−1:x∈X}, Bh=B⋯BB^h = B \cdots BBh=B⋯B (hhh factors), and ∣X∣|X|∣X∣ for the number of elements of XXX. Let α\alphaα be a real number with

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

Let A⊆BA \subseteq BA⊆B be nonempty with

∣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,

and let T⊆BT \subseteq BT⊆B be a subset with ∣T∣≤α|T| \le \alpha∣T∣≤α and B⊆A−1ATB \subseteq A^{-1}ATB⊆A−1AT. Then for every integer h>2h > 2h>2,

∣Bh∣≤α6 ∣BTBh−2∣.|B^h| \le \alpha^6\, |BTB^{h-2}|.∣Bh∣≤α6∣BTBh−2∣.

This is display (9) in the proof of Theorem 1.6. The set TTT is the one supplied by Ruzsa's covering lemma; the inequality replaces BhB^hBh by a product in which one copy of BBB has been exchanged for the small set TTT, at the cost of the factor α6\alpha^6α6.

Formalization Note The minimality of AAA is written cross-multiplied, ∣AB∣ ∣Z∣≤∣ZB∣ ∣A∣|AB|\,|Z| \le |ZB|\,|A|∣AB∣∣Z∣≤∣ZB∣∣A∣ for nonempty Z⊆BZ \subseteq BZ⊆B, and AAA is assumed nonempty because the ratio is defined only for nonempty sets. TTT is any subset of BBB with the two properties the covering lemma provides. hhh is a natural number with h>2h > 2h>2, so h−2h - 2h−2 is exact. Cardinalities are cast to R\mathbb{R}R.

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

/-- Petridis, arXiv:1101.3507v3, p. 10, display (9) in the proof of Theorem 1.6. Let `B` be a
finite set in a (not necessarily commutative) group with `|BB| ≤ α|B|`; let `A ⊆ B` be nonempty with
`|AB|/|A| ≤ |ZB|/|Z|` for every nonempty `Z ⊆ B` (cross-multiplied); and let `T ⊆ B` have at most
`α` elements with `B ⊆ A⁻¹AT`. Then for every `h > 2`, `|Bʰ| ≤ α⁶|BTBʰ⁻²|`. -/
theorem eq9_Bh_le {G : Type*} [Group G] [DecidableEq G] (A B T : Finset G) (α : ℝ)
    (hBB : (#(B * B) : ℝ) ≤ α * #B)
    (hAB : A ⊆ B) (hA : A.Nonempty)
    (hmin : ∀ Z ⊆ B, Z.Nonempty → (#(A * B) : ℝ) * #Z ≤ #(Z * B) * #A)
    (hTB : T ⊆ B) (hT : (#T : ℝ) ≤ α) (hcover : B ⊆ A⁻¹ * A * T)
    (h : ℕ) (hh : 2 < h) :
    (#(B ^ h) : ℝ) ≤ α ^ 6 * #(B * T * B ^ (h - 2)) := by sorry

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