How can i find a bijection from N( natural numbers) to Q[X]

cghost
Messages
4
Reaction score
0
How can i find a bijection from N( natural numbers) to Q[X] ( polynomials with coefficient in rational numbers ). I can't find a solution for this. Can you please point me in the right direction ?
 
Physics news on Phys.org


This is a standard trick. The proof is as follows:

Let A_0=\mathbb{Q}. This is clearly countable.
Let A_1=\{a+bx~\vert~a,b\in \mathbb{Q}\}, this is countable since it has the same cardinality of \mathbb{Q}\times \mathbb{Q}.
Let A_2=\{a+bx+cx^2~\vert~a,b,c\in \mathbb{Q}\}, this is countable since it has the same cardinality of \mathbb{Q}\times\mathbb{Q}\times\mathbb{Q}.

Continue with this process. Finally, we have \mathbb{Q}[x]=\bigcup_{n\in \mathbb{N}}{A_n}. This is countable as countable union of countable sets.
 


micromass said:
This is a standard trick. The proof is as follows:

Let A_0=\mathbb{Q}. This is clearly countable.
Let A_1=\{a+bx~\vert~a,b\in \mathbb{Q}\}, this is countable since it has the same cardinality of \mathbb{Q}\times \mathbb{Q}.
Let A_2=\{a+bx+cx^2~\vert~a,b,c\in \mathbb{Q}\}, this is countable since it has the same cardinality of \mathbb{Q}\times\mathbb{Q}\times\mathbb{Q}.

Continue with this process. Finally, we have \mathbb{Q}[x]=\bigcup_{n\in \mathbb{N}}{A_n}. This is countable as countable union of countable sets.

You proved here that there is a bijection from N to Q[x], but how can i write that function down ?
Or you can't exactly explicit the function f : N -> Q[x] , f(x) = ... ?
If it's a bijection, every natural number should point to a single polynom, is that right?
Or Q[X] is defined as a set of equivalence classes.
 


It's very hard to explicitely say what the bijection is. Most of the time people are happy with knowing that there exists a bijection.

Of course, if you examine all the steps I made, maybe you can make the bijection step-by-step. But this will be a very ugly thing. In fact, even a bijection between \mathbb{N} and \mathbb{Q} is hard and ugly to write down...
 


Thanks for helping me
 
##\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