OpenAI · 116-03 · 2026-09-24 · Theoretical computer science
Polynomial Hitting Lists for Noncommutative Rational Formulas
preprints/Polynomial-Hitting-Lists-for-Noncommutative-Rational-Formulas-September-24-2026
Family 116. Uniform identity testing for noncommutative formulas.
The authors are OpenAI. This companion does not verify the proof and does not adopt it as a theorem of Ngo Cheung’s series. It is not a premise. O.1 stays NOT_CLOSED. Anti-de Sitter results are not a de Sitter state, not Em02-E’s relational lapse, not XVI-P’s QdS scheme, and not XVI-Q’s sigma-image record. No quantum coefficient is admitted. No compilation is asserted.
Read against the standing problems
Standing problems. No standing problem is named in this text. It was still read against the nine problems and does not close any of them. The authors are OpenAI. The companion does not verify the proof. This is not a premise of a manuscript by Ngo Cheung. O.1 stays NOT_CLOSED. No quantum coefficient is admitted. No compilation is asserted. XVI-P · XVI-N
For each characteristic, constructs in deterministic polynomial bit time a polynomial-dimensional matrix tuple detecting every nonzero division-free noncommutative formula of bounded size over any field of that characteristic. Rational formulas over also admit polynomial-size hitting lists whenever they have a defined rational-matrix evaluation.
We construct, in deterministic polynomial bit time, a polynomial-size list of rational matrix tuples for noncommutative rational formulas over ℚ of bounded tree size. Every nonzero admissible formula has a defined, invertible value at one tuple, with no separate bounds on inverse nesting or rational constant heights. Matrix dimensions, entry bit lengths, and total output length are polynomially bounded.
Preprint source and Lean scope
The abstract above is the catalogue abstract. The sections below are the full preprint source, 0 sections. This page is not only the abstract. The manuscript file is loading.
This preprint is named in the Lean scope note for 116: Uniform black-box noncommutative identity testing across characteristics. The authors are OpenAI. This companion does not verify the formalization. It is not a premise. The OAI library is not imported. No compilation is asserted. O.1 stays NOT_CLOSED.