Sums and integration against counting measure: Part IIIb

For other posts in this series, see
https://explaining-maths.blogspot.com/search?q=Sums+and+integration+against+counting+measure

In case the MathJax mathematics below does not display properly in your browser, I have made a PDF of the main article available via my WordPress blog

This post follows on from Part IIIa, where we introduced the notation and explained the setting we are working in. In particular, we are working with sets N={1,2,3,}, N0=N{0}={0,1,2,}, X=N0×N0, and with an array of non-negative extended real numbers am,n(m,nN0). Our aim is to prove that 

m=0n=0am,n=n=0m=0am,n=k=0kj=0aj,kj.

We take ν to be counting measure on X=N0×N0, and define F:X[0,] by F(m,n)=am,n(m,nN0).

We plan to prove that all of the sums in (1) are equal to  XFdν (the integral of F over X with respect to counting measure).

Let mN0, and set Bm={m}×N0. Then Bm is a countable disjoint union of a sequence of single-point sets
Bm=n=0{(m,n)}. So

BmFdν=n=0F(m,n)=n=0am,n.

But X is the countable disjoint union of the sequence of sets Bm, and so

XFdν=m=0BmFdν=m=0n=0am,n.

Similarly, setting An=N0×{n}(nN0), we obtain

AnFdν=m=0F(m,n)=m=0am,n, and
XFdν=n=0AnFdν=n=0m=0am,n.

Finally, for each kN0, we set Ck={(j,kj):j=0,1,,k}={(m,n)N0×N0:m+n=k}. Then X is again the disjoint union of the Ck, and

XFdν=k=0CkFdν=k=0kj=0aj,kj, as required.

This finishes the proof that all three of the sums in (1) are equal to XFdν, and so they are also equal to each other!

The first equality in (1) can also be proved (in two different ways) by looking at the integral of a sum of non-negative functions over N0 with respect to counting measure μ on N0. We have sequences of functions (fm)m=0 and (gn)n=0 from N0[0,] defined by

fm(n)=gn(m)=F(m,n)=am,n(m,nN0).

For each mN0, we have

N0fmdμ=n=0fm(n)=n=0am,n.

Set f=m=0fm, so that, for each nN0, we have

f(n)=m=0am,n.

Then N0fdμ=n=0f(n)=n=0m=0am,n.

But standard theory tells us that the integral of a sum of non-negative (measurable) functions is the sum of the integrals. So

N0fdμ=m=0N0fmdμ=m=0n=0am,n.

The first equality in (1) now follows. We can also prove it (essentially the same way) by looking at the integral of the function g=n=0gn.

At this point you may well wonder: are these genuine proofs, or are they circular? Do we already need facts about rearranging series in order to prove the theorems of Measure and Integration implicitly used above? Well, don't take my word for it, but I claim that the answer is no, these proofs are not circular. You do need to assume that you can rearrange the order in unions of indexed collections of sets without changing the union, but that is much more elementary. Once you have that, then countable additivity of measures automatically allows you to rearrange any sums of series coming from the measure of a disjoint union of a sequence of sets. (That gives yet another approach to all of these equalities!) However, if you haven't already done it, you should prove for yourself that counting measure really is a measure. Perhaps I'll give a short proof of that in another post.

I am not suggesting that this is a good way to teach first or second-year undergraduate students results about series of non-negative real numbers! But students of Measure and Integration may find it worth looking back at the elementary proofs they saw earlier in their studies, and comparing those proofs with the proofs above (along with the proofs of the results about integrals implicitly used above). 

In Part IV we will look at the three big convergence theorems for Lebesgue integration relating to sequences of functions. We'll see that they all fail, in general, if you work with nets of functions instead, but that they remain true for nets if you work with counting measure.

Comments

Popular posts from this blog

An introduction to the Hahn-Banach extension theorem: Part VI

A rule of thumb for when to use the Ratio Test

Discussion of the proof that the uniform norm really is a norm