1. Let fn be a sequence of f unctions, fn : D → R.
It is called a sequence of increasing f unctions if
whenever x1 ≤ x2 , we have fn (x1 ) ≤ fn (x2 ) f or every n ∈ N.
It is called an increasing sequence of f unctions if fn (x) ≤ fm (x) ∀ n <
m and ∀ x ∈ D.
n
x
2. fn (x) = 1+x n . Let us consider the interval [0, 2].
W hen 0 ≤ x < 1,
limn→∞ fn (x) = 0
W hen x = 1,
limn→∞ fn (x) = 21
W hen 1 < x ≤ 2,
limn→∞ fn (x) = 1
Hence, the sequence converges pointwise to af unction (say f ), where
f (x) = 0, 0 ≤ x < 1
= 21 , x = 1
= 1, 1 < x ≤ 2
Here, each fn is continuous on [0, 2]. But the f unction f is not continuous
on [0, 2]. T heref ore the sequence of f unctions is not unif ormly convergent on [0, 2].
nx
3. fn (x) = 1+nx 3
nx x 1
limn→∞ fn (x) = limn→∞ 1+nx3 = limn→∞ n 1
+x3
= x2 = f (x)(say)
nx 1
Let Mn = sup | 1+nx 3 − x2 | where x ∈ [0, 1].
T hen, clearly lim MnR̸= 0. T heref ore
R 1 the sequence of f unctions is not unif ormly convergent.
1
T heref ore, limn→∞ 0 fn (x)dx ̸= 0 (limn→∞ fn (x))dx
R1 R 1 nx
So, limn→∞ 0 fn (x)dx = limn→∞ 0 1+nx 3 dx = ∞
4. Let us consider an arbitrary ∈> 0.
By given condition, there exists k ∈ N depending on ∈ but not on x ∈
D. [D ⊂ R, f : D → R, (fn ) be a sequence of f unctions] such that
∀ x ∈ D |fn (x) − f (x)| < ∈2 ∀ n ≥ k.
T ake any m, n ≥ k. T ake any x ∈ D. T hen,
|fm (x)−fn (x)| = |fm (x)−f (x)+f (x)−fn (x)| ≤ |fm (x)−f (x)|+|fn (x)−f (x)| <
∈ ∈
2 + 2 =∈ . T heref ore the sequence of f unctions is cauchy.(proved)
Conversely,
By condition, given ∈> 0 ∃ k ∈ N such that ∀ x ∈ D |fm (x) − fn (x)| <∈
∀ m, n ≥ k. Choose any n ≥ k and any x ∈ D.
Since, fn (x) → f (x), ∃ M ∈ N such that |fm (x) − f (x)| < ∈2 .
Let N is the maximum value between k and M. T hen,
|fn (x) − f (x)| = |fn (x) − fN (x) + fN (x) − f (x)| ≤ |fn (x) − fN (x)| + |fN (x) −
f (x)| < ∈2 + ∈2 =∈ .T heref ore, the sequence of f unctions is unif ormly convergent.(proved).
5. fn (x) = xn (1 − x) , x ∈ [0, 1]
limn→∞ fn (x) =limn→∞ xn (1 − x) = 0
Let us consider the limit f unction f (x) = 0 , x ∈ [0, 1].
1
Let Mn = supx∈[0,1] |xn (1 − x) − 0| = supx∈[0,1] [xn (1 − x)].
Let g(x) = xn (1 − x)
g ′ (x) = nxn−1 − (n + 1)xn = 0
n
or, xn ( n+1 − x) = 0
n
or, x = n+1 ,0
N ow, g ′′ (x) ̸= 0 when x = n+1
n
. M oreover, g ′′ (x) < 0 when x = n+1
n
.
Hence, g(x) attains maximum value at this point.
So, limn→∞ Mn = 0.
T heref ore, the sequence of f unctions is unif ormly convergent on [0, 1].(proved).
6. A F amily F of sequence of f unctions def ined on a set E in a metric space X is
called equicontinuous on E if ∀ ∈> 0 ∃ δ > 0 such that |fn (x) − fn (y)| < ∈
whenever d(x, y) < δ, x ∈ E, y ∈ E and fn ∈ F, where d denotes the metric of X.
q
7. fn (x) = x2 + n1 , x ∈ [0, 1]. Let the sequence of f unctions converges to a f unction f (x).
N ow,
limn→∞ fn (x) = f (x) = |x| q
Mn = supx∈[0,1] |fn (x) − f (x)| = supx∈[0,1] | x2 + n1 − |x||
Here, we get the supremum value at x = 0. (By f irst derivative test)
T heref ore, Mn = √1n .
⇒ limn→∞ Mn = 0.
T heref ore, the sequence of f unctions is unif ormly convergent. Also, each fn is continuous on [−1, 1].
Hence, f is unif ormly continuous on [−1, 1].(proved)
8. fn : R → R such that fn (x) = sin( nx ). Here, each fn is unif ormly bounded but limn→∞ fn (x) does
not exist ∀ n ∈ N ∀ x ∈ R. Hence, the sequence of f unctions {fn } is not pointwise convergent.
9. Let fn : R → R be such that
fn (x) =
1 + n1 when x is rational
1
n when x is irrational
T hen,
limn→∞ fn (x) =
f (x) =
1 when x is rational
0 when x is irrational.
Clearly, f (x) is a Dirichlet f unction.
10. Let fn (x) = 1 + x + x2 + x3 + ... + xn−1 , x ∈ [0, 1).
1
T hen limn→∞ fn (x) = 1−x , x ∈ [0, 1)
2
T he sequence of f unctions converges on [0, 1)to a f unction f (say) given by
1
f (x) = 1−x , x ∈ [0, 1).
|fn (x) = |1 + x + x2 + x3 + ... + xn−1 | ≤ 1 + |x| + |x2 | + |x3 | + ... + |xn− 1|
< n ∀ x ∈ [0, 1).
Each fn is bounded on [0, 1). But f is unbounded on [0, 1).
