Galois theory

From Knowino
Revision as of 11:17, 24 July 2011 by Boris Tsirelson (talk | contributions)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Galois theory is an area of mathematical study that originated with Evariste Galois around 1830, as part of an effort to understand the relationships between the roots of polynomials, in particular why there are no simple formulas for extracting the roots of the general polynomial of fifth (or higher) degree.


[edit] Introduction

Galois expressed his theory in terms of polynomials and complex numbers, today Galois theory is usually formulated using general field theory.

Key concepts are field extensions and groups, which should be thoroughly understood before Galois theory can be properly studied.

[edit] Basic summary of Galois theory

The core idea behind Galois theory is that given a polynomial f with coefficients in a field K (typically the rational numbers), there exists

Providing certain technicalities are fulfilled, the structure of this group contains information about the nature of the roots, and whether the equation f = 0 has solutions expressible as a finite formula involving only ordinary arithmetical operations (addition, subtraction, multiplication, division and rational powers) on the coefficients.

This connection between the Galois group and collection of extension fields is known as the Galois connection.

Example illustration of a base field K, large field L and some intermediate fields, with inclusion graph. Here K ⊂ M1 ⊂ M3 ⊂ L and K ⊂ M2 ⊂ M4 ⊂ L.

[edit] The Galois connection

Given a Galois group G we may look for all its subgroups. These subgroups again contain subgroups. This structure is naturally represented by a directed graph.

The collection of intermediate fields may also be represented by such a graph. When the Galois correspondence exists, these graphs are isomorphic.

[edit] The Galois group of a polynomial - a trivial example

As an example, let us look at the second-degree polynomial x2 − 5, with the coefficients {-5,0,1} viewed as elements of Q.

This polynomial has no roots in Q. However, from the Fundamental Theorem of Algebra we know that it has exacly two roots in C, and can be written as the product of two first-degree polynomials there - i.e. x^2-5 = (x-r_0)(x-r_1), r_0, r_1 \in  C. From direct inspection of the polynomial we also realize that r0 = − r1.

Using ordinary algebra and the identity r_0^2 = r_1^2= 5, it is quite easy to show that L = \lbrace a+b r_0, a,b \in Q  \rbrace is the smallest subfield of C that contains Q and both roots.

There are exactly 2 automorphisms of L that leave every element of Q alone: the do-nothing automorphism \phi_0: a+b r_0   \rightarrow a + b r_0 and the map \phi_1 : a+b r_0   \rightarrow a - b r_0.

Under composition of automorphisms, these two automorphisms together form a group isomorphic to S2, the group of permutations of two objects.

The sought for Galois group is therefore S2, which has no nontrivial subgroups.

It can be shown that in this case the Galois correspondence exists, so we may conclude from the subgroup structure of S2 that there is no intermediate subfield of L containing Q and also some of the roots of the polynomial.

[edit] See also

[edit] Related topics

[edit] References

[edit] External links

Information.svg Some content on this page may previously have appeared on Citizendium.
Personal tools