The double-dimer loop ensemble converges to CLE₄

Loops from two overlaid random domino tilings of the half-plane converge, as curves, to nested CLE₄.

1 paper September 23, 2026 Explained by AI

Lay two independent random domino tilings on top of each other. Where they differ, the dominoes form closed loops. Physicists predicted that these loops, zoomed out, follow a known random family called CLE₄. This paper claims to prove that, for the upper half-plane, matching every large loop as an actual curve. No computer proof checker has checked it.

First step

2011

Kenyon and Wilson, double-dimer boundary pairings matching Gaussian free field contour lines

Significance

Major

If it holds, it settles the half-plane Temperleyan form of the double-dimer CLE₄ conjecture.

Trust

Claimed, not checked

Field

Probability and statistical mechanics

1 paper

The explanation

Tile a 2-by-2 square with two dominoes. There are two ways: both flat or both upright. Now pick two tilings at random, independently, and lay one over the other. Half the time they agree, and every domino is doubled. Half the time they differ. Then the four dominoes join into one closed loop around the square. A domino tiling is also called a dimer covering, a perfect matching of neighbouring cells. Overlaying two of them always gives doubled dominoes and closed loopsSource 1.

Bigger regions have many more tilings. A 4-by-4 square has 36. An 8-by-8 board has 12,988,816. Kasteleyn, and Temperley and Fisher, found exact formulas for these counts in 1961. Overlay two random tilings of a big region, and you get a whole nested family of loops of every size.

The prediction is that these loops have a conformally invariant limit, the conformal loop ensemble CLE₄Source 2. CLE₄ is a random family of non-crossing loops. It is built here from a Brownian loop soup, a random scatter of Brownian loops. Nested means the same law repeats inside every loopSource 3.

Earlier work got close without reaching the curves. Kenyon proved that dimer height fluctuations tend to the Gaussian free field, a standard random landscape. That alone does not give the loops as curvesSource 4. Kenyon and Wilson matched the boundary pairing probabilities, leaving convergence of the paths openSource 5. Dubédat, then Basok and Chelkak, Bai and Wan, and Basok and Izyurov, matched topological data. Those results describe which marked points each loop surrounds.

This paper claims the full curve limit in the upper half-plane. It uses the standard Temperleyan law, a specific way of building the tilings from coarse-grid polygons with one corner removedSource 6. Every large loop is matched to a CLE₄ loop as a curve, along the full limit of shrinking meshSource 7. The paper says this resolves the half-plane Temperleyan form of the double-dimer CLE₄ conjectureSource 8.

The obstacle is the gap between topology and geometry. Knowing which points a loop surrounds does not control thin excursions, retraced pieces, or a trace run over twiceSource 9. A long thin finger may surround none of the chosen points. The paper adds two geometric estimates in a rectangleSource 10. One bounds how many times loops cross a strip. The other rules out a crossing being cancelled by a hidden return path. Both come from a transfer matrix, which counts tilings one column at a time.

The claim has limits. It covers the upper half-plane with the Temperleyan construction. It says nothing about general bounded domains in this form.

How sure is this? No Lean formalization is listed for this paper in the openai/math release. So no computer proof checker has checked it. No specialist review has been published.

What it doesn't show. This does not cover general bounded domains, or domino tilings that are not Temperleyan.

Where it came from

This result comes from an unreleased OpenAI model, published in the openai/math release on 6 October 2026.

Hype check

Major if it holds. It settles one stated form of the conjecture, but no Lean formalization is listed and no specialist review is published.

Words used

Dimer covering: A tiling of a region by dominoes, equivalently a perfect matching of neighbouring cells.
Double-dimer loops: The closed loops formed where two overlaid domino tilings disagree.
Temperleyan: A standard way of building the region, from a coarse-grid polygon with one boundary corner removed.
CLE₄: Conformal loop ensemble with parameter 4: a random family of non-crossing loops with a conformal symmetry.
Brownian loop soup: A random scatter of closed Brownian paths of all sizes, used to build CLE.
Gaussian free field: The standard random landscape in two dimensions, with heights correlated like minus the log of distance.
Transfer matrix: A matrix that counts configurations one column at a time.

The original paper

The curve scaling limit of half-plane double dimers (PDF, opens in a new tab)
September 23, 2026

All quoted lines (10)

Almost surely their superposition consists of doubled edges and finite simple even cycles; see also.
The curve scaling limit of half-plane double dimers Back to text
For the square lattice, the predicted limit is the conformal loop ensemble with parameter $4$ .
The curve scaling limit of half-plane double dimers Back to text
Nested $\CLE_4$ means an ordinary nonnested $\CLE_4$ , followed recursively by conditionally independent copies inside every loop.
The curve scaling limit of half-plane double dimers Back to text
That field limit motivates the connection with $\CLE_4$ , but does not by itself give convergence of loop curves: passing from a distribution-valued field to its interfaces requires additional control.
The curve scaling limit of half-plane double dimers Back to text
This identifies the boundary pairings, while leaving convergence of the paths open.
The curve scaling limit of half-plane double dimers Back to text
To specify its infinite-volume law, start with a simple lattice polygon in the coarse grid $(0,\delta)+2\delta\mathbb Z^2$ , retain the fine-grid vertices and edges in its closure, and delete one coarse boundary vertex, called the root.
The curve scaling limit of half-plane double dimers Back to text
The convergence holds along the full mesh limit and matches all macroscopic loops as curves.
The curve scaling limit of half-plane double dimers Back to text
This resolves the half-plane Temperleyan form of the double-dimer $\CLE_4$ scaling-limit conjecture.
The curve scaling limit of half-plane double dimers Back to text
The distinction between geometric and topological convergence is important here: knowing which punctures a loop surrounds does not control thin excursions, invisible retraced pieces, or repeated traversal of a limiting trace.
The curve scaling limit of half-plane double dimers Back to text
The new input consists of two geometric estimates in a corner-rooted Temperleyan rectangle.
The curve scaling limit of half-plane double dimers Back to text

Other sources

231The free uniform spanning forest is a factor of IIDProbability and statistical mechanics
218Conformal universality for weakly interacting and random-bond Ising modelsProbability and statistical mechanics
211The geometric phase diagram, diffusion, and spectra of random planar mapsProbability and statistical mechanics
225Gaussian free field limits throughout the balanced six-vertex regimeProbability and statistical mechanics
227Critical SK autocorrelation processes and dynamics across the temperature transitionProbability and statistical mechanics

Browse Probability and statistical mechanics Open since the 2010s Claimed, not yet checked

The double-dimer loop ensemble converges to CLE4