Working through spivak's calculus

  • Thread starter Thread starter Shylock
  • Start date Start date
  • Tags Tags
    Calculus
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
30 replies · 5K views
Shylock
Messages
18
Reaction score
0
i'm looking for some general advice on how to go about solving the problems in spivak's calculus text. I've just finished reading the first chapter, and while I've managed to solve some of the problems, i can't make sense out of most of them without referring to the solutions. how should i be going about this?
 
Physics news on Phys.org
also, which of these problems do you think I should be able to do? I've taken calcI, intro to logic, symbolic logic, and intermediate logic I, with As in each.
 
i'm good till problem 13:

The maximum of two numbers x and y is denoted by max(x,y). Thus max(-1,3) = max(3,3) = 3 and max(-1,-4) = max(-4,-1) = -1. The minimum of x and y is denoted by min(x,y,). Prove that

max(x,y) = (x + y + ly - xl) / 2
min(x,y) = (x + y - ly - xl) / 2

Derive a formula for max(x,y,z) and min(x,y,z), using, for example,

max(x,y,z)=max(x,max(y,z)).

i'm pretty lost on where to start.
 
Shylock said:
i'm good till problem 13:

The maximum of two numbers x and y is denoted by max(x,y). Thus max(-1,3) = max(3,3) = 3 and max(-1,-4) = max(-4,-1) = -1. The minimum of x and y is denoted by min(x,y,). Prove that

max(x,y) = (x + y + ly - xl) / 2
min(x,y) = (x + y - ly - xl) / 2

Derive a formula for max(x,y,z) and min(x,y,z), using, for example,

max(x,y,z)=max(x,max(y,z)).

i'm pretty lost on where to start.

Well, let's prove that

[tex]\max(x,y)=\frac{x+y+|y-x|}{2}[/tex]

there are three possibilities: x=y, x<y and y<x. What is |x-y| in all these cases??
 
(x+y)/2 , y , 0

how do you know to check for the three possibilities?
 
Shylock said:
how do you know to check for the three possibilities?

Well, the absolute value is annoying, so we must eliminate it. The only way to do that is to do the prove in separate cases.

So, if we had somewhere [itex]|x^2+y+z^2|+z[/itex] for example, then we would have to split it up in the case that [itex]x^2+y+z^2[/itex] is < = or > than 0.
 
i still don't understand what we've just done
 
and does that that mean that the formula for max(x,y,z) =

x + (y+z + ly -zl)/2 ?
 
proof by cases:
(i) if x=y then max(x,y) = (x+y)/2
(ii) if the x<y then max(x,y) = y
(iii) if x>y then max(x,y) = x
thus, for any numbers x,y max(x,y) = (x+y+ly-xl)/2
 
micromass said:
How did you find that??

by substitution
although now that it think about it, that doesn't seem right
 
Shylock said:
proof by cases:
(i) if x=y then max(x,y) = (x+y)/2
(ii) if the x<y then max(x,y) = y
(iii) if x>y then max(x,y) = x
thus, for any numbers x,y max(x,y) = (x+y+ly-xl)/2

That seems ok. (also note that if x=y, then (x+y)/2=x)

Shylock said:
by substitution

Yes, substitution is the way to solve this. But I can totally not understand, how you arrived at that formula by substitution.

You know that

[tex]max{x,u}=\frac{x+u+|x-u|}{2}[/tex]

So, what if I substitute u=max(x,y)?
 
i think i tried to do it in my head and i got lucky, haha
but now you've lost me
 
do you mean u = max(y,z)?
 
so hopefully i did this right

{[x+(y+z+ly-zl)/2]+[l(y+z+ly-zl)/2 - x]l}/2 ?

would this solution be acceptable or would i have to simplify it?
 
Last edited:
Could you show me what the formal proof would look like? It seems that the proofs I was taught to do in logic were more rigorous with the language and explanation. For example, do I need to cite the rules?
 
Does Spivak go into more detail about doing this, or is this something I need to work with on my own?
 
Shylock said:
Could you show me what the formal proof would look like? It seems that the proofs I was taught to do in logic were more rigorous with the language and explanation. For example, do I need to cite the rules?

Formal proofs, like the ones you did in logic, are not being done here. It can be done, but it would be far too tedious. There are simply too many rules here.
A proof for this would look like this:


There are two possibilities: [itex]x\leq y[/itex] and [itex]y\leq x[/itex].

If [itex]x\leq y[/itex], then max(x,y)=y. Also, we have

[tex]\frac{x+y+|y-x|}{2}=\frac{x+y+y-x}{2}=y[/tex]

If [itex]y\leq x[/itex], then max(x,y)=x. Also, we have that

[tex]\frac{x+y+|y-x|}{2}=\frac{x+y-y+x}{2}=x[/tex]

So in both cases, we have

[tex]\frac{x+y+|y-x|}{2}=max(x,y)[/tex]

this proves the result.

I think that's as formal as you want it. If you want it more formal, you can, but it would be tougher to read.

Shylock said:
Does Spivak go into more detail about doing this, or is this something I need to work with on my own?

No, he doesn't. You may want to pick up a proof book (like Velleman's) or "Understanding analysis" by Abbott to see how to do proofs.
 
so then i shouldn't be worried about having to write formal proofs for the problems in the book?
 
cool, thanks for the help