5
$\begingroup$

Within statistical physics and quantum field theory, the linked cluster theorem is widely used to simplify things in the calculation of the partition function among other things.

My question has the following parts:

  1. Is there a physical reason to justify the theorem without delving into the math/diagrams?

  2. Is there an intuitive reason the theorem holds in general graph theory?

  3. Can you sketch out a simple proof for the theorem?

$\endgroup$
8
$\begingroup$

Linked-cluster theorem$^1$ $$\ln Z~=~\frac{i}{\hbar} W_c, \tag{1}$$ where $Z$ is the partition function and $W_c$ is the generating functional of connected diagrams.

Proof. We will use a replica trick, cf. Ref. 1.

  1. Recall that if a theory consists of $n$ independent sub-theories with partition functions $Z_1, \ldots, Z_n$ (i.e. interactions are only allowed within each sub-theories), then the partition function for the full theory is the product $Z_1 \cdots Z_n$.

  2. Introduce $n$ copies of the original theory under investigation, where $n\in\mathbb{N}$ is a positive integer. The replica partition function becomes just a power $$\sum\left\{\text{all replica diagrams}\right\} ~=~Z^n,\tag{2}$$ because different copies do not interact. Each field $\phi^{\alpha}_{(i)}(x)$ in the replica theory now carries a copy label $i\in\{1, \ldots, n\}$, and doesn't talk to other copies.

  3. Given a Feynman diagram $D$ in the original theory, the contributions to the corresponding replica Feynman diagram should be multiplied with a factor $n^{\#(D)}$, where $\#(D)$ denotes the number of connected components of $D$. In other words, $$ \sum\left\{\text{all replica diagrams}\right\}~=~1+ n\sum\left\{\text{connected original diagrams}\right\} +{\cal O}(n^2). \tag{3}$$ In eq. (3) we have implicitly normalized the partition function such that $1$ is the value of the empty diagram, which by definition is not connected.

  4. Equivalently, by Taylor expansion, $$ \ln\sum\left\{\text{all replica diagrams}\right\}~\stackrel{(3)}{=}~ n\sum\left\{\text{connected original diagrams}\right\} +{\cal O}(n^2). \tag{4}$$

  5. Combining eqs. (2) & (4) yield $$\ln Z - \sum\left\{\text{connected original diagrams}\right\} ~\stackrel{(2)+(4)}{=}~{\cal O}(n^1) .\tag{5}$$ The LHS. of eq. (5) is independent of $n$, i.e. it is a constant wrt. $n$. But since the RHS. of eq. (5) has no ${\cal O}(n^0)$ terms, the constant must be zero. (Alternatively, we may formally treat the integer $n$ as a real number, and take the limit $n\to 0^{+}.$) This yields the linked-cluster theorem (1). $\Box$

See also this and this related Phys.SE posts.

References:

  1. X.G. Wen, QFT of many-body systems, (2004); p. 143.

--

$^1$NB: Conventionally in QFT, one allows for a multiplicative normalization factor in the partition function $Z$, which hence corresponds to an additive constant in $W_c$, cf. eq. (1).

$\endgroup$
-1
$\begingroup$
  1. No
  2. Not to my knowledge
  3. The idea is thus: diagrams represent transition amplitudes (complex numbers). The structure of the diagram tells you how to write down an integral. So a diagram might be an integral like $$\int f(x) dx.$$ Imagine if we have two copies of the same diagram. It's still a diagram. In that case we'll have something like $$\int f(x)f(y) dx dy = \int f(x)dx \int f(y)dy.$$ I've ignored symmetry factors.

On the other hand, if I were to connect the two disconnected copies with a line, then we'd have a single connected diagram, and the integral couldn't be separated into the product of two integrals, like above. We'd have $$\int f(x,y) dx dy.$$

Basically, a diagram with many disconnected components can be broken up into a product of integrals, which represent connected diagrams.

Since the rules of perturbation theory tell us to write down every possible diagram, we can factorise the disconnected diagrams into connected diagrams.

E.g. if I asked you to expand the expression $(a+b+c+...)^n$, then you'd write down every possible combination of $a,b,c,...$ containing $n$ terms and insert the correct binomial coefficients.

So then we could say the perturbation series is something like

$$\sum_n (n\text{ connected components}) = \sum_n \frac{1}{n!}(\text{sum of connected graphs})^n \\ = \exp(\text{sum of connected graphs})$$

The 1/n! prefactor basically comes out as the correct symmetry factor from the Feynman rules.

One can also separate the connected diagrams into 1PI diagrams and obtain Dyson's series, as well as a 1PI generating functional via a Legendre transformation.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.