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

The number of partial functions $A \rightarrow B$ is $(1+|B|)^{|A|}.$ Now either this is a well-known formula, or I just made a mistake in the proof I just wrote. Which is it?

share|cite|improve this question
    
Looks right to me at first glance. – Alex Becker Feb 1 '13 at 22:31
4  
The formula is fine. And if your argument is to add an extra element $*$ to $B$ so that $f(a)=*$ means that $a$ is not really in the domain of $f$, then your proof is fine, too. – Brian M. Scott Feb 1 '13 at 22:35
    
Oh, it's that easy..... :( – goblin Feb 1 '13 at 22:35
1  
Nah, it's complicated, uses the binomial theorem, non-standard notation etc. I much prefer your approach! – goblin Feb 1 '13 at 22:38
3  
For what it's worth, the symbol usually chosen (at least in computer science) for the extra element is "$\bot$". – Henning Makholm Feb 1 '13 at 22:42

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.