N N 1 I (A) A N N 1
N N 1 I (A) A N N 1
N N 1 I (A) A N N 1
Key words and phrases: joint spectral radius; lower spectral radius; generalised spectral radius. MSC2010: 15A60 (primary), 15A18, 47D03 (secondary)
1. Introduction
The joint spectral radius (A) of a set A of d d matrices, introduced by G.C. Rota and G. Strang in 1960 [25, 26], is defined to be the maximum possible
exponential growth rate of a product of matrices drawn from the set A:
n
o
1
1
(A) := lim sup kAn A1 k n : Ai A =
sup lim inf kAn A1 k n .
n
N n
(Ai )
i=1 A
In the last two decades the joint spectral radius has been the subject of a proliferation of research articles which we will not attempt to list here exhaustively; some
prominent recent contributions include [4, 5, 9, 14, 15, 16, 18, 20, 22]. By contrast
the lower spectral radius, defined by the expression
o
n
1
1
inf
lim sup kAn A1 k n
(A) := lim inf kAn A1 k n : Ai A =
(Ai )i=1 AN n
has been studied relatively little, despite its relevance to a range of pure and applied
mathematical problems (see e.g. [3, 11, 12, 16, 23, 24, 27]).
By comparison with the joint spectral radius, the behaviour of the lower spectral
radius is delicate. The joint spectral radius of a finite set of matrices depends
continuously on the matrix entries [19] and there exists an algorithm to determine
whether or not (A) = 0 using a number of steps which grows polynomially with
the dimension of the matrices and with the cardinality of the set of matrices being
1
IAN D. MORRIS
considered ([17], see also [20, 2.3.1]). Conversely the lower spectral radius can
exhibit discontinuities (see [7, 20]) and the problem of determining whether or
not a pair of 15 15 integer matrices has lower spectral radius equal to zero is
computationally undecidable [10].
A set of matrices A is said to satisfy the finiteness property for the joint spectral
radius a situation which in this article will be called the upper finiteness property
if there exists a finite sequence A1 , . . . , An of elements of A, possibly including
repetitions, such that (A) = (A1 An )1/n , where denotes the ordinary spectral
radius of a square matrix. The upper finiteness property has been investigated
extensively since it was first defined explicitly in [22] (and implicitly in [16]) and
is believed to hold for most finite sets of matrices (though see e.g. [5, 9, 18] for
examples where the property fails). By analogy we will say that A has the lower
finiteness property if (A) = (A1 An )1/n for some finite sequence A1 , . . . , An
of elements of A. The most powerful methods presently available for computing
the upper and lower spectral radii of a finite set of matrices proceed by proving
that the set of matrices in question has the upper or lower finiteness property, and
by exhibiting precisely a product whose normalised spectral radius (A1 An )1/n
realises the upper or lower spectral radius [14]. In the interest of the computation of
these joint spectral characteristics it is therefore important to understand exactly
how frequently these finiteness properties can be expected to hold.
In the article [8], J. Bochi and the present author investigated the continuity
properties of the lower spectral radius both in the context of compact sets of matrices (with respect to the Hausdorff metric) and as a function of finite sets of matrices
with fixed cardinality. As a corollary, results were also obtained on the genericity
of the lower finiteness property. In order to state these results fully we require a
definition:
Definition 1.1. Let A1 , A2 be 2 2 real matrices. We will say that (A1 , A2 ) is a
resistant pair if there exist c, , > 0 with the following property: for all n 1 and
for all choices of integers i1 , . . . , in {1, 2}, if at most n of the integers ik are
equal to 2, then kAi1 Ain k cen .
The following conjecture was formulated in [6]:
Conjecture 1.2 (Bochi-Fayad Conjecture). Let H denote the set of all 2 2 real
matrices with unit determinant and unequal real eigenvalues, and let R denote the
set of all 2 2 real matrices unit determinant and non-real eigenvalues. Then the
set of all resistant pairs (H, R) H R has full Lebesgue measure.
Some partial results in the direction of this conjecture may be found in [1, 2, 13];
we note that resistant pairs (H, R) H R can easily be constructed explicitly in
the special case where Rn is equal to the identity for some integer n 1, see [8].
Let M2 (R) denote the set of all 2 2 real matrices. J. Bochi and the author have
proved the following result:
Theorem 1.3 ([8]). Define
U := {(H, R) : H H, R R and 0 < < } M2 (R)2 .
Then there is a dense G subset of U in which the lower finiteness property fails.
If additionally the Bochi-Fayad conjecture is true, then the set of discontinuities of
the lower spectral radius on U has full Lebesgue measure.
IAN D. MORRIS
this paper follows the structure of this proof: in 2 we prove certain preliminary
statements; in 3 we examine the case (A) = 0; in 4 and 5 we examine U4 and U3
respectively; and in 6, all of these results are synthesised into the proof of Theorem
1.5.
2. Preliminaries
In this section we show that a general pair (H, R) P E may be reduced by
rescaling and a change of basis to the situation in which R is a rotation and H has
only zero entries in its bottom row. Using this reduction we obtain a formula for
the lower spectral radius which will be used in all subsequent sections. We begin
with the following fundamental observation:
Lemma 2.1. Let (H, R) P E. Then there
simultaneously similar to a pair of matrices of
cos
,
0 0
sin
where , , R and 6= 0.
Proof. Let H, R P E. By dividing both matrices by (det R)1/2 if necessary
we may assume that det R = 1; subject to this assumption we will show that the
pair (H, R) is similar to a pair of the desired form.
Since R is a real matrix with unit determinant and complex eigenvalues, there
exists an invertible matrix A such that ARA1 is a rotation matrix. Let us
write H := AHA1 . Since H has trace 6= 0 and determinant 0, it has a
one-dimensional eigenspace corresponding to the eigenvalue . It is clear that by
conjugating H by a suitable rotation B we may obtain a matrix H := BH B 1
for which the horizontal axis is an eigenspace corresponding to the eigenvalue ;
since rotations commute with one another, this additional conjugation leaves the
rotation matrix ARA1 unchanged. Since H preserves the horizontal axis we may
write
H =
0
for real numbers and , but since det H = det H = 0 and 6= 0 we must have
= 0.
Lemma 2.2. Let H P and R E, and suppose that we have
cos sin
(1)
H=
,
R=
0 0
sin cos
for some , , R, where 6= 0. Then for all finite sequences n1 , . . . , nk and
m1 , . . . , mk of positive integers
tr (H
nk
Rmk
n1
Rm1 )
Pk
i=1
ni
k
Y
i=1
cos mi + 1 sin mi
Pk
i=1
ni
k
Y
cos mi + 1 sin mi .
i=1
n1
cos m sin m
H n Rm =
0
0
sin m cos m
n
1
(cos m + sin m) n (1 cos m sin m)
=
.
0
0
It follows directly that the lower-right and upper-left entries of the matrix
H nk Rmk H n1 Rm1
are respectively zero and
Pk
i=1
ni
k
Y
cos mi + 1 sin mi
i=1
by the standard identity (AB) = (BA), and the minimality of k is again contradicted. Analogous considerations show that each mi must also be nonzero. We
may therefore apply Lemma 2.2 to obtain
Pk
(H nk Rmk H n1 Rm1 ) = ||
i=1 (ni 1)
k
Y
| cos mi + sin mi | .
i=1
Let us define
IAN D. MORRIS
Pk
i=1 (ni 1)
Pk
i=1 (ni 1)
k
Y
| cos mi + sin mi |
i=1
Pk
i=1 (1+mi )
Pk
Pk
(H)
Pk
and therefore
(H nk Rmk H n1 Rm1 )
1
Pk
(ni +mi )
i=1
r = (HRm ) 1+m
Proof. We have
(HRn ) kHRn k kHk kRn k
for every n 0, and therefore
1
inf (HRn ) 1+n lim sup (HRn ) 1+n lim sup (kHk kRn k) 1+n = (R)
n0
using Gelfands formula. It follows by this inequality together with Lemma 2.3 that
1
min
n1 1i1 ,...,in k
(Ai1 Ain ) n
Finally, the following lemma will be used on two occasions in which it is helpful
to estimate small quantities of the form | cos + sin |.
Lemma 2.5. Let , R where is nonzero. If = 0 then define 0 := /2;
otherwise, define 0 := tan1 (/) 12 , 12 , so that in either event we have
cos 0 + sin 0 = 0. Then there exists a constant C0 > 1 such that for every
R
1
dist(, 0 + Z) | cos + sin | C0 dist(, 0 + Z),
C0
where dist(, a + bZ) denotes the distance from the real number to the nearest real
number of the form a + b with Z.
f ()
f (0 + h)
= lim
g() h0 g(0 + h)
| cos(0 + h) + sin(0 + h)|
= lim
h0
|h|
cos(0 + h) + sin(0 + h) cos(0 ) sin(0 )
= lim
h0
h
= | cos 0 sin 0 |
so the result follows if we can show that cos 0 sin 0 is nonzero. If cos 0
sin 0 = 0 and cos 0 6= 0 then tan 0 = / and therefore / = /, implying
the equation 2 + 2 = 0 which is impossible since both numbers are real and
6= 0. If instead cos 0 sin 0 = 0 and also cos 0 = 0 then we have = 0, a
contradiction.
3. On the existence of zero products
In this section we investigate those pairs (H, R) P E such that there exists
a finite product of the two matrices H and R which is equal to the zero matrix.
We begin with the following result, which shows that this situation is, in a certain
topological sense, uncommon.
Lemma 3.1. For every two finite sequences of non-negative integers n1 , . . . , nk and
m1 , . . . , mk+1 , with all integers except possibly m1 and mk+1 being nonzero, the set
Z := {(A, B) P E : B mk+1 Ank B mk Ank1 An1 B m1 = 0}
is closed and has empty interior.
Proof. Since every B E is invertible we note that the equation
B mk+1 Ank B mk Ank1 An1 B m1 = 0
for some (A, B) P E is equivalent to the equation
Ank B mk Ank1 An1 B m1 + = 0
for the same A and B and every non-negative integer , so we may assume without
loss of generality that mk+1 = 0 and m1 > 0. By continuity the set Z is obviously
closed. For each A P let us define a function A : M2 (R) M2 (R) by
A (B) := Ank B mk An1 B m1 .
Let us suppose for a contradiction that the set Z contains a nonempty open set, and
let (A0 , B0 ) be an interior point of Z. Each of the four entries of the matrix A0 (B)
is a polynomial function of the entries of B, and by hypothesis is identically zero in
a neighbourhood of B0 . It follows that each of these entries is the zero polynomial,
IAN D. MORRIS
trarily close to (H, R) such that (H, R) = 0 and such that H, R satisfies the lower
finiteness property. Clearly this property is unaffected by applying a change of
basis or multiplying both matrices H and R by the same scalar, so using Lemma
2.1 we may assume without loss of generality that the pair (H, R) has the form
cos sin
H=
,
R=
0 0
sin cos
for some real numbers , , R, where 6= 0. If (H, R) is as above for some
, , R then using Lemma 2.2 we have
trRm H = cos m + sin m
and if this trace is zero then by the Cayley-Hamilton theorem we have (Rm H)2 = 0,
which implies HRm H = 0 since R is invertible. To prove the lemma it is thus
sufficient to prove the following: for every fixed , R the set
{ R : cos m + sin m = 0}
m=1
inf
n1 i1 ,...,in {1,2}
kAi1 . . . Ain k n
(see e.g. [20, 1.2.2]) the lower spectral radius of (A1 , A2 ) is equal to the infimum of
a sequence of continuous functions of (A1 , A2 ) and hence is upper semi-continuous.
Since it is also non-negative, this implies that every zero of the lower spectral radius
is a point of continuity.
m0
is attained for some integer m 0, and is nonzero. The proposition thus follows
from the combination of Lemmas 4.2, 4.3 and 4.4 below:
Lemma 4.2. Let , R. If R is not a rational multiple of , then
(3)
m0
10
IAN D. MORRIS
for every R/2Z. To prove the lemma we must show that the limit inferior is
greater than or equal to one for Lebesgue almost every R/2Z.
By Lemma 2.5 there exist constants C0 > 1 and 0 ( 2 , 2 ) such that for every
R we have
min | 0 k| C0 | cos + sin |.
kZ
In particular if 0 < 2 and | cos + sin | < t < /2C0 , then must belong
to the set
(0 C0 t, 0 + C0 t) (0 + C0 t, 0 + + C0 t) (0 + 2 C0 t, 0 + 2 + C0 t).
)
preserves Lebesgue measure, it follows that for all m 1 and t (0, 2C
0
({ R/2Z : | cos m + sin m| < t}) 6C0 t.
In particular
n
o
m0
Proof. It follows from the combination of Lemma 4.2 and Lemma 4.3 that for
Lebesgue almost every R/2Z the above infimum is attained at some integer
n 0 depending on . To prove the lemma it is therefore sufficient to show that
the set
{ R/2Z : m 0 such that cos m + sin m = 0}
has measure zero; but this set is countable, since for each m 0 the set
{ R/2Z : cos m + sin m = 0}
is finite, and therefore it has Lebesgue measure zero as required.
11
As was remarked previously, the combination of Lemmas 4.2, 4.3 and 4.4 proves
Proposition 4.1. We may now deduce the following result, which is the main result
of this section:
Proposition 4.5. The set
n
o
1
X := (H, R) P E : (H, R) = (HRn ) n+1 > 0 for some n 0
2
Proof. Let us define SL
2 (R) (R \ {0}) R R/2Z to be the set of all
(A, , , , ) such that the pair
cos sin
,
0 0
sin
cos
does not belong to X. By Proposition 4.1 this set has zero Lebesgue measure
2
as a subset of SL
2 (R) (R \ {0}) R R/2Z. Let us now define a function
2
: SL2 (R) (R \ {0}) R R/2Z P E by
cos sin
(A, , , , ) = A
A1 , A
A1 .
0 0
sin cos
Using Lemma 2.1 it is easy to see that (H, R) P E fails to belong to X if and
only if (H, R) (). The function is a smooth map between 7-dimensional
manifolds, so it is locally Lipschitz and maps sets whose 7-dimensional Lebesgue
measure is equal to zero onto other sets whose 7-dimensional Lebesgue measure is
equal to zero. In particular () has Lebesgue measure zero as required.
5. Positive lower spectral radius without the lower finiteness
property
In this section we investigate those pairs (H, R) P E for which the lower
spectral radius is positive but the lower finiteness property is not satisfied, showing
that the set of all such pairs in dense in P E. This outcome is obtained as a
corollary of the following result:
Proposition 5.1. Fix R \ {0}. For each R and each R/2Z define
cos sin
H :=
,
R :=
.
0 0
sin
cos
Then the set of all (, ) R2 such that the pair (H , R ) has positive lower spectral
radius and does not have the lower finiteness property is a dense subset of R2 .
If , R are fixed, with 6= 0, then Lemma 2.4 together with Lemma 2.2 tells
us that we have
1
m0
On the other hand the combination of Lemma 2.3 and Lemma 2.2 tells us that
the lower finiteness property for (H , R ) holds if and only if either (H , R ) =
(R ) = 1, or there exists m 0 such that
1
12
IAN D. MORRIS
pn
:=
qn
a1 +
1
1
a2 +
1
a3 + 1
an
for each n for which the integers a1 , . . . , an are defined. The above representations
pk /qk in least terms can equivalently be defined by the recurrence relations
(6)
pN + a0 qN pN 1 + a0 qN 1 a
mod b,
and if (an )
n=0 is any infinite extension of the finite sequence a0 , a1 , . . . , aN then
|[a0 ; a1 , a2 , . . .] 0 | < .
Proof. Let (bn )
n=0 be the unique sequence of integers such that 0 = [b0 ; b1 , b2 , . . .],
where bn 1 for every n 1. Let (Pn /Qn )
n=0 be the associated sequence of
convergents, and let n0 1 be large enough that 1/Q2n0 < /2. Define ak := bk for
13
n0
0 k n0 . We will show that there exists a finite extension (an )N
n=0 of (an )n=0
N
such that the associated sequence of convergents (pk /qk )k=0 satisfies (7). We will
subsequently deduce that the second desired property also holds.
Let us first show that it is impossible for the integers pn0 + a0 qn0 and pn0 1 +
a0 qn0 1 to both be divisible by b. We prove this claim by contradiction. If pk +a0 qk
and pk1 + a0 qk1 are both divisible by b for some integer k 1, then it follows
from the relation (6) that
mod b.
mod b
mod b.
This reduces the problem to the preceding case but with n0 + 1 in place of n0 . In
n0
either event we are able to construct a finite extension (an )N
n=0 of (an )n=0 such that
N
the associated sequence of convergents (pk /qk )k=0 satisfies (7) as desired.
Let us now suppose that (an )
n=0 is an infinite extension of the finite sequence
with
a
1
for
every
n
>
N , and let (pk /qk )
(an )N
n
n=0
k=0 be the associated sequence
of convergents. Let := [a0 ; a1 , a2 , . . .] R. The sequence of convergents satisfies
pk /qk = Pk /Qk for k n0 since the sequences (an ) and (bn ) coincide up to this
point. By [21, Theorem 16] it follows that
1
1
Pn0 Pn0
+
0 2 + 2 <
| 0 |
Qn Qn
Q
Q
0
n0
1/Q2n0
n0
The core of the proof of Proposition 5.1 rests in the following long lemma:
Lemma 5.3. Let ab Q in least terms where b is prime and a is nonzero, let
K > 1, let 0 ( 2b , 2b ) \ Q and let > 0. Then there exists an infinite sequence
of integers (an )
n=0 , where an 1 for every n 1, such that the irrational number
:= [a0 ; a1 , a2 , . . .] belongs to ( 2b , 2b ), satisfies | 0 | < , and has the following
additional properties: for every n 0 there exists q > n such that
(8)
and furthermore
(9)
n0
14
IAN D. MORRIS
Proof. By replacing > 0 with a smaller value if necessary, we may ensure that
| 0 | < implies that ( 2b , 2b ). By Lemma 5.2 there exist integers N 1
and a0 Z, a1 , . . . , aN N such that every infinite extension (an )
n=0 of the finite
sequence (an )N
has
the
property
that
|[a
;
a
,
.
.
.]
|
<
,
and
such that the
0
1
0
n=0
associated sequence of convergents (pk /qk )N
satisfies
k=0
pN + a0 qN pN 1 + a0 qN 1 a
mod b.
1
1+q
mod b.
pn + a0 qn pn1 + a0 qn1 a
mod b
and
(12)
1
1+qn1
Pn2
C(4Kb)
1
k=N 1+qk
The sequence is constructed inductively. Let us assume that the sequence (an )m
n=0
has been constructed in such a way that the above properties are satisfied for every
n in the range N + 1 n m. (Clearly this already holds in the particular case
m = N + 1.) We will show that an integer am+1 may be chosen such that the
extended sequence (an )m+1
n=0 has the above properties for all integers n in the range
N + 1 n m + 1.
Given the sequence (an )m
n=0 , we define the integer am+1 by
1+qm
1
1+qm1
.
am+1 := b qm (2Kqm )
Since
pm+1 + a0 qm+1 = am+1 (pm + a0 qm ) + pm1 + a0 qm1
and b divides am+1 , we have
pm+1 + a0 qm+1 pm1 + a0 qm1 a
mod b,
15
inequality
1
1+qm
qm+1
1+q1
1+qm
m
1+qm1
qm1 + bqm + b(2Kqm )
1+q1
1+qm
m
1+qm1
< ((2Kb + b + 1) qm )
Pm1
1
k=N 1+qk
where we have used the induction hypothesis to obtain the upper bound
1
1+qm1
qm
Pm2
C(4Kb)
1
n=N 1+qk
sequence (an )
n=0 . For the remainder of the proof we fix the sequence (an )n=0
defined in the preceding manner.
Let us show that the number := [a0 ; a1 , a2 , . . .] thus constructed has the properties required in the statement of the lemma. By [21, Theorem 9] we have for
every n 0
(13)
|qn ( a0 ) pn | <
1
qn+1
1
.
2qn+1
1
1
=
2
2qn+1
as required. Suppose next that k 1. Let Z such that dist(k, a+bZ) = |k|,
and let d 1 denote the greatest common divisor of k and ||. Let k = k d, = d
16
IAN D. MORRIS
where k and are coprime, and let m 0 such that qm k < qm+1 . If k > qm
then by [21, Theorem 19] we have |k | 1/2k and therefore
dist(k, a + bZ) = |k | = d|k |
d
1
1
>
2k
2k
2qn+1
d
1
>
qm+1 + qm
2qn+1
1
1+k
>K
1
1+k
1+q1
qN +1
where we have used (14). If on the other hand n N , then by the previous claim
together with (14)
1
1+k
1
1
dist(k, a + bZ) 1+k >
2qn+1
1
1+q
n
1
1
1+k
K
2Kqn+1
1
k=N
1
<
1 + qk
If n N then by (12)
q1
P
n
1
n1
k=N
C 1 (4Kb)
qn+1
n1
2
k=1
1
1+qk
17
1+2
k1
2
<
2 2 < 4.
k=0
> C 1 (4Kb)
1
k=N 1+qk
and since the last two terms do not depend on n, the infimum in question is nonzero.
This completes the proof of (9) and hence completes the proof of the lemma.
We may now give the proof of Proposition 5.1, and deduce from it the result
which will be used in the following section.
Proof of Proposition 5.1. Let ,
R, and let > 0; we will define , such that
|
| and | | are smaller than and such that (H , R ) has positive lower
spectral radius but lacks the lower finiteness property. Since R = R+2n for
every R and n Z we may freely assume that ( 2 , 2 ], and by making
an arbitrarily small adjustment to if necessary we may also assume that 1 is
irrational.
Since the set of rationals with prime denominator is dense in R, and the function
| <
tan : ( 2 , 2 ) R is a homeomorphism, we may choose R such that |
)
for
some
nonzero
integer
a
and
prime
natural
number
b5
and 1 = tan( a
b
such that ab ( 12 , 12 ). By Lemma 2.5 we may choose a constant C0 > 1 such that
a
+ Z C01 | cos + sin |
(15)
C0 | cos + sin | dist ,
b
for every R. By Lemma 5.3 there exist an infinite sequence of integers (an )
n=0
with an 1 for all n 1, and a real number > 0, such that the irrational
< b 1 , and such that
number := [a0 ; a1 , . . . , ] ( 2b , 2b ) satisfies | b 1 |
the inequality
2
1
1
C0 b 1+n
1+n
1+m
(16)
dist(n, a + bZ)
>0
>
inf dist(m, a + bZ)
m>n
holds for every integer n 0, where we have used C0 b/ 5C0 / > C0 > 1.
Define :=
b ( 2 , 2 ) so that | | < . Since is irrational, is not a
rational multiple of , so we have
1
n0
n0
using Lemmas 2.2 and 4.2. If (H , R ) has the lower finiteness property then
necessarily (H , R ) = (H Rn )1/(n+1) for some integer n 0, since otherwise
Lemma 2.3 together with the previous inequality yields a contradiction. To show
that (H , R ) does not have the lower finiteness property it is therefore sufficient
to show that the infimum
1
inf (H Rn ) n+1
n0
18
IAN D. MORRIS
Let us first prove that this infimum is not attained. Given n 0, using Lemma
2.2, (15) and (16) we may find m > n such that
1
1
1
C0 b 1+m
dist(m, a + bZ) 1+m
>
1
1+m
1
a
= C01+m dist m,
+ Z
b
1
1
| cos m + 0 sin m| 1+m = (H Rm ) 1+m
proving our assertion. To see that (H , R ) is nonzero we note that by a similar
chain of inequalities
1
n0
C0 b
1
1+n
> 0.
C0 b
We now easily deduce the following result which will be used in the proof of
Theorem 1.5.
Corollary 5.4. The set of all (H, R) P E such that (H, R) > 0 and such that
(H, R) does not have the lower finiteness property is a dense subset of P E.
Proof. We argue similarly to the proof of Proposition 4.5. Let us define
2
2
SL
2 (R) (R \ {0}) R to be the set of all (A, , , , ) such that the pair
cos sin
,
0 0
sin
cos
has nonzero lower spectral radius but fails to have the lower finiteness property. By
2
2
Proposition 5.1 this set is a dense subset of SL
2 (R) (R \ {0}) R . If we define
2
2
: SL2 (R) (R \ {0}) R P E by
cos sin
1
1
(A, , , , ) := A
A ,A
A
0 0
sin cos
then by Lemma 2.1 the function is surjective. Clearly is also continuous. It is
straightforward to see that if (H, R) () then (H, R) has nonzero lower spectral
radius and does not have the lower finiteness property, and since is continuous
and surjective, () is dense in P E.
19
k=1 n1 ,...,nk 0
m1 ,...,mk 0
which is the intersection of countably many open dense sets. Since furthermore
\
U1 = Y
Xn
n=1
20
IAN D. MORRIS