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.
Set . The polynomial becomes , and translating all roots leaves their pairwise differences unchanged. Part (b) givesIt is nonzero and lies strictly between and . An integer which is a rational square is an integer square, so this is not a rational square. The roots are distinct because the discriminant is nonzero. By (c), .
A splitting field is an extension in which the polynomial factors into linear factors and which is generated over the base field by its roots. Prove existence together with the factorial divisibility by strong induction on , with degrees zero and one immediate for a nonzero polynomial.
If is reducible, write with , . By induction first split in with degree dividing , then split over with degree dividing . The resulting field is generated over by all roots of , hence is a splitting field. Its degree divides , which divides because the binomial coefficient is an integer.
If is irreducible, adjoin a root , obtaining degree . Over this field divide out and split the degree- quotient by induction. That splitting field together with the base already contains every root and has degree over dividing . ThusThe reducible/irreducible distinction proves divisibility, not just an upper bound on the degree, and works without assuming separability.
In the distinct-root convention, a polynomial is separable if it has no repeated roots in its splitting field, equivalently . A common factorwise convention instead requires each distinct irreducible factor to have no repeated roots; repeated occurrences of an already separable factor do not affect the splitting field. Under either separability convention, the splitting field is a finite normal separable extension andFor failure in the inseparable case, take and . It is irreducible, for example by Eisenstein at the prime in . Its splitting field is of degree , but the polynomial has just one distinct root. Every -automorphism fixes that root, so the Galois group is trivial rather than having order .
Factor . Its splitting field is . The first quadratic field is real, so it cannot contain the nonreal . Thus adjoining the second square root doubles the degree again. Independent sign changes of the two square roots give all four automorphisms, so
Eisenstein's criterion at two makes irreducible: all nonleading coefficients are divisible by two and the constant is not divisible by four. Its Galois group is therefore transitive on five roots, and its order is divisible by five, so Cauchy's theorem for finite groups supplies a five-cycle.
The derivative is , with real critical points , . The values are and . The derivative is positive outside these two points and negative between them, so there are exactly three real roots and one nonreal conjugate pair. Complex conjugation therefore acts as a single transposition.
A five-cycle together with any transposition generates : conjugating that transposition by powers of the cycle gives edges joining labels with a fixed nonzero difference modulo five. These edges form a connected graph, and transpositions on a connected graph generate the symmetric group. HenceThe equality of degree and group order uses separability in characteristic zero.
The nonzero cubes modulo thirteen are , which excludes three. Thus this cubic has no root in its base field and is irreducible. For a root , the extension has degree three. The base field already contains the primitive cube root of unity , since and . Hence the other two roots are and , already in this extension, making it the full splitting field.
A finite group is solvable if its derived series, defined by and , reaches the identity after finitely many steps. Equivalently it has a subnormal series with abelian factor groups. The factors need not all have prime order for this definition.
Let . This is an abelian subgroup, and conjugation preserves its nonidentity cycle type, so it is normal in and hence in . The serieshas factors , , and , all abelian. Thus .
The rotations form a cyclic subgroup of index two, so it is normal. The quotient has order two and is cyclic. Hence has abelian factors, proving . Its commutator subgroup is contained in the abelian rotation subgroup, so its second derived subgroup is already trivial.
Let and let be a primitive th root of unity. The roots are , so . Eisenstein gives , while the prime cyclotomic extension has degree . Both degrees divide , and they are coprime. Conversely adjoining to the cyclotomic field has degree at most . These two bounds giveRestriction to gives a normal subgroup of order , hence cyclic, with quotient . Restriction is onto because embeddings of the intermediate field extend in the finite Galois splitting field. Thus has abelian factors, proving . For the cyclotomic field is just , and the same argument gives degree two and a cyclic group.
First prove the finite-module criterion for integrality in a slightly stronger form, for any nonzero finitely generated -submodule stable under multiplication by . Choose generators and write with integer coefficients. Multiply the vector equation by its adjugate matrix. This gives for every generator. Some generator is nonzero and is a field, so . The polynomial is monic with integer coefficients, proving integrality of . This implication needs no prior closure theorem for .
Conversely, if satisfies a monic polynomial of degree , then is generated by and is stable under . Every also maps into itself because it is an integer polynomial in ; the finite-module criterion for integrality just proved makes every such integral. Thus this really lies in , proving the stated equivalence without circularity.
For two integral elements , the module spanned by for , contains one, is finitely generated, and is stable under both elements by their monic equations. It is therefore stable under and . The finite-module criterion for integrality proves that both are integral. Negatives follow by replacing a multiplication matrix by its negative, and are integral. Hence .
The integral basis of the cubic field of discriminant minus 140 can be obtained as follows. For the specified field, Eisenstein at two makes irreducible, and is integral because the polynomial is monic. The discriminant of a monic cubic is , soHere is the printed notation for the signed discriminant, namely the square of a Vandermonde product of the conjugates; that product need not be real.
Suppose is integral with the prescribed binary coefficients. The root traces give , , . Thus must be an integer, forcing . If , nonzeroness of the coefficient triple forces , giving . If , multiply by and use :Closure of the ring then again gives .
But , so the field norm of is . The field norm of an algebraic integer is an integer, proving . Dividing the defining cubic by gives . Thus cannot be integral either.
Finally the discriminant-index formula for an integral lattice says . The square of the integer index divides , so its only possibilities are one and four, giving index one or two. If the index were two, a nonzero coset would supply an integral element after reducing coefficients modulo two, with a nonzero binary triple. The preceding argument would force the impossible integrality of . Hence
ideals are coprime when , equivalently for some , . Always . If , then , giving in the coprime case. For nonzero integral ideals, the Chinese remainder theorem gives , and taking finite cardinalities yields .
For a nonzero prime ideal, the chain of finite-index inclusions givesby the given hypothesis. Distinct nonzero prime ideals are maximal and coprime, as are their positive powers. Unique factorization of ideals in a number field therefore gives . Exponents add under ideal multiplication, proving multiplicativity for arbitrary nonzero integral ideals. This is the standard domain of the finite ideal norm used here.
For the Dedekind factorization theorem, choose an integral primitive element of with monic minimal polynomial of an algebraic element , and assume the rational prime does not divide the index . Factorover , with distinct monic irreducible factors. For integer polynomial lifts , the distinct prime ideals above are , andThus the residue degree is , the ramification index is , and . The index restriction is essential to this direct factorization formula.
For , the ring of integers is , so the index is one and the theorem applies to every prime. Modulo two, , giving one prime ideal of ideal norm two. For an odd rational prime, a prime ideal has ideal norm if the polynomial splits, and ideal norm if it is irreducible. In the former case the supplied condition forces or ; in the latter case every odd square is one modulo eight. ConsequentlyThe odd part of any ideal norm is thus one or three modulo eight, because . Multiplication by a power of two leaves possible residues for exponent zero, for exponent one, for exponent two, and for exponent at least three. Hence for every nonzero integral ideal.
For nonzero ideals, unique factorization of ideals in a number field converts to . Coprimality says at most one of the first two exponents is positive, so each is divisible by three. Dividing its exponents by three constructs ideals whose cubes are . If a zero ideal is allowed, coprimality forces the other ideal to be the whole ring and the conclusion is immediate with the zero ideal as its own cube.
To compute the Ideal class group of Q of square root minus thirty, put . The ring of integers is , with discriminant . The given Minkowski bound for ideal classes is . Hence the ideal class group is generated by prime ideals with ideal norm below seven. The rational primes two, three and five all ramify, giving unique prime ideals , , with and ideal norm . There is no additional prime ideal of ideal norm four because two ramifies with residue degree one; six is not a prime power. Thus these three classes generate and each has order at most two.
As , unique factorization of ideals in a number field gives , so their three classes multiply to one. None is principal: a generator of one would be an integral element of field norm equal to two, three or five, and none of those field norm equations has integer solutions. The three nontrivial classes are therefore distinct, with the third the product of the first two. Hence
To rule out integer solutions, suppose . Necessarily . If a prime divided , then reduction modulo would force . Because thirty is squarefree, the valuation of at that prime would be exactly one, while that of is a positive multiple of three, a contradiction. Thus .
If a prime ideal divided both and , it would divide their difference and their product . Its underlying rational prime would divide , hence divide thirty, and would also divide . This contradicts the gcd just proved, so the two ideals are coprime. Their product is , so the first part gives for an ideal .
In a ideal class group of exponent two, forces . Thus with . Equality of principal ideals gives for a unit . The only units are , since forces , ; both signs are cubes and can be absorbed into the generator. Comparing the coefficient of after cubing now giveswhich is impossible modulo three. Therefore
Articles by others on the same topic
There are currently no matching articles.