Fourier Transforms via magic

[November 26, 2019]

A while ago I found a series of papers which do some weird stuff with derivative operators:

  1. New Dirac Delta function based methods with applications to perturbative expansions in quantum field theory by Kempf/Jackson/Morales, 2014
  2. How to (Path-) Integrate by Differentiating also by Kempf/Jackson/Morales, 2015
  3. Integration by differentiation: new proofs, methods and examples by Jia/Tang/Kempf, 2016

The general theme is: evaluating functions on derivative operators , and applying this to delta functions , is occasionally useful and can give weird alternate characterizations of the Fourier transform and can be used to efficiently solve integrals.

The authors are physicists, unsurprisingly, and I’m sure there are a bunch of reasons why these results are either not that surprising or surprising-yet-not-useful, but I found them remarkable. But the whole thing is confusing and hard to make sense of. Here’s a… totally different take, in which I rederive the main result by poking around.

tldr: the Fourier transform of is . Er, what?


1.

First let’s fix a Fourier transform convention:

I prefer not to use the ones that put in the exponent because it’s distracting.

Here are a few common Fourier transform formulas in this convention, for reference:


2

It is common to take Fourier transforms of operators acting on functions, like , in order to solve differential equations. This can be computed using integration by parts inside the transform:

Itseems plausible to use the same argument to Fourier-transform a “freestanding” derivative operator, like :

I find this compelling, because it seems to work. Note that the minus sign is related to integration by parts. We might rewrite as an operator . These are different in general, but under an integral where the boundary vanishes they are the same, which is an assumption we’ll make liberally.

We can also find by rewriting it as a derivative in :

Armed with these, we may transform any function in or which has a Taylor series:

Or even both at once, as long as we are careful with what all of the operators act on:

In this expression, the and s are acting to the right, not on internal members of the expression. If they act on an internal member they pick up a minus sign, like we saw above:


All of this mostly seems to work if we allow negative powers of and also, but there is some funny business around integration bounds.

What value of should be used? To get the same value as Wikipedia’s table of Fourier transforms it should be . This makes an odd function, which means it is a choice that . This seems somewhat arbitrary, and I suspect that one could get away with just not choosing at all. If we do use , we get:

The other direction is simpler:

In summary we have a rough hand-waving method for – well, maybe not for rigorously deriving Fourier transforms, but at least for guessing at them, for derivative operators can be written as Laurent series (Taylor series with negative powers). Just swap .

In a sense this is a quarter rotation in the plane, followed by multiplying by and relabeling . That is:

I don’t now what it means to rotate in the plane, but it turns out that you can do other linear transformations in this plane as well – fractional rotations, or arbitrary matrices. Incidentally, the Laplace transform is , although the two-sided transform is better behaved than the more common one-sided transform. The one-sided version produces a bunch of integration bounds and such in the process, which is useful because it’s used for signals that turn ‘on’ at , but not too helpful for understanding as a rotation.


3. An integration technique

These are the main results of the papers mentioned above, I guess because papers have to justify their existence.

Recall that the integral of a function over the real line is equal to its Fourier transform evaluated at :

Using our form of this is:

This is readily computable:

This is so much easier and more algebraic than doing a limit and taking the principal value or whatever you normally have to do. As a bonus you get to see the Fourier transform as an intermediate step (it’s )

There are also versions for integrating over finite intervals, doing Laplace transforms, and a bunch of other stuff. I’ll probably write more about them later. There are more tricks – solving bounded integrals, for instance, amounts to evaluating , and using the fact that we know the Fourier transform of . Although it is messy: has a clean transform, . Then you solve for .

Anyway, I wanted to write this up so I don’t forget about it or how to understand it. Hope it’s useful to somebody else.