Abstract Algebra Problem involving the order of groups

In summary: Since (aba-1)n=(b2)n, then (aba-1)m=(b2)m.But (aba-1)m cannot equal e, because (aba-1)m=(b2)m would mean that a(ba)b=e.So (aba-1)m cannot equal e, and so the order of (ba) has to be at most 31.
  • #1
xcr
22
0

Homework Statement



Let G be a group with identity e. Let a and b be elements of G with a≠e, b≠e, (a^5)=e, and (aba^-1)=b^2. If b≠e, find the order of b.

Homework Equations



Maybe the statement if |a|=n and (a^m)=e, then n|m.

Other ways of writing (aba^-1)=b^2:
ab=(b^2)a
b=(a^-1)(b^2)a
a=(b^2)a(b^-1)

Also, if the order of a=5, then |a|=|(b^2)a(b^-1)|=5

The Attempt at a Solution



My work is kinda in the relevant equations. I have manipulated the given formula and looked at the statement listed above but can't see if these will get me anywhere or started in the right direction.
 
Physics news on Phys.org
  • #2
one idea to try:

see if you can prove that abn = b2na.

since a is a conjugate of ba, a = b(ba)b-1, |a| = |ba|.

now write e = (ba)5 by getting all the b's first.
 
  • #3
I understand how you got to this point: abn = b2na. The steps to get there go like this:
aba-1=b2 so raising both sides to the nth power would look like (aba-1)n=(b2)n. On the left side we would have n terms of aba-1, but regrouping them would cause then the aa-1 terms to cancel. yielding abna-1=b2n. Multiplying by a on the right gives abn=b2na.

We haven't covered conjugates in my course so I don't understand the second hint and I think your third hint follows from that.
 
  • #4
Perhaps you can try and prove that the order of "a" is equal to the order of "ba"?
Start with checking that (ba)5=e.
Then prove that (ba)m≠e for m<5.


For background, conjugate elements are rather important in group theory.
Basically it means that 2 elements "behave the same".
In this case Deveno uses the fact that 2 conjugate elements have the same order.

From wiki:
wiki said:
Suppose G is a group. Two elements a and b of G are called conjugate if there exists an element g in G with
gag−1 = b.​



For the last step that Deveno suggested, can you rewrite (ba)5?
 
  • #5
ab=b2a
b-1ab=ba
(b-1ab)5=(ba)5
(b-1a5b)=(ba)5
b-1eb=(ba)5
b-1b=(ba)5
e=(ba)5

Therefore |a|=|ba|

As for proving that (ba)m≠e for m<5, do I just show that when m=1,2,3,4, you get b-1amb=(ba)m, which ≠e?

Then do I just show that (aba-1)n=(b2)n, which can be rearranged as b-nabn=bna.

Not sure what to do from here. If I raise both sides to the 5th power, I would get e=(bna)5
 
  • #6
Yes, that looks good!

Consider that (ba)5=b(ab)4a...
 
  • #7
xcr said:
ab=b2a
b-1ab=ba
(b-1ab)5=(ba)5
(b-1a5b)=(ba)5
b-1eb=(ba)5
b-1b=(ba)5
e=(ba)5

Therefore |a|=|ba|

As for proving that (ba)m≠e for m<5, do I just show that when m=1,2,3,4, you get b-1amb=(ba)m, which ≠e?

Then do I just show that (aba-1)n=(b2)n, which can be rearranged as b-nabn=bna.

Not sure what to do from here. If I raise both sides to the 5th power, I would get e=(bna)5

the idea is, if we can get e = (ba)5 = bras, with hopefully (if things go well) s = 5, well then we'll have an equation that tells us something about the order of b, which is what we were after in the first place. I like Serena has given you a VERY good place to start...
 
  • #8
ok so I took e=(ba)5=b(ab)4a=b(ab)(ab)(ab)(ab)a. I then took ab=b2a and substituted it in. After doing this REPEATEDLY I moved all the b's to the left and all the a's to the right. I ended up with e=b31a5, but a5=e, so e=b31e, or e=b31. Therefore the order of b is 31. Felt like I was doing the right steps but not very confident in that answer.
 
  • #9
Right! :)


Btw, taken literally you have not found the order of b yet.
What you found is a power of b that brings b to the identity.
So the actual order of b is at most 31.
To finish things neatly, you should proof that it has to be exactly 31.
Can you?
(Same thing for the order of "ba", where you actually concluded an order of 5 prematurely, but I didn't want to nitpick at the time.)
 
  • #10
I would just need to show that (ab)m, where m=1,2,3,4 does not equal e. So just show that (ab)1≠e, (ab)2=a(ba)b≠e, (ab)3=a(ba)2b≠e, (ab)4=a(ba)3b≠e.
 
  • #11
Yes, but for (ba)m instead of (ab)m.

To make it easier, consider that the order of (ba) has to divide 5, so it can't be 2,3, or 4.
That leaves the question whether it's possible that ba=e...?
 
  • #12
Well if (ba)=e, then (ba)2=(ba)(ba)=ee=e, which is not true. Therefore ba≠e
 
  • #13
I'm afraid it's still possible that (ba)2=e at this stage.
 
  • #14
I thought that since 2,3, and 4 did not divide 5 that the could not be the order?
 
  • #15
Indeed, but you should realize why.
The order is the lowest power to yield identity.
If that were for instance 2, then the power 5 could not be identity.
But the order could still be 1, in which case all powers 2,3,4,5 are identity.
 
  • #16
Ok, so ba≠e because then a must equal e and b must equal e, which cannot be true because of our assumptions
 
  • #17
Close... but how did you get that a must be equal to e?
 
Last edited:
  • #18
xcr said:
Ok, so ba≠e because then a must equal e and b must equal e, which cannot be true because of our assumptions

if ba = e, what happens when you multiply both sides of this equation by a4?

if b is any power of a, say b = am, show that b5 = e.

why is this a contradiction?
 
  • #19
If you multiply both sides by a4 on the right, you get b=a4, so I see now that there is a possibility that ba=e where a and b do not equal e. But if you do b=am, then b5=(am)5=a5m=(a5)m=em=e. Not sure if this is correct but I'd say that this is a contradiction because 5 does not divide 31 and we proved earlier that b31=e.
 
  • #20
I'm afraid you are doing things out of order.

The proof that (ba) has order 5 is earlier in the proof, and indeed is used to prove that b31=e.
So you can't use it the other way around.

You also haven't proven yet that b5≠e.
 
  • #21
what you HAVE established, is that:

ba = b-1ab.

so what happens if b-1ab = e?

(conjugates really do have the same order, it is never just the case that the order of gxg-1 merely divides the order of x or vice versa).

so if (ba)5 = e and ba ≠ e, then the order of ba is some positive integer that divides 5 which is not 1, so...
 
  • #22
Ok, so far I have that aba-1=b2, rewritten as b-1ab=ba. Raising both sides to the 5th power gives us e=(ba)5, therefore the order of ba is 5 or m where m|5. so m=1,2,3,4. m can't be 2,3,4 because they don't divide m. 1|5 but then we have ba=e, where ba=b-1ab. So b-1ab=e, giving us ab=b, which shows that a=e. This is a contradiction to the assumption that a≠e, so the order of ba does not equal 1 and therefore must equal 5. Since the order of ba is 5, then e=(ba)5. Rewrite this as e=b(ab)4a=b(ab)(ab)(ab)(ab)a. Using ab=b2a, we can substitute until we get to the point where e=b31a5. Since the order of a is 5, e=b31. Thus, the order of b is 31 or m, where m|31. Since 31 is prime, only 1 and 31 divide 31. If the order of b is 1, then b=e, which is a contradiction to one of our assumptions. Therefore the order of b is 31.

I think that is it but if there is something wrong I am still accepting help :) just trying to make sure I understand this topic before the exam comes up.

The one part that I am a little worried about is do I need to include the part starting at "Thus, the order of b is 31 or..." I don't know if by proving that the order of ab does not equal 1 means that I do not need to prove this last part.
 
  • #23
xcr said:
Ok, so far I have that aba-1=b2, rewritten as b-1ab=ba. Raising both sides to the 5th power gives us e=(ba)5, therefore the order of ba is 5 or m where m|5. so m=1,2,3,4. m can't be 2,3,4 because they don't divide m.

i think this is a typo...it should be that 2,3,4 do not divide 5.

xcr said:
1|5 but then we have ba=e, where ba=b-1ab. So b-1ab=e, giving us ab=b, which shows that a=e. This is a contradiction to the assumption that a≠e, so the order of ba does not equal 1 and therefore must equal 5. Since the order of ba is 5, then e=(ba)5. Rewrite this as e=b(ab)4a=b(ab)(ab)(ab)(ab)a. Using ab=b2a, we can substitute until we get to the point where e=b31a5. Since the order of a is 5, e=b31. Thus, the order of b is 31 or m, where m|31. Since 31 is prime, only 1 and 31 divide 31. If the order of b is 1, then b=e, which is a contradiction to one of our assumptions. Therefore the order of b is 31.

I think that is it but if there is something wrong I am still accepting help :) just trying to make sure I understand this topic before the exam comes up.

The one part that I am a little worried about is do I need to include the part starting at "Thus, the order of b is 31 or..." I don't know if by proving that the order of ab does not equal 1 means that I do not need to prove this last part.

yes you DO need to include that part. the primality of 31 is essential, if we had come up with something like b30 = e, we would have to consider every divisor of 30.
 
  • #24
Yea that was a typo, it should have been 5. So does that prove that the order of b is 31 or is there more that needs to be done?
 
  • #25
xcr said:
Rewrite this as e=b(ab)4a=b(ab)(ab)(ab)(ab)a. Using ab=b2a, we can substitute until we get to the point where e=b31a5.

you should be more explicit here. again, showing that abk = b2ka first, is helpful here, because it allows you to streamline the derivation. so you should have something like:

e = (ba)5 = b(ab)4a
= b(ab)(ab)(ab)(ab)a = b(b2a)(b2a)(b2a)(b2a)a
= b3(ab2)(ab2)(ab2)a2
= ...?

in other words, you need to justify your "repeated reduction".
 
  • #26
Gotcha. And I could show that abk=b2ka by doing aba-1=b2 and then raising each side to the k gives abka-1=b2k. Move the a over and get abk=b2ka. Thank you so much Deveno and I like Serena. Hope ya'll both have a great holiday season.
 

1. What is the order of a group in abstract algebra?

The order of a group is the number of elements in the group. It is denoted by |G| or sometimes just by the letter n.

2. How is the order of a group related to its elements?

The order of a group is related to its elements in that the order of the group must be a multiple of the order of any element in the group. This is known as Lagrange's theorem.

3. Can a group have an infinite order?

Yes, a group can have an infinite order. This means that there are infinitely many elements in the group.

4. What is the significance of the order of a group in abstract algebra?

The order of a group is significant because it allows us to classify groups into different categories based on their size. It also helps us understand the structure and properties of groups.

5. How is the order of a group related to its subgroups?

The order of a group is related to its subgroups in that the order of any subgroup must be a divisor of the order of the group. This is known as Lagrange's theorem. Additionally, the number of subgroups of a group is also related to the order of the group.

Similar threads

  • Calculus and Beyond Homework Help
Replies
6
Views
947
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
3
Views
689
  • Calculus and Beyond Homework Help
Replies
3
Views
560
  • Calculus and Beyond Homework Help
Replies
5
Views
1K
  • Calculus and Beyond Homework Help
Replies
10
Views
951
  • Calculus and Beyond Homework Help
Replies
1
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
455
  • Calculus and Beyond Homework Help
Replies
4
Views
460
  • Calculus and Beyond Homework Help
Replies
1
Views
663
Back
Top