User:IssaRice/Taking inf and sup separately: Difference between revisions

From Machinelearning
Line 32: Line 32:


<math>\underline{\int}_I f := \sup\left\{p.c.\int_I g : g\text{ is a p.c. function on }I\text{ that minorizes }f\right\}</math>
<math>\underline{\int}_I f := \sup\left\{p.c.\int_I g : g\text{ is a p.c. function on }I\text{ that minorizes }f\right\}</math>
We want to show <math>\underline{\int}_I f \leq \overline{\int}_I f</math>.
Define
<math>A := \left\{p.c.\int_I g : g\text{ is a p.c. function on }I\text{ that majorizes }f\right\}</math>
<math>B := \left\{p.c.\int_I g : g\text{ is a p.c. function on }I\text{ that minorizes }f\right\}</math>
Then we have <math>\overline{\int}_I f = \inf(A)</math> and <math>\underline{\int}_I f = \sup(B)</math>. To apply the trick all we need to do is to let <math>g</math> be a p.c. function on <math>I</math> that majorizes <math>f</math>, and let <math>h</math> be a p.c. function on <math>I</math> that minorizes <math>f</math>, and show that <math>p.c.\int_I g\geq p.c.\int_I h</math>.

Revision as of 23:02, 17 December 2018

This page describes a trick that is sometimes helpful in analysis.

Satement

Let A and B be bounded subsets of the real line. Suppose that for every aA and bB we have ab. Then inf(A)sup(B).

Actually, do A and B have to be bounded? I think they can even be empty!

Proof

Let aA and bB be arbitrary. We have by hypothesis ab. Since b is arbitrary, we have that a is an upper bound of the set B, so taking the superemum over b we have asup(B) (remember, sup(B) is the least upper bound, whereas a is just another upper bound). Since a was arbitrary, we see that sup(B) is a lower bound of the set A. Taking the infimum over a, we have inf(A)sup(B), as required.

Applications

liminf vs limsup

(Notation from Tao's Analysis I.)

Let (an)n=m be a sequence of real numbers. Let L:=lim infnan and let L+:=lim supnan. Then we have LL+.

Consider the sequences (aN)N=m and (aN+)N=m defined by aN:=inf(an)n=N and aN+:=sup(an)n=N.

Now consider the sets A:={aN+:Nm} and B:={aN:Nm}. If we can show that aj+ak for arbitrary j,km, then we can apply the trick to these sets to conclude that L+=inf(aN+)N=m=inf(A)sup(B)=sup(aN)N=m=L.

Lower and upper Riemann integral

(Notation from Tao's Analysis I.)

We have

¯If:=inf{p.c.Ig:g is a p.c. function on I that majorizes f}

_If:=sup{p.c.Ig:g is a p.c. function on I that minorizes f}

We want to show _If¯If.

Define

A:={p.c.Ig:g is a p.c. function on I that majorizes f}

B:={p.c.Ig:g is a p.c. function on I that minorizes f}

Then we have ¯If=inf(A) and _If=sup(B). To apply the trick all we need to do is to let g be a p.c. function on I that majorizes f, and let h be a p.c. function on I that minorizes f, and show that p.c.Igp.c.Ih.