Claimed AI-led

The L'vov–Kaplansky conjecture for matrices of sufficiently large order

A Hexagon preprint whose main results were developed over ten GPT-6-Pro research runs claims that for each degree, the image of a nonzero multilinear polynomial on n×nn \times n matrices over any field is the traceless matrices or the whole matrix algebra, as the L'vov–Kaplansky conjecture predicts, once nn exceeds a threshold depending only on the degree.

Model
GPT-6-Pro (ten research runs, 62.5 scheduled hours) and Codex (proof audit and manuscript polish)
Field
Mathematics
Date
2026-11-08
Human collaborators
Qiyue Tang

What was found

The L'vov–Kaplansky conjecture, recorded in the Dniester Notebook, says the image of a multilinear polynomial evaluated on n×nn \times n matrices is always {0}\{0\}, the scalars, the traceless matrices or the whole algebra. Prior work studied small cases, such as images on 2×22 \times 2 and 3×33 \times 3 matrices (Kanel-Belov, Malev and Rowen) and instances in degree three (Dykema and Klep, and later authors). The preprint claims the full dichotomy for every degree in all sizes beyond a degree-dependent threshold: the image is the traceless subspace if every cyclic coefficient sum vanishes, and the full matrix algebra otherwise.

Novelty check

arXiv, 2026-11-19, abs:Kaplansky AND abs:multilinear AND abs:matrix returned 6 records: degree-three cases (2015, 2023), a grading approach (2022), upper triangular algebras and a July 2026 generalization over division algebras. None claims the conjecture for large matrix size in every degree. Nothing in this registry covers it.

Caveats and known objections

Entered at claimed, with caution. It is a partial result: sizes below the threshold remain open, and the abstract gives no explicit threshold. Hexagon labels the text a mix of human-written and AI-generated with human understanding of some parts, and the provenance promises a Rethlas-OSV review in a later version, which has not appeared. The current version, v2 of 16 November, adds an author's note disclaiming ownership and priority and inviting others to check the arguments and prepare a finished account, so the submitter does not vouch for the mathematics as an author normally would. The same submitter filed other solo AI-generated claims on named conjectures in the same window. Autonomy is ai-led: the provenance credits the model runs with the main results and describes no human mathematical contribution.

Also recorded at

vibemathedthe-l-vov-kaplansky-conjecture

Nothing mechanically. It is a parallel listing of the same result, carrying its own verification label rather than an independent check.

No independent check is recorded on this entry yet.

Reading the primary source closely enough to say whether it supports the claim counts as a check, and you are credited on the entry.

Or on GitHub: submit a check challenge the grade send a correction or send a pull request

Entry history (1 event)
  1. AddedEntered the registry graded Claimed and AI-led.

Entries are never deleted. A grade that does not hold up is downgraded on the record, with the reason beside it.

Graded claimed for verification and ai-led for autonomy. What these mean.

Cite this entry

Plain text
whataifound.org. (2026). The L'vov–Kaplansky conjecture for matrices of sufficiently large order. whataifound.org: A Registry of AI Scientific and Mathematical Discoveries. https://whataifound.org/finding/2026-11-08-lvov-kaplansky-large-matrices
BibTeX
@misc{whataifound-independent-2026-matrices,
  title        = {The L'vov–Kaplansky conjecture for matrices of sufficiently large order},
  author       = {{whataifound.org}},
  year         = {2026},
  howpublished = {whataifound.org: A Registry of AI Scientific and Mathematical Discoveries},
  note         = {Result by Independent. Verification: Claimed. Autonomy: AI-led.},
  url          = {https://whataifound.org/finding/2026-11-08-lvov-kaplansky-large-matrices}
}

Related findings

← All mathematics findings in the registry