Convergence of Fourier Series — Question 8

PDF ↗

Question 8

Let real coefficient sequences satisfy ∑n=1∞n2(an2+bn2)≤M,M>0.\sum_{n=1}^{\infty}n^2(a_n^2+b_n^2)\leq M,\qquad M>0. Define the formal series f=m+∑n≥1(ancos⁡nx+bnsin⁡nx)f=m+\sum_{n\geq 1}(a_n\cos nx+b_n\sin nx) and let SNS_N be its degree-NN truncation, N≥1N\geq 1. Write TN=∑n>Nn−2T_N=\sum_{n>N}n^{-2}.

Tasks

  1. Prove that the series defines a continuous periodic function by establishing uniform convergence.

  2. Prove ∥f−SN∥∞≤MTN<M/N\|f-S_N\|_\infty\leq\sqrt{MT_N}<\sqrt{M/N}.

  3. For a fixed NN and prescribed point x0x_0, construct coefficients satisfying the constraint for which the bound MTN\sqrt{MT_N} is attained.

  4. Prove ∥f−SN∥22≤πM/(N+1)2\|f-S_N\|_2^2\leq\pi M/(N+1)^2 and construct an equality case for this bound. Explain why the two optimizing coefficient patterns differ.

Original worksheet page 1: question and worked solution for 8-7-008
Show solutionHide solution

Question 8 – Solution

Strategy. Use the weighted coefficient budget with two different dual estimates: one for a point value and one for energy.

Step 1: Prove uniform convergence from the budget. For any finite tail from pp to qq, Cauchy–Schwarz gives |∑n=pq(ancosnx+bnsinnx)|≤(∑n=pqn2(an2+bn2))1/2(∑n=pqcos⁡2nx+sin⁡2nxn2)1/2.\left|\sum_{n=p}^q(a_n\cos nx+b_n\sin nx)\right| \leq\left(\sum_{n=p}^q n^2(a_n^2+b_n^2)\right)^{1/2} \left(\sum_{n=p}^q\frac{\cos^2nx+\sin^2nx}{n^2}\right)^{1/2}. It is at most M(∑n≥pn−2)1/2\sqrt M(\sum_{n\geq p}n^{-2})^{1/2}, independently of xx, and tends to zero as p→∞p\to\infty. The uniform Cauchy criterion applies. The limit of these continuous periodic partial sums is continuous and periodic.

Step 2: Bound the infinite tail. Passing to the uniform limit of the finite-tail inequality gives ∥f−SN∥∞≤MTN<M/N(N≥1).\boxed{\|f-S_N\|_\infty\leq\sqrt{MT_N}<\sqrt{M/N}\quad(N\geq 1).} The weighted hypothesis controls the full collection of omitted modes, not just a finite list of observed coefficients.

Step 3: Attain the exact pointwise bound. Set every coefficient with n≤Nn\leq N to zero and, for n>Nn>N, choose an=MTNcos⁡(nx0)n2,bn=MTNsin⁡(nx0)n2.\boxed{a_n=\sqrt{\frac M{T_N}}\frac{\cos(nx_0)}{n^2},\qquad b_n=\sqrt{\frac M{T_N}}\frac{\sin(nx_0)}{n^2}.} The weighted sum equals MM, and at x0x_0 the tail equals MTN\sqrt{MT_N}. This proves sharpness of the first bound over all admissible sequences. The mean mm may be arbitrary because it cancels from the error.

Step 4: Optimize the integral error. Orthogonality, justified by the uniform convergence, gives ∥f−SN∥22=π∑n>N(an2+bn2)≤π(N+1)2∑n>Nn2(an2+bn2)≤πM(N+1)2.\|f-S_N\|_2^2=\pi\sum_{n>N}(a_n^2+b_n^2) \leq\frac{\pi}{(N+1)^2}\sum_{n>N}n^2(a_n^2+b_n^2) \leq\boxed{\frac{\pi M}{(N+1)^2}}. Equality is attained by aN+1=M/(N+1)a_{N+1}=\sqrt M/(N+1) and all other coefficients zero. The integral optimizer concentrates its budget in the cheapest omitted mode; the pointwise optimizer distributes it across all omitted modes with phases aligned at the chosen point.

Original worksheet page 2: question and worked solution for 8-7-008

Original worksheet layout. Use Enlarge or open the PDF for a closer view.