# Some properties on supermum

• Feb 5th 2009, 07:17 PM
h2osprey
Some properties on supermum
T or F:

Suppose that A and B are bounded sets in the real numbers.

1) sup (A U B) = max {sup A, sup B}

2) If the elements of A and B are positive and A.B = {ab | a is in A, b is in B}, then sup(A.B) = sup(A)sup(B)

3) The analogous problems for the greatest lower bound.

I believe all of them are true, but just wanted to make sure before I started on the proofs. Thanks!
• Feb 6th 2009, 01:54 AM
clic-clac
Hi.

Let $C$ be a bounded real set, the set of upper bounds of $C$ has always a minimal element, which is the supremum of $C.$

Now for instance, 1):
$A,B$ two bounded real sets.
$a=supA$ and $b=supB$ and $c=sup(A\cup B).\ \forall t\in \mathbb{R},$

$t=c$
$\Leftrightarrow (\forall x\in A\cup B, x\leq c)\wedge (\forall y\in\mathbb{R}(\forall x\in A\cup B,\ y\geq x\Rightarrow y\geq c))$
$\Leftrightarrow (\forall x\in A,\ x\leq c\wedge \forall x\in B, x\leq c)\wedge (\forall x \in\mathbb{R} (x\geq a\wedge x\geq b)\Rightarrow x\geq c)$
$\Rightarrow (a\leq c\wedge b\leq c)\wedge (c\leq max\{a,b\})$
$\Rightarrow (max\{a,b\}\leq c)\wedge (c\leq max\{a,b\})$
$\Rightarrow c=max\{a,b\}$
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 13, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}