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 6Lattice Completion

6.1 INTRODUCTION

We have seen that lattices are nicer structures than general posets because they allow us to take the meet and the join for any pair of elements in the set. What if we wanted to take the join and the meet of arbitrary subsets? Complete lattices allow us to do exactly that. All finite lattices are complete, so the concept of complete lattices is important only for infinite lattices. In this chapter, we first discuss complete lattices and show many ways in which complete lattices arise in mathematics and computer science. In particular, topped c06-math-0001structures and closure operators give us complete lattices.

Next we consider the question: What if the given poset is not a complete lattice or even a lattice? Can we embed it into a complete lattice? This brings us to the notion of lattice completion which is useful for both finite and infinite posets.

6.2 COMPLETE LATTICES

Recall the definition of a complete lattice.

Finite lattices are always ...

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