Abstract Algebra Proof question

  • Thread starter Braka
  • Start date
  • #1
5
0

Homework Statement


The question is:
Let A be a subset of Sn that contains all permutations alpha such that alpha can be written as a product of an even number of transpositions. Prove that A is a group with product of permutations.

I understand what I need to do to prove it, but I am not sure how to start it. Do I use:
Let alpha=(a1a2a3...an) and
beta=(b1b2b3...bn) and try to find closure,

alphabeta=(a1a2a3...an)(b1b2b3...bn)=(a1a2)(a1a3)...(a1an-1)(a1an)(b1b2)(b1b3)...(b1bn-1)(b1bn),

or am I going about it the wrong way?


Homework Equations





The Attempt at a Solution

 

Answers and Replies

  • #2
morphism
Science Advisor
Homework Helper
2,015
4
What is a group? There are some axioms A must satisfy in order for it to be called one. For instance, the product of two things in A must also lie in A. Translating this to the situation at hand: if two permutations can be written as a product of an even number of transpositions, can their product be as well? Obviously yes! Now check the other axioms similarly.
 
  • #3
HallsofIvy
Science Advisor
Homework Helper
41,833
956
Where did you use the fact that they can be written as an even number of transpositions?
 

Related Threads on Abstract Algebra Proof question

  • Last Post
Replies
6
Views
1K
  • Last Post
Replies
9
Views
2K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
11
Views
2K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
5
Views
5K
  • Last Post
Replies
10
Views
2K
  • Last Post
Replies
6
Views
805
  • Last Post
Replies
5
Views
1K
Top