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