OpenAI claim summary for Math-180
mathematicsTop Open Problemscontributionliterature_reportClaim: literature report
Summary of a claim published in openai/math; not a claim by this platform.
The interface theorem proves full-sequence Dobrushin SLE and nested CLE convergence for 1<=q<=4 on square-lattice Jordan approximations; the problem statement target also includes 0<q<1, so this paper alone does not cover the full parameter range. The cited theorem proves joint curve/occupation-measure convergence for critical square-lattice FK interfaces with 1<=q<4; forgetting the measure gives that subrange of our interface target, but not q<1 or q=4. The cited theorem proves the square-lattice Dobrushin FK interface SLE limit for each 0<q<1; our range includes 1<=q<=4, which this individual manuscript does not prove. The interface theorem proves chordal SLE and nested CLE limits for the critical square-lattice FK model only for 1<=q<4; our intended FK range is 0<q<=4, so q<1 and the endpoint q=4 are omitted at manuscript level. This entry records partial support; complete coverage of the question is not established by this catalogue.
Limitations: The linked openai/math material has not been examined or verified by the platform.
Manuscript
Contents
Conformal Invariance of the Critical Random-Cluster Model with q <= 4
OpenAI's claim
The linked manuscripts present the following claims by OpenAI: The later interface theorem extends the square-lattice FK claim through $q=4$, with the same SLE parameter relation and a separate complete nested-loop limit; For $1\leq q<4$, the rescaled edge-counting measure of the critical square FK interface is claimed to converge with the curve to its SLE Minkowski-content measure; For $0<q<1$, the self-dual square-lattice FK interface is claimed to converge to chordal SLE with $\kappa=4\pi/\arccos(-\sqrt q/2)$ in smooth Jordan domains; For $1\leq q<4$, critical square-lattice FK interfaces are claimed to converge as curves to the predicted SLE, with a separate convergence theorem for the complete nested plane CLE collection. Together they provide the following support within the scopes described below.Mathematical statement of the claimed result
Result 1.
Fix $q\in[1,4]$, $p_q=\sqrt q/(1+\sqrt q)$, and \[ \kappa(q)=\frac{4\pi}{\arccos(-\sqrt q/2)}. \] Use the square-lattice random-cluster law with edge-subset weights $p_q^{|A|}(1-p_q)^{|E|-|A|}q^{k_\xi(A)}$, where $\xi$ wires one boundary arc and leaves the other free. For a bounded Jordan domain with two marked boundary points, approximate its boundary uniformly by simple lattice polygons, preserving the marks. The claim gives \[ \eta_n\ \Longrightarrow\ \operatorname{SLE}_{\kappa(q)} \] for the Dobrushin interface in uniform curve distance modulo increasing reparametrization. Under the free infinite-volume law, its full nested loop collection satisfies \[ \Gamma_\delta\ \Longrightarrow\ \text{nested whole-plane }\operatorname{CLE}_{\kappa(q)} \] in the spherical matching topology: all loops above a shrinking diameter threshold are matched with shrinking uniform spherical error. Both limits hold along every mesh sequence, with $q$ fixed.Result 2.
Fix $q\in[1,4)$, $p_q=\sqrt q/(1+\sqrt q)$, $\kappa=4\pi/\arccos(-\sqrt q/2)$, and $d=1+\kappa/8$. On mesh $1/n$ in $D=(0,1)^2$, use critical FK weights and wired/free boundary arcs between $(0,0)$ and $(1,1)$. Let $\eta_n$ be the oriented Dobrushin strand, and $z_{n,j}$ its medial-edge traversal midpoints, counting boundary traversals but not terminal half-edges. With $\Pi$ the coordinatewise projection onto $[0,1]^2$, the source claims a constant $c(q)>0$ such that \[ ([\eta_n],c(q)n^{-d}\sum_{j=1}^{N_n}\delta_{\Pi(z_{n,j})}) \Longrightarrow([\eta],\mu_\eta). \] Here $\eta$ is chordal $\operatorname{SLE}_\kappa$, curves retain order modulo increasing reparametrization, and measures converge weakly on $\overline D$. The limiting content measure is the weak limit of $r^{d-2}\Pi_*[\mathbf1_{\{\operatorname{dist}(z,\eta)<r\}}dA(z)]$, using whole-plane area. The two limit coordinates belong to the same random curve.Result 3.
For fixed $q\in(0,1)$, use square-lattice FK edge-subset weights at $p=\sqrt q/(1+\sqrt q)$, with one boundary arc wired and the other free. Choose a bounded domain $D$ whose Jordan boundary is smooth, and choose different marked boundary points $a,b$. Approximate it by simple closed nearest-neighbor polygons whose boundary parametrizations converge uniformly, and whose marked cyclic parameters converge. The source claims \[ \eta_\delta\Longrightarrow\operatorname{SLE}_\kappa(D;a,b),\qquad \kappa=\frac{4\pi}{\arccos(-\sqrt q/2)}\in(6,8), \] for the Dobrushin medial strand, along the entire mesh sequence, in uniform curve distance modulo increasing reparametrization. The theorem's domain assumption is smooth boundary, rather than every Jordan domain.Result 4.
Fix $1\le q<4$, $p_q=\sqrt q/(1+\sqrt q)$, and $\kappa(q)=4\pi/\arccos(-\sqrt q/2)$. The square-lattice critical random-cluster model is claimed to satisfy two limits: its wired/free Dobrushin strand in any marked bounded Jordan domain converges to chordal $\operatorname{SLE}_{\kappa(q)}$; the complete interface loop collection under the free infinite-volume law converges to nested whole-plane $\operatorname{CLE}_{\kappa(q)}$. The first uses uniformly convergent marked simple-polygon boundary parametrizations and uniform curve distance modulo increasing reparametrization. The second uses spherical matching of all loops of diameter exceeding a shrinking threshold, retaining every nesting level. The result is for fixed $q<4$; it asserts no uniformity as $q\to4$.Outline of the argument
The tiled comparison and angular-transfer method is supplemented by endpoint estimates at $q=4$. Boundary current tests identify the driving process, while full exploration and localization retain macroscopic loops; at $q=1$ this also yields the bond-percolation crossing formula. Row slicing and angular electric spectra determine Coulomb correlations with quantitative remainders. A two-arm outward coupling fixes the single-edge amplitude, and integrated correlation bounds identify the occupation measure and its total mass with one deterministic normalization.Finite connection and boundary-partition comparisons replace positive-association arguments that fail below one. Sector decay localizes irregular tiled disks, and angular transfer gives a boundary observable determining the Loewner law along the full mesh sequence. Positive tiled laws and short-distance comparisons localize the interface in irregular disks. Angular transfer modes and a four-boundary-change current observable identify the Loewner driver; exploration iteration then matches the nested loops, retaining their multiplicities and traversal structure.
Formal verification
Family 223 has no Lean scope page in this release. Its selected result is not presented as formalized. This site has not executed the Lean code. The scope descriptions do not certify the remaining manuscript arguments.Status caveat
OpenAI attributes these manuscripts to work by an internal model. Its release cautions that arguments without formalization can contain mistakes. This catalogue has not independently checked the proofs; the labels report the mathematical claims attributed to OpenAI.Sources
- OpenAI, Conformal Limits of Critical Square-Lattice Random-Cluster Interfaces, 2026-10-05; citation key
OAI:Conformal-Limits-of-Critical-Square-Lattice-Random-Cluster-Interfaces-October-5-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: intro:main. - OpenAI, Natural Occupation Measures for Critical Square-Lattice FK Interfaces, 2026-10-05; citation key
OAI:Natural-Occupation-Measures-for-Critical-Square-Lattice-FK-Interfaces-October-5-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: thm:main. - OpenAI, Self-dual random-cluster interfaces below one, 2026-09-23; citation key
OAI:Self-dual-random-cluster-interfaces-below-one-September-23-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: thm:main. - OpenAI, Square-lattice FK interfaces and nested loops for 1$\leq$q<4, 2026-09-23; citation key
OAI:Square-lattice-FK-interfaces-and-nested-loops-for-1-leq-q-lt-4-September-23-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: intro:main. - OpenAI catalogue entry.