Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.6 — |BB| ≤ α|B| and |BbB| ≤ β|B| for all b ∈ B give |Bʰ| ≤ α^(8h−17)β^(h−2)|B| for h > 2

Proved
PlunneckeType.Tao.theorem_1_6

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

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

This is an explicit form of a theorem of Tao on product sets in non-abelian groups.

Let GGG be a group, not necessarily abelian, and let BBB be a finite subset of GGG. Write XY={xy:x∈X, y∈Y}XY = \{xy : x \in X,\ y \in Y\}XY={xy:x∈X, y∈Y} for the product set of finite sets X,Y⊆GX, Y \subseteq GX,Y⊆G, Bh=B⋯BB^h = B \cdots BBh=B⋯B for the hhh-fold product, BbB={b1bb2:b1,b2∈B}BbB = \{b_1 b b_2 : b_1, b_2 \in B\}BbB={b1​bb2​:b1​,b2​∈B} for b∈Gb \in Gb∈G, and ∣X∣|X|∣X∣ for the number of elements of XXX. Let α,β\alpha, \betaα,β be real numbers and suppose that

∣BB∣≤α∣B∣and∣BbB∣≤β∣B∣  for every b∈B.|BB| \le \alpha |B| \qquad \text{and} \qquad |BbB| \le \beta |B| \ \text{ for every } b \in B.∣BB∣≤α∣B∣and∣BbB∣≤β∣B∣  for every b∈B.

Then for every integer h>2h > 2h>2,

∣Bh∣≤α8h−17 βh−2 ∣B∣.|B^h| \le \alpha^{8h-17}\, \beta^{h-2}\, |B|.∣Bh∣≤α8h−17βh−2∣B∣.

In words: a finite set with small doubling whose "two-sided translates" BbBBbBBbB are all small has small hhh-fold products for every hhh, with a bound polynomial in α\alphaα and β\betaβ whose exponents are explicit. In an abelian group ∣BbB∣=∣BB∣|BbB| = |BB|∣BbB∣=∣BB∣, so the second hypothesis is automatic; in a non-abelian group small doubling alone does not control ∣BBB∣|BBB|∣BBB∣, which is why the second hypothesis is needed.

Formalization Note hhh is a natural number with h>2h > 2h>2; under this hypothesis the exponents 8h−17≥78h-17 \ge 78h−17≥7 and h−2≥1h-2 \ge 1h−2≥1 are exact natural numbers (at h=2h = 2h=2 the printed exponent 8h−178h-178h−17 would be negative, and the theorem does not claim that case). Cardinalities are cast to R\mathbb{R}R. There is no sign hypothesis on α\alphaα or β\betaβ: if BBB is nonempty the hypotheses force α,β≥1\alpha, \beta \ge 1α,β≥1, and if BBB is empty both sides are 000. The group is an arbitrary Group, never a commutative one.

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

/-- Petridis, arXiv:1101.3507v3, p. 4, Theorem 1.6 (an explicit form of Tao's theorem). Let `B`
be a finite set in a (not necessarily commutative) group with `|BB| ≤ α|B|` and `|BbB| ≤ β|B|` for
all `b ∈ B`. Then for every `h > 2`, `|Bʰ| ≤ α^(8h−17) β^(h−2) |B|`. The natural-number exponents
`8h − 17` and `h − 2` are exact because `h ≥ 3`. -/
theorem theorem_1_6 {G : Type*} [Group G] [DecidableEq G] (B : Finset G) (α β : ℝ)
    (hBB : (#(B * B) : ℝ) ≤ α * #B)
    (hBbB : ∀ b ∈ B, (#(B * {b} * B) : ℝ) ≤ β * #B)
    (h : ℕ) (hh : 2 < h) :
    (#(B ^ h) : ℝ) ≤ α ^ (8 * h - 17) * β ^ (h - 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. 4, Theorem 1.6 (proof pp. 10–11)
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