High-Temperature Expansion of Lattice Models
You cannot solve the Ising model in three dimensions, and even in two dimensions Onsager's exact solution is a tour de force. But there is a humble question you can answer to any order you like: what happens just below infinite temperature? At the spins are independent coins and the partition function is trivially . Cool a little, and neighbours begin to correlate — bond by bond, in powers of the dimensionless coupling , or better, in powers of , which vanishes as . This is the high-temperature expansion, and it turns thermodynamics into pure combinatorics: counting graphs on a lattice. The technical heart is one exact identity. For Ising spins the bond weight takes only two values, so it can be written exactly as — linear in , no truncation. Multiply this over every bond, sum over spins, and each term is labelled by a subgraph of the lattice with a factor per selected bond. The spin trace then performs a ruthless selection: any site touched by an odd number of bonds traces to zero. Only closed graphs — every vertex of even degree — survive. The partition function has become an integer-coefficient generating function counting closed lattice loops. That is the whole engine, and it pays off twice. Taking keeps only connected closed graphs (the linked-cluster theorem again), giving an extensive free energy and clean series for energy, specific heat, and — with a field — the susceptibility. And because a phase transition is a singularity of the generating function, the radius of convergence in pins the critical temperature. For the 2D square lattice, Kramers–Wannier self-duality fixes it exactly at ; in three dimensions, long series plus ratio and Padé analysis still give some of the sharpest critical exponents we have.
- The high-temperature expansion develops the partition function of a lattice spin model in powers of around the trivial limit, where the spins are independent.
- The exact Ising bond identity converts each Boltzmann weight into a polynomial, turning into a sum over subgraphs with one factor per bond.
- The spin trace kills every graph containing an odd-degree vertex, so only closed (even-degree) subgraphs contribute — becomes an integer-coefficient generating function for closed lattice loops.
- Taking retains only connected closed graphs (the linked-cluster theorem), giving an extensive free energy and controlled series for , , and .
- The nearest singularity in is the critical point: for the 2D square Ising model the series diverges at , the exact Onsager value, fixed by Kramers–Wannier duality.
- Ratio and Padé analysis of long series (Domb–Sykes) extract and the critical exponents, competitive with Monte Carlo in three dimensions.
- Key idea: rewrite each Boltzmann bond as with ; the spin trace then selects only closed even-degree subgraphs, so and become integer-coefficient power series in counting closed and connected-closed lattice loops.
Rewrite each Boltzmann bond factor as with ; the spin trace then selects only closed (even-degree) subgraphs, so and become integer-coefficient power series in counting closed and connected-closed lattice graphs respectively.
Where this lives today
High-temperature series are far from a historical curiosity. Modern "linked-cluster" and "numerical linked-cluster" expansions (NLCE) compute properties of quantum lattice models — Hubbard, Heisenberg, frustrated magnets — by summing over finite clusters, a direct descendant of the closed-graph counting shown here, and they are a standard tool for interpreting cold-atom and quantum-magnet experiments where quantum Monte Carlo suffers from the sign problem. For classical models, series of thirty or more terms analysed with differential approximants still give three-dimensional Ising exponents , , at a precision that rivals the best Monte Carlo and conformal-bootstrap results. The deepest legacy is conceptual. The bond factorization that turns spins into a loop gas is the classical seed of lattice gauge theory: the strong-coupling (high-temperature) expansion of a gauge model, expanded in character sums instead of , produces the area law for the Wilson loop and Wilson's 1974 demonstration of quark confinement at strong coupling. That a Taylor series around infinite temperature can both pin a critical point it cannot reach and, generalized, explain confinement, is a lasting testament to the power of counting graphs.
The physical picture
At infinite temperature the spins are random coins and the partition function is just the number of configurations — for Ising spins. Cooling a little correlates neighbours weakly, and the expansion asks, in order: what is the leading correction, then the next? Each correction is a picture of correlated spins — a subgraph of the lattice — and its weight is one factor of per selected bond. Because as , larger graphs are more strongly suppressed, and truncating after a few orders is accurate at high temperature. The reason only closed graphs survive is a conservation law for "spin parity". Tracing a single spin gives if is even and if is odd. A graph term carries raised to the degree of site , so any site touched by an odd number of selected bonds annihilates the whole term. The survivors are loops and unions of loops — closed circuits drawn on the lattice. The first figure shows this selection rule at work: the smallest square plaquette (four bonds, every corner of degree two) survives, while an open path or a "dangling bond" has odd-degree endpoints and traces to zero.
Think of as a "fugacity per edge": the partition function is a grand sum over edge subsets with this fugacity, restricted to even-degree configurations — precisely a loop gas. This is why duality and topology enter so naturally. The transition is not something you build in; it emerges as the radius of convergence. The integer graph coefficients grow like , and is where loops proliferate uncontrollably — the onset of long-range order. The second figure is the payoff: a Domb–Sykes ratio plot, where the successive coefficient ratios of the susceptibility series are plotted against and extrapolated to a straight line whose intercept is . For the 2D square lattice that intercept lands exactly on .
The core equations
We start from the Ising model with a coupling and, later, a field ; the whole method rests on rewriting the nearest-neighbour Boltzmann weight and then tracing over spins.
where: is the Ising spin at site ; runs over nearest-neighbour bonds; is the ferromagnetic exchange; ; and is the external field (set except when computing the susceptibility). At the sum collapses to : the reference point of the whole expansion. The single identity that powers the method exploits the fact that takes only the values , so the exponential is exactly linear in it — this is not a Taylor truncation but an equality.
where: for is the graph-expansion variable. Reading it physically: is a spin-independent prefactor, and is the only correlation a single bond can carry — one factor of per bond, with the sign set by whether the two spins agree. Multiplying the identity over all bonds and tracing over spins turns into a purely combinatorial object: a sum over subgraphs, one factor per bond, with only closed graphs surviving.
where: is the number of bonds ( the coordination number), ranges over subgraphs in which every vertex has even degree, and counts the bonds in . The empty graph () gives the leading ; the smallest loop is the first correction. Taking the logarithm keeps only the connected closed graphs — the linked-cluster theorem — so the free energy per site is extensive and finite in the thermodynamic limit.
where: is the Helmholtz free energy per spin and the coordination number. The first two terms are the independent-spin reference; the graph sum is the interaction correction, and dividing by makes it intensive. The same connected-graph structure governs the Mayer cluster expansion for gases (recall aq-sm-mayer-cluster-expansion) and in field theory. With a small field one gets the correlation function and susceptibility from open two-point graphs — paths from site to site .
where: the numerator sums graphs with odd degree only at the two marked sites and (a path connecting them), and is the connected correlation. To leading order , with the shortest path length, so the reduced susceptibility becomes a path-counting series . Finally, the payoff for two dimensions: the critical point, fixed exactly by Kramers–Wannier self-duality rather than by resumming the series.
where: is the radius of convergence of the loop series and the exact Onsager critical value. This article owns the series route to this number and the estimate it provides; the full exact 2D solution is Onsager's, handed forward by name (aq-sm-kramers-wannier-duality). A "which variable when" note: never confuse (graph variable, integer coefficients) with (cumulant variable) — they agree only at first order.
The goal is to convert the Ising partition function, an intractable -term spin sum, into a generating function that counts even-degree subgraphs of the lattice — replacing statistical mechanics with graph combinatorics. The strategy is to apply the exact bond identity to every nearest-neighbour pair, expand the resulting product over bonds into a sum over subgraphs (each bond either "in" with weight or "out" with weight ), and then perform the spin trace, which acts as a parity filter. The crucial point to watch is the trace rule : it is what annihilates every graph with an odd-degree vertex, leaving only the closed loops. No approximation is made anywhere; the equality is exact for any .
Step 1. Factor each bond. Using on all bonds, . Why: the factors are spin-independent and pull out; the identity is exact because has only two possible values, both matched by the linear form.
Step 2. Pull out the prefactor. . Why: there are exactly bonds, so the product of over bonds is , independent of the spin configuration.
Step 3. Expand the product into graphs. , where is the edge set. Why: expanding the product, each bond independently contributes either (omitted) or (selected); a choice of which bonds to select is exactly a subgraph , carrying times a product of spins.
Step 4. Trace over spins. For each site, if the degree is even and if it is odd. Why: appears in the graph term raised to the number of selected bonds meeting site ; summing gives for even powers and for odd — an odd-degree site kills the whole term.
Step 5. Keep closed graphs only. The survivors have every even — closed subgraphs (loops and unions of loops) — each contributing from the site-traces, so . Why: only even-degree graphs pass the parity filter; the factor per site multiplies to , and the remaining -weighted sum runs over closed graphs alone. *Verified: setting gives as ; the leading nontrivial closed graph on the square lattice is the elementary plaquette (). The exact bond identity for and the even-degree trace rule are checked symbolically and numerically in verify_high-temperature-expansion.py.*
Go deeper · Derivation B · 2 minLocating the 2D critical point by Kramers–Wannier duality
Here the goal is to fix the exact critical coupling of the square-lattice Ising model without solving the model, by recognizing that its high-temperature loop series and its low-temperature domain-wall series share identical combinatorics. The strategy is to write both series as sums over closed loops — the high- series in the variable , the low- series in — match them term by term, deduce the duality relation between the two couplings, and then impose that the (assumed unique) transition sits at the single self-dual fixed point. What to watch is the assumption of a single transition: duality alone gives a candidate point, and it is the physical input that there is exactly one that promotes it to the critical point.
Step 1. High-temperature loop sum. with ; on the square lattice these closed loops are precisely the boundaries of spin-down domains drawn on the dual lattice. Why: from the graph representation , the interacting part of is a sum over closed loops, and a closed loop on the lattice is a domain-wall configuration on the dual.
Step 2. Low-temperature domain-wall sum. , each wall of length costing ; on the square lattice these are also closed loops. Why: at low the excitations above the ordered state are flipped-spin droplets whose energy is proportional to boundary length, and each boundary is a closed loop of exactly the same kind counted at high .
Step 3. Match the two loop sums. Identical loop combinatorics force , the duality relation between the coupling and its dual . Why: two power series with the same integer loop coefficients are equal as functions once their per-bond weights are identified, which pins .
Step 4. Impose the self-dual condition. A single transition must sit at the fixed point , i.e. , which rearranges to . Why: if the map has one fixed point and there is one transition, the transition can only be at that self-dual coupling.
Step 5. Solve. and . Why: , and back-substituting gives , the exact Onsager value — obtained purely from series duality. *Verified: solves to , , , and — all checked numerically in verify_high-temperature-expansion.py.*
Limiting cases
The behaviour of the expansion variable across the characteristic temperature regimes:
| Case | Result | Meaning |
|---|---|---|
| Infinite temperature | , | Only the empty graph survives; spins independent, . |
| Small coupling | Graph and cumulant variables coincide only at lowest order; conversions matter beyond first order. | |
| Near criticality (2D) | Series radius of convergence; with exactly. | |
| Zero temperature | Far outside the convergence disk; the dual low- (domain-wall) series in is the natural description. |
Worked examples
1 · The 2D square-lattice susceptibility series (confidence builder)
We build the first two nontrivial coefficients of the reduced susceptibility for the square lattice by counting weighted paths, recovering the standard series .
Step 1. The reduced susceptibility is with to leading order, the shortest path length. The term contributes the constant , so .
Step 2. The order- term counts the sites reachable in one step: on the square lattice each site has nearest neighbours, each contributing . So the coefficient of is .
Step 3. The order- term counts length-2 weighted walks from the origin to any site . There are ordered two-step walks; of these, return to the origin (step then reverse) and are excluded from , leaving . Hence the coefficient of is .
Step 4. Collecting terms, , exactly the leading Domb high-temperature series for the square-lattice Ising model. The first ratio is already the coordination number, and higher ratios climb toward — the seed of the Domb–Sykes extrapolation.
2 · The exact 2D critical temperature from self-duality (exam level)
We extract the exact Onsager critical temperature of the square-lattice Ising model from the self-dual condition , and cross-check the loop-variable value .
Step 1. Kramers–Wannier duality maps the high- loop series onto the low- domain-wall series, forcing the self-dual condition . Solve for the coupling: .
Step 2. Numerically , so .
Step 3. The critical temperature is , i.e. — the exact Onsager value.
Step 4. Cross-check the loop variable: , and its inverse is exactly where the Domb–Sykes ratio plot extrapolates. A phase transition the high- series can never actually reach has been pinned exactly — from the series' own combinatorics.
Origins · 1 minSeries expansion and how this was discovered
The series-expansion approach to critical phenomena treats the partition function of a lattice model as a generating function in a small parameter — here — whose coefficients are integers counting lattice graphs, and whose singularity structure encodes the phase transition. Its power lies in being systematic and exact order by order: unlike mean-field theory, no correlations are neglected, so the true critical behaviour is recovered if enough terms are computed. The method was pioneered by Opechowski in 1937 and turned into a precision instrument by Cyril Domb, Martin Sykes, and the King's College London series-expansion school through the 1950s and 60s, who computed high-temperature series to many orders and developed the ratio and Padé-approximant analyses (the Domb–Sykes plot) that extract critical points and exponents. For the two-dimensional Ising model the high-temperature loop series is mapped onto its own low-temperature form by Kramers–Wannier duality, fixing the critical point exactly at ; in three dimensions, where no exact solution exists, long series remain among the most accurate sources of the critical exponents , , and , competitive with Monte Carlo and the renormalization group. The same bond-factorization generalizes to , Potts, and lattice gauge models, where the strong-coupling (high-temperature) expansion demonstrates confinement.
Going further
Texts. Pathria & Beale, Statistical Mechanics, 3rd ed., §13.4 (Ising model, high-temperature expansion). Kardar, Statistical Physics of Fields, Ch. 7 (low- and high-temperature series, duality). Reif, Fundamentals of Statistical and Thermal Physics, Ch. 10. Sethna, Statistical Mechanics: Entropy, Order Parameters, and Complexity, Ch. 8. Domb & Green (eds.), Phase Transitions and Critical Phenomena, Vol. 3 (series-expansion methods). Landau & Lifshitz, Statistical Physics Part 1, §151.
Provenance. Base article: AllQFT track `sm`, "High-Temperature Expansion of Lattice Models" (STAT.INTER.HTEXP.1261); source Pathria & Beale §13.4 and Kardar SPoF Ch. 7. All symbolic and numeric claims re-verified here in verify_high-temperature-expansion.py: the exact bond identity , the even-degree trace rule, the reduced-susceptibility series , the self-dual critical point with , and the leading energy . No base physics error found. The exact 2D solution and duality are handed forward by name to aq-sm-kramers-wannier-duality (Onsager/Kramers–Wannier own the exact solution; this article owns the series route and the estimate).
Prerequisites. Configuration integral · Mayer cluster expansion · Linked-cluster theorem · The Mayer f-function.
Leads to. Kramers–Wannier duality · Critical Exponents and Series Analysis · Cluster integrals.
How can a Taylor series around infinite temperature find a phase transition it can never actually reach?
Because a phase transition is a singularity of the free energy as a function of , and a power series "knows" about the nearest singularity through its radius of convergence. The coefficients of the susceptibility series grow asymptotically like , and is exactly the critical value — even though the series diverges there and cannot be summed beyond it. Analysing how the coefficients grow (their ratios and the subleading corrections) reveals both the location and the exponent of the divergence. So you never step into the ordered phase; you infer the wall from the way the series accelerates toward it.
What is the difference between expanding in βJ and in v = tanh βJ?
They are two reorganizations of the same expansion. The form is the cumulant (moment) expansion: you write and expand in powers of , keeping connected averages in the infinite-temperature ensemble. The form uses the exact bond identity and gives integer graph coefficients directly. They agree at first order, , but differ beyond it because . The variable is preferred for graph counting because its coefficients are clean integers counting lattice loops; the variable is closer to the cumulant/linked-cluster language of aq-sm-cumulant-expansion.
Why does taking ln Z keep only connected closed graphs?
This is the linked-cluster theorem, the same one behind the Mayer cluster expansion for gases. The full closed-graph sum factorizes into independent placements of connected pieces: a general closed graph is a disjoint union of connected loops, and summing over how many copies of each connected loop appear reproduces the exponential of the connected-loop sum. Taking the logarithm therefore strips away the disconnected products and leaves exactly the connected closed graphs. Because a single connected loop lives at one place on the lattice (up to translation), the connected sum is proportional to — which is why , and hence the free energy, is extensive.
Why is v = tanh(βJ) rather than just βJ the natural small parameter?
Two reasons. First, it comes from an exact identity — the bond weight is genuinely , so no information is lost, whereas an expansion in truncates the exponential. Second, stays bounded, , whereas as ; the whole physical temperature range maps into a finite interval, which is exactly what a convergent power series needs. The critical point then sits at a finite , and duality relations (which swap high and low temperature) are simplest in .
Does the high-temperature expansion work for models other than Ising?
Yes, and this is one of its great strengths. The bond-factorization generalizes: for continuous spins one uses a "character expansion" of into orthogonal functions, for -state Potts models a similar decomposition, and for lattice gauge theories a character expansion of the plaquette weight. In every case the trace imposes a parity/closure rule and becomes a graph sum in a small coupling. The gauge case is historically decisive: the strong-coupling expansion produces the area law for the Wilson loop, which is Wilson's demonstration of confinement. The Ising version shown here is the simplest member of a very large family.
What exactly is a Domb–Sykes plot and how does it give v_c and γ?
It is a plot of the successive coefficient ratios of the susceptibility series against . For a power-law singularity , the ratios behave as , so they fall on an approximately straight line whose intercept (at ) is and whose slope fixes . For the 2D square Ising model the intercept extrapolates to and the slope is consistent with the exact . In three dimensions, where no exact answer exists, the same plot (with refinements like Neville tables and differential approximants) yields .
Why do closed graphs correspond to domain walls in the duality argument?
On the square lattice, a closed loop drawn on the bonds of the original lattice is exactly the boundary of a region on the dual lattice — it separates an "inside" from an "outside". In the low-temperature picture, the excitations above the fully ordered ground state are droplets of flipped spins, and each droplet's energy cost is proportional to the length of its boundary, which is itself a closed loop. So the same closed loops are counted twice: once as high-temperature graph contributions weighted by , once as low-temperature domain walls weighted by . Matching the weights, , is the Kramers–Wannier duality, and its fixed point is the critical coupling.