{
  "id": "enwiki-001321967637",
  "slug": "bernstein-s-problem",
  "title": "Bernstein's problem",
  "qid": "",
  "lead": "In differential geometry, Bernstein's problem is as follows: if the graph of a function on R n&minus;1 is a minimal surface in R n , 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 n = 3 in 1914.",
  "body": "In differential geometry, Bernstein's problem is as follows: if the graph of a function on R n&minus;1 is a minimal surface in R n , 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 n , and the condition that this is a minimal surface is that f satisfies the minimal surface equation \\sum_{i=1}^{n-1} \\frac{\\partial}{\\partial x_i}\\frac{\\frac{\\partial f}{\\partial x_i}}{\\sqrt{1+\\sum_{j=1}^{n-1}\\left(\\frac{\\partial f}{\\partial x_j}\\right)^2}} = 0 Bernstein's problem asks whether an entire function (a function defined throughout R n&minus;1 ) that solves this equation is necessarily a degree-1 polynomial. ==History== proved Bernstein's theorem that a graph of a real function on R 2 that is also a minimal surface in R 3 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 3 . showed that if there is no non-planar area-minimizing cone in R n&minus;1 then the analogue of Bernstein's theorem is true for graphs in R n , which in particular implies that it is true in R 4 . showed there are no non-planar minimizing cones in R 4 , thus extending Bernstein's theorem to R 5 . showed there are no non-planar minimizing cones in R 7 , thus extending Bernstein's theorem to R 8 . He also showed that the surface defined by \\{ x \\in \\mathbb{R}^8 : x_1^2+x_2^2+x_3^2+x_4^2=x_5^2+x_6^2+x_7^2+x_8^2 \\} is a locally stable cone in R 8 , and asked if it is globally area-minimizing. showed that Simons' cone is indeed globally minimizing, and that in R n 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 n for n≤8, and false in higher dimensions. ==References== German translation in ==External links== Encyclopaedia of Mathematics article on the Bernstein theorem",
  "categories": [
    "20476452",
    "23035279",
    "23603337",
    "26220375",
    "29176345",
    "29176499",
    "63697623"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1321967637",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1763051461.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001321967637",
    "type": "webpage",
    "title": "Bernstein's problem",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/bernstein-s-problem",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          17
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          17
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001321967637",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1321967637",
    "note": "Immutable snapshot enwiki-001321967637"
  }
}