Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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

I am working on this problem in set theory:

Let $X$ is a countable infinite set and $Y\subsetneq X$. Moreover let $g:X\to\mathbb N$ is a one-one and onto function and $h:Y\to\mathbb N$ with $$h(y)=\{1,2,3,...,g(y)\}\cap g(Y)$$ Prove that $h$ is an one-to-one correspondence and so $Y$ is countably infinite.

Honestly, I used my imagination to see what is going on in this problem. :-) I went via elementary method. In fact, I saw the function $h$ is well-defined and indeed if $h(x)=h(y), ~~x,y\in Y$ then by assuming for example $g(x)<g(y)$ the number $h(x)=\{1,2,3,...,g(x)\}\cap g(Y)$ can be lass than the number $h(y)$ and this is a pretty contradiction. So the first round was done safely.

I really ask to have a solution for proving that $h$ is onto. If you have another approach , please let me know. Thanks.

share|cite|improve this question
$+ \;\;\ddot\smile\;\;$ – amWhy Apr 16 '13 at 16:19
up vote 1 down vote accepted

You don’t have to prove that $h$ is onto; in fact in general you can’t, because $Y$ might be a finite subset of $X$. All you can prove is that $Y$ is countable, meaning finite or countably infinite, and you’ve done that as soon as you’ve proved that $h$ is one-to-one, because then it’s a bijection between $Y$ and a subset of $\Bbb N$.

I would slightly rephrase your proof that $h$ is one-to-one, but the idea is fine. If $g(x)<g(y)$, then by definition $g(y)\in h(y)\setminus h(x)$, so $h(y)\ne h(x)$.

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.