Uniform and L2 Convergences

Aye Pyone
Department of Mathematics
Panglong University
09 403711872
ayepyone2006@gmail.com
11-12 February 2021
Abstract: We determine whether or not convergence of sequences of functions on a subset of the set of real
numbers; namely pointwise uniform convergence. Then we present the connection between uniform
convergence and uniform norm of each of function in a given sequence and limit function. Finally, we present
that if a sequence of continuous functions on a subset of the set of real numbers converges uniformly then its
limit function is continuous on a given set.
1. Introduction

We see that the sequence converges to 0. We now define the functions

by ; That is, . So, we have the

sequence converges to the 0 for each . In other words, We

have that converges a zero function. In this case, we say that converges on or

converges pointwise to a function f where defined by (see Figure

2.1).

n  1, 2, 4, 6
2. Pointwise Convergence
In this section, we recall the definition of pointwise convergence of a sequence of
functions on a subset of .
We now define a formal definition of pointwise convergence of a sequence of
functions on a subset A of . We also illustrate pointwise convergence by some examples.
 2

Definition 2.1. Let be a sequence of functions on A where . Let and

. We say that the sequence converges on to f if, for each , the

sequence converges to in . In this case, we call f the limit on of the

sequence . When such a function f exists, we say that the sequence is convergent

on , or converges pointwise on .

When the sequence converges on to f, we write it with symbolization:

on or on .
We also write by formulas:

for or for
We now illustrate Definition 2.1.

Example 2.2 (a) For each , the set of all natural number, let on . Then

for all (see Figure 2.2(a). Hence converges pointwise to the zero function.

(b) For each , let on [0,1] . Then for all n. Also,

for

Hence converges pointwise to the zero function where is defined by

(see Figure 2.2(b)).

(c) For each , let on . Then

for all
 3

so, converges pointwise to f where is defined by (see Figure 2.2(c)).

(d) For each , let on . Then

so, Hence converges pointwise to the zero function (see Figure 2.2(d)).
 4

(a) (b)

(c) (d)

Figure 2.2. Graphs of functions in Example 2.2

We recall that the definition of convergence sequence of real numbers: A sequence

in is said to be convergence to , or x is a limit of if for every there is an

integer N such that implies that . So, we reformulate Definition 2.1 as

above.
 5

Proposition 2.3. A sequence of functions on converges pointwise to a function

on if and only if for each and each there is an integer N such that

implies that

Proof. Suppose converges pointwise to f on . Then for each the sequence

converges to in . Also, then by the definition of convergent sequence, for

each and each there is an integer N such that implies

The converse is true from the above argument. 

The number N in Definition 2.1 depends on and For instance, in Example 2.2(b),

and

if

In Example 2.1(d), if and then

for all . Hence N depends only on but not . In this case, we say that
converges uniformly to f.
3. Uniform Convergence
In this section, we present uniform convergence of sequence of functions which is more than
stronger pointwise convergence. So, we recall the definition of uniform convergence.

Definition 3.1. A sequence of functions on A converges uniformly on to a

function if for each there is an integer N depending on but not

such that if implies

for all .
 6

In this case, we say that the sequence is uniformly convergent on , we write

on or for .

We observe that if converges uniformly to f then converges pointwise to f.

The converse is not true (see Example 2.2(a)-(c)).
We now show that a result to test whether or not uniform convergence.

Lemma 3.2. A sequence of functions on A does not converge uniformly on if and

only if for some there is a subspace of and a sequence in such that

for all .

Proof. Suppose a sequence of functions on A does not converge uniformly on . Then

by Definition 3.1, for some there is a subsequence of and a sequence

in such that

for all .
The converse is true by the above argument. 

Example 3.3. (a) In Example 2.2(a), if and then

Hence does not converge uniformly to f.

(b) In Example 2.2(b), if and then

Hence does not converge uniformly to f.

(c) In Example 2.2(c), if and then

 7

Hence does not converge uniformly to f.

(d) In Example 2.2(d), converges uniformly to f on since

if

We now discuss the connection between the uniform convergence of a sequence

on A and the uniform norm of a set of bounded functions.

Definition 3.4. is bounded function if there is a real number M such that

for all . If f is bounded we define the uniform norm of f on A by

Theorem 3.5. A sequence of bounded functions on A converges uniformly on A to f if

and only if

Proof. Suppose the sequence of bounded functions on A converges uniformly on A to f.

By Definition 3.1, for each there is an integer N depending on but not such that
if implies

for all . Then and hence since is arbitrary.

Conversely, suppose . Then for every there is a positive number N

such that implies . By Definition 3.4, for all and


We now illustrate Theorem 3.5.
 8

Example 3.6(a) In Example 2.2(a), each is not bounded on . Hence by Theorem 3.5,

does not converge uniformly on .

(b) In Example 2.2(b), does not converge uniformly to f since

(c) In Example 2.2(c), each is not bounded on . Hence by Theorem 3.5, does not
converge uniformly on .

(d) In Example 2.2(d), converges uniformly on to the zero function since since

4. The [a,b] space

A square-integrable function or function is a real- or complex-valued measurable
function for which the integral of the square of the absolute value is finite. Thus, square-
integrability on the bounded interval is defined as follows.

is square integrable on

Example 4.1 Define on . Then is the square integrable function since

But on is not the square integrable function since it is not

finite.

Definition 4.2 For an interval the space is the set of all square integrable

functions defined on That is,

The length of each function f in is defined as follows:

Example 4.3 Define

 9

on for (see Figure 4.1). Then each That is, is a sequence in

n  1, 5

Definition 4.4 A sequence converges to f in if as More

precisely, for every there is a positive integer N such that if , then .

Example 4.5 In Example 4.3, the sequence converges to zero function as

as

We discuss the connection between the uniform convergence on a finite interval and
convergence.

Theorem 4.6 If a sequence converges uniformly to f on a finite interval , then this

sequence converges to f in

Proof. By the definition of uniform convergence, we can choose, for a given an integer
N such that

for and
This inequality implies
 10

Therefore, if , we have Since is arbitrary, converges f in

Example 4.7 Consider the sequence of functions on

(see Figure 4.2.). Then in since

as

Each function is bounded on and

Hence by Theorem 3.5, does not converge to zero uniformly on

n  50
Acknowledgements
I am deeply grateful to thank all my colleagues for their comments and suggestions. Finally, I thank my
parents and brothers for their supporting throughout my life.
 11

References
[1] A. G. Aksoy and M. A. Khamsi, (2010) A Problem Book in Real Analysis, Problem Books in Mathematics,
Springer-Verlag, New York.
[2] R.G. Bartle and D. R. Sherbert, (2011) Introduction to Real Analysis, Fourth Edition, John Wiley & Sons,
Inc., New York.
[3] G. B. Folland, (1992) Fourier Analysis and Its Applications, Wadsworth & Brooks/Cole, Publishing
Company Belmont, California.
[4] L. Larson,(2020) Introduction to Real Analysis, University of Louisville,
http://www.math.louisville.edu/~lee/ira.