RECORD
Two approaches to minimax formula of the additive eigenvalue for quasiconvex Hamiltonians
Analysis of PDEs · Submitted 21 Dec 2014
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim Two different proofs for an inf-sup type representation formula (minimax formula) of the additive eigenvalues corresponding to first-order Hamilton-Jacobi equations are given for quasiconvex (level-set convex) Hamiltonians not necessarily convex.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
Two different proofs for an inf-sup type representation formula (minimax formula) of the additive eigenvalues corresponding to first-order Hamilton-Jacobi equations are given for quasiconvex (level-set convex) Hamiltonians not necessarily convex. The first proof, which is similar to known proofs for convex Hamiltonians, invokes a Jensen-like inequality for quasiconvex functions instead of the standard Jensen's inequality. The second proof is completely different with elementary calculations. It is based on convergence of derivatives of mollified Lipschitz continuous functions whose proof is also given. These methods also relate to an approximation problem of viscosity solutions.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Two different proofs for an inf-sup type representation formula (minimax formula) of the additive eigenvalues corresponding to first-order Hamilton-Jacobi equations are given for quasiconvex (level-set convex) Hamiltonians not necessarily convex. | contribution 0.99 | 0.94 | 0.81 | asserted 1.00 |
| s1 | The first proof, which is similar to known proofs for convex Hamiltonians, invokes a Jensen-like inequality for quasiconvex functions instead of the standard Jensen's inequality. | method 0.94 | 0.81 | 0.09 | asserted 1.00 |
| s2 | The second proof is completely different with elementary calculations. | method 0.82 | 0.89 | 0.07 | asserted 1.00 |
| s3 | It is based on convergence of derivatives of mollified Lipschitz continuous functions whose proof is also given. | method 0.99 | 0.89 | 0.07 | asserted 1.00 |
| s4 | These methods also relate to an approximation problem of viscosity solutions. | interpretation 0.90 | 0.68 | 0.08 | asserted 0.96 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
Two different proofs for an inf-sup type representation formula (minimax formula) of the additive eigenvalues corresponding to first-order Hamilton-Jacobi equations are given for quasiconvex (level-set convex) Hamiltonians not necessarily convex. The first proof, which is similar to known proofs for convex Hamiltonians, invokes a Jensen-like inequality for quasiconvex functions instead of the standard Jensen's inequality. The second proof is completely different with elementary calculations. It is based on convergence of derivatives of mollified Lipschitz continuous functions whose proof is also given. These methods also relate to an approximation problem of viscosity solutions.
Human review
How the literature uses it
1 arXiv paper cite this in 1 sentence
Papers citing it
Uses its method or tool 1 paper
-
Since $H_1$ is quasiconvex and even, we use the inf-max representation formula for $H_1$ (see [ref] ) to get that [equation] Thus, $H_1$ is even.
Min-max formulas and other properties of certain classes of nonconvex effective Hamiltonians · Basic case · 0.99
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.