(12) — a nonempty minimal-growth satisfies for every finite
ProvedPlunneckeType.NonAbelian.eq12_CSB_leLet be a group, not necessarily commutative, and let and be finite subsets of . Write for the product of two sets and for cardinality. Let be a real number with
Let be a nonempty subset that grows minimally under right multiplication by among the nonempty subsets of :
Then for every finite set
This is display (12) of the paper, the first step of the proofs of Proposition 5.2 and Theorem 1.7: the minimal-growth subset controls every triple product , with one constant for all simultaneously.
Formalization Note The minimality condition is written cross-multiplied, for every nonempty , which is equivalent to the ratio form since and are nonempty. Cardinalities are cast to ; is an arbitrary real number. The order of the factors in is kept.
import Mathlib open scoped Pointwise open Finset
namespace PlunneckeType.NonAbelian
/-- Petridis, arXiv:1101.3507v3, p. 12, display (12) in the proof of Proposition 5.2. Let `A, B` be
finite sets in a (not necessarily commutative) group with `|AB| ≤ α|A|`, and let `S ⊆ A` be nonempty
with `|SB|/|S| ≤ |ZB|/|Z|` for every nonempty `Z ⊆ A` (written cross-multiplied). Then
`|CSB| ≤ α|CS|` for every finite set `C`. -/
theorem eq12_CSB_le {G : Type*} [Group G] [DecidableEq G] (A B S : Finset G) (α : ℝ)
(h1 : (#(A * B) : ℝ) ≤ α * #A)
(hSA : S ⊆ A) (hS : S.Nonempty)
(hmin : ∀ Z ⊆ A, Z.Nonempty → (#(S * B) : ℝ) * #Z ≤ #(Z * B) * #S) :
∀ C : Finset G, (#(C * S * B) : ℝ) ≤ α * #(C * S) := by sorry
end PlunneckeType.NonAbelian
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.