Proof of Theorem 1.6, inductive step — |Bʰ| ≤ α⁸β|Bʰ⁻¹| for h > 2
ProvedPlunneckeType.Tao.theorem_1_6_stepadditive-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 and suppose that
Then for every integer ,
This one-step bound is obtained in the proof of Theorem 1.6 by putting displays (9), (10) and (11) together; Theorem 1.6 follows from it and Theorem 4.4 by induction on .
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. 11, the inductive step in the proof of Theorem 1.6 (from
(9), (10) and (11)). Let `B` be a finite set in a (not necessarily commutative) group with
`|BB| ≤ α|B|` and `|BbB| ≤ β|B|` for all `b ∈ B`. Then for every `h > 2`, `|Bʰ| ≤ α⁸β|Bʰ⁻¹|`. -/
theorem theorem_1_6_step {G : Type*} [Group G] [DecidableEq G] (B : Finset G) (α β : ℝ)
(hBB : (#(B * B) : ℝ) ≤ α * #B)
(hBbB : ∀ b ∈ B, (#(B * {b} * B) : ℝ) ≤ β * #B)
(h : ℕ) (hh : 2 < h) :
(#(B ^ h) : ℝ) ≤ α ^ 8 * β * #(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. 11, proof of Theorem 1.6 (from displays (9), (10), (11))
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.