Source and verification
This article explains family 262 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.
🏷️ Bound states and the cost of a potential
A one-dimensional Schrödinger operator describes the competition between kinetic energy and an attractive potential. For a scalar potential , its formal expression is . The negative eigenvalues describe bound states. A deeper or wider potential can bind more states, and the Lieb–Thirring problem asks how their total binding energy is controlled by an integral of .
The matrix version acts on , where is a finite number of internal components. The potential is Hermitian positive semidefinite almost everywhere. Fix
and assume . The trace is the ordinary unnormalized matrix trace. Powers of a positive matrix are defined by applying the scalar power to its eigenvalues.
For rough potentials, define the operator through its quadratic form on :
This form is closed and bounded below. One useful estimate is
It follows from Hölder, the one-dimensional Sobolev estimate, and Young’s inequality, since . Truncating the potential in both space and size also shows compactness of multiplication by from to . Therefore the negative spectrum consists of isolated eigenvalues of finite multiplicity, with possible accumulation only at zero. Smoothness or boundedness of is not assumed.
The spectral moment is
counting multiplicity. Before a bound is established, this sum may be infinite. The capital trace refers to the operator on the function space; the lowercase trace refers to a finite matrix.
🏷️ The family theorem and its three parts
Sharp bound, as claimed in the family
For every finite and every measurable positive semidefinite Hermitian potential in the class above,
The optimal constant is
The same constant works in every finite matrix dimension. (OpenAI, 2026)
Here is Euler’s gamma function, satisfying . The conclusion concerns the full spectral moment, not a fixed number of eigenvalues. In particular, it proves finiteness of that moment under the stated potential assumption.
| Manuscript | Main contribution | Scope |
|---|---|---|
| September scalar paper | Sharp constant throughout the open exponent interval | Scalar potentials; gives an attaining profile |
| October matrix paper | The same sharp constant for arbitrary finite matrix size | Potentials need not commute at different positions |
| October equality paper | Classification of every equality case | One fixed internal basis; independent scalar profiles |
The scalar paper uses matrices to organize a finite family of scalar eigenfunctions. That does not make its potential matrix-valued. The October inequality paper supplies the additional comparison needed for genuine matrix potentials. The equality paper then strengthens the argument to retain the defects that must vanish at an optimizer. (OpenAI, 2026a) (OpenAI, 2026b) (OpenAI, 2026a)
The exponent range is open. The family does not extend the equality classification below to or ; the upper endpoint permits different scalar equality configurations.
🏷️ Scaling and the one-state profile
The integral exponent is dictated by scaling. If , a unitary rescaling multiplies each eigenvalue by , while
Matching the spectral factor requires .
Set . The scalar profile at scale and center is
Here . Its bound-state function is proportional to . Indeed,
so . The function decays exponentially and lies in .
It is useful to check that this is the only negative eigenvalue. Put and . Then
The first factorization excludes eigenvalues below . Its kernel is the one-dimensional span of . If another eigenvalue lay between and zero, applying to its eigenfunction would give a nonzero eigenvector of with eigenvalue , contradicting the second bound. The strict range supplies the favorable partner potential.
For the potential cost, substitute and then :
Since the spectral moment is exactly , the ratio of moment to cost equals the displayed . This proves that no smaller constant can work. For example, gives , at unit scale, and .
The remaining difficulty is the universal upper bound: showing that many bound states, or noncommuting internal channels, cannot improve this ratio. An explicit optimizer alone does not settle that direction. (OpenAI, 2026b) (OpenAI, 2026a)
🏷️ A finite-interval action inequality
Write , so , , and is conjugate to . Start with orthonormal real vector-valued functions on a bounded interval , vanishing at its endpoints. Arrange them as the rows of ; orthonormality means .
Let with . For , where is lower triangular, put and consider the action
The Hilbert–Schmidt norm satisfies . The action theorem claims
Each integral equals , where and is Euler’s beta function. The action lower bound thus retains every individual eigenvalue scale. (OpenAI, 2026c)
To connect this to the spectral problem, order trial energies as . Lower triangularity makes row a combination only of the first trial functions. For an orthonormal family with diagonal form matrix ,
The sign would not follow for arbitrary row mixing. Summing and using the common nonzero eigenvalues of and gives, with ,
Scalar maximization yields
The same constant works in the matrix trace inequality even if and do not commute. Diagonalize with eigenvectors and eigenvalues , and put . Convexity gives . Summing the scalar inequality therefore bounds the action by .
Combining the lower and upper action bounds gives the spectral constant . Smooth compactly supported approximations to each finite eigenfunction family are corrected by their Gram matrices and their form matrices. Passing to the approximation limit proves every finite partial-sum bound; taking the supremum over partial sums gives the full negative moment. The complex Hermitian case follows by realification: both the spectral moment and the potential trace integral double, so the ratio is unchanged.
🏷️ The noncommuting matrix comparison
The action lower bound is the main analytic input. The source constructs a symmetric path joining to , with a regularized matrix field imposing a density constraint. A penalty enforces the constraint, and continuation supplies both the path and the lower triangular coefficients. The penalty limit is taken at fixed regularization, then the regularization is removed. This construction is not supplied by the elementary Young inequality above.
For scalar potentials, the density has rank at most one. Matrix potentials require a trace comparison for arbitrary rank. The October paper isolates it as follows. For Hermitian matrices , assume
for some . Define a weighted integrated resolvent difference
The positive normalization is chosen so that in the scalar case , one gets . The claim is
The perturbation itself may be indefinite: positivity is required of the full symbol , and is an additional hypothesis. Replacing either condition by an informal positivity assumption would alter the statement. (OpenAI, 2026c)
The proof represents the integrated resolvent using decaying solutions of a constant-coefficient differential equation on two half-lines. Their boundary matrices satisfy Riccati identities with commutator terms. A logarithmic-determinant identity expresses the comparison deficit through nonnegative matrix terms. These terms control the noncommutative error while preserving the scalar constant. The full identity and global connecting-path argument remain source inputs in these notes.
🏷️ Equality and fixed internal channels
The equality companion claims a complete classification. Equality holds precisely when, for some constant unitary matrix ,
almost everywhere, with , , and arbitrary real centers . Scales and centers are independent; repeated profiles are permitted. The case is the zero potential. Every nonzero channel contributes exactly one negative eigenvalue , so every extremizer has at most negative eigenvalues counting multiplicity. (OpenAI, 2026a)
The fixed basis is stronger than pointwise diagonalizability. A position-dependent unitary change of basis also changes the kinetic energy through derivatives of that basis; it cannot simply split the problem into scalar copies.
The proof retains quantitative defects in the action estimate. Besides , it controls failure of
The coefficient is independent of the number of trial rows and of the smallest binding scale. This is essential because an equality potential is not initially known to have finitely many negative eigenvalues. The number of columns remains as the trial list grows; the source uses this rank bound and the small tail binding energies to obtain compactness and exact limiting relations.
Group the limiting rows by their common binding scale . Their matrices satisfy with uniformly bounded . For a fixed vector ,
Gronwall’s inequality implies that if vanishes at one point, it vanishes everywhere. Thus its kernel, and hence its row space in the physical internal space, is constant in position. Different energy blocks have orthogonal row spaces, so their total dimension is at most .
After the corresponding range spaces are also fixed, the source obtains a finite matrix Riccati equation
Diagonalize at one point. The differential equation is polynomial in , and uniqueness preserves that basis. Each diagonal entry is , producing the displayed scalar profiles. A separate realification argument recovers a constant complex unitary basis. Conversely, the one-state factorization and integral computation above verify equality for every listed finite direct sum.
🏷️ Key steps and proof outlines
The scalar paper removes a noncommuting average by a trace argument
Even the scalar-potential action proof contains noncommuting auxiliary matrices. In its rank-one comparison, write , , and . The regularized tangent inequality produces an averaged matrix rather than itself. In an eigenbasis of , the averaging multiplier is
where for the scalar regularized field .
Proof outline. A gamma-integral representation expresses this multiplier as a mixture of Gaussian characteristic functions. Thus for an even probability measure . For any increasing scalar function and Hermitian ,
expanding in their two eigenbases gives a sum of scalar monotonicity terms with nonnegative overlap weights. Apply this to a matrix and its conjugate by , integrate the field parameter, then average in . The result is . Pairing the tangent inequality with rank-one , where , now gives . The rank-one relation is essential to this cancellation; the matrix-potential companion needs the stronger mechanism below. (OpenAI, 2026b)
Half-line boundary maps expose the full matrix deficit
Use from the integrated comparison above and set . For the constant-coefficient equation , let the decaying right and left solutions with boundary value have covariant derivatives and . Coercivity of the full symbol gives their existence and uniqueness.
Gluing the two solutions makes a point source . Fourier inversion at zero therefore gives . Put and . Their Riccati identities imply
Multiplying the second relation by and taking traces turns the commutator in the first into a signed square: .
A logarithmic-determinant integral and integration by parts in then give the exact deficit formula
Both terms are nonnegative. In particular, . The second square works without commuting and : cyclicity of trace handles the quadratic term, and adjacent inverse square roots cancel in the cross term. This identifies where noncommutativity is paid for while keeping the scalar constant. (OpenAI, 2026c)
Fixing the range completes the equality argument
The constant kernel argument above fixes the physical channel, but one must also fix the range in eigenfunction-index space. Restrict a nonzero energy block to its constant physical row space, obtaining a full-column-rank matrix . Its range projection is
The limiting equality relations say that and that preserves this range. Differentiation gives
Thus both spaces admit constant bases. In those bases the block is an invertible square matrix , and is uniquely defined. Substituting the row eigenfunction equation and the equality relation for the potential gives . This justifies the constant-basis Riccati reduction and excludes an unaccounted position-dependent channel rotation. It also avoids choosing the earlier auxiliary matrix measurably at every point: the genuine is recovered from the differentiable block itself. (OpenAI, 2026a)
🏷️ Connections and verification scope
Anderson spectral types explains spectral measures and the distinction between spectral sets and eigenfunction decompositions. The present problem concerns a decaying attractive potential and the sum of its discrete negative energies, rather than an iid potential spread throughout the lattice. Complete Crouzeix inequalities illustrates another setting where a scalar sharp constant must survive finite matrix amplification, although its numerical-range mechanism is different.
The source review covered the three theorem statements, the action and trace-comparison interfaces, the spectral deduction, selected equality compactness and fixed-channel arguments, and the explicit optimizer calculation. The full regularized field, continuation, integrated trace identity, and compactness proofs were not independently verified. The factorization, beta-integral normalization, scaling, and triangular spectral sign are elementary deductions checked here; no numerical experiment is presented as a certificate for the universal upper bound.
🏷️ Manuscripts and verification scope
- Equality cases in the sharp one-dimensional matrix Lieb–Thirring inequality — pinned manuscript and companion source.
- Sharp one-dimensional Lieb–Thirring inequalities for matrix potentials — pinned manuscript and companion source.
- Sharp one-dimensional Lieb–Thirring constants — pinned manuscript and companion source.
The family scope page describes selected formalization coverage. Only the scalar September manuscript is listed. The selected statement covers the full negative-eigenvalue moment for every nonnegative potential in the stated Lebesgue class and every exponent strictly between one half and three halves, with the optimal one-state constant and its explicit attaining profile. No finite spectral cutoff is imposed. The two matrix-potential companions and their full equality classification are not listed. 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.