home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!gatech!darwin.sura.net!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!rutgers!netnews.upenn.edu!sagi.wistar.upenn.edu
- From: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
- Newsgroups: sci.math
- Subject: Re: Abel's proof of the insolubility of the quint
- Message-ID: <87849@netnews.upenn.edu>
- Date: 3 Sep 92 18:01:28 GMT
- References: <1992Sep2.204229.12330@news.cs.brandeis.edu> <MARTIN.92Sep2212731@lyra.cis.umassd.edu> <87834@netnews.upenn.edu> <1992Sep3.122450.15337@husc3.harvard.edu>
- Sender: news@netnews.upenn.edu
- Reply-To: weemba@sagi.wistar.upenn.edu (Matthew P Wiener)
- Organization: The Wistar Institute of Anatomy and Biology
- Lines: 20
- Nntp-Posting-Host: sagi.wistar.upenn.edu
- In-reply-to: elkies@ramanujan.harvard.edu (Noam Elkies)
-
- In article <1992Sep3.122450.15337@husc3.harvard.edu>, elkies@ramanujan (Noam Elkies) writes:
- >>I came across the proof in Rotman: identify the conjugacy classes of
- >>A_5, and notice the impossibility of any of them forming a partition
- >>for a size that non-trivially divides 60.
-
- >This nice proof is reasonably well-known, but can one get a proof
- >of the simplicity of all A_n (n>4) from such ideas?
-
- I don't think so, although I don't know of a particular A_n where the
- partition is possible, of course without forming a subgroup. Rotman
- redoes the partition proof for A_6, and then uses the result for A_6
- to prove the result for A_n, n>6.
-
- For beginners, the simple flat-out contradiction proof is probably ideal.
- Later on the more commonly seen `complicated' proofs are better, since
- structurally they resemble proofs for the classical groups. And while
- these later get superseded by the Lie theory proofs, these groups are
- worth understanding on many levels.
- --
- -Matthew P Wiener (weemba@sagi.wistar.upenn.edu)
-