An interior estimate for convex solutions and a rigidity theorem (Q5965168): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jfa.2016.01.008 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.JFA.2016.01.008 / rank
 
Normal rank

Latest revision as of 12:41, 9 December 2024

scientific article; zbMATH DE number 6548316
Language Label Description Also known as
English
An interior estimate for convex solutions and a rigidity theorem
scientific article; zbMATH DE number 6548316

    Statements

    An interior estimate for convex solutions and a rigidity theorem (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2016
    0 references
    Given a fully nonlinear PDE on all of Euclidean space, one can sometimes find very trivial solutions (like a linear one for instance). It is of interest to ask ``If a solution decays rapidly or is bounded or has a certain property, then is it necessarily the trivial solution?'' Theorems along these lines are called Bernstein-type results. One proves such results usually by proving interior estimates on the solution (typically \(C^2\) or \(C^1\) estimates). In this paper the Dirichlet problem for the \(k\)-Hessian equations is studied (with the forcing term allowed to depend on the gradient). Pogorelov-type interior estimates are proven (Theorem 1). Prior results are improved when additional (i.e., \(k+1\) convex) convexity assumptions are imposed (Theorem 2). Finally, a Bernstein-type result is proven (Theorem 4). The proofs rely on the maximum principle applied to a suitable, Gaussian-like function depending on the gradient of \(u\).
    0 references
    \(k\)-Hessian equations
    0 references
    interior \(C^2\) estimate
    0 references
    \(k+1\) convex
    0 references
    rigidity theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references