Summary (Overview)

  • Complete formalization in Lean 4: The paper presents a fully verified proof of the convergence of p-harmonious functions to the viscosity solution of the Dirichlet problem for the normalized p-Laplacian, for 2≤p<∞2 \leq p < \infty, as the step size ε→0\varepsilon \to 0.
  • Barles–Souganidis framework: The proof follows the classical half-relaxed limits approach, requiring consistency (asymptotic expansion), stability (viscosity properties of limits), and comparison principle.
  • Key components formalized: Aleksandrov's theorem, Jensen's lemma, existence/uniqueness for the discrete problem, comparison principle for the limit equation, and boundary behavior via exterior sphere condition.
  • Scale of development: Approximately 29,400 lines of Lean code across 225 files, built on Mathlib, with no unproved statements and depending only on standard classical axioms.
  • Novel analytic simplifications: The proof of Aleksandrov's theorem avoids Hahn–Banach (uses proximal maps), Jensen's lemma avoids mollification and area formula, and uniqueness propagates near-maxima instead of using compactness.

Introduction and Theoretical Foundation

The Normalized p-Laplacian

For 1<p<∞1 < p < \infty, the normalized p-Laplacian is defined as

ΔpNu=Δu+(p−2)Δ∞Nu,Δ∞Nu=⟨D2u∇u∣∇u∣,∇u∣∇u∣⟩.(1)\Delta_{p}^{\mathrm{N}} u = \Delta u + (p-2)\Delta_{\infty}^{\mathrm{N}} u, \qquad \Delta_{\infty}^{\mathrm{N}} u = \left\langle D^{2}u \frac{\nabla u}{|\nabla u|}, \frac{\nabla u}{|\nabla u|} \right\rangle. \tag{1}

The operator is homogeneous of degree one and not in divergence form, making viscosity solutions the natural notion.

The Tug-of-War Scheme

The discrete dynamic programming principle (DPP) defining p-harmonious functions is:

uε(x)=α2(sup⁡Bε(x)uε+inf⁡Bε(x)uε)+β∫Bε(x)uε,α=p−2p+d,β=d+2p+d.(2)u_{\varepsilon}(x) = \frac{\alpha}{2}\left(\sup_{B_{\varepsilon}(x)} u_{\varepsilon} + \inf_{B_{\varepsilon}(x)} u_{\varepsilon}\right) + \beta \int_{B_{\varepsilon}(x)} u_{\varepsilon}, \qquad \alpha = \frac{p-2}{p+d}, \quad \beta = \frac{d+2}{p+d}. \tag{2}

Here ε>0\varepsilon > 0 is the step size, Bε(x)B_{\varepsilon}(x) is the open ball of radius ε\varepsilon centered at xx, and ∫Bv\int_{B} v denotes the average of vv over BB with respect to Lebesgue measure. For p≥2p \geq 2, the weights satisfy α≥0\alpha \geq 0, β>0\beta > 0, and α+β=1\alpha + \beta = 1.

Main Theorem (Formalized)

Let 2≤p<∞2 \leq p < \infty and d≥1d \geq 1. Let Ω⊂Rd\Omega \subset \mathbb{R}^{d} be a bounded open set satisfying the exterior sphere condition (for every y∈∂Ωy \in \partial\Omega there is a ball B(z,δ)B(z,\delta) with B(z,δ)∩Ω=∅B(z,\delta) \cap \Omega = \varnothing and y∈∂B(z,δ)y \in \partial B(z,\delta)), and let F:Rd→RF: \mathbb{R}^{d} \to \mathbb{R} be bounded and continuous. Then:

  1. For every ε>0\varepsilon > 0 there is a unique p-harmonious function uεu_{\varepsilon} in Ω\Omega with data FF, equal to FF outside Ω\Omega, with sup⁡∣uε∣≤sup⁡∣F∣\sup |u_{\varepsilon}| \leq \sup |F|;
  2. The half-relaxed limits u‾\overline{u} and u‾\underline{u} coincide on Ω\Omega and equal FF on ∂Ω\partial\Omega, and uε→u‾u_{\varepsilon} \to \overline{u} uniformly on Ω\Omega.

The limit is a viscosity solution of −ΔpNu=0-\Delta_{p}^{\mathrm{N}} u = 0 in Ω\Omega.


Methodology

The Step Operator

For admissible (Borel measurable, bounded) vv, the step operator is:

Tεv(x)=α2(sup⁡Bε(x)v+inf⁡Bε(x)v)+β∫Bε(x)v.(3)T_{\varepsilon} v(x) = \frac{\alpha}{2}\left(\sup_{B_{\varepsilon}(x)} v + \inf_{B_{\varepsilon}(x)} v\right) + \beta \int_{B_{\varepsilon}(x)} v. \tag{3}

Definition 2.1: An admissible uu is p-harmonious in Ω\Omega with data FF if u=Tεuu = T_{\varepsilon} u on Ω\Omega and u=Fu = F on the strip Γε={x∉Ω:dist(x,Ω)≤ε}\Gamma_{\varepsilon} = \{x \notin \Omega : \text{dist}(x, \Omega) \leq \varepsilon\}.

Viscosity Solutions with Envelopes

The equation is written as F(∇u,D2u)=0\mathcal{F}(\nabla u, D^{2}u) = 0 where

F(q,X)=−tr⁡X−(p−2)⟨Xq∣q∣,q∣q∣⟩,q≠0.\mathcal{F}(q, X) = -\operatorname{tr} X - (p-2)\left\langle X \frac{q}{|q|}, \frac{q}{|q|}\right\rangle, \qquad q \neq 0.

At q=0q = 0, the lower and upper semicontinuous envelopes are:

F∗(0,X)=−tr⁡X−(p−2)λmax⁡(X),F∗(0,X)=−tr⁡X−(p−2)λmin⁡(X).(4)\mathcal{F}_{*}(0, X) = -\operatorname{tr} X - (p-2)\lambda_{\max}(X), \quad \mathcal{F}^{*}(0, X) = -\operatorname{tr} X - (p-2)\lambda_{\min}(X). \tag{4}

Definition 2.2: An upper semicontinuous uu is a viscosity subsolution if for any φ∈C2\varphi \in C^{2} with u−φu - \varphi having a local maximum at x0x_0:

  • F(∇φ(x0),D2φ(x0))≤0\mathcal{F}(\nabla\varphi(x_0), D^{2}\varphi(x_0)) \leq 0 if ∇φ(x0)≠0\nabla\varphi(x_0) \neq 0,
  • F∗(0,D2φ(x0))≤0\mathcal{F}_{*}(0, D^{2}\varphi(x_0)) \leq 0 otherwise.

Supersolutions are defined dually.

Proof Structure (Barles–Souganidis)

The proof reduces to three statements:

  • (A) u‾\overline{u} is a viscosity subsolution and u‾\underline{u} is a viscosity supersolution in Ω\Omega;
  • (B) Boundary inequalities u‾≤F≤u‾\overline{u} \leq F \leq \underline{u} on ∂Ω\partial\Omega;
  • (C) Comparison principle for the limit equation.

Development Layers

LayerContentLines (approx.)
1The scheme: operator, measurability, existence, uniqueness, comparison3,300
2Viscosity framework: generator, predicates, consistency, stability1,100
3Asymptotic expansion of TεT_{\varepsilon} with explicit error rate5,500
4Relaxed limits, comparison principle, boundary, convergence19,100
Total225 files29,400

Empirical Validation / Results

Consistency: The Asymptotic Expansion

Theorem 4.1: Let φ∈C3\varphi \in C^{3} with ∇φ(x0)≠0\nabla\varphi(x_0) \neq 0. There is ρ>0\rho > 0 such that for every y∈Bρ(x0)y \in B_{\rho}(x_0) and 0<ε≤ρ0 < \varepsilon \leq \rho:

Tεφ(y)=φ(y)+ε22(p+d)ΔpNφ(y)+Eε(y),sup⁡y∈Bρ(x0)∣Eε(y)∣=o(ε2)(ε→0+).T_{\varepsilon}\varphi(y) = \varphi(y) + \frac{\varepsilon^{2}}{2(p+d)} \Delta_{p}^{\mathrm{N}}\varphi(y) + E_{\varepsilon}(y), \qquad \sup_{y \in B_{\rho}(x_0)} |E_{\varepsilon}(y)| = o(\varepsilon^{2}) \quad (\varepsilon \to 0^{+}).

The proof uses:

  • Second moments of Lebesgue measure: ∫Bε(0)zizj dz=ε2d+2δij\int_{B_{\varepsilon}(0)} z_i z_j \, dz = \frac{\varepsilon^{2}}{d+2}\delta_{ij} (exact identity);
  • Averaging Taylor expansion: ∫Bε(x)φ=φ(x)+ε22(d+2)Δφ(x)+O(ε3)\int_{B_{\varepsilon}(x)} \varphi = \varphi(x) + \frac{\varepsilon^{2}}{2(d+2)}\Delta\varphi(x) + O(\varepsilon^{3});
  • Extreme values: 12(sup⁡Bε(x)φ+inf⁡Bε(x)φ)=φ(x)+ε22Δ∞Nφ(x)+o(ε2)\frac{1}{2}\left(\sup_{B_{\varepsilon}(x)}\varphi + \inf_{B_{\varepsilon}(x)}\varphi\right) = \varphi(x) + \frac{\varepsilon^{2}}{2}\Delta_{\infty}^{N}\varphi(x) + o(\varepsilon^{2});
  • Weight combination: αε22Δ∞Nφ+βε22(d+2)Δφ=ε22(p+d)ΔpNφ\alpha\frac{\varepsilon^{2}}{2}\Delta_{\infty}^{N}\varphi + \beta\frac{\varepsilon^{2}}{2(d+2)}\Delta\varphi = \frac{\varepsilon^{2}}{2(p+d)}\Delta_{p}^{N}\varphi.

Viscosity Property of Relaxed Limits

Theorem 5.1: If (uε)(u_{\varepsilon}) is uniformly bounded and each uεu_{\varepsilon} is p-harmonious in open Ω\Omega, then u‾\overline{u} is a viscosity subsolution and u‾\underline{u} is a viscosity supersolution of −ΔpNu=0-\Delta_{p}^{N}u = 0 in Ω\Omega.

Key techniques:

  • Near-maximizers without extraction: Compactness on annuli instead of subsequences;
  • Singular case handling: Reflecting balls through centers to obtain eigenvalue inequalities;
  • From C3C^{3} to C2C^{2}: Adding quartic perturbation ∣x−x0∣4|x-x_0|^4 and using second-order Taylor polynomials.

Comparison Principle

Theorem 6.1: For bounded open Ω\Omega, with UU upper semicontinuous and VV lower semicontinuous, if UU is a viscosity subsolution, VV a viscosity supersolution, and U(y)≤V(y)U(y) \leq V(y) on ∂Ω\partial\Omega, then U≤VU \leq V in Ω\Omega.

The proof strategy:

  1. Change of values: ψ(s)=s−ηs2\psi(s) = s - \eta s^2, W=ψ∘VW = \psi \circ V gives strictness:
ΔpN(cq,cX−2ηq⊗q)≤−2η(p−1)∣q∣2.(5)\Delta_{p}^{N}(cq, cX - 2\eta q \otimes q) \leq -2\eta(p-1)|q|^{2}. \tag{5}
  1. No maximum with nonzero gradient: Using Jensen's lemma and Aleksandrov's theorem to obtain a contradiction via κ=2η(p−1)(∣q∣/(2C))2>0\kappa = 2\eta(p-1)(|q|/(2C))^2 > 0;
  2. Translated maximum: Showing the contact set is both open and closed, hence all of GG;
  3. Regularization: Sup-convolution and inf-convolution for semiconvexity/semiconcavity.

Aleksandrov's Theorem and Jensen's Lemma

Theorem 6.3 (alexandrov): A convex function ff on Rd\mathbb{R}^{d} has a second-order expansion at almost every point:

f(x+h)=f(x)+⟨q,h⟩+12X(h,h)+o(∣h∣2)(h→0).f(x+h) = f(x) + \langle q, h\rangle + \frac{1}{2}X(h,h) + o(|h|^{2}) \qquad (h \to 0).

Proved via proximal maps J(y)=argmin⁡x(f(x)+12∣x−y∣2)J(y) = \operatorname{argmin}_x (f(x) + \frac{1}{2}|x-y|^2), which are one-Lipschitz and onto, avoiding Hahn–Banach.

Theorem 6.4 (jensen_positive_measure): For semiconvex WW with WW larger at some point of B‾(x0,r)\overline{B}(x_0, r) than 2δr2\delta r plus its values on the sphere, the set of points where some W+⟨ξ,⋅⟩W + \langle\xi, \cdot\rangle with ∣ξ∣≤δ|\xi| \leq \delta attains its maximum has positive measure.

Boundary Behavior and Existence

Theorem 7.1 (ubar_le_bdry): Under the Main Theorem's hypotheses, u‾(y0)≤F(y0)\overline{u}(y_0) \leq F(y_0) at every y0∈∂Ωy_0 \in \partial\Omega.

The proof uses a polynomial barrier: with t=∣x−z∣2−δ2t = |x-z|^2 - \delta^2,

ψ=t−Mt2,M=2(d+p−2)+18(p−1)δ2,\psi = t - Mt^2, \qquad M = \frac{2(d+p-2)+1}{8(p-1)\delta^{2}},

satisfying ΔpNψ≤−1\Delta_{p}^{N}\psi \leq -1 on the shell 0≤t≤1/(4M)0 \leq t \leq 1/(4M), giving:

Tε(c+Aψ)≤c+Aψ−Aε24(p+d).T_{\varepsilon}(c + A\psi) \leq c + A\psi - \frac{A\varepsilon^{2}}{4(p+d)}.

Theorem 7.2 (exists_pharmonious): Iterating the restricted operator T~\tilde{T} (equal to TεT_{\varepsilon} on Ω\Omega, identity elsewhere) from u0=−Cu_0 = -C on Ω\Omega yields a monotone increasing, uniformly bounded sequence converging to a fixed point.

Theorem 7.3 (pharmonious_unique): Propagating near-maxima of w=v−uw = v - u in a fixed direction with geometrically growing errors; after NN steps with Nε/2N\varepsilon/2 exceeding the width of Ω\Omega, a contradiction is reached.


Theoretical and Practical Implications

  • Formal verification of PDE theory: This is among the first complete formalizations of a nonlinear viscosity solution convergence theorem, demonstrating that complex analytic arguments (Aleksandrov's theorem, Jensen's lemma, comparison principles) can be fully mechanized.
  • Methodological innovations: The proximal-map proof of Aleksandrov's theorem and the near-maxima propagation for uniqueness simplify the informal proofs, potentially offering new analytic insights.
  • Foundation for future work: The formalized infrastructure (viscosity framework, jets, relaxed limits) can be reused for other non-divergence form equations and numerical schemes.
  • AI-assisted formalization: The development used large language models for drafting, with the mathematical route fixed by the authors—demonstrating a viable workflow for large-scale formalization projects.
  • Precision requirements: The formalization forced precise statements of several informal notions (open vs. closed balls for measurability, restricted operators, boundary strips), clarifying subtle points in the theory.

Conclusion

The paper reports a complete formalization in Lean 4 of the convergence of p-harmonious functions to the viscosity solution of the normalized p-Laplacian Dirichlet problem for 2≤p<∞2 \leq p < \infty. The approximately 29,400 lines of Lean code cover:

  • The discrete dynamic programming scheme with existence and uniqueness;
  • The asymptotic expansion (consistency);
  • Viscosity properties of half-relaxed limits (stability);
  • The comparison principle including Aleksandrov's theorem and Jensen's lemma;
  • Boundary behavior via exterior sphere condition and polynomial barriers;
  • Uniform convergence of the family.

The development contains no unproved statements and depends only on standard classical axioms (propext, Classical.choice, Quot.sound). Future directions include extending to 1<p<21 < p < 2 (where α<0\alpha < 0 complicates monotonicity), relaxing the exterior sphere condition, and formalizing regularity results for the limit equation.

Related papers