Source and verification

This article explains family 353 of the October 6, 2026 OpenAI collection. Research conclusions are attributed to its manuscripts. The review covers statements, introductions, and selected proof mechanisms; it is not an independent verification of the complete proofs.

The affine Bernstein problem asks whether a complete convex hypersurface that is stationary for affine area must be an elliptic paraboloid. Two manuscripts in this family place a dimension boundary between rigidity and smooth counterexamples. The first proves rigidity for Euclidean-complete graphs in dimensions three through nine; the second constructs a smooth, strictly convex, nonquadratic entire graph in dimension ten. (OpenAI, 2026) (OpenAI, 2026a)

The prerequisites are multivariable calculus, convexity, positive definite matrices, ordinary differential equations, and the meaning of an interior estimate for an elliptic PDE. We introduce the geometric terminology below. The counterexample offers a relatively concrete entry point: its fourth-order PDE reduces to a radial system whose global existence follows from a three-dimensional invariant box.

🏷️ Convex graphs and affine area

Let be an open convex set, and let be smooth with positive definite Hessian . Its graph is an -dimensional hypersurface in . The phrase locally uniformly convex means that the Hessian has a positive lower bound on each compact subset. It does not require one positive lower bound on all of .

Ordinary graph area uses the integrand . The affine area functional instead uses

Here stationarity is tested against smooth compactly supported variations. Introduce the cofactor matrix and a determinant power :

The cofactor matrix of a Hessian is divergence free: . This identity follows from the symmetry of third derivatives and the alternating determinant expansion. Differentiating affine area in the direction gives , with repeated indices summed. Two integrations by parts therefore give the classical affine maximal equation

The equation is fourth order in , although it is second order and elliptic in the auxiliary quantity . A positive definite quadratic polynomial has constant Hessian and constant , so every elliptic paraboloid is a solution. The rigidity question is whether completeness forces this elementary example to be the only one.

Two metrics must be distinguished:

The first is the Euclidean metric induced on the graph. The second is the Berwald–Blaschke, or affine, metric. Completeness refers to the chosen metric. Every smooth entire graph is Euclidean complete: a Cauchy sequence in graph distance projects to a Euclidean Cauchy sequence, and near its limiting base point the graph metric is comparable to the ordinary metric. A graph over a proper domain can also be Euclidean complete when its height diverges sufficiently strongly at the boundary.

🏷️ The two conclusions and their hypotheses

Rigidity in dimensions three through nine

The rigidity manuscript proves the following. Let and let be smooth and locally uniformly convex on a nonempty open convex domain . If solves the classical affine maximal equation and its graph is complete for , then and is a positive definite quadratic polynomial. No growth bound or completeness assumption for is imposed. (OpenAI, 2026b)

Thus the conclusion includes extension of the domain to all of Euclidean space. It is stronger than a classification stated only for functions already assumed entire.

A smooth dimension-ten counterexample

The construction manuscript produces with everywhere, solving the same classical equation, which is not quadratic. Its graph is consequently Euclidean complete. The paper asserts neither a uniform global lower bound on nor completeness for the affine metric. (OpenAI, 2026a)

The word “dimension” counts independent variables: the counterexample is a hypersurface in . The older singular model recalled by the manuscript is , with . The new construction replaces that singular profile by one smooth and strictly convex through .

The manuscripts recall the earlier Euclidean-complete surface theorem of Trudinger and Wang, which supplies the two-dimensional case. These results make ten the first failure beyond the rigidity range covered here. The dimension-ten construction by itself does not assert examples in every larger dimension. Adding an extra quadratic variable changes the dimension-dependent exponent in the classical equation, so such a propagation would require a separate argument.

🏷️ A separated construction in one extra variable

Write and seek a function of the form

Assume and . As an identity of quadratic forms,

For a nonzero vector with nonzero component the first term is positive; for a purely vertical vector the second is positive. Hence the full Hessian is positive definite. Using the basis , whose determinant is one, also gives

Introduce a second positive function and set

These two equations imply the affine maximal equation for . To see the cancellation, put and . The determinant formula gives . In the adapted basis, taking the inverse-Hessian trace reduces the equation to the second displayed equation because

The choice is exactly what makes the right side a constant multiple of . This calculation explains why the auxiliary determinant equation and trace equation were chosen together. (OpenAI, 2026a)

Radial equations and smoothness at the origin

Take and radial, put , and write . The eigenvalues of are in the radial direction and in the other directions. The system becomes

For the counterexample, , , and . Starting this system at needs care: a standard ODE theorem away from zero does not ensure smoothness of a radial function at the origin.

The manuscript uses , writes and , and prescribes . With , integration of the two divergence equations yields

Here for . On a small interval around , these formulas define a contraction for near : the integrands are Lipschitz while remain in a fixed positive interval, and the final integration in supplies the small factor. Differentiating the integral formulas bootstraps the fixed point to smoothness. Working on both sides of makes and smooth functions of .

At the origin, and . Thus and, when , . Initially are positive and . The remaining task is to prevent from vanishing, or the other quantities from becoming singular, at a finite radius.

🏷️ The invariant box and global continuation

The useful variables are logarithmic derivatives:

Let a dot denote differentiation in . Direct substitution into the radial equations gives

The smooth initial solution approaches as . The key region is

Its upper corner is stationary. Moreover, each component of the vector field is nondecreasing in the other two coordinates throughout this box. For example, the nonzero cross derivatives of the third component are and , both nonnegative because .

On an upper face, increasing the other coordinates to their upper values can only increase the outward component; at the corner that component is zero. Therefore it is nonpositive on the whole face. On the three lower faces the relevant components are respectively , , and , so they point inward or tangent to the box. This proves forward invariance. To handle weak inequalities rigorously, the source applies Grönwall’s inequality to squared distance from the box, using the local Lipschitz property of the vector field. A strict inward-pointing condition is unnecessary. (OpenAI, 2026a)

In particular,

Suppose the maximal radial solution ended at some finite . Fix a positive . Integrating these logarithmic bounds on gives

Also . Away from , the equations form a regular first-order system for whenever . The bounds keep this state in a compact subset of that regular region. The ordinary continuation theorem therefore extends the solution past , a contradiction.

We obtain global positive with . The separated construction then yields the promised entire affine maximal graph. It is visibly nonquadratic on the vertical line:

This also directly demonstrates why a global positive Hessian lower bound is unavailable. The invariant-box argument proves global existence; it does not require or establish convergence of the trajectory to the stationary corner, nor does it establish completeness of the affine metric.

🏷️ Tangent sections and the rigidity mechanism

We now return to . A tangent section measures the height above a tangent plane. For a base point , define

The central geometric conclusion is a single balance constant working at every base point and every height:

This says that a section cannot stretch arbitrarily far in one direction relative to the opposite direction measured from its tangent point. It is much stronger than positivity of the Hessian at each individual point. The rigidity manuscript derives this global balance from completeness and stationarity. (OpenAI, 2026b)

Compact caps and additional recession directions

First, Euclidean completeness makes tangent sections compact inside . If stayed bounded along points approaching a finite boundary point, convexity would give a lifted line segment with finite length approaching the missing boundary, contradicting completeness. Local positive definiteness near , followed by convexity along rays, also gives a positive linear lower bound for outside a small ball. This prevents sections from escaping to infinity.

Consider the closed epigraph and all full-dimensional local limits of its invertible affine images. Such limits may have flat faces, so differential identities will be applied to smooth approximating hypersurfaces, not directly to a potentially nonsmooth limit.

The source organizes these limits by recession directions. A -direction model has coordinates with and , lies in , contains the nonnegative coordinate orthant with , and has compact caps cut out by . Its transverse fibers are convex bodies . Moving coordinatewise upward enlarges the fiber. Tangent-plane coordinates provide at least one such direction.

Choose the largest possible . A compactness argument shows that fibers of all maximal models are uniformly centered at their distinguished origin. Otherwise normalize a badly centered fiber by its John ellipsoid, pass to a limit where the origin lies on a supporting face, and magnify thin slices next to that face. This produces an additional recession direction, contradicting maximality. John normalization here means using a maximal inscribed ellipsoid to bound the ratio between an inner and outer Euclidean ball after a linear map; the map must preserve the distinguished origin.

There is a necessary compactness detail: normalizing one thin slice must control the entire cap. The source obtains that control by contracting any point in a cap toward the normalized slice and interpolating with a fixed point on the new axis. This bounds all transverse coordinates by a constant times the cap height. Consequently the further affine limit exists with compact caps. The centering constant is uniform over models and their coordinates, which will eventually give one for all tangent sections.

The analytic work is to exclude maximal models with .

🏷️ A dimension-dependent energy inequality

For , put . Parametrize a smooth positive fiber by its support function , where is the outward normal direction in the transverse variables. Set

The matrices are positive definite on these smooth tube charts. For , the sphere consists of the two endpoints of an interval; the angular matrix is empty and its determinant is one. Thus this endpoint case is included.

Two densities encode the geometry:

The second is the volume density of the metric with blocks and . Let , , and , with norms and pairings taken using the corresponding inverse metric blocks. Weighted integration by parts in the affine-area equation produces an energy whose integrand is

The paired quadratic form in has matrix

At , its determinant is . This identifies the critical dimension, but the scalar term vanishes when . The source instead chooses , for which

The diagonal entries are positive as well. Applying Young’s inequality to the cutoff terms absorbs the mixed derivatives and bounds the resulting positive energy by cutoff-gradient energy. Thus the dimension restriction is a specific coercivity calculation within a larger geometric argument. Failure of this calculation at dimension ten would not itself construct a counterexample; that is the role of the separate radial manuscript. (OpenAI, 2026b)

Polynomial mass growth versus exponential mass growth

Pass to logarithmic coordinates and define

The weighted energy estimate implies, for compactly supported cutoffs ,

The gradient on the right is Euclidean in the variables. This change is useful because multiplying by a positive constant translates , while the geometric measure is unchanged under the corresponding coordinate normalization.

The source supplies two estimates needed to turn this inequality into a contradiction. First, a fixed inner box has a uniformly positive amount of mass. A small convex quadratic replacement inside a cap, together with concavity of the affine-area integrand and stationarity, gives positive cap area. Stretching a strip next to a face shows that its area tends to zero with its thickness. Therefore the positive mass cannot all disappear onto the coordinate faces. This argument also excludes the endpoint , where no transverse direction remains.

Second, every unit logarithmic cell has uniformly bounded mass after normalizing its central fiber. The affine-area first variation against a cap-supported displacement toward an interior point controls inverse-Hessian terms. Bounds on the gradient images of convex support functions control the complementary determinant factors. Hölder’s inequality combines these estimates. Uniform fiber centering is what makes their constants independent of the cell’s location.

Write . Covering by unit cells gives polynomial growth,

On the other hand, insert a cutoff equal to one on , zero outside , with bounded gradient in the intervening shell. The energy inequality gives

Starting from the positive inner mass, iteration forces exponential growth, contradicting the polynomial upper bound.

All these estimates are used on smooth approximants. The correct order is to choose a finite large enough for the two growth laws to conflict, then choose one approximant sufficiently far along for every cell and cutoff in that finite argument. No differentiation of the limiting convex set and no interchange of infinite limits is needed. Thus the maximal recession count is one, and uniform centering gives the desired balance of every tangent section.

🏷️ From section balance to a quadratic polynomial

The final argument explains why the global section estimate is strong enough for rigidity. Restrict to a line from and subtract its tangent:

Apply balance to a section based at that just reaches . It also reaches the point at parameter , giving

Convexity bounds for . Choosing gives a uniform doubling inequality with

It also proves that belongs to the line’s domain. Iteration extends every ray indefinitely, establishing .

Translate an arbitrary base point to zero and subtract its tangent. John normalization and section balance produce invertible linear maps such that

with fixed , independent of . Balance bounds both directions of every small section near the center. Iterating the doubling inequality backward then supplies a single positive function such that for , uniformly in . This is a quantitative modulus of strict convexity, not merely a Hessian positive at each point.

The manuscript now invokes the Trudinger–Wang interior estimates for the affine maximal equation. Applied to these normalized solutions with their uniform modulus, they give

where the constants do not depend on section height. This analytic estimate is an imported ingredient; the article does not reprove its underlying Monge–Ampère and linearized regularity theory.

Let , which is fixed. Since , the lower bound implies . Transforming third derivatives back gives

Letting forces . The base point was arbitrary, so the Hessian is constant throughout the domain, and is a positive definite quadratic polynomial. This is the final rigidity mechanism: uniform estimates after normalization become vanishing third derivatives on larger and larger original sections. (OpenAI, 2026b)

🏷️ The immersed consequence and verification boundary

The rigidity manuscript also treats connected smooth open (noncompact and without boundary) locally uniformly convex immersed hypersurfaces of dimensions three through nine that are affine complete and classically affine maximal. It imports a theorem of Trudinger and Wang converting affine completeness to Euclidean completeness and a global convex graph representation after an affine change of coordinates. The graph theorem above then identifies the hypersurface as an elliptic paraboloid. That reduction has an additional external dependency beyond the proof for an already given graph. (OpenAI, 2026b)

The two papers therefore address carefully specified versions of the Bernstein question. In low dimensions, Euclidean completeness forces global section control and then quadraticity. In dimension ten, pointwise strict convexity and an entire domain coexist with a nonquadratic solution. The construction’s decaying vertical Hessian illustrates precisely why those hypotheses should not be strengthened silently.

The source review followed both manuscripts’ proof architecture, including the seven recorded TeX files, the radial origin construction and continuation argument, the convex-limit geometry, and the logarithmic mass estimates. Exact symbolic checks reproduced the separated-profile identity, the invariant-box stationary corner, and the displayed coercivity determinants. These elementary checks do not independently verify the full analytic proofs or the external regularity and completeness theorems.

🏷️ Key steps and proof outlines

The radial normalization converts blowup risks into bounded ratios

The regular radial system uses , , and

For it is smooth whenever . The issue is therefore not a singular coefficient at an arbitrary positive radius, but possible escape toward infinity or toward the boundary of this positive region. Logarithmic derivatives measure exactly those possibilities.

The smooth origin expansion gives , , and . Thus the trajectory enters the stated invariant box near . To justify invariance even at corners, project a point to the box as . The face inequalities imply . Local Lipschitz continuity then gives

Gronwall prevents exit. Integrating the bounded logarithmic derivatives on any finite radial interval keeps uniformly bounded above and away from zero. The regular ODE continuation theorem then gives an entire solution. (OpenAI, 2026a)

The rigidity energy needs both a positive matrix and a positive scalar term

At the formal choice , the determinant suggests the critical dimension, but the scalar coefficient vanishes for two recession directions. Choosing repairs that endpoint while preserving positive definiteness for dimensions three through nine.

Consequently the integrated support-function identity controls a strictly positive density, not just its derivative terms. Young’s inequality absorbs the cutoff cross terms into that coercive quadratic form. Passing to logarithmic coordinates makes the cutoff cost invariant under independent scaling of the recession variables, which is necessary for an estimate uniform over distant cells. (OpenAI, 2026b)

One finite growth contradiction rules out every multidirectional limit

The source first proves positive mass on an interior logarithmic box and a uniform upper bound on each unit logarithmic cell. The first excludes loss of all mass to coordinate faces; the second excludes arbitrarily large mass in a single normalized cell. Covering yields polynomial growth .

The cutoff energy inequality, applied between boxes of radii and , forces a fixed factor of growth at each step. Starting from positive interior mass gives exponential growth. Choose one finite where these bounds conflict, and only then choose a smooth approximant accurate enough for all finitely many tests. This avoids differentiating the limiting convex body.

The resulting section balance is used in the affine-complete rigidity theorem. The dimension-ten example instead obtains Euclidean completeness from being an entire graph; it does not assert affine-metric completeness. These different completeness hypotheses explain why the explicit counterexample and the affine-complete consequence do not contradict one another.

🏷️ Manuscripts and verification scope

The family scope page describes selected formalization coverage. The selected statement is Euclidean-complete graph rigidity in dimensions three through nine. The immersed consequence is explicitly outside that selection, and the comparator list does not select the smooth dimension-ten counterexample despite the broader page heading. No Lean build, axiom audit, or manuscript-to-formal-statement equivalence check was performed for these notes.

OpenAI collection provides prerequisites and the reading sequence; coverage register records completed and pending families.

🐻  OpenAI 2026a. A Smooth Nonquadratic Entire Affine Maximal Graph in Dimension Ten.
🐻  OpenAI 2026b. The affine Bernstein theorem in dimensions three through nine.