Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Defined $X*Y ≡ \{ z\in\mathbb R:\text{ there exist }x\in X , y\in Y\text{ such that }z = xy \}$.

For $|X|,|Y| = \aleph_0$ I have to prove that $|X*Y|=\aleph_0$.


Thanks in advance.

share|cite|improve this question
up vote 4 down vote accepted

I assume $X,Y\subseteq\mathbb{R}$? You obviously have that $X\ast Y$ is infinite, but you also have that $X\times Y\to X\ast Y:(x,y)\mapsto xy$ is a surjection, and so $\#(X\ast Y)\leqslant \#(X\times Y)=\aleph_0$.

share|cite|improve this answer

You have an obvious surjective map $f:X\times Y\to X*Y$. Therefore $$|X*Y| \le |X|\times |Y|= \aleph_0.\aleph_0=\aleph_0.$$

On the other hand, for any $y\in Y$, $y\ne 0$ you have a bijection $X\to X*\{y\}$, $x\mapsto xy$. (You know that $Y$ contains a non-zero number, since $|Y|=\aleph_0$, hence you can choose some element $y\in Y\setminus\{0\}$.) Since $X*\{y\}\subseteq X*Y$ you get $$|X*Y| \ge |X*\{y\}| = |X| = \aleph_0.$$

For the proof of $\aleph_0.\aleph_0=\aleph_0$ see e.g. Bijecting a countably infinite set $S$ and its cartesian product $S \times S$, How does one get the formula for this bijection from $\mathbb{N}\times\mathbb{N}$ onto $\mathbb{N}$?, The cartesian product $\mathbb{N} \times \mathbb{N}$ is countable and Proving the Cantor Pairing Function Bijective

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.