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

Say we have two sets $|A| = a$ and $|B| = b$, where $a \geq b$ and $a$ is infinite. How would you go about proving that the number of surjective functions from A onto B is $b^a$?

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

HINT: Partition $A$ into sets $A_0$ and $A_1$, where $|A_0|=b$ and $|A_1|=a$. Let $f:A_0\to B$ be any bijection. For each function $g:A_1\to B$, the function $f\cup g$ is a surjection from $A$ to $B$. Use this to show that there are at least $b^a$ surjections from $A$ to $B$. Showing that there are no more than $b^a$ surjections from $A$ to $B$ is straightforward.

share|cite|improve this answer
what is meant by f∪g? – aslkdnqr Oct 18 '13 at 15:51
nevermind, i understand it now. thanks! – aslkdnqr Oct 18 '13 at 15:56
@aslkdnqr: You’re welcome. Just to make sure: a function is a set of ordered pairs, so $f\cup g$ just acts like $f$ on $A_0$ and like $g$ on $A_1$. – Brian M. Scott Oct 18 '13 at 15:57

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.