Abstract algebra module

Shackleford

http://i111.photobucket.com/albums/n...8/untitled.jpg

G/N is the set of all left cosets of N in G.

I don't understand the notation.

a) The permutations are (1,2), (2,3), (3,1). What are the left cosets - <1>, <2>, <3>? That doesn't make sense with permutations.

b) I have no idea. N = mZ is simply all integer multiples of m. How do I find the left cosets?

Dick

You find left cosets by operating on the subgroup on the left by members of your group. For the first one beta isn't three permutations, it's only one. In cycle notation it's (123). And the group N is the subgroup generated by beta. What's that?

Shackleford

It's the same thing. (123) is simply more concise. The left cosets are generated by gN, i.e. each element of g is composed with each element of N. Are you saying it's <123>?

Dick

No, I'm asking what N is. It's should be a subgroup with three permutations in it.

Shackleford

(1), (2), (3)?

Dick

Are you using cycle notation? Aren't those all the identity permutation?

Shackleford

Yes. For these two problems, I don't see how you can take the composition gN.

Dick

For the first problem, you haven't figured out what N is yet. It's the subgroup generated by the permutation (123). That's a permutation of order three and it's one of the permutations in N. What are the other two?

Shackleford

What about (1,3) and (1,2)?

Dick

Are you just guessing? The product of (123) and (123) must be in the subgroup, mustn't it?

Shackleford

Oh, shoot. We're taking the generation <(123)>, right?

Dick

Sure are.

Shackleford

Wait, so it's really the composition N of G. We're looking at the generator of the entire permutation.

Dick

I'm not sure what you are saying. It's the subgroup generated by (123). For any element a, <a> is just all of the powers of a and its inverse.

Shackleford

The permutation beta is fully defined by (123). You're sticking that in the generator. I need to to look at the (123)ⁿ until I find all the distinct left cosets.

This abstract algebra modulus is part of Survey for Undergrad Math. It's a preparatory class for the math field test. I took Abstract last summer and did well, but some of this stuff we didn't cover.

I just did the problem where the field is R, but I haven't dealt with a polynomial defined over a congruence class.

Dick

You are still thinking about this wrong. Finding (123)^n is just going to give you one coset. N itself. There's another one.

I would just do the division algorithm and substitute arithmetic mod 3 for real arithmetic.

Shackleford

How about the inverse - (321)?

Okay. Let me try that for the division algorithm problem.