Skip to navigation

*2017 June 11*

Before we jump in, I would like to demonstrate a few things about the integral of the ceiling function because it will soon be of importance and it will be convenient to have already established facts and to be able to use them. Notice that any function of the form when plotted in the coordinate plane consists of a number of line segments, each one unit long. The integral of such a function can be obtained easily using geometrical analysis. If you interpret as the area between $f(\lceil x\rceil)$ and the x-axis, it is easy to observe that a number of rectangles can be drawn, with one corresponding to each unit line segment. However, if $n$ is not an integer, you will have $\lfloor n\rfloor$ whole rectangles and a partial rectangle with width ${n}$. Thus the area is where ${n}f(\lceil n\rceil)$ represents the area of the partial rectangle and the sum represents the sum of the areas of the other rectangles. We will be using this discovery again later.

As it is currently used, the use of sigma notation to represent summations with discrete values being summed (as opposed to integrals, which sum an infinite number of infinitely small values) in the form is defined only for $b \ge a$ with $a,b \in \mathbb N$. But what if we wanted to find an appropriate extension of this notation so as to give meaning to such a sum for all $a,b \in \mathbb R$?

This extension is not difficult to make for $a \le b$, since the sum could simply be carried out "backwards". In fact, we could even use the property of integrals to define a similar property for Riemann sums: The real trouble arises when we try to define Riemann sums with non-integer upper and lower bounds. If we had a non-integral upper bound, we certainly couldn't just calculate the sum using brute force, since the meaning attributed to sigma notation depends on a whole number of discrete values. If the upper bound is not an integer, when do we stop summing?

Before I dive in, I would like to note the property of Riemann sums
Which allows us to turn any summation with non-integer upper and lower bounds into an equivalent summation with an integer lower bound. If we let ${x}$ denote the "fractional part" function, then if we have a sum
Where both $a$ and $b$ are non-integers, because $a=\lfloor a\rfloor +{a}$, we can change this sum to
Thus changing the lower bound to an integer. We can take this even further and change the sum to
Which shows that any summation with non-integral upper *and* lower bounds can be changed into a summation with a lower bound of $1$ and a non-integral (or sometimes integral) upper bound. Thus when I establish the meaning of a Riemann sum with a lower bound of $1$ and a non-integral upper bound, I am also establishing that of all Riemann sums with any real upper and lower bounds.

Now let our sum be written We may at first be tempted to find the closed-form formula for the sum for integral $n$ and then evaluate it at non-integral values, but this is not necessarily correct, because many of the tricks that we use to evaluate such sums are dependent on a definite number of values being summed and thus an integer values of $n$, making any formula found in such a way reliable only for integral $n$. For example, suppose we wish to extend To non-integral $n$, and in order to do this, we decide to find a formula. We might use the "gaussian pairing" trick to expand the sum and then pair each term with some corresponding term, resulting in the summation formula Then we may decide to evaluate this sum at some non-integral value of $n$ to find the sum we are looking for. But this is not justified! The "gaussian pairing" trick assumes an integral number of terms, and the pairing cannot happen if we do not know exactly how many terms there are in our sum.

The method that I am proposing relies on turning the summation into an integral. Notice that if we have a Riemann sum
we can say, at least for integral $n$, that
or, in fact, that
Do you see what we can do now? No matter how high $k$ goes, the sum stays the same. Thus we can take
and the integer values remain the same. This, in turn, can be transformed into an integral:
And integrals are defined for non-integral $n$ as well as for integral $n$.
There is one possible flaw in this approch. It is not obvious that the identity
holds for all integral and non-integral $n$, but it is not *clearly essential* that $n$ be integral for us to apply this, whereas it is *clearly essential* that $n$ must be an integer for us to utilize some trick like gaussian pairing that requires correspondence between the terms of a sum. Though this solution may not be *perfect*, it is less dependent on $n$ being an integer than the alternate approach.

Now that we have obtained we can use the formula that we obtained at the beginning of this post to say that This is the definition that I wish to establish. My proposition is that the Riemann sum be defined as for non-integral $n$. We can see that the two are equal for integral $n$ very easily, and it seems that this parallel may be drawn for non-integral $n$ as well.

One last interesting thing should be noted. If one uses my proposed definition of a Riemann sum with a non-integral upper bound to plot a graph in a coordinate plane, the graph appears in a very pleasing way. This graph is the same as that of the graph obtained by plotting the points for integral $n$ only and connecting the consecutive points with line segments.

Anyways, that is how I believe these sums should be defined. It is possible, even likely, that there exists a better interpretation, but I believe that for now, this one is good enough to replace the evaluation of closed-form formulas evaluated at inappropriate values.

back to home page