• No results found

A Proof of the Squeeze Theorem for Integrals Using Cauchy Sequences

N/A
N/A
Protected

Academic year: 2021

Share "A Proof of the Squeeze Theorem for Integrals Using Cauchy Sequences"

Copied!
7
0
0

Loading.... (view fulltext now)

Full text

(1)

A Proof of the Squeeze Theorem for Integrals Using Cauchy

Sequences

Spiros Konstantogiannis [email protected]

Abstract. We use the sequential criterion for Riemann integrability to give a proof of the squeeze theorem for integrals using Cauchy sequences. As an auxiliary lemma, we prove a criterion for a sequence to be a Cauchy sequence.

Keywords: Riemann integral; sequential criterion; Cauchy sequence; squeeze theorem.

1 Introduction

Sequential criterion for Riemann integrability

A function

f

: ,

[ ]

a b

®

¡

is Riemann integrable on

[ ]

a b

,

if and only if for every sequence

( )

P

&

n

of tagged partitions of

[ ]

a b

,

which is such that

lim

n

0

n®¥

P

=

&

, the sequence

(

(

;

)

)

n

S f P

&

of

Riemann sums is a Cauchy sequence, and then

lim

(

;

)

b n n a

S f P

f

®¥

=

ò

&

. Proof

The proof is given in [1].

Auxiliary lemma 1 (a consequence of the definition of limit)

If the sequences

( )

x

n and

( )

y

n both converge and

lim

n

lim

n

n®¥

x

<

n®¥

y

+

a

, for some

a

Î

¡

, then

for every

e

>

0

there exists

N

Î

¥

such that

x

n

<

y

n

+ +

a

e

for all

n N

>

.

Proof

Since both sequences

( )

x

n and

( )

y

n converge, then, by linearity, the sequence

(

x

n

-

y

n

-

a

)

also converges and

lim

(

n n

)

lim

n

lim

n

n®¥

x

-

y

-

a

=

n®¥

x

-

n®¥

y

-

a

(1).

Further, by assumption,

lim

n

lim

n

n®¥

x

<

n®¥

y

+

a

, thus n

lim

®¥

x

n

-

lim

n®¥

y

n

- <

a

0

, and by means of (1),

(

)

lim

n n

0

n®¥

x

-

y

-

a

<

(2).

Next, setting

lim

(

n n

)

(2)

Besides, since

lim

(

n n

)

n®¥

x

-

y

-

a

=

l

, then, by definition, for every

e

>

0

there exists

N

Î

¥

such

that

x

n

-

y

n

- - <

a l

e

for all

n N

>

, from which it follows that

x

n

-

y

n

- - <

a l

e

, and then

n n

x

-

y

- < +

a l

e

(4) for all

n N

>

.

Further, adding

e

to both sides of (3) yields

l

+ <

e e

and combining with (4) then yields

n n

x

-

y

- <

a

e

, and thus

x

n

<

y

n

+ +

a

e

for all

n N

>

.

We have thus shown that for every

e

>

0

there exists

N

Î

¥

such that

x

n

<

y

n

+ +

a

e

for all

n N

>

, which is what we wanted to prove.

Auxiliary lemma 2 (a criterion for a sequence to be Cauchy)

A sequence

( )

x

n is a Cauchy sequence if and only if for every

e

>

0

there exists

N

Î

¥

and

l

e

Î

¡

(that depends on

e

), such that

x

n

- <

l

e

e

for all

n N

>

.

Proof

Note that, since

l

e depends on

e

, then

l

e is not a fixed number, and thus it cannot be derived that

l

e is the limit of

( )

x

n .

(i) Let

( )

x

n be a Cauchy sequence.

Then, by definition, for every

e

>

0

there exists

N

Î

¥

such that

x

m

-

x

n

<

e

for all

m n N

,

>

.

The number

N

generally depends on

e

.

Then, choosing

m N

=

+ >

1

N

, we have that

x

N+1

-

x

n

<

e

, and since

(

)

1 1 1

N n N n n N

x

+

-

x

= -

x

+

-

x

=

x

-

x

+ , the last inequality reads

x

n

-

x

N+1

<

e

for all

n N

>

.

Further, since

N

depends on

e

, then

N

+

1

also depends on

e

, and thus

x

N+1 depends on

e

too.

Then setting

x

N+1

º

l

e, we have that for every

e

>

0

there exists

N

Î

¥

such that

x

n

- <

l

e

e

for all

n N

>

.

(ii) We assume that for every

e

>

0

there exists

N

Î

¥

and

l

e

Î

¡

such that

x

n

- <

l

e

e

(1)

for all

n N

>

.

We will show that the sequence

( )

x

n is a Cauchy sequence.

(3)

Further, by the triangle inequality,

x

m

- + -

l

e

l

e

x

n

³

(

x

m

-

l

e

) (

+

l

e

-

x

n

)

=

x

m

-

x

n , thus

m n m n

x

-

x

£

x

- + -

l

e

l

e

x

, and combining with (4) yields

x

m

-

x

n

<

2

e

.

The last inequality holds for every

e

>

0

, thus it also holds for every

e

¢ =

2

e

>

0

, because as

e

takes any positive value,

2

e

also takes any positive value.

We have thus shown that for every

e

¢ >

0

there exists

N

Î

¥

such that

x

m

-

x

n

<

e

¢

for all

,

m n N

>

, and then, by definition,

( )

x

n is a Cauchy sequence.

Finally, combining (i) and (ii) completes the proof.

2 Squeeze theorem

A function

f

: ,

[ ]

a b

®

¡

is Riemann integrable on

[ ]

a b

,

if and only if for every

e

>

0

there exist

functions

g h

e

,

e

: ,

[ ]

a b

®

¡

such that

g x

e

( )

£

f x

( )

£

h x

e

( )

for all

x

Î

[ ]

a b

,

, and such that

,

g h

e e are both Riemann integrable on

[ ]

a b

,

and

(

)

b a

h

e

-

g

e

<

e

ò

.

Proof

(i) Let

f

be Riemann integrable on

[ ]

a b

,

.

For every

e

>

0

, we set

g

e

º

f

and

h

e

º

f

, and then we have

g x

e

( )

=

f x

( )

=

h x

e

( )

, thus

also

g x

e

( )

£

f x

( )

£

h x

e

( )

, for all

x

Î

[ ]

a b

,

, and since, by assumption,

f

is Riemann

integrable on

[ ]

a b

,

, then

g h

e

,

e are both Riemann integrable on

[ ]

a b

,

, and also

(

)

0 0

b b

a a

h

e

-

g

e

=

=

ò

ò

, because

S

( )

0;

P

&

=

0

for any tagged partition

P

&

of

[ ]

a b

,

, thus taking any

sequence

( )

P

&

n of tagged partitions of

[ ]

a b

,

which is such that

lim

n

0

n®¥

P

=

&

, we have that

( )

0;

n

0

S

P

&

=

, and then

lim

( )

0;

n

0

n®¥

S

P

=

&

, and thus, by the sequential criterion for Riemann

integrability,

0 0

b a

=

ò

. Since

(

)

0

b a

h

e

-

g

e

=

ò

, then

(

)

b a

h

e

-

g

e

<

e

ò

for every

e

>

0

.

(4)

We have thus shown that for every

e

>

0

there exist functions

g h

e

,

e

: ,

[ ]

a b

®

¡

such that

( )

( )

( )

g x

e

£

f x

£

h x

e for all

x

Î

[ ]

a b

,

, and such that

g h

e

,

e are both Riemann integrable on

[ ]

a b

,

and

(

)

b a

h

e

-

g

e

<

e

ò

.

(ii) We assume that for every

e

>

0

there exist functions

g h

e

,

e

: ,

[ ]

a b

®

¡

such that

( )

( )

( )

g x

e

£

f x

£

h x

e for all

x

Î

[ ]

a b

,

, and such that

g h

e

,

e are both Riemann integrable on

[ ]

a b

,

and

(

)

b a

h

e

-

g

e

<

e

ò

.

Next, we consider any sequence

( )

P

&

n of tagged partitions of

[ ]

a b

,

which is such that

lim

n

0

n®¥

P

=

&

.

Then, since

g h

e

,

e are integrable on

[ ]

a b

,

, the sequential criterion for Riemann integrability implies

that

lim

(

;

)

b n n a

g

e

S g P

e ®¥

=

ò

&

(1) and b

lim

(

;

)

n n a

h

e

S h P

e ®¥

=

ò

&

(2).

Since both integrals

b a

g

e

ò

and b a

h

e

ò

exist, then, by linearity,

(

)

b b b

a a a

h

e

-

g

e

=

h

e

-

g

e

ò

ò

ò

, and by (1)

and (2),

(

)

lim

(

;

)

lim

(

;

)

b n n n n a

h

e

g

e

S h P

e

S g P

e ®¥ ®¥

-

=

&

&

, and then the relation b

(

)

a

h

e

-

g

e

<

e

ò

reads

(

)

(

)

lim

;

n

lim

;

n n®¥

S h P

e

-

n®¥

S g P

e

<

e

&

&

, thus

lim

(

;

)

lim

(

;

)

n n

n®¥

S h P

e

<

n®¥

S g P

e

+

e

&

&

.

Then, by the auxiliary lemma 1, there exists

N

Î

¥

such that

S h P

(

e

;

&

n

) (

<

S g P

e

;

&

n

)

+ +

e e

, thus

(

;

n

) (

;

n

)

2

S h P

e

&

<

S g P

e

&

+

e

(3) for all

n N

>

.

Besides, since, by assumption,

g x

e

( )

£

f x

( )

£

h x

e

( )

for all

x

Î

[ ]

a b

,

, then for every tagged

partition

P

&

of

[ ]

a b

,

, it holds that

S g P

(

e

;

&

) ( ) (

£

S f P

;

&

£

S h P

e

;

&

)

.

Let us prove it.

If

{ }

0 m k k

x

= and

{ }

1 m k k

t

= are, respectively, the partition points and tags of

P

&

, then, by definition,

(

;

)

( )(

1

)

m k k k

S g P

e

&

=

å

g t

e

x

-

x

- ,

( )

;

( )(

1

)

m k k k

S f P

&

=

å

f t

x

-

x

- ,

(5)

Further, since

g x

e

( )

£

f x

( )

£

h x

e

( )

for all

x

Î

[ ]

a b

,

and since

t

k

Î

[

x

k-1

,

x

k

] [ ]

Í

a b

,

for

1, 2,...,

k

=

m

, then

g t

e

( )

k

£

f t

( )

k

£

h t

e

( )

k , and multiplying all sides by

x

k

-

x

k-1

>

0

(

x

k

>

x

k-1

so that the interval

[

x

k-1

,

x

k

]

is well defined) yields

( )(

k k k 1

)

( )(

k k k 1

)

( )(

k k k 1

)

g t

e

x

-

x

-

£

f t

x

-

x

-

£

h t

e

x

-

x

- , for

k

=

1, 2,...,

m

, and adding the

m

inequalities then yields

( )(

1

)

( )(

1

)

( )(

1

)

1 1 1 m m m k k k k k k k k k k k k

g t

e

x

x

-

f t

x

x

-

h t

e

x

x

-= = =

-

£

-

£

å

å

, thus

(

;

) ( ) (

;

;

)

S g P

e

&

£

S f P

&

£

S h P

e

&

, which is what we wanted to prove.

Applying the previous relation, we have

S g P

(

e

;

&

n

) (

£

S f P

;

&

n

) (

£

S h P

e

;

&

n

)

for all

n

Î

¥

, thus also

for all

n N

>

, and combining with (3) then yields

S g P

(

e

;

&

n

) (

£

S f P

;

&

n

) (

<

S g P

e

;

&

n

)

+

2

e

(4) for all

n N

>

.

We note that we cannot take the limit

e

®

0

, because as

N

depends on

e

, then

N

may tend to

infinity as

e

tends to 0, and then the relation (4) does not actually hold.

To proceed, we will use that the sequence

(

S g P

(

e

;

&

n

)

)

converges to

b a

g

e

ò

(see (1)).

Then, by definition, for every

e

¢ >

0

, thus also for

e

¢ = >

e

0

, there exists

N

1

Î

¥

such that

(

;

)

b n

a

S g P

e

&

-

ò

g

e

<

e

(5) for all

n N

>

1.

Next, we set

N

2

º

max

{

N N

,

1

}

.

Since

N N

,

1

Î

¥

, then

max

{

N N

,

1

}

Î

¥

, and thus

N

2

Î

¥

.

Further, since

max

{

N N

,

1

}

³

N N

,

1, then

N

2

³

N N

,

1, and thus if

n N

>

2, then

n N N

>

,

1, and

thus both (4) and (5) hold for all

n N

>

2.

By (5), we have

(

;

)

b n a

S g P

e

g

e

e

e

- <

&

-

ò

<

, and adding

b a

g

e

ò

to all sides yields

(

;

)

b b n a a

g

e

- <

e

S g P

e

<

g

e

+

e

ò

&

ò

, thus b

(

;

)

n a

g

e

- <

e

S g P

e

ò

&

(6) and

(

;

)

b n a

S g P

e

&

<

ò

g

e

+

e

(7).

Next, adding

2

e

to both sides of (7) yields

(

;

)

2

3

b n

a

(6)

Further, since

e

>

0

, then

- > -

e

3

e

, and adding

b a

g

e

ò

to both sides yields

3

b b a a

g

e

- >

e

g

e

-

e

ò

ò

, i.e.

3

b b a a

g

e

-

e

<

g

e

-

e

ò

ò

(9).

Next, combining (6) and (9) yields

3

(

;

)

b b n a a

g

e

-

e

<

g

e

- <

e

S g P

e

ò

ò

&

, thus b

3

(

;

)

n a

g

e

-

e

<

S g P

e

ò

&

,

and combining with (4) then yields

3

(

;

) (

;

) (

;

)

2

b

n n n

a

g

e

-

e

<

S g P

e

£

S f P

<

S g P

e

+

e

ò

&

&

&

, thus

(

) (

)

3

;

;

2

b n n a

g

e

-

e

<

S f P

<

S g P

e

+

e

ò

&

&

, and combining with (8) yields

(

)

3

;

3

b b n a a

g

e

-

e

<

S f P

<

g

e

+

e

ò

&

ò

, and adding b

a

g

e

-

ò

to all sides then yields

(

)

3

;

3

b n a

S f P

g

e

e

e

- <

&

-

ò

<

, thus

(

;

)

3

b n a

S f P

&

-

ò

g

e

<

e

(10).

The inequality (10) holds for every

e

>

0

and for every

n N

>

2.

Since the inequality (10) holds for every

e

>

0

, then it also holds for every

e

¢¢ =

3

e

>

0

, because as

e

takes any positive value,

3

e

also takes any positive value.

Also, since

e e

=

¢¢

3

, then the function

g

e that, by assumption, depends on

e

, depends on

e

¢¢

.

We have thus shown that for every

e

¢¢ >

0

there exists

N

2

Î

¥

such that

(

;

)

b n

a

S f P

&

-

ò

g

e¢¢

<

e

¢¢

for all

n N

>

2, where the integral

b a

g

e¢¢

ò

is a real number that, generally, depends on

e

¢¢

(because

the function

g

e¢¢ depends on

e

¢¢

).

Then, by the auxiliary lemma 2, the sequence

(

S f P

(

;

&

n

)

)

is a Cauchy sequence.

We have thus shown that for any sequence

( )

P

&

n of tagged partition of

[ ]

a b

,

which is such that

lim

n

0

n®¥

P

=

&

, the sequence

(

(

;

)

)

n

S f P

&

is a Cauchy sequence.

(7)

3 References

1. Spiros Konstantogiannis, A Sequential Criterion for Riemann Integrability Resulting from Riemann’s Definition of the Integral. academia.edu, 2020, available at

https://www.academia.edu/43876143/A_Sequential_Criterion_for_Riemann_Integrability_Resulting_from_Riema nns_Definition_of_the_Integral

and

https://q4quantum.wordpress.com/2020/08/17/a-sequential-criterion-for-riemann-integrability-resulting-from-riemanns-definition-of-the-integral/

2. Robert G. Bartle and Donald R. Sherbert, Introduction to Real Analysis. John Wiley & Sons, Inc., Fourth Edition, 2011.

References

Related documents

and Jabobs, L, The Healing Relationship in Gestalt Therapy; a Dialogic/Self Psychology Approach, The Gestalt Journal Press, Inc., Gouldsboro, ME, 1995  Kepner, J. Introduction

Our goal here will be to discuss integration of complex functions f (z) = u + iv, with particular regard to analytic functions. Of course, one way to think of integration is

The above two claims together show that if a feasible solution is such that p k &gt; 0, but one of the preceding robustness constraints is not tight, then we can shift some

Browse ap music theory, we learn about the limit notation and applied mathematics, free response exam with suitably chosen functions of examples the squeeze theorem is the museum

Gear Injectable Horse Tranquilizers (Weapon: 3), Medical Kit, Medical Laboratory, Mid-sized Luxury Sedan, Syringe Physical Stress 1 2 3 4 Mental Stress 1 2 3 4 Skills Superb

As in the proof of Green’s Theorem, we prove the Divergence Theorem for more general regions by pasting smaller regions together along common faces... Thus, when we add the

For example, Random Early Drop (RED) [1] and many of its variations [4,5] are typical queue length based AQM schemes, in which a packet is dropped/marked according to a

Cuba gives priority to the effective realization of the right to development, education and health, the fight against racism, racial discrimination, xenophobia and related forms