Proving on modulus and conjugates

  • Thread starter Thread starter irony of truth
  • Start date Start date
  • Tags Tags
    Modulus
irony of truth
Messages
89
Reaction score
0
I am proving that (sqrt)2 |z| >= |Re z| + |Im z|. The professor gave this as an example, but I want to ask something...

Why is it that I can't use this strategy:
-> |Re z| <= |z|
-> |Im z| <= |z|
-> adding corresponding expression yields |Re z| + |Im z| <= 2|z|. (what's wrong here?)
 
Physics news on Phys.org
irony of truth said:
Why is it that I can't use this strategy:
-> |Re z| <= |z|
-> |Im z| <= |z|
-> adding corresponding expression yields |Re z| + |Im z| <= 2|z|. (what's wrong here?)

You can't use it because |Re z|+|Im z| \leq 2|z| simply does not imply that |Re z| + |Im z| \leq \sqrt{2}|z|. Simple example: Say |Re z|+|Im z|=1.5. The first inequality is satisfied, but the second is not.
 
Try squaring both sides.

irony of truth said:
I am proving that (sqrt)2 |z| >= |Re z| + |Im z|. The professor gave this as an example, but I want to ask something...
Why is it that I can't use this strategy:
-> |Re z| <= |z|
-> |Im z| <= |z|
-> adding corresponding expression yields |Re z| + |Im z| <= 2|z|. (what's wrong here?)

That is an upper bound for |Re z| + |Im z|, but not the least upper bound. Try squaring both sides.
 
Oh yeah, put z=x+iy first.
 
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