Uniform Bessel bounds for magnetization crossings in finite Ising chains
Arjun Pemmasani
math.PR
Oct 3, 2026 · v3
cond-mat.stat-mech
TL;DR
Many results, including the every-N crossing bound (Theorem 3.4), are formalized in Lean 4, with the kernel checking integer certificates for N≤174.
Abstract
We consider a finite Ising chain in zero field and ask when the all-up configuration is as likely as zero magnetization (magnetization one for an odd number of spins). For both free and periodic ends, the crossing coupling of a long chain is half the logarithm of its length minus half the logarithm of that logarithm, up to a term that vanishes as the length grows. We compute further terms with explicit constants and, for free ends, bound the crossing at every length. The second term is missing from an earlier approximation and explains why an earlier numerical fit gives a slope below one half. To locate the crossing, we compare the known magnetization law with its Bessel approximation. The Bessel approximation is above the exact weight, and we bound its relative error for every length, coupling and magnetization. At the crossing this bound tends to zero. The central bin still has about as many domain walls as the logarithm of the length on average, so the crossing has a coupling width of order the inverse logarithm. In a fixed positive dimensionless field the last crossing comes from near the edge of the row, at a coupling of about a quarter of the logarithm of the length. For long chains it is the one-spin crossing when the field exceeds half the logarithm of two. Below that value another bin crosses later.
Problem
In a finite zero-field Ising chain, the question is at what coupling the all-up configuration becomes as likely as zero magnetization, for free and periodic ends. An earlier approximation of this crossing omitted a second-order term.
Approach
The spins are treated as a persistent random walk, and words are counted by their number of switches to obtain exact bin probabilities. The exact law is compared with a Bessel-function approximation, with relative-error bounds that hold for every length, coupling and magnetization. Small N is handled by exact integer certificates. Many results are formalized in Lean 4, and the Lean kernel rechecks the certificates for N≤174.
Results
The crossing coupling is half of log N minus half of log log N, plus further terms with explicit constants. For free ends the crossing is bounded at every N≥2. In a positive field the last crossing comes from near the edge, at a coupling of about a quarter of log N.