Strict convexity and differentiability of the planar exponential first-passage limit shape

OpenAI

For undirected nearest-neighbor first-passage percolation on the square lattice with independent exponential edge weights, the limit shape is strictly convex with a C1C^{1} boundary. The time-constant norm is differentiable away from zero for all Gamma weights of positive shape and rate.

What was already known

The paper’s comparison with Ahlberg–Hoffman and related results separates directional consequences from actual shape regularity. The cataloged absence of bigeodesics is a different claim.

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

Combines differentiability for a larger Gamma class with strict convexity in the exponential model.

Technical verification Partial

The official Lean scope gives differentiability and the unique supporting line for exponential weights. It explicitly leaves strict convexity outside the checked statements.

Formal checking

The official Lean scope gives differentiability and the unique supporting line for exponential weights. It explicitly leaves strict convexity outside the checked statements.

Checker
OpenAI’s reported Lean formalization
Scope
The official Lean scope gives differentiability and the unique supporting line for exponential weights. It explicitly leaves strict convexity outside the checked statements.
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