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.

Least upper bound

From AoPSWiki

Revision as of 05:37, 6 March 2008 by Shreyas patankar (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

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


Given a subset S in some larger partially ordered set R, a least upper bound or supremum, for S is an element M \in R such that s \leq M for every s \in S and there is no m < M with this same property.

If the least upper bound M of S is an element of S, it is also the maximum of S. If M \not\in S, then S has no maximum.


Completeness: This is one of the fundamental axioms of real analysis.

A set S is said to be complete if any nonempty subset of S that is bounded above has a supremum.

The fact that \mathbb{R} is complete is something intuitively clear but impossible to prove using only the field and order properties of \mathbb{R}

Looking for a challenging geometry text? Preparing for MATHCOUNTS or the AMC exams? Check out Art of Problem Solving's Introduction to Geometry by Richard Rusczyk.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us