| Revision as of 11:24, 7 November 2012 editD.Lazard (talk | contribs)Extended confirmed users33,782 edits Expanding the stub← Previous edit | Revision as of 03:09, 8 November 2012 edit undoDavid Eppstein (talk | contribs)Autopatrolled, Administrators226,154 edits Added tags to the page using Page Curation (unreferenced)Next edit → | ||
| Line 1: | Line 1: | ||
| {{unreferenced|date=November 2012}} | |||
| In ], a '''resolvent''' for a permutation group ''G'' is a ] whose coefficients depend polynomially on the coefficients of a given polynomial ''p'' and has, roughly speaking, a rational root if and only if the ] of ''p'' is included in ''G''. More exactly, if the Galois group is included in ''G'', then the resolvent has a rational root, and the converse is true if the rational root is a ]. | In ], a '''resolvent''' for a permutation group ''G'' is a ] whose coefficients depend polynomially on the coefficients of a given polynomial ''p'' and has, roughly speaking, a rational root if and only if the ] of ''p'' is included in ''G''. More exactly, if the Galois group is included in ''G'', then the resolvent has a rational root, and the converse is true if the rational root is a ]. | ||
| Resolvents were introduced by ] and systematically used by ]. Nowadays they are yet a fundamental tool to compute ]s. The simplest examples of resolvents are | Resolvents were introduced by ] and systematically used by ]. Nowadays they are yet a fundamental tool to compute ]s. The simplest examples of resolvents are | ||
Revision as of 03:09, 8 November 2012
 | This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Resolvent" Galois theory – news · newspapers · books · scholar · JSTOR (November 2012) (Learn how and when to remove this message) |
In Galois theory, a resolvent for a permutation group G is a polynomial whose coefficients depend polynomially on the coefficients of a given polynomial p and has, roughly speaking, a rational root if and only if the Galois group of p is included in G. More exactly, if the Galois group is included in G, then the resolvent has a rational root, and the converse is true if the rational root is a simple root. Resolvents were introduced by Joseph Louis Lagrange and systematically used by Évariste Galois. Nowadays they are yet a fundamental tool to compute Galois groups. The simplest examples of resolvents are
- where is the discriminant, which is a resolvent for the alternating group. In the case of a cubic equation this resolvent is sometimes called resolvent quadratic; its roots appear explicitly in the formulas for the roots of a cubic equation.
- The cubic resolvent of a quartic equation which is a resolvent for the dihedral group of 8 elements.
- The Cayley resolvent is a resolvent for the maximal resoluble Galois group in degree five. It is a polynomial of degree 6.
where 
is the These three resolvents have the property of being always separable, which means that, if they have a multiple root, then the polynomial p is not irreducible. It is not known if there is an always separable resolvent for every group of permutations.
For every equation the roots may be expressed in terms of radicals and of a root of a resolvent for a resoluble group, because, the Galois group of the equation over the field generated by this root is resoluble.
 | This algebra-related article is a stub. You can help Misplaced Pages by expanding it. |