Is There an Isomorphism Between ℤ and ℤ[x]?

  • Thread starter Thread starter Bachelier
  • Start date Start date
  • Tags Tags
    Isomorphism
Bachelier
Messages
375
Reaction score
0
There exists none. What's the easiest way to prove this?
Can we state that all elements of ℤ are in ℤ[x] but not the other way around?
 
Physics news on Phys.org
Just because you came up with a bad attempt at an isomorphism (the obvious inclusion of the integers) doesn't mean a better one doesn't exist.
 
Bachelier said:
There exists none. What's the easiest way to prove this?
Can we state that all elements of ℤ are in ℤ[x] but not the other way around?

I think a ring isomorphism must map 1 to 1 in Z[x] so Z must be mapped to Z in Z[x].

h(m) = h(1.m) = h(1)h(m). So h(1) = 1. I think this is right.
 
if there WAS such an isomorphism, we would also have one from Z[x] to Z, say φ.

now 1 ( = 1 + 0x + 0x^2 +...) in Z[x] is a multiplicative identity,

so say φ(f(x)) = k.

so k = φ(f(x)) = φ(1f(x)) = φ(1)φ(f(x)) = φ(1)k.

so φ(1) = 1.

by induction, for n ≥ 1, φ(n) = φ(1+1+...+1) (n times)

= φ(1) + φ(1) + ...+ φ(1) (n times)

= 1 + 1 +...+ 1 (n times)

= n.

similarly, φ(-n) = -φ(n) = -n.

given this, and the fact that we must assign an integer value to φ(x),

how can φ be injective?
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top