I am trying to prove the $n^{th}$ transform of the Fourier transform: $$\mathcal{F}\left(\frac{d^n}{dx^n} f(x)\right)=(ik)^n\mathcal{F}(f(x)) \tag{1}.$$ I have solved the problem for the case $n=1$ by using integration by parts: $$\mathcal{F}(f'(x))=\frac{1}{\sqrt{2\pi}}\int_{-\infty}^{\infty} f'(x) e^{-ikx} \ dx=ik\mathcal{F}(f(x)).$$ I think that solving $(1)$ requires $n$ iterations of integration by parts, by i'm having trouble writing this formally. Some help would be really appreciated.
2026-03-29 18:48:08.1774810088
Proving $\mathcal{F}\left(\frac{d^n}{dx^n} f(x)\right)=(ik)^n\mathcal{F}(f(x))$.
120 Views Asked by user654924 https://math.techqa.club/user/user654924/detail At
1
There are 1 best solutions below
Related Questions in PROOF-WRITING
- how is my proof on equinumerous sets
- Do these special substring sets form a matroid?
- How do I prove this question involving primes?
- Total number of nodes in a full k-ary tree. Explanation
- Prove all limit points of $[a,b]$ are in $[a,b]$
- $\inf A = -\sup (-A)$
- Prove that $\sup(cA)=c\sup(A)$.
- Supremum of Sumset (Proof Writing)
- Fibonacci Numbers Proof by Induction (Looking for Feedback)
- Is my method correct for to prove $a^{\log_b c} = c^{\log_b a}$?
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-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?
Using formal induction
We want to show that $\mathcal{F}\{f^{(n)}(x)\} = (ik)^n \, \mathcal{F}\{f(x)\}.$
Basecase: For $n=0$ the identity is trivial.
Induction step: Assume that the identity is valid for some integer $n=p \geq 0$. Then, $$\begin{align} \mathcal{F}\{f^{(p+1)}(x)\} &= \frac{1}{\sqrt{2\pi}} \int_{-\infty}^{\infty} f^{(p+1)}(x) \, e^{-ikx} \, dx \\ &= \frac{1}{\sqrt{2\pi}} \left( \left[f^{(p)}(x) \, e^{-ikx}\right]_{-\infty}^{\infty} - \int_{-\infty}^{\infty} f^{(p)}(x) \, (-ik)e^{-ikx} \, dx \right) \\ &= ik \, \frac{1}{\sqrt{2\pi}} \int_{-\infty}^{\infty} f^{(p)}(x) \, e^{-ikx} \, dx \\ &= ik \, \mathcal{F}\{f^{(p)}(x)\} \\ &= ik \, \left((ik)^p \, \mathcal{F}\{f(x)\} \right) \\ &= (ik)^{p+1} \, \mathcal{F}\{f(x)\}, \\ \end{align}$$ i.e. it's also valid for $n=p+1.$
Conclusion: By the induction principle, the identity is valid for all integer $n \geq 0.$