AoPSWiki
Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.

Greatest lower bound

From AoPSWiki

Given a subset S in some larger partially ordered set R, a greatest lower bound or infemum for S is an element \displaystyle m \in R such that m \leq s for every s \in S and there is no M > m with this same property.

If the greatest lower bound m of S is an element of S, it is also the minimum of S. If m \not\in S, then S has no minimum.

See also

This article is a stub. Help us out by expanding it.

Our Precalculus course starts on Dec. 4. Master trig, complex numbers, and vectors and matrices in 2 and 3 dimensions. Click here to enroll today!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us