This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: MAT 312/AMS 351 Fall 2010 Review for Final Revised 12/9/10 . NOTE: Final is cumulative. Use review sheets 1 and 2 as well as this one. Also review all homework, as well as midterms 1 and 2. § 3.2 Given a permutation π ∈ S ( n ), know how to compute its order (Definition 3.16). Understand how to apply Proposiiton 3.21 to calculate the order of a permutation which has been written as a product of disjoint cycles. Exercise 2 p. 83 . Understand what it means for two permutations π 1 , π 2 ∈ S ( n ) to be conjugate (bottom of p.79); that congugacy is an equivalence relation on S ( n ); understand what the shape of a permutation is (Definition 3.26) and that a conjugacy class (defined at top of p. 80) is made up of all the permutations with the same shape (Theorem 3.27). Homework 9, Exercise 5 . Understand the sign of a permutation (Definition 3.31; alternate definition in “Notes and Exercises on Permutations and Matrices”). Know that a permutation with sign − 1 is odd , and one with sign 1 is even . Understand that every transposition (Definition 3.4) has sign − 1. Know how to prove Lemma 3.35 (every cycle is a product of transpositions) and understand why an oddlength cycle is an even permutation, and viceversa. Be able to apply Theorem 3.36 (if a permutation is written as a product of transpositions, the permutation is odd if the number of those transpositions is odd, and even if that number is even). Understand that the order, the sign and the shape are the same for conjugate permutations....
View
Full
Document
This note was uploaded on 12/19/2010 for the course AMS 351 taught by Professor Staff during the Fall '08 term at SUNY Stony Brook.
 Fall '08
 Staff

Click to edit the document details