Probability and statistical mechanics·OpenAI Math·Result 236·Lean formalisation listed
The exact factor-of-IID threshold for free Ising spins on trees
One of the 372 results in OpenAI's public mathematics catalogue, filed under probability and statistical mechanics: 1 preprint, the latest dated 26 September 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and embeds the animation.
In one line: OpenAI reports a result titled ‘The exact factor-of-IID threshold for free Ising spins on trees’ (probability and statistical mechanics) in a preprint dated 26 September 2026. It has not been peer reviewed. The channel's animation, Every OpenAI Math Result, Part 2 of 4: PCP for PPAD, Birkhoff Conjecture and 82 More, is on YouTube.
Chapter 60 of 84 in Every OpenAI Math Result, Part 2 of 4: PCP for PPAD, Birkhoff Conjecture and 82 More · starts at 20:28 · watch from there on YouTube →
What OpenAI claims
Determines when the free zero-field ferromagnetic Ising state on the infinite d-regular tree is a factor of independent vertex labels: exactly when tanh β ≤ (d-1)-1/2, including equality, for d ≥ 3 and β ≥ 0. The construction uses no root and is almost surely equivariant for each fixed tree automorphism, resolving the ferromagnetic case of Lyons's question. (Lean)
Paper
The sharp factor-of-IID threshold for the free Ising model on regular trees
OpenAI's abstract For every integer d ≥ 3 and inverse temperature β ≥ 0, the free zero-field ferromagnetic Ising measure on the infinite d-regular tree is a factor of IID exactly when tanh β ≤ (d-1)-1/2. We prove the positive implication, including equality, resolving the conjecture of Nam, Sly and Zhang; the strict converse is known. The spin factor can be chosen to commute with every tree automorphism on every label input.
Status
Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.
Quick answers
- Is it proven?
- Not independently yet. OpenAI posted a preprint on 26 September 2026; it has not been peer reviewed, so treat the result as OpenAI's claim until other mathematicians have checked it.
- What exactly does OpenAI claim?
- Determines when the free zero-field ferromagnetic Ising state on the infinite d-regular tree is a factor of independent vertex labels: exactly when tanh β ≤ (d-1)-1/2, including equality, for d ≥ 3 and β ≥ 0. The construction uses no root and is almost surely equivariant for each fixed tree automorphism, resolving the ferromagnetic case of Lyons's question. (Lean)
- Where is the proof?
- In the paper, The sharp factor-of-IID threshold for the free Ising model on regular trees (PDF).
- Is there a video?
- Yes, on YouTube (29:10, chapter 60).
Also in
- Chapter 5 of 9 in Six-Vertex Model, Lipschitz Heights, The O(3) Model Continuum Limit and 6 More · starts at 1:24 · watch from there on YouTube →
The video
Every OpenAI Math Result, Part 2 of 4: PCP for PPAD, Birkhoff Conjecture and 82 More · Compilation · 29:10 · chapter 60 from 20:28 · description, sources and chapters →
Related results in Probability and statistical mechanics
- 237The three-quarter exponent for honeycomb self-avoiding walkVideoLean
- 238Optimal logarithmic mixing of the Thorp shuffleVideoLean
- 239Sharp singularity rates for symmetric random sign matricesVideo
- 211The geometric phase diagram, diffusion, and spectra of random planar mapsVideoLean
- 212Planar first-passage geometry and the absence of bigeodesicsVideoLean
- 213Critical percolation on every quasi-transitive graphVideoLean