Sequences and Series of Functions MCQ Quiz in বাংলা - Objective Question with Answer for Sequences and Series of Functions - বিনামূল্যে ডাউনলোড করুন [PDF]

Explanation:

If {fn} and {gn} converge uniformly to f(x) and g(x) respectively on a set S, then {fn} + {gn} converges uniformly to f(x) + g( x).

(1) is correct

Explanation:

We have for any positive integer n, f_n ∶ [0, 1] → ℝ defined by

f_n(x) = , ∀ x ∈ [0, 1]

∴ f(x) =  f_n(x)

= 

= 0, ∀x ∈ [0, 1]

Hence, sequence {f_n(x)} converges to 0.

(1) Now, M_n =  |f_n(x) − f(x)|

= 

Let t = 

⇒  > 0,   ∀x ∈ [0, 1]

Let y = 

∴ 

= 

Putting  = 0 ⇒ nx + 1 = 0 ⇒ x = 

Now,

= 

= 

∴  = ∞

⇒  M_n = ∞

∴  M_n = ∞

∴ f is an increasing function in [0, 1].

Therefore, M_n = 

Now,  = 0

Hence, by M_n-test sequence {f_n(x)} is uniformly convergent in [0, 1].

Hence, option (1) is correct.

(2) Now, 

and M_n = 

= 

= 

Hence, sequence  of derivatives of {f_n} does not converges uniformly on [0, 1].

Hence, option (2) is incorrect.

(3) Since, each f_n(x) is Riemann integrable. Hence, 

 f_n(x) dx =  f(x) dx

=  0 dx

= 0

∴  f_n(x) dx =  0 = 0, ∀ x ∈ [0, 1]

Hence, the sequence  is convergent.

Hence, option (3) is correct.

(4) Since, each (x) is Riemann integrable. Hence,

(x) dx =  f'(x) dx

=  0 dx

= 0

∴  (x) dx =  0 = 0, ∀ x ∈ [0, 1]

Hence, the sequence  is convergent.

Hence, option (4) is correct.

Concept:

Pointwise Convergence:

Let  be a sequence of functions defined on a domain  D . The sequence  is said to

converge pointwise to a function   on  D  if, for every point   and for every 0\), there exists an integer  N

 such that for all  , the following condition holds

In other words, for each fixed point , the values of the functions  get arbitrarily close to  as .

Uniform Convergence:

Let  be a sequence of functions defined on a domain D. The sequence  is said to converge uniformly to a function

 f(x) on  D if for every 0\), there exists an integer N  such that for all  and for all , the following condition holds

Explanation:

For  , let . This is the sum of the first n+1 terms of a geometric series.

We know that the infinite geometric series  , which means  is an approximation of f(x) as   .

Option 1: The function  blows up as  , meaning that as we get closer to 1, the function

value grows without bound. This implies that f(x) is not uniformly continuous because the difference in

function values for close inputs near 1 can be arbitrarily large.

Option 1) is true.

Option 2: The sequence  is a partial sum of the geometric series, and we know that

the infinite sum converges to . Therefore,  converges to f(x) pointwise on [0, 1) .

Option 2 is true.

Option 3: Uniform convergence requires that the convergence happens uniformly across the entire interval.

Near x = 1 , the function f(x) grows very large, and the sequence  does not converge uniformly

because the convergence slows down significantly near x = 1 .

Option 3 is false.

Option 4: This is true because for any c is continuous and well-behaved

on the interval [0, c] , and the sequence   will converge uniformly on compact subintervals away from 1.

Option 4 is true.

The correct options are Option 1), Option 2), and Option 4).

Concept:

Pointwise convergent: A sequence of functions f₁, f₂, … , f_n, … : E → ℝ (E is a subset of ℝ) is said to converge pointwise on E to function f: E → ℝ if and only if

f(x) =  for all x ∈ E 

Uniform convergent: Given a sequence of functions f_n: E → ℝ, we say fn converges uniformly to f if and only if  = 0

Explanation:

(1): For x = 0

f(x) =  =  = 0

For x = 1                                                  

f(x) =  =  = log 1 = 0

For 0

f(x) =  = 0

So, (fn) converges pointwise on [0, 1].

(1) is correct.

(4): f_n(x) =  is a sequence of continuous functions converges pointwise to a continuous function f(x) = 0 on a compact set [0, 1]

xⁿ⁺¹ ≤ xⁿ ∀ x ∈ [0, 1]

 ≤  ∀ x ∈ [0, 1]

f_n+1(x) ≤ f_n(x) ∀ x ∈ [0, 1]

So, {fn(x)} is a increasing sequence

hence (fn) converges uniformly in [0, 1]

(4) is correct

Explanation:

, x ≥ -2 and the iteration

xn+1 = f(xn); n ≥ 0 for x0 = 0

Then we get

xn+1 =

Putting n = 0, 1, 2, ... we get

x1 =  = 

x2 =  = 

x3 =  = 

Continuing this process we get the iteration

(1) is correct

Let lim⁡xn=l \lim x_n = l from the recurrence l=2+ll = \sqrt{2 + l} squaring gives l2−l−2=0l^2 - l - 2 = 0, solving  l=−1,2l = -1, 2, but since x0=0x_0 = 0 only l=2l = 2 is valid

(3) is correct

Explanation:

If the sequence of continuous function {fn} converges to a continuous function f(x) on a compact set A and {fn} ≥ {fn+1} for all n belongs to , then {fn} tends to f(x) uniformly on A.

(3) is correct

Explanation:

Option (1):

Let f_n(x)  = , which is a sequence of real-valued functions on  and it converges uniformly to 0 on each closed and bounded subset of  .

Now sup as x → . So sequence {fn} not converges to f uniformly on .

(1) is false.

Option 2:

Since for any point in  we will get an interval and {fn} converges to a continuous function f uniformly on each closed and bounded subset of . So the sequence {fn} converges to f pointwise on 

Option (2) is correct.

Option (3):

Let f_n(x) = , which is a sequence of real-valued functions on  and it converges uniformly to 0 on each closed and bounded subset of  . but f_n is not bounded for sufficiently large n.

(3) is false.

Option (4)

 then f_n converges to a continuous function f uniformly on each closed and bounded subset of  but f_n is not continuous at x = 0.

(4) is false.

Option (2) is correct.

Concept:

If f_n is a sequence of continuous functions that converges uniformly to a function f , then f is continuous. 

Uniform convergence means that for every ϵ > 0, there exists an N such that for all n ≥ N and for all x in the domain, |f_n(x) - f(x)|

Explanation:

1. Uniform Convergence of Continuous Functions:

When a sequence of functions {f_n} converges uniformly to a function f , it means the rate of convergence of f_n  to f does not depend on x .

This uniform convergence preserves the continuity of the limit function f .

2. Continuity of the Limit Function:

Since each f_n  is continuous and the convergence to f is uniform, f will also be continuous. This result is a well-known theorem in real analysis.

Given that f is the uniform limit of a sequence of continuous functions {f_n} , f is continuous.

Therefore, the correct answer is Continuous.

Concept:

Absolute and Uniform Convergence of Function Series:

• Given: , for all integers and .
• We are asked to examine the convergence behavior of on — both in terms of absolute convergence and uniform convergence.
• Absolute convergence: A function series is absolutely convergent if converges for all .
• Uniform convergence: A function series converges uniformly if as .

Calculation:

Given,

Step 1: Absolute Convergence

For each fixed , we examine

Note:

• For , we have , so series trivially converges.
• For , , and .
• The function decays exponentially fast, hence converges for each .

⇒ So the series is absolutely convergent on .

Step 2: Uniform Convergence

• Uniform convergence of a sequence means: as .

We analyze: .

Let us define: .

Since , we write: .

To check uniform convergence, examine: .

Let’s maximize over .

Set: , and take derivative with respect to to find maximum.

Alternatively, test values:

At

At , we get:

So

This implies: as

∴ Since the supremum of does not tend to zero, the sequence is not uniformly convergent  on .

Concept:

A sequence of function f_n(x) is said to be uniformly convergent to its limit point f(x) in a domain D if, for all ϵ > 0, there exists m ∈  depend upon ϵ but independent of x ∈ D such that |f_n(x) - f(x)|

Explanation:

Cc(ℝ) = { f: ℝ → ℝ | f is continuous and there exists a compact set K such that f(x) = 0 for all x ∈ Kc}.

g(x) =  for all x ∈ ℝ.

Let f_n(x) = 

Now, 

for x ∈ [-n, n]

|f_n(x) - g(x)| = || =  ϵ for all n ≥ n₀

for x ∈ (-∞, -n] ∪ [n, ∞)

|fn(x) - g(x)| = || = ≤    n0