Saturday, December 22, 2018

complex analysis - Proof: For every alphainmathbbC with alphanot=0, there exists a unique betainmathbbC such that alphabeta=1




I am trying to prove the following:




For every αC with α0, there exists a unique βC such that αβ=1.




There are two steps to this proof:




  1. I first need to prove that, for every αC, where α0, there does exist βC such that αβ=1.


  2. I then prove that, for every αC, where α0, there exists a unique βC such that αβ=1.



My proof follows.



Let αC, where α0, and βC. Also, I will assume that it is valid to assume knowledge of the fact that the inverse of a complex number is also a complex number. Otherwise, I'm not sure how one would do the proof.




  1. αβ=αα1(The inverse of a complex number is also a complex number.Therefore, since αC and βC, we can set β=α1.)=1


  2. Here, I prove that β is unique by assuming that there are two objects β1 and β2, and then show that they must therefore be the same object.




αβ1=1,αβ2=1



Subtracting the two equations, we get




αβ1αβ2=0α(β1β2)=0,β1β2=0   (Since α0.)β1=β2   



I would greatly appreciate it if people could please take the time to review my proof. If there are any errors, please point out the specific error and explain the correct way.


Answer



As José Carlos Santos points out in his answer, the fact that every αC with α0 has an inverse is precisely what you have to prove, so you can't assume it in your proof.



J. W. Tanner's answer is technically correct, but it does rather assume that you already "magically" know what the inverse β of α is.



In contrast, Dr. Sonnhard Graubner's answer shows how you could "discover" for yourself that the inverse β of α exists, and that it has the form given in J. W. Tanner's answer.




However, I find some aspects of his answer confusing, so - with apologies - I present a slightly different version of essentially the same argument. (I hope that I haven't just introduced confusions of my own!)



First, I make some further remarks on the proof you've presented:






One flaw in your proof that hasn't been mentioned is that you repeat essentially the same argument in 1 and 2.



In 1, you conclude from αβ=αα1 that β=α1, but you don't give a reason why.




In 2, you conclude from αβ1=αβ2 that β1=β2, and this time you do give a reason. However, as José Carlos Santos points out, you give no justification for concluding that if α(β1β2)=0 then β1β2=0. The only obvious way to justify this is by multiplying both sides by an inverse of α. In 2 (unlike 1), you can do this without logical circularity. Still, the proof is unnecessarily complicated.






Let α=x+iy. We are given that α0, i.e. that x0 or y0.



Let β=u+iv: then αβ=(xuyv)+i(xv+yu).



The equation αβ=1 is therefore equivalent to two simultaneous linear equations in real variables u and v:
xuyv=1,xv+yu=0.
It is up to you now to solve these equations for u and v, with the help of the condition that x0 or y0.



The fact that a solution exists means that an inverse β of α exists.



The fact that the solution is unique means that the inverse β is unique - and now one can denote it by α1.


No comments:

Post a Comment

analysis - Injection, making bijection

I have injection f:AB and I want to get bijection. Can I just resting codomain to f(A)? I know that every function i...