This is a re-post [from MSE](https://math.stackexchange.com/q/1341836/72031) (because I did not get the kind of answer I wanted even after offering a bounty).


At the outset I must mention that I don't have a fairly working knowledge of Galois Theory (but do have some idea of group theory in the sense that I can understand normal subgroups).


I read the proof of unsolvability of a general quintic via radicals from J P Tignol's "Galois Theory of Algebraic Equations". Here he discusses the proof by Abel and goes on to establish the following theorem (see details in my [blog post](http://paramanands.blogspot.com/2014/01/abel-and-the-insolvability-of-the-quintic-part-4.html)):


**Theorem**: Let $x\_{1}, x\_{2}, \ldots x\_{n}$ be indeterminates and let elements $a, b$ be in field $K = \mathbb{C}(x\_{1}, x\_{2}, \ldots, x\_{n})$ such that $a = b^{p}$ for some prime number $p$. Let $n \geq 5$ and define permutations $\sigma, \tau$ such that $\sigma$ permutes $x\_{1}, x\_{2}, x\_{3}$ cyclically and $\tau$ permutes $x\_{3}, x\_{4}, x\_{5}$ cyclically. If $a$ in invariant under both $\sigma, \tau$ then so is $b$.


Because of the equation $a = b^{p}$ the above theorem implies that when $n \geq 5$ there are some symmetries (invariance under $\sigma, \tau$) which remain even after taking radicals. Thus starting with the elementary symmetric function $s\_{1}, s\_{2}, \ldots, s\_{n}$ of the indeterminates $x\_{i}$ the process of taking radicals will preserve the symmetries related to $\sigma, \tau$. On the other hand each one of the indeterminates $x\_{1}, x\_{2}, x\_{3}, x\_{4}, x\_{5}$ is changed via at least one of $\sigma$ and $\tau$. Thus the field $K$ has elements which are changed by $\sigma, \tau$ but any element of a radical extension of $F = \mathbb{C}(s\_{1}, s\_{2}, \ldots, s\_{n})$ is invariant under $\sigma, \tau$ and hence it is not possible to get to $K$ from $F$ via radical extensions.


On the other hand most modern treatments of unsolvability of quintic base it on the simplicity of alternating group $A\_{5}$. Understanding the above mentioned theorem in Tignol's book is quite easy (simple algebraic manipulation) but its not same as regards to simplicity of $A\_{5}$.



> 
> Is simplicity of $A\_{5}$ somehow linked with the above basic theorem? What I need is a proper link between properties of $A\_{5}$ and the above theorem. What is so special about elements $\sigma = (1,2,3), \tau = (3,4,5)$ of $A\_{5}$? And why don't we have such permutations when $n < 5$ whose symmetries are preserved when taking radicals.
> 
> 
> 


**Update**: I think I need to clarify my point very clearly. The message of the theorem described above is that *for $n \geq 5$ there exists a set $P$ of permutations on $n$ symbols such that $P$ includes at least one non-identity permutation and the process of root extraction preserves the symmetries induced by the permutations of $P$.* For $n < 5$ root extraction preserves the symmetries induced only by the identity permutation (trivially).


My real problem is that I am unable to map this simple concept with the comparatively difficult concept of unsolvability / simplicity of $A\_{5}$. There is a feeling that probably the solvability of polynomials is a much simpler concept than the solvability of groups (as least as far the general polynomials with indeterminate coefficients are concerned). At the same time this feeling is crushed by the theorem of Galois that "a polynomial is solvable by radicals *if and only if* its galois group is solvable" so that these concepts are at the same level of depth/difficulty.


If it helps, I checked Tignol's book and he mentions that the theorem mentioned above is by Paolo Ruffini and he gives the reference:


P. Ruffini, Opere Matematiche (3 vols), E. Bortolotti, ed., Ed. Cremonese 
della Casa Editrice Perrella, Roma, 1953-1954.


The result is available in pages 162-170 in vol 2.


**Further Update**: I am not getting the kind of answer I need. Perhaps I need to provide a context in the language of Galois Theory. Let's assume fields to be of characteristic $0$ in what follows.


Let $f(x) \in F[x]$ be a polynomial and $K$ be splitting field of $f$. Galois theory says that the galois group of $f$ (over field $F$) is the set of automorphisms of $K$ which leave $F$ fixed. Also if $L$ is another field with $F \subseteq L \subseteq K$ then galois group of $f$ over $L$ is a subgroup of its galois group over $F$. Also note that the galois group can be viewed as a subgroup of the group of permutations of roots of polynomial $f(x)$.


It is further known that when the field $L$ is obtained by adjoining all roots of an irreducible polynomial $p(x) \in F[x]$ (of degree $k$) so that $L = F(\alpha\_{1}, \dots, \alpha\_{k})$ and $p(\alpha\_{i}) = 0$ for $i = 1, 2, \dots, k$ then the galois group $Gal(K/L)$ is a normal subgroup of $Gal(K/F)$. This case is relevant when $L$ is a radical extension of $F$.


In our case $F = \mathbb{C}(s\_{1}, \dots, s\_{n}), K = \mathbb{C}(x\_{1}, \dots, x\_{n})$ and we are directly able to find a set of permutations of $x\_{i}$ which leave every element of $L$ fixed where $L$ is a radical extension of $F$. Hence if $L$ is any radical extension of $F$ with $F \subseteq L \subseteq K$ then $Gal(K/L)$ contains two permutations $\sigma, \tau$ given above. Since radical extensions correspond to a chain of reducing (getting smaller in size) normal subgroups of $S\_{n}$, this shows that the series can never get to the trivial group consisting of identity.


In my opinion the theorem by Paolo Ruffini provides a very direct and easily accessible proof of unsolvability of the $S\_{5}, A\_{5}$ and it is so unlike the usual proofs of unsolvability of $A\_{5}$. Let me know if my views are correct. Furthermore



> 
> Is the "unsolvability of universal / general polynomials of degree 5 or greater" is a much simpler result which does not require the machinery of solvable groups?
> 
> 
> 



Unsolvability of a Quintic and its link with "Simplicity" of $A_{5}$
I think this is very like the "usual" proof of the unsolvability of $A\_5$. I put usual in quotes because most books skip directly to proving that $A\_5$ is simple, without proving unsolvability first.


Let $G$ be a finite group. Recall that the abelianization, $G^{ab}$, of $G$ is the largest abelian quotient of $G$. Set $G' = \mathrm{Ker}(G \to G^{ab})$. Repeating in this manner, we obtain the [derived series](https://en.wikipedia.org/wiki/Commutator_subgroup#Derived_series) $G \supseteq G' \supseteq G'' \cdots$, and $G$ is solvable if and only if this series stops at the trivial group. 


To check that $A\_5$ is not solvable, then, it is enough to check that $A\_5^{ab}$ is trivial. How does one usually compute $G^{ab}$? One takes a list of generators $g\_1$, $g\_2$, ..., $g\_k$ and relations $\prod\_a g\_{i\_a}=e$ and turns them into additive generators $h\_i$ and relations $\sum h\_{i\_a}=0$ for an abelian group. In this case, Abel takes the relations $\sigma^3=\tau^3 = e$ and $(\sigma \tau)^5=(\sigma^2 \tau)^5=e$. This shows that the abelianization of the group generated by $\sigma$ and $\tau$ is 
$$\frac{\mathbb{Z} s \oplus \mathbb{Z} t}{ \langle 3s,\ 3t,\ 5s+5t,\ 10s+5t \rangle }\cong \{ 0 \}.$$


To state Abel's result in modern language, he is showing the following:



> 
> Let $\sigma\_1$, $\sigma\_2$, ...., $\sigma\_r$ be a set of permutations
>  in $S\_n$. Let $G$ be the group they generate and suppose that $G^{ab}$
>  is trivial. Suppose that $f$ is a polynomial such that $f^p$ is
>  invariant for the $\sigma\_i$. Then $f$ is invariant for the
>  $\sigma\_i$.
> 
> 
> 


Note that this criterion is capable of proving the nonsolvability by radicals of any polynomial which is not so solvable. Let $\Gamma \subset S\_n$ be the Galois group of some nonsolvable polynomial, and let the derived series of $\Gamma$ stabilize at $G$. So $G^{ab}$ is trivial but $G$ is not. Apply the above criterion to a list of generators for $G$.


