In learning about Fourier series, they were presented to me (informally) as a way to 'break down' a function into a series of discrete 'constituent' functions. This makes perfect sense to me. However, in a Fourier transform, they seem to be broken down into an infinite number of functions - my question is, how is this possible? In summing this infinite number of constituent functions (to synthesize the original function), won't you end up with something that has infinite amplitude?
2026-04-06 22:42:44.1775515364
How can a Function be a Superposition of Infinite Functions?
215 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in FOURIER-ANALYSIS
- An estimate in the introduction of the Hilbert transform in Grafakos's Classical Fourier Analysis
- Verifying that translation by $h$ in time is the same as modulating by $-h$ in frequency (Fourier Analysis)
- How is $\int_{-T_0/2}^{+T_0/2} \delta(t) \cos(n\omega_0 t)dt=1$ and $\int_{-T_0/2}^{+T_0/2} \delta(t) \sin(n\omega_0 t)=0$?
- Understanding Book Proof that $[-2 \pi i x f(x)]^{\wedge}(\xi) = {d \over d\xi} \widehat{f}(\xi)$
- Proving the sharper form of the Lebesgue Differentiation Theorem
- Exercise $10$ of Chapter $4$ in Fourier Analysis by Stein & Shakarchi
- Show that a periodic function $f(t)$ with period $T$ can be written as $ f(t) = f_T (t) \star \frac{1}{T} \text{comb}\bigg(\frac{t}{T}\bigg) $
- Taking the Discrete Inverse Fourier Transform of a Continuous Forward Transform
- Is $x(t) = \sin(3t) + \cos\left({2\over3}t\right) + \cos(\pi t)$ periodic?
- Translation of the work of Gauss where the fast Fourier transform algorithm first appeared
Related Questions in FOURIER-SERIES
- order of zero of modular form from it's expansion at infinity
- Fourier series expansion of $\frac{\pi^4}{96}$ and $\frac{\pi^4}{90}$
- How is $\int_{-T_0/2}^{+T_0/2} \delta(t) \cos(n\omega_0 t)dt=1$ and $\int_{-T_0/2}^{+T_0/2} \delta(t) \sin(n\omega_0 t)=0$?
- Fourier series. Find the sum $\sum_{n=1}^\infty \frac{(-1)^{n+1}}{2n+1}$
- How get a good approximation of integrals involving the gamma function, exponentials and the fractional part?
- The convolution theorem for fourier series.:$ \widehat{f*g}(x) =2π\hat{g}(x)\cdot\hat{f}(x) $
- Ergodicity of a skew product
- Fourier Series on $L^1\left(\left[0,1\right)\right)\cap C\left(\left[0,1\right)\right)$
- Parseval's Identity Proof Monotone/Dominated Convergence Theorem
- How can I interchange the sum signs
Related Questions in FOURIER-TRANSFORM
- Proof of Fourier transform of cos$2\pi ft$
- Find the convergence of series of a sequence of functions in $L^2(\mathbb{R})$
- solving a simple ODE with Fourier transform
- How can we prove that $e^{-jωn}$ converges at $0$ while n -> infinity?
- Show that a periodic function $f(t)$ with period $T$ can be written as $ f(t) = f_T (t) \star \frac{1}{T} \text{comb}\bigg(\frac{t}{T}\bigg) $
- Taking the Discrete Inverse Fourier Transform of a Continuous Forward Transform
- Arcsin of a number greater than one
- Complex numbers in programming
- Power spectrum of field over an arbitrarily-shaped country
- Computing an inverse Fourier Transform / Solving the free particle Schrödinger equation with a gaussian wave packet as initial condition
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The heuristic short answer is that the integral used in the Fourier transform assigns infinitesimally small weight to each of the functions added up (just as we imagine an integral as an infinite sum of infinitesimal strips that add up to a finite area).
One possible longer answer is that one sees this occur when we try to "derive" the Fourier transform from Fourier series. Recall that if $f$ is a (sufficiently nice) complex-valued function that is periodic on an interval of length $L$, we can take the Fourier coefficients for $f$ as $$ f_k = \int_{-L/2}^{L/2} e^{-2\pi i k x/L} f(x) \, dx, $$ and then Fourier's Theorem states $$ f(x) = \frac{1}{L}\sum_{k=-\infty}^{\infty} f_k e^{2\pi i kx/L}. $$ My impression is you're happy with this idea, although the normalisation of the coefficients I chose looks a bit strange at the moment.
Now, we want to see what happens if we let $f$ have longer and longer period. We first make a notational adjustment: let $\omega=k/L$, and let $\tilde{f}(\omega) = \tilde{f}(k/L) = f_k $. At the moment $\tilde{f}(\omega)$ is a function a discrete set of values, but the distance between neighbouring elements of this set is $1/L$, so it gets smaller and smaller. So now we have $$ \tilde{f}(\omega) = \int_{-L/2}^{L/2} e^{-2\pi i\omega x} f(x) \, dx. $$ No drama here: taking $L \to \infty$ just turns this into $\int_{-\infty}^{\infty} e^{-2\pi i\omega x} f(x) \, dx $, which is of course the Fourier transform. Conceptually, this isn't any different from the Fourier series integral: it's just that we have a different variable. On the other hand, the other equation has become $$ f(x) = \frac{1}{L}\sum_{\omega L=-\infty}^{\infty} \tilde{f}(\omega) e^{2\pi i \omega x} = \frac{1}{L}\sum_{k=-\infty}^{\infty} \tilde{f}\left(\frac{k}{L}\right) e^{2\pi i k x/L}. $$ Ah, but this is a Riemann sum! As $L \to \infty$, it tends to $\int_{-\infty}^{\infty} e^{2\pi i \omega x}\tilde{f}(\omega) d\omega $, which is of course the inverse Fourier integral. (Handling the infinite interval here is a bit tricky, but this makes total sense if $\tilde{f}(\omega)$ was only nonzero on a finite interval, where we would see a normal sort of finite Riemann sum apply.)
The moral of the story is that the $1/L$ in the Fourier sum formula turns out to be vital in decreasing the weight of each term in the series in just the right way to turn it into the Riemann sum of an integral, and this is one not-particularly-rigorous way of deriving the form of the inverse Fourier integral.