The polynomial is irreducible over by Eisenstein's criterion with prime two: all coefficients except the leading one are divisible by two, while the constant coefficient is not divisible by four. Together with Gauss's lemma, this establishes irreducibility in . Part (b) shows that its principal ideal is a maximal ideal, so
Let denote the residue class of . The polynomial division algorithm gives every residue class a representative of degree less than , so span over . If a linear combination of them vanished, its degree-less-than- representative would be a multiple of the degree- polynomial , and hence would be zero. They are therefore a basis, giving
The quadratic polynomial has no rational root, so it is irreducible over . The same maximal-ideal argument proves is a field.
These two quadratic fields are not isomorphic. In , the class of squares to . But embeds in by sending its class of to : evaluation at has kernel , by irreducibility and polynomial division. No real number squares to , so no element of does. A field isomorphism preserves one, minus one and squaring, so it cannot carry to .

Articles by others on the same topic (0)

There are currently no matching articles.