Fourier Sine Series — Question 5

PDF ↗

Question 5

Let f(x)=x(π−x)f(x)=x(\pi-x) on [0,π][0,\pi] and SN=∑n=1Nbnsin⁡(nx)S_N=\sum_{n=1}^Nb_n\sin(nx). You may use Parseval’s identity ∫0πf2dx=(π/2)∑n≥1bn2\int_0^\pi f^2dx=(\pi/2)\sum_{n\geq 1}b_n^2, and the standard convergence theorem for piecewise smooth odd periodic extensions.

Tasks

  1. Derive all coefficients by integration by parts, and identify the missing modes.

  2. Prove a uniform tail bound ∥f−SN∥∞≤4/(πN2)\|f-S_N\|_\infty\leq 4/(\pi N^2) for N≥1N\geq 1. State why uniform convergence includes both endpoints here.

  3. Find the smallest integer NN certified by that bound to give error below 10−310^{-3}. Distinguish a sufficient certificate from the actual smallest successful truncation.

  4. Evaluate ∫0πf2dx\int_0^\pi f^2dx exactly and use Parseval to derive the sum of the reciprocal sixth powers of the positive odd integers.

Original worksheet page 1: question and worked solution for 8-4-005
Show solutionHide solution

Question 5 – Solution

Strategy. Use the zero endpoint values and the constant second derivative to obtain rapidly decaying coefficients.

Step 1: Integrate twice and retain the parity. Because f(0)=f(π)=0f(0)=f(\pi)=0 and f″=−2f''=-2, integration by parts gives ∫0πfsin⁡(nx)dx=2(1−(−1)n)/n3\int_0^\pi f\sin(nx)dx=2(1-(-1)^n)/n^3. Therefore bn=4(1−(−1)n)πn3={8/(πn3),n odd,0,n even.\boxed{b_n=\frac{4(1-(-1)^n)}{\pi n^3} =\begin{cases}8/(\pi n^3),&n\text{ odd},\\0,&n\text{ even}.\end{cases}}

Step 2: Bound the entire tail uniformly. The coefficient series is absolutely summable, so it converges uniformly. The continuous odd periodic extension and the convergence theorem identify its sum with ff everywhere on [0,π][0,\pi]. For every xx, |f(x)−SN(x)|≤8π∑n>N1n3≤8π∫N∞t−3dt=4πN2.|f(x)-S_N(x)|\leq\frac 8\pi\sum_{n>N}\frac 1{n^3} \leq\frac 8\pi\int_N^\infty t^{-3}dt=\boxed{\frac 4{\pi N^2}}. Both endpoint values of the target and all partial sums are zero; there is no endpoint mismatch or jump obstructing uniform convergence.

Step 3: Choose a certified truncation. The stated bound is below 10−310^{-3} when N>4000/πN>\sqrt{4000/\pi}. Since this threshold lies between 35 and 36, N=36\boxed{N=36} is the smallest integer certified by this bound. The estimate discarded the missing even modes and possible cancellation; it does not prove that every smaller NN fails.

Step 4: Extract an exact numerical sum. Expanding the polynomial square yields ∫0πx2(π−x)2dx=π5/30\int_0^\pi x^2(\pi-x)^2dx=\pi^5/30. Parseval gives π530=32π∑j=0∞1(2j+1)6,∑j=0∞1(2j+1)6=π6960.\frac{\pi^5}{30}=\frac{32}{\pi}\sum_{j=0}^\infty\frac 1{(2j+1)^6}, \qquad \boxed{\sum_{j=0}^\infty\frac 1{(2j+1)^6}=\frac{\pi^6}{960}.} This conclusion uses the complete series and Parseval, not a finite numerical fit.

Original worksheet page 2: question and worked solution for 8-4-005

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