Skip to main content

Chapter 6 Partially Ordered Sets

Discussion 6.1.

Alice was surfing the web and found a site listing top movies, grouped by categories (comedy, drama, family, etc) as well as by the decade in which they were released. Alice was intrigued by the critic's choices and rankings, especially for the top seven dramas from the 1990's. Alice agreed with the critic's choices as a group but not the specific rankings. She wrote the critic's rankings on the board and just to the right, she gave her own rankings, all the time insisting that she was certainly correct in her opinions.

Movie Critic's Ranking Alice's Ranking
1 Saving Private Ryan Life is Beautiful
2 Life is Beautiful Saving Private Ryan
3 Forrest Gump Good Will Hunting
4 Braveheart Titanic
5 Good Will Hunting Braveheart
6 Titanic Forrest Gump
7 Jurassic Park Jurassic Park

Dave studied the two rankings and listened carefully to Alice's rationale (which he felt was a bit over the top), but eventually, he held up the following diagram and offered it as a statement of those comparisons on which both Alice and the movie critic were in agreement.

Figure 6.2. Top Movies from the 90's

Do you see how Dave made up this diagram? Add your own rankings of these seven films and then draw the diagram that Dave would produce as a statement about the comparisons on which you, Alice and the movie critic were in agreement.

More generally, when humans are asked to express preferences among a set of options, they often report that establishing a totally ranked list is difficult if not impossible. Instead, they prefer to report a partial order—where comparisons are made between certain pairs of options but not between others. In this chapter, we make these observations more concrete by introducing the concept of a partially ordered set. Elementary examples include (1) a family of sets which is partially ordered by inclusion and (2) a set of positive integers which is partially ordered by division. From an applications standpoint, a complex construction job typically involves a large number of projects for which there is a notion of precedence between some but not all pairs. Also, computer file systems are modeled by trees which become partially ordered sets whenever links are added.