(14) — , , and give
ProvedPlunneckeType.NonAbelian.eq14_STB_leLet be a group, not necessarily commutative, and let and be finite subsets of with nonempty. Write for the product set and for cardinality. Let be real numbers such that
where . If and with , then
This is display (14) of the paper. In the proofs of Proposition 5.2 and Theorem 1.7 the set is a small covering set produced by Ruzsa's covering lemma, and (14) converts the hypothesis on the products into a bound on .
Formalization Note The hypothesis that is nonempty is supplied in the paper by its condition . It is needed when (14) is stated on its own: for the hypothesis on is vacuous, may be negative, and the left-hand side would exceed for and . Cardinalities are cast to .
import Mathlib open scoped Pointwise open Finset
namespace PlunneckeType.NonAbelian
/-- Petridis, arXiv:1101.3507v3, p. 12, display (14) in the proof of Proposition 5.2. Let `A, B` be
finite sets in a (not necessarily commutative) group, `B` nonempty, with `|AbB| ≤ β|A|` for every
`b ∈ B`. If `S ⊆ A`, `T ⊆ B` and `|T| ≤ α`, then `|STB| ≤ αβ|A|`. The hypothesis `B.Nonempty`
(which the paper's condition (3) supplies) excludes the degenerate case where condition (2) is
vacuous and `β` may be negative. -/
theorem eq14_STB_le {G : Type*} [Group G] [DecidableEq G] (A B S T : Finset G) (α β : ℝ)
(hB : B.Nonempty)
(h2 : ∀ b ∈ B, (#(A * {b} * B) : ℝ) ≤ β * #A)
(hSA : S ⊆ A) (hTB : T ⊆ B) (hT : (#T : ℝ) ≤ α) :
(#(S * T * B) : ℝ) ≤ α * β * #A := by sorry
end PlunneckeType.NonAbelian
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.