An Optimal Gap-Majority Lemma for Bounded Rounds Communication

Recent work of Sawettamalya and Yu (FOCS 2026) initiated the study of \emph{gap-majority} composition in randomized communication. They showed that if computing a $\{\pm 1\}$-valued function $f$ in $r$ rounds requires $I$ bits of information, then distinguishing ${\sum }_{i=1}^{n}f(X_i,Y_i)\ge 0.01\sqrt{n}$ from ${\sum }_{i=1}^{n}f(X_i,Y_i)\le -0.01\sqrt{n}$ in $r$ rounds requires $n\cdot (I-O(\log n))$ bits of information. They also conjectured that the $O(\log n)$-additive ``loss’’ can be further reduced to $O(1)$. In this note, we record that a minor adaptation to their approach combining with a finer analysis achieves the conjectured $O(1)$ loss, establishing a gap-majority lemma for bounded-round communication that is optimal up to constant factors.