Lower bound for monotone Boolean convolution

Abstract

Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n^2$ and-gates. This precisely matches the obvious upper bound.

Lemma 5 fails and this seems vital to the current approach