11.2 The group R and the Fourier transform

Concept links · terms present in this machine draft; source roles are unverified: adjoint operator · unitary representation · irreducible representation · U(1)

In the previous section, we imposed periodic boundary conditions, replacing the group of translations by the circle group , and then used the fact that unitary representations of this group are labeled by integers. This made the analysis relatively easy, with and the self-adjoint operator behaving much the same as in the finite dimensional case: the eigenvectors of give a countable orthonormal basis of H and can be thought of as an infinite dimensional matrix.

Unfortunately, in order to understand many aspects of quantum mechanics, one can’t get away with this trick, but needs to work with itself. One reason for this is that the unitary representations of R are labeled by the same group, , and it will turn out (see the discussion of the Heisenberg group in chapter 13) to be important to be able to exploit this and treat positions and momenta on the same footing. What plays the role then of will be the These are functions on that are one dimensional irreducible representations under the translation action on functions (as usual using equation 1.3)

One can try and mimic the Fourier series decomposition, with the coeficients that depend on the labels of the irreducibles replaced by a function depending on the label k of the irreducible representation of

Definition (Fourier transform)

The Fourier transform of a function is given by a function denoted or , where

This integral is not well-defined for all elements of , so one needs to specify a subspace of to study for which it is well-defined, and then extend the definition to by considering limits of sequences. In our case a good choice of such a subspace is the Schwartz space of functions such that the function and its derivatives fall of faster than any power at infinity. We will not try and give a more precise definition of here, but a good class of examples of elements of to keep in mind are products of polynomials and a Gaussian function. The Schwartz space has the useful property that we can apply the momentum operator an indefinite number of times without leaving the space.

Just as a function on can be recovered from its Fourier series coeficients by taking a sum, given the Fourier transform of itself can be recovered by an integral, with the following theorem

Theorem (Fourier Inversion)

For one has and

Note that is the same linear operator as with a change in sign of the argument of the function it is applied to. Note also that we are choosing one of various popular ways of normalizing the definition of the Fourier transform.

In others, the factor of may appear instead in the exponent of the complex exponential, or just in one of or and not the other.

The operators and are thus inverses of each other on . One has

Theorem (Plancherel)

and extend to unitary isomorphisms of with itself. In particular

Note that we will be using the same inner product on functions on

both for functions of and their Fourier transforms, functions of with our normalizations chosen so that the Fourier transform is a unitary transformation.

An important example is the case of Gaussian functions where

A crucial property of the unitary operator on is that it diagonalizes the diferentiation operator and thus the momentum operator . Under the Fourier transform, constant coeficient diferential operators become just multiplication by a polynomial, giving a powerful technique for solving diferential equations. Computing the Fourier transform of the diferentiation operator using integration by parts, we find

under Fourier transform, diferentiation by becomes multiplication by ik. This is the infinitesimal version of the fact that translation becomes multiplication by a phase under the Fourier transform, which can be seen as follows. If

then

Since , one can easily change variables and work with instead of As with the factors of 2, there’s a choice of where to put the factors of ℏ in the normalization of the Fourier transform. A common choice preserving symmetry between the formulas for Fourier transform and inverse Fourier transform is

We will however mostly continue to set , in which case the distinction between k and vanishes.

来源与版本

正文:英文 · OCR 机器稿 · 待校对

核对状态:OCR 机器稿 · 待校对

原书 PDF · 印刷页 129、130、131、132、133、134、135、136、137、138、139、140、141、142

来源版本:2025-10-20

来源 PDF SHA-256:5a1941b2443b54d5db3d055f1e5ba390429b7a728475258017aaac87ee85a837

OCR 来源 SHA-256:bc426eea334bc7f660bbf661b1ce699e6a3d4ea2d2447e31eb6c016434b2288e

OCR 产物 SHA-256:bc426eea334bc7f660bbf661b1ce699e6a3d4ea2d2447e31eb6c016434b2288e