Skip to content

Documentary state: DRAFT_UNACCEPTED. This draft has NOT been editorially admitted. Mathematical claims require independent checking.

OAI-26 family 116: noncommutative identity testing with matrix hitting points

Editorial status: DRAFT_UNACCEPTED. NO_CERTIFICATION. This is a source-pinned documentary account of the publisher's claims, not an independent proof audit.

The question in plain language

A polynomial identity test asks whether a formula computes the zero polynomial, even when cancellation makes that hard to see from the syntax. In noncommutative algebra, multiplication order matters: \(xy\) and \(yx\) need not be equal. A common way to detect nonzero noncommutative expressions is to substitute matrices for the variables.

A hitting point is a chosen tuple of matrices at which a nonzero expression evaluates to something nonzero. A hitting list provides several candidate tuples so that at least one detects each eligible nonzero expression. Family 116 describes claimed deterministic constructions with polynomial dimensions or list sizes.

A small example

Consider \(f(x,y)=xy-yx\). It vanishes when \(x\) and \(y\) are ordinary commuting numbers, yet is nonzero in the free noncommutative polynomial algebra. Substituting, for example, a diagonal matrix for \(x\) and an off-diagonal matrix for \(y\) can yield a nonzero commutator.

For rational formulas, division introduces a separate issue: evaluation is meaningful only where every required inverse exists. A matrix tuple that makes a rational formula undefined cannot count as a valid nonzero witness for that evaluation. Thus division-free identity testing and rational-formula hitting lists require different guarantees.

What is known

The protected Family 116 catalogue identifies three manuscripts on uniform matrix hitting points in positive characteristic, a rational matrix hitting point, and polynomial hitting lists for rational formulas.

The pinned publisher overview claims that for each characteristic there is a deterministic polynomial-bit-time construction of a polynomial-dimensional matrix tuple that detects every nonzero division-free noncommutative formula of bounded size over any field of that characteristic. Exact interpretation of the characteristic parameter and the dependence on the formula-size bound requires review of the primary manuscript.

For noncommutative rational formulas over \(\mathbb Q\), the overview separately claims polynomial-size hitting lists, whenever a formula admits a defined rational-matrix evaluation. This qualifier is substantive: testing must distinguish an expression that is identically zero from one that has no defined evaluation in the permitted domain.

Neither the division-free claim nor the rational-formula statement by itself authorizes a uniform characteristic-independent construction over arbitrary fields for all division-bearing expressions.

GCL verification state

Source lock: openai/math@1581d4cbdd69a0faf34b2089614fe2a814316a6a. The protected catalogue contains three manuscript paths and the pinned overview states the field, characteristic, dimension and rational-evaluation qualifications above.

This documentary pass has not reproduced the constructions, checked matrix dimensions, validated the polynomial-bit-time uniformity, or verified rational formula evaluation and inverse conditions. No Family 116-specific source-critical theorem audit, Lean elaboration, Comparator replay or MATHCERT certificate is asserted.

What remains

Read all three pinned PDFs and extract exact statement-level quantifiers over formula size, number of variables, base field, characteristic and matrix dimensions. Verify how the characteristic is represented in the algorithm, and whether a single matrix tuple works simultaneously for all formulas in a bounded class or depends on an individual formula.

For rational formulas, check all division gates, the semantics of defined evaluation, and the size of hitting lists. Distinguish one rational hitting point from a list of points, and test whether apparent uniformity statements require additional hypotheses.

Complete mathematical Markdown and MkDocs regression checks, critical source review and protected merge/readback. Documentary admission does not establish identity-testing correctness.

Sources and claim boundaries

Boundary: NO_CERTIFICATION. Identity-testing and hitting-set constructions remain publisher-reported claims pending independent verification.


Indexed primary manuscript paths: