In a
partially ordered set P, the
join and
meet of a
subset S are respectively the
supremum (least upper bound) of
S, denoted ⋁
S, and
infimum (greatest lower bound) of
S, denoted ⋀
S. In general, the join and meet of a subset of a partially ordered set need not exist; when they do exist, they are elements of
P.