We now move on to the reals.
The extended reals: , by letting for all . LUB , GLB , and for , and .
Every sequence in has a limit superior and a limit inferior:
and converges iff .
Let . Then
Infinite arithmetic: for all , and , ; for all , for all ; ; but is undefined.
For sums of uncountably many nonnegative numbers: if is an arbitrary set and , we define to be the supremum of its finite partial sums:
Proposition 0.5.1. Given , let . If is uncountable, then . If is countably infinite, then , where is any bijection and the sum on the right is an ordinary infinite series.
Proof. with . uncountable some must be uncountable there are arbitrarily large partial sums with , finite.
countably infinite: take a bijection and set . Every finite is contained in some , so
Take the sup over :
Finally take the sup over . ∎
For functions into : for all , and is the function whose value at is . If and , then is increasing if whenever , and strictly increasing if whenever ; the inverse for decreasing/strictly decreasing. A function which is either increasing or decreasing is called monotone.
For or , is the absolute value or modulus. For points or , is the Euclidean norm:
Recall is open if for every , includes an interval centered at (an open ball or neighborhood).
Proposition 0.5.2. Every open set in is a countable disjoint union of open intervals.