A size-width inequality for distributive lattices

Abstract

We show that every collection ofw sets such that none contains any other generates at least 3w-2 sets under the operations of taking intersections and unions. In particular, we prove that if the finite distributive lattice ℒ contains an antichain of sizew, then |ℒ| ≧3w, forw≠1, 2, 3, 6, where the minimal exceptional cases arise from the Boolean algebras ℬ_n withn=0, 1, 2, 3, 4 atoms.