Display (9) — with A minimal and B ⊆ A⁻¹AT, |Bʰ| ≤ α⁶|BTBʰ⁻²| for h > 2
ProvedPlunneckeType.Tao.eq9_Bh_leLet 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
Let be nonempty with
and let be a subset with and . Then for every integer ,
This is display (9) in the proof of Theorem 1.6. The set is the one supplied by Ruzsa's covering lemma; the inequality replaces by a product in which one copy of has been exchanged for the small set , at the cost of the factor .
Formalization Note The minimality of is written cross-multiplied, for nonempty , and is assumed nonempty because the ratio is defined only for nonempty sets. is any subset of with the two properties the covering lemma provides. is a natural number with , so is exact. Cardinalities are cast to .
import Mathlib open scoped Pointwise open Finset
namespace PlunneckeType.Tao
/-- Petridis, arXiv:1101.3507v3, p. 10, display (9) in the proof of Theorem 1.6. Let `B` be a
finite set in a (not necessarily commutative) group with `|BB| ≤ α|B|`; let `A ⊆ B` be nonempty with
`|AB|/|A| ≤ |ZB|/|Z|` for every nonempty `Z ⊆ B` (cross-multiplied); and let `T ⊆ B` have at most
`α` elements with `B ⊆ A⁻¹AT`. Then for every `h > 2`, `|Bʰ| ≤ α⁶|BTBʰ⁻²|`. -/
theorem eq9_Bh_le {G : Type*} [Group G] [DecidableEq G] (A B T : Finset G) (α : ℝ)
(hBB : (#(B * B) : ℝ) ≤ α * #B)
(hAB : A ⊆ B) (hA : A.Nonempty)
(hmin : ∀ Z ⊆ B, Z.Nonempty → (#(A * B) : ℝ) * #Z ≤ #(Z * B) * #A)
(hTB : T ⊆ B) (hT : (#T : ℝ) ≤ α) (hcover : B ⊆ A⁻¹ * A * T)
(h : ℕ) (hh : 2 < h) :
(#(B ^ h) : ℝ) ≤ α ^ 6 * #(B * T * B ^ (h - 2)) := by sorry
end PlunneckeType.Tao
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.