Sums and integration against counting measure: Part IV

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 is a little more advanced, in as much as it assumes some knowledge of nets rather than just sequences.

In this post we will look at the three big convergence theorems for Lebesgue integration, concerning sequences of functions, and see how these go wrong if you use nets instead. Then we will see that they go right again (for nets) if we work with the special case of counting measure.

Let's jump straight in with an example of a 'bad' net of functions when working with Lebesgue measure λ on [0,1]. Our directed set will be the set F of all finite subsets of [0,1], partially ordered by inclusion. Our net of functions gE(EF) will just be the characteristic functions of these sets, so gE=χE(EF). It is easy to see that this is a monotone increasing net of non-negative measurable functions which converges pointwise on [0,1] to the constant function g1. This measurable function g also 'dominates' all of the functions gE in the sense of the Dominated Convergence Theorem. However we have

[0,1]gEdλ=0(EF), while

[0,1]gdλ=0.

So the integrals fail to converge to the integral of the limit (showing that the Monotone Convergence Theorem and Dominated Convergence Theorem both fail in this setting). Of course g is also the lim inf of this net of functions, and so Fatou's Lemma also fails here.

What seems to be less well known is that the results work again if you work with counting measure. 

Let X be a set. Let's work with the whole power set of X (so that all functions are measurable), and take our measure μ to be counting measure on X. Let's jump straight to Fatou's Lemma for nets, because everything follows once you have Fatou.

We will need to work with lim inf and lim sup of nets of extended real numbers here, so let's recall how that works.

We denote by ¯R the extended real line [,].

Let (yα)αA be a net in ¯R, where A is a directed set. For each αA, set 

sα=inf{yβ:βA,βα}¯R.

As α increases, these sets decrease (not necessarily strictly) and so the sα are nondecreasing as α increases. We then define

lim infαyα=supαAsα¯R.

Similarly we define Sα=sup{yβ:βA,βα}¯R and

lim supαyα=infαASα¯R.

All of the usual relationships between lim inf, lim sup and lim apply for nets in ¯R. In particular, with the above notation, we also have

lim infαyα=limαsα and

lim supαyα=limαSα.

Next suppose that (yα)αA and (zα)αA (with A as above) are both nets in [0,]. Then you can easily check that

lim supα(yα+zα)lim supαyα+lim supαzα, and (more importantly for us)

lim infα(yα+zα)lim infαyα+lim infαzα.

Now let  (fα)αA be a net of functions from X to ¯R. Then we define the functions lim infαfα and lim supαfα from X to ¯R pointwise as usual, giving us the functions xlim infαfα(x) and xlim supαfα(x) respectively.

Recall that we are working with counting measure μ on X. We wish to establish the following version of Fatou's Lemma. 

Fatou's Lemma for nets when working with counting measure

Let  (fα)αA be a net of functions from X to [0,]. Then

Xlim infαfαdμlim infαXfαdμ.

Note that, in terms of sums over sets (as discussed in earlier posts), (1) just says that

xXlim infαfα(x)lim infαxXfα(x).

Moreover, in the case where the set X is finite we can prove (2) (and hence (1)) by a simple induction using (). Indeed, when X has just one point (or no points) the result is trivial, and when X has two points, (2) is essentially a restatement of (). I'll leave the rest of the induction as an exercise (but can provide details on request).

So, let's prove (1) for a general set X, which may be uncountably infinite. Set L=lim infαXfαdμ (the right hand side of (1)), and set f=lim infαfα. Then we can rewrite our target (1) as 

XfdμL.

By our comments on finite sets above, we note that for every finite set KX, we have

Kfdμlim infαKfαdμ, and of course

lim infαKfαdμlim infαXfαdμ=L.

So, for every finite subset K of X, we have

KfdμL.

Taking sup over all finite sets KX gives us (1),

XfdμL, as required.

The last part is justified using a claim (unproved) from Part I of this series of posts, where we noted (in terms of sums) that

xXf(x)=sup{xEf(x):E is a finite subset of X}.

Once we have Fatou's Lemma in this setting, it is easy to deduce the Montone Convergence Theorem (and the slightly more general Convergence from Below Theorem if you want it), and the Dominated Convergence Theorem (this can be deduced from Fatou in the usual way).

I'll probably write some more posts where I give some of the missing details.




Comments

Popular posts from this blog

A rule of thumb for when to use the Ratio Test

The Extreme Value Theorem: a bootstrap approach

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