To prove the communication lower bound of a deterministic protocol \(\Pi ^{\prime }\)  that has error probability \(\le \error \)  w.r.t. \(\mathcal {H}\) ,
we recall the following protocol decomposition by monochromatic rectangles, c.f. Claim 24 in [1]} or Lemma 1.16 in [2]}.
