Skip to content

MATH3093

Fourier Analysis

Fourier series, the Fourier transform and Haar wavelets, with proofs and solved exercises.

3 chapters · 20 sectionsEN · 繁 · 简
My course notes

Your progress

0/ 20 sections marked complete

Next section: Fourier series: orthogonality and convergence

Completion marks are saved in this browser.

This course in the web

In the MATH3093 notes

Theorem cards
53
Definitions
30
Counterexamples
20
Concept lenses
8
Histories of ideas
1
Proof X-rays
20

Sections with a history of an idea

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 20 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

In the webTheorem cards 53 · Definitions 30 · Counterexamples 20 · Concept lenses 8 · Histories of ideas 1 · Proof X-rays 20

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 20 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

Chapter 1 · 12 sections

Fourier series

Derive Fourier coefficients, distinguish convergence modes, and use the Fejér kernel to recover a continuous periodic function.

Theorems 30 · Definitions 18Counterexamples 12Lenses 4History 1Proof X-rays 12

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 1.1

    Fourier series: orthogonality and convergence

    Derive Fourier coefficients, distinguish convergence modes, and use the Fejér kernel to recover a continuous periodic function.

  2. 1.2

    Fourier coefficients, smoothness and differentiation

    Relate periodic regularity and jumps to Fourier-coefficient decay, and justify differentiating a series.

  3. 1.3

    The Gibbs overshoot for a square wave

    Derive the shrinking-scale Fourier profile and its persistent first overshoot for one explicitly normalized jump.

  4. 1.4

    Fourier localization and Lebesgue constants

    Prove localization, estimate the Dirichlet-kernel operator norms, and explain why ordinary partial sums can diverge for a continuous function.

  5. 1.6

    Bounded variation and Fourier convergence at jumps

    Prove the Dirichlet–Jordan midpoint theorem and compare bounded variation with a Dini condition.

  6. 1.7

    Abel sums and Poisson boundary convergence

    Prove radial boundary recovery at Lebesgue points and jumps, distinguish Abel from ordinary convergence, and establish a small-coefficient Tauberian converse.

  7. 1.8

    Fourier modes, signed area and the isoperimetric inequality

    Derive the sharp planar length–area inequality and understand its equality case through Fourier coefficients.

  8. 1.9

    Weyl's criterion and polynomial equidistribution

    Use Fourier characters and differencing to study how sequences fill a torus.

  9. 1.10

    Fourier waves on a circle

    Construct periodic wave evolution in the energy space and explain propagation, recurrence and zero-mode drift.

  10. 1.11

    The discrete Fourier transform and aliasing

    Prove finite Fourier inversion and convolution, derive a radix-two FFT, and relate sampled periodic data to continuous Fourier coefficients.

  11. 1.12

    Multiplicative characters under the Fourier transform

    Compute character Gauss sums and use additive orthogonality to count finite-field solutions.

  12. 1.5

    Fejér means at Lebesgue points

    Control oscillatory Fejér kernels by a decreasing envelope and prove pointwise recovery and a weak maximal bound.

Chapter 2 · 7 sections

Fourier transform

Derive transform rules, inversion and the Plancherel extension with a consistent normalization and explicit hypotheses.

Theorems 21 · Definitions 10Counterexamples 7Lenses 3Proof X-rays 7

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 2.1

    Fourier transform: inversion, convolution and energy

    Derive transform rules, inversion and the Plancherel extension with a consistent normalization and explicit hypotheses.

  2. 2.2

    Poisson summation, periodization and the Gaussian

    Prove the Schwartz-class summation formula by periodization, apply it to a Gaussian, and test its pointwise hypotheses.

  3. 2.3

    Uncertainty, second moments and Gaussian extremizers

    Prove the sharp Fourier uncertainty inequality with its equality case, center the moments correctly, and distinguish Gaussian magnitude from optimal phase.

  4. 2.4

    Heat flow: approximate identities, smoothing and the L² generator

    Prove Lp convergence of concentrated kernels, construct the heat semigroup, and distinguish immediate smoothing from differentiability at the initial time.

  5. 2.5

    Bandlimited sampling: sinc reconstruction, stability and aliasing

    Derive exact sampling from a Fourier orthonormal basis, prove uniform and L² reconstruction, and identify the hypotheses behind the bandwidth threshold.

  6. 2.6

    The Riemann–Lebesgue lemma and Fourier decay

    Prove that L¹ transforms vanish at infinity, distinguish moments from smoothness, and construct arbitrarily slow decay.

  7. 2.7

    Approaching a boundary inside a cone

    Control nontangential Poisson averages by the maximal function and distinguish tangential approach.

Chapter 3 · 1 section

Haar wavelets

Build Haar wavelets from dyadic intervals, prove completeness in L², and interpret coefficients as local differences.

Theorems 2 · Definitions 2Counterexamples 1Lenses 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 3.1

    Haar wavelets and an orthonormal basis of L²

    Build Haar wavelets from dyadic intervals, prove completeness in L², and interpret coefficients as local differences.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details