In today’s (relatively) short post, I want to show you the formal proofs for the mean and variance of discrete uniform distributions. I already talked about this distribution in my introductory post for the series on discrete probability distributions. Well, this is a pretty simple type of distribution that doesn’t really need its own post, so I decided to make a post that specifically focuses on these proofs. More than anything, this is going to be a small exercise in algebra.

*This post is part of my series on discrete probability distributions.*

In short, you use the discrete uniform distribution when you have *n* possible outcomes that are equally likely to occur. That is, when the sample space you’re interested in consists of exactly *n* elements, each of which occupy an equal share of the whole space. Before we look at the mean and variance formulas and their proofs, let’s review (and somewhat generalize) the discrete uniform distribution’s probability mass function (PMF).

## Discrete uniform distribution and its PMF

So, for a uniform distribution with parameter *n*, we write the probability mass function as follows:

Here *x* is one of the natural numbers in the range 0 to *n – 1*, the argument you pass to the PMF. And *n* is the parameter whose value specifies the exact distribution (from the uniform distributions family) we’re dealing with. Specifically, the number of possible outcomes. You remember the semi-colon notation for separating parameters (and what parameters are), right? If not, it might be a good idea to review the intro post.

For example, when *n = 8*, we can plot the probabilities of of the numbers 0 through 7:

Notice that this distribution doesn’t simply model outcomes which happen to be equally likely. The numbers have to be consecutive! If they aren’t, it would be more appropriate to model the process with a categorical distribution.

In the intro post, I showed you the uniform distribution’s *canonical* version where the first number is always 0. But, as long as we keep the numbers consecutive, we can shift the distribution to the left or to the right. For example, here’s the same distribution shifted 4 numbers to the right:

If we’re dealing with a shifted distribution, we need to specify an additional parameter for the starting value. Today I want to use the letter *L* (for “*lower bound*“) for this parameter:

Notice that the canonical version is a special case of this more general version with *L = 0*.

Yet a third way to parameterize this distribution is by also specifying the *upper bound* parameter *U*:

Notice that specifying *L* and *U* automatically determines *n* because:

In the example above, , , and .

For another example, consider the distribution with parameters and with which you can model the probability of the pocket the ball will land in for a particular roulette spin.

### Mean and variance formulas

So, here I’m going to give you the standard formulas for the mean and variance of a uniform distribution with parameters *n* or *L* and *U*. I’m going to use (the Greek letter *mu*) for the mean and (the Greek letter *sigma* squared) for the variance.

Those are the most common notations for these two measures. In particular, is based on , which is how *standard deviation* is typically denoted. You remember the relationship between variance and standard deviation from my introductory post on measures of dispersion, right?

Anyway, here are the two formulas for the canonical version of the distribution:

The variance formula for the more general (shifted) version is the same as the one above. On the other hand, the mean formula has a small modification:

That is, we simply add the lower bound parameter

*L*to the canonical mean, again with the understanding that .

## Proofs of mean and variance formulas

Before I show you the proofs, I’m want to list a few properties and identities we’re going to need to understand them. The first two concern the mean and variance of an arbitrary shifted distribution:

What these identities say is that shifting an arbitrary random variable by adding an arbitrary constant

*c*to all of its possible values has the following effect on the mean and variance:

- The mean gets shifted by
*c* - The variance remains the same

Since I haven’t talked about these properties before, I’m going to show you their proofs in the bonus section at the end of this post. For now, just take my word for it. These two properties will allow us to easily generalize the mean and variance formulas from the canonical version of a uniform distribution to its general (arbitrarily shifted) form.

And here’s the remaining properties and identities we’re going to need.

### Auxiliary properties and identities

First, you should feel comfortable with properties of arithmetic operations. In particular the familiar commutative and associative properties of addition and multiplication, as well as the distributive property of multiplication over addition. All these properties state that, for arbitrary numbers *a*, *b*, and *c*:

Second, we’re going to rely on the following two properties of the sum operator (derived from the arithmetic properties above):

(1)

(2)

Third, we’re going to need the following closed-form formulas (which I also talked about in the sum operator post):

(3)

(4)

Finally, we’re going to need the following alternative variance formula of a random variable X:

(5)

Where is the expected value notation.

If all these properties (and notation) are new to you, I recommend you review the posts I linked to so far, where you’ll find everything explained in detail.

And with all that out of the way, let’s finally get to the proofs we’re interested in!

### The mean

To calculate the mean of a discrete uniform distribution, we just need to plug its PMF into the general expected value notation:

Then, we can take the factor outside of the sum using equation (1):

Finally, we can replace the sum with its closed-form version using equation (3):

And there you have it, we just derived the mean formula I showed you in the previous section!

Notice that we slightly modified the closed-form expression for the sum with the following substitutions:

That is because in our case the sum runs from 0 to n – 1, instead of from 0 to n (as in equation (3)).

Were you expecting a more complicated proof? Well, maybe not.

So, this is the mean formula for the canonical version whose lower bound L is 0. Using the mean of a shifted distribution identity I gave above, we can generalize the mean for any lower bound *L*:

To get more intuition about this formula, let’s add the two terms and replace

*n*with :

You’ll commonly see this version of the formula, which shows that the mean of the distribution is nothing but the arithmetic mean of the lower and upper bounds!

### The variance

Now let’s do the derivation for the variance of a discrete uniform distribution formula. We’re going to use the alternative variance formula from equation (5):

Let’s start with the second term because it’s easier. This is simply the square of the mean we just derived:

Now let’s focus on the second term by first taking the out using equation (1):

Then, we can substitute the sum with the right-hand side of equation (4) and simplify:

So, now that we have simple expressions for the two terms, we can plug them into equation (5) and do the final simplification:

And we reached the expected result!

See how easy these proofs are when we already have the proper tools at hand?

And since shifting a random variable doesn’t change its variance, this is also the formula for the general discrete uniform distribution.

You could also express the formula in terms of *L* and *U*:

Though the representation in terms of

*n*is definitely more elegant (and preferable)!

## Summary

Well, this is it for today. The discrete uniform distribution is one of the simplest distributions and so are the proofs of its mean and variance formulas.

The special and general probability mass functions of this distribution look like this:

And the mean and variance formulas whose derivation I showed you are:

The general variance formula looks exactly the same, whereas the general mean formula takes a small modification:

Anyway, if you had any issues with following the derivations, don’t hesitate to ask your questions in the comment section below!

Now, as I promised, for the curious among you I’m going to show the proofs for the mean and variance identities regarding shifted random variables.

## Bonus section

As you saw, the proofs for the mean and variance of discrete distributions are very short and easy to follow. Well, this is also because we had other (previously proved) identities at our disposal.

On the other hand, the direct proofs of the general version of the distribution are a bit hairy. For that reason, in this bonus section I want to show you the proofs of two general facts about the mean and variance of an arbitrary shifted discrete distribution. These were the facts that allowed us to immediately adapt the special case proofs to the general case (and circumvent the hairy direct proofs).

Basically, to shift a distribution simply means adding an arbitrary constant *c* to every value of the sample space. In the example in the beginning, we shifted the canonical uniform distribution (with parameter n = 8) 4 numbers to the right by adding the constant c = 4 to every value in the range 0 to 7 (and the new range became 4 to 11).

Now let’s see what happens to the mean and variance of any discrete distribution, not just the one we’re currently looking at.

### Mean of a shifted random variable

As a reminder, here’s the general formula for the expected value (mean) a random variable X with an arbitrary distribution:

Notice that I omitted the lower and upper bounds of the sum because they don’t matter for what I’m about to show you. Assume that the sum ranges over all values in the sample space.

Now let’s create a new random variable Y which is the shifted version of X by an arbitrary constant *c*:

And let’s write an expression for

*its*mean:

Now, using the commutative and distributive properties of multiplication, as well as identities (1) and (2) from above, we can rewrite the right-hand side as follows:

In the third line, we replaced with and in the fourth line we replaced with 1 because the sum of all elements in the sample space is always equal to 1. Therefore, the mean of a random variable shifted by

*c*is simply the mean of the

*unshifted*version itself shifted by

*c*:

Cool. Now let’s see how things work with the variance.

### Variance of a shifted random variable

As a reminder, here’s the canonical variance formula:

Now, let’s apply it on the shifted version of X:

In the second line I simply replaced with (which we just derived). And in the third line I simply expanded the inner parentheses. The net result is that the constant

*c*got cancelled out and we’re left with the original expression. Which means that shifting a random variable doesn’t change its variance!

And by the way, in case you’re wondering, the same identities hold true for the mean and variance of a continuous random variable. But I’ll leave those proofs for a future post (after I’ve introduced a bit of calculus).

Dariush Faghani says

Would be great to touch upon real-time/continuous calculaiton of mean and – especially – variance/std.