A directional zero–one law under strict ellipticity

OpenAI

In dimension d≥3d\ge 3, for independent identically distributed nearest-neighbor transition rows that are strictly positive almost surely, the annealed probability of escape in any fixed nonzero direction is either zero or one.

What was already known

The classical directional question goes back to Kalikow. The cataloged finite-range-dependent result assumes uniform ellipticity, while this theorem gives up uniform lower bounds under independence.

AI involvement AI-led

The manuscript credits OpenAI as author, and the pinned release attributes its manuscripts to the internal model. Individual session details are undocumented.

Importance Notable

Treats the strictly elliptic iid setting with neither a uniform lower bound nor a moment assumption.

Technical verification Formal (Lean)

OpenAI reports a matching formal theorem for the annealed strict-ellipticity law, with ballisticity and finite-range results treated separately.

Formal checking

OpenAI reports a matching formal theorem for the annealed strict-ellipticity law, with ballisticity and finite-range results treated separately.

Checker
OpenAI’s reported Lean formalization
Scope
OpenAI reports a matching formal theorem for the annealed strict-ellipticity law, with ballisticity and finite-range results treated separately.
Basis
Reported by the linked checker

Human understanding Few

The reviewed sources do not document a human explanation of the assessed contribution.

Correction and publication history