In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b.

One can also speak of the meet operation in a general partially ordered set. If a and b are two elements in some partially ordered set (A,<=), and if there is a greatest element c (with respect to the given order) with the property that c<=a and c<=b, then c is said to be the meet of a and b.

See also

Greatest Lower Bound, Join

This entry contributed by Rasmus Hedegaard

Explore with Wolfram|Alpha

Cite this as:

Hedegaard, Rasmus. "Meet." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein.

Subject classifications