Work in , since . First must be odd: if it were even, coprimality would make odd, so , which cannot be an odd power for . Thus is odd too. Also no odd prime can divide both and . Such a prime does not divide , and square-freeness of gives , whereas is divisible by . Hence .
Put . Suppose a prime ideal divides both and , and let be the rational prime below it. It then contains and . The case is impossible because is odd. If is odd, the first inclusion gives , and makes nonzero in the residue field. The second inclusion therefore gives , so , contradicting the previous paragraph. Thus and are coprime ideals. In particular they generate the unit ideal, the precise meaning of coprimality here; no unique factorization of elements is assumed.
Their product is . Unique prime ideal factorization and disjoint prime support imply for an integral ideal . In the ideal class group, . Since does not divide the class number, Lagrange's theorem forces . Write . Equality of the principal ideals gives . The only units are , since a unit satisfies and . Both signs are th powers for odd , so they can be absorbed into the generator:
Apply the class-number obstruction from a ramified odd exponent. For the equation with and , compare the coefficients of in this identity. The coefficient on the right is
Its term is divisible by , and every term contains a factor , so the whole coefficient is divisible by . The coefficient on the left is one, a contradiction. Thus there are no positive integer solutions under the stated class-number and divisibility assumptions.
Finally,
The integer is square-free, is two modulo four, and is divisible by three. If its imaginary quadratic class number were not divisible by three, the preceding result with would prohibit this solution. Consequently
For the basis , its discriminant is
Equivalently it is the square of the determinant of the matrix of the embeddings applied to the basis vectors. It is nonzero because number fields are separable. An integral basis is a basis of the ring of integers as a free abelian group; in particular it is a rational basis of the field and expresses every algebraic integer uniquely with integer coefficients.
To prove existence, start with any rational basis and multiply each vector by a suitable nonzero integer to make it integral. This is possible by clearing coefficients in its monic rational minimal polynomial of an algebraic element and rescaling the variable. Let be the lattice spanned over by these integral vectors, and let be its discriminant. For any algebraic integer , each trace is an integer. The resulting linear system has integral coefficient matrix with determinant . Its adjugate matrix shows . Thus
A subgroup of a finitely generated free abelian group is free and finitely generated. Here its rank is , since it contains and is contained in a rank- lattice. Its free generators are the required integral basis.
For squarefree , the quadratic integral basis is
The source allows squarefree nonzero integers, so the degenerate value gives and basis instead of a two-element basis.
In the biquadratic field define the three automorphisms by changing respectively the sign of , the sign of , and both signs. Their actions are
Hence the three sums are , and . If is integral, each sum is integral and lies in its displayed quadratic subfield. Their radicands are squarefree and respectively congruent to two, three and two modulo four. The quadratic basis formula therefore forces all their two coefficients to be integers, proving
The Dedekind factorization theorem says: if with integral, minimal polynomial of an algebraic element , and the rational prime does not divide , factor into distinct monic irreducibles over . Then the distinct prime ideals above are , with integer lifts , and
The index condition is part of the theorem and must be checked before applying it at a ramified prime.
For this cubic, is Eisenstein and has discriminant . We first verify . The square of the index divides 972, so only two and three can divide the index. If either prime divided it, the finite quotient group would contain an element of order , giving an integral element with digits , not all zero. Its field norm is
For , the numerator has valuation zero if , valuation one if , and valuation two if . For the same three cases, according to the first nonzero digit, give valuations zero, one and two. None gives an integer field norm after dividing by , contradicting integrality. Thus the index is one.
Multiplication by in the power basis, or the product over the three conjugates, gives . Define
Reduction of the cubic gives at two and three, at five, and at seven. The quadratic factor at five is irreducible since its discriminant is two, a nonsquare modulo five. Hence
The norms are respectively . Norms and reduction of the elements at those primes give
For example their absolute element field norms are ; each indicated prime divides the element by substitution in its residue field, and the product of the indicated ideal norms already equals that absolute field norm. Thus no additional factor or exponent is possible.
In the ideal of the specified quotient every prime exponent cancels:
Equality with the unit ideal implies that both and its inverse are integral, so . For the real root, . The numerator is negative and has absolute value less than two, while the denominator is greater than five. Thus , proving . Its field norm is , consistent with the ideal calculation.
Choose a nonzero integral ideal whose class is ; one can multiply the fractional inverse by a suitable nonzero integer to obtain such a . By the given bound choose with . Put . Since , multiplication by makes an integral ideal. Its class is , and multiplicativity of ideal norms gives
This proves the class representative bound without accidentally constructing a representative of the inverse class instead.
To determine the Ideal class group of Q of square root minus thirty-four, write . The given integral basis has discriminant , so the imaginary-quadratic bound is . Every class therefore has a representative of ideal norm at most seven, and factoring such representatives shows that the ideal class group is generated by prime ideals of ideal norm at most seven.
Two ramifies: let , with . Three is inert because is irreducible modulo three, so its prime ideal ideal norm is nine and supplies no small generator. At five and seven the roots are , so the primes of ideal norm five and seven are conjugate pairs. Set and . Their conjugates have inverse ideal classes. No new prime ideal has ideal norm four, since the only prime above two has residue degree one; six is not a prime power. Thus generate the ideal class group.
The element field norms and , together with reduction at the split primes, give
The ideal norm products verify both exponents. Consequently and , so the whole group is generated by and its order divides four. The class is not trivial: a generator would be an element of the ring of integers of field norm two, but has no integer solution. Since , its order is exactly two. Hence has order four and
For integral solutions of x squared minus two equals y cubed, the equation implies , so . If were even, then would be even and would be two or six modulo eight, whereas would be zero modulo eight. Thus and are odd. Also : otherwise , which is not a cubic residue modulo nine. Reducing modulo three then gives . Consequently
Put and . Its field norm is . The principal ideals and are coprime. Indeed a common prime ideal has underlying rational prime dividing . The displayed gcd excludes two and three, so both two and are invertible modulo that prime ideal. The difference therefore implies , contradicting .
Their product is , so unique factorization of ideals in a number field and coprimality imply for an integral ideal . In the given ideal class group of order two, implies . Hence with integers . Equality of principal ideals gives . The only units are , and both are cubes, so the sign can be absorbed into . Taking norms, and using , gives
The coefficient of gives . Eliminating with the field norm identity yields
The denominator is nonzero for integral . Polynomial division makes the integrality obstruction especially clear:
If is integral, the reciprocal must be an integer, forcing . The only integral possibility is . Then , the field norm gives , and the real coefficient in the cube gives . Both pairs directly satisfy the original equation. Therefore all integral solutions are
Set . The polynomial becomes , and translating all roots leaves their pairwise differences unchanged. Part (b) gives
It 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 . Thus
The reducible/irreducible distinction proves divisibility, not just an upper bound on the degree, and works without assuming separability.
The set consists of the elements of integral over , meaning roots of monic polynomials in .
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 , so
Here 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 gives
by 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 . Factor
over , with distinct monic irreducible factors. For integer polynomial lifts , the distinct prime ideals above are , and
Thus 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. Consequently
The 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 gives
which is impossible modulo three. Therefore
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.
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.
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 . Thus
If all were divisible by , cancellation in the characteristic-zero field would put in , a contradiction. The discriminant-index formula for an integral lattice gives
where 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 norm
The defining equation gives
If and , then
has -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 . Therefore
For the same conclusion follows directly from the norm obstruction with .
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 with
Because 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.
For degree there are either three real embeddings or one real embedding and one complex pair. The respective Minkowski bound for ideal classes are
Under 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 gives
For the last inequality, write ; the first factors are at least , and the remaining factors are at least . Since , squaring yields
As , the assumed upper bound forces
For , the ceiling of the right-hand side is a valid integer . If , no number field satisfies the premise, so any positive works.
By the fundamental theorem of arithmetic, every integer greater than one has a prime factorization, and that factorization is unique up to reordering the factors. Equivalently, it has a unique finite prime-exponent representation , with nonnegative integer exponents. The unit integer has the empty product.