Compatible rewriting of noncommutative polynomials for proving operator identities

02/10/2020
by   Cyrille Chenavier, et al.
0

The goal of this paper is to prove operator identities using equalities between noncommutative polynomials. In general, a polynomial expression is not valid in terms of operators, since it may not be compatible with domains and codomains of the corresponding operators. Recently, some of the authors introduced a framework based on labelled quivers to rigorously translate polynomial identities to operator identities. In the present paper, we extend and adapt the framework to the context of rewriting and polynomial reduction. We give a sufficient condition on the polynomials used for rewriting to ensure that standard polynomial reduction automatically respects domains and codomains of operators. Finally, we adapt the noncommutative Buchberger procedure to compute additional compatible polynomials for rewriting. In the package OperatorGB, we also provide an implementation of the concepts developed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/04/2021

The sine kernel, two corresponding operator identities, and random matrices

In the present paper, we consider the integral operator, which acts in H...
research
10/25/2021

Computing elements of certain form in ideals to prove properties of operators

Proving statements about linear operators expressed in terms of identiti...
research
04/12/2019

Sylvester-Gallai type theorems for quadratic polynomials

We prove Sylvester-Gallai type theorems for quadratic polynomials. Speci...
research
07/14/2020

Trapdoor Delegation and HIBE from Middle-Product LWE in Standard Model

At CRYPTO 2017, Rosca, Sakzad, Stehle and Steinfeld introduced the Middl...
research
03/10/2022

Summation-by-parts operators for general function spaces

Summation-by-parts (SBP) operators are popular building blocks for syste...
research
08/19/2022

Perturbations of polynomials and applications

After reconsidering the theorem of continuity of the roots of a polynomi...
research
05/16/2023

How to automatise proofs of operator statements: Moore-Penrose inverse – a case study

We describe a recently developed algebraic framework for proving first-o...

Please sign up or login with your details

Forgot password? Click here to reset