"Definition: An ordered set
is said to have the least-upper-bound property if the following is true: If
,
is not empty, then sup
exists in
."
Example: subsets of
have the least-upper-bound property.
Annotations to Walter Rudin's Principles of Mathematical Analysis
No comments:
Post a Comment