If an ordered rng $A$ has a upper or lower bound, then $A = {0}$

43 Views Asked by At

Let $m$ be the upper bound of $A$. Then, $a \leq m$ for all $a\in A $.

Now I should maybe find a way to show that that inequality is in fact an equality. Or maybe there's an easier way that I don't see.

Thank you in advance.

1

There are 1 best solutions below

6
On

Hint: what can you say about $m + m$?