0. From Functions to Series: The Fundamental Definition.

Our inquiry begins by defining a canonical map from a function to a trigonometric series. This definition is not arbitrary; it is derived by assuming a “perfect” series representation exists and then using the mathematical properties of the basis functions to uniquely determine the coefficients.

Theorem (Uniqueness of Coefficients for Uniformly Convergent Series).

Let be a -periodic function. If is the sum of a uniformly convergent trigonometric series

then the coefficients are uniquely determined for each by the formula

Proof. The basis functions are orthogonal on the interval . For any integers , this property is expressed as:

where is the Kronecker delta. To find the coefficient for a fixed integer , multiply the series representation of by and integrate over . The uniform convergence of the series permits the interchange of summation and integration.

Solving for yields the stated formula.

Definition (Fourier Coefficients and Fourier Series).

Let be a -periodic function that is integrable on , i.e., . The Fourier coefficients of are the sequence of complex numbers defined by

The Fourier series of , denoted , is the trigonometric series constructed with these coefficients:

1. Convergence for Functions (Square-Integrable).

The space consists of functions whose squared magnitude is integrable, representing functions of finite “energy”.

A. Convergence TO the Original Function.

Theorem ( and Pointwise Convergence for Functions). Let . Then:

  1. The Fourier series converges to in the norm.
  2. The Fourier series converges to for almost every .

Proof.

  1. Convergence: This is the Riesz-Fischer Theorem. It is a cornerstone of the Hilbert space theory of Fourier analysis, proving that the partial sums form a Cauchy sequence in the complete space which converges to . Its proof is foundational to functional analysis and is stated here without derivation.

  2. Pointwise Convergence: This proof perfectly links the function space to our theorems from Lecture 1. Analyze the Coefficients: A direct consequence of the theory is Parseval’s Identity: . Since , the integral on the right is finite by definition. Therefore, the sum of the squared magnitudes of the coefficients is finite. This proves that the sequence of Fourier coefficients is a member of the space .

    • Apply Lecture 1 Theorem: Our “series-first” lecture presented Carleson’s Theorem, a deep result stating that if a sequence is in , its trigonometric series converges pointwise for almost every . * Conclusion: Since the coefficients of our function belong to , Carleson’s theorem directly applies and guarantees that converges pointwise almost everywhere to .

B. Smoothness of the Resulting Series.

The resulting function defined by the sum of the series, , is precisely (almost everywhere). Therefore, the sum function belongs to the same space as the original function, . There is no inherent gain in regularity.

2. Convergence for C¹ Functions (Continuously Differentiable).

Requiring one degree of smoothness—a continuous derivative—radically improves convergence.

A. Convergence TO the Original Function.

Theorem (Absolute and Uniform Convergence for C¹ Functions). Let . Its Fourier series converges absolutely and uniformly to .

Proof. The strategy is to show that the coefficients are absolutely summable (). We then invoke the strongest convergence theorem from Lecture 1.

  1. Relate Coefficients of f and f’: Using integration by parts for :

    Periodicity of both and makes the boundary term zero. The remaining integral is . This gives the crucial decay-rate relationship: .

  2. Establish Absolute Summability: We must prove .

    • Since , its derivative is continuous on . Any continuous function on a compact interval is in . Thus, .
    • This implies the coefficients of are square-summable: .
    • To bound the sum , we use the Cauchy-Schwarz inequality: .
    • The first bracket is a convergent p-series (). The second bracket converges because . The product is finite, proving that is finite. Thus, .
  3. Apply Lecture 1 Theorem: From Lecture 1, the Weierstrass M-Test proves that if a coefficient sequence is in , the series converges absolutely and uniformly.

  4. Conclusion: The Fourier series converges absolutely and uniformly. Since is continuous and the convergence is uniform, the limit of the series must be .

B. Smoothness of the Resulting Series.

Since we proved that converges uniformly to , and is a function, the resulting sum function is itself in .

3. The Hierarchy of Smoothness: and Functions.

Theorem (Rapid Convergence for Functions). Let for . Its Fourier series converges absolutely and uniformly to , and the coefficients exhibit rapid polynomial decay: .

Proof.

  1. Analyze the Coefficients: Iterating the differentiation rule for times yields:

  2. Establish Decay Rate: The derivative is continuous by hypothesis, hence its Fourier coefficients are bounded by some constant . This gives a precise bound on the decay of the original coefficients:

  3. Show Absolute Summability: The sum . For any , this p-series converges rapidly. (The case was handled above). Therefore, for any with , its coefficients are in .

  4. Apply Lecture 1 Theorem: The Weierstrass M-Test again implies absolute and uniform convergence of to .

B. Smoothness of the Resulting Series. The sum function is , which belongs to .

4. Comprehensive Summary of Convergence

This table details both the convergence of the series to the original function and the intrinsic smoothness class of the function defined by the series sum itself.

Function Space of Conv. to Pointwise Conv. to Uniform Conv. to Absolute Conv.Smoothness Class of the Sum Function
(Square-Integrable)YesAlmost EverywhereNot GuaranteedNot Guaranteed
(Continuous)YesNot GuaranteedNot GuaranteedNot GuaranteedNot Guaranteed
(Continuously Diff.)YesYesYesYes
( times Diff.)YesYesYesYes
(Smooth)YesYesYesYes