Proving commutativity for sets with different operations

[mrwall-e]

Homework Statement

(From chapter three of Pinter's A book of Abstract Algebra)
Prove that each of the following sets, with the indicated operation, is an abelian group:

a) x * y = x + y + k (k is some constant), for the set of real numbers
b) x * y = \frac{xy}{2} on the set \{ x | x \in R; x \neq 0 \}
c) x * y = x + y + xy on the set \{ x | x \in R; x \neq -1 \}
d) x * y = \frac{x + y}{xy + 1} on the set \{ x | x \in R; -1 < x < 1 \}

2. The attempt at a solution

a) This was my over-complicated proof, which I have two questions about:

Suppose * is an operation on the set of real numbers. Suppose a, b belong to the set of real numbers. The operation * is defined as the binary operation x * y = x + y + k, where k is a constant and x, y belong to the set of real numbers. Say q = a * b = a + b + k, and p = b * a = b + a + k. Due to the commutative property of addition, p = q.

My first question is, is it bad to use, say, the commutative property of addition in a proof?

My next is how could I make this proof simpler? It looks overly complex to me... but this almost looks too skimpy:

Suppose a group <R, *> where R is the set of real numbers and * is the operation x * y = x + y + k, where k is some constant and x, y \in R. Given that a, b \in R, a * b = a + b + k. Also, b * a = b + a + k. Therefore, because a + b + k = b + a + k by the commutative property of addition, a * b = b * a and the group <R, *> is abelian.

b) Suppose a group <R, *> where R is the set of \{ x | x \in R; x \neq 0 \} and * is the operation x * y = \frac{xy}{2}, where x, y \in R. Given that a, b \in R, suppose a * b = \frac{ab}{2} = b * a = \frac{be}{2}. To check, multiply the equation by 2 to yield ab = ba, which remains true due to the commutative property of multiplication. Thus, the group <R, *> is abelian.

c) Suppose a group <R, *> where R is the set of \{ x | x \in R; x \neq -1 \} and * is the operation x * y = x + y + xy, where x, y \in R. Given that a, b \in R, suppose a * b = a + b + ab and b * a = b + a + ba. Suppose a + b + ab = b + a + ba, implying that a * b = b * a, or that the operation * is commutative. The equation, simplified by subtraction, yields ab = ba, which are equivalent by the commutative property of multiplication. Thus, the group <R, *> is abelian.

d) Suppose a group <R, *> where R is the set of \{ x | x \in R; -1 &lt; x &lt; 1 \} and * is the operation x * y = \frac{x + y}{xy + 1}, where x, y \in R. Given that a, b \in R, suppose a * b = \frac{a + b}{ab + 1} and b * a = \frac{b + a}{ba + 1} and \frac{a + b}{ab + 1} = \frac{b + a}{ba + 1}. Simplifying yields b + a = a + b, due to the fact ab + a = ba + 1. Because a * b = b * a, equivalent by the commutative property of multiplication, the group <R, *> is abelian.

Thanks for any ... review? Sort of a meaty post, and thanks for making it this far haha.
Also, I know they don't really need formal proofs, but I like the practice.

 

[Mark44]

Homework Statement

(From chapter three of Pinter's A book of Abstract Algebra)
Prove that each of the following sets, with the indicated operation, is an abelian group:

a) x * y = x + y + k (k is some constant), for the set of real numbers
b) x * y = \frac{xy}{2} on the set \{ x | x \in R; x \neq 0 \}
c) x * y = x + y + xy on the set \{ x | x \in R; x \neq -1 \}
d) x * y = \frac{x + y}{xy + 1} on the set \{ x | x \in R; -1 &lt; x &lt; 1 \}

2. The attempt at a solution

a) This was my over-complicated proof, which I have two questions about:

Suppose * is an operation on the set of real numbers. Suppose a, b belong to the set of real numbers. The operation * is defined as the binary operation x * y = x + y + k, where k is a constant and x, y belong to the set of real numbers. Say q = a * b = a + b + k, and p = b * a = b + a + k. Due to the commutative property of addition, p = q.

My first question is, is it bad to use, say, the commutative property of addition in a proof?

My next is how could I make this proof simpler? It looks overly complex to me... but this almost looks too skimpy:

Suppose a group <R, *> where R is the set of real numbers and * is the operation x * y = x + y + k, where k is some constant and x, y \in R. Given that a, b \in R, a * b = a + b + k. Also, b * a = b + a + k. Therefore, because a + b + k = b + a + k by the commutative property of addition, a * b = b * a and the group <R, *> is abelian.

Comment on your proof of part a.
Yes, this is overcomplicated. What you're trying to prove for the commutivity part is that x*y = y*x for all elements x and y of your group.

Let x and y be any real numbers, and let k be a real constant.
x * y = x + y + k = y + x + k (because addition in the reals is commutative)
= y * x

b) Suppose a group <R, *> where R is the set of \{ x | x \in R; x \neq 0 \} and * is the operation x * y = \frac{xy}{2}, where x, y \in R. Given that a, b \in R, suppose a * b = \frac{ab}{2} = b * a = \frac{be}{2}. To check, multiply the equation by 2 to yield ab = ba, which remains true due to the commutative property of multiplication. Thus, the group <R, *> is abelian.

c) Suppose a group <R, *> where R is the set of \{ x | x \in R; x \neq -1 \} and * is the operation x * y = x + y + xy, where x, y \in R. Given that a, b \in R, suppose a * b = a + b + ab and b * a = b + a + ba. Suppose a + b + ab = b + a + ba, implying that a * b = b * a, or that the operation * is commutative. The equation, simplified by subtraction, yields ab = ba, which are equivalent by the commutative property of multiplication. Thus, the group <R, *> is abelian.

d) Suppose a group <R, *> where R is the set of \{ x | x \in R; -1 &lt; x &lt; 1 \} and * is the operation x * y = \frac{x + y}{xy + 1}, where x, y \in R. Given that a, b \in R, suppose a * b = \frac{a + b}{ab + 1} and b * a = \frac{b + a}{ba + 1} and \frac{a + b}{ab + 1} = \frac{b + a}{ba + 1}. Simplifying yields b + a = a + b, due to the fact ab + a = ba + 1. Because a * b = b * a, equivalent by the commutative property of multiplication, the group <R, *> is abelian.

Thanks for any ... review? Sort of a meaty post, and thanks for making it this far haha.
Also, I know they don't really need formal proofs, but I like the practice.

 

[stringy]

And don't forget associativity, inverses, and an identity! We're tasked with proving its an abelian GROUP.

 

[mrwall-e]

Comment on your proof of part a.
Yes, this is overcomplicated. What you're trying to prove for the commutivity part is that x*y = y*x for all elements x and y of your group.

Let x and y be any real numbers, and let k be a real constant.
x * y = x + y + k = y + x + k (because addition in the reals is commutative)
= y * x

Thanks, I figured - still used to looking at really long proofs haha. Also, thanks for clarifying a point I actually didn't bring up - whether or not you have to specify k as a real or not.

And @springy: I thought abelian was a synonym for commutative; so proving identity, associativity, etc was separate?

Thanks

 

[Mark44]

Thanks, I figured - still used to looking at really long proofs haha. Also, thanks for clarifying a point I actually didn't bring up - whether or not you have to specify k as a real or not.

And @springy: I thought abelian was a synonym for commutative; so proving identity, associativity, etc was separate?

An abelian group is one for which the operation is commutative. Since you have to prove that each is an abelian group, you need to show that each is a group, and then that for each, the operation is commutative.

 

[mrwall-e]

An abelian group is one for which the operation is commutative. Since you have to prove that each is an abelian group, you need to show that each is a group, and then that for each, the operation is commutative.

So you don't have to prove that there exists an inverse,associativity, or anything else for it to be an abelian group, correct?

Sorry for all the simple questions - just want to make sure I have the basics down pat before moving on

 

[stringy]

"Abelian" is an adjective that applies to the noun "group."

Here's a situation that is analogous to your proofs: If I told you to prove to me that that (pointing to an object) is a blue book, then all you just did is prove that the object is blue! You still need to show me it's a book. Makes sense, right?

So if I ask you to prove to me that some set along with an operation is an abelian group, you have to show me that it's a group also. EDIT: And what does that involve? Dealing with associativity, inverses, and an identity.

Mark44 gave the definition of an abelian group.

 

[mrwall-e]

"Abelian" is an adjective that applies to the noun "group."

Here's a situation that is analogous to your proofs: If I told you to prove to me that that (pointing to an object) is a blue book, then all you just did is prove that the object is blue! You still need to show me it's a book. Makes sense, right?

So if I ask you to prove to me that some set along with an operation is an abelian group, you have to show me that it's a group also. EDIT: And what does that involve? Dealing with associativity, inverses, and an identity.

Mark44 gave the definition of an abelian group.

I now understand your post - I thought you were speaking of proving a group to be abelian. Now I realize what you're talking about... sorry for wasting your time - been a long day. Thanks so much for your help.

 

[stringy]

Oh, OK. I see where the misunderstanding was. Just to be absolutely crystal clear, once you've established that something is, in fact, a group, then all you need to do to show it's an abelian group is prove commutativity. The issue I pointed out was that you hadn't established that those sets and operations formed groups before tackling commutativity.

And no, you are not wasting anybody's time. We're all here to help answer questions. Feel free to ask away!

 

[mrwall-e]

Oh, OK. I see where the misunderstanding was. Just to be absolutely crystal clear, once you've established that something is, in fact, a group, then all you need to do to show it's an abelian group is prove commutativity. The issue I pointed out was that you hadn't established that those sets and operations formed groups before tackling commutativity.

And no, you are not wasting anybody's time. We're all here to help answer questions. Feel free to ask away!

Thanks, I sort of hijacked the language the book was using and assumed it considered them groups! So it's completely a misunderstanding on my end, thanks for your replies and help :)