Processing math: 40%

Saturday, March 3, 2012

Gaussian Integrals: Wick's Theorem

We saw in the last update that the generating function Z[J] can be expressed as
Z[J]=e12JA1J
(at least as long as we've normalize things so that Z[0]=1. Now the wonderful thing is that this is something we can compute explicitly:
Z[J]=n=0(12A1ijJiJj)nn!=n=0(A1ijJiJj)n2nn!

For example, in the one-dimensional case (taking A=1) we get
Z[J]=n=0J2n2nn!
On the other hand, by the definition of the generating function we have
Z[J]=n=0xnn!Jn
Comparing coefficients, we find
x2n(2n)!=12nn!
so that
x2n=(2n)!2nn!.
Let's give a combinatorial description. Given 2n objects, in how many ways can we divide them into pairs? If we care about the order in which we pick the pairs, then we have
{2n \choose 2}{2n - 2 \choose 2} \cdots {2n-(2n-2) \choose 2} = \frac{(2n)!}{2^n}
Of course, there are n! ways of ordering the n pairs, so after dividing by this (to account for the overcounting) we get exactly the expression for \langle x^{2n} \rangle. This is the first case of Wick's theorem.

Now consider the general multidimensional case. Given I = (i_1, \cdots, i_{2n}), we define a contraction to be
\langle x^{j_1} x^{k_1} \rangle \cdots \langle x^{j_n} x^{k_n} \rangle
where j_1, k_1, \cdots, j_n, k_n is a choice of parition of I into pairs.

Theorem (Wick's theorem, Isserlis' theorem) The expectation value
\langle x^{i_1} \cdots x^{i_{2n}} \rangle
is the sum over all full contractions. There are (2n)!/ 2^n n! terms in the sum.

Proof This follows from our formula for the power series of the generating function. The reason is that the coefficient of  J^I in (\frac{1}{2} A^{-1}_{ij} J^i J^k)^n is exactly given by summing products of A^{-1}_{ij} over partitions of I into pairs, and the n! in the denominator takes care of the overcounting.

Next up: perturbation theory and Feynman diagrams.

No comments: