The elements of the field Q[x]/⟨x−5⟩ have the form [f(x)]=f(x)+(x−5)Q[x]. According to the Polynomial Euclidean Algorithm for any polynomial f(x)∈Q[x] there is a unique polinomial r(x)∈Q[x] such that f(x)=(x−5)q(x)+r(x), deg(r(x))<deg(x−5)=1, for some unidue polinomial q(x)∈Q[x]. It follows from deg(r(x))<1 that r(x)=r∈Q, and thus [f(x)]=[r]. Therefore, Q[x]/⟨x−5⟩={[r] : r∈Q}.
Let us define a map f:Q→Q[x]/⟨x−5⟩, f(r)=[r]. Taking into account that f(a+b)=[a+b]=[a]+[b]=f(a)+f(b) and f(a⋅b)=[a⋅b]=[a]⋅[b]=f(a)⋅f(b), we conclude that f is a field homomorphism. Since the reminder is a unique, a=b implies [a]=[b], and therefore, f is injective. For each [r]∈Q[x]/⟨x−5⟩ we have that f(r)=[r], and f is surjective. Consequently, f is a field isomorphism, and Q[x]/⟨x−5⟩ isomorphic to Q as field.
Comments
Leave a comment