Join and meet

In mathematics, specifically order theory, the join of a subset S of a partially ordered set P is the supremum (least upper bound) of S, denoted ⋁S, and similarly, the meet of S is the infimum (greatest lower bound), denoted ⋀S. In general, the join and meet of a subset of a partially ordered set need not exist. Join and meet are dual to one another with respect to order inversion.

This Hasse diagram depicts a partially ordered set with four elements – a, b, the maximal element equal to the join of a and b (ab) and the minimal element equal to the meet of a and b (ab). The join/meet of a maximal/minimal element and another element is the maximal/minimal element and conversely the meet/join of a maximal/minimal element with another element is the other element. Thus every pair in this poset has both a meet and a join and the poset can be classified as a lattice (order theory).

A partially ordered set in which all pairs have a join is a join-semilattice. Dually, a partially ordered set in which all pairs have a meet is a meet-semilattice. A partially ordered set that is both a join-semilattice and a meet-semilattice is a lattice. A lattice in which every subset, not just every pair, possesses a meet and a join is a complete lattice. It is also possible to define a partial lattice, in which not all pairs have a meet or join but the operations (when defined) satisfy certain axioms.[1]

The join/meet of a subset of a totally ordered set is simply its maximal/minimal element, if such an element exists.

If a subset S of a partially ordered set P is also an (upward) directed set, then its join (if it exists) is called a directed join or directed supremum. Dually, if S is a downward directed set, then its meet (if it exists) is a directed meet or directed infimum.

Partial order approachEdit

Let A be a set with a partial order ≤, and let x and y be two elements in A. An element z of A is the meet (or greatest lower bound or infimum) of x and y, if the following two conditions are satisfied:

  1. zx and zy (i.e., z is a lower bound of x and y).
  2. For any w in A, such that wx and wy, we have wz (i.e., z is greater than or equal to any other lower bound of x and y).

If there is a meet of x and y, then it is unique, since if both z and z′ are greatest lower bounds of x and y, then zz and z′ ≤ z, and thus z = z. If the meet does exist, it is denoted xy. Some pairs of elements in A may lack a meet, either since they have no lower bound at all, or since none of their lower bounds is greater than all the others. If all pairs of elements from A have a meet, then the meet is a binary operation on A, and it is easy to see that this operation fulfils the following three conditions: For any elements x, y, and z in A,

a. xy = yx (commutativity),
b. x ∧ (yz) = (xy) ∧ z (associativity), and
c. xx = x (idempotency).

Joins are defined dually, and the join of x and y in A (if it exists) is denoted by xy. If not all pairs of elements from A have a meet (respectively, join), then the meet (respectively, join) can still be seen as a partial binary operation on A.

Universal algebra approachEdit

By definition, a binary operation ∧ on a set A is a meet if it satisfies the three conditions a, b, and c. The pair (A, ∧) is then a meet-semilattice. Moreover, we then may define a binary relation ≤ on A, by stating that xy if and only if xy = x. In fact, this relation is a partial order on A. Indeed, for any elements x, y, and z in A,

  • xx, since xx = x by c;
  • if xy and yx, then x = xy = yx = y by a; and
  • if xy and yz, then xz, since then xz = (xy) ∧ z = x ∧ (yz) = xy = x by b.

Note that both meets and joins equally satisfy this definition: a couple of associated meet and join operations yield partial orders which are the reverse of each other. When choosing one of these orders as the main ones, one also fixes which operation is considered a meet (the one giving the same order) and which is considered a join (the other one).

Equivalence of approachesEdit

If (A, ≤) is a partially ordered set, such that each pair of elements in A has a meet, then indeed xy = x if and only if xy, since in the latter case indeed x is a lower bound of x and y, and since clearly x is the greatest lower bound if and only if it is a lower bound. Thus, the partial order defined by the meet in the universal algebra approach coincides with the original partial order.

Conversely, if (A, ∧) is a meet-semilattice, and the partial order ≤ is defined as in the universal algebra approach, and z = xy for some elements x and y in A, then z is the greatest lower bound of x and y with respect to ≤, since

zx = xz = x ∧ (xy) = (xx) ∧ y = xy = z

and therefore zx. Similarly, zy, and if w is another lower bound of x and y, then wx = wy = w, whence

wz = w ∧ (xy) = (wx) ∧ y = wy = w.

Thus, there is a meet defined by the partial order defined by the original meet, and the two meets coincide.

In other words, the two approaches yield essentially equivalent concepts, a set equipped with both a binary relation and a binary operation, such that each one of these structures determines the other, and fulfil the conditions for partial orders or meets, respectively.

Meets of general subsetsEdit

If (A, ∧) is a meet-semilattice, then the meet may be extended to a well-defined meet of any non-empty finite set, by the technique described in iterated binary operations. Alternatively, if the meet defines or is defined by a partial order, some subsets of A indeed have infima with respect to this, and it is reasonable to consider such an infimum as the meet of the subset. For non-empty finite subsets, the two approaches yield the same result, and so either may be taken as a definition of meet. In the case where each subset of A has a meet, in fact (A, ≤) is a complete lattice; for details, see completeness (order theory).

NotesEdit

  1. ^ Grätzer 1996, p. 52.

ReferencesEdit

  • Davey, B.A.; Priestley, H.A. (2002). Introduction to Lattices and Order (2nd ed.). Cambridge: Cambridge University Press. ISBN 0-521-78451-4. Zbl 1002.06001.
  • Vickers, Steven (1989). Topology via Logic. Cambridge Tracts in Theoretic Computer Science. 5. ISBN 0-521-36062-5. Zbl 0668.54001.