Processing math: 67%

Tuesday, October 15, 2013

Sequences of Functions

Problem 1
Let {gn} be a sequence of real valued functions such that gn+1(x)gn(x) for each x in T and for every n=1,2,.... If {gn} is uniformly bounded on T and if fn(x) converges uniformly on T, then fn(x)gn(x) also converges uniformly on T.

Problem 2
Let an be a decreasing sequence of positive terms. Prove that the series ansinnx converges uniformly on R if, and only if, nan0 as n

Only if direction is easy so we omit the proof here, we only prove the if direction
Suppose nan0 as n, let Bn(x)=nk=1sinkx nk=1aksinkx=Bnan+1nk=1Bk(ak+1ak) |mk=n+1aksinkx|=|Bnan+1Bmam+1+mk=n+1Bk(ak+1ak)|=|Bnan+1Bmam+1+B(am+1an+1)|, wheremin{Bn+1,Bn+2,...,Bm}Bmax{Bn+1,Bn+2,...,Bm}|(BnB)an+1|+|(BBm)am+1|<2Nan+1+2Mam+1<ε

problem 1 can be proved in a similar way

Problem 3
Given a power series n=0anzn whose coefficients are related by an equation of the form an+Aan1+Ban2=0 (n=2,3,...)
Show that for any x for which ther series converges, its sum is a0+(a1+Aa0)x1+Ax+Bx2

Problem 4
Show that the binomial series (1+x)^{\alpha}=\sum_{n=0}^{\infty} {\alpha \choose k} x^n exhibits the following behavior at the points x=\pm 1
a) If x=-1, the series converges for \alpha\geq 0 and diverges for \alpha<0
b) If x=1, the series diverges for \alpha \leq -1, converges conditionally for \alpha in the inteval -1<\alpha<0, and converges absolutely for \alpha\geq0