O'Reilly logo

Introduction to Lattice Theory with Computer Science Applications by Vijay K. Garg

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 5Lattices

5.1 Introduction

Given a poset, the two most fundamental derived operations on the elements of the poset are the join and the meet operations. As we have seen earlier, join and meet operations may not exist for all subsets of the poset. This observation motivates the notion of lattices that occur in many different contexts. Let us recall the definition of a lattice from Chapter 1.

If c05-math-0004 exists, then we call it a sup semilattice. If c05-math-0005 exists, then we call it an inf semilattice.

In our definition of a lattice, we have required the existence of c05-math-0006's and c05-math-0007's for sets of size two. This is equivalent to the requirement of the existence of 's and 's for sets of finite size by using induction (see Problem 5.6).

We now ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required