Math 360, Fall 2020, Assignment 11
From cartan.math.umb.edu
Revision as of 15:12, 20 November 2020 by Steven.Jackson (talk | contribs) (Created page with "__NOTOC__ ''I have found a very great number of exceedingly beautiful theorems." : - Pierre de Fermat ==Carefully define the following terms, then give one example and one n...")
I have found a very great number of exceedingly beautiful theorems."
- - Pierre de Fermat
Carefully define the following terms, then give one example and one non-example of each:[edit]
- $\mathrm{orb}(\sigma)$ (the orbit count of the permutation $\sigma$).
- $\mathrm{sgn}(\sigma)$ (the sign of the permutation $\sigma$).
- Even permutation.
- Odd permutation.
- $A_n$ (the alternating group on $\{1,\dots,n\}$).
Carefully state the following theorems (you do not need to prove them):[edit]
- Theorem relating $\mathrm{orb}(\tau\sigma)$ to $\mathrm{orb}(\sigma)$ (where $\tau$ is a transposition).
- Theorem relating $\mathrm{sgn}(\tau\sigma)$ to $\mathrm{sgn}(\sigma)$ (where $\tau$ is a transposition).
- Theorem relating $\mathrm{sgn}(\sigma)$ to the number of transpositions in any expression of $\sigma$ as a product of transpositions.
- Theorem relating $\mathrm{sgn}(\pi\sigma)$ to $\mathrm{sgn}(\pi)$ and $\mathrm{sgn}(\sigma)$ (where $\pi$ and $\sigma$ are arbitrary permutations).
- Formula for the order of $A_n$.
Solve the following problems:[edit]
- Let $B_n$ denote the set of odd permutations in $S_n$. (We noted in class that $B_n$ is not a subgroup of $S_n$, but it is a well-defined subset of $S_n$.) Show that when $n\geq2$, the map $f:A_n\rightarrow B_n$ defined by $f(\sigma)=(12)\sigma$ is a bijection.
- Prove that the order of $A_n$ is $n!/2$.
- Section 9, problem 29. (Hint: follow the technique of the previous two problems.)
- Explicitly describe (i.e. make an operation table for) the group $A_3$. Can you find a more familiar group that is isomorphic to $A_3$?
- For which $n$ is $A_n$ an abelian group? Justify your answer.
- Section 15, problem 39(b).