Any extending field homomorphism is determined by , since every element of is represented by a polynomial in with coefficients in . Applying to the minimal-polynomial equation shows . Thus there are at most choices.
For each listed root , define by . Its kernel contains , so it induces a unital map from the field into . A unital map from a field is injective. This gives an extending homomorphism with . Distinct roots give distinct maps, proving exactly extensions.
An irreducible polynomial is separable if its roots in a splitting field are distinct, equivalently if it is coprime to its formal derivative. For a general nonzero polynomial, the factorwise separability convention means that every irreducible factor is separable. This is the convention under which the printed splitting field implication holds without an extra hypothesis.
If instead separability of an arbitrary polynomial is defined to require all its roots to be distinct, that implication needs the polynomial to be squarefree. For example, has separable splitting extension , but a repeated root. These two conventions agree for irreducible polynomials; repeated factors are the entire distinction here.
For an inseparable example, take and . Eisenstein's criterion at the prime in , followed by Gauss lemma for polynomials, proves irreducibility over its fraction field. Its derivative is zero, and in a splitting field it is , so it is inseparable.
Now let be a separable splitting extension of a nonzero polynomial . Every irreducible factor of has a root , and is a scalar multiple of the minimal polynomial of . Separability of makes this polynomial separable. Therefore every irreducible factor of is separable, which proves the requested conclusion in the factorwise convention. The squarefree qualification under the alternative convention is explained in part (a).
First, the number of embeddings extending a prescribed base embedding is at most the extension degree. Prove this for any finite extension by choosing finitely many algebraic generators and applying part (i) successively. At each step the number of extensions is at most the degree of that simple step; multiplication and the tower law for field extensions give the total bound.
If is not separable, choose with inseparable minimal polynomial of degree . Its image under has strictly fewer than distinct roots in any target field: inseparability is preserved under the coefficient embedding. Thus there are embeddings of extending . Each extends to in at most ways, giving at mostIf instead does not split in , it again has fewer than distinct roots in , and exactly the same estimate applies. Hence either obstruction makes the embedding count strictly less than .
Set , beginning with . Suppose extends . The minimal polynomial of over divides its minimal polynomial over . Its image under therefore divides , which splits into distinct linear factors in . It consequently has exactly distinct roots in . Part (i) supplies exactly this many extensions of to .
Starting with the unique prescribed map on , multiply these branching counts:For the final assertion, let be a splitting field of a separable polynomial and embed it in an algebraic closure . It is generated by roots whose minimal polynomials are separable and split in . Applying the just-proved count with gives embeddings. Were inseparable, part (a) would give strictly fewer. Thus the splitting extension is separable. This works for the factorwise convention as well, since the generators' minimal polynomials divide the separable irreducible factors.
The Galois group is the group of all field automorphisms of fixing every element of , with composition as its operation. A finite extension is a Galois extension if it is both normal and separable; equivalently, it is a splitting extension of separable polynomials, or its group has order . Normality means that every irreducible polynomial over with a root in splits there.
The Fundamental theorem of Galois theory gives an inclusion-reversing bijection for a finite Galois extension with group :It satisfies and . An intermediate extension is Galois precisely when its corresponding subgroup is normal, in which case restriction induces .
The cyclotomic polynomial isBy the allowed irreducibility, this is the minimal polynomial of and its degree is . The field contains every th root of unity and is the splitting field of . This polynomial has no repeated roots in characteristic zero, so the extension is Galois.
An automorphism sends to another primitive root , where is a unit modulo . Conversely each such conjugate defines an embedding, and it is an automorphism of because has an inverse modulo . Composition corresponds to multiplication of exponents. Therefore
Let and . The roots of are , so . This splitting extension is separable in characteristic zero, hence Galois over . The subextension is itself Galois by part (iii), so restriction gives a surjectionwith normal kernel . Surjectivity follows from the extension theorem for embeddings and normality of .
For , write . This defines an injective homomorphism : injectivity holds because , and multiplicativity holds because fixes all roots of unity in . A subgroup of a cyclic group is cyclic. The first isomorphism theorem therefore givesThere is no need to assume that ; the intersection with the cyclotomic field can reduce its order.
Let the monic minimal polynomial of over have coefficients , and put . Each coefficient is algebraic over , so adjoining these finitely many coefficients successively gives . The same polynomial makes algebraic over , giving . The tower law for field extensions yields . Its subfield therefore also has finite degree over . This holds for every , proving is algebraic.
An algebraically closed field is a field in which every nonconstant polynomial has a root, equivalently every such polynomial splits. An algebraic closure of is an algebraic extension of which is algebraically closed.
For the displayed subset , if are algebraic over , then is finite. Sums, differences, products and nonzero inverses of its elements are algebraic over , so is a subfield. If a nonconstant polynomial has coefficients in , those finitely many coefficients generate a finite extension . It has a root by algebraic closure of , and is algebraic over . Part (i) makes it algebraic over , so . Hence is algebraically closed and is an algebraic closure of .
Every lies in the finite subextension , and every element of a finite subextension is algebraic over . Therefore is exactly the union of all finite subextensions inside . The two examples follow.
Take . Every complex number is algebraic over , since , so its algebraic closure inside is . This is a proper containment and
Take . For every positive integer , the real number lies in and has degree , by Eisenstein's criterion at . If had finite degree, all its subextension degrees would be bounded by that degree, contradicting this unbounded family. Therefore is infinite.
Identify with the Euclidean plane and start with the points . A complex number is a constructible number if a finite sequence of drawing lines through known points and circles with known centres and known distances as radii, and selecting their intersections, produces that point.
Line-line intersections solve linear equations in the current coordinate field. Line-circle and circle-circle intersections require at most one quadratic equation after eliminating a coordinate. Hence all coordinates obtained lie in a finite tower of real quadratic extensions of . If is constructible, choose a common such real field containing . Adjoining if needed still gives an extension of power-of-two degree. By the tower law for field extensions,A regular heptagon centred at with one vertex would have as another constructible vertex. But its cyclotomic degree is , which is not a power of two. Thus the regular heptagon is not constructible.
Articles by others on the same topic
There are currently no matching articles.