Quick group theory proof with some minor inquiries

Syrus
Messages
213
Reaction score
0

Homework Statement



See attachment, problem #19a.


Homework Equations





The Attempt at a Solution



a) Let j ∈ S X S be arbitrary. Then j is an ordered pair of the form (a,b) for some a,b ∈ S. Now let c = a + b + ab ∈ S. Then clearly a*b = c. Now let d ∈ S and assume a*b = d. But then it follows that c = a + b + ab = d.

^My only concern with this proof is that it doesn't explicitly demonstrate that * is closed on S. That is, that a*b is always not -1. I figured this may not have to be shown or just has to do with the properties of addition on the set S, but thought I'd inquire if this is a valid qualm?
 

Attachments

Last edited:
Physics news on Phys.org
Hello,

Indeed, you need to show that a*b is never -1. You can show this using reductio ad absurdum.
 
since a, b are in S , you know a\neq -1 \;, b\neq -1 , what you have to prove
is an implication

[(a\neq -1)\wedge(b\neq -1)\Rightarrow(a+b+ab\neq -1)]

use contrapositve

[(a+b+ab=-1)\Rightarrow (a=-1)\vee(b=-1)]

prove this ...
 
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