Total mass of the additive convolution is
ProvedFinset.sum_addConvolution_eq_card_productadditive-combinatoricsadditive-energybalog-szemeredi-gowersdouble-counting
Let be an additive commutative group and let be finite sets. With the number of representations with and , one has
Every pair contributes exactly one to the fibre over its sum , and every such sum lies in , so the fibres of partition .
This elementary total-mass identity underpins the energy-to-graph step in two places. It bounds the contribution of the unpopular fibres to the energy, so that large energy forces many popular pairs. And it bounds the number of popular sums by a threshold (Markov) argument: if and every has , then
so . That second bound is total mass plus a threshold, with no Cauchy-Schwarz step.
Preamble
import Mathlib open scoped Pointwise
Formal statement
theorem Finset.sum_addConvolution_eq_card_product {G : Type*} [AddCommGroup G] [DecidableEq G]
(X Y : Finset G) :
∑ s ∈ X + Y, X.addConvolution Y s = X.card * Y.card := by sorry
Source
Elementary total-mass identity sum_s r(s) = |X||Y| for the additive convolution; used inside the proof of Tao-Vu, Additive Combinatorics, Cambridge Univ. Press (2006), Lemma 2.30 (p. 80). Not separately stated in the cited works. Formalized in https://github.com/mysticflounder/lean-formalizations/blob/dd46c17a2a034d7bfa0df02e7f77834d35592864/lean/LeanFormalizations/Combinatorics/Additive/BalogSzemerediGowers.lean#L39-L52
Human review
Confirmed by the mission captain (proposal self-audit).