Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2005/iii/paper-51/3/a/solution
Past exam of the mathematics course of the University of Cambridge 2005 iii Paper 51 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A blocking kernel is a conditional probability for replacing the original spins by block spins. It must satisfyfor each original configuration. For example, divide the lattice into blocks of side and assign each block the sign of its total spin; a tie can be resolved with equal probabilities for the two signs. The product of these block rules is a normalized blocking kernel.
The real-space renormalization group defines the effective Boltzmann weight by summing the old weights against this kernel. Its normalization preserves the full partition function. The blocked lattice has spacing and sites. Rescaling lengths restores the original lattice-spacing convention. An exact transformation generally produces every symmetry-allowed interaction, not just the nearest-neighbor term; retaining only a few couplings is a further approximation.
New to topics? Read the docs here!