Difference between revisions of "Least upper bound"
m (rename) |
m |
||
| Line 1: | Line 1: | ||
| − | |||
| − | |||
| − | |||
Given a [[subset]] <math>S</math> in some larger [[partially ordered set]] <math>R</math>, a '''least upper bound''' or '''supremum''', for <math>S</math> is an [[element]] <math>M \in R</math> such that <math>s \leq M</math> for every <math>s \in S</math> and there is no <math>m < M</math> with this same property. | Given a [[subset]] <math>S</math> in some larger [[partially ordered set]] <math>R</math>, a '''least upper bound''' or '''supremum''', for <math>S</math> is an [[element]] <math>M \in R</math> such that <math>s \leq M</math> for every <math>s \in S</math> and there is no <math>m < M</math> with this same property. | ||
| Line 13: | Line 10: | ||
The fact that <math>\mathbb{R}</math> is complete is something intuitively clear but impossible to prove using only the field and order properties of <math>\mathbb{R}</math> | The fact that <math>\mathbb{R}</math> is complete is something intuitively clear but impossible to prove using only the field and order properties of <math>\mathbb{R}</math> | ||
| + | ==See also== | ||
| + | *[[Greatest lower bound]] | ||
| + | {{stub}} | ||
[[Category:Definition]] | [[Category:Definition]] | ||
Latest revision as of 14:08, 5 March 2022
Given a subset 
in some larger partially ordered set 
, a least upper bound or supremum, for is an element 
such that 
for every 
and there is no 
with this same property.
If the least upper bound 
of is an element of , it is also the maximum of . If 
, then has no maximum.
Completeness: This is one of the fundamental axioms of real analysis.
A set is said to be complete if any nonempty subset of that is bounded above has a supremum.
The fact that 
is complete is something intuitively clear but impossible to prove using only the field and order properties of
See also
This article is a stub. Help us out by expanding it.
