Skip to main content
edited body; edited title
Source Link
Denis Serre
  • 52.4k
  • 10
  • 146
  • 300

An easy proof that S$S(n)$ does not embed into A$A(n+1)$?

Rotman's book An Introduction to the Theory of Groups (Fourth Edition) asks, on page 22, Exercise 2.8, to show that S(n)$S(n)$ cannot be embedded in A(n+1)$A(n+1)$, where S(n)$S(n)$ = the symmetric group on n$n$ elements, and A(n)$A(n)$ = the alternating group on n$n$ elements. I have a proof but it uses Bertrand's Postulate, which seems a bit much for page 22 of an introductory text. Does anyone have a more appropriate (i.e., easier) proof?

An easy proof that S(n) does not embed into A(n+1)?

Rotman's book An Introduction to the Theory of Groups (Fourth Edition) asks, on page 22, Exercise 2.8, to show that S(n) cannot be embedded in A(n+1), where S(n) = the symmetric group on n elements, and A(n) = the alternating group on n elements. I have a proof but it uses Bertrand's Postulate, which seems a bit much for page 22 of an introductory text. Does anyone have a more appropriate (i.e., easier) proof?

An easy proof that $S(n)$ does not embed into $A(n+1)$?

Rotman's book An Introduction to the Theory of Groups (Fourth Edition) asks, on page 22, Exercise 2.8, to show that $S(n)$ cannot be embedded in $A(n+1)$, where $S(n)$ = the symmetric group on $n$ elements, and $A(n)$ = the alternating group on $n$ elements. I have a proof but it uses Bertrand's Postulate, which seems a bit much for page 22 of an introductory text. Does anyone have a more appropriate (i.e., easier) proof?

partial cleanup (should “S” and “A” be italicized for uniformity with comments and answers?), [permutation-groups]
Source Link

Rotman's book An Introduction to the Theory of Groups (Fourth Edition) asks, on page 22, Exercise 2.8, to show that S(nn) cannot be embedded in A(n+1n+1), where S(nn) = the symmetric group on nn elements, and A(nn) = the alternating group on nn elements. I have a proof but it uses Bertrand's Postulate, which seems a bit much for page 22 of an introductory text. Does anyone have a more appropriate (i.e., easier) proof?

Rotman's book An Introduction to the Theory of Groups (Fourth Edition) asks, on page 22, Exercise 2.8, to show that S(n) cannot be embedded in A(n+1), where S(n) = the symmetric group on n elements, and A(n) = the alternating group on n elements. I have a proof but it uses Bertrand's Postulate, which seems a bit much for page 22 of an introductory text. Does anyone have a more appropriate (i.e., easier) proof?

Rotman's book An Introduction to the Theory of Groups (Fourth Edition) asks, on page 22, Exercise 2.8, to show that S(n) cannot be embedded in A(n+1), where S(n) = the symmetric group on n elements, and A(n) = the alternating group on n elements. I have a proof but it uses Bertrand's Postulate, which seems a bit much for page 22 of an introductory text. Does anyone have a more appropriate (i.e., easier) proof?

edited title
Link
Ewan Delanoy
  • 3.6k
  • 26
  • 36

An easy proof that S(n) does not embed into A(n+1)?

Fixed the title, which had A and S exchanged
Link
Loading
Source Link
Loading