Solutions of Vectorial Hamilton-Jacobi Equations are Rank-One Absolute Minimisers in L∞
Abstract
Given the supremal functional E∞(u,')=ess\,' H(·,D u) defined on W1,∞loc(,RN), ' ⊂eq Rn, we identify a class of vectorial rank-one Absolute Minimisers by proving a statement slightly stronger than the next claim: vectorial solutions of the Hamilton-Jacobi equation H(·,D u)=c are rank-one Absolute Minimisers if they are C1. Our minimality notion is a generalisation of the classical L∞ variational principle of Aronsson to the vector case and emerged in earlier work of the author. The assumptions are minimal, requiring only continuity and rank-one convexity of the level sets.
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.