J
OURNAL DE
T
HÉORIE DES
N
OMBRES DE
B
ORDEAUX
R
ACHED
M
NEIMNÉ
F
RÉDÉRIC
T
ESTARD
On products of singular elements
Journal de Théorie des Nombres de Bordeaux, tome
3, n
o2 (1991),
p. 337-350
<http://www.numdam.org/item?id=JTNB_1991__3_2_337_0>
© Université Bordeaux 1, 1991, tous droits réservés.
L’accès aux archives de la revue « Journal de Théorie des Nombres de Bordeaux » (http://jtnb.cedram.org/) implique l’accord avec les condi-tions générales d’utilisation (http://www.numdam.org/conditions). Toute uti-lisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit conte-nir la présente mention de copyright.
Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques
On
products
of
singular
elements
by
RACHEDMNEIMNÉ
ANDFRÉDÉRIC
TESTARDSome
rings,
like thering
M(n, h’)
of squarematrices,
do not containirreducible elements: any
singular
element x can be written as theproduct
x = yz of twosingular
elements y and z. We shall call theserings S-rings.
Our first purpose in this paper is to exhibit someexamples
ofS-rings.
Forinstance,
wegive
a necessary and sufficient conditionensuring
thatZ/nZ
is an
S-ring.
More
generally,
let us denoteby
(or
just
if no confusion ispossible)
the set of elements of aring
R,
which can be written as theproduct
of i
singular
elements;
the sequence(5’t)
isdecreasing
(we
only
considerrings
where leftinvertibility
isequivalent
toright
invertibility)
and moreover thering
R is anS-ring
if andonly
if_ ,5’2 .
We denoteby
the intersection of all the when the sequence(S;)
isstationnary
(S’~
=,S’k
wheneveri >
1~),
we have =,S’k
if k is the first index i such that =S;+i .
Thereis a natural
operation
of the groupGL(R)
of all invertible elements of thering R
on the setS;
definedby:
(g, x)
H gxfor 9
EGL(R)
and x E where gx is theproduct
in R of the twoelements g
and x. This definesclearly
anoperation
ofGL(R)
on,5’;,
hence also onSo+1
(elements
of which do notbelong
to Other naturaloperations
could have beenconsidered:
(g, x)
Hxg-l
or(g, x)
Hgxg-l
or thefollowing
operation
ofGL(R)
xGL(R)
onSi
given by
((gl,g2),X)
~ When thering
Ris
commutative,
theseoperations bring
nothing
new. This is the case ofthe
ring
K[A]
ofpolynomial expansions
of the matrix A EM(n, h’)
for which wedispose
of aparticularly
nicedescription
of the orbits ofGL(A)
(=
3).
In
part
2,
westudy
in anelementary
way thering
K[A]
by
giving
anecessary and sufficient condition in order that the matrix A could be
written as
P(A)Q(A),
where Pand Q
arepolynomials,
withP(A)
andQ(A)
twosingular
matrices(i.e.
A E5*2(~[~4])).
Part 4 is devoted to the solution of the
following
non trivialproblem:
given
any matrixA,
what is the maximal numbern(A)
ofsingular
andpermutable
matricesAi
such that A =Ay ~ ~ ~ A~" ?
Asimple
observationallows us to answer the same
problem,
for A andAi
bistochastic.1.
Examples
ofS-rings
We
begin
with an easy criterionLEMMA 1. Let E and F be two
rings
and E x F be theirproduct ring;
then E x F is anS-ring
if andonly
E and F areS-rings.
Inparticular,
any finite
product
of fields is an,5’-rlng.
Proof
Consider asingular
element(x, y)
in E x F. Forinstance, x
is not invertible. We can find Xl and x2 twosingular
elements in E sothat x = then
(.c,2/) =
y).( X2, 1)
is theproduct
of twosingular
elements of E x F.
Conversely,
suppose that E x F is anS-ring
and takex, any
singular
element in E. There exist twosingular couples
and(X2, Y2)
so that(x, 1) _
Yl )’(X2’ Y2).
Since Yl’Y2 =1,
x, and X2 are
not
invertible,
and E is anS-ring;
the sameargument
works for F.LEMMA 2. Let p be a
prime
and a be apositive integer.
Thering
R =7l/po71
is anS-ring
if andonly
if a = 1.Proof
If a =1,
thering R
is a field and there is noproblem;
otherwisethe class
of p
cannot be theproduct
of twosingular
classes since it wouldimply
p -p2 ~ -
cp"
where k and c areintegers,
which isimpossible
ifa > 2.
PROPOSITION 1.
Z/nZ;
thering
R is anS-ring
if andonly
if n = pi ... pk where the p; are distinctprimes.
r
roof
If n = 1 the areisomorphic.
k
The conclusion follows
easily
from leinmas 1 and 2.PROPOSITION 2. Let X be a
topological
space and R =C(X,R)
be thering
of all continuousmappings
from X to R. Then R is an,5‘-ring.
Proof
The functionf
issingular
if andonly
if it vanishes at somepoint
of X . When ithappens,
the same is true for the two continuousmappings
11
=f’1’
andf2
=f2/’
andf
=PROPOSITION 3. Let R be the
ring
of all germs of C"- real functions on aProof
Let us recall that a germ is anequivalence
class withrespect
tothe relation:
neighbourhood
of zero. An elementf
of R issingular
if andonly
iff (0)
= 0 and astraightforward
application
of Leibniz’s derivation rule shows that if
f
=fi ... fi
is theproduct
of isingular elements,
the functionf
and its i - 1 first derivatives vanish at 0.Conversely,
if this istrue,
Taylor’s
formulagives,
for x smallenough:
(tx)dt
and the conclusion follows.Remark 1: This result
provides
anexemple
of aring
where the sequenceSi
is notstationnary
and does not"converge"
to 0. Indeed the well knownC°°-function
f (x~
= wheneverx 0
0,
clearly
belongs
to allthe
,S‘$
withoutbeing
0. Theexplanation
lies in the fact that thering R
ofgerms of Coo functions which is a local
ring
is anideal,
hence.the
unique
maximal
ideal)
is not noetherian:indeed,
in a local noetherianring,
theintersectionn si
isequal
to10}
as it resultstrivially
from Krull’s theorem(see
e.g.Atiyah-Macdonald:
Introduction to CommutativeAlgebra
p.110
-Addison-Wesley
1969).
PROPOSITION 4. Let 7~ be a field and R =
M(n, K)
be thering
of squarematrices n x rl with coeflicients in Ii . Then R is an
S-ring.
Proof
Let A E R be asingular
matrix and r n be the rank of A. Weknow that A is
equivalent
q to the matrixJr
’= Ir 0
whereI
denotes 00-the
identity
matrix of order r, i.e. there exist two invertible matrices P andQ
such that A =PJrQ.
SinceJr
=Jr,
weget
A = XY where X =PJr
and Y =
JQ
aresingular
matrices.COROLLARY 1. The
ring
of bistochastic matrices of order n is an,S‘-ring.
Proof
Recall that amatrix
M =(a;,j)
is bistochastic if there exists din K such that
Vi,
= d andVj, Li aij
= d. It is easy to provethat M is bistochastic if and
only
ifM(H)
C H
andM(D)
C D where Hdenotes the
hyperplane
of 7~"equipped
with its canonical basisle,
... ,of
equation
~~
z; = 0 and D is the one dimensionalsubspace
generated
by
Hence,
there exists an invertible matrixP,
independent
ofM,
satisfying
M = PA
§ )
where A is an element ofM ( n - 1 . )
0
A "
This defines an
isomorphism
between thering
of bistochastic matrices and2.
Singular
polynomial decompositions
of matricesFrom now on, A will denote a square
matrix,
P andQ
will be polyno-mials.PROPOSITION 5. The
singular
matrix A can be written asP(A)Q(A),
where
P(A)
andQ(A)
aresingular
if andonly
if 0 is asimple
root ofthe minimal
polynomial
of A.Proof
Let us recall that the minimalpolynomial
of A is theunitary
generator
7r of the ideal of allpolynomials
which vanish at A. The roots of7r in the field K are the
eigenvalues
of A in K. Inparticular,
0 is a root of7r since A is
singular.
The sufficient condition is easy to prove: one can
write,
0 =~r(A) _
aA +AQ(A)
withA #
0,
Q
being
apolynomial vanishing
at0;
so thatA =
(-A/A)Q(A)
and the conclusionfollows,
sinceQ(A)
issingular
(Q(A)
admits
Q(0)
= 0 as aneigenvalue).
Conversely,
if A =P(A)Q(A),
theminimal
polynomial
of A divides thepolynomial
X -P(X)Q(X):
it isenough
to prove that 0 is asimple
root of X -P(X)Q(X).
Let us firstremark that the
equality
A =P(A)Q(A)
remains true for any matrix Bsimilar to
A,
sothat, considering
an uppertriangular
matrix B similar toA,
(we
could need to extend theground
field)
weget Ai
=P(A;)Q(A;)
for anyeigenvalue
A.
of A thisimplies
that if0,
0 and0,
so
necessarily,
sinceP(A)
andQ(A)
aresingular,
P(0) _
= 0 and therequired
conclusion followseasily.
Remark 2: An
equivalent
way to characterize such matrices is thefol-lowing :
0 is asimple
root of the minimalpolynomial
if andonly
if ker(A~ _
Remark 3: Let R be thering
it results from theproof
ofproposition
5 that if A ES2,
then A E(once
we have written A =(-A/A)Q(A),
we obtain A = and so
on).
We will understand thesituation much better in the
following
section(see
Remark8).
COROLLARY 2. For A =
BI,
there existpolynomials
P andQ
so thatA =
P(A)Q(A)
withP(A)
andQ(A)
singular
matrices if andonly
if 0 is a root of the minimalpolynomial
of B of order k.Proof
This is an easy consequence of the factalready
noticed in remark2,
that the order of 0 in the minimalpolynomial
of a matrix M is the firststep
where theincreasing
sequenceker(M’)
becomesstationnary:
we have3. The
ring
K[A]
for itselfIn this section it will be assumed that the field ~ is
algebraically
closed,
although
most results can be stated in a moregeneral
context;
let us recallthat the
ring R
=K[A]
I~ ~X J ~
isisomorphic
to thequotient
ring
where(7r)
denotes theprincipal
idealgenerated
by
the minimalpolynomial
of A.Writing
7r in the form7r(X ) =
(Ài
EK,
a~ CN*)
it follows from the chinese remainder theorem(or
from anadequate computation
of the dimension of theunderlying
vectorspaces)
that
K[A]
isisomorphic
to theproduct
ring
ni
so that weobtain,
as for thering
Z/nZ,
a first result:PROPOSITION 6. The
ring
an,S’-ring
if andonly
if A isdiagona-lisable.
Proof
This isagain
astraightforward
consequence oflemma-1,
once weknow that a matrix A can be reduced to the
diagonal
form if andonly
ifthe minimal
polynomial
of A hassimple
roots.Remark 4: If 7~ is no more
algebraically
closed,
we canreplace
thestate-ment of
proposition
6by
the moregeneral
one: thering
is anS-ring
if andonly
if A issemisimple
(i.e.
diagonalisable
over an extension ~~’ ofI~).
Remark 5: It is not worthless to note that an element M =
P(A)
ofthe
ring R
=K[A]
is invertible if andonly
if 0 orstill,
if andonly
ifP(X)
and7r(X)
arecoprime:
the first criterion results forinstance,
from a direct
application
ofCayley-Hamilton theorem;
as for the second itis,
in view of theisomorphism
~[~4] ~
a consequence of Bezout theorem.Before we start the
study
of the sets,5’x
for thering
together
with theirGL(A)-action,
wegive
ageneral
lemma which can be moreeasily
stated if the
underlying
set of the groupGL(R)
of aring R
is denotedby
So (R) :
LEMMA
3. Let E and F be tworings
and E x F be theirproduct
ring.
1
the union
being
taken over i-~ j >
n.Proof
Let x =x, - - - x. be an element of
Si(E)
and y = yi... yj an
element of where all the
Yk)
aresingular
unless i = 0or j
=belongs
to xF)
C since i+ j >
n > 1.Conversely,
let(x, y) _
(~1~1)"
Yn)
be an element ofsn,(E
xF)
where all thecouples
(xi, yi)
aresingular.
We write(x, y) _ (xy ~ ~ ~
yi ...y~)
and we denoteby
i the number(possibly
equal
to0)
of xk which aresingular
inE,
so there are(n-i)
elements xk which areinvertible;
thecorresponding yk
arenecessarily
singular,
so that atleast j >
n - i elements amongthe yk
aresingular
andy E
Sj(F);
the result then follows from thehypothesis
x CS’; (E) .
Remark 6: The lemma can be
easily
extendedby
induction to the case of a finiteproduct
ofrings
E~ , ... ,
Ef.
Remark 7: For n >
2,
the indexation in lemma 3 could bereplaced by
i -1- j = n.
(For
n =1,
this is no more true because the factorSi
x6*1
cannot be taken into
account).
In the case of krings,
weget
the same forPROPOSITION 7. Let R = and
7r(X) =
ITi(X -
i =1, ... ,
rthe minimal
polynomial of A,
thenSp
where p =Li(ai -
1)
+ 1.Proof
Since the setsSi
behave well underring
isomorphisms,
we lookat the
problem
in thering R
=R;,
where Ri
denotes thequotient
ring
Ai)-i.
Let x =(x~ , ... , xr)
belong
to we shall prove that one of thecomponents
of x is zero, this willimply clearly
that x E5’oo.
From lemma
3,
wehave xj
CSiij
(Rj),
where Lj
¡3j
~
p, so that one of the,Q~,
sayQk
is > ak(otherwise,
we would haveLj ¡3j ~
1) p)
which ensures xk E
(Rk) = 10}.
To end theproof,
we notice that theelement x =
((X - ai )‘~’ -~ , ... ,
(X -
is in but not inSp (no
component
of x isequal
to zero!)
Again
Lemma 3 will be of use to establish thefollowing
criterion:PROPOSITION 8. An
P(A)
in thering
R =belongs
to,5‘2
ifand
only
if P vanishes at at least twoeigenvalues
not necessary distinct of A or at aneigenvalue
of order one in the minimalpolynomial
of A.Proof
Wekeep
the notation introduced in theprecedent proof;
theiso-morphism
between thering
R = and thering
rl
Rx
isgiven
by
P(A) H
Pi
where Pi
denotes the class of thepolynomial
P(X)
in thequotient
R~.
Hence,
the elementP(A)
belongs
to,S2
if andonly
if oneamong the
Pi
belongs
toS2(Ri)
or at least two among thePi,
sayPt
andPq,
belong
toSi
(Rt)
andS,
(RR)
respectively,
the second alternativeimplies
clearly
that thepolynomial
P is divisibleby
(X - a f)
andby
(X -
A,q),
the first alternative means that P is divisibleby
(X -
Ài)2
if 2 orP;
= 0Remark 8: We understand now better the
proposition
5 and the remark 3: to say that Abelongs
toS’2
means that thepolynomial
X(which
cannotvanish at two
eigenvalues
of A!)
vanishes at aneigenvalue
of order 1 in7rA; since 0 is its
only
root,
this means that 0 is asimple
root of 7r A . Theimage
in theproduct IT
R;
has one of itscomponents
0 so,belongs
toS(Xj’
Remark 9: A necessary and sufficient condition in order that an elementP(A)
belongs
toS3
could be stated: thepolynomial
must vanish at at leastthree
roots,
or must be divisibleby
(X -
A)2
where A is a root of order 2of or vanish at a
simple
root of Theproof
is left to the reader.Our purpose until the end of this section will be the
study
of the orbits ofGL(A)
on the Webegin
with the case(X-A)" (i.e.
A =N
nilpotent).
In this case =to}
CSo-i
C ~ ~ ~ C81
(strict inclusions).
For i =
1, ... , a -1,
an element of R =belongs
toif and
only
if it can be written as(X -
and 7rbeing
mutually
prime,
which means in view of remark5,
that itbelongs
to the orbit of(X -
A)’.
This proves that theSi B
,S’x+y along
with are the orbits ofGL(R)
acting
onSi;
inparticular,
there are a orbits.The
following
lemma willpermit
us tocompute
the number of orbits in thegeneral
case:LEMMA 4. Let
Gi
denotes the group of invertible elements of thering
E;, i
=1, ... , k
and let E be theproduct
ring.
ThenGL(E)
isisomorphic
to the
product 11
GL(Ei).
Moreover,
if az is the number of orbits ofGi
acting
on then the number of orbits ofGL(E)
onSi
(E)
isgiven
by
(a,
+1)(a2
+1)
...(ar
+1) -
1.Proof
The assertionconcerning
GL(E)
is trivial. As for thesecond,
webegin
with the case n = 2.Considering
the action ofGl
xG2
on the set ofsingular
elements ofRi
xR2,
we can divide the orbits in three kinds: orbits of elements(x, y)
where xand y are
singular,
orbits of elements(x, y)
where x issingular
and y is invertible andfinally,
orbits of those elements(x, y)
where is invertible and ysingular.
There areclearly
ai a2 orbitsof the first
kind,
ai of the secondtype
a.nd cx2 of thethird,
whichgives
=
(al + 1)( a2 + 1) - 1,
first and last. An inductionargument
will do with the
general
case.PROPOSITION 9. The action of
GL(A)
on the set ofsingular
elements ofh’[A]
determinesITi (a¡
+1) -
1orbits,
i =1, ... ,
r if the minimalpolyno-mial is
given by
’Bi)Oî.
before.
COROLLARY 3. The non
empty
setsSi+,, along
with areexactly
the orbits ofGL(A)
acting
on if andonly
if the matrix A can bewritten A = AI +
N,
where A C K and Nnilpotent.
Proof
We havealready
established the sufficient condition.Conversely,
our
hypothesis implies that,
in view ofproposition
7 and8,
which is
possible only
if r =1,
that is A = AI + N.COROLLARY 4. Let A have r distinct
eigenvalues,
then A isdiagonalisable
if andonly
if the number of orbits on the set ofsingular
elements is 2r - 1.Proof
This is clear since the condition isequivalent
to a; =1,
Vi.PROPOSITION 10. Let
5oo
= in thering R
= and suppose thatK[A]
is not anS-ring
(i.e.
p >
2),
then the number of orbits ofGL(A)
acting
on thenon-empty
setSi
S2
isexactly
the number ofmultiple
rootsof the minimal
polynomial
7rA.Moreover,
thenon-empty
setSP-1 B 5p
isexactly
an orbit in thesingular
set.Proof
Wekeep
use of theisomorphism R ’"
ni Ri
with itsni
GL(R; )
action;
an element(x~ , ... ,
belongs
to5*1
B
52
if andonly
if all the z; but one, say xk are invertible and xkbelongs
tothis set is hence non
empty
and aGL(Rk)-orbit.
Weget
so acorrespondence
between the orbit of the element(.ri,... , xr)
and the necessarymultiple
eigenvalue
a. As for the secondassertion,
we first make use of lemma 3: the elementxr)
belongs
to5p-l
if z; E andLi (3¡
>
p-1
and no X is zero
(cf.
proof
ofproposition
7),
thatai - 1;
sincep-1
=1),
weget
Q;
= c~ -1,
for every i . But each(R~ ) B
is an orbit
(even
if a?
=1;
see our convention of notationpreceding
lemma3),
the conclusion follows.Remark 10: More
generally,
it is not difficult to establish that there is aone-to-one
correspondence
between the orbits in,Sk
B
and ther-uples
(01,... , ar)
for which a, -~- ~ ~ ~ + ar = k and 0a-
a~ - 1 for every i .This
gives
forexample
in the case of a matrix A with minimalpolynomial
~rA (X ) = X ~‘~ (X -+-1 )4 (X -1 )‘~
(here p = (2 -~ 3 -f- 2) -E-1
= 8 and the numberSa
B
,5’4,
8 orbits in,S‘4
B
,5’,5 ,
6 orbits in,S’,5
B
3 orbits inB
S7,
one orbitin
,S’? B
58
and 44 orbits inS’s .
Computing
all the orbits in we need to know all the(ai , ... , ar)
such that Vi0
ai , .5 ai-1
and 1al +...+ar ~
p-1.
This lastinequality
is a consequence of the first rinequalities,
so there are(a, - - - ar - 1)
orbitsin
,5’i B
andby
substractionn(ai
+1) -
(cx~ ~ ~ ~ ar)
orbits in(result
which is valid even if p =
1).
It is now easy to solve thefollowing:
Exercise 1: Prove that if A has
exactly
k distinct roots with k >2,
then A isdiagonalisable
if andonly
if there are2k - 1
orbits ofGL(A)
on(Compare
withcorollary
4).
4. Permutable
decompositions
ofsingular
matricesIf A is a
singular
matrix,
we definen(A)
as the upper bound of thenumbers m of
singular
permutative
matricesAi
such that A= Ay ~ ~ ~
In order to
compute
the numbern(A)
for agiven
matrixA,
we need tointroduce a
special
class ofoperators
characterizedby
thefollowing:
PROPOSITION 11. For a
given
matrixacting
on the finite dimensionalvec-tor space E =
Ii ",
it isequivalent
to say:a)
dim = 2 dimker(A)
°
b~
the Jordan cells of A associated with theeigenvalue
0 are of order > 2c) ker(A)
Cim(A)
d
the matrix A is similar to amatrix 0
x
written withrespect
to10
y
-a direct
decomposition
of E =ker(A)
E9 G where the linearoperators
satisfy
(a) ker( X) E9 ker(Y)
= G and({3)
X is onto.Proof
Theequivalence
betweena)
andb)
results from the classical Jor-dandecomposition;
the one betweena)
andc)
is a direct consequence of the Frobeniusinjection p :
ker(A2)/ker(A) -+
ker(A)
given
by
7 1--4A(x);
thusa)
isequivalent
to say that ~p issurjective,
which isexactly
c).
We prove nowa)
»d):
letC,
be acomplementary subspace
of ker(A)
inker(A2)
andC2
be acomplementary subspace
ofker(A2)
in E and write G =Ci Q9
C2
-we have
already
noticed that the restriction of A toCl
is anisomorphism
since these restrictions are
equal.
It follows that X is onto and thatCl
andker(X~
arecomplementary
in G. We needonly
to prove thatCi
=ker(Y~;
it is clear that
C,
Cker(Y),
moreover, ifA+
denotes the restriction ofA to
G,
A+
is one-to-one sodim(Ci)
+dim(C2)
=rk(A+)
= =I,,-rk([X Y])
= +rk(Y)
= +rk(Y)
and we are done.Finally
let us proved)
»a):
the matrixA2
is similar toL v2
and 0y2
with
respect
to the directdecomposition
E =ker(A) E9
G,
to say that the vectorcolumn
is inker(A2)
means that v Eker(y2)nker(XY)
and u islv
"
arbitrary
inker(A);
butker(Y)
= flker(XY)
ifker(X)
flker(Y) =
10} (easy)
so that v Eker(Y).
We end theproof by
noting
that since X isonto and G =
ker(Y),
we have in fact dimker(Y)
= dimker(A).
We are able to state the main result of this section:
PROPOSITION 12. The number
n(A)
is finite if andonly
if A satisfies theequivalent properties
given
inproposition
11. In which casen(A) =
dim
ker(A).
Proof
The matrix A is similar to a matrix B of the form:, the matrix
Bo
being
invertible and each of the Lmatrices
Bi
being
a Jordan cell associated to theeigenvalue
0(obviously,
I~ =
dim ker(A)
and moreoverBo
is absent if A isnilpotent).
If one ofthe
B
is of order0,
the matrix A is similar to B =Bl 0
and B = ’ 00-Bi
xB 2
x ... xB,
withB,
1 =B, B 2
=Bp
=r’
0
(with
evident
notation),
all these matrices aresingular
andpermutative,
andwe can choose p as
large
as we want:n(A)
= oo. Whendim ker(A 2) =
2 dim
ker(A),
we have B =B’
x ...x
B~
where JL TdJ
(we
replace
all the blocksBj
by
I d,
except Bi
which remainsunchanged);
again
these matrices aresingular
and
permutative
son(A) > ~
=dim ker(A).
We
proceed
to prove theopposite
inequality
(in
due course we shall needtwo
lemmas).
)
Suppose
PP that M= X
given
by
proposition
11 can be0
y ’
g y PP
written as aproduct
N,
Nk+,,
where theNi
arepermutable matrices;
we shall show that one of theN~
must be invertible.Let us write
N _
Si
according
to thedecomposition
of M. TheRi
C
first remark is
Ri
0.Indeed,
sinceNi
and Mcommute,
Ni(ker(M»
Cker(M),
that isRi
= 0. It follows that the arepermutative
and thatSl
xS2
... °X = 0.
LEMMA 5. Let
Si , ... ,
Sk+i
bepermutative
matrices of order ksatisfying
x
,5’2
x ~ .. x =0 ,
then after reindexation x,S‘2
x ~ ~ ~ XSk
= 0 .Proof By
induction. The result is trivial for k =1;
if isinvertible,
the conclusion is clear since we may
multiply
on theright
by
its inverse. We may then suppose that the dimension d of theimage
subspace
is
strictly
smaller than n. IfS’~, i
=l, ... ,
n, denotes the restriction(ev-erything
commute with of to thesubspace
im(Sk+l),
we have,S’~
x,S’2
x ... x = 0. This lastexpression
can bethought
(by
grouping
if necessary some
operators
toghether)
as the nullproduct
of d + 1com-muting
operators
in a d-dimensional space.By
inductionhypothesis,
weget
(after
possible reindexation,
andreinserting
of somepossible
operators)
x,S’2
x ~ ~ ~ xS’k
=0,
and conclude that at the level of the holespace
s,
x,S2
X ... X XSk+1
= 0.Accordingly,
we may suppose thatSi
x ... x = 0 andthat,
denoting
the
product
N= N N
by
0
S 0,
P , y10 U-
k+’ y0
T
’(i)
(ii),
since M = =Nk+l
N.The last
step
of theproof
will consist ofproving
that R and T are(i)
and(ii)
imply
thatker(T)
Cker(X)
andker(T)
Cker(Y)
so thatker(T) = {0} :
T is invertible. Now since T isinvertible,
again
(ii)
showsthat
ker(U)
=ker(Y)
and(i)
shows thatrk(H)
=rk(X).
Keeping
the notations ofproposition
11,
we assert that G =ker(U)
and G =ker( H) E9 ker(U);
the firstequality
is nowclear,
the second will be established{0},
but this is easy sinceker(H) n
ker(U)
gker(U)
=ker(Y)
andby
(i) ker(H)
nker(U)
Cker(X).
Weget
now the
invertibility
of R from thefollowing
lemma:LEMMA 6. Consider the
diagram:
and suppose that x =
r o h -~- s o u
together
withker(h)
andker(x)
in directsummand with
ker(u)
inG,
then r induces anisomorphism
between theimages
of h and x.Proof
This is immediate as soon as we consider the restrictions toker(u~
of the
mappings
given
on G.COROLLARY 5.
If n(A k)
is finite thenn(Ak)
=k.n(A).
Proof
Write101
Cker(A)
Cker(A2)
C ~ ~ ~ Cker(Ak)
Cker(Ak+l)
C... C Since
dimker(A2k)
=2dimker(A k),
the Frobeniusinequalities:
dim ker(A+ ) -
dim ker(Ak) dim ker(Ak) - dimker(Ak-l)
are in factequalities
sodimker(Ak) _
k. dimker(A).
Remark 11: The
preceding
corollary
shows inparticular
that ifn(A)
isodd,
the matrix A has no square root.PROPOSITION 13.
Suppose
n(A)
oo, and let A =X~ ~ ~ ~ Xm,
apermuta-tive
singular
maximaldecomposition
ofA(m,
=n(A)),
thenVi,
n(J’Yi)
00 andis= 1.Proof
We haveker(X-)
Cker(A)
Cim(A)
Cim(X.),
since theX;,
commute. So is finite. We
proceed,
forproving
n(Xi)
=1,
by
induction on m
= dim ker(A);
the case m = 1 is trivial. Write A= Xl.B
already
written as m-1permutative singular matrices,
hencen(B) >
m-1. Remember now thatker(B)
Cker(A)
so eitherdim ker(B)
= m - 1 or m; we prove that it is not m:otherwise,
the inclusionim(A)
Cim(B)
would infact be an
equality.
Write now:im(B)
=im(A~
=X,
(im(B)).
This meansthat
X~
leavesim(B)
invariant,
and its restriction toim(B)
issurjective,
and henceker(Xl)nim(B)
=f 0~.
Butker(Xi)
Cker(A)
Cim(A)
=im(B),
so
X,
isbijective
which is false. We have in factdim ker(B)
= m -1,
andn(Xj)
= 1 2by
inductionhypothesis.
Since we could have chosenB =
Xi ...
X.,,,-,,
the factn(Xi)
= 1 is clear.The next result is a
simple application
ofproposition
12 topermutative
decomposition
ofsingular
bistochastic matrices: if A is such a matrix we definen.,(A)
as the upper bound of the number m ofsingular
permutative
bistochastic matricesAx
such that A =j4~ ’’’
Am, .
PROPOSITION 14. For a bistochastic
matrix,
n,,(A)
=n(A).
Proof
We makeagain
use of theisomorphism
between thering
of bis-tochastic matrices and theproduct
ring
M",_y (K)
xK,
and may supposeA
= A, 0
(see
theproof
ofcorollary
1);
if A =0,
nq(A)
=n(A)
= oo;°
A
°and if
n(A)
oo the scalar A is different from 0(proposition
11b))
andn(A)
= the conclusion followseasily.
We look in this final
paragraph
to the upper boundrn(A)
of numbers k such that A =A~ ~ ~ ~
Ak
where theAi
aresingular
andquasi-commutative
(i.e.
isnilpotent).
PROPOSITION 15.m(A)
=Proof
Theproblem
behaves well under basechange,
and asimple
argu-ment similar to the one
given
at thebeginning
of theproof
ofproposition
12,
shows that weonly
need to consider the case when A is a Jordan cell- .
-J.
associated to the zeroeigenvalue.
But if we havefor every m,
Bm’Jn = BJ~
=Jn,;
weget
the resultby
noting
that twotriangular
matrices arequasi-commutative.
Exercises: 2 - Given an
arbitrary
matrixA,
prove that there exists an invertible matrixP,
such thatn(PA)
oo.product
of A andB,
then either A or B is invertible.4 - Prove that
if p > 2,
thenn(APA)
= oo.(We
have denotedby AnA
thep"
exterior power ofA).
5 - Prove that the
ring
of uppertriangular
matrices is anS-ring.
Use this fact togive
anotherproof
ofproposition
15.REFERENCES
[1]
GLAZMAN-LIUBITCH, Analyse linéaire dans les espaces de dimension finie,Edi-tions Mir, Moscou
(1972).
[2]
JACOBSON N, Lectures in abstract algebra II Linear algebra, D. Van NostrandNew-York,
(1953).
Université de Paris VII
Départernent de Mathematjques Tour 45.55, 5e 6tage 2, place Jussieu 75251 PARIS Cedex 05 and Université de NICE Parc Valrose 06034 NICE Cedex.