Corollary 4.3 — |BB| ≤ α|B| and |BAB| ≤ α²|B| give |BA⁻¹AB⁻¹| ≤ α⁶|B|
ProvedPlunneckeType.Tao.corollary_4_3additive-combinatoricsnon-abelian-groupsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1product-sets
Let be a group, not necessarily abelian, and let and be finite subsets of . Write for the product set of finite sets , , and for the number of elements of . Let be a real number and suppose that
Then
No relation between and is assumed. The corollary converts a bound on the triple product into a bound on the four-fold product ; it is used in both the proof of Theorem 4.4 and the proof of Theorem 1.6.
Formalization Note Products are taken in the order printed, ; the group is not assumed commutative. 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. 8, Corollary 4.3. Let `A, B` be finite sets in a (not
necessarily commutative) group with `|BB| ≤ α|B|` and `|BAB| ≤ α²|B|`. Then `|BA⁻¹AB⁻¹| ≤ α⁶|B|`. -/
theorem corollary_4_3 {G : Type*} [Group G] [DecidableEq G] (A B : Finset G) (α : ℝ)
(hBB : (#(B * B) : ℝ) ≤ α * #B)
(hBAB : (#(B * A * B) : ℝ) ≤ α ^ 2 * #B) :
(#(B * A⁻¹ * A * B⁻¹) : ℝ) ≤ α ^ 6 * #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. 8, Corollary 4.3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.