Display (10) — |BTBʰ⁻²| ≤ αβ|B⁻¹Bʰ⁻²| for T ⊆ B with |T| ≤ α and h > 2
ProvedPlunneckeType.Tao.eq10_BTBh_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 real numbers with
and let be a subset with . Then for every integer ,
This is display (10) in the proof of Theorem 1.6. It bounds the right-hand side of display (9) by a product with one fewer copy of on the left.
Formalization Note is a natural number with , so is exact. Cardinalities are cast to ; there are no sign hypotheses on or .
Preamble
import Mathlib open scoped Pointwise open Finset
Formal statement
namespace PlunneckeType.Tao
/-- Petridis, arXiv:1101.3507v3, p. 10, display (10) in the proof of Theorem 1.6. Let `B` be a
finite set in a (not necessarily commutative) group with `|BbB| ≤ β|B|` for all `b ∈ B`, and let
`T ⊆ B` have at most `α` elements. Then for every `h > 2`, `|BTBʰ⁻²| ≤ αβ|B⁻¹Bʰ⁻²|`. -/
theorem eq10_BTBh_le {G : Type*} [Group G] [DecidableEq G] (B T : Finset G) (α β : ℝ)
(hBbB : ∀ b ∈ B, (#(B * {b} * B) : ℝ) ≤ β * #B)
(hTB : T ⊆ B) (hT : (#T : ℝ) ≤ α)
(h : ℕ) (hh : 2 < h) :
(#(B * T * B ^ (h - 2)) : ℝ) ≤ α * β * #(B⁻¹ * 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 (10) in the proof of Theorem 1.6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.