A note on Boolean lattices of finite posets


Branimir Šešelja, Andreja Tepavčević




It is proved that the collection of all finite partially ordered sets with the same poset of meet-irreducible elements is a finite Boolean algebra, and that every finite Boolean algebra can be represented by such collection. In addition, we give necessary and sufficient conditions under which a lattice of all lattices determined by the same poset of meet-irreducibles is a sublattice of the mentioned Boolean lattice.