December 10th, 2010, 06:27 PM  #1 
Member Joined: Oct 2009 Posts: 85 Thanks: 0  Permutation proof
Let be a set and . Let be the subset of consisting of all the permutations of such that . Prove that is a subgroup of . Clueless...

December 10th, 2010, 08:07 PM  #2 
Senior Member Joined: Nov 2010 Posts: 502 Thanks: 0  Re: Permutation proof
What happens when you multiply two of them together? Or if you take three of them? Does there exist an inverse? (yes) Why?

December 12th, 2010, 05:18 PM  #3 
Member Joined: Oct 2009 Posts: 85 Thanks: 0  Re: Permutation proof
So in G, everthing maps everything to itself. H is a subset of G so that covers that part of a subgroup. Should I prove closure and inverses using composition (as opposed to multiplication) since my book does not even mention the multiplication of permutations but only talks about composition of permutations and the group of all the permutations of A is S_A. So the composition of two functions that mapped to themselves will be in G, but I have no idea how to prove this. Here's what I am unsure about: Is it sufficient enough just to say that since the composite of any two permutations of A is a permutation of A that and is it also sufficient enough to say that by definition the inverse of any permutation of A is a permutation of A therefore . Then we have all the conditions for a subgroup. Is this ok to do? 

Tags 
permutation, proof 
Search tags for this page 
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
permutation  kingkos  Algebra  1  December 6th, 2012 12:39 PM 
PERMUTATION  talo0000  Algebra  4  June 8th, 2012 10:12 AM 
Proof on product of cycles (permutation groups)  Kappie  Abstract Algebra  1  March 13th, 2012 09:30 PM 
permutation groups, proof  MarkyMark  Abstract Algebra  2  January 15th, 2009 08:34 PM 
Alternative Permutation proof  kramps77  Algebra  1  August 9th, 2008 01:00 AM 