Talk:Galois theory: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Ragnar Schroder
imported>Ragnar Schroder
 
(3 intermediate revisions by 2 users not shown)
Line 10: Line 10:
|                  by = [[User:Ragnar Schroder|Ragnar Schroder]] 00:28, 11 December 2007 (CST)
|                  by = [[User:Ragnar Schroder|Ragnar Schroder]] 00:28, 11 December 2007 (CST)
}}
}}
== Introduction:  Initiated with Galois? ==
Any thoughts on whether the origins of Galois theory should be expanded to include permutations of polynomial roots studied by Lagrange and/or Abel's work contemporary to Galois's?  I believe these could well be thrown under the "Galois Theory" umbrella is Galois's own work is.
:Sound like a good idea to me.  I've kind of given up on making this article into the easy exposition I had hoped to create, high quality edits and comments from others are welcome.
:[[User:Ragnar Schroder|Ragnar Schroder]] 02:04, 16 January 2009 (UTC)
Moved the following content away from the main page for corrections.
==The Galois connection==
Given a Galois group G we may look for chains <math>G = H_0  \sub H_1 \sub H_2 \ldots \sub H_n = S_1 </math> such that  <math> H_1 </math> is a normal subgroup in <math> H_0 </math>,  <math> H_2 </math> is a normal subgroup in <math> H_1 </math>, etc.
The collection of all these chains may be represented by a [[graph theory|directed graph]],  with the various subgroups as nodes and the relation <math> B \sub A </math> represented by a directed edge from A to B.
Similary,  given the collection of intermediate fields,  we may look for chains <math>K = M_n  \sub M_{n-1} \sub M_{n-2} \ldots \sub M_0 = L </math> of fields such that for all <math> i > 0 ,  M_i </math> is a normal field extension [[Galois theory glossary|(glossary)]] of <math> M_{i-1} </math>.
The collection of all these chains may be represented by a directed graph as well,  with the various fields as nodes and the relation <math> B \sub A </math> represented by a directed edge from B to A.
The Galois correspondence, when it exists, is an isomorphism between the two graphs.
:The following paragraph is a scratch for the next paragraph in the article,  building on the "trivial" example.





Latest revision as of 20:04, 15 January 2009

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition Algebra concerned with the relation between solutions of a polynomial equation and the fields containing those solutions. [d] [e]
Checklist and Archives
 Workgroup category Mathematics [Editors asked to check categories]
 Talk Archive none  English language variant American English

Introduction: Initiated with Galois?

Any thoughts on whether the origins of Galois theory should be expanded to include permutations of polynomial roots studied by Lagrange and/or Abel's work contemporary to Galois's? I believe these could well be thrown under the "Galois Theory" umbrella is Galois's own work is.


Sound like a good idea to me. I've kind of given up on making this article into the easy exposition I had hoped to create, high quality edits and comments from others are welcome.
Ragnar Schroder 02:04, 16 January 2009 (UTC)



Moved the following content away from the main page for corrections.

The Galois connection

Given a Galois group G we may look for chains such that is a normal subgroup in , is a normal subgroup in , etc.

The collection of all these chains may be represented by a directed graph, with the various subgroups as nodes and the relation represented by a directed edge from A to B.

Similary, given the collection of intermediate fields, we may look for chains of fields such that for all is a normal field extension (glossary) of .

The collection of all these chains may be represented by a directed graph as well, with the various fields as nodes and the relation represented by a directed edge from B to A.

The Galois correspondence, when it exists, is an isomorphism between the two graphs.



The following paragraph is a scratch for the next paragraph in the article, building on the "trivial" example.


The Galois group of a polynomial - a basic example

By reasoning similar to the above, it can be shown that the Galois group of the fourth-degree polynomial - again with the coefficients viewed as elements of Q - is isomorphic to the dihedral group of the square. This group has 8 elements as illustrated in fig. 1, and a normal subgroup structure as illustrated in fig. 2.

Also, there are exactly 6 intermediate fields between the smallest field L containing all the roots and Q itself containing some of the roots, making 8 all together, as illustrated in fig. 3.

The Galois correspondence is illustrated in fig. 4.




The Galois group of a polynomial - a trivial example

As an example, let us look at the second-degree polynomial , 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. . From direct inspection of the polynomial we also realize that .

L = is the smallest subfield of C that contains Q and both and .

The are exactly 2 automorphisms of L that leave every element of Q alone: the do-nothing automorphism and the map .

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

The sought for Galois group is therefore , 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 that there is no intermediate field extension containing Q and also roots of the polynomial.

Basic summary of Galois theory

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

  • a "splitting field" for over K. This is just a field containing K (or a field isomorphic to K) as a subfield and also all the roots of .
  • a smallest possible field L that contains K (or a field isomorphic to K) as a subfield and also all the roots of . This field is known as the extension of K by the roots of . It is a basic theorem in Galois theory that for any field K and any polynomial with coefficients in K, such a field exists.


  • fields containing K (or a field isomorphic to K) as a subfield and
  • a group containing all automorphisms in L that leave the elements in K untouched - the Galois group of the polynomial .


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




The following is just a scratch to work out the 1st non-stub version of the article


Text from below here is not in the article yet



However, we may create an extension field L containing two elements such that . By the fundamental theorem of algebra this is always possible - there exists a subfield L of C such that

As an example, the second-degree polynomial - when the coefficients {0,1,5} are viewed as elements of Q - turns out to have the Galois group .

From the subgroup structure of - the only proper subgroup is the trivial group - we may conclude that the chain of extension fields from Q to the smallet extension field of Q such that the polynomial splits is trivial - no intermediate extension fields exist.

Finding the Galois group of a polynomial is in general a tedious process, in this example it was easy, since the group had to be contained in .


Looking again at the polynomial , one may wonder exactly what it's "Galois group" is, and how to find it.

... Mention something about the Fundamental theorem of algebra, which implies that there is a subfield in C such that can be split into linear factors ...

...Mention , where n is the degree of the polynomial ...

Basic concepts/glossary

  • Polynomial over a field K: An expression of the form , with .
  • Root of a polynomial : a number r such that
  • A splitting field for a polynomial : A field which contains the original field K as a subfield, and also contains all the roots of .

Summary of the theory

Given a polynomial with coefficients in some field K, it may be the case that the equation has no solutions in K. In that case, is said to be irreducible in K.

Anyway, if K is a subfield of C, we are guaranteed by the fundamental theorem of algebra that there exists a subfield of C containing K and all the roots.

...blabber about field of characteristic <> 0 ...



Field extensions

Any field K can be "extended" by including one or more "foreign" elements, f.i. the field Q can be extended by including sqr(2). The resulting field is the subset of R described by a+b sqrt(2), a,b in Q.

Similarly, if r1, r2, ... rn are roots of a polynomial α , a lattice of extension fields may be constructed. ...

Algebraic extension vs transcendental...

The order of an extension ...

Normal extensions and splitting fields ...

Given a polynomial with coefficients in a field K, there exists a field M ⊇ K - known as a splitting field of - which contains all the roots of .


The Galois correspondence

The correspondence between the Galois group subgroup structure and the field extension lattice ...

Caveat - separability - only relevant with non-zero characteristic fields.

Soluble groups ... Why neither the quintic nor its friend S5 are "soluble". Why 60 degree angles won't let themselves be "trisected". Why this was a triumph for Galois theory, 2000+ year old riddles solved.



How much to rely on an extra "Field extensions" article?
Ragnar Schroder 05:38, 12 December 2007 (CST)