Join-semidistributive lattices and convex geometries

We introduce the notion of a convex geometry extending the notion of a finite closure system with the anti-exchange property known in combinatories. This notion becomes essential for the different embedding results in the class of join-semidistributive lattices. In particular, we prove that every finite join-semidistribUtive lattice can be embedded into a lattice S-P(A) of algebraic subsets of a suitable algebraic lattice A. This latter construction, S-P(A), is a key example of a convex geometry that plays an analogous role in hierarchy of join semidistributive lattices as a lattice of equivalence relations does in the class of modular lattices. We give numerous examples of convex geometries that emerge in different branches of mathematics from geometry to graph theory. We also discuss the introduced notion of a strong convex geometry that might promise the development of rich structural theory of convex geometries. (C) 2002 Elsevier Science (USA). All rights reserved.