my-server
← Wiki

Bernstein's problem

In differential geometry, Bernstein's problem is as follows: if the graph of a function on R<sup>n&minus;1</sup> is a minimal surface in R<sup>n</sup>, does this imply that the function is linear? This is true for n at most 8, but false for n at least 9. The problem is named for Sergei Natanovich Bernstein who solved the case&nbsp;n&nbsp;=&nbsp;3 in 1914.

Statement

Suppose that f is a function of n&nbsp;&minus;&nbsp;1 real variables. The graph of f is a surface in R<sup>n</sup>, and the condition that this is a minimal surface is that f satisfies the minimal surface equation

Bernstein's problem asks whether an entire function (a function defined throughout R<sup>n&minus;1</sup> ) that solves this equation is necessarily a degree-1 polynomial.

History

proved Bernstein's theorem that a graph of a real function on R<sup>2</sup> that is also a minimal surface in R<sup>3</sup> must be a plane.

gave a new proof of Bernstein's theorem by deducing it from the fact that there is no non-planar area-minimizing cone in R<sup>3</sup>.

showed that if there is no non-planar area-minimizing cone in R<sup>n&minus;1</sup> then the analogue of Bernstein's theorem is true for graphs in R<sup>n</sup>, which in particular implies that it is true in R<sup>4</sup>.

showed there are no non-planar minimizing cones in R<sup>4</sup>, thus extending Bernstein's theorem to R<sup>5</sup>.

showed there are no non-planar minimizing cones in R<sup>7</sup>, thus extending Bernstein's theorem to R<sup>8</sup>. He also showed that the surface defined by

is a locally stable cone in R<sup>8</sup>, and asked if it is globally area-minimizing.

showed that Simons' cone is indeed globally minimizing, and that in R<sup>n</sup> for n≥9 there are graphs that are minimal, but not hyperplanes. Combined with the result of Simons, this shows that the analogue of Bernstein's theorem is true in R<sup>n</sup> for n≤8, and false in higher dimensions.

See also

References

  • German translation in

External links