en.wikipedia.org

Join and meet - Wikipedia

From Wikipedia, the free encyclopedia

Transitive binary relations
Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric
Total, Semiconnex Anti-
reflexive
Equivalence relation Green tick ✗ ✗ ✗ ✗ ✗ Green tick ✗ ✗
Preorder (Quasiorder) ✗ ✗ ✗ ✗ ✗ ✗ Green tick ✗ ✗
Partial order ✗ Green tick ✗ ✗ ✗ ✗ Green tick ✗ ✗
Total preorder ✗ ✗ Green tick ✗ ✗ ✗ Green tick ✗ ✗
Total order ✗ Green tick Green tick ✗ ✗ ✗ Green tick ✗ ✗
Prewellordering ✗ ✗ Green tick Green tick ✗ ✗ Green tick ✗ ✗
Well-quasi-ordering ✗ ✗ ✗ Green tick ✗ ✗ Green tick ✗ ✗
Well-ordering ✗ Green tick Green tick Green tick ✗ ✗ Green tick ✗ ✗
Lattice ✗ Green tick ✗ ✗ Green tick Green tick Green tick ✗ ✗
Join-semilattice ✗ Green tick ✗ ✗ Green tick ✗ Green tick ✗ ✗
Meet-semilattice ✗ Green tick ✗ ✗ ✗ Green tick Green tick ✗ ✗
Strict partial order ✗ Green tick ✗ ✗ ✗ ✗ ✗ Green tick Green tick
Strict weak order ✗ Green tick ✗ ✗ ✗ ✗ ✗ Green tick Green tick
Strict total order ✗ Green tick Green tick ✗ ✗ ✗ ✗ Green tick Green tick
Symmetric Antisymmetric Connected Well-founded Has joins Has meets Reflexive Irreflexive Asymmetric
Definitions, for all {\displaystyle a,b} and {\displaystyle S\neq \varnothing :} {\displaystyle {\begin{aligned}&aRb\\\Rightarrow {}&bRa\end{aligned}}} {\displaystyle {\begin{aligned}aRb{\text{ and }}&bRa\\\Rightarrow a={}&b\end{aligned}}} {\displaystyle {\begin{aligned}a\neq {}&b\Rightarrow \\aRb{\text{ or }}&bRa\end{aligned}}} {\displaystyle {\begin{aligned}\min S\\{\text{exists}}\end{aligned}}} {\displaystyle {\begin{aligned}a\vee b\\{\text{exists}}\end{aligned}}} {\displaystyle {\begin{aligned}a\wedge b\\{\text{exists}}\end{aligned}}} {\displaystyle aRa} {\displaystyle {\text{not }}aRa} {\displaystyle {\begin{aligned}aRb\Rightarrow \\{\text{not }}bRa\end{aligned}}}
Green tick indicates that the column's property is always true for the row's term (at the very left), while ✗ indicates that the property is not guaranteed in general (it might, or might not, hold). For example, that every equivalence relation is symmetric, but not necessarily antisymmetric, is indicated by Green tick in the "Symmetric" column and ✗ in the "Antisymmetric" column, respectively.

All definitions tacitly require the homogeneous relation {\displaystyle R} be transitive: for all {\displaystyle a,b,c,} if {\displaystyle aRb} and {\displaystyle bRc} then {\displaystyle aRc.}
A term's definition may require additional properties that are not listed in this table.

This Hasse diagram depicts a partially ordered set with four elements: a, b, the maximal element a {\displaystyle \vee } b equal to the join of a and b, and the minimal element a {\displaystyle \wedge } b equal to the meet of a and b. 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.

In mathematics, specifically order theory, the join of a subset {\displaystyle S} of a partially ordered set {\displaystyle P} is the supremum (least upper bound) of {\displaystyle S,} denoted {\textstyle \bigvee S,} and similarly, the meet of {\displaystyle S} is the infimum (greatest lower bound), denoted {\textstyle \bigwedge 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.

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 the maximal/minimal element of that subset, if such an element exists.

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

Partial order approach

[edit]

Let {\displaystyle A} be a set with a partial order {\displaystyle \,\leq ,\,} and let {\displaystyle x,y\in A.} An element {\displaystyle m} of {\displaystyle A} is called the meet (or greatest lower bound or infimum) of {\displaystyle x{\text{ and }}y} and is denoted by {\displaystyle x\wedge y,} if the following two conditions are satisfied:

  1. {\displaystyle m\leq x{\text{ and }}m\leq y} (that is, {\displaystyle m} is a lower bound of {\displaystyle x{\text{ and }}y}).
  2. For any {\displaystyle w\in A,} if {\displaystyle w\leq x{\text{ and }}w\leq y,} then {\displaystyle w\leq m} (that is, {\displaystyle m} is greater than or equal to any other lower bound of {\displaystyle x{\text{ and }}y}).

The meet need not exist, either since the pair has no lower bound at all, or since none of the lower bounds is greater than all the others. However, if there is a meet of {\displaystyle x{\text{ and }}y,} then it is unique, since if both {\displaystyle m{\text{ and }}m^{\prime }} are greatest lower bounds of {\displaystyle x{\text{ and }}y,} then {\displaystyle m\leq m^{\prime }{\text{ and }}m^{\prime }\leq m,} and thus {\displaystyle m=m^{\prime }.}[2] If not all pairs of elements from {\displaystyle A} have a meet, then the meet can still be seen as a partial binary operation on {\displaystyle A.}[1]

If the meet does exist then it is denoted {\displaystyle x\wedge y.} If all pairs of elements from {\displaystyle A} have a meet, then the meet is a binary operation on {\displaystyle A,} and it is easy to see that this operation fulfills the following three conditions: For any elements {\displaystyle x,y,z\in A,}

  1. {\displaystyle x\wedge y=y\wedge x} (commutativity),
  2. {\displaystyle x\wedge (y\wedge z)=(x\wedge y)\wedge z} (associativity), and
  3. {\displaystyle x\wedge x=x} (idempotency).

Joins are defined dually with the join of {\displaystyle x{\text{ and }}y,} if it exists, denoted by {\displaystyle x\vee y.} An element {\displaystyle j} of {\displaystyle A} is the join (or least upper bound or supremum) of {\displaystyle x{\text{ and }}y} in {\displaystyle A} if the following two conditions are satisfied:

  1. {\displaystyle x\leq j{\text{ and }}y\leq j} (that is, {\displaystyle j} is an upper bound of {\displaystyle x{\text{ and }}y}).
  2. For any {\displaystyle w\in A,} if {\displaystyle x\leq w{\text{ and }}y\leq w,} then {\displaystyle j\leq w} (that is, {\displaystyle j} is less than or equal to any other upper bound of {\displaystyle x{\text{ and }}y}).

Universal algebra approach

[edit]

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

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 approaches

[edit]

If {\displaystyle (A,\leq )} is a partially ordered set, such that each pair of elements in {\displaystyle A} has a meet, then indeed {\displaystyle x\wedge y=x} if and only if {\displaystyle x\leq y,} since in the latter case indeed {\displaystyle x} is a lower bound of {\displaystyle x{\text{ and }}y,} and since {\displaystyle 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 {\displaystyle (A,\wedge )} is a meet-semilattice, and the partial order {\displaystyle \,\leq \,} is defined as in the universal algebra approach, and {\displaystyle z=x\wedge y} for some elements {\displaystyle x,y\in A,} then {\displaystyle z} is the greatest lower bound of {\displaystyle x{\text{ and }}y} with respect to {\displaystyle \,\leq ,\,} since {\displaystyle z\wedge x=x\wedge z=x\wedge (x\wedge y)=(x\wedge x)\wedge y=x\wedge y=z} and therefore {\displaystyle z\leq x.} Similarly, {\displaystyle z\leq y,} and if {\displaystyle w} is another lower bound of {\displaystyle x{\text{ and }}y,} then {\displaystyle w\wedge x=w\wedge y=w,} whence {\displaystyle w\wedge z=w\wedge (x\wedge y)=(w\wedge x)\wedge y=w\wedge y=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 fulfill the conditions for partial orders or meets, respectively.

Meets of general subsets

[edit]

If {\displaystyle (A,\wedge )} 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 {\displaystyle 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 {\displaystyle A} has a meet, in fact {\displaystyle (A,\leq )} is a complete lattice; for details, see completeness (order theory).

If some power set {\displaystyle \wp (X)} is partially ordered in the usual way (by {\displaystyle \,\subseteq }) then joins are unions and meets are intersections; in symbols, {\displaystyle \,\vee \,=\,\cup \,{\text{ and }}\,\wedge \,=\,\cap \,} (where the similarity of these symbols may be used as a mnemonic for remembering that {\displaystyle \,\vee \,} denotes the join/supremum and {\displaystyle \,\wedge \,} denotes the meet/infimum[note 1]).

More generally, suppose that {\displaystyle {\mathcal {F}}\neq \varnothing } is a family of subsets of some set {\displaystyle X} that is partially ordered by {\displaystyle \,\subseteq .\,} If {\displaystyle {\mathcal {F}}} is closed under arbitrary unions and arbitrary intersections and if {\displaystyle A,B,\left(F_{i}\right)_{i\in I}} belong to {\displaystyle {\mathcal {F}}} then {\displaystyle A\vee B=A\cup B,\quad A\wedge B=A\cap B,\quad \bigvee _{i\in I}F_{i}=\bigcup _{i\in I}F_{i},\quad {\text{ and }}\quad \bigwedge _{i\in I}F_{i}=\bigcap _{i\in I}F_{i}.} But if {\displaystyle {\mathcal {F}}} is not closed under unions then {\displaystyle A\vee B} exists in {\displaystyle ({\mathcal {F}},\subseteq )} if and only if there exists a unique {\displaystyle \,\subseteq }-smallest {\displaystyle J\in {\mathcal {F}}} such that {\displaystyle A\cup B\subseteq J.} For example, if {\displaystyle {\mathcal {F}}=\{\{1\},\{2\},\{1,2,3\},\mathbb {R} \}} then {\displaystyle \{1\}\vee \{2\}=\{1,2,3\}} whereas if {\displaystyle {\mathcal {F}}=\{\{1\},\{2\},\{1,2,3\},\{0,1,2\},\mathbb {R} \}} then {\displaystyle \{1\}\vee \{2\}} does not exist because the sets {\displaystyle \{0,1,2\}{\text{ and }}\{1,2,3\}} are the only upper bounds of {\displaystyle \{1\}{\text{ and }}\{2\}} in {\displaystyle ({\mathcal {F}},\subseteq )} that could possibly be the least upper bound {\displaystyle \{1\}\vee \{2\}} but {\displaystyle \{0,1,2\}\not \subseteq \{1,2,3\}} and {\displaystyle \{1,2,3\}\not \subseteq \{0,1,2\}.} If {\displaystyle {\mathcal {F}}=\{\{1\},\{2\},\{0,2,3\},\{0,1,3\}\}} then {\displaystyle \{1\}\vee \{2\}} does not exist because there is no upper bound of {\displaystyle \{1\}{\text{ and }}\{2\}} in {\displaystyle ({\mathcal {F}},\subseteq ).}

  1. ^ a b Grätzer, George (21 November 2002). General Lattice Theory: Second edition. Springer Science & Business Media. p. 52. ISBN 978-3-7643-6996-5.
  2. ^ Hachtel, Gary D.; Somenzi, Fabio (1996). Logic synthesis and verification algorithms. Kluwer Academic Publishers. p. 88. ISBN 0792397460.