Fermi
·
Concept Library
·
Courses
·
Books
·
Problems
·
Simulations
·
Math Wiki
·
High School
Fermi
›
Problems
Lebl-Basic-Analysis-I
· Problem 1.1.5
Real Numbers
Mathematics · ordered-sets-supremum-infimum
Problem
Let
S
S
S
be an ordered set. Let
A
⊂
S
A \subset S
A
⊂
S
and suppose
b
b
b
is an upper bound for
A
A
A
. Suppose
b
∈
A
b \in A
b
∈
A
. Show that
b
=
sup
A
b = \sup A
b
=
sup
A
.
Related theory
Relations As Sets Of Ordered Pairs
Browse the problem library