Math 2.0

Statistical mechanics, structure of matter Percolation and random geometry Theorem

Duminil-Copin–Smirnov theorem

Builds on Connective constantSelf-avoiding walk

Statement

Let ℍ\mathbb H be the hexagonal lattice, the infinite planar graph in which every vertex has degree 33 and every face is a regular hexagon. Then the connective constant of ℍ\mathbb H is μ(ℍ)=2+2.\mu(\mathbb H) = \sqrt{2 + \sqrt 2}.

Remarks

Bernard Nienhuis predicted this value in 1982 with the Coulomb gas method. Hugo Duminil-Copin and Stanislav Smirnov proved it in a paper published in 2012.

Idea of the proof: let xc=1/2+2x_c = 1/\sqrt{2 + \sqrt 2}, and let Z(x)=∑γx∣γ∣Z(x) = \sum_{\gamma} x^{\abs{\gamma}} be the generating function of self-avoiding walks from a fixed point, where ∣γ∣\abs{\gamma} is the length of γ\gamma. The radius of convergence of ZZ is 1/μ1/\mu, so the claim is that Z(x)<∞Z(x) < \infty for x<xcx < x_c and Z(xc)=∞Z(x_c) = \infty. The proof uses a parafermionic observable, a sum over walks in a domain weighted by xc∣γ∣x_c^{\abs{\gamma}} and by a complex phase given by the winding of γ\gamma. At x=xcx = x_c this observable satisfies a discrete form of half of the Cauchy–Riemann equations, around every vertex. Summing these relations over a trapezoidal domain gives a linear identity between walks ending on the different sides, from which both bounds follow.

Example of the statement at work: since cn≥μnc_n \ge \mu^n for all nn, the number of self-avoiding walks of nn steps from a vertex of ℍ\mathbb H is at least (2+2)n/2≈1.848n(2 + \sqrt 2)^{n/2} \approx 1.848^n.

Going deeper

For a student

The connective constant is not universal: it depends on the lattice, unlike critical exponents. The hexagonal lattice is special because of a discrete holomorphic structure at xcx_c, the same kind of structure that appears in Smirnov's proof of Cardy's formula. The theorem was a first rigorous confirmation of the Coulomb gas predictions for the self-avoiding walk. The critical exponents of the self-avoiding walk in the plane, such as the growth cn≈μnn11/32c_n \approx \mu^n n^{11/32}, are still not proved.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Connective constant concept
  2. Self-avoiding walk concept
  3. Duminil-Copin–Smirnov theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Connective_constant
About this page
TagFRNXHYX2SH
URIm2://FRNXHYX2SH
Kindstatement, theorem
WritingW0 stub
MSC82B41, 05A16
StatusThis copy of the site has no build data. Run m2 status FRNXHYX2SH.
AboutConnective constant
UsesConnective constant, Self-avoiding walk
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.