Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Openai 2026 critical strip crossing mass honeycomb lattice
theorem_1_1: The critical strip mass theorem: at the honeycomb critical weight the bridge mass of a strip of N bands is comparable to N^(-1/4), the first rightward displacement moment of arches is comparable to N^(3/4), the arch and bridge masses satisfy an exact identity, and moment increments are comparable to the bridge mass; formally verified here, the prose proof unreviewed.
OpenAI, Critical strip-crossing mass on the honeycomb lattice, OpenAI Math
Release preprint, September 26, 2026. Released under the Apache License 2.0 at
https://github.com/openai/math (revision adc7f1241), folder
preprints/Critical-strip-crossing-mass-on-the-honeycomb-lattice-September-26-2026;
the held PDF, main.pdf in the release, is retained as
openai_2026_critical_strip_crossing_mass_honeycomb_lattice.pdf,
and the release's TeX bundle sits beside main.pdf in that folder.
@misc{OAI:Critical-strip-crossing-mass-on-the-honeycomb-lattice-September-26-2026,
author = {{OpenAI}},
title = {{Critical strip-crossing mass on the honeycomb lattice}},
howpublished = {OpenAI Math Release preprint
\href{https://github.com/openai/math/blob/main/preprints/Critical-strip-crossing-mass-on-the-honeycomb-lattice-September-26-2026/main.pdf}{OAI:Critical-strip-crossing-mass-on-the-honeycomb-lattice-September-26-2026}},
year = {2026}
}Attestation, recorded from the source's own statements and not as this corpus's review: the release's root README says its manuscripts were "produced by an internal OpenAI model", that the collection "includes results at different stages of verification", that "Not all have accompanying Lean formalizations" and that "Some of the unformalized results could have issues". The manuscript's own README carries only the title, the author "OpenAI", the date September 26, 2026 and the citation block above; neither it nor the paper adds a statement on how the text was produced or checked. The paper names no author beyond "OpenAI", no arXiv identifier and no journal. No refereed publication, arXiv version or independent review of the manuscript is recorded here and nothing on this card is independently reviewed.
Formalization, as the release lists it: lean/formalization.yaml does not name
this manuscript. The release's family page does name it, as one of three papers
accompanying the family's formalization, and describes the formalized statement
as the finiteness of the strip sums, the exact arch-bridge balance identity, the
comparison of successive moment increments with the bridge mass, the
monotonicity of the bridge mass, and the two power laws, bridge mass comparable
to and displacement moment comparable to , with constants
uniform in the height. Its comparator link for this result is the statement file
lean/ComparatorChallenges/CriticalStripMass.lean (the proposition
OAI.CriticalStrip.CriticalStripMass, whose six clauses mirror
Theorem 1.1
on paths through the triangles of the tiling, with the solution module
OAI.Combinatorics.StripMass.Main named in the matching .json). The same page
lists HoneycombBridgeFiniteness.lean and HoneycombFreeEnergy.lean for the
two companion papers it names. This listing was read statically from the
release's catalogue; the build of the statement here is recorded below. A Lean
statement about honeycomb strip masses is not a proof of any Erdős problem.
Formal verification here: this corpus's verification built
OAI.CriticalStrip.critical_strip_mass at the release's revision
adc7f1241b42e322a6451854ab7e4b4c146bf78a (2026-10-06) with toolchain
leanprover/lean4:v4.34.1 on 2026-10-08. Its axioms are exactly propext,
Classical.choice and Quot.sound, no sorry appears, and its fingerprint is
identical to the comparator challenge CriticalStripMass.lean. Checked clause
by clause against the manuscript, it certifies
Theorem 1.1
in full: at the weight per visited triangle and for
every strip of bands, the arch kernels, the bridge kernels,
, and are finite,
, ,
, and
, the constants in each positive and
independent of . The prose proof remains unreviewed, and no refereed or
independently reviewed version of the manuscript is known. The theorem concerns
the honeycomb lattice and certifies nothing about Problem 529.
The release groups this manuscript in its family ("The three-quarter exponent for honeycomb self-avoiding walk"), whose catalog abstract claims a fixed-length diameter law for uniform honeycomb self-avoiding walks; this manuscript supplies the strip-crossing mass and displacement-moment exponents, an all-lengths observable, and claims no fixed-length law itself. Two companions are held in this library: Mass and covering exponents for fixed-length honeycomb walks and Renewal and changes of law for critical honeycomb walks. The release lists ten further family members not held here: Radial transfer estimates and polygon length laws for honeycomb walks, Critical honeycomb chords with prescribed boundary endpoints, Cylinder loop weights and planar nesting, Signed cylinder propagation and marked polygons on the honeycomb lattice, Cylinder amplitudes and logarithmic bridge length windows on the honeycomb lattice, Marked polygon correlations and one-arc bounds, Disk transfer representations and confined bridge mass, Polynomial vacuum representations and bridge mass for honeycomb walks, Uniform marked polygon estimates and sharp finite bridge moments and Cap-selected amplitudes and triangle chords for honeycomb walks. How the companions consume this manuscript's results was not read here.
Read status: claims checked for Theorem 1.1 and the definitions it rests on,
and for the statements of Proposition 4.1, Lemma 4.2 and Lemma 5.2, read
clause by clause in the TeX source (sections/01_introduction.tex, lines
11--71; sections/04_arch_formula.tex, lines 46--57 and 177--181;
sections/05_positive_integral.tex, lines 83--103) on 2026-10-07; the proofs
in sections/02_flux_transfers.tex through sections/06_hard_edge.tex and
sections/appendix_local.tex were read for their structure only and no step
was checked; nothing here is independently reviewed.
Contents
The PDF has 29 pages; page numbers below are the PDF's. Theorems, lemmas and propositions share one counter per section.
- Section 1, Introduction (pp. 1--3). Takes the honeycomb lattice as the dual of the tiling by equilateral triangles of side one, with one edge direction horizontal, defines ports (midpoints of boundary edges of a union of triangles), paths between ports (dual edges with the two terminal half-edges, each dual vertex visited at most once, the boundary met only at the endpoints), the length as the number of visited dual vertices, and the critical weight with and , recalling that Duminil-Copin and Smirnov proved to be the honeycomb connective constant. For the strip of bands it defines the arch kernel , the arch mass , the bridge mass and the rightward first moment (display (2), p. 1), then states Theorem 1.1 (p. 2): all sums finite, , , , , and nonincreasing. Section 1.2 (pp. 2--3) recounts Nienhuis's predictions, the Lawler--Schramm--Werner boundary exponent (which predicts the crossing power ), the Duminil-Copin--Smirnov bounds of order and , the decay proved by Beaton, Bousquet-Mélou, de Gier, Duminil-Copin and Guttmann, the Glazman--Manolescu logarithmic bound along a sequence of heights and rhombic invariance, and the Krachun--Panagiotis polynomial bound with quantitative sub-ballisticity; it says in so many words that the fixed-length displacement conjecture is a different observable from . Section 1.3 (p. 3) outlines the route: compute first, then recover from its increments.
- Section 2, Positive flux and finite strip transfers (pp. 3--9). Lemma 2.1 (p. 4), the boundary identity: for a finite simply connected union of triangles with simple polygonal boundary and a boundary port , the sum over boundary targets of with and the total signed turning is one, and for a convex domain the unsigned boundary sum is at most ; proved by the winding cancellation of closed excursions, as in Duminil-Copin and Smirnov. Introduces rhombic tiles with one spectral parameter per row and the weights of Nienhuis's integrable construction at in the Glazman--Manolescu normalization, a planar diagram algebra on vacant and occupied slots, and the two-slot operator . Lemma 2.2 (p. 5): braid relation, factorization for , splitting and unitarity, as identities of rational functions (proof in Appendix A). Defines the cut spaces (noncrossing partial pairings) and (one extra strand tied to an exterior source), the column transfer maps and the source insertions . Lemma 2.3 (p. 7): at parameters in and nearby, the restricted vacuum transfer and the one-source transfer have spectral radius below one, so the vacuum transfer has exactly one stationary vector normalized to empty coordinate one, its entries rational in the ; proved by the decay of crossing masses in long parallelograms via Lemma 2.1. Derives the column exchange, splitting and reflection identities (displays (12)--(14), p. 8), the vacuum exchange and reduction identities, the first-slot formulas at and the sign rule under a shift by .
- Section 3, The polynomial vacuum (pp. 9--13). Defines the scalar Pfaffian (display (18), p. 9) from the kernel with . Lemma 3.1 (p. 9): is symmetric and polynomial, of degree at most in each variable, with leading coefficient in any variable equal to of the others, and satisfies flat, deletion and merge identities; the merge identity is proved by induction and root counting. Lemma 3.2 (p. 10): is a Laurent polynomial with exponents between and , with stated degree forms in the last variable; constructed by Lagrange interpolation at deletion nodes, shown pole-free, and proved stationary by a residual whose degree and occupancy parity force it to vanish. The section cites the dense work of Di Francesco and Zinn-Justin and the dilute work of Garbali and Nienhuis for the method and states that the zero-loop-weight degree and stationarity proofs are its own.
- Section 4, An exact formula for the arch moment (pp. 13--16). Writes the inhomogeneous moment as a gluing pairing of two integrated source vectors (display (27), p. 13). Proposition 4.1 (p. 13), the arch formula: with and , monic of degree for generic , ; proved by matching the merge, deletion and flat reductions of both sides, a degree bound for from a north-source limit, and interpolation at roots. At the physical list this gives as a removable limit (display (32), p. 15). Lemma 4.2 (p. 15): $c\mathcal A_N+\mathcal B_N=1$, nonincreasing, and uniformly; proved through a stepped strip with one side port and the exact identity (display (34), p. 16), the lower bound and an upper bound from consecutive interface pairings.
- Section 5, A positive integral for the homogeneous moment (pp. 17--20). Lemma 5.1 (p. 17), missing harmonics: the auxiliary polynomial of degree has the form with . Lemma 5.2 (p. 18): the homogeneous monic problem has a unique solution, the limit of as all , and equals for the ordered law with density proportional to on , ; proved by Cauchy-transform moment equations and the strict positivity of a Cauchy bimoment determinant (the argument of Bertola, Gekhtman and Szmigielski, with the finite determinant computed in the text).
- Section 6, The smallest coordinate and the strip exponent (pp. 21--25). The two-sided bound $\mathbb Ey_1^{-1/4}\lesssim m_N\lesssim\mathbb E(\sum_iy_i^{-1})^{1/4}$ (display (48), p. 21). Lemma 6.1 (p. 21): positive association for the ordered pair kernel with positive smooth one-variable weights on an interval in and a finite normalizer, with the stochastic-order comparison under monotone likelihood ratios, by a direct conditioning proof (the continuous MTP principle is cited for context). Lemma 6.2 (p. 22): the generalized Bures--Laguerre normalizer in closed form via Schur's Pfaffian identity and de Bruijn's integration formula, a lower bound, uniform in , on the probability that the largest coordinate is at most , a small-coordinate tail bound, and the three inverse-moment estimates at , and . The completion of the proof of Theorem 1.1 (pp. 24--25) compares the target law with the law (upper bound, after conditioning on ) and the law (lower bound, after ) to get , then extracts from Lemma 4.2 by summing increments and choosing a fixed ratio of heights.
- Appendix A, Local coefficient identities (pp. 25--27). Proves Lemma 2.2 by tabulated coefficient checks of the splitting identity, the unitarity relations in the one-strand and even sectors, and the braid relation by interpolation in at five values, with the product-to-sum identities listed.
- References (pp. 27--29), among them Baik and Rains 2001; Beaton, Bousquet-Mélou, de Gier, Duminil-Copin and Guttmann 2014; Bertola, Gekhtman and Szmigielski 2010; de Bruijn 1955; Di Francesco 2005; Di Francesco and Zinn-Justin 2005; Duminil-Copin and Smirnov 2012; Forrester and Kieburg 2016; Garbali and Nienhuis 2017; Glazman 2015; Glazman and Manolescu 2020; Grimm and Pearce 1993; Ikhlef and Cardy 2009; Ishikawa, Okada, Tagawa and Zeng 2006; Krachun and Panagiotis 2026; Lawler, Schramm and Werner 2004; Nienhuis 1982 and 1990.
External inputs the proofs rest on, taken at statement level and not checked here: the turning-number theorem for simple closed curves (Lemma 2.1); the Cauchy determinant and Cauchy's integral formula (Lemma 5.2); Schur's Pfaffian identity in the form of Ishikawa, Okada, Tagawa and Zeng, equation (1.2), and the de Bruijn determinant-Pfaffian integration formula as stated by Baik and Rains, Theorem 6.1 (Lemma 6.2); gamma-function and gamma-tail estimates and Jensen's inequality (Lemma 6.2). The integrable weights are taken from Nienhuis 1990 as definitions, and the manuscript proves the identities it uses for them in Appendix A rather than citing them; it also reproves the boundary identity, the bimoment positivity and the association principle in its own setting. The manuscript flags nothing as unproved, numerical, computer-assisted or conditional; the constants in every are unspecified. The release folder holds no verification directory for this manuscript.
Bears on
- Problem 529: comparison and background only; the manuscript does not address the exact question. The page asks about the expected endpoint distance of a uniform -step self-avoiding walk on : whether and whether for . Theorem 1.1 is set on the honeycomb lattice, weights every path by over all lengths at once instead of fixing , and measures a strip-crossing mass and a displacement moment whose scale is the strip height; the manuscript itself says the fixed-length displacement conjecture is a different observable, and it names no Erdős problem. The manuscript ties its to the predicted boundary exponent and itself separates the moment law from the fixed-length conjecture; the release groups it in a family whose abstract claims the fixed-length diameter law held on the companion cards above. Nothing on this card transfers to . The theorem is formally verified here but answers neither question; the page's status rests on acceptance evidence, not on this card.