Introduction
Fourier series provide a method to represent periodic functions as infinite sums of sines and cosines. Fundamental in harmonic analysis and PDEs. Enables transformation of complex boundary value problems into algebraic forms. Basis: orthogonal trigonometric functions on intervals. Used in heat conduction, wave equations, signal processing, and more.
"To analyze a function is to express it as a sum of simple oscillatory components." -- Jean Baptiste Joseph Fourier
Historical Background
Fourier's Original Work
Published in 1822: "Théorie analytique de la chaleur". Proposed heat distribution can be expressed via trigonometric series. Initially controversial due to lack of rigorous convergence proof.
Development of Rigorous Theory
Mid-19th to early 20th century: Dirichlet, Riemann, Lebesgue formalized integrability and convergence criteria. Key concepts: piecewise continuity, uniform convergence.
Impact on Mathematics and Physics
Foundation for harmonic analysis, functional analysis, and quantum mechanics. Essential tool for solving PDEs with boundary conditions.
Definition and Formulation
Periodic Functions
Function f(x) with period T satisfies f(x + T) = f(x) ∀x. Fundamental period may be 2π or scaled intervals.
Standard Fourier Series
Representation of f(x) on [-π, π] as:
f(x) ~ a₀/2 + Σ (aₙ cos nx + bₙ sin nx), n=1,2,...Fourier Coefficients
Coefficients a₀, aₙ, bₙ computed via integrals over one period:
a₀ = (1/π) ∫_{-π}^{π} f(x) dxaₙ = (1/π) ∫_{-π}^{π} f(x) cos(nx) dxbₙ = (1/π) ∫_{-π}^{π} f(x) sin(nx) dxOrthogonality Properties
Orthogonality of Sine and Cosine
Over [-π, π], functions satisfy orthogonality relations:
∫_{-π}^{π} cos(mx) cos(nx) dx = π δ_{mn}∫_{-π}^{π} sin(mx) sin(nx) dx = π δ_{mn}∫_{-π}^{π} cos(mx) sin(nx) dx = 0Kronecker Delta
δ_{mn} = 1 if m=n, else 0. Ensures independence of basis functions.
Implications
Orthogonality enables unique coefficient determination. Basis functions form complete orthogonal system in L² space.
Computation of Fourier Coefficients
Integral Formulas
Using orthogonality to isolate coefficients:
aₙ = (1/π) ∫_{-π}^{π} f(x) cos(nx) dxbₙ = (1/π) ∫_{-π}^{π} f(x) sin(nx) dxEven and Odd Functions
Even f(x): bₙ=0, only cosine terms. Odd f(x): aₙ=0, only sine terms. Reduces computational complexity.
Piecewise Functions
Integrals split over intervals of continuity. Proper handling of discontinuities required for accuracy.
Convergence Theorems
Pointwise Convergence
Dirichlet conditions: f piecewise continuous, bounded variation => Fourier series converges to f(x) at continuity points, midpoint of jump at discontinuities.
Uniform Convergence
If f is continuous and satisfies Lipschitz condition, series converges uniformly.
Mean Square Convergence
Parseval's theorem ensures convergence in L² norm for square integrable functions.
Applications in Partial Differential Equations
Heat Equation
Solution via separation of variables reduces PDE to ODEs with Fourier series expansions.
Wave Equation
Mode decomposition by Fourier series represents vibrations and waves over bounded domains.
Laplace's Equation
Boundary value problems solved using Fourier series expansions in rectangular domains.
Extensions and Generalizations
Fourier Transform
Generalizes Fourier series to non-periodic functions on infinite intervals.
Complex Fourier Series
Representation using exponential basis e^{inx}, simplifies algebra.
Fourier-Bessel Series
Radial problems expanded in Bessel function eigenbases, useful in cylindrical coordinates.
Fourier Series and Spectral Theory
Eigenfunction Expansions
Fourier series seen as expansion in eigenfunctions of Sturm-Liouville operators.
Hilbert Spaces
Framework for understanding convergence and orthogonality in infinite-dimensional spaces.
Spectral Decomposition
Connection to diagonalization of self-adjoint operators in PDE theory.
Common Problems and Methods
Gibbs Phenomenon
Overshoots near discontinuities. Magnitude ~9% of jump. Diminishes but does not vanish with more terms.
Partial Sums Approximation
Finite Fourier sums approximate function. Error measured in L² or uniform norm.
Numerical Computation
Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT) algorithms enable efficient coefficient evaluation.
Tables of Basic Fourier Series
Common Periodic Functions
| Function f(x) | Fourier Series (Period 2π) |
|---|---|
| f(x) = x (−π < x < π) | 2 Σ_{n=1}^∞ (−1)^{n+1} (sin nx)/n |
| f(x) = |x| (−π < x < π) | π/2 − (4/π) Σ_{n=1,3,5...} (cos nx)/n² |
| f(x) = square wave (±1) | (4/π) Σ_{n=1,3,5...} (sin nx)/n |
Parseval's Identity
| Identity |
|---|
| (1/π) ∫_{−π}^{π} |f(x)|² dx = (a₀²)/2 + Σ_{n=1}^∞ (aₙ² + bₙ²) |
References
- Fourier, J. B. J., "Théorie analytique de la chaleur", Firmin Didot, 1822.
- Dirichlet, P. G. L., "Über die Darstellung ganz willkürlicher Funktionen durch Sinus- und Cosinusreihen", 1829.
- Zygmund, A., "Trigonometric Series", Vol. I & II, Cambridge University Press, 1959.
- Kreyszig, E., "Introductory Functional Analysis with Applications", Wiley, 1978, pp. 267-295.
- Evans, L. C., "Partial Differential Equations", 2nd Ed., AMS, 2010, pp. 53-60.