Let A be a nonempty set of real numbers which is bounded below. Let -A be the set of all numbers -x where x E A.
Prove that inf A = -sup(-A)
(Please see the attached file for the fully formatted problem.)

Included in the attachment is a copy of the solution, but please explain in your own words how the proof works; don't just copy the solution out. Please use words to describe the proof. If you use a theorem, please state what it is and if possible, where you got it.

... the maximum number of edges is n^2/4. If n is odd, it is maximized when m = (n-1)/2, in which case the maximum number of edges is (n^2-1)/4. Thus the bound...

... In both (a) and (b), the numbers are getting smaller ... The greatest lower bound is 1 since the sequence ... for determining if sequences have upper bounds and lower ...

... Assume that the observed number of heads in the ... back the edited picture with your numbers into this ... 3. Low bound: mean-standard deviation=14.88-2.840117≈12.0 ...

... each element is a product of positive real numbers each element ... in which you assume it is bounded below by ... is a member of the sequence smaller than he bound. ...

... Find the least upper bounds and the greatest upper bounds for the folow- ing sets: a) 1 K ... The least upper bound U of a set K is such a number that for all ...

... be zero Hence, the option price converges to either zero or the lower bound. ... To construct a riskless hedge, the number of puts per 100 shares purchased is. ...

Oxidation Numbers. ... Several general rules regarding the oxidation number: Rules: (1) The sum of the ... equal to their charge; (5) Hydrogen is a +1 when bound to a ...

... reals with a lower bound has a greatest lower bound. ...bounds of a set A and lower bounds of the ... a non-increasing sequence of real n=1 numbers bounded from below ...

... Q: Can you find a true bound using an argument similar to the one you used? generalize the result to k-partite graphs, where ! â¥ 2. The number of edges ...