• Tidak ada hasil yang ditemukan

vol5_pp11-18. 137KB Jun 04 2011 12:06:14 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "vol5_pp11-18. 137KB Jun 04 2011 12:06:14 AM"

Copied!
8
0
0

Teks penuh

(1)

The Electronic Journal of Linear Algebra.

A publication of the International Linear Algebra Society. Volume 5, pp. 11-18, January 1999.

ISSN 1081-3810. http://math.technion.ac.il/iic/ela

ELA

SPACES OFRANK-2 MATRICESOVER GF(2)

LEROY B. BEASLEYy

Abstract. The possible dimensions of spaces of matrices over GF(2) whose nonzero elements

all have rank 2 are investigated.

Keywords.Matrix, rank, rank-kspace.

AMSsubject classications.15A03, 15A33, 11T35

LetMm;n(F) denote the vector space of allmnmatrices over the eldF. In

the case thatm=nwe writeMn(F). A subspace,K, is called arank-kspace if each

nonzero entry inK has rank equalk. We assume throughout that 1kmn.

The structure of rank-kspaces has been studied lately by not only matrix theorists but group theorists and algebraic geometers; see [4], [5], [6]. In [3], [7], it was shown that the dimension of a rank-k space is at most n+m,2k+ 1, and in [1] that

the dimension of a rank-k space is at most max(k+ 1;n,k+ 1), when the eld is

algebraically closed.

In [2] it was shown that, if jFjn+ 1 andn 2k,1, then the dimension of

a rank-k space is at mostn. Thus, if k= 2 and F is not the eld of two elements, we know that the dimension of a rank-2 space is at mostn. In [2] it was also shown that ifn=qk+r, with 0r < kthen ifF has an extension of degreekand one of

degreek+r, then there is a rank-kspace of dimensionn. Thus, for k= 2, the only case left to investigate is whenjFj= 2.

In this paper we shall show that ifm=n= 3 there is a rank-2 space of dimension

n+1 over the eld of two elements and that ifn4 the dimension of a rank-2 space

is at mostn.

Further, is easily shown that for any eld, the dimension of a rank-mspace is at

mostn. Thus, henceforth, we assume that k= 2, 3mn and thatF =Z

2, the

eld of two elements.

Example 1. Consider the space of matrices

8 < : 2 4

a c c d a+b c d d b

3 5

ja;b;c;d2Z 2

9 = ;

:

It is easily checked that this is a 4 dimensional rank-2 subspace ofM 3(

Z 2).

It follows that forn= 3, nis not an upper bound on the dimension of a rank-2 space.

We letIk denote the identity matrix of orderkk,Ok;lthe zero matrix of order

kl, and Ok denotes Ok;k. When the order is obvious from the context, we omit

Received by the editors on 17 July 1998. Accepted for publication on 22 January 1999. Handling

Editor: Daniel Hershkowitz.

yDepartment of Mathematics, Utah State University, Logan, Utah 84322-3900, USA

([email protected]). This research was undertaken while the author was on sabbatical leave visiting University College Dublin, Ireland.

(2)

ELA

12 LeRoyB.Beasley

the subscripts. We shall use the notation (A) to denote the rank of the matrix

A. For increasing sequences, f1;2;;mg, and f1;2;;ng, we will let

A[j] denote the submatrix of A on rows and columns . That is,A[i;jjk;l] =

aik ail

ajk ajl

.

Theorem 2. If n4,K isarank2spaceandF=Z 2

,thendimKn. Proof. Without loss of generality, we may assume that

I2 O

O O

2K. We also

suppose that dimK> n.

Suppose that there is some nonzero C 2K such that C =

O2 C2

O C4

. Then

C4=O and (C2) = 2. Multiplying all elements of

K by appropriate matrices that

leave

I2 O

O O

xed, we can assume that

O I2 O

O O O

2K.

Now, since dimK > n, there existsA 2K such that a

1j = 0 for all j and the

rank of A is 2. Now, let B(x;y) = x

I2 O

O O

+y

O I2 O

O O O

+A. Then,

B(x;y)[1;2;3j1;2;3] = 2 4

x 0 y a21 a22+x a23

a31 a32 a33 3

5 must have zero determinant for all

x;y2F. That is

a33x+a33a22x+a23a32x+a31a22y+a31xy+a32a21y= 0:

(1)

Recall that inF =Z

2, x

2 =x for all x. It follows that for x= 0 and y= 1 we

have

a31a22+a32a21= 0

(2)

and for x = 1 and y = 0 we have

a33+a33a22+a32a23= 0:

Now, we have

y(a31a22+a32a21) +x(a33+a33a22+a32a23) =a31xy

from (1) and each term of the left hand side is zero. Thusa31= 0.

By consideringB(x;y)[1;2;rj1;2;3] as above, we get thata

r1= 0 for allr.

Similarly,B(x;y)[1;2;rj1;2;4] must have zero determinant for all r3. Thus,

ar4x+a22ar4x+a24ar2x+ar2xy= 0. Ifx= 1 andy= 0 we getar4+a22ar4+a24ar2=

0 and hencear2xy= 0 for allx;y. Thus,ar2= 0 for allr 3.

Now, B(x;y)[1;2;rj1;3;4] must also have zero determinant. That is, a

23ar4x+

a24a43x+a21ar4y+ar3xy= 0. As above we get thatar3= 0 for allr 3.

(3)

ELA

SpacesofRank-2MatricesoverGF(2) 13

The above contradicts thatAhas rank 2 sinceAhas only one nonzero row. Thus,

there is no matrixC2Kof the formC= Similarly, there is no matrix inK of the form

Sincen4 and we have supposed that dimK>n, there is some rank-2 matrix

A2K of the formA=

LetR,S andQbe invertible matrices such that

(4)

ELA

14 LeRoyB.Beasley

LetG(x;y) =x

hence, the coecient of each term in the polynomial must be 0. Thus, we obtain a)b

g) [23j123], respectively.

Thus

21= 1 and from the coecient

(5)

ELA

SpacesofRank-2MatricesoverGF(2) 15

a)f

e) [23j123], respectively.

Now, detH(x;y;z)[123j123] =x(f

But then,

a rank 1 matrix, a contradiction.

(6)

ELA

16 LeRoyB.Beasley

LetC(x;y) =x

zero, i.e., each coecient in the polynomial expansion must be zero. Thus, we get a)e

Subcase 1. e

23 = 1. In this case, since the rank of

E must be 2, and e

31= e

23, we

have that e

1i = 0 and e

j2 = 0 for all

i;j 4, and that e

12= 0 by considering that

(7)

ELA

SpacesofRank-2MatricesoverGF(2) 17

b)f

d) [12j123], respectively.

But then,F =O, a contradiction.

Subcase 2. e

23 = 0. In this case, since the rank of

E is 2, we have that e

1i = 1 for

somei 4 and e

j2 = 1 for some

j 4. Here, there are invertible matrices U and

(8)

ELA

18 LeRoy B. Beasley

f) [123j234], respectively.

That is H =

2 6 6 6 4

0 0 0

0 h22 0

0 h32 0

... ... ... ...

3 7 7 7 5

. But the rank of H is 1 since H 6= 0, a

contradiction sinceH2K andK is a rank 2 space.

We have thus obtained a contradiction in each case, and hence our supposition that dimK> nis false, and the theorem is proved.

Corollary 3. Over any eld F, for m;n 3, the dimension of any rank-2

subspace of Mm;n(F) is at most n, except when m=n = 3 and F =Z

2, in which

case, the dimension is at most 4.

Proof. By the above theorem and comments, unlessm=n= 3 and F=Z

2, the

dimension of any rank-2 space is at most n. If K is a rank-2 subspace of M 3(

Z 2),

deneK

+=

f[A ~0]jA2K g. ThenK

+ is a rank-2 subspace of M

3;4( Z

2) and hence

the dimension is at most 4. ClearlyK andK

+ are isomorphic so that the dimension

ofK is at most 4 also.

Another example of a 4 dimensional rank-2 subspace of M

3( Z

2) which is not

equivalent to the one in Example 1 is given below.

Example 4. Consider the space of matrices

8 < : 2 4

a 0 c d a+b 0

0 c+d b

3 5

ja;b;c;d2Z 2

9 = ;

:

It is easily checked that this is a 4 dimensional rank-2 subspace ofM 3(

Z 2).

Conjecture 5. Over any eld, F, the dimension of a rank-k subspace of

Mm;n(F) is at mostn unlessm=n= 3, k= 2 and F=Z 2.

REFERENCES

[1] L. B. Beasley. Spaces of matrices of equal rank,LinearAlgebraanditsApplications, 38:227{237,

1981.

[2] L. B. Beasley and T. J. Laey, Linear operators on matrices: the invariance of rank-kmatrices, LinearAlgebraanditsApplications, 133:175{184, 1990.

[3] L. B. Beasley and R. Loewy, Rank preservers on spaces of symmetric matrices, Linearand MultilinearAlgebra, 43:63{68, 1987.

[4] B. Ilic and J. M. Lansberg, On symmetric degeneracy loci, spaces of symmetric matrices of constant rank and dual varieties. Preprint, 1996.

[5] R. Meshulam, On two extremal matrix problems, Linear Algebra and its Applications,

114/115:261{271, 1989.

[6] J. Sylvester, On the dimensions of spaces of linear transformations satisfying rank conditions,

LinearAlgebraanditsApplications, 78:1{10, 1986.

Referensi

Dokumen terkait

the q -adic Vandermonde matrix has a similar block structure. We conclude this paper by examining

In addition, in corresponding min- imal rank solution set of the equation, an explicit expression for the nearest matrix to a given matrix in the Frobenius norm is provided..

The first group is about spectral properties ofa matrix under such perturbations; the second is about almost-near relations with respect to the rank distance..

Laplacian matrix, Algebraic connectivity, Caterpillar, Bottleneck matrices, Perron branches, Characteristic vertices.. AMS

Minimum rank, Symmetric matrix, Finite field, Projective geometry, Polarity.. graph, Bilinear

Our second con- struction produces a ( −J )-type tournament matrix from two minimum rank tourna- ment matrices of even orders..

In this section, we will use our results on the inertia sets of connected minimum rank 2 graphs and our results on the structure of these minimum rank matrices to investigate

The boundary of the Krein space tracial numerical range, an algebraic approach and a numerical algorithm.. Indefinite Inner