We prove that a bounded poset of finite length is a lattice if and only if the following condition holds: whenever two elementsx 1,x 2 that cover a common elementx are both smaller that two elementsy 1,y 2 that are covered by a common elementy, then there exists an elementz that is an upper bound forx 1,x 2 and a lower bound fory 1,y 2.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Birkhoff, G.,Lattice theory, 3. ed., Amer. Math. Soc. Colloquium publ.25, 1967.
Björner, A., Edelman, P. H. andZiegler, G. M.,Hyperplane arrangements with a lattice of regions, Discrete Comput. Geometry5 (1990), 263–288.
Stanley, R. P.,Enumerative Combinatorics, Volume I, Wadsworth, 1986.
Ziegler, G. M.,Higher Bruhat orders and cyclic hyperplane arrangements, Topology32 (1993), 259–279.
About this article
Cite this article
Ziegler, G.M. A new local criterion for the lattice property. Algebra Universalis 31, 608–610 (1994). https://doi.org/10.1007/BF01236510
- Lattice Property
- Finite Length
- Local Criterion
- Bounded Poset