Source and verification

This article explains family 354 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.

On a flat three-dimensional torus, a small amount of material can form a ball. More material can wrap around a periodic direction as a solid tube. Near half volume, a slab has only two flat boundary components. This family asks whether any more complicated shape can improve on those three candidates.

The manuscript proves that the candidates exhaust all minimizers in the cubic flat three-torus, including the ties at the two transition volumes. The proof’s distinctive step concerns nested planar sections: individually optimal slices need not fit inside one another, and their required nesting forces an additional area cost. An explicit arithmetic argument closes the resulting one-variable inequality. (OpenAI, 2026)

The prerequisites are multivariable calculus, surface area, the divergence theorem, and elementary variational calculus. We introduce perimeter, curvature conventions, and the stability input before describing the proof. The discussion follows the manuscript’s source; the finite arithmetic checks reproduced below have a narrower scope than the complete geometric theorem.

🏷️ The torus and the perimeter problem

The unit cubic flat torus is : identify opposite faces of the unit cube, with the Euclidean metric locally. Its total volume is one. A coordinate circle travels once around one periodic direction and has length one.

For a measurable set , its perimeter is the total variation of its indicator function. One definition is

where the supremum runs over smooth vector fields on the torus. For a smooth region this equals the area of its boundary. The definition also accommodates limits of smooth regions and ignores changes on sets of volume zero.

The isoperimetric profile is

Existence and regularity of minimizers are classical inputs in the manuscript. In dimension three their boundaries are smooth embedded surfaces. Complementation preserves perimeter, so the profile at equals the profile at . It therefore suffices to consider .

The three candidate calculations are elementary:

RegionVolumeBoundary area
Ball of radius
Circular tube of radius around a coordinate circle
Coordinate slab of width

There are no end caps on a tube: its axis closes periodically. A slab’s two boundary tori each have area one.

Profile and all equality cases

The manuscript proves that is the minimum of the three expressions

Up to ambient isometry and changes on null sets, all minimizers are balls, circular tubes about shortest closed geodesics, coordinate slabs, and their complements, in the ranges below. (OpenAI, 2026)

Equating consecutive expressions gives

Smaller volume Minimizing typeParameter in the unit torus
Ball
Tube
SlabWidth

At , both balls and tubes minimize. At , both tubes and slabs minimize. The classification excludes additional minimizers at these endpoints. For , take complements of the listed regions at volume .

The bold curves form the candidate lower envelope; dashed curves show the competing perimeter formulas. The theorem asserts that the true profile equals this envelope. At the last volume of the ball branch its radius is , and at the last volume of the tube branch its radius is . Both are below the transverse injectivity radius , so these branch representatives embed without self-intersection.

A tube around a primitive closed geodesic of length has perimeter at enclosed volume . Equality with the tube candidate therefore requires . Similarly, parallel planar tori bounding a region have total area at least two, with equality only for a pair of coordinate tori. The cubic metric matters: general flat tori have different shortest lattice vectors and do not fall under this particular formula or classification.

🏷️ Curvature, stability, and the two-volume reduction

The source doubles all lengths and works on . It uses normalized volume and area

Thus is still the original volume fraction, while is half the unit-torus perimeter. The outward sum curvature is , positive on a ball. It is measured in the doubled metric and is not divided by eight. The normalized candidate profile is

A volume-constrained area minimizer has constant . Its second variation is nonnegative for normal speeds of mean zero:

Here , is the second fundamental form, and the mean-zero condition is . It expresses first-order preservation of volume.

The manuscript imports classical structure results of Hauswirth–Pérez–Romon–Ros and Ritoré–Ros. A minimizing boundary is either a union of parallel planar surfaces or is connected. In the connected case, genus zero gives a sphere, genus one gives a planar or circular-cylinder quotient, and genus is at most four. A nonstandard minimizer therefore has genus , where genus counts handles, and satisfies

For genus two or three this is the imported curvature–area estimate; genus four has . These structural theorems are external inputs, rather than consequences proved from the slice inequalities below. (OpenAI, 2026)

Why only the two transition volumes remain

Let be the normalized profile, so . Move a minimizing surface a small distance in its normal direction and express its area as a function of the enclosed volume. This gives a smooth upper support: near the original volume and there. Parallel-surface formulas and Gauss–Bonnet give

when the boundary is connected of genus . The profile is continuous, concave, and symmetric about ; the concavity follows from the nonpositive second derivative of these upper supports. In particular, every outward contact curvature is nonnegative below half volume and nonpositive above it.

Suppose every minimizer at is standard. Then at those points and their complementary volumes. On each intervening smooth branch,

If had a negative minimum in a branch interior, the minimizing surface there would be nonstandard: a standard region has area at least . Its upper support would satisfy , , and . Consequently

a contradiction. Once is known, the same contact argument excludes nonstandard co-minimizers inside each smooth branch. The endpoint assumption itself excludes them at the branch junctions.

This is why proving only that the candidates have the correct endpoint perimeter would leave an equality-case obligation. The manuscript proves that every endpoint minimizer is standard, which completes both the profile and the classification.

🏷️ Reflection and the remaining vertex patterns

Assume that a nonstandard endpoint minimizer exists. Bisect its occupied volume by a pair of parallel coordinate tori. Reflect each half separately to obtain two competitors of the original volume. Their average perimeter is the original minimum, so both are minimizing. The seams add no perimeter.

A further argument recovers symmetry of the original minimizer. Its boundary and each reflected competitor are connected analytic constant-mean-curvature surfaces sharing an open patch. Analytic continuation makes their boundaries coincide, and agreement of the occupied side on that patch propagates as well. Repeating in the three directions makes the original region invariant under reflection in the faces of .

Normalized volume and area now equal volume and relative perimeter inside . Relative perimeter counts the separating surface inside the cube, not portions of the cube faces occupied by the region.

After reversing suitable coordinate axes, each component of the outward unit normal is strictly positive away from the corresponding pair of faces. The stability proof is instructive. Translation makes a solution of the Jacobi equation

If it had at least three nodal domains, a mean-zero combination of its restrictions to two of them would have zero stability energy and vanish on an unused open domain. Polarizing stability shows this combination solves the Jacobi equation up to a constant; vanishing on the unused domain makes that constant zero. Unique continuation then forces it to vanish everywhere, a contradiction. Reflection and the maximum principle give the strict signs. The identically zero case would give an axial product surface of genus one, already excluded.

It follows that is a down-set: decreasing any coordinate preserves membership. No cube vertex can lie on the boundary, since reflection would force all three components of its normal to vanish there. After coordinate permutations and an appropriate occupied-side choice, the remaining nonstandard patterns are

One occupied vertex would give a sphere by radial parametrization. Two would give a tube boundary of genus one. Four vertices filling a face would produce disconnected graph components. These possibilities are already standard or contradict connectedness. The four-vertex pattern may be assigned to the smaller-volume side; the three-vertex pattern needs the curvature argument below to establish that orientation. (OpenAI, 2026)

🏷️ Slice flux, projection, and coarea

Slice in the direction. Let be the area of the occupied planar section, its relative perimeter, , and . Put

The quantity is the surface coarea Jacobian for height. First variation with a vertical vector field, the divergence theorem, and coarea give

The last inequality is Cauchy–Schwarz applied to . In the three axial directions, and each .

The corresponding area-coordinate formulas are

The manuscript checks their validity through exceptional heights. A critical height can occur only at an axial edge; strict normal signs and compactness leave finitely many such levels. The nested area function is continuous and smooth elsewhere. Its possible singular derivative measure is supported on that finite set, and continuity rules out atoms. Thus is absolutely continuous and substitution by section area is legitimate. One does not assume differentiability of the inverse function .

For the four-vertex pattern, choose an axis with . Planar isoperimetry bounds the top occupied corner and bottom complementary corner. Together with the endpoint flux and projection inequalities, these force a scalar inequality of the form

where , , , and . An elementary lemma in the source proves that the displayed right side is strictly less than one throughout this domain. Its proof splits small and large , uses monotonicity in the first range, and bounds a rescaled cubic in the second. This excludes the four-vertex pattern at both endpoints.

For the three-vertex pattern, slice in its missing axial direction. The top slices are empty, so the flux constant vanishes:

The bottom complement has positive area, so . Profile concavity then puts this occupied pattern on the smaller-volume side. At , the inequalities already contradict elementary scalar estimates. At , they only reduce the possibilities to

This last configuration is the difficult case.

🏷️ From averaged flux to a baseline area bound

The planar slice candidates give

They correspond to an occupied corner, a strip, or a complementary corner. To exploit this bound while retaining flux, choose and define

The function decreases until and then increases; . Thus is a nonincreasing minorant, defined even when a substituted argument exceeds one, and .

Flux specifies the arclength mean of , namely . It does not specify pointwise. The relevant Jensen argument uses, for , the convex function

Set . Its value at the mean is nonnegative because , and Jensen gives an inequality for the whole slice. If a measurable function bounds from below at regular slices, integration by coarea and substitution by section area give

Since is nonincreasing, replacing by its lower bound weakens the lower estimate in the correct direction. Thus is admissible without choosing an inverse height function. Define

Then . The source proves outside , but . The ordinary planar isoperimetric inequality therefore leaves a real deficit in the central range. (OpenAI, 2026)

🏷️ Nesting forces an extra perimeter cost

Every slice lies inside the bottom slice. Let be the extents of its complementary corner along the two adjacent edges. A unit-vector calibration of the monotone boundary curve gives, separately for either extent ,

For example, in coordinates from that corner, pair its tangent with the unit vector . Integration gives the complementary area divided by , plus the quarter-circle integral . Convexity of the planar corner is not required.

Solving the quadratic inequality bounds both extents from below. Hence a contained strip, in either orientation, has its smaller endpoint at most

Write . The defining identity for gives

Thus either the slack is substantial, already contributing to area, or the smaller strip endpoint is forced low. A strip with a low endpoint and prescribed area cannot remain nearly horizontal without paying extra length.

The quantitative argument chooses

On the slice-area interval , the planar baseline is the strip value , and . If a strip is written as a decreasing graph , then . Its area therefore gives

Pairing its tangent with , for , and estimating the square root below gives . Consequently .

The slice could change type in this interval. The proof retains that possibility by defining

For , the uniform estimate is for all three slice types. The strip estimate supplies the branch. Ordinary planar isoperimetry supplies the other cases, including the endpoint where the complementary-corner gain vanishes. The case simply has zero improvement and does not use .

Differentiating converts this perimeter improvement into an improvement of the integrated area bound. It has size across an interval of width , producing a gain proportional to . Explicit moments of and a second Jensen estimate give the coefficient

Combining this with the bottom-area slack and minimizing over its unknown value gives

The infimum expresses the tradeoff: increasing the bottom area costs the first term, while keeping it close to its minimum forces the nesting cost. The improvement controls both strip orientations without assuming equal edge extents. (OpenAI, 2026)

🏷️ Finite arithmetic and the continuous interval

The remaining claim is positivity of on the exterior curvature ranges and of on the central range. Checking a plot or a finite grid would not suffice. The appendix supplies both finite enclosures and a bound between sample points.

First, a layer-cake representation rewrites the integral defining using three explicit inverse branches. Only one branch requires approximation. A cubic Taylor polynomial at its interval midpoint produces with error

The polynomial integrals reduce to square roots and arcsines. Machin’s identity encloses by rational alternating sums; applying the arcsine half-angle identity twice reduces its evaluation to a short power series with an explicit positive tail. All arithmetic is rounded outward at denominator , with square roots bounded by integer-square comparisons.

The gain has an explicit evaluation too. Put

Then is the minimum of and . The manuscript checks the capped, uncapped, and zero branches, including cases where the displayed critical point is outside the feasible uncapped interval.

For interpolation, an upper second derivative bound means that is concave. This formulation includes corners and changes of formula. It implies

The source proves an upper bound for on an exterior interval , and for on the central interval. Thus suffices for there. Downward derivative jumps at branch changes preserve these bounds; taking the infimum defining preserves the required concavity after subtracting the quadratic.

The certificate uses 24 knots and 23 intervening intervals. For example, at its deliberately rounded lower bounds give , the Taylor error is zero, and the interpolation loss is . The resulting uniform margin is . Every interval has a positive certified margin, so the putative minimizer would satisfy , contradicting the slab competitor.

Arithmetic reproduced for these notes

An independent transcription of the appendix’s outward arithmetic prescription passed all 24 baseline knot bounds, all 16 applicable gain bounds, their stated rounding-slack checks, and all 23 rational interpolation comparisons. The smallest certified interval margin was . The checker used Python integers and rational numbers with assertions enabled; it did not use floating-point evaluation for these certificates.

The arithmetic checker is included for reproducibility. Its source hash, enclosures, and exact interval margins are retained in the local audit report. This is a transcription of the manuscript’s stated prescription, rather than execution of a supplied repository program. The successful run checks the finite arithmetic; the slice reduction, curvature estimates, calibration inequalities, and analytic upper second derivative bounds remain separate mathematical ingredients.

The four-vertex pattern is excluded at both transitions. The three-vertex pattern is excluded by elementary estimates at and by nesting plus the certified inequality at . All endpoint minimizers are therefore standard. The two-volume reduction propagates the profile and equality classification to every volume, and undoing the length doubling restores the unit-torus formula.

Cartan–Hadamard isoperimetry develops comparison inequalities in nonpositively curved simply connected spaces. The cubic torus is locally flat but globally periodic, so wrapping around a closed direction changes the minimizing shape. Affine Bernstein rigidity also uses geometric organization before scalar estimates, through tangent sections rather than nested planar slices.

The source review covered the main file and seven proof sections, including both scalar appendices. The finite checker provides additional evidence for the arithmetic tables. These checks are not an independent verification of the full theorem or of the classical structure and regularity results invoked by the manuscript.

🏷️ Key steps and proof outlines

Jensen must be applied to the right flux-adjusted function

A slice supplies the mean of its geometric factor , not pointwise control of . The manuscript therefore fixes and uses

Its convexity follows from

Indeed the fraction decreases from two to zero before its numerator changes sign, and is nonpositive afterward. Take , where is the nonincreasing minorant described above. Then , and Jensen with normalized arclength gives the whole-slice flux inequality.

The nonincreasing property matters separately: replacing the unknown perimeter by a lower bound increases and therefore decreases the proposed lower bound. Without this monotonicity, a correct planar isoperimetric inequality could be inserted in the wrong direction. Coarea then converts the integral over heights into an integral over decreasing slice areas. (OpenAI, 2026)

Nesting turns a pointwise endpoint restriction into a cubic gain

The bottom slice bounds the short endpoint of every contained strip, in either orientation. A calibrated tangent test converts the gap between strip area and that endpoint into a perimeter improvement quadratic in the gap. The source retains all possible slice types by taking the minimum of the strip improvement and the complementary-corner estimate.

This improvement has size over an area interval of width , so its integrated effect is cubic. The unknown bottom-area slack contributes a competing quadratic cost. Minimizing their sum produces , keeping both possibilities: either the bottom is larger than its minimum, or nesting forces enough extra perimeter. The argument never needs the two corner extents to coincide.

A one-sided second derivative bound certifies the intervals

Finite lower bounds at knots do not prove positivity between them. If is concave on , the chord inequality gives

Since , this yields the stated interpolation loss . Downward jumps of derivatives preserve concavity, so changes between the capped and uncapped gain formulas do not invalidate the estimate.

The existing checker verifies exact outward arithmetic and the rational comparisons at every interval. The analytic upper bound on the second derivative and the geometric slice inequalities are separate prerequisites for interpreting that arithmetic as a continuous positivity proof. Together they exclude the final vertex pattern at the transition volume, after which the profile-support argument supplies the full ball–tube–slab classification.

🏷️ Manuscripts and verification scope

The family scope page describes selected formalization coverage. The documented selection includes existence, the profile, all minimizers up to null-set changes, and all equality cases at both transition volumes. 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 2026. The Isoperimetric Conjecture for the Cubic Flat Three-Torus.