Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(12) — a nonempty minimal-growth S⊆AS \subseteq AS⊆A satisfies ∣CSB∣≤α∣CS∣|CSB| \le \alpha|CS|∣CSB∣≤α∣CS∣ for every finite CCC

Proved
PlunneckeType.NonAbelian.eq12_CSB_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. Write XY={xy:x∈X, y∈Y}XY = \{xy : x \in X,\ y \in Y\}XY={xy:x∈X, y∈Y} for the product of two sets and ∣⋅∣|\cdot|∣⋅∣ for cardinality. Let α\alphaα be a real number with

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

Let S⊆AS \subseteq AS⊆A be a nonempty subset that grows minimally under right multiplication by BBB among the nonempty subsets of AAA:

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

Then for every finite set C⊆GC \subseteq GC⊆G

∣CSB∣≤α ∣CS∣.|CSB| \le \alpha\,|CS|.∣CSB∣≤α∣CS∣.

This is display (12) of the paper, the first step of the proofs of Proposition 5.2 and Theorem 1.7: the minimal-growth subset controls every triple product CSBCSBCSB, with one constant for all CCC simultaneously.

Formalization Note The minimality condition is written cross-multiplied, ∣SB∣ ∣Z∣≤∣ZB∣ ∣S∣|SB|\,|Z| \le |ZB|\,|S|∣SB∣∣Z∣≤∣ZB∣∣S∣ for every nonempty Z⊆AZ \subseteq AZ⊆A, which is equivalent to the ratio form since SSS and ZZZ are nonempty. Cardinalities are cast to R\mathbb{R}R; α\alphaα is an arbitrary real number. The order of the factors in CSBCSBCSB is kept.

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

/-- Petridis, arXiv:1101.3507v3, p. 12, display (12) in the proof of Proposition 5.2. Let `A, B` be
finite sets in a (not necessarily commutative) group with `|AB| ≤ α|A|`, and let `S ⊆ A` be nonempty
with `|SB|/|S| ≤ |ZB|/|Z|` for every nonempty `Z ⊆ A` (written cross-multiplied). Then
`|CSB| ≤ α|CS|` for every finite set `C`. -/
theorem eq12_CSB_le {G : Type*} [Group G] [DecidableEq G] (A B S : Finset G) (α : ℝ)
    (h1 : (#(A * B) : ℝ) ≤ α * #A)
    (hSA : S ⊆ A) (hS : S.Nonempty)
    (hmin : ∀ Z ⊆ A, Z.Nonempty → (#(S * B) : ℝ) * #Z ≤ #(Z * B) * #S) :
    ∀ C : Finset G, (#(C * S * B) : ℝ) ≤ α * #(C * S) := 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 (12) in the proof of Proposition 5.2 (reused 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