What was already known
Trudinger and Wang proved the Euclidean-complete surface case and a higher-dimensional theorem conditional on a uniform strict-convexity modulus; the missing unconditional higher-dimensional control was the obstacle. Their dimension-10 example was singular. The cited generalized determinant-power counterexamples use a different exponent from the classical affine-maximal equation.
AI involvement
OpenAI is the sole credited author. The proof builds on Trudinger and Wang's human work; no named later human checker or model-level process account is documented.
OpenAI is the credited author of the original mathematical manuscript; model-level autonomy is not documented.
Importance
Claims the unconditional Euclidean-complete rigidity result in dimensions three through nine.
Limitations
The theorem assumes smooth locally uniformly convex affine-maximal graphs complete in the induced Euclidean metric. The companion dimension-ten example is a separate result and is not affine-metric complete. No completed check of this analytic proof is documented.
Technical verification
A detailed proof is available in the TeX source, but no completed full human or machine check matching the Euclidean-complete theorem was located. Assignment links that appear to point to Lean files do not resolve at the cited repository paths and cannot support a machine-check annotation.
Human understanding
The preprint explains the maximal-direction, cap/tube and section-balance mechanisms, but does not document a person's explanation of them. Few is the default for that evidence gap.
Correction and publication history
Claims the unconditional Euclidean-complete rigidity result in dimensions three through nine.
Read this published revision