The ballisticity conjecture: directional transience implies ballisticity for random walks in iid uniformly elliptic environments
For nearest-neighbour random walk on , , in an iid uniformly elliptic environment, call the walk transient in direction if and ballistic if almost surely. In one dimension transient walks can have zero speed (Solomon). Sznitman's conditions and and his effective criterion give ballisticity from quantitative slab-exit bounds, and Guerra and Ramirez proved that the polynomial condition implies , but all such results start from quantitative assumptions. Fribergh and Kious (2016, Conjecture 1.1) formulated the conjecture with the bare one-direction transience hypothesis. In dimension , does almost-sure transience in a fixed direction imply a deterministic limiting velocity with ?
- Result
- Proved(see note)
- Status
- Candidate (review pending)
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Random walks in random environment
- Posed by
- Folklore of Sznitman's ballisticity programme; stated as Conjecture 1.1 by Alexander Fribergh and Daniel Kious
- Year posed
- 2016
- Years open
- 10y
- Solved
- 2026-09-23
- Model
- Unreleased internal OpenAI model
- Vendor
- OpenAI
- Collaborators
- —
- Verification
- Lean-checked, statement unaudited
- Publication
- Announced
- Collection
- OpenAI math release (October 2026), version adc7f12
- Significance
- 42 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
Theorem 1.1: for , iid uniformly elliptic nearest-neighbour rows (no independence within a row needed) and a fixed unit with , there is a deterministic with and almost surely, so the walk is ballistic in direction . For positive probability of suffices, the velocity is unique, and the directions with positive transience probability are exactly the open hemisphere , with probability one there and zero elsewhere. Not shown: the strictly (not uniformly) elliptic case, non-iid environments, or central limit theorems and slowdown estimates.
What the AI did
The release README says the results were produced by an unreleased internal OpenAI model with a fixed procedure, on average about three hours of ChatGPT Pro thinking compute per result, and that some outputs build on earlier model results. This result is not among the README's exceptions (the Hodge conjecture for CM abelian varieties and the Re(s) > 11/12 zero-free region). The manuscripts are authored 'OpenAI' and name no human author. The family has three manuscripts (September 23 and October 5, 2026).
Verification
No independent mathematician has checked this yet. Checked here: the abstract, introduction and Theorem 1.1 were read against Fribergh-Kious Conjecture 1.1 as the manuscript states it. The proof (record regeneration, a spatial-radius estimate, two-walk comparisons along Gaussian scales) was not refereed. lean/formalization.yaml lists comparator DirectionalBallisticity, declaration OAI.DirectionalTransience.directional_transience_implies_ballisticity (file OAI/Probability/Ballisticity/Main.lean). Its statement was read here: for all , every probability law on transition rows with a uniform lower bound on all entries, and every unit , if annealed-almost surely then there is with and annealed-almost surely. That states the headline claim. A second challenge, VelocityHemisphere.json (solution module OAI.Probability.Ballisticity.VelocityHemisphere, present, not in formalization.yaml), states the positive-probability and hemisphere refinement. Not rebuilt here. Permitted axioms: propext, Quot.sound, Classical.choice.
Sources
- Lean proofLean proof (OAI.DirectionalTransience.directional_transience_implies_ballisticity)Comparator statement: DirectionalBallisticity.leanComparator statement: VelocityHemisphere.lean
- CodeOpenAI math release: Directional transience implies ballisticity
- Problem recordFribergh-Kious, Local trapping for elliptic random walks in random environments (arXiv)