Correlation Function¶
In both stage 2 and stage 3, we will encounter the following functional derivative
Thus, we give this quantity a name correlation function, or \(n\)-point (Green’s) function. The origin of this name comes from the similarity of its formulation in canonical quantization and hence this name may look strange here.
It is not so straight-forward about the \(n\)-point function, and thus we hope to reduce the formula. To do this, let us first evaluate the 2-point function
It is nothing other than \(\mathrm{i}\) times the ordinary Green’s function. Next, 3-point function
And 4-point function
where we have used \((1\sim2)\) to represent \(\tau(x_1,x_2)\). Therefore, we can see the regularity — the \(n\)-point function is either \(0\) or some combination of two point functions. Specifically, we have by induction
- The odd-point function is \(0\).
- The even-point function is
which means the summation over all the permutations \(p\). This is the so-called Wick’s Theorem — transforming the \(n\)-point function into the combination of 2-point function.
You are suggested to show yourself that the S-matrix can be written using correlation function as
where \(x\) takes over \(x_1,\ldots,x_n\). This formula is the so-called perturbative expansion of the S-matrix.