Migdal-Kadanoff Bond-Moving Approximation
Real-space renormalization on a -dimensional lattice runs into a wall almost immediately: sum out a sublattice of Ising spins and you generate a proliferating mess of new couplings — diagonal bonds, four-spin terms, longer-range interactions — that no closed recursion can track. The Migdal–Kadanoff bond-moving approximation, introduced by Aleksandr Migdal in 1975 and reinterpreted geometrically by Leo Kadanoff in 1976, is the classic escape. Before decimating, one deliberately distorts the lattice: bonds are deleted and their strength "moved" onto neighbouring parallel bonds, until the spins slated for removal sit on isolated one-dimensional chains. Chain decimation is then exact, and the whole step closes on a single nearest-neighbour coupling , giving a clean recursion . The trade is honest and explicit. Bond-moving discards the transverse fluctuations that separated the merged bonds, so the scheme is uncontrolled — there is no small parameter, and the answer depends on the order in which bonds are moved. What survives is the topology of the RG flow: the recursion is exact in (where there are no bonds to move and it reduces to ordinary decimation, correctly flowing to zero coupling with no transition), and for it produces a nontrivial unstable fixed point — a finite critical temperature — of the right qualitative character. It gets the lower critical dimension right and generalizes effortlessly to , Potts, and disordered models, where it remains a workhorse for mapping phase diagrams. This article owns the bond-moving construction and its recursion, and it is candid about the numbers: for the 2D Ising model the simplest scheme places and the exponent within tens of percent of the exact Onsager values — qualitatively right, quantitatively approximate. It recalls the block-spin and decimation machinery (articles 1306, 1307) as its building blocks and the notion of a fixed point (1310) as its output. A deeper justification closes the circle: the MK recursions are the exact RG of a class of hierarchical (diamond) lattices, so every result is a genuine, thermodynamically consistent statistical-mechanics answer rather than an uncontrolled truncation.
- The Migdal–Kadanoff (MK) approximation is an approximate real-space RG built from two moves: bond-moving (shift and stack bonds so decimation becomes exact) and decimation (sum out the intervening spins).
- Bond-moving converts renormalizing a -dimensional lattice into a sequence of one-dimensional decimations, giving a closed recursion for the coupling under rescaling by .
- For the hypercubic Ising model the net map is : bond-moving multiplies ; series decimation of bonds gives the .
- It is exact in (flows to , no transition) and produces a nontrivial unstable fixed point (a finite ) for — but its exponents and are only approximate (tens of percent off Onsager in 2D).
- The same recursions are the exact RG of hierarchical diamond lattices, giving MK a rigorous status: it is the exact answer for a different model, not a truncation of the real one.
- Key idea: distort the lattice by moving bonds so the spins to be removed sit on 1D chains, then decimate exactly; the resulting closed recursion is exact in and on diamond lattices, and captures the qualitative RG flow — a fixed point for — everywhere else.
Distort the lattice by moving bonds so the spins to be eliminated sit on one-dimensional chains, then decimate exactly. The resulting closed recursion, for the hypercubic Ising model , is exact in and on hierarchical diamond lattices; for it produces a nontrivial unstable fixed point (a finite critical temperature) of the right qualitative character but with only approximate exponents.
The physical picture
Picture a 2D square lattice and the task of removing every other spin. Do it directly and you generate diagonal and four-spin couplings — a closed recursion is impossible. Migdal and Kadanoff's fix is to cheat the geometry first: take the bonds attached to a soon-to-be-removed spin and slide them sideways onto the neighbouring line, doubling that line's coupling. After this "bond-moving," the spins you want gone lie on isolated horizontal chains, and a chain is the one lattice where decimation is elementary — the transfer-matrix trick sums out the middle spin exactly. You have swapped the true lattice for a topologically simpler one whose RG you can do by hand. The approximation lives entirely in that slide. Superimposing two bonds into one of double strength pretends they saw the same pair of end-spins, ignoring the transverse degrees of freedom that actually separated them. That neglect of fluctuations is why MK slightly overestimates the tendency to order — its comes out too high — and why its exponents are imperfect. But the shape of the flow survives: below the fixed point the coupling renormalizes to zero (disorder), above it the coupling grows (order), and the fixed point itself is the critical temperature. Dimensionality enters through two competing integers. Rescaling by a factor , each surviving bond absorbs parallel bonds from the transverse directions (a strengthening, ), while bonds in series are decimated along the longitudinal direction (a weakening, the ). In there are no transverse directions, , nothing is moved, and the map is pure decimation that always flows to — no transition, exactly as the 1D Ising model demands. For the strengthening survives and the two effects balance at a nontrivial : a transition is born the instant exceeds one.
The core equations
The model is the nearest-neighbour Ising model with a single reduced coupling , and the whole RG closes on that one number. Everything below tracks how transforms under one MK step of rescaling factor in dimension .
where: is the Ising spin; runs over nearest-neighbour bonds. Large (low ) favours alignment; small (high ) favours disorder. The elementary exact step is decimation of a single spin in a chain: summing out a middle spin between two neighbours renormalizes the coupling. For a chain of bonds in series the composition gives the compact rule.
where: is the effective coupling between the surviving end-spins. Because , series decimation always weakens the coupling — the source of disordering. Bond-moving supplies the opposite tendency. Rescaling by , the transverse bonds are stacked onto one strand, multiplying its coupling, before that strand is decimated. Composing the two moves gives the Migdal–Kadanoff recursion.
where: is the bond-moved coupling (strengthening from the transverse directions), and the outer power is the series decimation (weakening). For , and the map is pure decimation flowing to ; for the two effects balance at a nontrivial . The critical exponent follows from linearizing about the fixed point: the thermal eigenvalue is the log of the map's slope, rescaled by .
where: signals an unstable fixed point (the critical surface); is the correlation-length exponent. For this yields , to be compared with the exact Onsager .
The goal is to assemble the closed recursion from its two elementary moves and to make explicit why one strengthens and the other weakens the coupling. We work with the reduced coupling and the variable in which decimation composes multiplicatively, then combine the transverse bond-count with the longitudinal series-decimation to get the net map for a hypercubic lattice under rescaling by .
Step 1. Decimate one spin in a chain: . Evaluating for gives and respectively, and , i.e. for two bonds in series. Why : the coupling composes multiplicatively in , so bonds in series give .
Step 2. Bond-move the transverse directions. Under a rescaling by , each surviving strand collects parallel bonds; parallel bonds add their couplings, so . Why this direction: stacking bonds strengthens the effective coupling, exactly opposing the decimation's weakening.
Step 3. Compose: first strengthen (), then decimate the resulting strand of series bonds, giving .
Step 4. Check : , so — the coupling always shrinks and flows to . Why this is right: the 1D Ising model has no finite- transition, and MK reproduces that exactly (bond-moving is trivial in 1D). Verified in verify_aq-sm-migdal-kadanoff-bond-moving.py (the map flows to ; the map has a nontrivial fixed point).
Go deeper · Derivation B · 1 minThe nontrivial fixed point, T_c, and the exponent ν in 2D
The goal is to locate the finite-temperature fixed point of the 2D Ising MK map, read off the approximate critical temperature, and extract the correlation-length exponent by linearization — then compare honestly with the exact Onsager solution. We specialize to , so the recursion is , solve numerically for the unstable root, and differentiate to get the thermal eigenvalue.
Step 1. Set : the fixed-point condition is . Small gives (flows to disorder), large gives (flows to order), so a single unstable root separates the phases. Numerically .
Step 2. Convert to a critical temperature: . The honest comparison: the exact Onsager value is , so MK overestimates by about — the neglected transverse fluctuations make ordering look easier.
Step 3. Linearize: confirms an unstable fixed point. The thermal eigenvalue is .
Step 4. Extract . The honest comparison: Onsager gives exactly, so MK is about high — qualitatively a diverging correlation length with a finite exponent, quantitatively approximate. Verified in verify_aq-sm-migdal-kadanoff-bond-moving.py (fixed point , vs Onsager , slope , vs exact ).
Limiting cases
| Case | Result | Meaning |
|---|---|---|
| , only | No finite- transition — MK is exact here (nothing to move). | |
| , (Ising) | , , | A nontrivial unstable fixed point appears; numbers off Onsager. |
| Mean-field-like | Bond-moving multiplicity dominates; recovers the mean-field tendency. | |
| Hierarchical (diamond) lattice | MK recursion exact | The MK map is the true RG of these lattices — no approximation, guaranteed consistent thermodynamics. |
Worked examples
Example 1 — The 2D Ising fixed point and critical temperature. Use the recursion .
Step 1. Impose : solve for the nontrivial root. Numerically, (bracketing between the disordered flow at small and the ordered flow at large ).
Step 2. Critical temperature .
Step 3. Compare with Onsager: exact , . MK overestimates by — the expected sign and magnitude for a bond-moving scheme that suppresses fluctuations.
Example 2 — The correlation-length exponent by linearization. Differentiate the map at .
Step 1. ; evaluated at this is — greater than one, so the fixed point is unstable (it sits on the critical surface).
Step 2. Thermal eigenvalue .
Step 3. Correlation-length exponent , versus the exact Onsager — a error, but the right qualitative physics: a divergent correlation length governed by a single relevant eigenvalue.
Origins · 1 minuniversality and how this was discovered
Why does the Migdal–Kadanoff scheme move bonds before decimating? - ( ) To make the lattice larger - (✓) So the spins to be removed lie on 1D chains, where decimation is exact and closes on one coupling - ( ) To conserve energy - ( ) To add long-range interactions Direct decimation in generates uncontrolled new couplings; bond-moving reduces the step to exact 1D decimation.
Going further
References. Kardar, Statistical Physics of Fields, Ch. 9 (real-space RG; Migdal–Kadanoff) · Pathria & Beale, Statistical Mechanics, 3rd ed., Ch. 14 · Goldenfeld, Lectures on Phase Transitions and the Renormalization Group, Ch. 9 · Migdal, Sov. Phys. JETP 42, 743 (1975) · Kadanoff, Ann. Phys. 100, 359 (1976) · Berker & Ostlund, J. Phys. C 12, 4961 (1979).
Provenance. The recursion , its triviality, and the 2D fixed point are verified against Kardar Ch. 9 and Goldenfeld Ch. 9. verify_aq-sm-migdal-kadanoff-bond-moving.py checks that the map flows to , locates the fixed point ( vs the exact Onsager , a overestimate), and extracts from the linearized slope (vs exact ).
Builds on: Block-Spin (Real-Space) Renormalization Group · Decimation and the One-Dimensional Ising RG · RG Flow in Coupling Space · Fixed Points of the RG. Leads to: Linearization About a Fixed Point and Eigenvalue Spectrum · Critical Exponents from the RG · Relevant, Irrelevant, and Marginal Operators · The Wilson-Fisher Fixed Point.
Is Migdal–Kadanoff a controlled approximation?
No. Unlike the -expansion, which is a systematic power series in , MK has no small parameter. Its error is not improvable by "going to higher order," and it even depends on the arbitrary choice of which bonds to move and in what order — different reasonable schemes give slightly different and exponents. What makes it trustworthy anyway is that the recursions are the exact RG of hierarchical diamond lattices, so the output is always a genuine statistical-mechanics answer. Use it for the flow topology, the lower critical dimension, and rough phase-diagram locations — not for precise exponents.
Why does MK overestimate the critical temperature?
Because bond-moving suppresses fluctuations. When you slide two bonds together into one of double strength, you pretend they coupled the same pair of spins, ignoring the transverse degrees of freedom that actually separated and decorrelated them. Killing those fluctuations makes ordering look easier than it is, so the transition happens at a higher temperature. That is why the 2D Ising comes out around in the simplest scheme rather than the exact Onsager — the sign of the error is a direct fingerprint of the approximation.
What is the connection to hierarchical (diamond) lattices?
A diamond hierarchical lattice is built by repeatedly replacing each bond with a motif of parallel branches, each subdivided into series bonds. On such a lattice the RG is exactly bond-move-then-decimate, because the lattice was constructed to make that operation exact — there are no transverse fluctuations to neglect. So the very recursion that is an approximation for the hypercubic lattice is the exact transformation for the diamond lattice. This reframing, due to Berker and Ostlund, is why MK never yields thermodynamic inconsistencies: it is solving a real model, just not quite the one you started with.
How does MK get the lower critical dimension right?
The lower critical dimension is where the finite- transition first disappears. In the MK map, the strengthening factor from bond-moving and the weakening from series decimation balance to give a nontrivial fixed point only when . For the Ising model the balance produces a fixed point for all and none at , so — correct. Extended to continuous-symmetry () models with the appropriate recursion, MK reproduces , matching the Mermin–Wagner result. Getting these thresholds right is one of the scheme's genuine strengths, independent of its exponent inaccuracy.
Can MK handle disorder and spin glasses?
Yes, and this is one of its most active uses. Because the recursion is a simple map on the coupling, replacing a single by a distribution of couplings (for random bonds) and iterating that distribution under the MK map is straightforward and numerically cheap. On hierarchical lattices this is exact, providing a controlled surrogate for the intractable Edwards–Anderson spin glass: one can locate the freezing transition, study the flow of the coupling distribution's width, and probe chaos in the spin-glass phase. Much of what is rigorously known about hierarchical spin glasses comes from exactly this MK-on-diamond-lattice construction.
Why work with tanh K rather than K directly?
Because decimation composes multiplicatively in , not in . Summing out a spin between two bonds of coupling gives an effective coupling whose is ; chaining bonds in series simply gives . In the raw variable this composition is a messy transcendental relation, but in it is a clean power. Bond-moving, meanwhile, is additive in (parallel couplings add), so the full MK step is naturally written by first adding in () and then taking a power in — exactly the form .