Groups of permutations and cyclic groups

Click For Summary
SUMMARY

A group of permutations is indeed equivalent to a group of functions, exhibiting properties such as associativity, identity, and inverses. The conversion of cyclic groups into products of disjoint cycles involves evaluating cycles from right to left, as demonstrated in the example provided. Each cycle can be expressed in various forms, and the starting point of the cycle does not affect the overall mapping, allowing for flexibility in representation. Understanding these concepts is crucial for manipulating and interpreting permutations effectively.

PREREQUISITES
  • Understanding of group theory concepts, specifically groups and functions.
  • Familiarity with cyclic groups and their properties.
  • Knowledge of permutation notation and cycle representation.
  • Basic skills in evaluating mathematical expressions and functions.
NEXT STEPS
  • Study the properties of group homomorphisms in relation to permutations.
  • Learn about the structure of symmetric groups and their applications.
  • Explore the concept of conjugacy in permutation groups.
  • Investigate advanced topics in group theory, such as Sylow theorems and normal subgroups.
USEFUL FOR

Mathematicians, students studying abstract algebra, and anyone interested in the theoretical aspects of group theory and permutations.

yaganon
Messages
16
Reaction score
0
1: Is a group of permutations basically the same as a group of functions? As far as I know, they have the same properties: associativity, identity function, and inverses.

2: I don't understand how you convert cyclic groups into product of disjoint cycles.
A cyclic group (a b c d ... z) := a->b, b->c, c->d, d->e ... y->z, z->a
In the book, it shows that (0 3 6) o (2 7) o (4 8) o (0 4 7 2 6) o (1 8) = (0 8 1 4 2) o (3 6)

How do you get there?

thanks
 
Physics news on Phys.org
1. Yes, it's a group of 1-1 functions from the set of elements being permuted (or possibly a superset) onto itself.

2. You don't, you may express individual members of a cyclic group of permutations as the product of disjoint cycles. In your example each cycle goes from left to right but the products are evaluated from right to left. The direction of evaluation could be different in a different book, but the cycles will usually go from left to right I believe.

So for example:

1--(18)--> 8 --(0 4 7 2 6)--> 8--(4 8)--> 4 --(2 7)--> 4 --(0 3 6)--> 4

Which is why 4 follows 1 in the cycle (0 8 1 4 2) on the rhs. Other elements similarly.

If g=(abc...z) then g2 would be (abc...z)(abc...z) evaluated the same way, i.e. (ace...y)(bdf...z) and so on.
 
OK, I kind of get it. So you always start with 0, and the last element ends with 2 because two maps to 0 through the series of functions, completing the cycle. What if there isn't a zero? Also, when you're done with a cycle, how do you start the next one, do you choose the next smallest element that's left? which is why it's (3 6) and not (6 3)?
 
It doesn't matter what you start with. All that happens is your cycles can appear shifted round if you start with something different.

After finding 1->4 I woulve tracked 4 etc. Then my cycle would appear as (14208) instead of (08142) on thr rhs. But it's the same cycle either way.
 
Similarly you can just pick anything you haven't already done for the next cycle. It helps to take them in some sort of order so you don't forget a cycle altogether, but it's up to you.
 
That is to say (63) will do just as well as (36). It's exactly the same mapping.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
672
  • · Replies 26 ·
Replies
26
Views
1K
  • · Replies 28 ·
Replies
28
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 13 ·
Replies
13
Views
1K
  • · Replies 4 ·
Replies
4
Views
674
Replies
4
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K