Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2006/ii/paper-1/20g/solution

There is an error in the printed request: the cubic is not irreducible at , and three elements cannot be a field basis in that case. The integral-basis assertion is valid under the necessary hypothesis .
Under that hypothesis, is an algebraic integer and has finite index . Change of basis in the trace pairing gives the discriminant-index identity
The field discriminant is an integer. If the left side is square-free, cannot divide it unless . Thus is an integral basis when the cubic is irreducible and its discriminant is square-free.
For any root, gives
Since , and ,
On the other hand, the product of is : the product of the roots is one, and each of the three unordered root pairs contributes a negative squared difference. Therefore, without needing irreducibility for this polynomial calculation,
The three-root product is the field norm only when the cubic is the minimal polynomial.
At , the polynomial has no rational root (the only candidates are ), so it is irreducible, and its discriminant is . Hence is an integral basis.
At ,
If , then with integral basis . If , then and is an integral basis, since this quadratic order has square-free discriminant five; also . In neither case is the three-element list a basis. Its discriminant five is instead that of the degree-three algebra ; a basis there does not repair the printed assertion about the field .

New to topics? Read the docs here!