Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Fractal Uncertainty Principle and Spectral Gaps

Description

This lecture explores the Fractal Uncertainty Principle (FUP) for the Fourier transform, discussing regular sets, spectral gaps, and the FUP for Cantor sets. The instructor presents theorems, proofs, and applications, including the Fast Fourier Transform decomposition and submultiplicativity lemma.

Official source

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Related concepts (32)

Fourier transform

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.

Discrete Fourier transform

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies.

Fourier analysis

In mathematics, Fourier analysis (ˈfʊrieɪ,_-iər) is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer. The subject of Fourier analysis encompasses a vast spectrum of mathematics.

Cantor set

In mathematics, the Cantor set is a set of points lying on a single line segment that has a number of unintuitive properties. It was discovered in 1874 by Henry John Stephen Smith and introduced by German mathematician Georg Cantor in 1883. Through consideration of this set, Cantor and others helped lay the foundations of modern point-set topology. The most common construction is the Cantor ternary set, built by removing the middle third of a line segment and then repeating the process with the remaining shorter segments.

Fast Fourier transform

A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. The DFT is obtained by decomposing a sequence of values into components of different frequencies. This operation is useful in many fields, but computing it directly from the definition is often too slow to be practical.

Related lectures (34)

Fourier Series and Analysis

Covers Fourier series, analysis, the heat equation, Gibbs phenomenon, and Fourier transform properties.

Fourier Analysis: Fourier Series and Transform

Explores Fourier series, DFT, FFT, and their applications in signal processing and spectroscopy.

Fourier Series: Understanding Coefficients and Periodicity

Explores Fourier series coefficients, periodicity, and series relations.

Signal Representation: Fourier Transforms

Covers the representation of signals using Fourier transforms and the properties of signal vectors.

The fast Fourier transform