Display (11) — |BB| ≤ α|B| gives |B⁻¹Bʰ⁻²| ≤ α|Bʰ⁻¹| for h > 2
ProvedPlunneckeType.Tao.eq11_BinvBh_leadditive-combinatoricsnon-abelian-groupsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1product-sets
Let be a group, not necessarily abelian, and let be a finite subset of . Write for the product set of finite sets , , ( factors), and for the number of elements of . Let be a real number with
Then for every integer ,
This is display (11) in the proof of Theorem 1.6. Together with displays (9) and (10) it yields the inductive step .
Formalization Note is a natural number with , so and are exact. Cardinalities are cast to ; there is no sign hypothesis on .
Preamble
import Mathlib open scoped Pointwise open Finset
Formal statement
namespace PlunneckeType.Tao
/-- Petridis, arXiv:1101.3507v3, p. 10, display (11) in the proof of Theorem 1.6. Let `B` be a
finite set in a (not necessarily commutative) group with `|BB| ≤ α|B|`. Then for every `h > 2`,
`|B⁻¹Bʰ⁻²| ≤ α|Bʰ⁻¹|`. -/
theorem eq11_BinvBh_le {G : Type*} [Group G] [DecidableEq G] (B : Finset G) (α : ℝ)
(hBB : (#(B * B) : ℝ) ≤ α * #B)
(h : ℕ) (hh : 2 < h) :
(#(B⁻¹ * B ^ (h - 2)) : ℝ) ≤ α * #(B ^ (h - 1)) := 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 (11) in the proof of Theorem 1.6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.