Result 226, Probability and statistical mechanics

The double-dimer loop ensemble converges to CLE4

Resolves the half-plane Temperleyan form of the double-dimer scaling-limit conjecture: the complete loop ensemble formed by two independent dimer coverings of the Temperleyan square lattice converges to nested CLE4. Convergence matches every macroscopic loop as an unparametrized curve, upgrading convergence of loop observables to convergence of the loops themselves.

Proof

The bigger picture

Why it matters

Overlaying two random coverings of a grid produces loops. This work claims that, in a specific half-plane setting, all large loops approach a known continuum random geometry as the grid becomes finer, not merely that selected measurements agree.

What changes?

A dimer covering pairs neighboring lattice sites so each site belongs to exactly one pair; overlaying two independent coverings produces loops. For the square lattice in the upper half-plane with the Temperleyan setup, the manuscript reports convergence to nested CLE4, a continuum random loop ensemble that allows loops inside loops. Convergence holds as the mesh shrinks to zero, without selecting a subsequence, and matches every macroscopic loop as an unparametrized curve: its shape matters, not its traversal speed.

What does that help mathematicians do?

The distinction is between identifying measurements of random loops and identifying the loops themselves. According to the summary, the result upgrades convergence of loop observables to convergence of the complete ensemble. Researchers can therefore use nested CLE4 as the limiting description of macroscopic double-dimer curves in this setting, rather than only as a model consistent with selected statistics. The conclusion remains specific to the half-plane Temperleyan setup.

Are there practical applications?

The immediate value is foundational for probability and statistical mechanics: the claimed limit connects a discrete random covering model to a continuum description of its loop geometry. It provides a precise setting in which lattice spacing can disappear while macroscopic random curves remain identifiable. The supplied material does not establish a computational method or a practical deployment.

This section was generated by GPT-6 Astra Medium. This explanation is based on the result summary and manuscript abstracts below. This context is separate from OpenAI's source text.

Manuscript

The curve scaling limit of half-plane double dimers

September 23, 2026 33 pages

We prove that the complete double-dimer loop ensemble for the Temperleyan square lattice in the upper half-plane converges to nested CLE4. The convergence holds along the full mesh limit and matches every macroscopic loop as an unparametrized curve. This resolves the half-plane Temperleyan form of the double-dimer CLE4 scaling-limit conjecture.

PDF LaTeX source
Cite (BibTeX) 
@misc{OAI:The-curve-scaling-limit-of-half-plane-double-dimers-September-23-2026,
  author = {{OpenAI}},
  title = {{The Curve Scaling Limit of Half-Plane Double Dimers}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/The-curve-scaling-limit-of-half-plane-double-dimers-September-23-2026/paper.pdf}{OAI:The-curve-scaling-limit-of-half-plane-double-dimers-September-23-2026}},
  year = {2026}
}

Data from github.com/openai/math at commit adc7f12, committed October 6, 2026 at 21:58 UTC, last checked for changes about 8 hours ago. Titles, subjects, summaries, abstracts and Lean notes are OpenAI's; page counts are read from the PDFs. The map, related results, search, kinds of results and the named-problem index are Emergent Mind's, built with text embeddings and an LLM, and may contain errors.

An Emergent Mind Labs project. Emergent Mind is not affiliated with OpenAI. None of these results has been peer reviewed. Cite the manuscripts themselves, using the BibTeX on each result's page.