S_n acting on a set with more than n elements

  • Thread starter Thread starter altcmdesc
  • Start date Start date
  • Tags Tags
    Elements Set
Click For Summary

Homework Help Overview

The discussion revolves around the action of the symmetric group S_n on a set containing more than n elements. Participants are exploring how such actions can be described and the implications of these actions on the structure of the set.

Discussion Character

  • Exploratory, Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants are considering how S_n can act on larger sets, with some suggesting that it can permute a subset of n elements while leaving others unchanged. Questions arise about the nature of orbits and the implications of combining two sets of n elements.

Discussion Status

The discussion is ongoing, with participants sharing ideas about specific actions of S_n and questioning the validity of their reasoning. Some have proposed examples of actions, while others are seeking clarification on the implications of these actions and how they relate to different group structures.

Contextual Notes

There is a mention of the natural action of S_n on itself and the potential for actions to apply to sets of varying sizes, indicating a complexity in the relationships between the elements and the group actions being discussed.

altcmdesc
Messages
64
Reaction score
0
I'm wondering how the group S_n can act on a set with more than n elements? I'm basically only looking for some idea as to how to get started on describing such an action and how to think of that action.

Thanks
 
Physics news on Phys.org
S2 can act on {1,2,3} to give {2,1,3} doesn't it? *hopes not to have just made a fatal error?*
 
altcmdesc said:
I'm basically only looking for some idea as to how to get started on describing such an action and how to think of that action.
Actions can have more than one orbit.
 
i don't follow...
 
Oh, by the way...

I'm wondering how the group S_n can act on a set with more than n elements?
There is a rather obvious action of S_n on a particular set of n! elements... :wink:
 
So, essentially, S_n can act on any set of more than n elements by just permuting n of the elements and leaving the rest alone?
 
altcmdesc said:
So, essentially, S_n can act on any set of more than n elements by just permuting n of the elements and leaving the rest alone?
That's one S_n action.

However, what if you have two sets of n elements arranged into a set of 2n elements? What can you do with that?


But the hint I was trying to give earlier is that S_n has a very natural action on itself, viewed as a set of n! elements. (Can you see what that action would be?)
 
It acts on itself by conjugation, right? Does that action apply to sets with less than n! elements as well by taking an element a in the finite set and multiplying it by pap^{-1}?
 
altcmdesc said:
It acts on itself by conjugation, right?
That's one of them.

There's another one that, in some sense, is more fundamental: it acts by multiplication.

It turns out that every transitive action of a group G is isomorphic to a quotient of this one -- that is, G acting on the set G/H by multiplication, where H is a (not necessarily normal) subgroup.

And every action of a group G is a disjoint union of transitive actions -- it's the union of its orbits, and each orbit is a transitive G-set.


a in the finite set and multiplying it by pap^{-1}?
Multiplying on the right isn't defined. (although there are generalizations where right and left multiplication can happen to your set)
 

Similar threads

Replies
7
Views
2K
  • · Replies 36 ·
2
Replies
36
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 28 ·
Replies
28
Views
2K
  • · Replies 24 ·
Replies
24
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K