TheoremBase

Proof

Suppose ss and s′s' are both least upper bounds of XX in the sense of Upper Bound and Least Upper Bound. In particular each is an upper bound for XX. Since ss is a least upper bound and s′s' is an upper bound, s≤s′s\le s'; since s′s' is a least upper bound and ss is an upper bound, s′≤ss'\le s. By the antisymmetry axiom of a total order, s=s′s=s'.

Suppose mm and m′m' are both greatest lower bounds of XX in the sense of Lower Bound and Greatest Lower Bound in a Totally Ordered Set. In particular each is a lower bound for XX. Since m′m' is a greatest lower bound and mm is a lower bound, m≤m′m\le m'; since mm is a greatest lower bound and m′m' is a lower bound, m′≤mm'\le m. By antisymmetry, m=m′m=m'.

Thus XX has at most one least upper bound and at most one greatest lower bound, so the notations sup⁡X\sup X and inf⁡X\inf X are unambiguous whenever the corresponding bound exists.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…