Source: Mathematics release, bundle
Part B 2007 11.pdf, pages 302–305. The paper was sat on 10 June 2011, 2.30–5.30pm, and is shared by Mathematics, Mathematics and Computer Science, Mathematics and Philosophy, and Mathematics and Statistics Part B.The department's answer-release policy excludes ordinary odd years. Bounded exact-paper checks found no matching advertised answers; all parts are answered below.
A splitting field of a nonconstant polynomial over a field is an field extension in which factors into linear factors and which is generated over by those roots. We prove existence and the divisibility simultaneously by induction on ; constant nonzero polynomials have splitting field .
If is reducible, write with positive degrees . By induction first split , obtaining of degree dividing , then split over , obtaining of degree dividing . The tower law for field extensions gives . All adjoined elements are roots of , so has the required minimality.
If is irreducible, take and let be the image of . Then and in . Apply induction to , of degree , to obtain . ThereforeThis proof also covers inseparable polynomials; it does not incorrectly identify extension degree with automorphism count in that case.
For a splitting field of over , define . Each automorphism permutes the distinct roots, since it fixes the coefficients. An automorphism fixing every root fixes the field they generate, so this action is faithful. If there are distinct roots, it gives an embedding into , and hence into by fixing additional symbols.
Factorization over the rational numbers givesThe rational roots add nothing to the splitting field. By Eisenstein's criterion at , is irreducible. Put and . Its splitting field is . The real field has degree ; the nonreal element has degree over it. Thus , and its faithful action on the three nonrational roots identifies
The polynomial is irreducible by Eisenstein's criterion at . Its Galois group therefore acts transitively on five roots, so its order is divisible by by the orbit-stabilizer theorem.
To count the real roots, differentiate:It is positive on , negative on , and positive thereafter. The local maximum is and the local minimum is . The limits at infinity have opposite signs, so there are exactly three real roots and one conjugate pair of nonreal roots. Complex conjugation fixes the three real roots and interchanges the other two; its permutation is a transposition. The prime-degree subgroup result supplied in the paper now gives
Over the finite field ,The nonzero squares modulo are , so is not a square. Adjoining a root of produces and already gives both roots. Its Frobenius automorphism has order and interchanges them, whence
Over the finite field ,The discriminant of the quadratic is . The nonzero squares are , so the quadratic is irreducible. Its two roots lie in , with the Frobenius automorphism interchanging them. Hence
The fixed field isIt is a subfield because every field automorphism preserves sums, products and inverses.
Set . If is infinite the desired finite lower bound is immediate. Otherwise let be an -basis of . If , the homogeneous system over has a nonzero solution. For , with , every fixes , so the same coefficients give . This contradicts linear independence of distinct field embeddings. Consequently
The Fundamental theorem of Galois theory says that for a finite Galois extension with group , the maps and are mutually inverse inclusion-reversing correspondences between subgroups and intermediate fields. They satisfy and . An intermediate extension is Galois exactly when its subgroup is normal, in which case its group is the quotient by that subgroup.
Let , , . The real field has degree : if with , squaring forces and either or , both impossible. Adjoining the nonreal doubles the degree. All three square-root signs can be changed independently, givingWrite for the automorphism sending to , where . Every nonzero vector generates an order-two subgroup, so there are such subgroups. Their fixed fields are:
| Generator | Fixed field |
|---|---|
Each listed field has degree and is fixed by the indicated sign change, which proves equality with the fixed field.
There are also order-four subgroups: they are the kernels of the seven nonzero linear functionals on . For , define . ThenThus the seven quadratic fields have radicands . Their square classes are distinct, so all are different. Finally the trivial subgroup fixes , and all of fixes . This accounts for every subgroup and intermediate field.
The Fundamental theorem of symmetric polynomials states that every symmetric polynomial in variables over a field is a polynomial in the elementary symmetric polynomials, uniquely so. For the three roots, Vieta's formulas give , , .
The squared product of root differences is symmetric. Expansion in elementary symmetric polynomials givesOne can verify the displayed identity simply by substituting the definitions of and expanding; it is the cubic polynomial discriminant.
If the cubic is irreducible, its roots are distinct in characteristic zero, so . Its Galois group is a transitive subgroup of , hence either or . A permutation of the roots multiplies by its sign. The fixed-field assertion of the Fundamental theorem of Galois theory therefore gives exactly when all group elements are even. ThusFor example, has no rational root: neither nor is a root, and these are the only possibilities by the rational root theorem. Its discriminant is , so and its group is .
A finite solvable group is a group admitting a finite chain of normal subgroups with abelian successive quotients; equivalently its derived series eventually becomes trivial. The chainhas quotients , all abelian. Thus is solvable. Every subgroup of a solvable group is solvable, because intersecting the chain with the subgroup gives factors isomorphic to subgroups of the original abelian factors. A Galois group of a polynomial of degree at most embeds in by its action on the roots, so it is solvable even if the polynomial is reducible or has repeated roots.
For the substitution, the characteristic-zero solvability by radicals theorem says that a polynomial has solvable Galois group if and only if its splitting field is contained in a finite tower formed by adjoining successive roots of elements of the preceding field. First place all roots of in such a tower. Adjoin a primitive th root of unity and, for every nonzero , an th root . These are radical adjunctions, and all roots of are . Zero roots require no adjunction. The resulting radical tower therefore contains the splitting field of . The theorem implies
An integral basis is a -basis of the ring of integers ; it consists of algebraic integers and is also a -basis of .
The lattice has finite index . Choose a prime . The finite abelian group has an element of order , represented by . ThusIf all were divisible by , cancellation in the characteristic-zero field would put in , a contradiction. The discriminant-index formula for an integral lattice giveswhere is an integer. Hence , and the required integral element is .
The polynomial is irreducible by Eisenstein's criterion at , so . Its constant coefficient gives the field normThe defining equation givesIf and , thenhas -adic valuation . It is not an integer. The norm of an algebraic integer is an integer, so is not integral.
Suppose now that is integral. Multiply it by . All terms except are integral, since their powers of are at least . Thus this remaining term is integral, and the norm obstruction forces . Subtract the integer from . Multiply the remainder by ; the only term of exponent below is , so . Continuing in this way proves for every . ThereforeFor the same conclusion follows directly from the norm obstruction with .
Let . The power-basis discriminant isIf were a proper sublattice of , part (a) would produce a prime whose square divides and a new integral element with denominator . The only possible prime is . But is Eisenstein at , and part (b) says that every integral element of already belongs to . This is a contradiction. Hence
The Kummer-Dedekind theorem states the following. If with integral and , factor the minimal polynomial modulo as into distinct monic irreducible factors. ThenThe index restriction is essential.
For the proposed ideal relation, reflexivity uses and symmetry interchanges . If and , multiplication gives . All multipliers remain nonzero. Thus it is an equivalence relation, namely equality of ideal classes.
Put . The minimal polynomial is and the given full power basis makes every prime eligible for the theorem. Modulo its roots are ; modulo and it is irreducible; modulo its roots are . ConsequentlyThe two inert ideals have norms and ; each split factor has norm equal to its rational prime.
For , quadratic reciprocity and its supplementary laws give . Thus has two distinct roots modulo , giving distinct prime ideals withThe given principal ideal domain property makes for some integers . Taking norms, which are positive here, gives .
Let , whose minimal polynomial is . For , the cyclic group has a nontrivial cube root of unity . Then and are distinct roots of . By the Kummer-Dedekind theorem,Since the given ring of integers is a principal ideal domain, write . Its norm isMultiplication by completes the square:Thus and supply the required integers.
Put and . The polynomial reduces to modulo , so the Kummer-Dedekind theorem givesIf , its norm would imply , impossible for integers . Thus represents the nontrivial ideal class. Since the class number is , every nonprincipal integral ideal has , and . Write with ; integrality follows from . Multiplying by givesNorms give , hence . If , writing yieldscontradicting the list of squares modulo . Therefore no nonprincipal ideal has norm .
As and , quadratic reciprocity gives . Thus has two distinct roots modulo andThe norm obstruction shows that must be principal, say . Taking its norm proves
Choose a nonzero integral ideal whose class is ; one obtains such an ideal by multiplying the fractional ideal by a suitable nonzero integer. The assumed Minkowski bound for ideal classes gives withBecause and nonzero ideals of the ring of integers are invertible,It is an integral ideal in class . By multiplicativity of the ideal norm,The same argument applies if the starting is a fractional ideal, since its class is unchanged by clearing denominators.
Write . The discriminant is , and the bound of part (a) isEvery ideal class therefore has an integral representative of norm at most . The Kummer-Dedekind theorem givesModulo , is irreducible, so there is no ideal of norm . Modulo it has roots , giving , where . The ideal of has norm , and reduction in the three residue fields shows that it lies in . Equality of norms therefore givesIt follows that , because . The other prime over has the inverse class, which is the same class here.
By unique factorization of nonzero ideals, all norms at most now give only the classes : norm gives , norm gives , and norm was handled above. None of is principal, since their norms are andAlso , since equality would make principal. Thus there are exactly four classes, all of exponent two:
For degree there are either three real embeddings or one real embedding and one complex pair. The respective Minkowski bound for ideal classes areUnder the given discriminant bound they are at most and . Hence every ideal class contains an integral ideal with positive integer norm strictly below , so with norm . The only such ideal is . Therefore
Part (a), applied to any ideal class, produces an integral ideal of positive integer norm at most , so . Writing and using givesFor the last inequality, write ; the first factors are at least , and the remaining factors are at least . Since , squaring yieldsAs , the assumed upper bound forcesFor , the ceiling of the right-hand side is a valid integer . If , no number field satisfies the premise, so any positive works.
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.
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.
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 . ConsequentlyA 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 givesThe power basis has discriminantIndeed, 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 integralwith integers not all even. Here and . The integrality of forcesSince , 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 andFor the last request, let and take . It satisfies , and henceThis 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 . ThereforeIn 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 exactlyThey 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 givesSince , 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 , , factorThe 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 yieldsThus 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 dividesIt 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.
Source: Mathematics release, supplied bundle
Part B 2007 11.pdf, pages 173–176. The four-page paper is dated 8 June 2009 and is shared by Mathematics, Mathematics & Computer Science, Mathematics & Philosophy and Mathematics & Statistics Part B.Bounded exact-paper checks found no matching advertisement of worked answers. Both sections and all printed parts are answered; full statements remain in the private editable transcription.
The alternating polynomial given by the Vandermonde product is alternating: interchanging two variables changes its sign. One proof writes it as a Vandermonde determinant, up to a fixed sign, and interchanging two variables interchanges the corresponding determinant rows. Since transpositions generate ,Thus every even permutation fixes , while a transposition negates the nonzero formal polynomial, so it is not invariant under all of . This uses and characteristic different from two, as in the subsequent rational setting. For both groups are trivial and the last distinction does not arise.
The discriminant is a symmetric polynomial in the four roots, so the Fundamental theorem of symmetric polynomials expresses it polynomially in the elementary symmetric polynomial. For this depressed quartic they are , , . Scaling each root by multiplies the discriminant by , while scale by . Thus only weighted-degree-twelve monomials can appear, giving .
For , use and the monic discriminant identity . At this gives , so . For , the roots are zero together with those of . The cubic's discriminant is . The extra squared differences from zero multiply this by , giving . HenceThese computations are polynomial identities, so they extend to parameter values with repeated roots as well.
For a polynomial with distinct roots, the criterion isWrite . Part (a) gives . If every Galois permutation is even, is fixed by the entire Galois group and therefore belongs to its fixed field . Thus is a rational square. Conversely, if with , then in a field implies . Every automorphism fixes this nonzero element, so its permutation sign must be one.
The distinct-root hypothesis is necessary in the statement's intended degree- permutation action. The source says “arbitrary degree” without stating that hypothesis. If repeated roots were allowed, zero discriminant would carry no sign information: has discriminant zero, while its nontrivial automorphism swaps and fixes the two rational-root positions, an odd permutation. The criterion above applies to the squarefree polynomial, or to the squarefree part with its degree and root action adjusted accordingly.
Articles were limited to the first 100 out of 173 total.
Articles by others on the same topic
There are currently no matching articles.