Critical honeycomb strip mass and displacement moment
Lean is a language for mathematical statements and proofs that a computer can verify. This page shows one statement file from OpenAI’s release, possible paper matches and independent reports. The code-like names below identify the definitions or theorems selected by the proof-verification settings.
Theorem selected for verification:OAI.CriticalStrip.critical_strip_mass
The lines of the Lean statement that state the theorem, then the definitions in the file that it uses.
defCriticalStripMass : Prop := (∀ N : ℕ, 1 ≤ N → StripSumsFinite N) ∧ (∀ N : ℕ, 1 ≤ N → c * archMass N + bridgeMass N = 1) ∧ Comparable (fun N => moment (N + 1) - moment N) bridgeMass ∧ Comparable moment (fun N => (N : ℝ) ^ (3 / 4 : ℝ)) ∧ Comparable bridgeMass (fun N => (N : ℝ) ^ (-(1 / 4) : ℝ)) ∧ (∀ N : ℕ, 1 ≤ N → bridgeMass (N + 1) ≤ bridgeMass N)⋮theoremcritical_strip_mass : CriticalStripMass := bysorry
A Lean statement states the theorem and leaves its proof as sorry on purpose. OpenAI’s proof is in a separate solution module, and a program called Comparator checks that proof against this statement.
Definitions needed to read it
Local definitions the statement names, followed through the definitions they name in turn. The match is by name in the source text, so a name reached only through notation can be missed; the full file is below.
defComparable (f g : ℕ → ℝ) : Prop := ∃ lo hi : ℝ, 0 < lo ∧ 0 < hi ∧ ∀ N : ℕ, 1 ≤ N → lo * g N ≤ f N ∧ f N ≤ hi * g N
Possible paper match, with no recorded review
Atlas selected this possible match by comparing words in the Lean statement with every statement in the family. No review of whether the statements mean the same thing is recorded.
Words of the Lean statement, its names split into words, that also appear in the theorem: strip, 1/4, 3/4, finite, critical, integer and mass. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: constants.
Statements in Critical strip-crossing mass on the honeycomb lattice come first because the release’s name for this Lean statement shares words with that paper’s title.
Theorem 1.1 of Critical strip-crossing mass on the honeycomb lattice
Theorem(Critical strip mass)
For every integer N\ge1, all sums in (eq:01-strip-quantities) are finite. With constants independent of N,
For every integer $N\ge1$, all sums in
\eqref{eq:01-strip-quantities} are finite. With constants independent of
$N$,
\begin{equation}
c\mathcal A_N+\mathcal B_N=1,\qquad
m_{N+1}-m_N\asymp\mathcal B_N,\qquad
m_N\asymp N^{3/4},\qquad
\mathcal B_N\asymp N^{-1/4}.
\end{equation}
Moreover, $\mathcal B_N$ is nonincreasing in $N$.
Other possible paper matches, closest wording first
Proposition 11.1 of Cylinder amplitudes and logarithmic bridge-length windows on the honeycomb lattice. Words of the Lean statement, its names split into words, that also appear in the theorem: triangles, summed, bridges, weighted, finite, critical and two more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: displacement, lattice and height.
Theorem 1.1 of Cap-selected amplitudes and triangle chords for honeycomb walks. Words of the Lean statement, its names split into words, that also appear in the theorem: triangle, adjacent, weighted, 3/4 and critical. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: avoiding, self and walks.
Proposition 4.7 of Mass and covering exponents for fixed-length honeycomb walks. Words of the Lean statement, its names split into words, that also appear in the theorem: moment, arch, strip, rho and bridge. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: height.
Theorem 1.1 of Polynomial vacuum representations and bridge mass for honeycomb walks. Words of the Lean statement, its names split into words, that also appear in the theorem: paths, strip, 1/4, bridge, finite, length and two more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: horizontal and height.
Proposition 2.1 of Critical honeycomb chords with prescribed boundary endpoints. Words of the Lean statement, its names split into words, that also appear in the theorem: kernel, comparable, summed, arches, adjacent, paths and eight more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: monotonicity, comparison, crossings and total.
Proposition 4.1 of Renewal and changes of law for critical honeycomb walks. Words of the Lean statement, its names split into words, that also appear in the theorem: moment, arch, path, strip, 1/4, bridges and five more. Shared only with the release’s name for the Lean statement or OpenAI’s note on it: self, avoiding, horizontal, first and heights.
How Atlas selects possible matches: it compares words in the Lean statement with every statement in the family. It also splits Lean names into words. The release’s label and note receive less weight; a main theorem wins a close match. If the Lean wording yields no clear match, Atlas uses the catalogue description. This selects passages to compare; it does not establish that they mean the same thing.
Reported Comparator runs
two independent groups report that Comparator accepted runs for this Lean statement file: Carlos Toledo’s cert-machine; MathVet. Each group reports its own Comparator run for this statement file. Atlas has not repeated the runs.
For a configured theorem, Comparator tests whether OpenAI’s proof proves the exact Lean statement. Some files instead configure definitions for comparison by name and type. Acceptance does not establish that the statement means the same thing as the paper’s theorem.
Every Comparator challenge re-run on Linux with nanoda switched on, decided by a preregistered rule; every family’s challenge statements read against OpenAI’s headline, clause by clause. Decider: Comparator (leanprover/comparator d03acab1 = tag v4.34.0, built with the release’s toolchain v4.34.1), lean4export 076e8e57, landrun 811cfff5, nanoda_lib 3a240721 — on GitHub’s Linux runners (.github/workflows/openai-math-kernel.yml), one j…
AcceptedTheir term: “CERTIFIED”.
Re-run through Comparator with the independent nanoda kernel switched on: Lean’s kernel and nanoda both accept OpenAI’s solution.
An independent, model-assisted, pre-referee reading of each family’s challenge statements against its headline claim under a published rubric (PROTOCOL.md), with its own Comparator runs per challenge. Its protocol describes a planned error-rate study; this import does not establish that the study has been completed.
AcceptedTheir term: “comparator-sandboxed-pass”.
Re-run through Comparator in a sandboxed virtual machine: accepted.
If Comparator is run under this configuration and accepts, the solution proves the configured theorem using only the allowed axioms, and the Lean kernel accepts every step.
This configuration lists no definition holes, so every definition the statement uses is compared as it is written in this file.
Acceptance leaves open whether the Lean statement means the same thing as the paper’s theorem, whether the paper’s other claims are correct, and whether the result is new. Those questions require comparing the definitions and statements, reviewing the paper’s arguments, and reading the earlier literature.
Do family 237’s Lean statements express the advertised result?
These assessments compare all the family’s Lean statements with the whole result OpenAI describes in its catalogue. They do not assess this statement alone. Each group uses its own published rules.
Neither group finds that the Lean statements express or imply the whole advertised result. They describe what the statements express in different terms.
Finds a supporting or a different result statedTheir term: “supporting-only”.
The challenge statements state a lemma or auxiliary result, not the headline. Their record
Their note: The four challenges are analytic inputs, not the headline: finiteness of the critical bridge sums and first-length moments at every strip height (HoneycombBridgeFiniteness), the strip estimates B_N ≍ N^{-1/4}, arch moment ≍ N^{3/4}, c*A_N+B_N=1 (CriticalStripMass, with the bridge-mass bound restated for h>=0 in HoneycombBridgeMassSupport), and existence of the force-tilted free-energy limit (HoneycombFreeEnergy). None mentions the uniform measure on n-step self-avoiding walks, their diameter, local mass or covering numbers, or any probability bound, so the headline theorem (diameter between n^{3/4-delta} and n^{3/4+delta} with probability at least 1-C n^{-k}) is not stated.
Definitions the group asks readers to compare with the paper: rho / kappa / criticalActivity: the four files use 1/sqrt(2+sqrt 2), (2cos(pi/8))^-1, (2+sqrt 2)^(-1/2) and (sqrt(2+sqrt 2))^-1, all equal to the honeycomb critical activity x_c (2cos(pi/8) = sqrt(2+sqrt 2)); a fixed concrete constant, standard ; Triangle (CriticalStripMass) / Vertex (BridgeFiniteness, FreeEnergy) / Center (BridgeMassSupport): the honeycomb lattice realised as up/down triangles of the triangular tiling with the same three-neighbour adjacency up(i,j) ~ down(i,j), down(i,j-1), down(i-1,j); CriticalStripMass uses rows in N (half-plane with a bottom wall), the others rows in Z; concrete lattice, standard ; CriticalStripMass.moment: sum over k >= 1 of k*K(k), a one-sided first displacement moment of arches (the paper's m_N); an unnormalised sum over all path lengths, not the displacement of a fixed-length walk ; CriticalStripMass: lambda, d, C, eta are defined but unused by the statement; tsum is 0 for non-summable families, guarded by the explicit StripSumsFinite conjunct ; HoneycombBridgeFiniteness.InLogCorridor / ConfinedBridgePath: confinement |x| <= h*(log h)^2 restricts to a finite vertex set for each h, so the three confined summability conjuncts are automatic (log 1 = 0 forces x = 0 at h = 1, so no bridge is confined there); the paper's content for the corridor (exponents unchanged) is not stated ; HoneycombBridgeFiniteness.FiniteBridgeSums: purely qualitative summability for each h >= 1, no rates; the normalised conjuncts divide by bridgeMass h / confinedMass h (Lean x/0 = 0, harmless here) ; HoneycombBridgeMassSupport.bridgeMass: ENNReal-valued tsum with B_0 := 1 by an if; Port and Port.position are defined but unused; the theorem's docstring says 'Trusted reference hole only; missing necessary main obligation' ; HoneycombFreeEnergy.freeEnergy: limUnder atTop (logPartition ..), a junk-valued limit, so logPartition_tendsto is exactly 'the limit exists'; e : C is not required to be a unit vector and s : R may have either sign (more general than the paper's unit e, s >= 0)
Finds a supporting or a different result statedTheir term: “DIFFERENT”.
The challenge statements state a different theorem from the headline. Their record
Their note: The headline (diameter n^{3/4+o(1)} and mass/covering exponent 4/3 for uniform fixed-length honeycomb SAW, the content of 'Mass-and-covering-exponents-for-fixed-length-honeycomb-walks') is stated by no challenge. The four challenges state ingredients from other manuscripts of the family: finiteness of critical bridge sums, existence of the forced free energy, the strip-crossing mass ≍ N^{-1/4} with displacement moment ≍ N^{3/4}, and strict-bridge mass ≍ (1+h)^{-1/4}. None implies the headline and the headline implies none of them.
OpenAI’s own note on what this Lean statement covers
“For critical self-avoiding walks on the honeycomb lattice, the formalization proves that the total weight of paths crossing a strip of height $N$ is comparable to $N^{-1/4}$, while the first horizontal-displacement moment of return paths is comparable to $N^{3/4}$. It also proves finiteness of the strip sums, the exact arch–bridge balance identity, comparison of successive moment increments with bridge mass, and monotonicity of bridge mass. The comparison constants are uniform in the strip height.”
An AI agent drafted an interpretation of that note, classifying this statement as “states a paper’s theorem as the paper does”. No human review of the draft is recorded.
Supporting material
The complete Lean statement file
82 lines, copied from release version fd4aeeb. A name defined in this file links to its line; pointing at the name shows its definition.
Declared in this fileOpenAI’s library at fd4aeebOther linked names open the current documentation for Mathlib, Lean’s mathematical library.
Links in the file: 46 to its own declarations, 22 to Mathlib’s documentation. 22 declared names also link to the same declaration in OpenAI’s library. OpenAI uses Mathlib version d13f23b. The linked documentation describes the current version, so names that have since changed may be missing there.
As the integer layer height $h$ tends to infinity,
\[
b_h=h^{-1/4+o(1)},\qquad
\ell_h=h^{13/12+o(1)},\qquad
\mathbb E_h|\gamma|=h^{4/3+o(1)}.
\]
All three sums are finite. These exponents are unchanged if the paths
are also confined to horizontal distance $h\log^2h$ from their initial
port.
Theorem(Hexagon visits)
The mass normalizing \mathbb P_R is R^{3/4+o(1)}. Uniformly at vertices in the concentric hexagon of side R/3,
\mathbb P_R(v\in\gamma)=R^{-2/3+o(1)}.
The corresponding upper bound holds at every vertex, and \mathbb E_R|\gamma|=R^{4/3+o(1)}.
The mass normalizing $\mathbb P_R$ is $R^{3/4+o(1)}$. Uniformly at
vertices in the concentric hexagon of side $R/3$,
\[
\mathbb P_R(v\in\gamma)=R^{-2/3+o(1)}.
\]
The corresponding upper bound holds at every vertex, and
$\mathbb E_R|\gamma|=R^{4/3+o(1)}$.
Proposition(Mixed exits)
The conditioned event has unnormalized mass h^{-1/4+o(1)} and first-length mass h^{13/12+o(1)}. Hence its normalized mean length is h^{4/3+o(1)}. Restricting horizontal distance to h\log^2h preserves these exponents. The total first-length mass of all exits, without the height condition, is at most h^{13/12+o(1)}.
The conditioned event has unnormalized mass $h^{-1/4+o(1)}$ and
first-length mass $h^{13/12+o(1)}$. Hence its normalized mean length is
$h^{4/3+o(1)}$. Restricting horizontal distance to $h\log^2h$ preserves
these exponents. The total first-length mass of all exits, without the
height condition, is at most $h^{13/12+o(1)}$.
Theorem(Normalized separator pairing)
For every compact set K\subset\{s\in\mathbb C:|\Im s|<\pi\} there is C_K<\infty such that, for all n\ge1 and s\in K,
There is a disk about \eta=0, independent of n, in which F_n has no zeros. For each fixed k, the order-k Taylor coefficient of \log F_n at zero is O_k(1+\log n). At the positive fugacity two,
For every compact set $K\subset\{s\in\mathbb C:|\Im s|<\pi\}$ there
is $C_K<\infty$ such that, for all $n\ge1$ and $s\in K$,
\[
|F_n(2\cosh s)|\le
C_K n^{1/6+2\Re(s^2)/(3\pi^2)}.
\]
There is a disk about $\eta=0$, independent of $n$, in which $F_n$ has
no zeros. For each fixed $k$, the order-$k$ Taylor coefficient of
$\log F_n$ at zero is $O_k(1+\log n)$. At the positive fugacity two,
\[
F_n(2)=n^{1/6+o(1)}.
\]
There are constants $c,C>0$ such that, for every sufficiently large integer $h$,
\[
c h^{-1/4}\le B_h\le C h^{-1/4},\qquad M_h\le C h^{13/12},\qquad
B_h\{L\ge c h^{4/3}\}\ge c h^{-1/4}.
\]
For all $h\ge1$ and $x\ge1$, one also has
\[
B_h\{D>x\}\le C x^{-1/4}.
\]
The same estimates hold in the symmetry-related pure directions.
Theorem(Infinite spatial law)
Concatenate independent irreducibles of law p, and enumerate the resulting vertices as \gamma_1,\gamma_2,\ldots. Almost surely,
Concatenate independent irreducibles of law $p$, and enumerate the resulting vertices as $\gamma_1,\gamma_2,\ldots$. Almost surely,
\[
|\gamma_n-\gamma_1|=n^{3/4+o(1)},\qquad
\#\{n:|\gamma_n-\gamma_1|\le R\}=R^{4/3+o(1)}.
\]
Theorem
One has a_{n+2}/a_n\to\rho^{-2}. The uniform half-plane laws converge on each fixed initial path to the infinite law of Theorem R:renew:infinite.
One has $a_{n+2}/a_n\to\rho^{-2}$. The uniform half-plane laws converge on each fixed initial path to the infinite law of Theorem~\ref{R:renew:infinite}.
For every integer $N\ge1$, all sums in
\eqref{eq:01-strip-quantities} are finite. With constants independent of
$N$,
\begin{equation}
c\mathcal A_N+\mathcal B_N=1,\qquad
m_{N+1}-m_N\asymp\mathcal B_N,\qquad
m_N\asymp N^{3/4},\qquad
\mathcal B_N\asymp N^{-1/4}.
\end{equation}
Moreover, $\mathcal B_N$ is nonincreasing in $N$.
Let D_R be convex pure lattice hexagons which, after scaling by R, converge to a regular hexagon. Let a_R,b_R be boundary ports whose scaled limits are distinct points in the relative interiors of sides. Then, for every \varepsilon>0, the critical chord law satisfies
The same conclusion holds in a full half-plane for prescribed boundary ports at distance R, in a strip of height comparable to R for one prescribed port on each of the two opposite boundary cuts, at mutual distance O(R), and in a wedge of angle \pi/3 or 2\pi/3 formed by two nonparallel pure cuts, with one prescribed port on each ray. In the wedge, each endpoint has clearance comparable to R from the other cut and distance O(R) from the apex. Constants are uniform on fixed compact sets of these nondegenerate scaled geometries. In each case the normalizing mass is at least cR^{-5/4}.
Let $D_R$ be convex pure lattice hexagons which, after scaling by $R$,
converge to a regular hexagon. Let $a_R,b_R$ be boundary ports whose
scaled limits are distinct points in the relative interiors of sides.
Then, for every $\varepsilon>0$, the critical chord law satisfies
\[
\mathbb P_{D_R;a_R,b_R}
\{R^{4/3-\varepsilon}\le L(\gamma)\le R^{4/3+\varepsilon}\}
\longrightarrow1.
\]
The same conclusion holds in a full half-plane for prescribed boundary
ports at distance $R$, in a strip of height comparable to $R$ for
one prescribed port on each of the two opposite boundary cuts, at mutual
distance $O(R)$, and in a wedge of angle
$\pi/3$ or $2\pi/3$ formed by two nonparallel pure cuts, with one prescribed port on each ray.
In the wedge, each endpoint has clearance comparable to $R$ from the other cut and
distance $O(R)$ from the apex. Constants are uniform on fixed compact
sets of these nondegenerate scaled geometries. In each case the
normalizing mass is at least $cR^{-5/4}$.
Critical strip-crossing mass on the honeycomb lattice
TeX label thm:strip, build/sections/01_introduction.tex, line 54
The Lean statement says
defCriticalStripMass : Prop := (∀ N : ℕ, 1 ≤ N → StripSumsFinite N) ∧ (∀ N : ℕ, 1 ≤ N → c * archMass N + bridgeMass N = 1) ∧ Comparable (fun N => moment (N + 1) - moment N) bridgeMass ∧ Comparable moment (fun N => (N : ℝ) ^ (3 / 4 : ℝ)) ∧ Comparable bridgeMass (fun N => (N : ℝ) ^ (-(1 / 4) : ℝ)) ∧ (∀ N : ℕ, 1 ≤ N → bridgeMass (N + 1) ≤ bridgeMass N)⋮theoremcritical_strip_mass : CriticalStripMass := bysorry
A Lean statement states the theorem and leaves its proof as sorry on purpose. OpenAI’s proof is in a separate solution module, and a program called Comparator checks that proof against this statement.
Recorded comparisons with the paper
Atlas records no contributed comparison of this statement with the paper.
Contributed Comparator run reports
Atlas records no contributed report of running Comparator for this statement file.
Questions to resolve when comparing this statement with the paper
Both independent readers find this family's challenges state less than its headline, while the atlas's AI draft classes this file as stating a paper's theorem as the paper does; check which part of the headline it covers.