Intuitive reasoning why are quintics unsolvable
Solution 1:
Out of a lack of modesty, I am going to post my two cents worth as an answer rather than a comment, as others more qualified than me have done. Let the roots of an equation be A, B, C, etc. We are told that the unsolvability of the general quintic equation is related to the unsolvability of the associated Galois group, the symmetric group on five elements. I think I can tell you what this means on an intuitive level.
For three elements A, B, and C, you can create these two functions:
AAB + BBC + CCA
ABB + BCC + CAA
These functions have the interesting property that no matter how you reshuffle the letters A, B and C, you get back the same functions you started with. You might reverse them (as you would if you just swap A and B) or they might both stay put (as they would if you rotate A to B to C) but either way you get them back.
For four elements, something similar happens with these three functions:
AB + CD
AC + BD
AD + BC
No matter how you reshuffle A, B, C and D, you get these three functions back. They might be re-arranged, or they might all stay put, but either way you get them back.
For five elements, there exists no such group of functions. Well, not exactly...there is a pair of huge functions consisting of sixty terms each that works, similar to the ones I drew out for the cubic equation...but that's it. There are no groups of functions with three or especially four elements, which is what you would actually want.
(EDIT: There is also a set of six functions that map to each other under permutations, but these don't help you either. We had an intersting follow-up about Dummit's Resolvents in this discussion here Resolvent of the Quintic...Functions of the roots)
If you try to create functions on five letters with this symmetry property, you'll convince yourself that it's impossible. But how can you prove it's impossible? You probably need a little group theory for that, which I haven't yet written it up in a presentable form (but I think I can). I've written more about this on my blogsite in a series of articles starting here. You'll see I left it hanging in midstream about a year ago, but I think I'm going to finish it off soon.
I listened to the podcast which Christopher Ernst linked to in the comments, and I didn't think it was very good. Yes, it's all about the symmetries, but just because a guy is talking with an English accent doesn't mean he's profound. I'm not even sure that the stuff he said about re-shuffling five sets of 24 elements even makes sense. Anyhow, stuff on the level that Stewart is talking about was already understood long before Galois... Lagrange (most notably) had worked out all those symmetries fifty years earlier. There's an exceptionally good article about these things on a website by one Fiona Brunk which you can read here.
EDIT: I'm going to expand on the answer I posted the other day, because I think I really have identified the "intuitive" reason the quintic is unsolvable, as opposed to the "rigorous" reason which involves a lot more group theory. For the third degree equation, I identified these functions:
AAB + BBC + CCA = p
ABB + BCC + CAA = q
A, B and C are the roots of a cubic, but p and q are the roots of a quadratic. You can see that because if you look at pq and (p+q), the elementary symmetric polynomials in p and q, you will see they are symmetric in A, B and C. So they are easily expressible in terms of the coefficients of our original cubic equation. And that's why p and q are the stepping stone which gets us to the roots of the cubic.
Similarly, for the fourth degree, we identified these functions:
AB + CD = p
AC + BD = q
AD + BC = r
You can rewrite the previous paragraph word for word but just take everything up a degree, and it remains true. A, B, C, and D are the roots of a quartic, but p,q and r are the roots of a cubic. You can see they must be because if you look at the elementary symmetric polynomials in p, q and r, you will see they are symmetric in A, B, C and D. So they are easily expressible in terms of the coefficients of our original quartic equation. And that's why they are the stepping stone which gets us to the roots of the quartic.
And the intuititve reason why the fifth degree equation is unsolvable is that there is no analagous set of four functions in A, B, C, D, and E which is preserved under permutations of those five letters. As I mentioned earlier, I think Lagrange understood this intuitively fifty years before Galois. You probably needed a little more group theory to make it completely rigorous, but that's another question.
I think Lagrange would have understood the algebraic tricks whereby you went from, say, A B and C to p and q. It involves taking linear functions which mix A B and C with the cube roots of unity and examining the cube of those functions. Its a reversible process, so you can work backward the other way (by taking cube roots of functions in p and q) to solve the cubic. A very similar trick works for the fourth degree. I think Lagrange was able to show conclusively that the same trick does not work for the fifth degree...that's the "intuitive" proof. The "rigorous" proof would have had to show that in the absence of the obvious tricks (analogous to the 3rd and 4th degree), there was no other possible tricks that you could come up with.
Solution 2:
It is important to understand that Abel and Galois solved somewhat different problems while dealing with quintic equations. Abel always dealt with the simpler case of a general polynomial of fifth degree with symbolic coefficients where Galois handled the more general case where the coefficients involved could be numeric.
I read Abel's treatment (with some simplification done by later authors) in the wonderful book Galois Theory of Algebraic Equations by Jean Pierre Tignol. The idea behind the proof is to understand the relation between roots and coefficients with some focus on how roots are more complicated entities than the coefficients. It is easy to establish the expressions for coefficients in terms of roots (elementary symmetric functions) but doing the reverse is hard. Abel's proof for the unsolvability of a general quintic has two main ingredients :
- If a root can be expressed as a radical expression in terms of coefficients (and the radicals may be nested) then the building blocks of this complicated expression (ie the innermost radicals) as well as the intermediate expressions can be expressed as rational functions of the roots using roots of unity. This is a non-trivial part of the proof but it is based on algebraic manipulation and does not deal with any permutation stuff.
- Radical expression of the coefficients (which are rational functions of the roots via first bullet point above) retain some amount of symmetry under permutation of the roots, no matter how many levels of nested radicals are involved and thus can not be used to express the roots which are totally non-symmetric. In general the process of forming radicals loses some amount of symmetry, but if the number of variables involved is $5$ or more then some amount of symmetry is always retained.
To elaborate the second point the expression $(a-b) ^{2}$ is symmetric in $a, b$ but taking a square root gives $a-b$ or $b-a$ and both of these are not symmetric in $a, b$. So taking square roots or $n$'th roots does break symmetry. But if we have a rational symmetric function say $f(a, b, c, d, e) $ of five variables and if the $n$'th root $\sqrt[n] {f(a, b, c, d, e)} $ can also be expressed as some rational function $g(a, b, c, d, e) $ then $g$ is not entirely non-symmetric ie there are some permutations of the variables which leave this expression unchanged. And this happens no matter how complicated radical expressions we generate via nesting. This fact can be demonstrated without much effort and is significantly simpler to understand compared to studying Galois theory. I have presented the details with proofs in my blog posts.
Solution 3:
The simplest and most intuitive reason I saw so far was:
because, when you have 5 or more things ( roots, letters, fruits ), then the ways you can permute those things can no longer be "factored" into smaller permutations that will produce the same rearrangement even when you combine that permutation with one of the other ways of permuting those 5 or more things. So for 5 and above things, no nice factorizability.
In other words, if you have four things or less, you can always "factor" those permutations into two parts:
- those permutations that when you combine them with any permutation from part 2 you get the same permutation regardless of whether you did the first permutation second or the second permutation first, and
- those permutations that are changed when they are combined with other permutations, depending on the order you combine them
So, having this nice, "factorizable" structure of the permutations makes it possible "factorize" the polynomial and to write down a nice formula in simple operations. When the number of things gets to 5 or any higher number, then the ways you can permute them don't have this nice property any longer. So you can't find any easy way to write them down with simple operations.
Stop reading here if you don't want anything more 'mathy' than this.
If you want the more "mathy" way of saying this, it is that for the group of permutations of 5 or more things, there are no normal subgroups (groups of permutations that produce the same ordering regardless of if you did that permutation first, or the combining permutation first.). When there are no normal subgroups, then the math people call this situation "simple", as in "now that is a simple group" ( when it's actually more complex, so the math people are obviously way too complex ).
If you want the "even more mathy" way of saying it, it is that $A_5$ is the smallest simple group, but that $A_1$, $A_2$, $A_3$, and $A_4$ all have nice normal subgroups you can factor out, which lets you find a nice equation to solve x in a linear, quadratic, cubic or quartic equation.
If you want a basically incomprehensible reference please enjoy visiting this Wiki entry on $A_5$.
Solution 4:
@Sawarnik, what are you referring to exactly when you write that "the formal explanation is very hard"? The basic idea is actually quite simple. I looked through the comments above and none seem to mention the smallest nonabelian simple group which happens to be the group $A_5$ of order $60$. This group is not contained in any $S_n$ for $n\leq 4$, which implies that all those are solvable, or equivalently any equation of order $\leq 4$ is solvable. Solvability of the group corresponds to the solvability in radicals of the polynomial. The lowest degree of a polynomial which makes it possible to have a simple Galois group is therefore $5$.