Source and verification

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

🏷️ Spin chains and a uniform spectral gap

A finite quantum spin chain is a tensor product of small Hilbert spaces, with a Hamiltonian that couples neighboring factors. For spin one, each site has space . In the basis , define

These self-adjoint matrices satisfy . Write for acting at site , and .

On a periodic ring with even length , the pure bilinear antiferromagnetic Heisenberg Hamiltonian, with coupling one, is

Let be its lowest energy and the next distinct energy. Its gap is . Each non-scalar finite-dimensional Hamiltonian has a positive gap in this sense. A uniform gap requires a lower bound that persists as the number of sites grows.

Family 268 contains a manuscript claiming such a bound for even periodic rings and a companion treating odd open chains with specified endpoint magnetic fields. Their boundary conditions and spectral conventions must be kept separate. The prerequisites are tensor products, the finite-dimensional spectral theorem, compact self-adjoint operators, elementary probability, and matrix exponentials. (OpenAI, 2026) (OpenAI, 2026a)

Claimed periodic bounds

The ground state is unique for every even . For these lengths, . For every even , the stronger bound holds. Consequently the even-length lower limit of the gaps is at least . (OpenAI, 2026b)

The interaction here is just . The well-known gapped AKLT model includes an additional quadratic term in this bond operator. A gap for that different interaction, or for a neighborhood of it, does not by itself prove the stated result at the pure bilinear point.

🏷️ Two probability distributions from one partition function

At inverse temperature , introduce the shifted partition function

The scalar shift helps organize finite estimates but cancels from normalized Gibbs probabilities and spectral gaps. If lists all energy eigenvalues with multiplicity, the physical probabilities are

The manuscript constructs a compact self-adjoint spatial operator with square-summable eigenvalues such that

This identity is used for even . The spatial operator need not be positive. Even powers make the last terms nonnegative, giving a second probability distribution . This is why parity enters the argument.

The transfer construction can be described concretely. In Cartesian spin coordinates, is real with norm one, and the negative bond interaction is . A bond history is a finite ordered list of times in , each labeled by . Give each ordered time simplex its Lebesgue measure and the empty list mass one. The total history measure is .

For two histories, merge their events chronologically and take the trace of the resulting product of matrices. This kernel is real, bounded in absolute value by three, and symmetric: swapping the two histories leaves their merged chronological list unchanged. It does not reverse the order of noncommuting matrices. The resulting integral operator, multiplied by , is self-adjoint and Hilbert–Schmidt. Expanding the physical exponential in ordered bond events and regrouping the absolutely convergent series gives the spatial trace identity. This analytic identification is an essential input beyond the finite computations. (OpenAI, 2026b)

For a probability distribution, its purity is the sum of squared probabilities. Define

is the spatial purity; is the physical Gibbs purity. Both lie in . Doubling length squares the spatial weights; doubling inverse temperature squares the physical weights.

🏷️ Squaring probabilities and coupling the purities

Let sum to one, and put . The normalized squares have purity . Direct expansion gives

The inequality uses and . Nonnegative summands justify the same calculation for countable distributions. Thus a purity defect improves to at most

For small , this is a quadratic improvement. However, separately squaring the two distributions changes different parameters. The connection between them comes from exact cancellation of partition functions:

The denominators are at most one. If and , one may first bound

Provided these bounds remain below one, they control the defects of and . The first follows by cancellation and spatial squaring; the second follows by the other cancellation and physical squaring. Either output may be rounded upward before the next use.

To obtain a single recurrence, set

Then . If and , the common defect bound can decrease by . With ,

The error decays exponentially in the inverse temperature, not merely with the number of updates.

🏷️ Intermediate lengths and the physical energy gap

A result only at lengths would leave gaps in the sequence of systems. For nonnegative spatial eigenvalue magnitudes, monotonicity of power-sum norms gives, whenever and the lengths are even,

Indeed, and . Dividing gives the inequality. At the th scale it yields throughout the interval.

The largest physical Gibbs probability is at least its purity. If , it therefore exceeds . Since the probability list counts individual eigenvectors, two ground eigenvectors would supply two equal maximal probabilities, which is impossible. This proves simplicity rather than assuming it.

For the ground weight and a weight at the next distinct energy,

If in addition , the last quantity is strictly less than . Dividing its logarithm by gives . The dyadic intervals cover every even .

The two finite initializations in the manuscript are:

Starting length and inverse temperatureCommon defect and recurrence constantResulting lower bound
, ,
, ,

For example, . For the second row, on . Both rows satisfy the remaining strict conditions. Establishing their initial spatial and physical purities is the finite-certificate part of the argument. (OpenAI, 2026b)

🏷️ Thermal certificates and variational vectors

The thermal inputs are rigorously enclosed traces of short twisted chains. The twists rotate the spin coordinates across one seam; they help separate spatial moments before applying polynomial filters. This finite separation is used as an input here, without developing an abstract symmetry classification.

One initialization uses chains of lengths at with three twists; the other uses lengths through at with two twists. The trace calculations use polynomial approximations to matrix exponentials with explicit errors, rather than relying on numerical eigenvalue estimates.

For example, if is a self-adjoint contraction, then is the average of for a Poisson variable of mean . Conditioning on gives a polynomial with rational coefficients when is rational. Its operator-norm error is at most twice the discarded tail probability: both conditional averages have norm at most one. In one table , , and the exponential-moment bound gives a tail smaller than . The source combines this truncation estimate with explicit integer-arithmetic error bounds and converts column errors into trace intervals.

An upper bound on ground energy supplies the complementary lower bound on a partition function. Real integer matrices define a periodic matrix-product vector by

With , expansion gives . A two-site insertion matrix similarly computes one bond energy; cyclicity makes all bonds contribute equally. The supplied integer data verify at , so the shifted ground Boltzmann factor exceeds one and . These are finite variational inequalities, not claims that the trial vectors are exact ground states. Combining them with the thermal intervals and elementary moment inequalities supplies the two purity seeds. (OpenAI, 2026b)

🏷️ Endpoint fields require an additional argument

For the companion, use sites labeled and impose the same field at both ends:

There is no closing bond. Here are the two lowest eigenvalues counted with multiplicity, so a positive difference itself implies uniqueness. The companion claims for every , that is, every odd chain with at least 1921 sites. It does not assert the same bound for arbitrary endpoint fields or a field-free open chain. (OpenAI, 2026a)

The spatial transfer representation becomes a boundary pairing. For an -site chain with opposite endpoint fields, its shifted partition function is . A rotation that flips the right field gives the same-field expression .

At even powers, the opposite-field pairing has positive spectral weights proportional to the squared boundary overlaps. A dominant eigenvalue in the periodic trace need not have a useful overlap with . Moreover, changes with temperature. Consequently the periodic gap theorem alone cannot supply the companion result.

The source proves that the spatial leading eigenvalue is simple and its line is fixed by the relevant rotations. Write for the squared projection of onto that line and, for even ,

The residual fraction remains defined even if . If all residual eigenvalues have relative magnitude at most , then increasing the power from to contracts their contribution by .

Across temperatures, combine this contraction with the physical purity . For even , assuming the old defect satisfies , the key recurrence has the form

where . Only the old overlap is divided by. A new upper bound below one proves that the next overlap is positive, so the argument does not assume the nonvanishing it needs to propagate.

Thermal moments on at most six sites and four integer trial vectors initialize a coupled recurrence for this boundary defect and the opposite-field Gibbs purity. Once both are small, a common bound satisfies , starting with . Rotation invariance of the leading line controls the signed same-field pairing, including negative residual eigenvalues at odd powers. The resulting same-field purity is at least throughout each length interval. With , the same ground-to-excited probability-ratio argument gives the claimed gap. (OpenAI, 2026a)

🏷️ Local limits and the boundary-selected index

A local observable acts on finitely many sites. Compactness of its finite-volume density matrices gives subsequences of ground-state expectations converging to a state . A finite-volume gap and a unique ground vector imply

in such a limit. To see this, apply the finite spectral inequality to the component of orthogonal to the ground vector. For fixed local , sufficiently distant endpoint fields or the periodic closing bond commute with it. The commutator therefore stabilizes before taking the limit. This proves a local excitation gap without identifying all subsequential limits or all infinite-chain ground states.

The boundary companion also invokes Tasaki’s index theorem. Its index is the limiting expectation of a slowly varying local spin rotation: the angle rises from zero to across a long interval, and the interval length then tends to infinity. Under the specified reflection and axial-rotation symmetries and the proven boundary-field gap, the imported theorem gives index for every subsequential limit selected by these boundary fields. The finite-volume limit is taken before the twist scale tends to infinity. This is not a claim of global uniqueness among all infinite-volume states. (OpenAI, 2026a)

🏷️ Finite verification and its limits

For the boundary companion, we ran all three supplied programs with assertions enabled. They passed 67 exact scalar comparisons and equalities, four variational certificates, five direct physical-space comparisons, and all 15 thermal recurrences with both thermal conclusions. The three trial output files match the stored files byte-for-byte. Every remaining certificate data field also matches after removing explicitly inspected timing, Python-version, and operating-system metadata. The README’s literal comparison rejects some of those environment differences, so we do not report that literal comparison as passing.

The complete periodic verifier also passed from a fresh output directory with assertions enabled. It recomputed all 27 thermal totals and their rational enclosures, both full trial-state norm and energy contractions at lengths 72 and 120, the common trial matrices and a four-site physical cross-check, and every scalar, rounding, initialization, and packing check. All 17 subprocesses exited successfully. The wrapper checked its source manifest and compared the complete exact integers and rational intervals with the supplied evidence; this was the full recomputation, not a smoke test or a check of stored certificates alone.

The finite programs check the stated scalar inequalities, thermal enclosures, and variational contractions. Their successful execution does not replace the analytic spatial-transfer identity, the purity recurrences, the boundary-overlap argument, or the application of the external index theorem. Our source review checks selected mechanisms and the explicit deductions above, rather than independently verifying both complete research proofs.

🏷️ Key steps and proof outlines

Short moments first cap every spatial eigenvalue

The finite thermal tables supply moments of the spatial spectrum, but the bootstrap needs concentration at much larger powers. Two elementary optimizations make that passage rigorous.

First, let , with certified intervals . For a polynomial nonnegative on the real line,

If whenever , then every eigenvalue satisfies . Each term of the sum is nonnegative, so even one offending eigenvalue contradicts the upper bound. For example, the source uses polynomials of the form , built from just three moments. The absolute coefficient sum propagates the interval error, including coefficients of either sign.

Second, suppose nonnegative masses satisfy and . For , convexity gives

To prove this, transfer mass from a smaller partially filled coordinate to a larger one until one becomes zero or reaches . The sum of powers increases, leaving at most one partially filled coordinate. Finite truncations prove the countable version.

Apply these two lemmas to powers of the spatial eigenvalues in the source’s invariant subspaces. They turn short moments into upper bounds on long moments. A variational vector supplies a complementary lower bound . In the first initialization, masses satisfy and . If all , then

a contradiction. Moreover, two weights exceeding cannot fit within total mass . This identifies a unique dominant weight, after which the remainder estimates yield the initial purities. It explains how the short-chain certificate actually feeds the infinite sequence of lengths (OpenAI, 2026b).

The boundary recurrence proves its next nonzero overlap

Here is the derivation behind the companion’s function . At the new temperature, residual contraction gives

Rearrange this without dividing by :

Let . The partition-function definitions give the exact identity

The periodic analysis supplies , and physical purity gives . At the old temperature, the hypothesis ensures , so

Substitution gives the stated recurrence. An output strictly below one then forces . The argument therefore establishes the overlap needed for the next iteration as part of the iteration itself. This is the additional mechanism that allows periodic spectral concentration to control a changing boundary vector (OpenAI, 2026a).

🏷️ Connections

  • Area laws and tensor networks explains consequences of a uniform gap and the role of tensor representations; the present family seeks to establish a gap for a specific interaction.
  • Unbiased bases and exact certificates likewise separates finite certificate computations from the mathematical reductions that make them relevant to a continuous or unbounded problem.

🏷️ Manuscripts and verification scope

No family scope page was present at lean/docs/268.md in the pinned snapshot. This does not establish that all related formalization code is absent. 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 boundary-field gap for the spin-one Heisenberg chain.
🐻  OpenAI 2026b. The periodic spin-one Haldane gap.