General Theory of Self-Reciprocal Functions in the Fourier Transform
Fixed Points of the Fourier Transform
In the following two articles, examples of self-reciprocal functions in the Fourier transform were provided:
- Fourier Transform of the Probability Density Function of the Normal Distribution (Gaussian Function)
- An Example of a Self-Reciprocal Function in Fourier Transform
The two examples are:
These two functions are mapped to (except for a constant multiple) the same function under the Fourier transform.
Such functions are considered fixed points of the Fourier transform, and are referred to as self-reciprocal functions in the context of the Fourier transform.
There are various other such functions.
In this article, I will discuss the general theory related to such functions.
Unlike other articles, the following definition of the Fourier transform will be used here:
This is the third definition from Multiple Definitions of the Fourier Transform, used to ensure the Fourier transform is a unitary transform (avoiding constant multiples).
It will also be written as:
Repeated Application of the Fourier Transform
Let’s consider repeatedly applying the Fourier transform to a function
After one Fourier transform,
Here,
By substituting
The last transformation is the inverse Fourier transform.
From this, we can see that:
Continuing further:
and
This type of operation, where something returns to its original form after four iterations,
often appears in mathematics—such as multiplying by the imaginary unit
To summarize this diagrammatically:
Returning to the main point, the important equation obtained here is:
Focusing specifically on even functions:
Eigenvalues of the Fourier Transform
Since the Fourier transform is a linear transformation, it is natural to consider its eigenvalues.
Let
By definition, we have:
Repeating this four times gives:
On the other hand, from the earlier analysis:
Thus:
Therefore:
Later, I will show examples, but there are indeed non-zero functions
for
Let the eigenspaces corresponding to these eigenvalues be
These eigenspaces are orthogonal to each other.
In fact, for
When
Thus, any function
Applying the Fourier transform repeatedly to this decomposition gives:
Solving this, we can express
Here, the
Examples of Eigenfunctions Corresponding to Eigenvalues
Example of an Eigenfunction for Eigenvalue
This is precisely a self-reciprocal function, and a typical example is the Gaussian function mentioned at the beginning:
Differentiation in the Frequency Domain
One of the important properties of the Fourier transform is the frequency differentiation formula:
This asserts that multiplying by
This can be derived by calculating as follows:
Below, we calculate Fourier transform of
Fourier Transform of
Example of an Eigenfunction for the Eigenvalue
From the result for
is an eigenfunction corresponding to the eigenvalue
Example of an Eigenfunction for the Eigenvalue
Although the result for
Considering the Fourier transform of
we obtain
Therefore, if we choose
Solving this equation give
is an eigenfunction corresponding to the eigenvalue
Example of an Eigenfunction for the Eigenvalue
Although the result for
Considering the Fourier transform of
We obtain
Therefore, if we choose
Solving this equation gives
is an eigenfunction corresponding to the eigenvalue