One Rational Matrix Hitting Point for Noncommutative Formulas

We construct, in deterministic polynomial bit time, one tuple of rational matrices that detects every nonzero polynomial computed by a noncommutative division-free formula of a prescribed size. The matrices have dimension $O(n{s}^2)$ for n variables and formula size s, and the same tuple works over every field of characteristic zero.