← All papers
First page of A formally verified convergence theorem for the tug-of-war scheme of the normalized $p$-Laplacian

A formally verified convergence theorem for the tug-of-war scheme of the normalized $p$-Laplacian

Juan J. Manfredi, Behrooz Moosavi

math.AP Nov 15, 2026 · v1
Complete Lean 4 formalization on Mathlib of the convergence of p-harmonious functions (tug-of-war scheme) to viscosity solutions of the normalized p-Laplacian.
We present a complete formalization, using Lean 4, of the convergence of $p$-harmonious functions to the viscosity solution of the Dirichlet problem for the normalized $p$-Laplacian, $2 \le p < \infty$, as the step size goes to zero. By $p$-harmonious functions we mean solutions of the dynamic programming principle of tug-of-war with noise. Our proof follows the argument of Barles and Souganidis and is formalized in full, depending only on Mathlib and the standard axioms of Lean. In particular, we include the asymptotic expansion of the scheme, the viscosity properties of the half-relaxed limits, existence and uniqueness for the discrete problem, the comparison principle and uniqueness for the homogeneous equation, Aleksandrov's theorem, and Jensen's lemma.

p-harmonious functions solve the dynamic programming principle of tug-of-war with noise. As the step size goes to zero they converge to the viscosity solution of the Dirichlet problem for the normalized p-Laplacian, 2 ≤ p < ∞. The goal is a complete machine-checked proof of this convergence theorem.

The proof follows the Barles–Souganidis argument. It is formalized in Lean 4 on Mathlib, for domains satisfying the exterior sphere condition. The development has four layers: the discrete scheme, the viscosity framework, the asymptotic expansion of the scheme with an explicit error rate, and relaxed limits with comparison, boundary estimates and convergence. Aleksandrov's theorem and Jensen's lemma, which were not available in Mathlib, are also formalized.

The development comprises about 29,400 lines in 225 files. The main theorem depends only on propext, Classical.choice and Quot.sound. It also includes existence and uniqueness for the discrete problem, the comparison principle, and uniqueness of viscosity solutions.

LayerContentLines (approx.)
1scheme: operator, measurability, existence, uniqueness, comparison3300
2viscosity framework1100
3asymptotic expansion of T_ε5500
4relaxed limits, comparison, boundary, convergence19100
total (225 files)29400
The four layers of the development