This is a synthetic-voice briefing from Evidence Press, not additional evidence.

Checking a formula on ordinary numbers is not the same as checking it on operators. Operators act on vectors, and several commuting operators can behave in ways that scalar inputs do not reveal.

This paper studies a special family of polynomials. They are symmetric, so exchanging the variables changes nothing. They are multiaffine, so each variable appears with power at most one. And they are stable: the polynomial never vanishes when every input lies inside the complex unit disk.

The candidate proves that this scalar condition is enough to obtain a stronger operator bound. Reflect the polynomial using its actual degrees, then divide by the original polynomial. The resulting quotient has norm at most one on every commuting tuple of strict contractions. The claim covers every finite number of variables, without an extra monomial factor.

The key is a positive matrix construction. Its components receive carefully chosen inverse-binomial weights. Those weights cancel the unwanted contributions while preserving the symmetric part. The proof then transfers the identity to every required coefficient. A classical interpolation formula and a limiting argument include boundary zeros and repeated roots.

For specialists, this supplies the missing positivity assertion in Knese’s criterion. Earlier results covered special cases or allowed an additional factor. The package credits the inherited representation theory and interpolation methods separately from the new positive lift.

The all-dimensional conclusion rests on a written proof. Exact finite computations check its normalisations and difficult examples, but do not replace that proof. This remains an unrefereed candidate, without formal verification or external specialist confirmation. The October tenth, twenty twenty-six release links the paper, code and review response.