Realizations of non-commutative rational functions around a matrix centre, I: synthesis, minimal realizations and evaluation on stably finite algebras | Tomesphere
arXiv:1905.11304·math.FA·September 17, 2021
Realizations of non-commutative rational functions around a matrix centre, I: synthesis, minimal realizations and evaluation on stably finite algebras
This paper extends classical non-commutative rational function realization theory to arbitrary matrix centers, establishing existence, uniqueness, and evaluation methods, with implications for matrix and symmetric cases.
Contribution
It introduces a generalized framework for minimal realizations of nc rational functions centered at any matrix point, including evaluation over stably finite algebras.
Findings
01
Proves existence and uniqueness of minimal realizations at arbitrary matrix centers.
02
Provides a method to evaluate nc rational functions on all matrix sizes and stably finite algebras.
03
Offers a new proof of the equivalence theorem for rational expressions over matrices and stably finite algebras.
Abstract
In this paper we generalize classical results regarding minimal realizations of non-commutative (nc) rational functions using nc Fornasini-Marchesini realizations which are centred at an arbitrary matrix point. We prove the existence and uniqueness of a minimal realization for every nc rational function, centred at an arbitrary matrix point in its domain of regularity. Moreover, we show that using this realization we can evaluate the function on all of its domain (of matrices of all sizes) and also with respect to any stably finite algebra. As a corollary we obtain a new proof of the theorem by Cohn and Amitsur, that equivalence of two rational expressions over matrices implies the expressions are equivalent over all stably finite algebras. Applications to the matrix valued and the symmetric cases are presented as well.
domA(R)=domA(R1)∩domA(R2) and RA(a)=R1A(a)R2A(a).
domA(R)=domA(R1)∩domA(R2) and RA(a)=R1A(a)R2A(a).
domA(R)=domA(R1)∩domA(R2) and RA(a)=R1A(a)+R2A(a).
domA(R)=domA(R1)∩domA(R2) and RA(a)=R1A(a)+R2A(a).
dom^{{\mathcal{A}}}(R)=\left\{\underline{\mathfrak{a}}\in dom^{{\mathcal{A}}}(R_{1}):R_{1}^{{\mathcal{A}}}(\underline{\mathfrak{a}})\text{ invertible in }{\mathcal{A}}\right\}\text{ and }R^{{\mathcal{A}}}(\underline{\mathfrak{a}})=\big{(}R_{1}^{{\mathcal{A}}}(\underline{\mathfrak{a}})\big{)}^{-1}.
dom^{{\mathcal{A}}}(R)=\left\{\underline{\mathfrak{a}}\in dom^{{\mathcal{A}}}(R_{1}):R_{1}^{{\mathcal{A}}}(\underline{\mathfrak{a}})\text{ invertible in }{\mathcal{A}}\right\}\text{ and }R^{{\mathcal{A}}}(\underline{\mathfrak{a}})=\big{(}R_{1}^{{\mathcal{A}}}(\underline{\mathfrak{a}})\big{)}^{-1}.
DOM^{{\mathcal{A}}}({\mathcal{R}}):=\Big{\{}\underline{\mathfrak{A}}\in({\mathcal{A}}^{s\times s})^{d}:\Big{(}I_{L}\otimes 1_{{\mathcal{A}}}-\sum_{k=1}^{d}(\mathfrak{A}_{k}-Y_{k}\otimes 1_{{\mathcal{A}}})\mathbf{A}_{k}^{{\mathcal{A}}}\Big{)}\text{ is invertible in }{\mathcal{A}}^{L\times L}\Big{\}}
DOM^{{\mathcal{A}}}({\mathcal{R}}):=\Big{\{}\underline{\mathfrak{A}}\in({\mathcal{A}}^{s\times s})^{d}:\Big{(}I_{L}\otimes 1_{{\mathcal{A}}}-\sum_{k=1}^{d}(\mathfrak{A}_{k}-Y_{k}\otimes 1_{{\mathcal{A}}})\mathbf{A}_{k}^{{\mathcal{A}}}\Big{)}\text{ is invertible in }{\mathcal{A}}^{L\times L}\Big{\}}
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
\UseRawInputEncoding
Realizations of Non-Commutative Rational
Functions around a matrix centre, I:
synthesis, minimal realizations and evaluation on stably finite algebras
In this paper we generalize classical results
regarding minimal realizations of
non-commutative (nc) rational functions using nc
Fornasini–Marchesini
realizations which are centred at an arbitrary matrix point.
We prove the existence and uniqueness
of a minimal realization for every nc
rational function, centred at
an arbitrary matrix point in its domain of regularity.
Moreover, we show that using this realization we can evaluate the function on
all of its domain (of matrices of all sizes) and also w.r.t any stably finite algebra.
As a corollary we obtain a new proof of the theorem by Cohn and Amitsur, that equivalence of two rational expressions over matrices implies the expressions are equivalent over all stably finite algebras.
Applications to the matrix valued and the symmetric cases are presented as well.
The research of both authors was
partially supported by the US–Israel
Binational Science Foundation (BSF)
Grant No. 2010432, Deutsche Forschungsgemeinschaft (DFG)
Grant No. SCHW 1723/1-1,
and Israel Science Foundation (ISF)
Grant No. 2123/17.
Noncommutative (nc, for short) rational functions
are a skew field of fractions
— more precisely, the universal skew field of fractions —
of the
ring of nc polynomials, i.e., polynomials in
noncommuting indeterminates (the free associative algebra).
Essentially, they are obtained
by starting with nc polynomials and applying
successive arithmetic operations;
a considerable amount of technical details is necessary here since
in contrast to the commutative case there is no canonical coprime
fraction representation for a nc rational function. NC rational functions originated from several sources: the general theory of free rings and of skew fields
(see
[20, 45, 21, 22, 52, 54, 53],
[23, 24, 26, 25]
for comprehensive expositions, and
[65, 55]
for good surveys);
the theory of rings with
rational identities (see
[6],
also
[17] and
[66, Chapter 8]);
and rational former power series in the
theory of formal languages and finite automata (see
[51, 72, 73, 30, 31, 32]
and
[18] for a good survey).
Much like in the case of rational functions of a single variable
[13, 50]
(and unlike the case of several commuting variables
[35, 46]),
nc rational functions that are regular at
0
admit a good state space realization theory,
see in particular Theorem
1 below.
This was first established in the context of finite automata and recognizable power series,
and more recently reformulated, with additional details, in the context of
transfer functions of multidimensional systems with evolution
along the free monoid
(see
[12, 8, 9, 10, 4, 11]).
State space realizations of nc rational functions have figured
prominently in work on robust control of linear systems subjected
to structured possibly time-varying uncertainty (see
[14, 15, 56]).
Another important application of nc rational functions
appears in the area of Linear Matrix Inequalities (LMIs, see,
e.g.,
[59, 58, 67]).
Most optimization problems of system theory and
control are dimensionless in the sense that the natural variables
are matrices, and the problem involves nc rational expressions in these matrix
variables which have therefore the same form independent of matrix sizes (see
[19, 36, 37]).
State space realizations are exactly what is
needed to convert (numerically unmanageable) rational matrix
inequalities into (highly manageable) linear matrix inequalities
(see [43]).
Coming from a different direction, the method of state space realizations,
also known as the linearization trick, found important recent applications in free
probability, see
[16, 41, 74, 75].
Here it is crucial to evaluate nc rational expressions
on a general algebra — which is stably finite in many important cases —
rather than on matrices of all sizes. Stably finite algebras appeared in this context in the work of Cohn
[26] and they play an important and not surprising role in our analysis.
Here is a full characterization of nc rational functions which are regular at 0
and their (matrix) domains of regularity,
in terms of their minimal realizations
(for the proofs, see
[8, 9, 30, 31, 32, 48, 49, 72, 73]).
Theorem 1**.**
If
R
is a nc rational function of
x1,…,xd
and
R
is regular at
0,
then
R
admits a unique (up to unique similarity)
minimal nc Fornasini–Marchesini realization
[TABLE]
where
A1,…,Ad∈KL×L,B1,…,Bd∈KL×1,C∈K1×L,D=R(0)∈K
and
L∈N.
Moreover, for all
m∈N:(X1,…,Xd)∈(Km×m)d
is in the domain of regularity of
R if and only if
det(ILm−X1⊗A1−…−Xd⊗Ad)=0; in that case
[TABLE]
Here a realization is called minimal if the state space dimension
L
is as small as possible; equivalently,
the realization is observable, i.e.,
[TABLE]
and controllable, i.e.,
[TABLE]
Theorem
1
is strongly related to
expansions of nc rational functions which are regular at
0
into formal nc power series around
0;
that is why it is not
applicable for all nc rational functions.
For example, the nc rational expression
R(x1,x2)=(x1x2−x2x1)−1
is not defined at 0, nor at any
pair
(y1,y2)∈K2,
therefore one can not consider
realizations of
R
which are centred at
0
as in Theorem
1, nor at any scalar point
(a tuple of scalars). A realization theory for such
expressions (and hence functions)
is required in particular for all of the applications
mentioned above. Such a theory is
presented here, using the ideas of the general
theory of nc functions.
The theory of nc functions has its roots in the works by Taylor [76, 77] on noncommutative
spectral theory.
It was further developed by Voiculescu
[80, 78, 79]
and Kalyuzhnyi-Verbovetskyi–Vinnikov [47],
including a detailed discussion on nc difference-differential calculus.
The main underlying idea is that
a function of
d
non-commuting variables is a function of
d−tuples of square matrices of all sizes
that respects direct sums and simultaneous similarities.
See also
the work of Helton–Klep–McCullough
[38, 39],
of Popescu
[61, 62],
of Muhly–Solel
[57], and of Agler–McCarthy
[1, 2, 3].
A crucial fact
[47, Chapters 4-7]
is that nc functions admit power series expansions,
called Taylor–Taylor series in honor of
Brook Taylor and of Joseph L. Taylor,
around an arbitrary
matrix point in their domain.
This motivates us to generalize realizations
as in Theorem
1
to the
case where the centre is a
d−tuple of matrices
rather than
0
or a
d−tuple of scalars.
This is the first in a series of papers with the goal
of generalizing the theory of (Fornasini–Marchesini) realizations centred at 0 (or at a scalar point), to the case of (Fornasini–Marchesini) realizations centred at an arbitrary matrix point in the domain of regularity of a nc rational function.
In particular, we present a generalization of Theorem
1
(see Theorem
2 below)
namely the existence and uniqueness of a minimal realization,
together with the inclusion of the domain of the nc rational function in the domain of any of its minimal realizations. (The other inclusion and hence the equality of the two domains is presented in a follow-up paper
[63])
Other types of realizations of nc rational functions that
are not necessary regular at
0
have been considered in
[27, 28]
and in
[82],
see also the recent papers
[68, 69, 70, 71].
We will consider further the relation between our representations and those of
[27, 28]
in our follow-up paper
[63].
Here is an outline of the paper:
In Section
1 we give
some preliminaries on nc rational functions and evaluations over general algebras.
In Section
2 we present the setting of nc Fornasini–Marchesini realizations centred at a matrix point
Y∈(Ks×s)d and generalize classical results which are well known in the scalar case (s=1) to the case where s≥1. We prove, using synthesis, the existence of such realizations for any nc rational expression (Theorem
2.4), and
introduce the terms of observability and controllability (Subsection
2.2)
analogously to the scalar case as in
[50].
The uniqueness of minimal realizations, up to unique similarity, is then proved
(Theorems 2.13 and 2.16), followed by
a Kalman decomposition argument
(Theorem
2.15). An example of an explicit construction of a minimal realization is presented in Subsection
2.5 for the nc rational expression
(x1x2−x2x2)−1.
During the whole section we carry on
the results also in a more generalized settings
of evaluations w.r.t arbitrary unital stably finite
K−algebra; as a corollary we obtain
a new proof of a theorem of Cohn that equivalence of two rational expressions over matrices implies their equivalence over all stably finite algebras
(Theorem 2.19).
Finally, in Subsection
2.7
we define the McMillan degree of a nc rational expression using minimal Fornasini–Marchesini realizations and show that it does not depend on the centre of the realization.
Section
3
contains the main result of the paper, that is a partial generalization of
Theorem
1
for nc rational functions not necessary regular at a scalar point:
If
R
is a nc rational function of
x1,…,xd
over
K,
then for every
Y=(Y1,…,Yd)∈doms(R)
there exists a unique
(up to unique similarity)
minimal (observable and controllable)
nc Fornasini–Marchesini realization
[TABLE]
centred at
Y,
such that for every
m∈N
and
(X1,…,Xd)∈domsm(R):
[TABLE]
Moreover, using the realization
RFM
we can evaluate R
on every matrix point in the domain of regularity of
R
as well as w.r.t any unital stably finite K−algebra.
The strength
of Theorem
3.3
is that we can evaluate any nc rational function on all of its domain and also w.r.t any unital stably finite
K−algebra, by using a minimal realization of any nc rational expression which represents the function, that is centred at any point from its domain. As a corollary (Corollary 3.4) we provide a
proof of Theorem
1
which— unlike the
original proof in
[49]—
does not make any use of the difference-differential calculus of nc functions, but only the results from Sections
2
and 3.
Generalizations of the main results from Sections
2
and
3
to the matrix valued nc rational functions are briefly summarized in Section
4.
Finally, in Section
5
we provide a full and precise parameterization ((5.3) in Theorem 5.2)
of hermitian nc rational functions in terms of their minimal nc Fornasini–Marchesini realizations centred at a matrix point. A short discussion and some parameterizations are given for descriptor realizations as well.
One of the difficulties which arises when
moving from a scalar to a matrix centre, is that a minimal nc Fornasini–Marchesini realization
RFM
of a nc rational expression is no longer a nc rational expression
by itself (cf. Remark
2.2).
However, in the sequel paper
[63],
we show that under some constraints (called the linearized lost abbey conditions) on the coefficients of the realization—
which follow immediately when RFM
is a minimal nc Fornasini–Marchesini realization of a nc rational expression—
RFM
is actually the restriction of a nc rational function
R with
DOMs(RFM)=doms(R). This will imply the opposite inclusion of the domains in Theorem
2
and thereby complete the proof that the domain of a nc rational function coincides with the domain of any of its minimal realizations, centred at an arbitrary matrix point.
As a corollary, also in
[63], we will prove that the domain of a nc rational function is equal to its stable extended domain.
In a slightly different direction, we will use the the theory of realizations with a matrix centre developed in this paper, together with the results from [63],
to present
an explicit construction of the free skew field
{\mathbb{K}}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}\underline{x}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}},
with a self-contained proof that it is the universal skew field of fractions of the ring of nc polynomials.
Moreover, we will construct a functional model and use it to provide a different one step proof for the existence of a realization formula for nc rational functions, without using synthesis. Furthermore, we will establish a generalization of the Kronecker–Fliess theorem, which gives a full characterization of nc rational functions in terms of their formal nc generalized power series expansions around a matrix point. These results will appear in
[64].
Finally, we point out that instead
of working with Fornasini–Marchesini realizations
(for the settings in the
commutative original version see
[33, 34])
one can consider structured realizations
as in
[8] and obtain similar results.
This is true also for descriptor realizations; for more details see Remark
5.5.
Acknowledgments.
The authors would like to thank Joseph Ball,
Bill Helton,
Dmitry Kalyuzhnyi-Verbovetskyi, Roland Speicher and Juri Volčič
for their helpful comments and discussions.
The authors would also like to thank the referees for their valuable comments which helped to
improve the paper.
1. Preliminaries
Notations:d
will stand for the number of non-commuting variables,
which will be usually denoted by
x1,…,xd, we often abbreviate non-commuting by nc.
For a positive integer
d,
we denote by
Gd
the free monoid generated by
d
generators
g1,…,gd,
we say that a word
ω=gi1…giℓ∈Gd
is of length
∣ω∣=ℓ
if ℓ≥1 and
ω=∅
is of length
[math].
For a field
K
and
n∈N, let
Kn×n
be the vector space of
n×n
matrices over
K,
let
{e1,…,en}
be the standard basis of
Kn
and let
En={Eij=eiejT:1≤i,j≤n}
be the standard basis of
Kn×n.
The tensor (Kronecker) product of two matrices
P∈Kn1×n2
and
Q∈Kn3×n4
is the
n1n3×n2n4
block matrix
P⊗Q=[pijQ]1≤i≤n1,1≤j≤n2.
The range of a matrix
P,
that is the span of all of its columns, denoted by
Im(P).
We denote operators on matrices by bold letters such as
A,B,
and the action of
A
on
X by
A(X). If A is defined on
s×s matrices we extend
A to act on
sm×sm
matrices for any
m∈N,
by viewing an
sm×sm
matrix
X
as an
m×m
matrix with
s×s
blocks and by evaluating
A
on the
s×s
blocks; In that case we denote the evaluation by
(X)A.
If
C
is a constant matrix and
A
is an operator, then
C⋅A
and
A⋅C
are two operators, defined by
(C⋅A)(X):=CA(X)
and
(A⋅C)(X):=A(X)C.
For every
n1,n2∈N, we define the permutation matrix
[TABLE]
and use these matrices to change the order of factors in the Kronecker product of two matrices by the following rule
[TABLE]
for all
n1,n2,n3,n4∈N,Q∈Kn1×n2
and
P∈Kn3×n4;
for more details
see
[44, pp. 259–261].
If
P=[Pij]1≤i,j≤m∈(Ks×s)m×m
and
Q=[Qij]1≤i,j≤m∈(Ks×s)m×m, then we use the notation
[TABLE]
for the so-called faux product of
P and Q,
viewed as
m×m matrices over the tensor algebra of
Ks×s,
where
Pik⊗Qkj
denotes the element of
Ks×s⊗Ks×s, rather than the Kronecker product of the matrices;
see
[60, page 241]
for the exact definition and
[29]
for its origins in operator spaces.
If
X=(X1,…,Xd)∈(Ksm×sm)d
and
ω=gi1…giℓ, then
[TABLE]
We use
R,R,R and
r
for nc rational function, nc Fornasini–Marchesini realization, nc
rational expression and matrix valued nc rational function, respectively.
Likewise, we use a to denote elements in an algebra A
and
A to denote matrices over A.
Throughout the paper, we use underline to denote vectors or d−tuples.
1.1. NC rational functions
If
V
is a vector space over a field
K,
then
Vnc,
the nc space over
V,
consists of all square matrices over
V,
i.e.,
[TABLE]
For every
Ω⊆Vnc
and
n∈N
we use the notation
Ωn:=Ω∩Vn×n.
A subset
Ω⊆Vnc
is called a nc set if it is closed under direct sums, i.e., if
X∈Ωn,Y∈Ωm
then
X⊕Y:=[X00Y]∈Ωn+m,∀m,n∈N.
In the special case where
V=Kd,
we have the identification
[TABLE]
that is the nc space of all
d−tuples of square matrices over
K.
Let
V,W
be vector spaces over a field
K
and
Ω⊆Vnc
be an nc set, then
f:Ω→Wnc
is called a
nc function if
f
is graded, i.e., if
n∈N
and
X∈Ωn,
then
f(X)∈Wn×n, and
f
respects direct sums, i.e., if
X,Y∈Ω,
then
f(X⊕Y)=f(X)⊕f(Y);
2.
f respects similarities, i.e.,
if
n∈N,X∈Ωn
and
T∈Kn×n
is invertible such that
T⋅X⋅T−1∈Ω,
then
f(T⋅X⋅T−1)=T⋅f(X)⋅T−1.
Notice that if
X∈Ωn
and
T∈Kn×n,
by the products
T⋅X
and
X⋅T
we mean the standard matrix multiplication and we use the action of
K
on
V.
In particular, if
V=Kd,X=(X1,…,Xd)∈(Kn×n)d
and
T∈Kn×n,
the products are given by
[TABLE]
An important and central example of nc
functions are nc rational expressions. We denote by
K⟨x1,…,xd⟩
the
K−algebra of nc polynomials in the
d
nc variables
x1,…,xd
over
K.
We obtain nc rational expressions by applying
successive arithmetic operations
(addition, multiplication and taking inverse)
on
K⟨x1,…,xd⟩.
For a nc rational expression
R
and
n∈N,
let
domn(R)
be the set of all
d−tuples of
n×n
matrices over
K
for which all the inverses in
R
exist;
the domain of regularity of
R
is then defined by
[TABLE]
A nc rational expression
R
is called non-degenerate if
dom(R)=∅.
For example,
R(x)=(x2+(1−x1)−1(x3−1x1−x2))x1
is a nc rational expression in
x1,x2,x3,
while its domain of regularity is given by
[TABLE]
Every nc rational expression
R
is a nc function from
dom(R)⊆(Kd)nc
to
Knc. For a detailed discussion of nc rational
expressions and their domains of
regularity, see
[47].
What comes now is the definition of a nc rational function.
Let
R1
and
R2
be nc rational expressions in
x1,…,xd
over
K.
We say that
R1
and
R2
are
(Kd)nc−evaluation equivalent,
if
R1(X)=R2(X)
for every
X∈dom(R1)∩dom(R2).
A
nc rational function is an
equivalence class of non-degenerate nc
rational expressions. For every nc rational function
R,
define its
domain of regularity
[TABLE]
The
K−algebra of all nc rational functions of
x1,…,xd
over
K is denoted by
{\mathbb{K}}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}x_{1},\ldots,x_{d}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}}
and it is a skew field, called the free
skew field. Moreover,
{\mathbb{K}}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}x_{1},\ldots,x_{d}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}}
is the universal skew field of fractions of
K⟨x1,…,xd⟩. See
[6, 17, 21, 22, 66] for the original proofs and
[26]
for a more modern reference, while a proof of the equivalence with the evaluations over matrices is presented in
[48, 49].
1.2. Evaluations over algebras
Let
A be a unital
K−algebra. If
a=(a1,…,ad)∈Ad
and
ω=gi1…giℓ∈Gd,
then we use the notations
aω:=ai1⋯aiℓ
and
a∅=1A, where 1A is the unit element in A.
We recall the definitions of evaluation and
domain of nc rational expressions over
A.
For more details see
[41].
Definition 1.1** (A−Domains and Evaluations).**
For any nc rational expression
R
in
x1,…,xd
over
K,
its
A−domain
domA(R)⊆Ad
and its evaluation
RA(a)
at any
a=(a1,…,ad)∈domA(R)
are defined by:
If
R=∑ω∈Gdrωxω
is a nc polynomial (rω∈K),
then
[TABLE]
2. 2.
If
R=R1R2
where
R1
and
R2
are nc rational expressions, then
[TABLE]
3. 3.
If
R=R1+R2 where R1
and
R2 are nc rational expressions, then
[TABLE]
4. 4.
If
R=R1−1
where
R1
is a nc rational expression, then
[TABLE]
Remark 1.2**.**
Let
n∈N
and consider the
K−algebra
An=Kn×n.
Then, it is easily seen that
domAn(R)=domn(R)
and
R(A)=RAn(A)
for every
A∈domn(R).
As it will be pointed out later (cf. Theorem
2.15), we are interested in a certain family of algebras, called stably finite algebras.
A unital
K−algebra
A
is called
stably finite
if for every
m∈N
and
A,B∈Am×m, we have
[TABLE]
If A
is a unital
C∗−algebra with a faithful trace, then
A
is stably finite. The following is a
characterization of stably
finite algebras that we find useful in a later stage of the paper;
see
[41, Lemma 5.2]
for its proof.
Lemma 1.3**.**
Let
A
be a unital
K−algebra.
The following are equivalent:
A* is stably finite.*
2.
For every
n∈N,m1,…,mn∈N
and
Ai,j∈Ami×mj,i,j=1,…,n,
if the upper (or lower)
triangular block matrix
[TABLE]
is invertible, then
the matrices
A11,…,Ann
are invertible.
2. Realizations of NC Rational
Expressions
Non-commutative Fornasini–Marchesini
realizations, see
[8, 49]
and
[33, 34]
for the original commutative version,
apply to nc rational expressions
which are regular at
0.
By translation, the point
0
can be replaced by any scalar point.
In this section we
develop analogous realization formulas
for nc rational expressions, centred
at an arbitrary
matrix point in the domain
of regularity of the expression.
Definition 2.1**.**
Let
s,L∈N,Y=(Y1,…,Yd)∈(Ks×s)d,
[TABLE]
be linear mappings,
C∈Ks×L
and
D∈Ks×s.
Then
[TABLE]
is called a
nc Fornasini–Marchesini realization
centred at
Y
and it is defined for every
X=(X1,…,Xd)∈DOMs(R),
where
[TABLE]
In that case we say that the realization
R
is described by the tuple(L,D,C,A,B).
Remark 2.2**.**
If
s=1,
then
R
is a
1×1
matrix valued nc rational expression
(see Remark
4.4
for details) and
DOMs(R)=doms(R).
However, this is not the case for
s>1
and that is why we use the notation
DOMs(R)
instead of
doms(R).
Let
s1,s2,s3,s4∈N.
If
T:Ks1×s2→Ks3×s4
is a linear mapping and
m∈N,
then
T
can be naturally extended to a linear mapping
T:Ks1m×s2m→Ks3m×s4m,
by the following rule:
[TABLE]
i.e.,
(X)T
is an
m×m
block matrix with entries in
Ks3×s4.
Therefore, we can extend the realization
(2.1)
to act on
d−tuples of
sm×sm
matrices: for every
X=(X1,…,Xd)
in
[TABLE]
define
[TABLE]
In addition, if
A
is a unital
K−algebra, a linear mapping
T:Ks1×s2→Ks3×s4
can be also naturally extended to a linear mapping
TA:As1×s2→As3×s4
by the following rule:
[TABLE]
where
Eij=eiejT∈Ks1×s2
and
aij∈A.
If
R
is a nc Fornasini–Marchesini realization centred at
Y,
as in
(2.1),
define its
A−domain
to be the subset of
(As×s)d
given by
[TABLE]
and for every
A=(A1,…,Ad)∈DOMA(R)
define
the evaluation of
R
at
A
by
[TABLE]
2.1. Existence
The way we define what is a realization of
a nc rational expression is
different than the usual definition.
In the usual case, the expression and the
realization coincide whenever they are
both defined, while in our definition we include the fact
that the domain of the expression is
contained in the domain of the realization.
We begin with the definition of a nc
rational expression
admitting a realization, both in the
usual way (over matrices) and in
the case of evaluations w.r.t an algebra.
Definition 2.3**.**
Let
R
be a nc rational expression in
x1,…,xd
over
K,Y=(Y1,…,Yd)∈doms(R),
R
be a nc Fornasini–Marchesini realization centred at
Y
and
A
be a unital
K−algebra.
We say that:
R*
admits the realizationR,
or that
R
is a realization of
R,
if*
[TABLE]
for every
m∈N.
2. 2.
R*
admits the realization
R
with respect to (w.r.t)A,
or that
R
is a realization of
R
w.r.t
A,
if for every
a=(a1,…,ad)∈domA(R):*
[TABLE]
and
Is⊗RA(a)=RA(Is⊗a).
We begin by showing the existence of
a nc Fornasini–Marchesini
realization for every nc rational
expression
R,
centred at any
Y∈doms(R),
that is also a realization of
R
w.r.t any unital
K−algebra.
Theorem 2.4**.**
Let
R
be a nc rational expression in
x1,…,xd
over
K
and let
Y=(Y1,…,Yd)∈doms(R).
There exists a nc Fornasini–Marchesini realization
R
of
R
centred at
Y,
such that
R
is a realization of
R
w.r.t any
unital K−algebra.
The proof is done by synthesis, which is going back to ideas from automata theory
[18, 72, 73]
and system theory
[27, 28].
We also use the following technical fact: let
X=(X1,…,Xd)∈(Ksm×sm)d
and write
[TABLE]
then
(Xk−Im⊗Yk)Ak=∑i,j=1mEij⊗Ak(Xij(k))−Im⊗Ak(Yk)
and hence
[TABLE]
and similarly
[TABLE]
where
P1=E(m,s) and P2=E(m,L)
are the shuffle matrices defined in
(1.1).
Therefore for every
X∈DOMsm(R)
we have
[TABLE]
Proof.
We first show that the theorem is true for all monomials
x1,…,xd
and constants, then we show that if
it is true for two rational expressions, so it is also true for
their summation, multiplication and their inversion,
when they exist.
1. Constants:
Let
R0(x)=K∈K.
If
a∈domA(R0)=Ad,
then
Is⊗a∈DOMA(R0)=(As×s)d,
where the realization
R0
is centred at
Y∈doms(R0)=(Ks×s)d
and described by
[TABLE]
and
Is⊗R0A(a)=Is⊗(K⊗1A)=D⊗1A=R0A(Is⊗a).
Moreover,
[TABLE]
and for every
X∈domsm(R0)
we have
R0(X)=Ism⊗K=Im⊗D=R0(X).
2. Monomials:
Let
Rj(x)=xj
for
1≤j≤d.
If
a∈domA(Rj)=Ad,
then
Is⊗a∈DOMA(Rj)=(As×s)d,
where the realization
Rj
is centred at
Y∈doms(Rj)=(Ks×s)d
and described by
[TABLE]
and
[TABLE]
Moreover,
domsm(Rj)=(Ksm×sm)d=DOMsm(Rj)
and for every
X∈domsm(Rj) we have
R(X)=Xj=Im⊗Yj+(Xj−Im⊗Yj)Bj=Rj(X).
3. Addition:
Suppose
R1
and
R2
are two nc rational expressions admitting realizations
R1
and
R2 both centred at
Y,
described by the tuples
(L1,D1,C1,A1,B1)
and
(L2,D2,C2,A2,B2),
respectively, and also w.r.t
any unital
K−algebra
A.
Thus,
a∈domA(R1+R2)=domA(R1)∩domA(R2)
implies that
Is⊗a∈DOMA(R1)∩DOMA(R2),
[TABLE]
and
Is⊗a∈DOMA(Rpar),
when
Rpar
is the nc Fornasini–Marchesini realization centred at
Y
described by
[TABLE]
Also, for every
m∈N,
X∈domsm(R1+R2)=domsm(R1)∩domsm(R2)
implies
X∈DOMsm(Ri)
and
Ri(X)=Ri(X)
for
i=1,2
and hence
(R1+R2)(X)=R1(X)+R2(X).
Write
X=(X1,…,Xd)∈(Ksm×sm)d
and use
(2.3)
to obtain that
[TABLE]
i.e.,
R1(X)+R2(X)=Rpar(X)
while it is easily seen that
X∈DOMsm(Rpar).
4. Multiplication:
Suppose
R1
and
R2
are two nc rational expressions admitting realizations
R1
and
R2
both centred at
Y,
described by the tuples
(L1,D1,C1,A1,B1)
and
(L2,D2,C2,A2,B2),
respectively, and also w.r.t any unital
K−algebra
A.
Thus,
a∈domA(R1R2)=domA(R1)∩domA(R2)
implies that
Is⊗a∈DOMA(R1)∩DOMA(R2),
[TABLE]
and
Is⊗a∈DOMA(Rser),
when
Rser
is the nc Fornasini–Marchesini realization centred at
Y described by
[TABLE]
Also,
for every
m∈N,
X∈domsm(R1R2)=domsm(R1)∩domsm(R2)
implies that
X∈DOMsm(Ri)
and
Ri(X)=Ri(X)
for
i=1,2
and
(R1R2)(X)=R1(X)R2(X).
Now, let
X=(X1,…,Xd)∈(Ksm×sm)d
as in
(2.2), so similar computation shows that
X∈DOMsm(R) and
(R1R2)(X)=R1(X)R2(X)=Rser(X).
5. Inverses:
Suppose
R
is a nc rational expression admitting a realization
R
centred at
Y,
described by the tuple
(L,D,C,A,B),
also w.r.t
any
unital K−algebra A
and
R(Y)=D
is invertible.
Thus,
a∈domA(R−1)
implies that
a∈domA(R),Is⊗a∈DOMA(R),RA(a)
is invertible and
RA(Is⊗a)=Is⊗RA(a),
so
[TABLE]
and
Is⊗a∈DOMA(Rinv),
when
Rinv
is the nc Fornasini–Marchesini realization centred at
Y described by
[TABLE]
Moreover, if
X∈domsm(R−1),
then
X∈domsm(R) and
R(X)
is invertible, so
X∈DOMsm(R)
and
R(X)=R(X)
is invertible, therefore the matrices
M
and
Im⊗D+(Im⊗C)M−1N
are invertible,
where
[TABLE]
Consider the matrix
[TABLE]
together with its two Schur complements decompositions
[TABLE]
As
M
and
Im⊗D+(Im⊗C)M−1N
are invertible, it follows that
E
is invertible and hence
[TABLE]
is invertible, i.e.,
X∈DOMsm(Rinv).
Thus
domsm(R−1)⊆DOMsm(Rinv)
and for every
X∈domsm(R−1),
we have
R−1(X)=R(X)−1=Rinv(X).
∎
We finish this subsection by comparing the two parts of
Definition
2.3
for the K−algebra
An=Kn×n
(cf. Remark
1.2).
This will imply (see Corollary 2.6)
that for every nc rational expression R, the realization that we have constructed in Theorem
2.4— centred at a
d−tuple of
s×s matrices—
allows us to evaluate R
at every point in its domain of
regularity and not only at the points
whose dimension is a multiple of
s.
An alternative way to evaluate
a nc rational expression on all of
its domain of regularity, will be given later in
Theorem
3.3.
We define
P1=E(n,s)
and
P2=E(n,L),
correspondingly to
(\refeq:24Jan19a).
Proposition 2.5**.**
Let
n≥1,An=Kn×n,R
be a nc Fornasini–Marchesini
realization centred at
Y∈(Ks×s)d
and
X∈(Ksn×sn)d.
Then
[TABLE]
and
RAn(X)=P1−1R(P1⋅X⋅P1−1)P1,
whenever
(\refeq:13Feb19b)
holds.
Proof.
Let
X=(X1,…,Xd)∈(Ksn×sn)d
and consider the decomposition
(2.2),
where
Xij(k)∈Kn×n=An
for
1≤i,j≤s
and
1≤k≤d.
As
[TABLE]
we have
X∈DOMAn(R)
if and only if
P1⋅X⋅P1−1∈DOMsn(R).
Similar computation shows that
[TABLE]
and hence
X∈DOMAn(R) implies
[TABLE]
∎
Corollary 2.6**.**
If n∈N and
R
is a nc Fornasini–Marchesini
realization of a nc rational expression
R
w.r.t
An=Kn×n,
then for every
X∈domn(R)
we have
[TABLE]
Proof.
Let
X∈domn(R),
thus
X∈domAn(R)
and that implies by Definition
2.3
that
Is⊗X∈DOMAn(R)
and
RAn(Is⊗X)=Is⊗RAn(X).
Using Proposition
2.5,
we get
[TABLE]
and
[TABLE]
which implies that
R(X⊗Is)=R(X)⊗Is.
∎
2.2. Controllability and observability
To consider the notion of minimal realizations as
in the classical realization theory, we first
introduce the definitions of controllability and
observability in the case of nc
Fornasini–Marchesini realizations centred
at a matrix point,
which are generalizations of the definitions
in the case of nc Fornasini–Marchesini realizations centred at a scalar point. For a reference
of the later ones see
[8].
Given the linear mappings
A1,…,Ad:Ks×s→KL×L,Bk:Ks×s→KL×s
and a word
ω=gi1…giℓ∈Gd
of length
∣ω∣=ℓ,
define the
multilinear mapping
Aω:(Ks×s)ℓ→KL×L
by
[TABLE]
and the multilinear mapping
Aω⋅Bk:(Ks×s)ℓ+1→KL×s
by
[TABLE]
Definition 2.7**.**
Let
A1,…,Ad:Ks×s→KL×L
and
B1,…,Bd:Ks×s→KL×s
be linear mappings, and
C∈Ks×L.
The controllable subspaceCA,B
is defined by
[TABLE]
If
CA,B=KL,
then the tuple
(A,B)
is called controllable.
2.
The un-observable subspaceNOC,A
is defined by
[TABLE]
If
NOC,A={0},
the tuple
(C,A)
is called observable.
The multilinear mapping
Aω
can be viewed as a linear mapping from
(Ks×s)ℓ
to
KL×L.
Then one can use the faux product, as introduced in
(1.2),
to define controllability and observability
not only on the level of
s×s
matrices, but also on the levels of
sm×sm
matrices, for every
m∈N,
using the subspaces
[TABLE]
and
[TABLE]
Proposition 2.8**.**
If
m∈N,
then
CA,B(m)=CA,B(1)⊗Km
and
NOC,A(m)=NOC,A(1)⊗Km.
Proof.
Let
m∈N.
∙ If
u∈CA,B(m),
then
u
is a linear combination of vectors of the form
[TABLE]
where
1≤i1,…,ik+1≤d,X1,…,Xk+1∈Ksm×sm
and
ui∈Ksm.
As the mappings
Ai,Bi(1≤i≤d)
act on
sm×sm
matrices by acting on their s×s blocks,
we get that
(X1)Ai1⋯(Xk)Aik(Xk+1)Bik+1ui∈CA,B(1)⊗Km
and as a linear combination of such vectors,
we get that
u∈CA,B(1)⊗Km.
∙
On the other hand, let
u∈CA,B(1)⊗Km
and write
u=[u1T…umT]T
where
u1,…,um∈CA,B(1).
Thus
[TABLE]
where
e1,…,em
is the standard basis of
Km,ki∈N,ωj,i∈Gd,1≤ℓi,j≤d
and
Xj,1(i),…,Xj,∣ωj,i∣(i),Xj(i)∈Ks×s
for
1≤j≤ki
and
1≤i≤m.
∙
Next, let
[TABLE]
then for all
ω∈Gd,1≤j≤m
and
X1,…,X∣ω∣∈Ks×s,
we have
[TABLE]
i.e.,
uj∈NOC,A(1)
and hence
u∈NOC,A(1)⊗Km.
∙
On the other hand, let
[TABLE]
then
for every
ω=gi1…gik∈Gd
and
Z1,…,Zk∈Ksm×sm
we have
[TABLE]
as
u1,…,um∈NOC,A(1)
and each of the entries in the product is a linear combination
of vectors of the form
C\mathbf{A}_{i_{1}}\big{(}Z^{(1)}_{p_{1},q_{1}}\big{)}\cdots\mathbf{A}_{i_{k}}\big{(}Z^{(k)}_{p_{k},q_{k}}\big{)}\underline{u}_{i}
where
1≤i≤m,
which are all
0.
∎
Two immediate consequences of Proposition
2.8
are the following.
If
(A,B)
is controllable, then
CA,B(m)=KLm
for all m∈N;
whereas if
CA,B(m)=KLm
for some m∈N, then
(A,B)
is controllable. Similarly,
if
(C,A)
is observable, then
NOC,A(m)={0}
for all m∈N;
whereas if
NOC,A(m)={0}
for some m∈N, then
(C,A)
is observable
Next, we show how
the original definitions of
controllability and observability may be reformulated
using the standard basis
Es
of
Ks×s.
Proposition 2.9**.**
Let
A1,…,Ad:Ks×s→KL×L
and
B1,…,Bd:Ks×s→KL×s
be linear mappings, and
C∈Ks×L.
Then
(A,B)*
is controllable
if and only if*
[TABLE]
2. 2.
(C,A)*
is observable
if and only if*
[TABLE]
Proof.
Since
Es⊆Ks×s
the direction
⟸ of part 1
is trivial.
To prove the other direction, suppose
(A,B)
is controllable, let
X1,…,Xℓ+1∈Ks×s
and
ω=gj1…gjℓ∈Gd.
Thus, one can write
Xt=∑p,q=1sEpq⊗xpq(t) for 1≤t≤ℓ+1
and by linearity of
Ak,Bk
we get
[TABLE]
Therefore
{\mathcal{C}}_{\underline{\mathbf{A}},\underline{\mathbf{B}}}\subseteq\bigvee_{\nu\in{\mathcal{G}}_{d},\,Z_{1},\ldots,Z_{\ell+1}\in{\mathcal{E}}_{s},\,1\leq k\leq d}\operatorname{Im}\ \big{(}\underline{\mathbf{A}}^{\nu}(Z_{1},\ldots,Z_{\ell})\mathbf{B}_{k}(Z_{\ell+1})\big{)}
whereas
CA,B=KL
implies the wanted equality.
Similar proof holds for part
2.
∎
The last part of this subsection discusses observability and controllability matrices.
The infinite block matrix
[TABLE]
is called the
controllability matrix
associated with the tuple
(A,B),
where
[TABLE]
for each
(ω,k)∈Gd×{1,…,d}
and the infinite block matrix
[TABLE]
is called the
observability matrix
associated to the tuple
(C,A),
where
[TABLE]
for each
ω∈Gd.
The following is a characterization of controllability
and observability using the
controllability and observability matrices.
Most of the arguments in
the proof are taken from linear algebra.
Proposition 2.10**.**
Let
A1,…,Ad:Ks×s→KL×L
and
B1,…,Bd:Ks×s→KL×s
be linear mappings, and
C∈Ks×L.
The following are equivalent:
(A,B)*
is controllable [resp.,
(C,A)
is observable].*
2. 2.
*The matrix
CA,B
*\big{[}resp.,
\mathfrak{O}_{C,\underline{\mathbf{A}}}\big{]}
is right [resp., left] invertible.
3. 3.
*The finite block matrix
row[CA,B(ω,k)]∣ω∣≤ℓ,1≤k≤d
*\Big{[}resp.,
col\begin{bmatrix}\mathfrak{O}_{C,\underline{\mathbf{A}}}^{(\omega)}\\
\end{bmatrix}_{|\omega|\leq\ell}\Big{]}
is right [resp., left]
invertible for some
ℓ∈N.
In that case, we can choose
ℓ≤L−1.
Proof.
1 ⟹ 2:
If
(A,B)
is controllable, then
ej∈KL
can be written as
[TABLE]
where
kj∈N,ωj,i∈Gd,Xi,1(j),…,Xi,∣ωj,i∣+1(j)∈Ks×s
and
1≤ℓj,i≤d,
for every
1≤i≤kj
and
1≤j≤L.
Thus
e1,…,eL
belong to the column span of the matrix
CA,B
and hence
CA,B
is right invertible.
2 ⟹ 3:
If the infinite matrix
CA,B
is right invertible, it means that its column span is equal to
KL,
however this span of infinitely many vectors of length
L
must coincide with a span of finitely many of the columns,
which easily implies part
3.
3 ⟹ 1:
If
3
holds then the column span of
CA,B
contains
e1,…,eL
and thus is equal to
KL, i.e.,
CA,B=KL
and the tuple
(A,B)
is controllable.
∙ Suppose next that
(A,B)
is controllable, and define
[TABLE]
for
ℓ≥0.
Then
C0⊆C1⊆…⊆Cℓ⊆Cℓ+1⊆…
are all subspaces of
KL,
whereas
the controllability of
(A,B)
implies that
⋃ℓ=0∞Cℓ=KL
and
C0={0}.
Moreover, it is easily seen that if
Cℓ0=Cℓ0+1
for some
ℓ0≥0,
then
Cℓ0+k=Cℓ0
for all
k≥0
and hence
[TABLE]
Therefore, the sequence
1≤dim(C0)≤dim(C1)≤…≤dim(CL)≤…≤L
must coincide after at most
L−1
inequalities, i.e.,
dim(CL−1)=L
which means that
KL=CA,B=CL−1.
∙ As for observability, to prove that 1 ⟹ 2 ⟹ 3
⟹ 1
we use the same arguments as above; so we only show how to get the bound on the size of the matrix.
Suppose that
(C,A)
is observable and define
[TABLE]
for
ℓ≥0. Then
NO0⊇NO1⊇…⊇NOℓ⊇NOℓ+1⊇…
are all subspaces of
KL,
whereas the observability of
(C,A)
implies that
⋂ℓ≥0NOℓ={0}
and
NO0=KL.
It is easily seen that if
NOℓ0=NOℓ0+1
for some
ℓ0≥0,
then
NOℓ0+k=NOℓ0
for all k≥0 and hence
[TABLE]
Therefore the sequence
L>dim(NO0)≥dim(NO1)≥…≥dim(NOL)≥…
must coincide after at most
L−1
inequalities, i.e.,
NOL−1={0}.
∎
2.3. Minimal realizations
A nc Fornasini–Marchesini realization of the form
(2.1)
is said to be
∙
controllable
if the tuple
(A,B)
is controllable;
2. ∙
observable if the tuple
(C,A)
is observable.
If
R
is a nc Fornasini–Marchesini realization of a nc rational expression
R
centred at
Y,
then it is said to be
∙
minimal
if the dimension
L
is the smallest integer for which
R
admits such
a realization, i.e., if
R′
is a nc Fornasini–Marchesini realization of
R
centred at
Y
of dimension
L′,
then
L≤L′.
Remark 2.11**.**
In fact, the minimality of a realization
R
is w.r.t rational functions,
meaning that if
R
is a minimal nc Fornasini–Marchesini realization of
R
centred at
Y,
then it is also a minimal nc Fornasini–Marchesini realization
of any nc rational expression
R
which is
(Kd)nc−evaluation equivalent to
R (cf. Lemma
3.1).
We proceed by showing that every two controllable and observable
nc Fornasini–Marchesini realizations centred at
Y
of
(Kd)nc−evaluation equivalent nc rational
expressions must be similar, where most of the ideas of the proof are taken from
[7, 13].
We will also use the following facts, see
[49, Theorem 4.8] and
[47]:
∙
If R
is a nc rational expression
and
Y∈doms(R),
then
[TABLE]
for every
m∈N,
where a tuple
Z=(Z1,…,Zd)∈(Ksm×sm)d
is called jointly nilpotent if there exists
κ∈N
such that
Z⊙sω=0
for all
ω∈Gd
satisfying
∣ω∣≥κ.
∙R∣Nilp(Y)
is a nc function on the nilpotent ball around
Y,
that is
[TABLE]
∙
Every nc function on
Nilp(Y)
has a power series expansion around
Y
of the form
[TABLE]
where
Rω
are
∣ω∣−linear mappings from
(Ks×s)∣ω∣
to
Ks×s, called the Taylor–Taylor coefficients and
are uniquely determined, see
[47, Theorem 5.9];
notice that the sum is actually finite.
Lemma 2.12**.**
If
R
is a nc rational expression in
x1,…,xd
over
K
and
R
is a nc Fornasini–Marchesini realization of
R
centred at
Y∈doms(R),
of the form
(\refeq:18Aug18a),
then the Taylor–Taylor coefficients of
R
are given by
R∅:=D
and the multilinear mappings
Rωgk:=C⋅Aω⋅Bk:(Ks×s)ℓ+1→Ks×s
which act as
[TABLE]
for Z1,…,Zℓ+1∈Ks×s,ω=gi1…giℓ∈Gd
and
1≤k≤d.
Moreover, if
Z1,…,Zℓ+1∈Ksm×sm,
then
[TABLE]
Proof.
Let
X∈Nilp(Y;sm),
then
we use the Neumann series w.r.t
nilpotent elements in
\big{(}\mathbf{T}({\mathbb{K}}^{s\times s})\big{)}^{m\times m}—
where
T(Ks×s)
is the tensor algebra of
Ks×s—
to obtain that
[TABLE]
where the second multiplicative term
is actually a finite sum. As
Y∈doms(R)
it follows that
Nilp(Y;sm)⊆domsm(R),
thus
X∈domsm(R)⊆DOMsm(R)
and
[TABLE]
where the multilinear mappings
(Rωgk)
are given by
(2.12).
However,
R∣Nilp(Y)
is a nc function on
Nilp(Y)
and so it has a unique Taylor–Taylor
expansion, given by the coefficients
(Rν)ν∈Gd.
∎
Theorem 2.13** (Similarity of minimal realizations).**
Let
R1
and
R2
be two nc rational expressions in
x1,…,xd
over
K,
which admit nc Fornasini–Marchesini realizations
[TABLE]
and
[TABLE]
respectively, both centred at
Y∈(Ks×s)d.
Assume both
R1 and
R2 are
controllable and observable.
If
R1
and
R2
are
(Kd)nc−evaluation equivalent, then
R1
and
R2
are uniquely similar, i.e.,
L1=L2,D1=D2
and there exists a unique invertible matrix
T∈KL1×L1
such that
[TABLE]
Moreover,
[TABLE]
for every
m∈N,
and for any unital
K−algebra A:
[TABLE]
Proof.
From Lemma
2.12, the Taylor–Taylor coefficients of
the nc rational expressions
R1
and
R2 (w.r.t the centre
Y) are
[TABLE]
respectively.
Since
R1
and
R2
are
(Kd)nc−evaluation equivalent, their restrictions to
Nilp(Y)
produce the same nc function and
therefore, by the uniqueness of the Taylor–Taylor coefficients,
R∅(1)=R∅(2)
and
Rωgk(1)=Rωgk(2)
as multilinear mappings
for every
ω∈Gd
and
1≤k≤d,
i.e.,
D1=D2
and
[TABLE]
Define a mapping
T
in the following way: for every
ω∈Gd,1≤k≤d,X=(X1,…,X∣ω∣)∈(Ks×s)d,X∣ω∣+1∈Ks×s
and
u∈Ks,
let
[TABLE]
and extend it by linearity.
We proceed by showing some properties of
T.
∙** The domain of
T
is
KL1:**
The domain of
T
consists of all the vectors in
KL1
which are in
[TABLE]
and that is exactly
CA,B=KL1,
by the controllability of
R1
and hence of
(A1,B1).
∙** T is well-defined:**
Let
w1,w2∈KL1,
then they can be written as
[TABLE]
and
[TABLE]
where
p1,p2∈N,ω1,j,ω2,i∈Gd,1≤k1,j,k2,i≤d,u1,j,u2,i∈Ks
and
Xj,α(1),Xi,β(2)∈Ks×s,
for every
1≤α≤∣ω1,j∣,1≤β≤∣ω2,i∣,1≤j≤p1 and
1≤i≤p2.
Apply
(2.14),
so for every
ω∈Gd,
[TABLE]
and
[TABLE]
which imply that for every
X∈(Ks×s)∣ω∣,
[TABLE]
i.e.,
[TABLE]
Finally, if
w1=w2,
then
C^{2}\big{(}\underline{\mathbf{A}}^{2}\big{)}^{\omega}(\underline{X})({\mathcal{T}}(\underline{w}_{1})-{\mathcal{T}}(\underline{w}_{2}))=\underline{0}
for all
ω∈Gd
and
X∈(Ks×s)∣ω∣,
whereas
the observability of R2
and hence of
(C2,A2)
guarantees that
T(w1)=T(w2).
∙** T is 1−1:**
If
w1,w2∈KL1
such that
T(w1)=T(w2),
it follows from
(2.16)
that
C^{1}\big{(}\underline{\mathbf{A}}^{1}\big{)}^{\omega}(\underline{X})(\underline{w}_{1}-\underline{w}_{2})=\underline{0}
for every
ω∈Gd
and
X∈(Ks×s)∣ω∣,
whereas the observability of
R1
and hence of
(C1,A1)
guarantees that
w1=w2.
∙** T is onto KL2:**
The tuple (A2,B2)
is controllable and hence every
e∈KL2
can be written as
[TABLE]
where
p∈N,νj∈Gd,X(j)∈(Ks×s)∣νj∣,Xj+1∈Ks×s,1≤kj≤d
and
vj∈Ks
for every
1≤j≤p,
i.e.,
KL2⊆Im(T) and hence T
is onto
KL2.
Therefore,
T:KL1→KL2
is an isomorphism,
L1=L2:=L,
the representative matrix
T:=[T]EL∈KL×L
is invertible and
T(w)=Tw
for all
w∈KL.
\bullet\textbf{ \uline{The realizations
{\mathcal{R}}{1}and{\mathcal{R}}{2} are similar:}}
If
w1=0
and
ω=∅,
then
(2.16)
implies
[TABLE]
while applying
(2.16)
again with
w1=0
and using the observability of
(C2,A2), lead to
[TABLE]
From the definition of
T
we have
[TABLE]
for every X∈Ks×s
and
1≤k≤d. Thus, we proved the realizations are similar.
∙T is uniquely determined:
Let
T2∈KL×L
be such that
Bk1=T2−1⋅Bk2
and
Ak1=T2−1⋅Ak2⋅T2
for every
1≤k≤d,
then it is easily seen that
T2
satisfies the relation in
(2.15)
and thus the controllability of
(A2,B2)
implies that
T2=T.
∙ Moreover,
[TABLE]
for every
m∈N,
which implies that
X∈DOMsm(R2)⟺X∈DOMsm(R1),
i.e., that
DOMsm(R1)=DOMsm(R2).
It is easily seen that using the relations in
(2.13),
we have
R1(X)=R2(X)
for every
X∈DOMsm(R1).
∙ Finally, the relations in
(2.13) also imply that
C2⊗1A=(C1⊗1A)(T−1⊗1A)
and that for every
A=(A1,…,Ad)∈(As×s)d, we have
[TABLE]
for every 1≤k≤d.
Therefore,
[TABLE]
which implies that
DOMA(R1)=DOMA(R2)
and that
R1A(A)=R2A(A)
for every
A∈DOMA(R1).
∎
Remark 2.14**.**
One can obtain the equality in
(2.14)
and hence prove Theorem
2.13
without using Lemma
2.12,
by evaluating nc rational expressions on generic matrices and then considering power series in commuting variables (the entries of the generic matrices).
2.4. Kalman decomposition
We proceed next to obtain a Kalman decomposition for nc Fornasini–Marchesini realizations centred at a matrix point
Y∈(Ks×s)d,
which generalizes the Kalman decomposition for nc Fornasini–Marchesini realizations centred at a scalar point
(as in
[8]),
where the later decomposition is a generalization of the classical Kalman decomposition (see
[13, 50]).
This is the first place in our analysis where
A
is no longer an arbitrary
unital
K−algebra, but has
to be stably finite.
The stably finiteness is used to deduce the invertibility of one of the blocks in a block upper triangular matrix that is invertible (cf. Lemma
1.3).
Theorem 2.15** (Kalman Decomposition).**
Let
[TABLE]
be a nc Fornasini–Marchesini realization centred at
Y∈(Ks×s)d.
There exists a nc Fornasini–Marchesini realization
R
centred at
Y,
that is controllable and observable, of dimension
L=dim(CA,B)−dim(CA,B∩NOC,A),
such
that
[TABLE]
for every
m∈N,
and for any unital
stably finiteK−algebra
A,
[TABLE]
As the proof shows (see
(2.19)
below),
R
is obtained from
R
analogously to the classical case,
by restricting to a joint invariant
subspace of the operators
A1,…,Ad
and then compressing to a co-invariant subspace.
Proof.
Using the controllability and
un-observability subspaces of
KL,
which correspond to
(A,B)
and
(C,A),
define
C:=CA,B,NO:=NOC,A,
[TABLE]
H2
a complementary subspace
of
H1
in
C
and
H3
a complementary subspace
of
H1
in
NO, thus
[TABLE]
If
h1+h2+h3=0
where
h1∈H1,h2∈H2
and
h3∈H3,
then
h1+h2=−h3∈C∩NO∩H3=H1∩H3={0},
which implies that
h1+h2=−h3=0 and hence
h1=h2=h3=0.
Therefore, the sum
H1+H2+H3
is a direct sum; let
H4
be a complementary subspace
of
H1+H2+H3
in
KL, thus
[TABLE]
Notice that we are interested in
H2
as it is a subspace of a controllable (invariant) subspace
and a complementary subspace of an un-observable subspace.
Define the dimensions
Lj:=dim(Hj)
for
1≤j≤4,
so
L=L1+…+L4.
From Proposition
2.8
we have
NO(m)=NO⊗Km
and
C(m)=C⊗Km
for every
m∈N,
hence
[TABLE]
Define
H2(m):=H2⊗Km,H3(m):=H3⊗Km
and
H4(m):=H4⊗Km,
thus
[TABLE]
and
[TABLE]
∙ With respect to the decomposition
(2.19)
of
KL,
there exists
P∈KL×L
invertible such that
for every
X∈Ksm×sm
and
1≤k≤d,
the matrices
(X)Ak∈KLm×Lm,(X)Bk∈KLm×sm
and
Im⊗C∈Ksm×Lm
can be decomposed, w.r.t
(2.20), as
[TABLE]
where
P(m):=Im⊗P.
If
u1∈H1(m),u2∈H2(m),u3∈H3(m)
and
v∈Ksm,
then
[TABLE]
which imply that
[TABLE]
all vanish.
Therefore, we get
[TABLE]
hence for every
X∈DOMsm(R),
[TABLE]
where
[TABLE]
is invertible. Thus
[TABLE]
where
L=L2=dim(C)−dim(NO∩C)
and the inverse of
ΛX
is given by
[TABLE]
Therefore, for every
X∈DOMsm(R), we have
[TABLE]
where
R
is the nc Fornasini–Marchesini realization
described by
\big{(}\widetilde{L},D,C^{1},\underline{\mathbf{A}}^{1,1},\underline{\mathbf{B}}^{1}\big{)}
and centred at
Y,
and
(2.21)
implies that
X∈DOMsm(R).
∙
Next, let
A=(A1,…,Ad)∈(As×s)d
and write
Ak=∑i,j=1sEij⊗aij(k), where Eij∈Es and
aij(k)∈A,
then
[TABLE]
where
[TABLE]
Therefore, if
A∈DOMA(R),
then
[TABLE]
is invertible in
AL×L,
while applying Lemma
1.3
to obtain that
[TABLE]
is invertible in
AL×L,
i.e., that
A∈DOMA(R).
Moreover, a careful similar computation shows that if
A∈DOMA(R),
then
RA(A)=RA(A).
∙
For every
u∈Ks,1≤k≤d,
a word
ω=gi1…giℓ∈Gd
of length
ℓ∈N
and
X1,…,Xℓ+1∈Ks×s,
we have
[TABLE]
Thus, for every
v∈C,
we have
P−1v∈C⊕KL1⊕{0}⊕{0}⊆KL
and hence
dim(C)≤dim(C)+L1.
As
dim(C)=L1+L2,
we get that
L2≤dim(C),
while
C⊆KL2
yields that
C=KL2=KL,
i.e., the realization
R
is controllable.
∙
For every
w1∈KL1,w2∈KL2,w3∈KL3,
a word
ω=gi1…giℓ∈Gd
of length
ℓ∈N
and
X1,…,Xℓ∈Ks×s,
we have
[TABLE]
therefore
w2∈NO:=NOC1,A1,1
implies that
P[w2Tw1T0w3T]T∈NO.
As
P
is invertible,
dim(NO)≥dim(NO)+L1+L3=dim(NO)+dim(NO)
which guarantees that
NO={0},
i.e., that
R is observable.
∎
As
a corollary we get that a nc Fornasini–Marchesini
realization (of a nc rational expression) is
minimal if and only if it is both controllable and
observable:
Theorem 2.16**.**
Let
R
be a nc rational expression in
x1,…,xd
over
K
and
R
be a nc Fornasini–Marchesini realization of
R
centred at
Y∈(Ks×s)d.
Then
R
is minimal if and only if
R is controllable and observable.
Proof.
If
R
is minimal, then using Theorem
2.15 we must have
[TABLE]
which implies that
L=L,dim(C(1))=L
and
dim(NO(1))=0,
i.e., that
R
is controllable and observable.
On the other hand, let
R
be both controllable and observable, and suppose
R′
is a minimal nc Fornasini–Marchesini realization of
R centred at
Y
of dimension
L′.
Thus, by the first part of the theorem,
R′
is controllable and observable, as well as
R,
so Theorem
2.13
implies that
L=L′
and hence
R
is minimal.
∎
Minimal nc Fornasini–Marchesini realizations
are playing a central role in the analysis of the domains; one of the reasons is that they admit the maximal domain among all nc Fornasini–Marchesini realizations—
of a given nc rational expression— which are centred at the same point:
Lemma 2.17**.**
Let
R1,R2
be two nc Fornasini–Marchesini realizations
of a nc rational expression
R,
both centred at
Y∈(Ks×s)d.
If
R2
is minimal, then
[TABLE]
for every m∈N,
and for any
unital stably finite K−algebra
A:
[TABLE]
Proof.
Applying Theorem
2.15
for the nc Fornasini–Marchesini realization
R1,
there exists a
minimal nc Fornasini–Marchesini realization
R1
centred at
Y
for which
[TABLE]
for every
m∈N,
and for any unital stably finite K−algebra
A:
[TABLE]
In particular
R1
is a nc Fornasini–Marchesini realization of
R.
As both
R2
and
R1
are minimal nc Fornasini–Marchesini realizations of
R,
both centred at
Y,
Theorem
2.13
implies that
[TABLE]
and
[TABLE]
Therefore,
DOMsm(R1)⊆DOMsm(R1)=DOMsm(R2)
and
R1(X)=R1(X)=R2(X)
for every
X∈DOMsm(R1).
Moreover,
DOMA(R1)⊆DOMA(R1)=DOMA(R2)
and
R1A(A)=R1A(A)=R2A(A)
for every
A∈DOMA(R1).
∎
The following is a summary of all of the main results
in this subsection.
Corollary 2.18**.**
If
R
is a nc rational expression in
x1,…,xd
over
K
and
Y∈doms(R)⊆(Ks×s)d,
then
R
admits a unique (up to unique similarity)
minimal nc Fornasini–Marchesini realization
centred at
Y
that is also a realization of
R
w.r.t any
unital stably finite K−algebra.
Moreover, any minimal nc Fornasini–Marchesini realization of
R
centred at
Y
is a realization of
R
w.r.t any
unital stably finite
K−algebra.
Proof.
From Theorem
2.4,
R admits a nc Fornasini–Marchesini realization
R
centred at
Y
that is also a nc Fornasini–Marchesini realization of
R
w.r.t any
unital stably finite
K−algebra A,
while Theorem
2.15
guarantees
the existence of a minimal nc Fornasini–Marchesini realization
R
centred at
Y, for which
[TABLE]
for every
m∈N, and
[TABLE]
Therefore, for every m∈N,
[TABLE]
i.e.,
R is a realization of R,
while the uniqueness of
R
follows from Theorem
2.13.
∙ Moreover, if
a∈domA(R), then
Is⊗a∈DOMA(R)
and
Is⊗RA(a)=RA(Is⊗a)=RA(Is⊗a),
i.e., R is a realization of R w.r.t A.
∙ Furthermore, if
Rˇ is a minimal nc Fornasini–Marchesini realization of
R
centred at
Y, then
R
and
Rˇ
are both minimal nc Fornasini–Marchesini realizations of
R
centred at
Y,
hence by Lemma
2.13,
DOMA(Rˇ)=DOMA(R) and RˇA(A)=RA(A),
for every
A∈DOMA(Rˇ).
Therefore, for every
a∈domA(R)
we have
Is⊗a∈DOMA(R)=DOMA(Rˇ)
and
Is⊗RA(a)=RA(Is⊗a)=RˇA(Is⊗a),
i.e.,
Rˇ
is a nc Fornasini–Marchesini realization of
R w.r.t
A.
∎
2.5. Example
Consider the nc rational expression
R(x1,x2)=(x1x2−x2x1)−1,
with
K=C,s=2
and
Y=(Y1,Y2)=((0110),(100−1))∈dom2(R).
We use synthesis and follow the proof of
Theorem 2.4,
to find a nc Fornasini–Marchesini realization of
R
centred at
Y:
∙R1(x)=x1
admits a nc Fornasini–Marchesini realization centred at
Y
(see (2.5)),
described by
[TABLE]
∙R2(x)=x2
admits a nc Fornasini–Marchesini realization centred at Y
(see
(2.5)), described by
[TABLE]
∙R3(x)=R1(x)R2(x)=x1x2
admits a nc Fornasini–Marchesini realization centred at
Y
(see
(2.7)), described by
[TABLE]
∙R4(x)=−R2(x)R1(x)=−x2x1
admits a nc Fornasini–Marchesini realization centred at
Y
(see
(2.7)),described by
[TABLE]
∙R5(x)=R3(x)+R4(x)=x1x2−x2x1
admits a nc Fornasini–Marchesini
realization centred at Y
(see (2.6)), described by
[TABLE]
∙R(x)=R5(x)−1=(x1x2−x2x1)−1
admits a nc Fornasini–Marchesini realization
R
centred at
Y
(see
(2.8)),
described by
[TABLE]
[TABLE]
[TABLE]
The nc Fornasini–Marchesini realization R is controllable,
however R is not observable, as
[TABLE]
hence
R
is not minimal. By the Kalman decomposition
(see Theorem
2.15)
argument, we obtain a minimal nc Fornasini–Marchesini realization of
R centred at
Y
of dimension
L=dim(CA,B)−dim(NOC,A∩CA,B)=6, that is
[TABLE]
with
[TABLE]
In this example it is easy to check directly that
[TABLE]
for
X=(X1,X2)∈(C2m×2m)2,
i.e., that
dom2m(R)=DOM2m(R)
and also that
R(X)=R(X).
Furthermore, for any unital stably finite
C−algebra A and
a=(a1,a2)∈A2,
the element
a1a2−a2a1
is invertible in
A
if and only if the matrix
[TABLE]
i.e.,
domA(R)=DOMA(R)
and also
I2⊗RA(a)=RA(I2⊗a).
2.6. Cohn’s theorem
As a corollary of the results in Subsection
2.4, we get a new proof
of a theorem of Cohn, stating that if two nc rational expressions represents the same nc rational function, then they are
A−evaluation equivalent for any unital stably finite
K−algebra
A.
Cohn’s Theorem was proved originally
in
[24]
and afterwards in his book
[25, Theorem 7.3.2].
In
[41],
the authors proved a weaker version
of the theorem, applicable only for nc rational
expressions which are regular at
the origin, using their theory of realizations for nc regular rational functions.
We omit their assumption on regularity at
the origin and prove
the theorem in its full version.
Theorem 2.19** (Cohn’s Theorem).**
Let
R
and
R
be
(Kd)nc−evaluation equivalent nc
rational expressions in
x1,…,xd
over
K,
i.e.,
R(X)=R(X)
for all
X∈dom(R)∩dom(R).
Then R and R
are
A−evaluation equivalent
for any unital stably finite
K−algebra A ,
i.e.,
[TABLE]
Proof.
Assume
R and R
are non-degenerate nc rational expressions, so
there exists
s∈N such that
doms(R),doms(R)=∅.
As
doms(R),doms(R)
are Zariski open sets in
Ks×s,
there exists
ℓ∈N
such that
domsℓ(R)∩domsℓ(R)=∅.
The reasoning for that is clear when
K
is infinite (with
ℓ=1),
while if
K
is finite we use a similar argument as in
[48, Remark 2.6].
Let
[TABLE]
From Corollary
2.18,
R
and
R
admit minimal nc Fornasini–Marchesini realizations
R
and
R, respectively, both centred at
Y
with the special properties:
then
Isℓ⊗a∈DOMA(R)=DOMA(R)
and
Isℓ⊗RA(a)=RA(Isℓ⊗a)=RA(Isℓ⊗a)=Isℓ⊗RA(a),
therefore
RA(a)=RA(a).
∎
Remark 2.20**.**
Theorem
2.19
implies that one can evaluate any nc rational function by evaluating a minimal realization of the function. This proves that
{\mathbb{K}}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}\underline{x}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}}
is the universal skew field of fractions of
K⟨x⟩,
see
[21, 66] for the original proofs and
[48]
for a modern proof.
We postpone a detailed discussion and an application to an explicit
construction of
{\mathbb{K}}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}\underline{x}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}}
to
[64].
2.7. The McMillan degree
For a nc rational expression
R
in
x1,…,xd
over
K
and
Y∈dom(R),
we define by
LR(Y)
the dimension of a minimal nc Fornasini–Marchesini realization of
R
centred at
Y.
The first part of the next theorem is an analog of
[82, Theorem 5.10].
Theorem 2.21**.**
Let
R
be a non-degenerate nc rational expression in
x1,…,xd
over
K
and let
Y∈doms(R).
If
Y∈doms(R),
then
LR(Y)=LR(Y).
2. 2.
If
n∈N,
then
In⊗Y∈domsn(R)
and
LR(In⊗Y)=nLR(Y).
3. 3.
If
s′∈N
and
Y′∈doms′(R),
then
s′LR(Y)=sLR(Y′).
Proof.
Applying Corollary
2.18,
the expression
R
admits a minimal nc Fornasini–Marchesini realization
R centred at Y, described by a tuple
(L,D,C,A,B).
Let
[TABLE]
as
Y=(Y1,…,Yd)∈doms(R)⊆DOMs(R),
the matrix
T1
is invertible. Therefore, for every
X∈DOMsm(R)
and
m∈N:
[TABLE]
where
Ak=Ak⋅T1−1,
and since
[TABLE]
where
Bk=Ak⋅T2,
we conclude that
[TABLE]
i.e., that R(X)=R(X)
where
R
is a nc Fornasini–Marchesini realization of
R,
centred at
Y,
described by
[TABLE]
Thus,
LR(Y)≤L=LR(Y)
and by symmetry we get that
LR(Y)=LR(Y),
hence
R
is a minimal nc Fornasini–Marchesini realization of R centred at
Y.
∙ Suppose next that n∈N.
As
dom(R)
is closed under direct sums it follows that
In⊗Y∈domsn(R),
while for every
p∈N
letting
m=np
yields for every
X∈domsnp(R):
[TABLE]
where
[TABLE]
We obtained a nc Fornasini–Marchesini realization
R(n)—
described by the tuple
(L(n),D(n),C(n),A,B)—
of
R
that is centred at
Y(n):=In⊗Y
and it is easily seen that controllability and observability of
R imply the controllability and observability of
R(n) as well,
thus R(n)
is minimal and hence
LR(In⊗Y)=nLR(Y).
∙ Finally,
let
Y′∈doms′(R),
then part
2
implies that
Is′⊗Y,Is⊗Y′∈domss′(R),
LR(Is′⊗Y)=s′LR(Y)
and
LR(Is⊗Y′)=sLR(Y′),
while from part 1,
LR(Is′⊗Y)=LR(Is⊗Y′),
therefore
s′LR(Y)=sLR(Y′).
∎
Remark 2.22**.**
In the proof of Theorem
2.21
we built explicit minimal nc Fornasini–Marchesini
realizations
R and R(n) of
R,
centred at
Y
and
In⊗Y, respectively,
using a minimal realization
R of
R centred at
Y.
From Corollary
2.18
it follows right away that
R
and
R(n)
are also nc Fornasini–Marchesini realizations of
R
w.r.t any unital stably finite
K−algebra
A.
Moreover, direct computations— which are omitted— easily show that
[TABLE]
and
[TABLE]
The first part of Theorem
2.21
guarantees that the value
LR(Y)
does not depend on
Y
but only on
s,
so it will be denoted
LR(s):=LR(Y),
while from the third part of the theorem it follows that there exists
m(R)>0 such that
[TABLE]
where
m(R)
depends only on
R;
We define
m(R)
as the
McMillan degree of
R.
In the next lemma we actually show that
m(R)∈N.
This is a direct corollary and yet separated from the arguments of Theorem
2.21,
as it requires a non-trivial tool
from PI-ring theory, that is if
R
is a non-degenerate nc rational expression, then there exists
n∈N
such
that
domk(R)=∅
for every
k≥n;
see
[66, Chapter 8] and [49, Remarks 2.15 and 2.16]
for a more detailed discussion.
Lemma 2.23**.**
If
R
is a non-degenerate nc rational expression in
x1,…,xd
over
K
and
doms(R)=∅,
then
s∣LR(s)
and hence
m(R)∈N.
Proof.
As
doms(R)=∅,
let
Y∈doms(R)
and according to Corollary
2.18, let
R
be a minimal nc Fornasini–Marchesini
realization of
R,
centred at
Y.
Since
R
is non-degenerate,
there exists
n∈N
such that
domk(R)=∅
for all
k≥n.
Consider the sequence
(kj)j≥1
given by
kj=sj+1,
clearly for
j
large enough we get
kj≥n
and hence
domkj(R)=∅.
Let
W∈domkj(R)
and apply Theorem
2.21
for
W and Y;
we obtain that
kjLR(Y)=sLR(W),
but it is easily seen that
s
and
kj
are co-prime integers, thus
s∣LR(Y)
and hence
m(R)∈N.
∎
Remark 2.24**.**
If
R
is a nc rational expression in
x1,…,xd
over
K,Y1∈doms1(R)
and
Y2∈doms2(R),
then
Y1⊕Y2∈doms1+s2(R)
and
(2.25)
implies that
[TABLE]
If
R
admits two minimal nc Fornasini–Marchesini realizations
R1
and
R2,
centred at
Y1
and
Y2,
respectively, which are described by the tuples
(L1,D1,C1,A1,B1)
and
(L2,D2,C2,A2,B2),
it is very tempting to consider
R
to be a nc Fornasini–Marchesini realization of
R
centred at
Y1⊕Y2,
where
R
is described by
[TABLE]
but we only know that
R(X)=R(X)
whenever
X∈doms1+s2(R)
is of the form
X=X(1)⊕X(2),
with
X(1)∈doms1(R1)
and
X(2)∈doms2(R2).
3. Realizations of NC Rational Functions
From the previous section (cf. Theorem
2.13)
we know that— given a nc rational function— all of its minimal nc Fornasini–Marchesini realizations which are centred at
the same point, must have the same
domain (and
A−domain) and same evaluation (w.r.t
A as well; here A
is a unital stably finite
K−algebra).
In this section we continue to establish
connections between all minimal nc Fornasini–Marchesini realizations (with centres of all possible sizes)
of a given nc rational function.
Using Lemma
2.21
and Remark
2.22,
the general case— where the two
centres of minimal realizations of a
rational function are different— is
considered and solved, which then will
lead us to the main conclusion, that is Theorem
3.3.
Lemma 3.1**.**
Let
R1
and
R2
be nc rational expressions in
x1,…,xd
over
K,
with
Y1∈doms1(R1)
and
Y2∈doms2(R2), where s1,s2∈N.
Suppose
R1
and
R2
are minimal nc Fornasini–Marchesini realizations of
R1
and
R2, centred at
Y1
and
Y2,
respectively. If
R1
and
R2
are
(Kd)nc−evaluation equivalent, then
[TABLE]
for every
m∈N
and
X∈DOMpm(R1),
where
p=l.c.m(s1,s2).
Moreover, for any unital stably finite
K−algebra
A
and
a∈Ad:
[TABLE]
and for every such
a,
we have
[TABLE]
Proof.
We know that
doms1(R1),doms2(R2)=∅,
hence
domp(R1),domp(R2)=∅
and as they are both open Zariski sets in
(Kp×p)d,
there exists
ℓ∈N
such that
domℓp(R1)∩domℓp(R2)=∅,
so let us fix
[TABLE]
Once again (as in the proof of Theorem 2.19), the reasoning for that is clear when K
is infinite (with ℓ=1), while if K
is finite we use a similar argument as in
[48, Remark 2.6].
∙ Let
n1
and
n2
be the integers for which
pℓ=s1n1=s2n2.
From Remark
2.22,
there exist minimal nc Fornasini–Marchesini realizations
R(nk)
of
Rk,
centred at
Ink⊗Yk,
such that
[TABLE]
for every m\in{\mathbb{N}},\,\underline{\mathfrak{A}}\in DOM^{{\mathcal{A}}}({\mathcal{R}}_{k})\iff I_{n_{k}}\otimes\underline{\mathfrak{A}}\in DOM^{{\mathcal{A}}}\big{(}{\mathcal{R}}^{(n_{k})}\big{)}
and
[TABLE]
for k=1,2.
In addition, there exist minimal nc Fornasini–Marchesini realizations
Rk
of
Rk,
centred at
Y,
such that
[TABLE]
for every
m\in{\mathbb{N}},\,DOM^{{\mathcal{A}}}\big{(}{\mathcal{R}}^{(n_{k})}\big{)}=DOM^{{\mathcal{A}}}\big{(}\widetilde{{\mathcal{R}}_{k}}\big{)} and
[TABLE]
for
k=1,2.
Therefore
R1
and
R2
are minimal nc Fornasini–Marchesini
realizations, both centred at
Y,
of
R1
and
R2—
which are
(Kd)nc−evaluation equivalent—
hence Theorem
2.13
implies
[TABLE]
for every m∈N and
[TABLE]
which yield that
[TABLE]
for every
m∈N
and
[TABLE]
It is easily seen that
X∈DOMpm(Rk)⟺Iℓ⊗X∈DOMpℓm(Rk)
and in that case
Rk(Iℓ⊗X)=Iℓ⊗Rk(X),
where k=1
or
k=2 and thus, from
(3.2)
and
(3.3)
one can get
(3.1).
∙ Moreover,
[TABLE]
implies that for every
a∈Ad,
[TABLE]
and for every such
a:
[TABLE]
which then, as s1n1=s2n2, implies
Is2⊗R1A(Is1⊗a)=Is1⊗R2A(Is2⊗a).
∎
Remark 3.2**.**
If
R1
and
R2
are
(Kd)nc−evaluation equivalent nc (non-degenerate) rational expressions in
x1,…,xd
over
K,
as explained in the beginning of
the proof, there exists
Y∈domℓp(R1)∩domℓp(R2)
for some
ℓ∈N,
thus Theorem
2.13 implies that
LR1(ℓp)=LR2(ℓp)
and hence
[TABLE]
Therefore, we define the
McMillan degree of a nc rational functionR
to be
m(R):=m(R)
for every
R∈R.
Recall that a nc rational function
R
is an equivalence class of the form
[TABLE]
whose elements are
(Kd)nc−evaluation equivalent nc rational expressions in
x1,…,xd over
K, whereas the
domain and A−domain of regularity of
R
are given by
[TABLE]
respectively.
We now use Corollary
2.18
and Lemma
3.1,
to show that the domain of regularity of
a nc rational function
R
at the level of
n×n
matrices, i.e.,
[TABLE]
lives inside the domain of any minimal nc
Fornasini–Marchesini realization of a representative in
R,
up to a tensor product with the identity matrix.
Theorem 3.3**.**
Let
{\mathfrak{R}}\in{\mathbb{K}}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr(\cr<\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr(\cr<\crcr}}}x_{1},\ldots,x_{d}\mathchoice{\leavevmode\vtop{
\halign{\hfil\displaystyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\textstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptstyle#\hfil\cr)\cr>\crcr}}}{\leavevmode\vtop{
\halign{\hfil\scriptscriptstyle#\hfil\cr)\cr>\crcr}}}
be a nc rational function. For every
nc rational expression
R∈R,
integer
s∈N,
point
Y∈doms(R),
minimal nc Fornasini–Marchesini realization
R
centred at
Y
of
R,
and unital stably finite
K−algebra
A,
we have the following properties:
If
Z∈domn(R),
then
Is⊗Z∈DOMsn(R)
and
Is⊗R(Z)=R(Is⊗Z).
2.
If
s∣n,
then
domn(R)⊆DOMn(R)
and
R(Z)=R(Z) for every
Z∈domn(R).
3.
If
a∈domA(R),
then
Is⊗a∈DOMA(R)
and
Is⊗RA(a)=RA(Is⊗a).
Proof.
Let
Z∈domn(R),
so there exists a nc rational expression
R∈R
such that
Z∈domn(R),
while
Corollary
2.18
implies the existence of a minimal nc Fornasini–Marchesini realization
R
of
R,
centred at
Z.
Then
R
and
R
are minimal nc Fornasini–Marchesini realizations of
R
and
R,
with centres in
(Ks×s)d
and
(Kn×n)d,
respectively.
Since
R,R∈R,
it follows that
R
and
R
are
(Kd)nc−evaluation equivalent, therefore Lemma
3.1
guarantees that
[TABLE]
for every
m∈N,
where
p=l.c.m(s,n).
Thus,
p∣sn
implies that
[TABLE]
and hence
[TABLE]
which ends the proof of part
1.
∙ Suppose next that
s∣n;
in that case we have
p=l.c.m(s,n)=n.
Thus, in view of
(3.4)
with
m=1,
if
\underline{Z}\in dom_{n}\big{(}\widetilde{R}\big{)},
then
[TABLE]
which ends the proof of part
2.
∙
Finally, let
a∈domA(R),
then there exists a non-degenerate nc rational expression
R∈R
such that
\underline{\mathfrak{a}}\in dom^{{\mathcal{A}}}\big{(}\widehat{R}\big{)}. As
R
is non-degenerate, there exists
t∈N
such that
dom_{t}\big{(}\widehat{R}\big{)}\neq\emptyset.
Let
Y∈domt(R)
and apply Corollary
2.18: so there exists
a minimal realization
R
of
R, centred at
Y,
such that
[TABLE]
As
R
and
R
are minimal nc Fornasini–Marchesini realizations of
R∈R
and
R∈R,
respectively,
Lemma
3.1
guarantees that
[TABLE]
and also that
[TABLE]
thus
RA(Is⊗a)=Is⊗RA(a)=Is⊗RA(a).
∎
What we proved is that
[TABLE]
however in the case where
s=1 and
Y=(0,…,0),
the nc Fornasini-Marchesini realization
R
is actually a
1×1
matrix valued nc rational expression
(not a priori possible
if
s>1);
by viewing
R
as a
1×1
matrix valued nc rational function (cf. Remark
4.1),
it follows that the nc Fornasini–Marchesini realization
R
is a representative of
R
and therefore
[TABLE]
In other words, by applying Theorem
3.3
we actually obtain a proof for Theorem
1 from the introduction which—
unlike the
original proof in
[49]—
does not make any use of the difference-differential calculus of nc functions.
Corollary 3.4**.**
If
R
is a nc rational function of
x1,…,xd
over
K
and
R
is regular at
0,
then
R
admits a unique
(up to unique similarity) minimal
(observable and controllable) nc Fornasini–Marchesini realization
[TABLE]
where
A1,…,Ad∈KL×L,B1,…,Bd∈KL×1,C∈K1×L,D=R(0)
and
L∈N,
[TABLE]
for every
m∈N and
[TABLE]
for every
(X1,…,Xd)∈domm(R).
4. Realizations of Matrix Valued NC Rational Functions
All of the analysis and results up to now can be generalized to the settings
of matrix valued nc rational functions. In this section we describe the relevant definitions and main results in the matrix valued case.
If
α,β∈N,
we say that
r
is a
α×βmatrix valued nc rational function if
r
is a
α×β
matrix of nc rational functions, i.e., if
[TABLE]
where
Rij are nc rational functions.
The domain of regularity of
r
is then defined by
[TABLE]
and for every
X∈domn(r)
the evaluation
r(X)
is given by
[TABLE]
where
E(ℓ1,ℓ2)∈Kℓ1ℓ2×ℓ1ℓ2
defined in
(1.1).
The need for the correction terms, which are shuffle matrices, is coming simply because otherwise evaluating
r
term by term does not yield a nc function (it does not preserve direct sums), see e.g.
[48, pp. 17–18].
If
A
is a unital K−algebra, then the A−domain of
r
is defined by
[TABLE]
and for every
a∈domA(r)
the evaluation rA(a)
is given by
[TABLE]
Remark 4.1**.**
In
[49]
the authors define matrix valued nc rational functions and their domains of regularity using equivalence classes of matrix valued nc rational expressions.
However, it follows from
[81, Lemma 3.9]
that one can also define matrix valued nc rational functions
as a matrix of nc rational functions, and the domains of regularity in both cases are equal.
Theorem 4.2**.**
For every
α×β
matrix valued nc rational function
[TABLE]
there exist unique (up to unique similarity)
L∈N,
D∈Kαs×βs,C∈Kαs×L,
linear mappings
A1,…,Ad:Ks×s→KL×L
and
B1,…,Bd:Ks×s→KL×βs
such that
(A,B)
is controllable and
(C,A)
is observable,
for which
[TABLE]
for every m∈N
and
r(X)=R(X)
for every
X∈domsm(r),
where
[TABLE]
Moreover,
[TABLE]
for every
n∈N
and
Is⊗r(X)=R(Is⊗X)
for every
X∈domn(r).
Furthermore,
for any unital stably finite
K−algebra A:
[TABLE]
and
Is⊗rA(a)=RA(Is⊗a)
for every
a∈domA(r), i.e.,
[TABLE]
Similarity of nc Fornasini–Marchesini realizations of matrix valued nc rational functions is defined analogously to the case of (scalar) nc rational functions (cf. Theorem
2.13),
as well as controllability and observability, which are defined via the controllability and un-observability subspaces of
KL (cf. Definition 2.7 and notice
that the only difference is that the operators
Aω⋅Bk and
C⋅Aω
return matrices in
KL×βs and
Kαs×L, respectively).
Proof.
Suppose
r=[Rij]1≤i≤α,1≤j≤β
is a
α×β
matrix valued nc rational function and let
Y∈doms(r).
For every
1≤i≤α and
1≤j≤β we have Y∈doms(Rij),
while
applying Theorem
3.3,
the nc rational function
Rij
admits a minimal nc Fornasini–Marchesini realization
Rij
centred at
Y,
described by a tuple
(Lij,Dij,Cij,Aij,Bij),
which is also a realization of
Rij
w.r.t
A.
∙ Let
X∈domsm(r),
then
X∈domsm(Rij)
and hence
X∈DOMsm(Rij)
and
Rij(X)=R(X)
for any
1≤i≤α
and
1≤j≤β.
Therefore
[TABLE]
where the nc Fornasini–Marchesini realization
R
is described by
[TABLE]
with the linear mappings
[TABLE]
It is easily seen, by the diagonal structure of
Ak, that
[TABLE]
∙
Moreover,
if
X∈domn(r),
then
Is⊗X∈domsn(r)
and r(Is⊗X)=Is⊗r(X),
while by the first part of the theorem we know that
Is⊗X∈domsn(R)
and
[TABLE]
∙ Furthermore, let
a∈domA(r),
thus
a∈domA(Rij)
and therefore
Is⊗a∈DOMA(Rij)
and
RijA(Is⊗a)=Is⊗RijA(a),
for every
1≤i≤α and
1≤j≤β.
A direct and careful computation— which is omitted— shows that
[TABLE]
∙
This proves the existence of a nc Fornasini–Marchesini realization for
r,
centred at
Y,
that is also a realization of
r
w.r.t
A.
To obtain a minimal nc Fornasini–Marchesini realization, we use the Kalman decomposition same as in Lemma
2.13, corresponding to the
controllability and un-observability subspaces of
KL, whereas
the uniqueness (up to unique similarity) of such a minimal realization is proved with the same ingredients as in the proof of Theorem
2.13. The details of the proofs of the Kalman decomposition and the uniqueness are omitted.
∎
Remark 4.3**.**
It is not hard to see that the nc Fornasini–Marchesini realization built in the proof is not necessarily minimal, even if
Rij
are all minimal nc Fornasini–Marchesini realizations. However, the opposite is true, i.e., if
R
is a minimal nc Fornasini–Marchesini realization, then all of the nc Fornasini–Marchesini realizations
Rij
must be minimal as well.
Remark 4.4**.**
(cf. Remark
4.1)
The proof of the existence part in Theorem
4.2 can be done using matrix valued nc rational expressions and the usual process of synthesis, yielding
(4.2)
for the a priori bigger domain of
r,
which uses matrix valued nc rational expressions and once again by
[81, Lemma 3.9]
is equal to the domain in the sense of
(4.1).
Remark 4.5** (McMillan degree of a matrix valued nc rational function).**
One can prove analogous versions of Theorem
2.21
and Remark
3.2,
for matrix valued nc rational expressions and functions, thereby there exists an integer m(r)
such that for any
Y∈doms(r),
we have
[TABLE]
here
Lr(Y)
is the dimension of a minimal nc Fornasini–Marchesini realization of r, centred at
Y.
We call
m(r)
the
McMillan degree of r.
It follows from Theorem
4.2 that
[TABLE]
5. Realizations of Hermitian NC Rational Functions
In the case where
K=R or
K=C,
one often considers symmetric or hermitian nc rational expressions,
specially with applications to free probability
[16, 41, 75]
and in optimization theory
[5, 40, 42, 43].
Unlike the case of descriptor realizations (see
[41, 47]),
the expression for
RFM(X∗)∗
does not have the form of a nc Fornasini–Marchesini realization, for a nc Fornasini–Marchesini realization RFM. Nevertheless, we can use our methods to obtain an analogue of Corollary
2.18
in the case where the function
R
is hermitian, i.e., when
[TABLE]
with the matrix pencil to be inverted having
hermitian coefficients.
We also get explicit (necessary and sufficient)
conditions on the coefficients of the
realization for the nc rational function to be hermitian.
Remark 5.1**.**
One can define hermitian nc rational
functions more precisely. First,
one needs to define— using synthesis— a nc
rational expression
R∗,
for any nc rational expression
R. Then, one can
show that
R1∗∼R2∗,
whenever
R1∼R2
(i.e., whenever
R1
and
R2
are
(Kd)nc−evaluation equivalent).
Finally, for every nc rational function
R,
let
R∗={R∗:R∈R}
and define
R
to be hermitian if
R∗=R,
as equivalence classes.
We use the following notions: if
T
is a linear mapping on matrices, then
T∗
is the linear mapping given by
T∗(X):=T(X∗)∗ and
T is called hermitian if
T∗=T.
If
J
is a square matrix
of the form
[TABLE]
then we say that
J
is a semi-signature matrix; notice that if
t=0, then
J
is a signature matrix.
Theorem 5.2**.**
Let
R
be an hermitian nc rational function
of
x1,…,xd
over
K,
Y∗=Y∈doms(R)
and
[TABLE]
be a minimal nc Fornasini–Marchesini
realization
of R,
centred at
Y.
There exists a unique
S=S∗∈KL×L
such that
[TABLE]
2. 2.
Once the relations in
(5.1)
hold, we have
[TABLE]
and
[TABLE]
3. 3.
Symmetry of the minimal nc Fornasini–Marchesini realization:*
There exist
Cˇ∈Ks×L,
a semi-signature matrix
J∈KL×L
and hermitian linear mappings
A1ˇ,…,Adˇ:Ks×s→KL×L,
such that*
[TABLE]
with
(Aˇ⋅J,Aˇ⋅Cˇ∗)
controllable and
(Cˇ,Aˇ⋅J)
observable.
Conversely, if
R
admits a realization of the form
(5.3) with the controllability and observability conditions, then R is an hermitian nc rational function.
4. 4.
Hermitian nc descriptor realization:*
There exist
DD=DD∗∈Ks×s,CD∈Ks×(L+s),
a signature matrix
JD∈K(L+s)×(L+s)
and hermitian linear mappings
A1,D,…,Ad,D:Ks×s→K(L+s)×(L+s),
such that*
[TABLE]
and
[TABLE]
*Moreover, similarly to Theorem
3.3, this also applies— after a suitable tensoring—
to domains and evaluations on
n×n
matrices for all
n∈N
and w.r.t any unital stably finite
*K−algebra
A.
5. 5.
The matrix S is invertible
⟺⋂1≤k≤d,X∈Ks×sker(Ak(X))={0}⟺ there exists
Q∈KL×s such that
[TABLE]
In that case,
J∈KL×L
is invertible,
[TABLE]
and
[TABLE]
where
Ak=JAkˇJ
and
D=D−CˇJCˇ∗.
Proof.
The proof of the first part of the theorem follows the same ideas as the proof of Theorem
2.13.
As
R∗=R we obtain that
RFM∗=RFM
and then compare the coefficients in
the Taylor–Taylor power series expansions
[TABLE]
and
[TABLE]
we obtain that
Rν(Z1,…,Zℓ)=Rν,∗(Z1,…,Zℓ)
for every
ν=gi1…giℓ∈Gd
and
Z1,…,Zℓ∈Ks×s, where
[TABLE]
and
[TABLE]
For
ν=∅ we get that
D=D∗.
Next, define a linear mapping
[TABLE]
for every
ω∈Gd
of length
k≥0,1≤j≤d,W1,…,Wk,Zj∈Ks×s
and
u∈Ks,
then we extend
S
by linearity.
∙ It is easily seen, from the controllability of
(A,B)
that
S:KL→KL
is well defined:
suppose
[TABLE]
for
ωl,ηt∈Gd,W=(W1(l),…,Wkl(l))∈(Ks×s)kl,Q=(Q1(t),…,Qmt(t))∈(Ks×s)mt,Zl,Pt∈Ks×s,1≤jl,it≤d
and
ul,vt∈Ks
for every
l∈IL
and
t∈IT.
Thus for every
1≤n≤d,α∈Gd,X∈Ks×s
and
X=(X1,…,X∣α∣)∈(Ks×s)∣α∣:
[TABLE]
which implies that
[TABLE]
whereas the controllability of
(A,B)
implies that
S(w1)=S(w2).
∙ Let
S∈KL×L be the matrix such that
S(u)=Su for every u∈KL.
We show that
S
is self-adjoint:
for every
u,v∈KL we use the controllability of
(A,B) to write them as
[TABLE]
thus, using the notation
\underline{Q}^{\#}:=\big{(}Q_{m_{t}}^{(t)},\ldots,Q_{1}^{(t)}\big{)},
and for every
\underline{w}_{1}=\sum_{l\in I_{L}}\underline{\mathbf{A}}^{\omega_{l}}\big{(}\underline{W}\big{)}\mathbf{B}_{j_{l}}(Z_{l})\underline{u}_{l}\in{\mathbb{K}}^{L}:
[TABLE]
Once again, from the controllability of
(A,B)
we have
[TABLE]
∙
It is easily seen that every self-adjoint matrix S
which satisfies the relations in
(5.1),
must satisfies
(5.8) too. This implies the uniqueness of the matrix
S.
∙ Let
v∈ker(S), thus
(5.10)
implies that
u:=Ak(Z)v∈ker(S)
while
(5.9)
implies that
u∈ker(C). So
u∈ker(S) implies that
Aω(X1,…,X∣ω∣)u∈ker(C),
but
(C,A)
is observable, hence
u=0
and
v∈kerAk(Z)
for all
1≤k≤d
and
Z∈Ks×s.
∙ On the other hand, if
Ak(Z)v=0
for all
1≤k≤d
and
Z∈Ks×s,
then
Ak∗(Z)Sv=0
and also
Bk(Z)Sv=0,
whereas the controllability of
(A,B)
implies that
Sv=0.
∙
If
Bk(Z)v=0
for all
1≤k≤d
and
Z∈Ks×s,
then
Ak∗(Z)C∗v=0
and also
Bk∗(Z)C∗v=0,
which implies that
C∗v=0.
∙
On the other hand, if
v∈ker(C∗),
then
Bk(Z)v∈ker(C)
and
SBk(Z)v=0,
i.e.,
Bk(Z)v∈ker(S).
As
S
is normal it implies that also
Bk(Z)v∈ker(S)
and thus
Bk(Z)v∈ker(Aj(Z))
for every
1≤j≤d
and
Z∈Ks×s,
thus
Bk(Z)v=0.
The matrix
[SC]
is left invertible, as if
u∈ker[SC],
then
u∈kerC and
[TABLE]
which implies
u=0,
since
(C,A)
is observable.
∙ Let
K∈KL×(L+s)
be a left inverse of
[SC]
and
Ak:=K⋅[Ak∗Bk∗],
thus
[TABLE]
and
[TABLE]
which implies that
Ak=Ak∗.
Moreover,
Ak
is independent of the choice of the left inverse
K:
if
K′
is another left inverse of
[SC],
then
[TABLE]
and the right invertibility of
[SC∗]
implies that
K⋅[Ak∗Bk∗]=K′⋅[Ak∗Bk∗]. Notice that from the controllability of
(A,B)
we get
[TABLE]
∙ Next, as
S=S∗,
one can write
S=TJT∗,
where
T∈KL×L
is invertible and
J∈KL×L
is a semi-signature matrix. Thus, using
the relations in
(5.11), we obtain
[TABLE]
where
Cˇ=C(T∗)−1
and
Akˇ=T∗⋅Ak⋅T
are hermitian, for
1≤k≤d.
Moreover, it is easily seen that the
controllability of
(A,B)
and the observability of
(C,A)
imply
the controllability of
(Aˇ⋅J,Aˇ⋅Cˇ∗)
and
the observability of
(Cˇ,Aˇ⋅J),
respectively.
Define
E:=F+CˇJCˇ∗.
The matrix
[TABLE]
is hermitian and invertible, whenever
F≻0
or
F≺0:
it is easily seen that
S∗=S;
let
[uv]∈ker(S),
thus
Ju+Cˇ∗v=0
and
Cˇu+Ev=0,
therefore
Cˇ∗v=−Ju and when we plug it in to the other equation we get
Fv=Cˇ(J2−IL)u.
Thus,
−Ju=Cˇ∗F−1Cˇ(J2−IL)u
and multiplying both sides by
u∗(J2−IL)
on the left, to get
[TABLE]
Then
v=Cˇ(J2−IL)u=0,
which implies that
Ju=0
and
Cˇu=0,
i.e., that
[JCˇ]u=0.
Recall that
[SC]=[TJT∗CˇT∗]=[T00Is][JCˇ]T∗
is left invertible and hence
[JCˇ]
is left invertible and hence
u=0.
∙ As
S
is hermitian and invertible, there exist an invertible matrix
T∈K(L+s)×(L+s)
and a signature matrix
JD∈K(L+s)×(L+s) such that
S−1=TJDT∗, therefore
[TABLE]
for every
X∈DOMs(RFM),
where
[TABLE]
for every
1≤k≤d.
We showed that
RFM(X)=RD(X)
and it is easily seen from
the last computation that
[TABLE]
i.e., that
DOMs(RD)=DOMs(RFM).
∙ Furthermore, straight forward computations
show that
for every
m≥1:
[TABLE]
i.e., that
DOMsm(RFM)=DOMsm(RD) and also that
RFM(X)=RD(X),
as well as that
DOMA(RFM)=DOMA(RD)
for any unital stably finite
K−algebra A, i.e., for every
A∈(As×s)d:
[TABLE]
and for such A
we have RFMA(A)=RDA(A).
If
S
is invertible, then
Bk∗⋅S=C⋅Ak
implies that
Bk=S−1⋅Ak∗⋅C∗=Ak⋅S−1C∗
so we can choose
Q=S−1C∗ to get
(5.5).
∙ On the other hand, suppose there exists
Q∈KL×s
such that
Bk=Ak⋅Q
for all
1≤k≤d.
Thus,
C⋅Ak=Bk∗⋅S=Q∗⋅Ak∗⋅S=Q∗S⋅Ak
and also
C⋅Bk=C⋅Ak⋅Q=Q∗S⋅Ak⋅Q=Q∗S⋅Bk,
but the controllability of
(A,B)
implies that
C=Q∗S.
Therefore, ker(S)⊆ker(C)
but as
[TABLE]
it follows from the observability of
(C,A)
that
ker(S)={0},
i.e., that
S
is invertible.
∙
If
S
is invertible, then
J is invertible and the realization
(5.6)
is obtained from the realization
(5.3)
immediately.
If
R is an hermitian nc rational function, there exists Y∈dom(R) such that Y∗=Y;
for a proof see
[82, pp. 28–29].
Remark 5.4**.**
We leave it to a future work, to describe connections between properties of the (semi-)signature matrices,
J and
JD, appear in Theorem
5.2
and properties of the function
R, such as perhaps (matrix) convexity (cf.
[43]).
Remark 5.5**.**
We say that a nc rational function
R
admits a
descriptor realization
[TABLE]
centred at
Y∈(Ks×s)d, if domsm(R)⊆DOMsm(RD)
and
R(X)=RD(X)
for every
X∈domsm(R),
cf. Definition
2.3.
We present some relations between Fornasini–Marchesini realizations and descriptor realizations (not necessarily in the symmetric case), without precise definitions of
controllability and observability, as well as the McMillan degree
(denoted by Degs,D(R)), of descriptor realization:
∙* If
R
admits a descriptor realization centred at
Y, described by
(LD,CD,AD,BD),
then it admits a
nc Fornasini–Marchesini realization described by*
[TABLE]
for
1≤k≤d,
RD
is observable if and only if
RFM
is observable, and if
RFM
is controllable then
RD
is controllable.
Therefore we have the relation
[TABLE]
∙*
If
R
admits a nc
Fornasini–Marchesini realization centred at
Y∈(Ks×s)d,
described by
(LFM,DFM,CFM,AFM,BFM),
then
R
admits a descriptor realization described by*
[TABLE]
for
1≤k≤d,
RFM
is controllable if and only if
RD
is controllable, and if
RD
is observable then RFM
is observable. Therefore we have the relation
whereas an analogue of Lemma
2.23
for descriptor realizations guarantees that
s∣Degs,D(R),
then which then imply that
[TABLE]
Bibliography82
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] J. Agler and J. E. Mc Carthy. Global holomorphic functions in several non-commuting variables. Canadian Journal of Mathematics 67(2): pp. 241–285, 2015 .
2[2] J. Agler and J. E. Mc Carthy. Pick interpolation for free holomorphic functions. American Journal of Mathematics 137(6): pp. 1685–1701, 2015 .
3[3] J. Agler and J. E. Mc Carthy. Aspects of non-commutative function theory. Concrete Operators 3(1): pp. 15–24, 2016 .
4[4] D. Alpay and D. S. Kaliuzhnyi-Verbovetskyi. On the intersection of null spaces for matrix substitutions in a non-commutative rational formal power series. Comptes Rendus Mathematique 339(8): pp. 533–538, 2004 .
5[5] D. Alpay and D. S. Kaliuzhnyi-Verbovetzkyi. Matrix J 𝐽 J -unitary noncommutative rational formal power series. The state space method generalizations and applications , vol. 161 of Operator Theory: Advances and Applications , Birkhäuser–Verlag, Basel, pp. 49–113, 2005 .
6[6] S. A. Amitsur. Rational identities and applications to algebra and geometry. Journal of Algebra 3(3): pp. 304–359, 1966 .
7[7] J. A. Ball and N. Cohen. De Branges–Rovnyak operator models and systems theory: a survey. Topics in Matrix and Operator Theory , vol. 50 of Operator Theory: Advances and Applications , Birkhäuser–Verlag, Boston, pp. 93–136, 1991 .
8[8] J. A. Ball, G. Groenewald and T. Malakorn. Structured noncommutative multidimensional linear systems. SIAM journal on control and optimization 44(4): pp. 1474–1528, 2005 .