upper bound (original) (raw)

Let S be a set with a partial ordering ≤, and let T be a subset of S. An upper bound for T is an element z∈S such that x≤z for all x∈T. We say that T is bounded from above if there exists an upper bound for T.

Lower bound, and bounded from below are defined in a similar manner.