Question

In: Advanced Math

Using Theorem 1, discuss lim n→∞ fn on B and C (as in Example (a)) for...

Using Theorem 1, discuss lim n→∞ fn on B and C (as in Example (a)) for each of the following. (i) fn(x) = x n ; B = E1; C = [a, b] ⊂ E1. (ii) fn(x) = cos x + nx n ; B = E1. (iii) fn(x) = Xn k=1 xk; B = (−1, 1); C = [−a, a], |a| < 1. (iv) fn(x) = x 1 + nx ; C = [0, +∞). [Hint: Prove that Qn = sup 1 n 1 − 1 nx + 1 = 1 n .] (v) fn(x) = cosn x; B = 0, π 2 , C = h1 4 , π 2 ; (vi) fn(x) = sin2 nx 1 + nx ; B = E1. (vii) fn(x) = 1 1 + xn ; B = [0, 1); C = [0, a], 0 < a < 1.

THeorem 1

Theorem 1. Given a sequence of functions fm: A → (T, ρ′), let B ⊆ A and
Qm = sup
x∈B
ρ′(fm(x), f(x)).
Then fm → f (uniformly on B) iff Qm → 0.
Proof. If Qm → 0, then by definition
(∀ ε > 0) (∃ k) (∀m > k) Qm < ε.
However, Qm is an upper bound of all distances ρ′(fm(x), f(x)), x ∈ B. Hence
(2) follows.
Conversely, if
(∀ x ∈ B) ρ′(fm(x), f(x)) < ε,
then
ε ≥ sup
x∈B
ρ′(fm(x), f(x)),
i.e., Qm ≤ ε. Thus (2) implies
(∀ ε > 0) (∃ k) (∀m > k) Qm ≤ ε
and Qm → 0.
Examples.
(a) We have
lim
n→∞
xn = 0 if |x| < 1 and lim
n→∞
xn = 1 if x = 1.
Thus, setting fn(x) = xn, consider B = [0, 1] and C = [0, 1).
We have fn → 0 (pointwise) on C and fn → f (pointwise) on B, with
f(x) = 0 for x ∈ C and f(1) = 1. However, the limit is not uniform on
Saylor URL: http://www.saylor.org/courses/ma241/ The Saylor Foundation
230 Chapter 4. Function Limits and Continuity
C, let alone on B. Indeed,
Qn = sup
x∈C |fn(x) − f(x)| = 1 for each n.2
Thus Qn does not tend to 0, and uniform convergence fails by Theorem 1.
(b) In Example (a), let D = [0, a], 0 < a < 1. Then fn → f (uniformly) on
D because, in this case,
Qn = sup
x∈D |fn(x) − f(x)| = sup
x∈D |xn − 0| = an → 0.
(c) Let
fn(x) = x2 +
sin nx
n
, x ∈ E1.
For a fixed x,
lim
n→∞
fn(x) = x2 since

sin nx
n


1
n → 0.
Thus, setting f(x) = x2, we have fn → f (pointwise) on E1. Also,
|fn(x) − f(x)| =

sin nx
n


1
n
.
Thus (∀ n) Qn ≤ 1
n → 0. By Theorem 1, the limit is uniform on all of
E1.
Note 1. Example (a) shows that the pointwise limit of a sequence of con-
tinuous functions need not be continuous. Not so for uniform limits, as the
following theorem shows.

Solutions

Expert Solution


Related Solutions

Let f1 = 1 and f2=1 and for all n>2 Let fn = fn-1+fn-2. Prove that...
Let f1 = 1 and f2=1 and for all n>2 Let fn = fn-1+fn-2. Prove that for all n, there is no prime p that divides noth fn and fn+1
[02] For n ≥ 1, how many strings of length n using letters a,b,c are there...
[02] For n ≥ 1, how many strings of length n using letters a,b,c are there if the letter a must occur an even number of times?
Bezout’s Theorem and the Fundamental Theorem of Arithmetic 1. Let a, b, c ∈ Z. Prove...
Bezout’s Theorem and the Fundamental Theorem of Arithmetic 1. Let a, b, c ∈ Z. Prove that c = ma + nb for some m, n ∈ Z if and only if gcd(a, b)|c. 2. Prove that if c|ab and gcd(a, c) = 1, then c|b. 3. Prove that for all a, b ∈ Z not both zero, gcd(a, b) = 1 if and only if a and b have no prime factors in common.
Evaluate if the followings are Cauchy sequences or not. (a) an= (-1)n (b) an= (-1)n/n (c)...
Evaluate if the followings are Cauchy sequences or not. (a) an= (-1)n (b) an= (-1)n/n (c) an = n/(n+1) (d) an = (cos n)/n
Prove the following using any method you like: Theorem. If A, B, C are sets, then...
Prove the following using any method you like: Theorem. If A, B, C are sets, then (A ∪ B) \ C = (A \ C) ∪ (B \C) and A ∪ (B \ C) = (A ∪ B) \ (C \ A)
Prove Taylor's Theorem (using n=3 case)
Prove Taylor's Theorem (using n=3 case)
True or False? Why? Σ n = 1, ∞ fn(x) converges uniformly on A <=> for...
True or False? Why? Σ n = 1, ∞ fn(x) converges uniformly on A <=> for all n in N (natural numbers), there exists Mn > 0 such that |fn(x)| <= Mn for all x in A and Σ n = 1, ∞ Mn converges.
Evaluate the following limits using l'Hopital's rule. (a) lim x→0 (sin(x)−x)/(x^2) (b) lim x→0 (1/x) −...
Evaluate the following limits using l'Hopital's rule. (a) lim x→0 (sin(x)−x)/(x^2) (b) lim x→0 (1/x) − (1/e^x−1) (c) lim x→0+ (x^√ x)
Question 1 a) Determine whether the language {a n b m c n | n >...
Question 1 a) Determine whether the language {a n b m c n | n > 0} is regular or not using pumping Lemma. b) Prove that the language {(ai bn | i, n > 0, i = n or i = 2n} is not regular using the Pumping Lemma.
Verify using an example that vector a + (vector b * vector c) is not equal...
Verify using an example that vector a + (vector b * vector c) is not equal to (vector a + vector b) * (vector a + vector c) explain the problem that arrises
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT