5.3 Function sequence and function series

Definition 5.3.1 Assuming f,fn:I→R(C), fn is pointwisely convergent to f on I if ∀x∈I, limn→+∞fn(x)=f(x), i.e. ∀x∈I, ∀ϵ>0, ∃Nϵ(x) s.t. ∀n≥Nϵ(x), |fn(x)−f(x)|<ϵ.

Definition 5.3.2 Assuming f,fn:I→R(C), fn is uniformly convergent to f on I if ∀ϵ>0, ∃Nϵ s.t. ∀x∈I, ∀n≥Nϵ, |fn(x)−f(x)|<ϵ, marked as fn⇉If.

Theorem 5.3.3 Mark ∥f∥∞=sup{|f(x)||x∈I}, then fn⇉If⇔limn→+∞∥fn−f∥∞=0.

Note

1.

If fn⇉If, then fn is pointwisely convergent to f.

2.

For uniform convergence, given ϵ>0, ∃N>0 s.t. ∀n>N, ∀x∈I, |fn(x)−f(x)|<ϵ, meaning fn converges to f synchronously at any x.

Example 5.3.1 Assuming fn(x)=xn, I=[0,1]. Then ∀x∈[0,1), xn→0,n→+∞; x=1, xn=1→1,n→+∞, meaning f is pointwisely convergent, and f(x)={0x∈[0,1)1x=1 fn is uniformly convergent to f on [0,a] for any a∈(0,1), since |fn(x)−f(x)|=|xn−0|=xn≤an<ϵ⇒n>ln⁡ϵln⁡a Yet fn is not uniformly convergent to f on [0,1], since ∀n≥2, take xn=1−1nn∈(0,1), we have |fn(xn)−f(xn)|=1−1n≥12>ϵ. Another way to verify it is ∥fn−f∥∞=supx∈[0,1]|fn(x)−f(x)|≥|fn(xn)−f(xn)|≥12 whose limit is not 0.

Theorem 5.3.4 (Uniformly Cauchy) fn⇉If if and only if {fn} is uniformly Cauchy on I, i.e. ∀ϵ>0, ∃Nϵ s.t. ∀n,m≥Nϵ, ∥fn−fm∥<ϵ or ∀x∈I, |fn(x)−fm(x)|<ϵ.

Proof ⇒ is trivial. ⇐: Assuming fn is uniformly Cauchy on I, then ∀x∈I, {fn(x)} is a Cauchy sequence, meaning there exists the limit f(x) of fn(x).

Notice that ∀ϵ>0, ∃Nϵ s.t. ∀n,m≥Nϵ, ∀x∈I, |fn(x)−fm(x)|<ϵ. Let m→+∞, |fn(x)−f(x)|≤ϵ, meaning fn⇉If.

Another method to prove it. ∀ϵ>0, ∃Nϵ s.t. ∀n,m≥Nϵ, ∀x∈I, |fn(x)−fm(x)|<ϵ; for the same ϵ>0, ∃Mϵ(x) s.t. ∀m≥Mϵ(x), |fm(x)−f(x)|<ϵ, so ∀Nϵ, ∀m≥Mϵ(x)+Nϵ, |fn(x)−f(x)|≤|fn(x)−fm(x)|+|fm(x)−f(x)|<2ϵ meaning fn⇉If. ◻

Boundness, continuity and integrability. Mark B(I)={f:I→R is bounded} which is a linear space, ∥f∥∞=supx∈I|f(x)|.

Theorem 5.3.5 Assuming fn⇉If, fn∈B(I), then

1.

f∈B(I), i.e. (B(I),∥⋅∥∞) is complete.

2.

{fn} is uniformly bounded on I, i.e. ∃M>0 s.t. ∀n≥1,∀x∈I, |fn(x)|≤M.

Proof

1.

∀ϵ>0, ∃Nϵ>0 s.t. ∀n≥Nϵ, ∀x∈I, |fn(x)−f(x)|<ϵ, so |f(x)|≤|fN1(x)−f(x)|+|fN1(x)|<1+∥fN1∥∞, meaning f∈B(I).

2.

∀n≥N1, ∀x∈I, |fn(x)|≤|fn(x)−f(x)|+|f(x)|≤1+∥f∥∞ meaning ∥fn∥∞≤1+∥f∥∞. Therefore, ∀n≥1, ∥fn∥∞≤∥f1∥∞+⋯+∥fN1∥∞+∥f∥∞+1=M meaning {fn} is uniformly bounded on I. ◻

Example 5.3.2 Assuming fn(x)={1x1n≤x≤1n0<x≤1n which is bounded on (0,1] and pointwisely convergent to f(x)=1x, yet fn is not uniformly convergent since f is not bounded on (0,1].

Theorem 5.3.6 Assuming fn∈C(I), fn⇉If, then

1.

f∈C(I), i.e. C(I) is a closed set under uniform convergence.

2.

Assuming I⊆R is a bounded closed set, then C(I)⊆B(I) is a bounded subset under ∥⋅∥∞.

3.

Assuming I⊆R is a bounded closed set, then {fn} is uniformly equicontinuous on I, i.e. ∀ϵ>0, ∃δ(ϵ)>0 s.t. ∀n≥1, ∀x,y∈I, |x−y|<δ(ϵ)⇒|fn(x)−fn(y)|<ϵ.

Proof Only 1 will be proved. ∀x0∈I, prove that f is continuous at x0. Notice that |f(x)−f(x0)|≤|fn(x)−fn(x0)|+|fn(x)−f(x)|+|fn(x0)−f(x0)| ∀ϵ>0, ∃Nϵ>0 s.t. ∀n≥Nϵ, ∀x∈I, |fn(x)−f(x)|<ϵ. Since fNϵ is continuous at x0, so for the same ϵ>0, ∃δϵ(x0)>0 s.t. |x−x0|<δϵ(x0)⇒|fNϵ(x)−fNϵ(x0)|<ϵ. Therefore, |f(x)−f(x0)|≤|fNϵ(x)−fNϵ(x0)|+|fNϵ(x)−f(x)|+|fNϵ(x0)−f(x0)|<3ϵ meaning f∈C(I). ◻

Theorem 5.3.7 Assuming fn⇉If, fn∈R(I), then f∈R(I), i.e. (R(I),∥⋅∥∞) is complete and ∫If(x)dx=∫Ilimn→+∞fn(x)dx=limn→+∞∫Ifn(x)dx

Proof Since fn∈R(I), so fn∈B(I). Since fn⇉If, so f∈B(I). Assuming Dn is the set of discontinuities of f on I which is a set of measure 0. Take D=⋃n=1+∞Dn, then ∀x∈I∖D, ∀n≥1, fn is continuous at x. According to the proof of theorem above (not theorem itself), f is continuous at x, and the set of discontinuities of f on I is the subset of D. According to Lebesgue criterion, Dn are all sets of measure 0, meaning ∀ϵ>0, |D1|<ϵ, |D2|<ϵ2 and |Dn|<ϵ2n−1, so |D|≤∑n=1+∞|Dn|<∑n=1+∞ϵ2n−1=2ϵ meaning D is also a set of measure 0. According to Lebesgue criterion, f∈R(I), and |∫Ifn(x)dx−∫If(x)dx|≤∫I|fn(x)−f(x)|dx≤∫I∥fn−f∥∞dx=∥fn−f∥∞|I|→0 when n→+∞. ◻

Theorem 5.3.8 Assuming fn,g:I→R, I=[a,b] satisfying

  • fn(a)→A, n→+∞.
  • fn′∈C(I), fn′⇉Ig.

then fn is uniformly convergent on I, mark f=limn→+∞fn, then f∈C(I) and f′(x)=g(x), i.e. (limn→+∞fn(x))′=limn→+∞fn′(x)

Proof Since fn′⇉Ig, f∈C(I), so g∈C(I). Notice that f(x)=A+∫axg(u)du,fn(x)=fn(a)+∫axfn′(u)du hence, |fn(x)−f(x)|≤|fn(a)−A|+∫ax|fn′(u)−g(u)|du≤|fn(a)−A|+∫ax∥fn′−g∥∞du=|fn(a)−A|+∥fn′−g∥∞(x−a)≤|fn(a)−A|⏟∃N1(ϵ) s.t. ∀n≥N1+∥fn′−g∥∞⏟∃N2(ϵ) s.t. ∀n≥N2(b−a)<ϵ+ϵ(b−a)

meaning ∀ϵ>0, ∃Nϵ=N1(ϵ)+N2(ϵ) s.t. ∀n≥Nϵ, |fn(x)−f(x)|<ϵ, i.e. fn⇉If. ◻

Uniform convergence of function series and properties of sum function.

Definition 5.3.9 ∑n=1+∞un(x)⇉IS(x) if SN(x)=∑n=1Nun(x)⇉IS(x), i.e. ∀ϵ>0, ∃Nϵ≥1 s.t. ∀N≥Nϵ, ‖∑n=1Nun(x)−S(x)‖∞<ϵ, i.e. ∀x∈I, |∑n=1Nun(x)−S(x)|<ϵ.

Theorem 5.3.10 Assuming ∑n=1+∞un⇉IS.

1.

If un is continuous at x0∈I, then S is continuous at x0.

2.

If un∈R(I), then S∈R(I) and ∫I∑n=1+∞un(x)dx=∫IS(x)dx=∑n=1+∞∫Iun(x)dx

Theorem 5.3.11 If un∈C1(I), ∑n=1+∞un′⇉IT, and ∃x0∈I s.t. ∑n=1+∞un(x0)=A∈R, then ∑n=1+∞un⇉IS(x)=A+∫x0xT(t)dt where S∈C(I) and (∑n=1+∞un(x))′=S′(x)=T(x)=∑n=1+∞un′(x)

Criterion of uniform convergence.

Theorem 5.3.12 (Cauchy) ∑n=1+∞un is uniformly convergent on I is equivalent to that {SN} is uniformly Cauchy on I, i.e. ∀ϵ>0, ∃Nϵ≥1 s.t. ∀n≥Nϵ, ∀p≥1, ∥un+1+⋯+un+p∥∞<ϵ, i.e. ∀x∈I, |un+1(x)+⋯+un+p(x)|<ϵ.

Weierstrass criterion for absolutely convergent function series.

Theorem 5.3.13 (Weierstrass) If ∀n≥N0, ∀x∈I, |un(x)|≤an, ∑n=1+∞an is (absolutely) convergent, then ∑n=1+∞un(x) is uniformly absolutely convergent on I.

Example 5.3.3 Assuming a series ∑n=1+∞x2(1+x2)n, x∈R.

When |x|≥δ>0, we have 0≤x2(1+x2)n≤1(1+x2)n−1≤1(1+δ2)n−1 So ∀δ>0, the original series in uniformly convergent on (−∞,−δ] and [δ,+∞), meaning it’s internally-closed uniformly convergent.

The original series is not uniformly convergent on any set with 0 as its cluster point. un(x)=x2(1+x2)n takes the maximum at xn=±1n−1, so un(xn)=1n−1(1+1n−1)n≃1ne Here un+k(xn)=1n−1(1+1n−1)n+k Therefore, ∑k=1nun+k(xn)≥n⋅1n−1(1+1n−1)2n→n→+∞1e2 meaning ∃N0 s.t. ∀n>N0, un+1(xn)+⋯+u2n(xn)≥12e2, so it’s not uniformly Cauchy, meaning it’s not uniformly convergent.

Dirichlet and Abel criterion for conditionally convergent function series.

Theorem 5.3.14 ∑n=1+∞un(x)vn(x)⇉IS(x) if one of the following sets of condition hold,

  • (Dirichlet) ∑n=1Nun(x) is uniformly bounded, i.e. ∃M0 s.t. ∀x∈I,∀N≥1,|∑n=1Nun(x)|≤M0 vn(x) is monotonously decreasing with respect to n, and vn(x)⇉I0 when n→+∞.
  • (Abel) ∑n=1Nun(x) is uniformly convergent; vn(x) is monotonously decreasing with respect to n, and uniformly bounded.

Continuous yet never-being-derivable functions.

Example 5.3.4 Weierstrass function. W(x)=∑n=0∞ancos⁡(bnπx) where a∈(0,1) (indicating that it’s uniformly absolutely convergent, so W is continuous), b is a positive odd number and ab>1. Here W(x) is not derivable anywhere.

See Figure 5.3 another example of continuous yet never-being-derivable functions.
PIC
Figure 5.3: Continuous yet never-being-derivable function

Example 5.3.5 Prove that ∑n=1+∞sin⁡nxn=π−x2 when x∈(0,2π).

Notice that (∑n=1Nsin⁡nxn)′=∑n=1N(sin⁡nxn)′=∑n=1Ncos⁡nx=12sin⁡x2∑n=1N2sin⁡x2cos⁡nx=12sin⁡x2∑n=1N[sin⁡(n+12)x+sin⁡(n−12)x]=sin⁡(N+12)x2sin⁡x2−12∑n=1Nsin⁡nxn=∫πx∑n=1Ncos⁡ntdt=∫πx[sin⁡(N+12)t2sin⁡t2−12]dt

where ∫πxsin⁡(N+12)t2sin⁡t2dt=−cos⁡(N+12)t(2N+1)sin⁡t2|xπ+∫πxcos⁡(N+12)t2N+1d1sin⁡t2→δ≤x≤2π−x≤M12N+1+M2|x−π|2N+1→N→+∞0

Let N→+∞, we have ∑n=1+∞sin⁡nxn=π−x2 on any [δ,2π−δ], meaning it holds on (0,2π).

Example 5.3.6 ∑n=1+∞cos⁡nxn2 is uniformly absolutely convergent on R, and (cos⁡nxn2)′=−sin⁡nxn which is uniformly convergent on any [δ,2π−δ]. Therefore ∀x∈(0,2π), (∑n=1+∞cos⁡nxn2)′=∑n=1+∞(cos⁡nxn2)′=−∑n=1+∞sin⁡nxn=x−π2 Therefore, C(x)=∑n=1+∞cos⁡nxn2=C(0)+∫0xt−π2dt=C(0)+x2−2πx4 Notice that ∫02πC(x)dx=∑n=1+∞1n2∫02πcos⁡nxdx=0 Hence, C(0)=π26, i.e. ∑n=1+∞1n2=π26.