
%\part{SIMPLIFYING EXPRESSIONS}
\section{SOME WIDELY APPLICABLE RESULTS}

\smallskip

Now that the we have the basic ideas, we give 
a simple but practical list of simplifying rules
which apply to many situations. The first list, called
RESOL rules, is a generalization of the example 
presented above which involved $x$, $x^{-1}$ and
$(1-x)^{-1}$. 

%The list of
%rules (a point we discuss shortly) involves the 
%resolvent of $x$ and $y$.
%$\lambda$ and $\mu$ are complex numbers.
\bigskip

\centerline{RESOL Rules}
$$
(\lambda - x)^{-1} x \rightarrow \lambda (\lambda - x)^{-1} - 1
\leqno{(RESOL0)}
$$ 
$$
x (\lambda - x)^{-1} \rightarrow \lambda (\lambda - x)^{-1} - 1
\leqno{(RESOL1)}
$$ 
$$
(\mu -x)^{-1}  x \rightarrow \mu (\mu-x)^{-1} - 1
\leqno{(RESOL2)}
$$ 
$$
x (\mu -x)^{-1}  \rightarrow \mu (\mu-x)^{-1} - 1
\leqno{(RESOL3)}
$$ 
$$
(\mu-x)^{-1} (\lambda - x)^{-1} \rightarrow 
{1 \over {\mu - \lambda}} (\lambda - x)^{-1} + 
{1 \over {\lambda - \mu}} (\mu - x)^{-1} 
\leqno{(RESOL4)}
$$ 
$$
(\lambda - x)^{-1} (\mu-x)^{-1}  \rightarrow 
{1 \over {\mu - \lambda}} (\lambda - x)^{-1} + 
{1 \over {\lambda - \mu}} (\mu- x)^{-1} 
\leqno{(RESOL5)}
$$ 
for all operators $x$ and $y$ on a Hilbert space $\cal H$
and distinct complex numbers $\lambda$ and $\mu$. The following
theorem is an easy generalization of a corresponding result from
{\bf [HW]}. 

\proclaim{Theorem 2.1}
The list of RESOL rules is a Gr\"obner basis in the symbols
$x$, $(\lambda - x)^{-1}$ and $(\mu - x)^{-1}$ where $\lambda$
and $\mu$ are distinct complex numbers and the monomials are
ordered using a graded lexicographical order with
 $x<(\lambda-x)^{-1}<(\mu-x)^{-1}.$
\endproclaim

A Gr\"obner basis can be found for polynomials in
$x < y < x^{-1} < y^{-1} < (1-x)^{-1} < (1-y)^{-1} < S < T$
where $S$ and $T$ are variables and we take as starting
relations the defining relations for the inverses and the
relations $Sx = xT$ and $yS = Ty$ (see {\bf [HW]}). If
$\lambda$ is a nonzero complex number, then this basis
produces a very interesting and powerful set of simplifying
rules which hold for all operators $x$, $y$ on a Hilbert
space with $x$, $y$, $\lambda-x$ and $\lambda-y$ invertible and for all
functions $h$ analytic on the spectrum of $xy$ and $yx$.

\bigskip

\centerline{GENR Rules}
$$
h(xy) x\rightarrow x h(yx)
\leqno{(Gr0)}
$$
$$
h(yx) x^{-1}\rightarrow x^{-1}  h(xy)
\leqno{(Gr1)}
$$
%Corrected Gr2...MXS
$$
x h(yx) (\lambda-x)^{-1}\rightarrow \lambda h(xy) (\lambda-x)^{-1} - h(xy)
\leqno{(Gr2)}
$$
%Cosmetic change to Gr3...MXS
$$
x^{-1} h(xy) (\lambda-x)^{-1}\rightarrow \lambda^{-1} x^{-1} h(xy)
+\lambda^{-1} h(yx) (\lambda-x)^{-1}
\leqno{(Gr3)}
$$
%Corrected power of lambda in Gr4...MXS
$$
(\lambda-x)^{-1} h(y x) (\lambda-x)^{-1}-(\lambda-x)^{-1} h(x y) 
(\lambda-x)^{-1} \rightarrow 
\leqno{(Gr4)}
$$
$$
\lambda^{-1} (h(y x) (\lambda-x)^{-1}-(\lambda-x)^{-1} h(x y) )
$$
%$$
%\leqalignno{
%(\lambda-x)^{-1} h(y x) &(\lambda-x)^{-1}-(\lambda-x)^{-1} h(x y) 
%(\lambda-x)^{-1} \rightarrow & (Gr4) \cr
%&\lambda^{-1} (h(y x) (\lambda-x)^{-1}-(\lambda-x)^{-1} h(x y) )\cr
%}
%$$

Operators of the form $h(xy)$ arise, of course, in what is called the {\it
functional calculus} of the operator $xy$. Examples are
$h(xy)=(1-xy)^{-1}$, $h(xy)=(1-xy)^{-1/2}$ and
$h(xy)=e^{xy}$ provided the eigenvalues of $xy$ are in the right location.

For the case of $\lambda=1$, the (GENR) rules are obtained 
by substituting $h(xy)$ for $S$
and $h(yx)$ for $T$ in the Gr\"obner basis from {\bf [HW]}. 
It is easy to check by hand that the (GENR) rules hold
for $\lambda\not=1$. 
Observe that each of the rules in either
(RESOL) or (GENR)
are easy to
prove directly.
For example, the following calculation verifies (Gr3).
\begin{eqnarray*}
x^{-1} h(xy) (\lambda-x)^{-1}
&=&h(yx) x^{-1} (\lambda-x)^{-1}\\
&=&h(yx) (\lambda^{-1} x^{-1} \\
& & \ \ \ \ +\lambda^{-1} (\lambda-x)^{-1}) \\
&=&\lambda^{-1} h(yx) x^{-1}+ \\
& & \lambda^{-1} h(yx) (\lambda-x)^{-1}
\end{eqnarray*}

Possibly, this set of rules is of very general interest
and might be worth teaching to 
all people beginning in the area of matrix or operator algebra.
Already (RESOL4), called the resolvent identity,
is universally taught while only the special case (Gr0)
is common in introductory courses. 

From the rules (RESOL) and (GENR) we obtain, for each particular 
analytic function $h$, an expanded set of rules:  we may replace 
$h(xy)$ with $h(xy)^n$ and $h(yx)$ with $h(yx)^n$ for any positive integer $n$; 
and we may interchange $x$ with $y$. The rules obtained in this way are 
all obviously valid rules. The expanded set is discussed more 
thoroughly in {\bf [HW]}. It is not, in general, a Gr\"obner basis, because 
it does not contain rules which come from the special properties of 
a particular $h$. For example, if $h(xy) = (1-xy)^{-1}$, the replacement 
rule $xyh(xy) \rightarrow h(xy) - 1$ is not a consequence of the rules in the 
expanded set even though it holds for this particular $h$. On the 
other hand, this rule is not universally applicable. We think of 
the expanded set as a complete set of universally applicable rules. 
We have found that extremely effective simplification can be 
performed just using the expanded set supplemented by some of the 
obvious rules for a particular $h$. 

%Before continuing, let us make several observations.
%If one swaps $x$ with $y$ in $(Gr0)-(Gr4)$, then one
%obtains five new valid rules $(Gr0^\prime)-(Gr4^\prime)$.
%For example, $(Gr0^\prime)$ would be 
%$h(yx)y \rightarrow y h(xy)$. 
%Let us call this new set of rules (GENR$^\prime$). 
%Likewise, we
%can take the set of rules $(RESOL0)-(RESOL5)$
%and change $x$ to $y$ to obtain a new set of
%rules $(RESOL0^\prime)-(RESOL5^\prime)$. 
%Let us call this new set of rules (RESOL$^\prime$). 
%
%Now, let (GENR$_h$) denote the set of rules obtained from (GENR)
%by substituting a specific analytic function $h$ which is
%analytic on the spectrum of $xy$ and $yx$.
%Note that if $h$ is a function which is
%analytic on the spectrum of $xy$ and $yx$, then
%the function $h$ raised to the $n$-th power
%is analytic on the spectrun of $xy$ and $yx$
%whenever $n$ is a natural number. Let us 
%(GENR$_{h,\infty}$) denote the union of all 
%of the rules in the sets (GENR$_{h^n})$ as $n$ varies
%over the natural numbers. We define $(GENR^\prime_h)$
%and (GENR$^\prime_{h,\infty}$) analogously.
%
%When a
%particular analytic function is substituted for $h$, the
%set of rules obtained from 
%(GENR$_{h,\infty}$),
%(GENR$^\prime_{h,\infty}$),
%(RESOL) and (RESOL$^\prime$)
%will usually not be a 
%%When a
%%particular analytic function is substituted for $h$, the
%%set of rules obtained from (GENR) will usually not be a
%Gr\"obner Basis --- it will lack rules that come from special
%properties of $h$. It was shown in {\bf [HW]} that,in the
%case $\lambda=1$, 
%(GENR$_{h,\infty}$),
%(GENR$^\prime_{h,\infty}$),
%(RESOL) together with (RESOL$^\prime$)
%is a complete set of 
%algebraic relations {\it if} one ignores any rules
%that come from special properties of $h$. 
%The above set of relations are discussed 
%more thoroughly in {\bf [HW]}. 
%For example, if
%$h(xy)=(1-xy)^{-1}$, then
%$(1-xy) h(xy)=1$ which can be expressed as the replacement
%rule  $xy h(xy)\rightarrow h(xy)- 1$.
%This rule is not in the above set of rules, 
%so we must adjoin it.
%Even without computing a Gr\"obner basis, once this rule is adjoined
%we have a very powerful list of 
%simplifying rules which will be extremely effective in most situations.
%%To obtain a Gr\"obner basis, we must
%%combine the adjoined rule with (RESOL) and (GENR) and
%run a GB algorithm({\bf [Mora,HW,HWS]}).

\vskip 0.2 in
