Thread: Algebra, element orders

Hi, need quick help with these questions, have exams on Tuesday

1) Let G be a group. Prove that


I have been able to prove it, first with n=1, then assuming it holds for n=k and proving for n=k+1 and n=-m for some +ve int m

But the lecturer used n=0 for the first one,

For n=0, he got and for RHS

I dont understand how or

2) Let G be a group and a is an element of G. Prove

For second question i have no idea at all, what is o(a) ??

Third question i have been able to do, needs to verify if its corect

3) A relation R is defined on Z by aRb iff a-b is divisible either by 5 or by 7(a,b in Z). Is R an equivalence relation on Z? Justify your answer.

For reflexive, 5|a-a or 7|a-a = 5|0 or 7|0
Hence aRa.

For symmetric, aRb implies 5|a-b or 7|a-b = 5|b-a or 7|b-a which implies bRa.

For transitivity, aRb and bRc implies
5|a-b or 7|a-b and 5|b-c or 7|b-c
= 5|a-b+b-c or 7|a-b+b-c
= 5|a-c or 7|a-c
=aRc

Hence R is an equivalence relation on Z

Originally Posted by Kai

Hi, need quick help with these questions, have exams on Tuesday

1) Let G be a group. Prove that


I have been able to prove it, first with n=1, then assuming it holds for n=k and proving for n=k+1 and n=-m for some +ve int m

But the lecturer used n=0 for the first one,

For n=0, he got and for RHS

I dont understand how or

I haven't done groups in ages, but as far as I recall we used to use e as to symbolise the identity, which for multiplication would be 1, which would make sense for your a^0 = 1.

For the second question o(a) is the order of a...
And o(a) = smallest m such that a^m = e.

Don't know the answer to your question, but hope that helps...

Originally Posted by Unenlightened

I haven't done groups in ages, but as far as I recall we used to use e as to symbolise the identity, which for multiplication would be 1, which would make sense for your a^0 = 1.

Yes under multiplication it would make sense, but the binary operation on G has not been defined. it could be addition or any other type

Originally Posted by Kai

Hi, need quick help with these questions, have exams on Tuesday

1) Let G be a group. Prove that


I have been able to prove it, first with n=1, then assuming it holds for n=k and proving for n=k+1 and n=-m for some +ve int m

But the lecturer used n=0 for the first one,

For n=0, he got and for RHS

I dont understand how or

Thats a debatable topic. Some may call it a convenient notation.
Convenient because:

Originally Posted by Kai

2) Let G be a group and a is an element of G. Prove

For second question i have no idea at all, what is o(a) ??

o(a) is the order of a.

The order of an element a in a group is the least positive integer k such that is the identity.

Originally Posted by Kai

Third question i have been able to do, needs to verify if its corect

3) A relation R is defined on Z by aRb iff a-b is divisible either by 5 or by 7(a,b in Z). Is R an equivalence relation on Z? Justify your answer.

For reflexive, 5|a-a or 7|a-a = 5|0 or 7|0
Hence aRa.

For symmetric, aRb implies 5|a-b or 7|a-b => 5|b-a or 7|b-a which implies bRa.

For transitivity, aRb and bRc implies
5|a-b or 7|a-b and 5|b-c or 7|b-c
Isomorphism: What if 5|a-b and 7|b-c?

But if u see it this way, then for reflexive, 5|0 AND 7|0 not 5|0 or 7|0