The communcation complexity of functions defined in lattices is bounde
d from above and below, hereby generalizing former results of Lovasz [
1] and Ahlswede and Cai [2]. Especially in geometric lattices, upper a
nd lower bound often differ by at most one bit.