Uniform Lipschitz regularity for two-phase singularly perturbed fully nonlinear elliptic equations

Abstract

We study sign-changing viscosity solutions of the singularly perturbed fully nonlinear equation $$ F(D^2u_\varepsilon) = \fracα{\varepsilon} β\left(\frac{u_\varepsilon}{\varepsilon}\right) \qquad\text{in }B_1\subset\mathbb R^n, $$ where $F$ is uniformly elliptic and $β\in C_c (-1,1)$ is nonnegative. We prove the scale-sharp estimate $$ \|\nabla u_\varepsilon\|_{L^\infty(B_{1/2})} \leq C\left( \|u_\varepsilon\|_{L^\infty(B_1)}+\sqrtα\right), $$ with $C$ depending only on the dimension, the ellipticity constants, and $β$, and independent of $\varepsilon$ and $α$. This removes a longstanding compactness obstruction in the analysis of fully nonlinear two-phase singular perturbations. The difficulty is structural: at positive $\varepsilon$ there is neither a free boundary nor a prescribed transmission law, while the general fully nonlinear setting provides no monotonicity formula capable of controlling the interaction of the two phases. The proof develops a diffuse counterpart of the De Silva--Savin decay-versus-Lipschitz alternative. Exact planar transitions furnish the local comparison geometry, and curved-test compactness carries this geometry across collapsing reaction layers. An intrinsic transition-region estimate reduces the problem to linear growth from buffered level boundaries. The resulting dyadic continuation is closed by a large-slope stopping argument: bounded accumulated slopes yield the desired growth directly, whereas unbounded slopes force the effective reaction strength to vanish after normalization and lead to a contradiction. The estimate is quantitatively optimal and supplies the scale-invariant compactness framework required for the subsequent sharp-interface analysis.

Disclosure

“mportant to our work is the Lea Prover, a tool under development by our expMath team. Lea is designed as part of a human-centered approach to AI-assisted mathematics: it streamlines interaction with frontier models, including OpenAI’s GPT, Anthropic’s Claude, and Google’s Gemini, and serves as an auxiliary tool to compare alternative formulations, examine logical dependencies, stress-test candidate arguments, and assist with proofs. At a pivotal stage of the project, we employed Lea to expl”

PDF page 5

Classification

Proof ideas or individual proof-step assistance

Multiplier

8

Verified

2026-08-23T05:20:21.206699Z

Structural counts