Maximal and minimal solutions of an Aronsson equation: L∞ variational problems versus the game theory
Abstract
The Dirichlet problem cases ∞u-|Du|2=0 on ⊂ n u|∂ =g cases might have many solutions, where ∞u=Σ1≤ i,j≤ nuxiuxjuxixj. In this paper, we prove that the maximal solution is the unique absolute minimizer for H(p,z)=1 2|p|2-z from calculus of variations in L∞ and the minimal solution is the continuum value function from the "tug-of-war" game. We will also characterize graphes of solutions which are neither an absolute minimizer nor a value function. A remaining interesting question is how to interpret those intermediate solutions. Most of our approaches are based on an idea of Barles-Busca [BB].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.