Timeline for An easy proof that $S(n)$ does not embed into $A(n+1)$?
Current License: CC BY-SA 4.0
23 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 9, 2022 at 14:23 | answer | added | KhashF | timeline score: 3 | |
| Aug 9, 2022 at 14:15 | history | edited | Denis Serre | CC BY-SA 4.0 |
edited body; edited title
|
| Aug 9, 2022 at 14:06 | review | Close votes | |||
| Aug 14, 2022 at 3:08 | |||||
| Aug 9, 2022 at 12:02 | answer | added | Dario | timeline score: 1 | |
| Oct 23, 2014 at 2:00 | comment | added | Andy Sanders | Is it really true that questions such as "what is the best proof of theorem x," however elementary, are not considered "good" questions for research mathematicians? | |
| S Oct 22, 2014 at 20:28 | history | suggested | Incnis Mrsi | CC BY-SA 3.0 |
partial cleanup (should “S” and “A” be italicized for uniformity with comments and answers?), [permutation-groups]
|
| Oct 22, 2014 at 19:55 | review | Suggested edits | |||
| S Oct 22, 2014 at 20:28 | |||||
| May 16, 2011 at 18:13 | answer | added | Aaron Meyerowitz | timeline score: 6 | |
| May 16, 2011 at 17:42 | answer | added | Sergei Ivanov | timeline score: 39 | |
| May 16, 2011 at 16:32 | comment | added | Arturo Magidin | It may be worth noting that the immediately preceding exercise to this one is showing that $A_n$ is generated by the $3$-cycles when $n\gt 2$. | |
| May 16, 2011 at 10:10 | answer | added | Derek Holt | timeline score: 6 | |
| May 16, 2011 at 6:42 | comment | added | Gerhard Paseman | Someone should add the restriction of n > 1. Gerhard "Ask Me About System Design" Paseman, 2011.05.15 | |
| May 16, 2011 at 4:15 | history | edited | Ewan Delanoy | CC BY-SA 3.0 |
edited title
|
| May 15, 2011 at 23:07 | comment | added | Arturo Magidin | @Theo: I should have said "is not the intended answer by Rotman" rather than "cannot be used". | |
| May 15, 2011 at 23:05 | comment | added | Theo Johnson-Freyd | @Arturo: No, that's not really the rules of this forum. MathOverflow is mainly geared towards research-level mathematicians, and so any proof is fair game. That said, what you've highlighted is that this question probably isn't appropriate for MO; it could easily be closed as "too localized", which is our closest approximation to "homework-level". I would rather Len just accept Darij's answer below. Conversely, Len already says he has a proof. | |
| May 15, 2011 at 23:01 | comment | added | Arturo Magidin | So... page 22 is after discussing homomorphisms and permutations groups, as well as subgroups, but before discussing Lagrange's Theorem (which is in page 24 according to the Amazon snapshot of the index page); this would mean even Olivier's argument for even $n$ cannot be used... | |
| May 15, 2011 at 22:47 | history | edited | Len Schrieber | CC BY-SA 3.0 |
Fixed the title, which had A and S exchanged
|
| May 15, 2011 at 22:45 | comment | added | Theo Johnson-Freyd | @Len: you can edit the title, you know. | |
| May 15, 2011 at 22:14 | comment | added | Len Schrieber | Darn, I can proofread a million times and still get the title wrong! | |
| May 15, 2011 at 22:10 | comment | added | Olivier Bégassat | By the way, you got your title wrong! | |
| May 15, 2011 at 21:55 | comment | added | Olivier Bégassat | There is no such embedding for even $n$, just consider the orders of the respective groups: you don't have $|S{n}|$ dividing $|A{n+1}|$ by comparing the order of exponents of $2$. | |
| May 15, 2011 at 21:51 | answer | added | darij grinberg | timeline score: 12 | |
| May 15, 2011 at 21:43 | history | asked | Len Schrieber | CC BY-SA 3.0 |