Infimums, Supremums, and Ordered Sets (Proof Verification)

23 Views Asked by At

I'm practicing my proof-writing and was hoping you could let me know if this proof looks good. I would like to know if the proof is incorrect, if there are parts that are overly wordy/complicated, or if I'm missing some element of a proof that is helpful to see, if not strictly necessary.

The Prompt:

Let $A$ be a nonempty set of real numbers which is bounded below. Let $-A$ be the set of all numbers $-x$, where $x ∈ A$. Prove that $inf A = -sup( -A)$.

My Proof:

Define $B$ as the set of all lower bounds of $A$, and define $z∈B$ as the largest element of B, so $z=inf A$. For any $b∈B$, $a$ $\ge$ $b$ for all $a ∈ A$, so $0-b$ $\ge$ $0-a$ and $-b$ $\ge$ $-a$. Thus if we define the set $-B = \{-b|b∈B\}$, we can see that $-B$ is the set of upper bounds of $-A$. Since $z∈B$, $-z∈-B$, and since $b$ $\le$ $z$ for all $b∈B$, $0-b$ $\ge$ $0-z$ and $-b$ $\ge$ $-z$, so $-z$ is the smallest element of $-B$, and so $-z = sup(-A)$. Thus:

$inf A = z = - (-z) = -sup(-A)$

1

There are 1 best solutions below

0
On

Mostly looks good. I would note though that you showed that $-B$ is a subset of the set of upper bounds of $-A$, and you really need it is the set of upper bounds, as claimed. This is easily dealt with though: suppose $x$ is an upper bound for $-A$. Then $x \geq -a$ for all $a \in A$, so $-x \leq a$ for all $a \in A$, so $-x$ is a lower bound for $A$, hence $-x \in B$, and $x \in -B$.