Theorem 4.4 — |BB| ≤ α|B| and |BbB| ≤ β|B| for all b ∈ B give |BBB| ≤ α⁷β|B|
ProvedPlunneckeType.Tao.theorem_4_4additive-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 , , and for the number of elements of . Let be real numbers and suppose that
Then
Theorem 4.4 says that the two conditions of Theorem 1.6 imply small tripling. It is the case of Theorem 1.6 (where ) and the base of the induction that proves it.
Formalization Note The triple product is written as on the page. Cardinalities are cast to ; there are no sign hypotheses on or (if is nonempty the hypotheses force and ; if is empty both sides are ).
Preamble
import Mathlib open scoped Pointwise open Finset
Formal statement
namespace PlunneckeType.Tao
/-- Petridis, arXiv:1101.3507v3, p. 9, Theorem 4.4. Let `B` be a finite set in a (not
necessarily commutative) group with `|BB| ≤ α|B|` and `|BbB| ≤ β|B|` for all `b ∈ B`. Then
`|BBB| ≤ α⁷β|B|`. -/
theorem theorem_4_4 {G : Type*} [Group G] [DecidableEq G] (B : Finset G) (α β : ℝ)
(hBB : (#(B * B) : ℝ) ≤ α * #B)
(hBbB : ∀ b ∈ B, (#(B * {b} * B) : ℝ) ≤ β * #B) :
(#(B * B * B) : ℝ) ≤ α ^ 7 * β * #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. 9, Theorem 4.4
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.