0
$\begingroup$

Possible Duplicate:
Is the set of polynomial with coefficients on $\mathbb{Q}$ enumerable?

The set of integer coefficient polynomials are countable, when the cardinality of each set of length n polynomial is intepreted as $\mathbb{Z}^n$ for some finite n, then union of countable sets is countable.

What about this method, what is wrong with this ?

Suppose $P(x)=a_{0} + a_1{x} + a_2 x^2+..........$ is an infinite length polynomial, for each coefficient $a_i$ we have $\mathbb{Z}$ possible choices, so for $\mathbb{Z}$ terms we may choose $|\mathbb{Z}|^\mathbb{Z}$ possible polynomials and since $|\mathbb{Z}|^\mathbb{Z} > 2^\mathbb{Z}$ the set of integer coefficient polynomials is uncountable.

  • 3
    There is a lovely bijection between $\mathbb{N}$ and $\mathbb{N}[X]$, namely, $\sum a_n x^n \rightarrow \prod p_n^{a_n}$ where $p_n$ is the nth prime. Of course, it is trivial to extend to $\mathbb{Z}$. As it was pointed out, polynomials are finite.2012-09-14
  • 0
    An integral polynomial gives a function from $\mathbb{Z} \rightarrow \mathbb{Z}$. A power series doesn't. A polynomial is a finitely generated algebra over the co-efficient ring a power series is not.2012-09-14
  • 0
    @s.b. Being pedantic, but "a polynomial" is not "a finitely generated algebra." The "set of polynomials" is "a finitely generated algebra."2012-09-14
  • 0
    This is not an *exact* duplicate per se, but I think it is close enough.2012-09-15
  • 0
    @AsafKaragila I would consider this an abstract duplicate since $|\mathbb{Z}|=|\mathbb{Q}|$ (but I can't vote...)2012-09-15
  • 0
    @Thomas Andrews, Yes I meant the polynomial algebra not a single polynomial per se.2012-09-15

1 Answers 1