Spivak's Calculus, 5(x) - Use (ix) backwards

  • Thread starter Thread starter Tasaio
  • Start date Start date
  • Tags Tags
    Calculus
Tasaio
Messages
20
Reaction score
0
Spivak's Calculus, 5(x) -- "Use (ix) backwards..."

Homework Statement


Prove the following:
(x) If a,b\geq0 and a^{2}<b^{2}, then a<b. (Use (ix), backwards.)



Homework Equations



(ix) If 0 \leq a<b, then a^{2}<b^{2}.


The Attempt at a Solution



Suppose a,b\geq0 and a^{2}<b^{2}.

Here's my problem. What does "Use (ix) backwards" mean? I'll assume he means to use the converse of (ix). In that case...

The converse of (ix):

\neg(a^{2}<b^{2})\rightarrow\neg(0\leq a<b)

Hence (a^{2}\geq b^{2})\rightarrow\neg(0\leq a\&\&a<b);

hence (a^{2}\geq b^{2})\rightarrow(0>a)\Vert(a\geq b). (\star)

Since a^{2}<b^{2}, then a^{2} \leq b^{2}. So b^{2} \geq a^{2}.

Then by (\star), (0>b)\Vert(b \geq a).

Since b \geq 0, then we know 0>b cannot be true.

This means that b\geq a must be true.

But if b=a, then b^{2}=a^{2}; this is a contradiction since we are given that a^{2}<b^{2}.

Hence b>a must be true.

Hence a<b.
 
Physics news on Phys.org


What you have done is perfectly good.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top