\subsubsection{Appendix --- Parameterization of GB}

This appendix gives two remarks on the GB in section 6.1.
The first remark is 
that even the infinite lists produced in line 2
of the Table 6.1
have finite parameterizations. We analyzed
line 2 of Table 6.1 with the ordering
$ a<f<q < m< Inv[m]$
and found that the rules below together with the
starting relations explain all of the output
from 
%our (NCAlgebra) implementation of 
Mora's algorithm.
%
 %-q + a ** m + m ** f, -1 + m ** Inv[m],
 % -1 + Inv[m] ** m, 
%
%Special rules: 
%$f-Inv[m] ** q + Inv[m] ** a ** m$,

%MXS VERSON
%$$  Relg[n]:=(-1)^{n+1}(f^n) -
%     \Sigma_{k=0}^{n-1} (-1)^k 
%         m^{-1} \, a^{n-1-k} \,  q \,  f^k +
%     m^{-1} \, a^n \, m   
%$$
% WAVRIK VERSION
$$  Relg[n]:= m^{-1} a^n m -
     \Sigma_{k=0}^{n-1} 
         m^{-1} \, a^{k} \,  q \,  f^{n-k-1}  - f^n
$$
%$$   
%(-1)^{n+1} f^n \, m^{-1} -
%     \Sigma_{k=0}^{n-1} 
%     (-1)^k m^{-1} \, a^{n-1-k} \, q \, f^k \, m^{-1} +
%     m^{-1} \, a^n
and 
%%MXS VERSION
%$$  Relg^\prime[n]:=(-1)^{n+1}(f^n) \, m^{-1} - 
%m^{-1}
%\left[ 
%\Sigma_{k=0}^{n-1} (-1)^k 
%\, a^{n-1-k} \,  q \,  f^k \right] 
%m^{-1} +
%     m^{-1} \, a^n  
%$$
%WAVRIK VERSION
$$  Relg^\prime[n]:= m^{-1} q f^n m^{-1} + 
\Sigma_{k=1}^{n} m^{-1}
\, a^{k} \,  q \,  f^{n-k} m^{-1}  - m^{-1} a^{n+1}
 + f^{n+1} m^{-1} 
$$
for $n= 0, 1,2,\ldots$. Notice that $Relg^\prime[n]$ is
the expression one gets by replacing $m m^{-1}$ by 1 in 
$Relg[n] m^{-1}$.

The second remark is more novel.
While we did not find natural functional calculus 
intreptations a la Section 2, there is a 
pretty description of $Relg$ and $Relg^\prime$
in terms of generating functions. Namely,
$Relg$ corresponds to
{\bf NEED TO CHECK a become m in last term??}
$$
-(1+\lambda f)^{-1} + m^{-1} (1-\lambda a)^{-1} m
+ a^{-1} \lambda (1-\lambda a)^{-1} q (1-\lambda f)^{-1}
$$
while $Relg^\prime$ amounts to  
this expression multiplied by $m^{-1}$.
In other words, expand these functions in powers of
$\lambda$,
then the coefficients 
of $\lambda ^n$ are 
$Relg[n]$ and $Relg^\prime[n]$.
{\bf
This points out that there are at least two ways of
characterizing infinite sets of relations.
Some can be easily
described in terms of functional calculus while some
which are not easily described in terms of the functional
calculus, can be described by a generating function.

Generating functions like the one above
occur in classical studies of Lyapunov
equations. For example, the famous
Kato-Rosenblum formula for $m$ is derived
from such a generating function expression.
}


%----------------------------
%I THINK THIS IS FALSE??--DELETE
%
%It is clearer if we begin with the simpest cases.
%
%$a, f$, $q \ \ take it =0 ??$, $m$
%$$ a m -m f-q=0$$
%
%%All S-polynomials the form ??
%
%$a^n m -m f^n $
%- stuff \ \  with \ \ no \ \m \ \in \ \it. 
%What else??
%
%This is the set of equations one sees classically.
%
%However when one reduces this by
%$$ a m \rightarrow m f+q$$
%one gets that only ?? remains
%
%If we add one relation and use the order
%$$m im-1, \ \ im m-1$$
%$$same ??? $$
%%%%then we get 
%$$m^n a m^{-n} -f??$$
%{\it even after reduction}. So in this situation
%whether one gets a finite or infinite 
%GB depends on the reduction step inside the computer
%algorithm. 
%
%Even if we use other orders we find ?? 
%this phenomenon,  falls apart, remains? etc

