Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(14) — S⊆AS \subseteq AS⊆A, T⊆BT \subseteq BT⊆B, ∣T∣≤α|T| \le \alpha∣T∣≤α and ∣AbB∣≤β∣A∣|AbB| \le \beta|A|∣AbB∣≤β∣A∣ give ∣STB∣≤αβ∣A∣|STB| \le \alpha\beta|A|∣STB∣≤αβ∣A∣

Proved
PlunneckeType.NonAbelian.eq14_STB_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 commutative, and let AAA and BBB be finite subsets of GGG with BBB nonempty. Write XYXYXY for the product set and ∣⋅∣|\cdot|∣⋅∣ for cardinality. Let α,β\alpha, \betaα,β be real numbers such that

∣AbB∣≤β ∣A∣for every b∈B,|AbB| \le \beta\,|A| \quad\text{for every } b \in B,∣AbB∣≤β∣A∣for every b∈B,

where AbB=A{b}BAbB = A\{b\}BAbB=A{b}B. If S⊆AS \subseteq AS⊆A and T⊆BT \subseteq BT⊆B with ∣T∣≤α|T| \le \alpha∣T∣≤α, then

∣STB∣≤αβ ∣A∣.|STB| \le \alpha\beta\,|A|.∣STB∣≤αβ∣A∣.

This is display (14) of the paper. In the proofs of Proposition 5.2 and Theorem 1.7 the set TTT is a small covering set produced by Ruzsa's covering lemma, and (14) converts the hypothesis on the products AbBAbBAbB into a bound on STBSTBSTB.

Formalization Note The hypothesis that BBB is nonempty is supplied in the paper by its condition ∣A∣≤γ∣B∣|A| \le \gamma|B|∣A∣≤γ∣B∣. It is needed when (14) is stated on its own: for B=∅B = \emptysetB=∅ the hypothesis on AbBAbBAbB is vacuous, β\betaβ may be negative, and the left-hand side 000 would exceed αβ∣A∣\alpha\beta|A|αβ∣A∣ for α>0>β\alpha > 0 > \betaα>0>β and A≠∅A \neq \emptysetA=∅. Cardinalities are cast to R\mathbb{R}R.

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

/-- Petridis, arXiv:1101.3507v3, p. 12, display (14) in the proof of Proposition 5.2. Let `A, B` be
finite sets in a (not necessarily commutative) group, `B` nonempty, with `|AbB| ≤ β|A|` for every
`b ∈ B`. If `S ⊆ A`, `T ⊆ B` and `|T| ≤ α`, then `|STB| ≤ αβ|A|`. The hypothesis `B.Nonempty`
(which the paper's condition (3) supplies) excludes the degenerate case where condition (2) is
vacuous and `β` may be negative. -/
theorem eq14_STB_le {G : Type*} [Group G] [DecidableEq G] (A B S T : Finset G) (α β : ℝ)
    (hB : B.Nonempty)
    (h2 : ∀ b ∈ B, (#(A * {b} * B) : ℝ) ≤ β * #A)
    (hSA : S ⊆ A) (hTB : T ⊆ B) (hT : (#T : ℝ) ≤ α) :
    (#(S * T * B) : ℝ) ≤ α * β * #A := by sorry

end PlunneckeType.NonAbelian
Source
G. Petridis, New proofs of Plünnecke-type estimates for product sets in groups, arXiv:1101.3507v3, p. 12, display (14) in the proof of Proposition 5.2 (reused in (16), p. 13)
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