The last two weeks my first year mathematicians and I have covered Taylor series.This means that several times I’ve had the conversation that goes “What’s
One of my students, Callum Mulligan, tweeted this question.
Why does 0! = 1 better yet, why does a^0 = 1 I must see a proof! #Mission #Unanswered #MathRage
— Callum Mulligan (@Calified) February 1, 2014
Saying “by definition” or “because it makes a bunch of stuff work” won’t cut it. So how to answer this question? To give a somewhat intuitive understanding of why this should be the case to a first year undergraduate. It may be obvious, but it wasn’t immediately obvious to me how to explain this, so I share some thoughts here.
Basically, I think it comes down to
Think about adding zero. If I take
For
I also came across some interesting ways to try to get a feeling for what is going on.
For
Alternatively, since
it follows that
For
Rearranging this, we get
So
Also, if you like
I found this useful on ‘Why is x^0 = 1?‘ and this on 0!=1. I’d be interested to hear what you think in the comments. How do you convince someone that
For , you could extend it to real-valued , because why not look at what it does when it gets close to ? The following definition-shuffling may or may not feel right:
There’s the identity , where is a function defined on all real numbers. I don’t know if you need to agree that already to agree with this identity, but there it is.
You can do that integral by hand:
And I got to use again. Groovy.
But actually, “because it makes a bunch of stuff work” is the best answer, in my opinion. You define your operation on the domain that you have an intuition for ( , , , …) and then work out what it has to do everywhere else in order to be consistent. Maybe you need to be a Platonist to find that unsatisfying.
As a combinatorist, I tend to consider the number of permutations of objects to be the definition of . If we consider permutations of as functions , then it’s completely reasonable to say that there is one permutation of .
For , I tend to side with approach. I’d shy away from , since it could suggest to some that . The use of avoids that since does not have a multiplicative inverse.
You can give a combinatorial interpretation too: it’s the number of functions from things to things. There is only one function from things to things (namely, the empty function), so . Admittedly, students without an intuition for are unlikely to have any better intuition for strange things like “empty functions”…
I don’t have a problem with , at least as a 1-side limit. A plot of will satisfy most students but you can prove using L’Hopital’s Rule
An intuitive way to explain the would be to use orders of magnitude:
This is by no means a definitive proof or anywhere near, but should make the fact easier to swallow.
(Sorry that I have no LaTeX skills) [Ed: sorted!]
There are interesting suggestions in all the previous comments, but surely we are answering a non-existent question? There cannot be a proof that since it is a definition. is, after all just a shorthand way of writing where a occurs b times which, incidentally, also shows why we need it. All one can do is to show that the definition of the conundrums thrown up by this shorthand, such as , are consistent. This is admirably shown by:
.
Tried to be clever, tried to use markup, got it wrong, can’t edit it, far too much in bold.