MHB Proving Z[x] and Q[x] is not isomorphic

  • Thread starter Thread starter cbarker1
  • Start date Start date
cbarker1
Gold Member
MHB
Messages
345
Reaction score
23
Dear Everyone,

What is the correct mapping between the polynomial rings $\mathbb{Z}[x]$ and $\mathbb{Q}[x]$? The function $\phi$ is defined as $\phi(x^2+1)=\frac{1}{2}x$. I want to prove this problem by contradiction.

Thanks,
Cbarker1
 
Physics news on Phys.org
Hi Cbarker1,

I don't see what is the point of your function $\phi$: it is not even defined on the whole of $\mathbb{Z}$.

In reference to the title of you post, to prove that $\mathbb{Z}[x]$ and $\mathbb{Q}[x]$ are not isomorphic, you could use the fact that $\mathbb{Q}[x]$ is a Euclidean domain, and therefore a principal ideal domain.

On the other hand, $\mathbb{Z}[x]$ is not a principal ideal domain; for example, in $\mathbb{Z}[x]$, the ideal $I =\langle x,2\rangle$ is not principal.
 
I can't use the principal ideal domain. Or Euclidean domain...because I have not learn about it yet.
 
Hi again,

In fact, it is even simpler. If $\theta:\mathbb{Z}[x]\to\mathbb{Q}[x]$ is an isomorphism, then $\theta(1) = 1$, because any ring homomorphism must map $1$ to $1$.

Now, in $\mathbb{Q}[x]$, we have $1 = \dfrac12+\dfrac12$. If $f(x)=\theta^{-1}(\dfrac12)$, we must have $f(x)+f(x) = 1$ in $\mathbb{Z}[x]$, and it is obvious that no integer polynomial satisfies that relation.

We have simply elaborated on the fact that $\mathbb{Z}$ is not isomorphic to $\mathbb{Q}$.
 
The point is that because they are not isomorphic, there is no "correct mapping"! If you wanted to prove that two rings are isomorphic then you would want to find a mapping that is an isomorphism. (But there still might not be a single "correct" one.)
 
I was trying to do a contradiction proof for that problem.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
Back
Top