OctoInform Beta

OpenAI preprint, September 2026 · §1. Introduction · §1

§1 (setting): rational formulas, size, evaluation, admissible and nonzero: A formula’s size, its values in a ring receiving ℚ\mathbb{Q}, and when it has a value, or a nonzero one, at rational matrices

Rational formulas and their values at tuples of matrices.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Noncommutative rational formulas are evaluated at tuples of square matrices rather than at scalars: the formula (x1x2−x2x1)−1(x_1x_2 - x_2x_1)^{-1} has no value at any pair of rational numbers, where its commutator vanishes. A formula is therefore evaluated at tuples of d×dd\times d rational matrices for every dimension d≥1d\ge 1, 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 nn, a rational formula ff in the variables x1,…,xnx_1,\dots,x_n is a rooted tree built from the variables and rational constants α∈ℚ\alpha\in\mathbb{Q} by sums f+gf+g, ordered products f⋅gf\cdot g and inverses f−1f^{-1}.✦ The size |f||f| of a formula ff is the number of vertices of its tree: |xi|=|α|=1,|f+g|=|f⋅g|=|f|+|g|+1,|f−1|=|f|+1.|x_i| = |\alpha| = 1,\qquad |f+g| = |f\cdot g| = |f|+|g|+1,\qquad |f^{-1}| = |f|+1.(1)✦

Let RR be a ring, not necessarily commutative, with a ring homomorphism c:ℚ→Rc\colon\mathbb{Q}\to R, and let p=(p1,…,pn)∈Rnp=(p_1,\dots,p_n)\in R^n. The evaluation relation at pp, read “ff evaluates to uu at pp” and written f⇝puf\rightsquigarrow_p u, is the least relation between rational formulas in nn variables and elements of RR that obeys the rules xi⇝ppi,α⇝pc(α),f⇝pu,g⇝pv⇒f+g⇝pu+v,f⋅g⇝puv,f⇝pu,uv=vu=1⇒f−1⇝pv.\begin{aligned} &x_i\rightsquigarrow_p p_i,\qquad \alpha\rightsquigarrow_p c(\alpha),\\ &f\rightsquigarrow_p u,\ g\rightsquigarrow_p v\ \Longrightarrow\ f+g\rightsquigarrow_p u+v,\ \ f\cdot g\rightsquigarrow_p uv,\\ &f\rightsquigarrow_p u,\ uv = vu = 1\ \Longrightarrow\ f^{-1}\rightsquigarrow_p v. \end{aligned}(2)✦

The Claim

Definition 1. For a natural number dd, Matd(ℚ)\mathrm{Mat}_d(\mathbb{Q}) is the ring of d×dd\times d matrices with rational entries, Matd(ℚ)={(mjk)j,k=1d:mjk∈ℚ},\mathrm{Mat}_d(\mathbb{Q}) = \{(m_{jk})_{j,k=1}^{d} : m_{jk}\in\mathbb{Q}\},(3)✦ and an nn-tuple of d×dd\times d rational matrices is an element X=(X1,…,Xn)∈Matd(ℚ)n.X = (X_1,\dots,X_n)\in\mathrm{Mat}_d(\mathbb{Q})^n.(4)✦ A rational formula ff in nn variables evaluates to V∈Matd(ℚ)V\in\mathrm{Mat}_d(\mathbb{Q}) at XX when it does so in the ring Matd(ℚ)\mathrm{Mat}_d(\mathbb{Q}), each rational constant α\alpha acting as the scalar matrix αId\alpha I_d, where IdI_d is the d×dd\times d identity matrix: f⇝XVin Matd(ℚ) with c(α)=αId.f\rightsquigarrow_X V\quad\text{in } \mathrm{Mat}_d(\mathbb{Q}) \text{ with } c(\alpha) = \alpha I_d.(5)✦ A rational formula ff in nn variables is admissible if it has a value at some tuple of matrices of positive dimension, f⇝XVfor some d≥1,X∈Matd(ℚ)n and V∈Matd(ℚ),f\rightsquigarrow_X V\quad\text{for some } d\ge 1,\ X\in\mathrm{Mat}_d(\mathbb{Q})^n \text{ and } V\in\mathrm{Mat}_d(\mathbb{Q}),(6)✦ and nonzero if one such value is a nonzero matrix, f⇝XV and V≠0for some d≥1,X∈Matd(ℚ)n and V∈Matd(ℚ).f\rightsquigarrow_X V \text{ and } V\neq 0\quad\text{for some } d\ge 1,\ X\in\mathrm{Mat}_d(\mathbb{Q})^n \text{ and } V\in\mathrm{Mat}_d(\mathbb{Q}).(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 ⋅\cdot 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 nn variables and their values (5) at tuples of rational d×dd\times d matrices, the case R=Matd(ℚ)R=\mathrm{Mat}_d(\mathbb{Q}) of the evaluation relation (2) in a ring receiving ℚ\mathbb{Q}.

The library proves that a formula has at most one value at a point: let RR be a ring with a ring homomorphism c:ℚ→Rc\colon\mathbb{Q}\to R, let p∈Rnp\in R^n, let ff be a rational formula in nn variables and let u,v∈Ru,v\in R; then f⇝pu and f⇝pv⇒u=v.f\rightsquigarrow_p u \text{ and } f\rightsquigarrow_p v\quad\Longrightarrow\quad u = v.(8)✦