Abel and the Insolvability of the Quintic: Part 4

4 comments
We now turn to the goal of this series namely to establish the fact that the general polynomial of degree 5 or higher is not solvable by radicals over its field of coefficients. Here Abel's argument is quite terse and I have not been able to fully comprehend some parts of it. Also proof of some statements are not provided by Abel because it appeared quite obvious to him. We will provide here a proof which is based on Ruffini's arguments and its later simplification by Wantzel.

The idea of the proof is to study the field extension K=C(x1,x2,,xn) of F=C(s1,s2,,sn) with regard to the symmetries under various permutations of the indeterminates xi. Clearly the elements of the base field F are invariant under all the possible permutations of xi. But the elements of field K are invariant only under the identity permutation. We need to analyze the behavior of a radical extension R of F which is contained in K with regard to invariance under the permutations of xi.

Insolvability of the General Polynomial of Degree n5

Let the general polynomial of degree n be denoted by P(x) with x1,x2,,xn as its roots so that P(x)=(xx1)(xx2)(xxn)=xns1xn1++(1)nsn where s1,s2,,sn are the elementary symmetric functions of the roots xi. The base field of the coefficients is F=C(s1,s2,,sn) and clearly the splitting field of P(x) over F is K=C(x1,x2,,xn).

We start with a very surprising and curious result regarding the behavior of radical expressions with respect to two specific permutations of the xi. In order to define these two permutations it is absolutely important that we have n5. Such permutations don't exist if n<5.

Theorem 12: Let u,aK=C(x1,x2,,xn) and p be a prime number such that up=a. Let n5 and let σ,τ be two permutations of xi's defined as follows: σ:x1x2x3x1,xixi for i>3 and τ:x3x4x5x3,xixi for i=1,2 and i>5 If a in invariant under the permutations σ,τ then so is u.

Clearly if a=0 then u=0 and the theorem is trivially true in this case. So let a0 so that u0. Now we have up=a so that σ(up)=σ(a)=a or (σ(u))p=a=up. We then have (σ(u)/u)p=1 so that σ(u)/u is some pth root of unity, say ωσ and then we have σ(u)=ωσu.

Applying the permutation σ to this equation we get σ2(u)=σ(ωσu)=ωσσ(u)=ω2σu and similarly σ3(u)=ω3σu. But σ3 is the identity permutation and hence we get ω3σu=u so that ω3σ=1.

Following exactly the same reasoning we get τ(u)=ωτu where ωτ is some pth root of unity and we have ω3τ=1. Now its time to do some permutation algebra. Clearly we have στ:x1x2x3x4x5x1,xi=xi for i>5 and σ2τ:x1x3x4x5x2x1,xi=xi for i>5 Again we can see that (στ)u=ωσωτu,(σ2τ)(u)=ω2σωτu Since both (στ)5 and (σ2τ)5 are identity permutations it follows that (ωσωτ)5=(ω2σωτ)5=1 Also we have previously obtained ω3σ=ω3τ=1 Now it is clear that ωσ=(ω3σ)2(ωσωτ)5(ω2σωτ)5=111=1 and ωτ=(ω3τ)2ω5σ(ωσωτ)5=111=1 We thus have σ(u)=ωσu=u,τ(u)=ωτu=u so that u is invariant under the permutations σ and τ.

We are now ready to prove the insolvability of the polynomial P(x) by radicals if n5. We have the precise statement of the theorem as follows:

Theorem 13: If n5 then the general polynomial of degree n given by P(x)=(xx1)(xx2)(xxn)=xns1xn1++(1)nsn is not solvable by radicals over Q(s1,s2,,sn) nor over C(s1,s2,,sn).

By theorem 6 of this post it is sufficient to show that the polynomial P(x) is not solvable by radicals over F=C(s1,s2,,sn). Let us suppose on the contrary that the polynomial P(x) is solvable by radicals over F. This means there is a radical extension R of F which contains a root xi of P(x). By renumbering of the xi's it is possible to ascertain that R contains x1 in particular. Now by the theorem of natural irrationalities proved in the last post we can assume that R is contained in K=C(x1,x2,,xn). Let the height of R over F be h. Clearly h can not be zero as it would mean R=F and hence every member of R including the root x1 would have to be invariant under all the permutations of the xi's. Hence h>0. Let F=R0R1R2Rh=R be the tower of radical extensions leading from F to R. Here each Ri is a radical extension of height 1 of Ri1.

Consider first the radical extension R1 of height 1 over F. Clearly we have a member uR1 and a prime p such that R1=F(u) and up=aF is not a pth power in F. Clearly the element a \in F is invariant under all the permutations of the x_{i}'s and since n \geq 5, the element a is invariant under the two permutations \sigma and \tau defined in theorem 12 above. It follows from theorem 12 that the element u is also invariant under \sigma, \tau. Since every element of F is also invariant under these two permutations it follows that every element of F(u) = R_{1} is also invariant under \sigma, \tau.

Now considering the field R_{2} as a radical extension of height 1 over R_{1} and repeating the same argument we see that every element of R_{2} is also invariant under \sigma, \tau. Continuing this process for each of the fields R_{i} we finally see that every member of R_{h} = R is invariant under \sigma, \tau. But we have x_{1} \in R which is clearly not invariant under \sigma and therefore we obtain a contradiction. It follows that our initial assumption of the solvability of P(x) by radicals over F is wrong and thereby our proof is complete.

Note: The treatment of the insolvability of general polynomial of degree 5 or more in this series of posts is taken from the wonderful book Galois Theory of Algebraic Equations by Jean-Pierre Tignol. Readers are advised to go through this beautiful book for further development in these topics. This has been the first understandable presentation of Abel's proof I have found in literature and online articles. Most of the Modern Algebra textbooks totally ignore the contributions of Abel or just mention it as a historical note and straightaway jump onto the beautiful theories of Galois. Tignol's book discusses all the historical developments leading upto Galois Theory with the exposition of the contributions from various mathematicians like Gauss, Lagrange, Abel and finally Galois.

Print/PDF Version

4 comments :: Abel and the Insolvability of the Quintic: Part 4

Post a Comment

  1. may i know some of the online sources which help you to understand the mathematics?

  2. @rob,
    The best online source is google. You type any damn topic (e.g "Ramanujan's series for pi") in google and you get a list of papers by Bruce C Berndt and hopefully my blog. Of course this is not a step by step approach, but enough online searches will give you access to many papers and old classic books (whose copyright is expired) and these will help you a lot.

    Another great site is the Q&A http://math.stackexchange.com where you can ask any mathematics question and the users there will help you a lot (much more than any regular teacher or professors).Apart from that you must have access to some books (a list is mentioned in my bibliography section) either through a library or a direct purchase.

    You can see a list of math blogs at http://www.mathblogging.org/ and some of these blogs are really a good source of studying mathematics.

  3. This is rather late but:

    The roots of unity defined in the proof of the first theorem are both p-th roots and 3-rd roots. This alone forces them to be equal to 1 by the euclidean algorithm since p>3. Am I missing something?

  4. @Asvin
    You are right. The proof in my post also does the same but does not mention the word Euclidean Algorithm.

    Regards,
    Paramanand