Source: Mathematics release, bundle Part B 2007 11.pdf, pages 233–236. The paper was sat on 7 June 2010, 2.30–5.30pm, for Mathematics and Mathematics and Philosophy Part B.
Bounded exact-paper availability checks found no matching full or selected answer advertisement. The department's general even-year policy establishes coverage back to at least 2016, and does not itself establish coverage for this 2010 paper. All printed leaves and unnumbered requests are answered below.
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.
An algebraic field extension is separable if every has a separable minimal polynomial over .
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 most
If 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 is
By 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 surjection
with 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 gives
There 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.
An integral basis is a -basis of the ring of integers ; its elements also form a -basis of .
To prove existence, first multiply the elements of a rational basis by suitable nonzero integers to obtain an integral rational basis . Put . The trace pairing is nondegenerate in characteristic zero, and the matrix has integer entries and nonzero determinant . If is integral, all are integers, so . The adjugate formula gives . Consequently
A subgroup of a free abelian group is free, and these inclusions force rank . A -basis of is therefore an integral basis.
Now put and . The polynomial is irreducible by Eisenstein at any prime dividing the squarefree , except for , where is Eisenstein at . Thus and . Every has the unique form with . The nontrivial -automorphism sends to , so an integral has integral conjugate . Relative trace and norm of integral elements are integral in . Applying them to and taking the trace of gives
The power basis has discriminant
Indeed, the resultant of and is ; the discriminant sign factor is . By the discriminant-index formula for an integral lattice, a prime dividing must divide .
No odd prime can divide this index. The Eisenstein equation gives , while has nonintegral field norm for and : its -adic norm valuation is . If were integral, multiplication by first forces ; subtracting and multiplying by forces . Continuing forces all coefficients divisible by . This excludes an index element of order .
To exclude , any index element of order two would be represented by an integral
with integers not all even. Here and . The integrality of forces
Since , the first congruence implies have the same parity. If both were odd, the second would require , impossible. Hence are even. The second congruence then forces to have the same parity, while the first forces even. Thus are even too, a contradiction. Therefore the index is one and
For the last request, let and take . It satisfies , and hence
This monic integer polynomial proves integrality. Its coordinates in the rational power basis have halves, so . Also with a nonzero coefficient in ; if were in that quadratic field, then would be too, contradicting degree four. Thus it meets both exclusions.
The product of ideals consists of finite sums with , . Ideal divisibility means for an integral ideal ; in this ring it is equivalent to . The ideal norm is , equivalently its additive lattice index.
If the prime ideal divides but does not divide , choose . For every , , so primality gives . Thus , proving .
Every nonzero proper ideal is contained in a maximal ideal , which is prime. Then , so . Norm multiplicativity gives because . Induction on the positive integer gives a prime-ideal factorization, ending at norm one. For uniqueness, a prime in one factorization divides some prime in the other. Every nonzero prime ideal is maximal, since its quotient is a finite integral domain and hence a field. The two primes therefore coincide. Cancel that common factor using the permitted cancellation law, and continue. This proves uniqueness up to order.
The finite additive group has order , so that integer annihilates the class of . Therefore
In particular an ideal of norm contains . Such ideals correspond to certain additive subgroups of the finite group , so there are finitely many. Finiteness of these quotients follows from an integral basis; a nonzero ideal contains a nonzero principal ideal, whose index is the absolute field norm of its generator.
For the computation put . The Kummer-Dedekind theorem says that when does not divide the power-basis index, a factorization gives , with each factor having norm . The given full power basis has index one. Since and ,
Here and . A prime ideal dividing an ideal of norm lies above or , and these are all the prime ideals above them. Unique factorization and norm multiplicativity therefore leave exactly
They are distinct by their prime-ideal valuations, and each has norm .
Equality gives and for some . Substitution and cancellation of the nonzero yield . Thus is a unit and .
For the ideal-power assertion, suppose first that all ideals are nonzero. A prime ideal divides at most one because the are pairwise coprime. Taking its valuation in the given equality gives
Since , every exponent is divisible by . Dividing all its prime-factorization exponents by constructs an integral ideal with . If a is zero, pairwise coprimality forces all other to be the unit ideal; taking and the other covers that degenerate case too.
For the first Diophantine equation, cannot be odd: then , while a cube modulo eight is or odd. Hence is even and is odd. Also , since otherwise , impossible for a cube.
In , , factor
The two principal ideals are coprime. A common prime ideal would divide their sum and difference , and hence lie above or ; odd norm excludes , while excludes . Their coprime product is the cube , so the ideal-power assertion makes . The class group has order , while , so . Write for integers .
The only units are , since their norm equation is . Equality of principal ideals therefore gives . Absorb the sign into . Comparing the coefficient of yields
Thus or . The first gives and the second gives , both impossible for an integer . Consequently the first equation has no integral solutions.
For the product equation, odd gives , again not a cube. If , each factor has -adic valuation one, so the product has valuation two, also impossible. Thus any hypothetical solution has even and . The two positive factors are odd, and their greatest common divisor divides
It must therefore be one. A product of coprime positive integers is a cube only if each factor is a cube. This would make a cube, contradicting the result already proved. Hence the product equation also has no integral solutions.

Articles by others on the same topic (0)

There are currently no matching articles.