Bernstein problem for the affine maximal type equation
For , let be locally uniformly convex, so that is positive definite, and suppose its graph is complete with respect to the induced Euclidean metric. If
where , must be a quadratic polynomial? Equivalently, must the graph of be an elliptic paraboloid?
References
Primary source
Additional references
Progress summary
A new preprint claims broader nonquadratic counterexamples, while the main higher-dimensional rigidity question remains open.
Chern proposed the entire-graph conjecture in 1977; Trudinger–Wang later formulated its broader affine maximal-type version. It asks whether complete, locally uniformly convex solutions must be elliptic paraboloids.
Known results
- Trudinger–Wang: the case , .
- Jia–Li: , .
- The full Bernstein theorem holds for , , and , .
- Rotationally symmetric solutions satisfy Bernstein rigidity for and .
August 2026 extension of counterexamples
The preprint <i>New non-quadratic Euclidean complete affine maximal type hypersurfaces via Calabi affine geometry</i> claims an extension of Du-attributed counterexamples to a wider parameter range. This narrows the possible rigidity regime, but the higher-dimensional Chern conjecture at its distinguished parameter remains open.
Current status (as of August 2026): Positive results are known in low dimensions and special regimes, while broader nonquadratic counterexamples are claimed but the higher-dimensional distinguished-parameter conjecture remains open.
Sources
- arxiv.org
- arxiv.org
- comptes-rendus.academie-sciences.fr
- numdam.org
- lwmath.github.io
- openai.com
- openai.com
- cdn.openai.com
- openai.com
- arxiv.org
- export.arxiv.org
- arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- scientificamerican.com
- quantamagazine.org
- www-cdn.anthropic.com
- cdn.openai.com
- www-cdn.anthropic.com
Solutions 1
RemarkAI-assistedClaimed by OpenAI. Claims a smooth nonquadratic entire affine-maximal graph in dimension ten with everywhere positive-definite Hessian, giving a counterexample to the unrestricted quadratic-graph assertion. A uniform Hessian lower bound and affine-metric completeness are not asserted.See full solution
Claimed by OpenAI. Claims a smooth nonquadratic entire affine-maximal graph in dimension ten with everywhere positive-definite Hessian, giving a counterexample to the unrestricted quadratic-graph assertion. A uniform Hessian lower bound and affine-metric completeness are not asserted.
Scope relative to this problem: This is the reported dimension-ten counterexample to the target quadratic-graph assertion. The source graph is smooth over all of Euclidean ten-space; its induced Euclidean graph metric is complete because it dominates the base Euclidean metric. This is an elementary completeness inference, distinct from the affine-metric completeness excluded by the source. The target inverse-Hessian equation is equivalent to the source cofactor equation after multiplying by the positive Hessian determinant. No uniform Hessian lower bound is inferred.
GitHub repository: https://github.com/openai/math
- OpenAI-353-01-A-Smooth-Nonquadratic-Entire-Affine-Maximal-Graph-in-Dimension-Ten.pdfOpen