Rank Commutators: Dongsheng Zhao, Fengming Dong, Weng Kin Ho (Dongsheng - Zhao, Fengming - Dong, Wengkin - Ho) @nie - Edu.sg

Introduction
Range of rank(AB) rank(BA)

Main results
Concluding remarks
Rank Commutators
Dongsheng Zhao, Fengming Dong, Weng Kin Ho
dongsheng.zhao,fengming.dong,wengkin.ho@nie.edu.sg
National Institute of Education, Nanyang Technological University
June 5, 2012
Dongsheng Zhao, Fengming Dong, Weng Kin Ho {dongsheng.zhao,fengming.dong,wengkin.ho}@nie.edu.sg Rank Commutators
Introduction
Main results
Concluding remarks
Outline
1
Introduction
2
Range of
rank(AB) rank(BA)
3
Main results
4
Concluding remarks
Introduction
Main results
Concluding remarks
Outline
1
Introduction
2
Range of
rank(AB) rank(BA)
3
Main results
4
Concluding remarks
Introduction
Main results
Concluding remarks
Outline
1
Introduction
2
Range of
rank(AB) rank(BA)
3
Main results
4
Concluding remarks
Introduction
Main results
Concluding remarks
Outline
1
Introduction
2
Range of
rank(AB) rank(BA)
3
Main results
4
Concluding remarks
Introduction
Main results
Concluding remarks
Rank
Denition (Rank of a matrix)
The rank of a real m n matrix A is dened as the dimension of
its column space, i.e., the space spanned by the set of column
vectors of A.
The following results are well-known concerning rank:
Theorem
Let A be an n n matrix.
1
rank(A) = rank(A
T
).
2
For any invertible matrix B of size n, rank(AB) = rank(BA).
Introduction
Main results
Concluding remarks
Rank
vectors of A.
Theorem
1
rank(A) = rank(A
T
).
2
Introduction
Main results
Concluding remarks
Rank
vectors of A.
Theorem
1
rank(A) = rank(A
T
).
2
Introduction
Main results
Concluding remarks
Rank
vectors of A.
Theorem
1
rank(A) = rank(A
T
).
2
Introduction
Main results
Concluding remarks
Common misconception
Many beginners believe that ...
For any square matrices A and B of the same size, it holds that
rank(AB) = rank(BA).
Introduction
Main results
Concluding remarks
The preceding statement is false in general.
Counterexample
Let A =
1 0
0 0
and B =
0 0
1 0
. Then,
rank(AB) = 0 while rank(BA) = 1.
Introduction
Main results
Concluding remarks
Counterexample
Let A =
1 0
0 0
and B =
0 0
1 0
.
Then,
Introduction
Main results
Concluding remarks
Counterexample
Let A =
1 0
0 0
and B =
0 0
1 0
. Then,
Introduction
Main results
Concluding remarks
A natural question to ask
What exactly are those square matrices A such that
rank(AB) = rank(BA)
for all real n n matrices B?
Introduction
Main results
Concluding remarks
Question generalised
Denition (Rank-commutators)
let L be any subset of real square matrices of size n.
A non-zero square matrix A of size n is said to be a rank
commutator over L (or L-rank commutators) if for all B L,
The set of L-rank commutators is denoted by L
.
Introduction
Main results
Concluding remarks
.
Introduction
Main results
Concluding remarks
.
Introduction
Main results
Concluding remarks
Basic results
Lemma
For any n n matrices A and B,
rank(A) + rank(B) n rank(AB) minrank(A), rank(B).
Introduction
Main results
Concluding remarks
Basic results
Lemma
For any n n matrices A and B,
0 [ rank(AB) rank(BA)[ minr , s, n r , n s,
where rank(A) = r and rank(B) = s.
Introduction
Main results
Concluding remarks
Basic results
Lemma
For any n n matrix B with rank r and any integer i with
[i [ minr , n r , there is a matrix A such that
rank(AB) rank(BA) = i .
Furthermore, the bound minr , n r is sharp.
Introduction
Main results
Concluding remarks
Basic results
Lemma
[i [ minr , n r , there is a matrix A such that
rank(AB) rank(BA) = i .
Furthermore, the bound minr , n r is sharp.
Introduction
Main results
Concluding remarks
Basic results
The preceding lemma can be strengthened to the following:
Theorem
1 i minr , n r , the following conditions hold:
1
There is a matrix A such that rank(AB) = rank(A) = i and
BA is a zero-matrix.
2
There is a matrix A
such that rank(BA
) = rank(A
) = i and
A
B is a zero-matrix.
Moreover, the bound minr , n r is sharp.
Introduction
Main results
Concluding remarks
Basic results
Theorem
1
2
There is a matrix A
such that rank(BA
) = rank(A
) = i and
A
B is a zero-matrix.
Introduction
Main results
Concluding remarks
Basic results
Theorem
1
2
There is a matrix A
such that rank(BA
) = rank(A
) = i and
A
B is a zero-matrix.
Introduction
Main results
Concluding remarks
Basic results
Corollary
For any integers n > 0 and i with 0 i n/2|, there are n n
matrices A and B such that
[ rank(AB) rank(BA)[ = i .
Furthermore, the bound n/2| is sharp.
Introduction
Main results
Concluding remarks
Basic results
Corollary
For any integers n > 0 and i with 0 i n/2|, there are n n
matrices A and B such that
[ rank(AB) rank(BA)[ = i .
Furthermore, the bound n/2| is sharp.
Introduction
Main results
Concluding remarks
Order-theoretic properties
Trivial results
Rank-commutators over dierent subsets
Some notations
Throughout this talk, we adopt the following notations:
/
mn
the set of m n matrices
/
n
the set of non-zero square matrices of size n
(L
n
the set of invertible square matrices of size n
oL
n
the set of square matrices of size n whose determinant is 1
o
n
the set of non-zero symmetric matrices of size n
T
n
the set of non-zero diagonal matrices of size n
TL
n
the set of non-zero diagonalizable matrices of size n
1
n,i
the set of non-zero square matrices of size n and of rank i
I
n
the identity matrix of size n
0
m,n
the m n zero matrix
Introduction
Main results
Concluding remarks
Trivial results
General framework
For a given binary relation R on a set X, dene a pair of
endofunctions on T(X) as follows:
()
: T(X)T(X), M M
,
where M
:= x X [ m M. m R x, and
()
: T(X)T(X), N N
,
where N
:= x X [ n N. x R n.
Introduction
Main results
Concluding remarks
Trivial results
It can be shown that ...
Theorem
For any M, N T(X),
M N
N.
Introduction
Main results
Concluding remarks
Trivial results
As a consequence ...
We have:
1
()
preserves arbitrary suprema in (T(X), ), i.e., for any

family (M
i
)
i I
of subsets of X, it holds that
i I
M
i
i I
M
i
.
2
()
preserves arbitrary inma in (T(X), ), i.e., for any

family (N
i
)
i I
i I
N
i
i I
N
i
.
Introduction
Main results
Concluding remarks
Trivial results
We have:
1
()

family (M
i
)
i I
i I
M
i
i I
M
i
.
2
()

family (N
i
)
i I
i I
N
i
i I
N
i
.
Introduction
Main results
Concluding remarks
Trivial results
We have:
1
()

family (M
i
)
i I
i I
M
i
i I
M
i
.
2
()

family (N
i
)
i I
i I
N
i
i I
N
i
.
Introduction
Main results
Concluding remarks
Trivial results
Corollary
The following conditions hold for any M T(X):
1
M (M
and M (M
.
2
M
= ((M
and M
= ((M
.
Introduction
Main results
Concluding remarks
Trivial results
Corollary
1
M (M
and M (M
.
2
M
= ((M
and M
= ((M
.
Introduction
Main results
Concluding remarks
Trivial results
Corollary
1
M (M
and M (M
.
2
M
= ((M
and M
= ((M
.
Introduction
Main results
Concluding remarks
Trivial results
Specializing the results
For the special case where X = /
n
, dene the binary relation
on X as follows:
A B rank(AB) = rank(BA).
Since is symmetric, ()
= ()
and use only one notation ()

Introduction
Main results
Concluding remarks
Trivial results
Specializing the results
For the special case where X = /
n
, dene the binary relation
on X as follows:
A B rank(AB) = rank(BA).
Since is symmetric, ()
= ()
and use only one notation ()

Introduction
Main results
Concluding remarks
Trivial results
One trivial result
Lemma
For any positive integer n,
(L
n
= oL
n
= /
n
.
Introduction
Main results
Concluding remarks
Trivial results
Another trivial result
Lemma
For any positive integer n and any L /
n
, it holds that
(L
n
L
.
Introduction
Main results
Concluding remarks
Trivial results
/
n
-rank commutators
Theorem
/
n
= (L
n
.
Introduction
Main results
Concluding remarks
Trivial results
1
n,j
-rank commutators
Theorem
For any positive integers n and 1 < i < n,
1
n,i
= (L
n
.
Introduction
Main results
Concluding remarks
Trivial results
Fixed points of ()
Notation
The i th row of a given matrix A /
n
is denoted by r
i
, i.e.,
r
i
:=
a
i 1
a
i 2
a
in
,
while its j th column is denoted by c
j
, i.e.,
c
j
:=
a
1j
a
2j
.
.
.
a
nj
.
Introduction
Main results
Concluding remarks
Trivial results
Fixed points of ()
Denition (Rank-symmetric)
We say that A /
n
is rank-symmetric if for any non-empty
subset K 1, , n, the following are equivalent:
(i) The set r
k
[ k K is linearly independent.
(ii) The set c
k
The set of all rank-symmetric matrices of size n is denoted by T
n
.
Introduction
Main results
Concluding remarks
Trivial results
Fixed points of ()
We say that A /
n
(i) The set r
k
(ii) The set c
k
n
.
Introduction
Main results
Concluding remarks
Trivial results
Fixed points of ()
We say that A /
n
(i) The set r
k
(ii) The set c
k
n
.
Introduction
Main results
Concluding remarks
Trivial results
Fixed points of ()
We say that A /
n
(i) The set r
k
(ii) The set c
k
n
.
Introduction
Main results
Concluding remarks
Trivial results
Characterisation of rank-symmetry
Lemma
The following are equivalent for A /
n
:
(i) A is rank-symmetric.
(ii) For every non-empty subset K 1, , n,
dim r
k
[ k K = dim c
k
[ k K.
(iii) A is either invertible or of the form C
X 0
r ,nr
0
nr ,r
0
nr ,nr
C
T
for some invertible matrices C and X, where rank(X) = r < n.
Introduction
Main results
Concluding remarks
Trivial results
Lemma
n
:
dim r
k
[ k K = dim c
k
[ k K.
X 0
r ,nr
0
nr ,r
0
nr ,nr
C
T
Introduction
Main results
Concluding remarks
Trivial results
Lemma
n
:
dim r
k
[ k K = dim c
k
[ k K.
X 0
r ,nr
0
nr ,r
0
nr ,nr
C
T
Introduction
Main results
Concluding remarks
Trivial results
Lemma
n
:
dim r
k
[ k K = dim c
k
[ k K.
X 0
r ,nr
0
nr ,r
0
nr ,nr
C
T
Introduction
Main results
Concluding remarks
Trivial results
Fixed point of ()
Theorem
For any positive integer n, we have
T
n
= o
n
= T
n
= T
n
.
Introduction
Main results
Concluding remarks
Trivial results
Transformation theorems
Lemma
For any L /
n
, we have (L
T
)
= (L
)
T
.
Lemma
For any L /
n
and any invertible matrix C, it holds that
(LC)
= C
1
L
and (CL)
= LC
1
.
Introduction
Main results
Concluding remarks
Trivial results
Lemma
For any L /
n
, we have (L
T
)
= (L
)
T
.
Lemma
For any L /
n
and any invertible matrix C, it holds that
(LC)
= C
1
L
and (CL)
= LC
1
.
Introduction
Main results
Concluding remarks
Trivial results
Theorem
For any invertible matrix C, we have
(T
n
C)
= T
n
C
T
and (CT
n
)
= C
T
T
n
.
Introduction
Main results
Concluding remarks
Trivial results
Other xed points of ()
Corollary
For any symmetric and invertible matrix C, it holds that
(T
n
C)
= T
n
C and (CT
n
)
= CT
n
.
Corollary
Let C
1
, C
2
, , C
k
be square matrices, each of which obtained
from I
n
by exchanging two columns. If C = (C
1
C
2
C
k
)
T
, then
(T
n
C)
= T
n
C
1
.
Introduction
Main results
Concluding remarks
Trivial results
Other xed points of ()
Corollary
For any symmetric and invertible matrix C, it holds that
(T
n
C)
= T
n
C and (CT
n
)
= CT
n
.
Corollary
Let C
1
, C
2
, , C
k
be square matrices, each of which obtained
from I
n
by exchanging two columns. If C = (C
1
C
2
C
k
)
T
, then
(T
n
C)
= T
n
C
1
.
Introduction
Main results
Concluding remarks
Trivial results
TL
n
-rank commutators
Theorem
TL
n
= (L
n
.
Introduction
Main results
Concluding remarks
Some open problems
Let |
n
, /o
n
, 1
n
denote the sets of upper triangular,
anti-symmetric, and Hadamard matrices of sizes n respectively.
Question 1
Determine
|
n
, /o
n
, 1
n
.
Introduction
Main results
Concluding remarks
Some open problems
Let |
n
, /o
n
, 1
n
denote the sets of upper triangular,
anti-symmetric, and Hadamard matrices of sizes n respectively.
Question 1
Determine
|
n
, /o
n
, 1
n
.
Introduction
Main results
Concluding remarks
Some open problems
Question 2
For a given L /
n
, is there always a nite subset T L such
that
T
= L
?
Note that the above is true for L = T
n
, T
n
, o
n
.
Introduction
Main results
Concluding remarks
Some open problems
Question 2
For a given L /
n
, is there always a nite subset T L such
that
T
= L
?
Note that the above is true for L = T
n
, T
n
, o
n
.
Introduction
Main results
Concluding remarks
Some open problems
Question 3
Are there any other interesting real-valued matrix functions other
than rank for which the same game can be played?
Introduction
Main results
Concluding remarks
References
1
D. S. Berstein, Matrix Mathematics: Theory, Facts and
Formulas. Princeton University Press, 2005.
2
G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M.
Mislove and D. S. Scott, Continuous Lattices and Domains,
Cambridge University Press, 2003.
Introduction
Main results
Concluding remarks
The End
Thank you!

Rank Commutators: Dongsheng Zhao, Fengming Dong, Weng Kin Ho (Dongsheng - Zhao, Fengming - Dong, Wengkin - Ho) @nie - Edu.sg

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Rank Commutators: Dongsheng Zhao, Fengming Dong, Weng Kin Ho (Dongsheng - Zhao, Fengming - Dong, Wengkin - Ho) @nie - Edu.sg

Uploaded by

Copyright:

Available Formats

Introduction

Range of rank(AB) rank(BA)

such that rank(BA

such that rank(BA

such that rank(BA

preserves arbitrary suprema in (T(X), ), i.e., for any

preserves arbitrary inma in (T(X), ), i.e., for any

preserves arbitrary suprema in (T(X), ), i.e., for any

preserves arbitrary inma in (T(X), ), i.e., for any

preserves arbitrary suprema in (T(X), ), i.e., for any

preserves arbitrary inma in (T(X), ), i.e., for any

and use only one notation ()

Dongsheng Zhao, Fengming Dong, Weng Kin Ho {dongsheng.zhao,fengming.dong,wengkin.ho}@nie.edu.sg Rank Commutators

and use only one notation ()

Dongsheng Zhao, Fengming Dong, Weng Kin Ho {dongsheng.zhao,fengming.dong,wengkin.ho}@nie.edu.sg Rank Commutators

You might also like