\begin{slide}{}

\heading{THEOREM (Bart Gohberg  Kaashoek Van Dooren)}
{\bf 

THE FACTORS OF
A SYSTEM $[A,B,C,1]$ 

\begin{verbatim}

     ----------------        -------------- 
    |                |      |              |
-<--|  [a, b, c, 1]  |--<---| [e, f, g, 1] |--<--
    |                |      |              |
     ----------------        -------------- 
\end{verbatim}

(WHICH ARE OF MINIMAL SIZE) CORRESPOND TO SUBSPACES ${\cal S}_1$
and ${\cal S}_2$ satisfying certain properties. 

\heading{ALGEBRAIC STATEMENT}

SET $ACROSS= A^{\times} = A-BC$

SET $P_j=$Projection onto Range ${\cal S}_j$
}
\end{slide}
\begin{slide}{}
{\bf

\noindent
\heading{ALGEBRAIC STATEMENT}

SET $ACROSS= A^{\times} =A-BC$ 

SET $P_j=$Projection onto Range ${\cal S}_j$

THEY SATISFY
$$
(FACANS)
\openmtx{c}{
P_1 +P_2=1 \\
P_1 P_2  = 0\\
P_1 \,  A^{\times} \, P_1 = A^{\times} \, P_1\\
P_2 \, A  \, P_2 = A\, P_2 
}
$$
}
\end{slide}

\begin{slide}{}
{\bf 
RESTATE PROBLEM ALGEBRAICALLY

By Youla -Tissi, there is map
$$
(m_1,m_2): 
\mbox{ \ STATESPACE\  of\ the\ PRODUCT }
$$
$$
\longrightarrow 
\mbox{ \ STATESPACE\ of\ the\  ORIGINAL} \, .
$$
which intertwines
original and product system. 

Also minimality of the factoring is equivalent to
existance of left and right inverses to $(m_1,m_2)$
$$
\mtx{c} {leftm_1 \\  leftm_2}
\mtx{cc}{ m_1 & m_2}
= 
\mtx{cc}{1 & 0 \\ 0 & 1}
$$
$$
\mtx{cc}{m_1 & m_2} \mtx{c} { rightm_1 \\ rightm_2} = 1
$$
}
\end{slide}
\begin{slide}{}
{\bf
WHAT THEORY IS NEEDED TO AUTOMATICALLY DISCOVER THE BGKvD THEOREM?
(or at least help)

\noindent
PROBLEM = THE FOLLOWING EXPRESSIONS EQUAL ZERO

$$
(FACHYP)
\openmtx{c}
{
A m_1 - m_1 a - m_2 f c \\
A m_2 - m_2 e\\
B - m_1 b - m_2 f\\
-c + C \, m_1 \\
-g + C \, m_2  \\
leftm1 ** m1 - 1 \\
leftm1 ** m2 \\
leftm2 ** m1 \\
leftm2 ** m2 - 1 \\
m_1 **rightm_1 + m_2** rightm_2
}
$$
}
\end{slide}


\begin{slide}{}
{\bf 

\noindent
\heading{THE MATH QUESTION IS}

FIND A SMALLEST BASIS FOR THE IDEAL IN MATRIX
ALGEBRA CONTAINING (FACHYP). CONVERT IT TO
$P_1, P_2$ NOTATION.

ONE SUCH SMALLEST BASIS IS (FACANS)

\heading{EXPERIMENT}

SET ORDERING
$$
\openmtx{c}
{A < B < C  << \\
m1 < m2 << \\
leftm1 < leftm2 << \\
rightm1 < rightm2 << \\
a < b < c < e < f < g }
$$
RUN MORA'S ALGOROTHIM

IF THIS WERE THE COMMUTATIVE CASE,
THEN WE WOULD GET A LIST OF POLYNOMIALS IN TRIANGULAR FORM.
FOR EXAMPLE, 
$$p_{A,B,C,1}^1(m_1)=0$$
$$p_{A,B,C,1}^2(m_1,m_2)=0$$
$$etc=0$$
THIS IS THE BIG (INCREDIBLE) THM IN THE SUBJECT.

\noindent
THE NON-COMMUTATIVE CASE:
GB ARE NOT NESTED (TRIANGULAR) AS IN COMMUTATIVE CASE.

WE THEREFORE PROPOSE A STRATEGY.
}
\end{slide}


\begin{slide}{}
\heading{STRATEGY}
{\bf 
\noindent
1. SELECT AN ORDER----ex.
$$
\openmtx{c}{
A < B < C  <<\\
m1 < m2 <<\\
 leftm1 < leftm2 <<\\
  rightm1 < rightm2 <<\\
 a < b < c < e < f < g }
$$
Here $A$, $B$ and $C$ can be thought of as known, the rest unknown.
We are willing to solve for $a$ through $g$ in terms of the other
unknowns, but not willing to solve for $m1$ in terms of
any of the unknowns $leftm1$, $leftm2$, $rightm1$, $rightm2$
or $a$ though $g$.

\noindent
2. RUN MORA ALGORTHIM --YOU WILL FIND SOME 
UNKNOWNS ARE SOLVED FOR.

\noindent
3. SORT EQUATIONS BY NUMBER OF UNKNOWNS.
}
\end{slide}
\begin{slide}{}
\heading{1-STRATEGY}
{\bf
\noindent
4. IF THERE IS ONE EQ (eq1) IN ONE UNKNOWN \ \ \ e.g. $m_1$ 
WE ASSUME THE USER CAN SOLVE IT (numerically).
SO $m_1$ IS NOW KNOWN.  
CHANGE ORDERING TO MAKE $m_1$ A KNOWN---REPEAT
ALGORITHM(goto 2)

%\noindent
%5.WHEN NO FURTHER PROGRESS-- form a set of eq1, eq2, etc
%plus all solved for variables, plug into starting equations,
%eliminate some equations and see (use Mora algorithm)
%if they generate the full ideal. Repeat until they do.
%
\noindent
\centerline{2-STRATEGY}
Now look for 2 equations in 2 unknowns
step 4. Declare the pair of unknowns to be known.
%.New Step 4. Assume 2-equations in 2 unknowns $X,Y$ determines 
%$X$, $Y$ so they become knowns.
%CHANGE ORDERING TO MAKE $X$, $Y$ KNOWNS
---REPEAT (goto 2)

}
\end{slide}

