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.
Articles by others on the same topic
There are currently no matching articles.