Key Concepts of Hasse Diagrams

Why This Matters

Hasse diagrams are the visual language of lattice theory—they transform abstract order relations into intuitive pictures you can actually analyze. When you're working with partially ordered sets, these diagrams let you immediately spot structural features like minimal elements, maximal elements, bounds, chains, and antichains without wading through formal definitions. You're being tested on your ability to read these diagrams, extract information about ordering relationships, and connect visual patterns to algebraic properties.

The real power of Hasse diagrams lies in what they reveal about lattice structure. Whether you're identifying whether a poset forms a lattice, checking for distributivity, or analyzing Boolean algebras, the diagram tells the story. Don't just memorize how to draw these diagrams—know what each visual feature represents and how to use the diagram to answer questions about suprema, infima, covering relations, and duality.

---

Foundational Structure: Building the Diagram

Before analyzing complex properties, you need to understand how Hasse diagrams encode order relations. The key insight is that these diagrams show only the essential ordering information—everything else can be inferred from transitivity.

Definition and Basic Properties

• Vertices represent elements of a finite partially ordered set (poset), with edges showing the order relation between them
• Vertical positioning encodes order—if $a < b$, then $a$ appears lower than $b$ in the diagram
• Transitive edges are omitted—if $a < b < c$, only edges $a \to b$ and $b \to c$ appear, not $a \to c$

Covering Relations

• Element $a$ covers element $b$ when $a > b$ and no element $c$ exists such that $a > c > b$
• Direct edges represent covers—every line segment in a Hasse diagram corresponds to exactly one covering relation
• Reading the diagram means following chains of covers; two elements are comparable if and only if a path connects them

Representation of Partial Orders

• Partial orders satisfy three axioms—reflexive ($a \leq a$), antisymmetric ($a \leq b$ and $b \leq a$ implies $a = b$), and transitive
• Visual simplification comes from omitting reflexive loops and transitive edges entirely
• Comparability is path-dependent—two elements are comparable precisely when one lies above the other along some sequence of edges

---

Extremal Elements: Finding the Boundaries

Identifying special elements in a poset is one of the most common diagram-reading tasks. The visual structure makes extremal elements immediately apparent—they sit at the edges of the diagram.

Minimal and Maximal Elements

• Minimal elements have no elements below them—they appear at the bottom of the diagram with no downward edges
• Maximal elements have no elements above them—they sit at the top with no upward edges
• Multiple extrema are possible—a poset can have several minimal or maximal elements, unlike least/greatest elements which must be unique

Least Upper Bounds (Suprema) and Greatest Lower Bounds (Infima)

• The supremum (join) of a set is the smallest element greater than or equal to every element in that set, denoted $a \vee b$ for two elements
• The infimum (meet) of a set is the largest element less than or equal to every element, denoted $a \wedge b$
• Bounds may not exist—in a general poset, two elements might lack a supremum or infimum; this is exactly what distinguishes lattices from arbitrary posets

---

Substructures: Chains and Antichains

Understanding how elements relate to each other in groups reveals the internal geometry of a poset. Chains represent total ordering within the poset; antichains represent complete incomparability.

Chains and Antichains

• A chain is a totally ordered subset—every pair of elements in the chain is comparable, appearing as a vertical path in the diagram
• An antichain is a set of mutually incomparable elements—no two elements in an antichain have a path between them, appearing as elements at the "same level"
• Dilworth's theorem connects them—the minimum number of chains needed to cover a poset equals the size of its maximum antichain

---

Lattice Properties: When Structure Gets Special

A poset becomes a lattice when every pair of elements has both a supremum and an infimum. Lattices have predictable, well-behaved structure that Hasse diagrams reveal clearly.

Lattices and Their Representation

• Every pair has a unique join and meet—this is the defining property; if any pair lacks a supremum or infimum, it's not a lattice
• Visual test for lattice structure—for any two elements, trace upward to find where paths first converge (join) and downward for where they last diverge (meet)
• Bounded lattices have top and bottom—a greatest element $1$ and least element $0$ that bound all other elements

Distributive Lattices

• Distributivity means join and meet distribute—$a \wedge (b \vee c) = (a \wedge b) \vee (a \wedge c)$ and the dual identity hold
• Visual criterion exists—a lattice is distributive if and only if it contains no sublattice isomorphic to $N_5$ (pentagon) or $M_3$ (diamond)
• Applications span multiple fields—distributive lattices model propositional logic, set operations, and divisibility relations

Boolean Algebras

• Boolean algebras are complemented distributive lattices—every element $a$ has a complement $a'$ such that $a \vee a' = 1$ and $a \wedge a' = 0$
• Hasse diagrams form hypercubes—the Boolean algebra on $n$ generators has $2^n$ elements arranged as an $n$-dimensional cube
• Fundamental to logic and computing—Boolean algebras formalize AND, OR, and NOT operations central to circuit design and set theory

---

Structural Principles: Duality and Symmetry

One of lattice theory's most powerful tools is the duality principle, which doubles your theorems for free. Every statement about a poset has a dual obtained by reversing the order relation.

Duality Principle

• Flip the diagram upside down—the dual of a Hasse diagram reverses all order relations, swapping $\leq$ for $\geq$
• Dual statements are automatically valid—any theorem about meets dualizes to a theorem about joins, minimal to maximal, infimum to supremum
• Self-dual structures are symmetric—some lattices (like Boolean algebras) are isomorphic to their own duals

---

Quick Reference Table

---

Self-Check Questions

1. Given a Hasse diagram, how do you determine whether two elements are comparable, and what visual feature tells you one element covers another?

2. What distinguishes a minimal element from a least element, and can a poset have multiple of each?

3. Compare the conditions for a poset to be a lattice versus a distributive lattice—what additional constraint does distributivity impose, and how can you detect its failure visually?

4. If you flip a Hasse diagram upside down, what happens to the supremum of two elements? What about chains and antichains?

5. Explain why every Boolean algebra is a distributive lattice but not every distributive lattice is a Boolean algebra. What structural feature must be present for a distributive lattice to qualify as Boolean?