<?xml version="1.0" encoding="ISO-8859-1"?>

<!DOCTYPE math PUBLIC "-//W3C//DTD MathML 2.0//EN"	
"http://www.w3.org/Math/DTD/mathml2/mathml2.dtd">

<html xmlns="http://www.w3.org/1999/xhtml">


<!--
<?xml-stylesheet type="text/xsl" href="http://www.w3.org/Math/XSL/mathml.xsl"?>
<html xmlns="http://www.w3.org/1999/xhtml">


<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN"
"http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd">

<html xmlns="http://www.w3.org/1999/xhtml"
xmlns:math="http://www.w3.org/1998/Math/MathML"
xmlns:xlink="http://www.w3.org/1999/xlink">
-->

<head>
  <title>Galois Theory</title>
  <base href="http://www.maths.leeds.ac.uk/%7Eahubery/GaloisTheory/" />
  <link rel="shortcut icon" href="D_8.ico" type="image/x-icon" />
</head>

<body style="color: rgb(0, 0, 0); background-color: rgb(255, 255, 255);">
<h2>Fields and Galois Theory</h2>

<!--
<p>
<a href="GaloisTheory.pdf">Course Notes</a>
</p>
-->

<!--
<ul>
<li><a href="Exercises1.pdf">Exercises 1</a>
<ul><li><a href="Solutions1.pdf">Solutions</a></li></ul>
</li><li><a href="Exercises2.pdf">Exercises 2</a>
<ul><li><a href="Solutions2.pdf">Solutions</a></li></ul>
</li><li><a href="Exercises3.pdf">Exercises 3</a>
<ul><li><a href="Solutions3.pdf">Solutions</a></li></ul>
</li><li><a href="Exercises4.pdf">Exercises 4</a>
<ul><li><a href="Solutions4.pdf">Solutions</a></li></ul>
</li>
</ul>
-->

<h3>Course Description</h3>

<p>
One of the fundamental problems in algebra is to find solutions to polynomial equations. Algebraic Geometry is a branch of mathematics studying the solutions to families of polynomials involving many variables. Some modern crytographic techniques are based on solutions to elliptic functions.
</p>

<p>
Galois Theory refers to finding roots of a polynomial in a single variable, for example
<math xmlns="http://www.w3.org/1998/Math/MathML">
<mi>f</mi><mo>=</mo><mn>4</mn><msup><mi>x</mi> <mn>7</mn></msup><mo>-</mo><mn>6</mn><msup><mi>x</mi> <mn>2</mn></msup><mo>+</mo><mn>2</mn><mi>x</mi><mo>+</mo><mn>1.</mn>
</math>
</p>

<p>
In modern terminology, it associates to a polynomial the field generated by all its roots and considers the group of automorphisms of this field. The question of whether a polynomial is solvable by radicals or not is then replaced by the question of whether the group is a solvable group or not. In fact, this is the origin of the term solvable group. One should remark that Thompson has just been awarded the Abel prize for his work on finite groups, including the celebrated Feit-Thompson Theorem, which proves that every finite group with an odd number of elements is solvable.
</p>

<p>
Galois Theory is seen as one of the starting points of modern algebra, where symmetry plays a central role. In fact, symmetry is prevalent in mathematics, physics (for example super-symmetric string theory) and also art (Girih tilings in Islamic architecture).
</p>

<p>
Everyone learns in school that the roots of a quadratic equation are given by a formula, although these roots may be complex numbers. In fact, if
</p>

<math xmlns="http://www.w3.org/1998/Math/MathML" display="block">
<mi>f</mi><mo>=</mo><mi>a</mi><msup><mi>x</mi><mn>2</mn></msup><mo>+</mo><mi>b</mi><mi>x</mi><mo>+</mo><mi>c</mi><mo>,</mo>
</math> 

<p>
then the roots of <i>f</i> are given by
</p>

<math xmlns="http://www.w3.org/1998/Math/MathML" display="block">
<mi>x</mi><mo>=</mo><mfrac><mrow><mo>-</mo><mi>b</mi><mo>&#177;</mo><msqrt><mrow><msup><mi>b</mi><mn>2</mn></msup>
<mo>-</mo><mn>4</mn><mi>a</mi><mi>c</mi></mrow></msqrt></mrow><mrow><mn>2</mn><mi>a</mi></mrow></mfrac><mo>.</mo>
</math> 

<p>
This formula was essentially known to the Babylonians (1600 BC).
</p>

<p>
A similar formula exists for cubic polynomials. This was discovered by Fontana, but is commonly referred to as Cardano's Formula, since it was first published by him in 1545. Ferrari, a student of Cardano, found a formula for the quartic polynomial. This was also published in Cardano's manuscript.
</p>

<p>
The formulae for the roots of quadratic, cubic and quartic polynomials involve the usual arithmetic operations of addition, subtraction, multiplication and division, together with taking square roots and cube roots. It was therefore a natural question whether similar formulae existed for all polynomials, if we also allow taking 5-th roots, 7-th roots, and <i>p</i>-th roots for all prime numbers <i>p</i>. (It is enough to consider primes, since every number can be written as a product of primes.) Such expressions are called <i>radical expressions</i>, and we say that a polynomial is <i>solvable by radicals</i> if such a formula exists. Hence all quadratic, cubic and quartic polynomaials are solvable by radicals.
</p>

<p>
Lagrange later unified the methods for quadratic, cubic and quartic polynomials, and showed that they all depend on finding functions of the roots which are invariant under certain permutations, hence have certain symmetries. He also showed that this approach cannot work for a quintic polynomial.
</p>

<p>
Extending ideas of Ruffini, Abel proved in 1824 that no single formula can work for all quintic polynomials. Kronecker later published a simple, rigorous proof in 1879.
</p>

<p>
This didn't quite solve the problem, though, since some polynomials are obviously solvable by radicals. For example
</p>

<math xmlns="http://www.w3.org/1998/Math/MathML" display="block">
<mi>f</mi><mo>=</mo><msup><mi>x</mi> <mn>5</mn></msup><mo>-</mo><mn>2</mn>
</math> 

<p>
is solvable by radicals, since it has the solution
</p>

<math xmlns="http://www.w3.org/1998/Math/MathML" display="block">
<mi>x</mi><mo>=</mo><msup><mrow></mrow><msup><mrow></mrow><mn>5</mn></msup></msup><msqrt><mn>2.</mn></msqrt>
</math> 

<p>
The possibility therefore still existed that each quintic polynomial had its own special formula.
</p>

<p>
The answer was found by Galois in 1830. Given a polynomial, he considered the group of all symmetries of its roots, now called its Galois group. He then showed that the polynomial is solvable by radicals if and only if its Galois group has a chain of subgroups such that each subgroup is normal in the next and with cyclic factor group. Such groups are now called solvable groups. Since one can exhibit quintic polynomials having Galois group the symmetric group on 5 letters, which is known not be solvable, for example
</p>

<math xmlns="http://www.w3.org/1998/Math/MathML" display="block">
<mi>f</mi><mo>=</mo><msup><mi>x</mi> <mn>5</mn></msup><mo>-</mo><mn>6</mn><mi>x</mi><mo>+</mo><mn>2,</mn>
</math>

<p>
one sees that in general, polynomials of degree at least 5 are not solvable by radicals.
</p>

<hr/>

<p>
<a href="http://validator.w3.org/check?uri=http%3A%2F%2Fwww.maths.leeds.ac.uk%2F~ahubery%2FGaloisTheory%2Findex.xml">
<img src="http://www.w3.org/Icons/valid-mathml20" alt="Valid XHTML 1.1 plus MathML 2.0" style="float:right"/>
<img src="http://www.w3.org/Icons/valid-xhtml11" alt="Valid XHTML 1.1 plus MathML 2.0" style="float:right"/>
</a>

A. Hubery<br/>Last modified 21 May 2008
</p>

</body>
</html>

