In this note, arbitrary switching function realizers and their complexity are defined. Then, a lower bound on the complexity is derived in terms of the number of such switching function realizers required to realize all Boolean functions of n variables.