Let E,F⊆R be nonempty and bounded
above/below where needed, and let c∈R.
Order properties:
- If E⊆F and both are bounded above, then HAHAHUGOSHORTCODE515s1HBHBE≤supF.
- If E⊆F and both are bounded below, then HAHAHUGOSHORTCODE515s2HBHBE≥infF.
Translation:
- If E+c={x+c:x∈E}, then
sup(E+c)=supE+c,inf(E+c)=infE+c.
Scaling:
- If λ≥0 and λE={λx:x∈E}, then
sup(λE)=λsupE,inf(λE)=λinfE.
- If λ<0, then
sup(λE)=λinfE,inf(λE)=λsupE.
In particular,
sup(−E)=−infE,inf(−E)=−supE.
Finite unions:
- If E and F are bounded above, then E∪F is bounded above and
sup(E∪F)=HAHAHUGOSHORTCODE515s3HBHB{supE,supF}.
Similarly, if bounded below then
inf(E∪F)=HAHAHUGOSHORTCODE515s4HBHB{infE,infF}.
These rules are used constantly to manipulate bounds and to compare limiting processes.
Proof sketch:
All statements follow by checking the defining universal properties of sup and inf. For example, to show sup(E+c)=supE+c, note that u is an upper bound
for E+c iff u−c is an upper bound for E, then apply least-upper-bound minimality.