The Setting
Noncommutative rational formulas are evaluated at tuples of square matrices rather than at scalars: the formula has no value at any pair of rational numbers, where its commutator vanishes. A formula is therefore evaluated at tuples of rational matrices for every dimension , and at a given tuple it may have no value, when the value of the operand of one of its inverses is a singular matrix. The question these definitions settle is which formulas have a value somewhere, and which have a nonzero value somewhere.
Formulas and Their Values
For a natural number , a rational formula in the variables is a rooted tree built from the variables and rational constants by sums , ordered products and inverses .✦ The size of a formula is the number of vertices of its tree: (1)✦
Let be a ring, not necessarily commutative, with a ring homomorphism , and let . The evaluation relation at , read “ evaluates to at ” and written , is the least relation between rational formulas in variables and elements of that obeys the rules (2)✦
The Claim
Definition 1. For a natural number , is the ring of matrices with rational entries, (3)✦ and an -tuple of rational matrices is an element (4)✦ A rational formula in variables evaluates to at when it does so in the ring , each rational constant acting as the scalar matrix , where is the identity matrix: (5)✦ A rational formula in variables is admissible if it has a value at some tuple of matrices of positive dimension, (6)✦ and nonzero if one such value is a nonzero matrix, (7)✦
In the paper, the result reads: a formula is a rooted tree whose leaves are variables or rational constants, with binary gates and ordered and unary inverse gates, and its size is its number of vertices; at a tuple of square rational matrices a scalar acts as a scalar matrix, and evaluation is defined only when every inverse gate meets an invertible matrix; a formula is admissible if it has a defined rational matrix evaluation of some positive dimension, and nonzero if one of its defined rational matrix evaluations is nonzero.
What Is Checked
Admissibility (6) and nonzeroness (7) are stated over rational formulas in variables and their values (5) at tuples of rational matrices, the case of the evaluation relation (2) in a ring receiving .
The library proves that a formula has at most one value at a point: let be a ring with a ring homomorphism , let , let be a rational formula in variables and let ; then (8)✦