OpenAI claim summary for Math-2396
mathematicsTop Open Problemscontributionliterature_reportClaim: literature report
Summary of a claim published in openai/math; not a claim by this platform.
At E=0, fixed-energy point-process convergence to a continuous GOE law implies nonsingularity with probability tending to one. This addresses only the random-regular adjacency clause; the bundled permanent and symmetric-determinant distribution questions remain outside. This entry records partial support; complete coverage of the question is not established by this catalogue.
Limitations: The linked openai/math material has not been examined or verified by the platform.
Manuscript
Contents
Nonsingularity and Limit Laws for Random Matrices
OpenAI's claim
OpenAI presents a mathematical result relevant to this question in the selected manuscript. Every fixed regular degree $d\geq3$ is claimed to give GOE eigenvalue statistics at fixed interior bulk energies for uniformly sampled simple regular graphs.Mathematical statement of the claimed result
Result 1.
For fixed $d\ge3$, let $G_{n,d}$ be uniform among simple labeled $d$-regular graphs, at admissible sizes, and $\lambda_i$ its adjacency eigenvalues. Fix $|E|<2\sqrt{d-1}$ and define \[ \rho_d(E)=\frac{d\sqrt{4(d-1)-E^2}}{2\pi(d^2-E^2)},\qquad \Xi_{n,d,E}=\sum_i\delta_{n\rho_d(E)(\lambda_i-E)}. \] For GOE eigenvalues $\mu_i$, with off-diagonal variance $1/n$ and diagonal variance $2/n$, set $\Xi_n^{\mathrm{GOE}}=\sum_i\delta_{(n/\pi)\mu_i}$. The claim is that each nonnegative continuous compactly supported $h$ satisfies \[ \left|\mathbb E e^{-\int h\,d\Xi_{n,d,E}} -\mathbb E e^{-\int h\,d\Xi_n^{\mathrm{GOE}}}\right|\to0. \] The random graph has no further conditioning.Outline of the argument
An entropy method gives quantitatively accurate Gaussian eigenvector marks and high moments at sampled edges. Reversible edge switches promote those marks to microscopic orthogonal invariance; a Gaussian perturbation and fixed-energy Dyson relaxation identify the point process, with compact-count control completing convergence.Formal verification
Family 219 has no Lean scope page in this release. Its selected result is not presented as formalized. This site has not executed the Lean code. The scope descriptions do not certify the remaining manuscript arguments.Status caveat
OpenAI attributes these manuscripts to work by an internal model. Its release cautions that arguments without formalization can contain mistakes. This catalogue has not independently checked the proofs; the labels report the mathematical claims attributed to OpenAI.Sources
- OpenAI, GOE bulk universality for fixed-degree random regular graphs, 2026-09-23; citation key
OAI:GOE-bulk-universality-for-fixed-degree-random-regular-graphs-September-23-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: thm:main. - OpenAI catalogue entry.