MA 5106, Spring 2024 IIT Bombay

Introduction to Fourier Analysis

Homework 1

Important
• Write your solutions neatly and submit it on 1 March. Late submission will not be allowed.
• Simplify√all your answers as much as possible and express answers in terms of fractions or constants
such as e or ln(4) rather than decimals.
• Show all your work and explain your reasonings clearly! Copying will not be tolerated.

The problems are from chapters 2 and 3 of the book E. M. Stein and R. Shakarchi, Fourier
Analysis: An Introduction .

1. Calculate the Fourier coefficients for the following

(a) f (x) = |x| for x ∈ [−π, π].

(Chapter 2, Exercise 6.)

 −π/2 − x/2 for − π < x < 0,
(b) f (θ) = 0 for x = 0,
π/2 − x/2 for 0 < x < π.

(Chapter 2, Exercise 8.)

2. Obtain the Fourier series of f (x) = ei(π−x)/2 on [0, 2π]. Then apply use the Parseval’s formula
+∞
X 1
to calculate .
(2n + 1)2
n=0
(Chapter 3, Exercise 9.)

3. Suppose f ∈ C(S1 ).

(a) Show that for any ξ ∈ R

Zπ Zπ π+ξ
Z
f (x + ξ) dx = f (x) dx = f (x) dx.
−π −π −π+ξ

(Chapter 2, Exercise 1.)

(b) Show that

Zπ
1
fb(x) = [f (x) − f (x + π/n)] e−inx dx.
4π
−π

(Chapter 3, Exercise 15(b).)

Page 1 of 2
MA 5106, Spring 2024 IIT Bombay

4. Let f ∈ C k (S1 ).

(a) Using integration by parts, or otherwise, show that

 
1
fb(n) = O as |n| → +∞.
|n|k

(Chapter 2, Exercise 10.)

(b) Using the Riemann-Lebesgue lemma, or otherwise, show that

 
1
f (n) = o
b as |n| → +∞.
|n|k

(Chapter 3, Exercise 13.)

5. Consider the Dirichlet kernel

N
X
DN (x) := einx for x ∈ S1 .
k=−N

Obtain the following:

sin((N + 1/2)x)
(a) DN (x) = .
sin(x/2)
1 sin2 (N x/2) −1
1 NP
(b) FN (x) = , where FN (x) := Dk (x) is the Fejér kernel.
N sin2 (x/2) N k=0
(Chapter 2, Exercise 15.)

Zπ
(c) |DN (x)| dx ≥ c log N , for some constant c > 0.
−π
(Chapter 2, Problem 2(a).)

Zπ
(d) DN (x) dx = 2π.
−π

Page 2 of 2