Graph homomorphisms on rectangular matrices over
division rings II*Project 11371072 supported by National Natural Science Foundation of China**
Li-Ping Huang†††E-mail: [email protected] (L.P. Huang);
[email protected] (K. Zhao), Kang Zhao
School of Math. and Statis., Changsha University of Science and Technology, Changsha, 410004, China
Abstract
Let Dm×n be the set of m×n matrices over a division ring D. Two matrices A,B∈Dm×n are adjacent if
rank(A−B)=1. By the adjacency, Dm×n is a connected graph.
Suppose D,D′ are division rings and m,n,m′,n′≥2 are integers. We determine additive graph homomorphisms
from Dm×n to D′m′×n′. When ∣D∣≥4, we characterize the graph homomorphism
φ:Dn×n→D′m′×n′ if φ(0)=0 and there exists A0∈Dn×n such that rank(φ(A0))=n.
We also discuss properties and ranges on degenerate graph homomorphisms.
If f:Dm×n→D′m′×n′ (where min{m,n}=2) is a degenerate graph homomorphism,
we prove that the image of f is contained in a union of two maximal adjacent sets of different types.
For the case of finite fields, we obtain two better results on degenerate graph homomorphisms.
Keywords: graph homomorphism, matrix, division ring, additive graph homomorphism,
degenerate graph homomorphism, geometry of matrices
2010 AMS Classification: 05C50, 15B33, 05C60, 51A10, 51D20
1 Introduction
The study of the geometry of matrices was initiated by Hua in the mid 1940s [8, 26]. The fundamental problem in the geometry of matrices
is to characterize the transformation group of matrices by as few geometric invariants as possible. In the view of equivalence, the basic problem of the geometry of matrices
is also to study graph isomorphisms on matrices.
In 1951, Hua [8] proved the fundamental theorem of the geometry of rectangular matrices over division rings. Hua’s theorem also characterized the graph isomorphism on
rectangular matrices, and his work was continued by many scholars
(cf. [3], [9]-[19], [21], [23]-[28]).
In the algebraic graph theory, the research of graph homomorphisms is an important subject [6, 7].
Thus, it is of significance to determine graph homomorphisms on matrices.
Recently, literatures [24, 17, 23, 13, 14] discussed the graph homomorphisms on matrices over a division ring, and
these work is interesting for the geometry of matrices, the algebraic graph theory and the preserver problems.
This paper is continuation of literature [14], and our goal is further to characterize the graph homomorphism on rectangular matrices.
All mathematical symbols and definitions that are not explained, see [14].
Throughout this paper, we assume that
D,D′ are division rings, D∗=D∖{0}, and m,n,m′,n′ are positive integers.
Denote by Fq the finite field
with q elements where q is a power of a prime.
Let ∣X∣ be the cardinality of a set X. Let Dn [resp. nD] denote the left [resp. right] vector space over
D whose elements are n-dimensional row [resp. column] vectors over D.
On the basic properties of matrices over a division ring, one may see literatures [20, 26].
Let Dm×n and Drm×n denote the sets of m×n matrices and m×n matrices of rank r over D,
respectively. A matrix in Dm×n is also called a point. Denote the set of n×n invertible matrices over D by GLn(D).
Let Ir (I for short) be the r×r identity matrix, 0m,n the m×n zero matrix ([math] for short) and 0n=0n,n.
Let Eijm×n (Eij for short) denote the m×n matrix whose (i,j)-entry is 1 and all other entries are [math]’s.
Denote by tA the transpose matrix of a matrix A. If σ:D→D′ is a map and A=(aij)∈Dm×n,
we write Aσ=(aijσ) and tAσ=t(Aσ).
Let Γ(Dm×n) be the graph whose vertex set is Dm×n and
two vertices A,B∈Dm×n are adjacent if rank(A−B)=1. We write A∼B if rank(A−B)=1.
The Γ(Dm×n) is called the graph on m×n matrices over D.
Γ(Dm×n) is a connected distance transitive graph [6].
When D=Fq, Γ(Fqm×n) is also called a bilinear forms graph [2].
For A,B∈Dm×n, d(A,B):=rank(A−B) is the distance between A and B in Γ(Dm×n) (cf. [20, 26]).
The diameter of a subgraph G of Γ(Dm×n), denoted by diam(G), is the maximum distance between two distinct vertices in G.
Let φ:Dm×n→D′m′×n′ be a map. The φ is called a graph homomorphism
if A∼B implies that φ(A)∼φ(B).
The φ is called a distance preserving map if d(A,B)=d(φ(A),φ(B)) for all A,B∈Dm×n.
The φ is called a distance k preserving map if d(A,B)=k implies that d(φ(A),φ(B))=k for some fixed k.
In the geometry of matrices, a graph homomorphism [resp. graph isomorphism] is also called an adjacency preserving map
[resp. adjacency preserving bijection in both directions].
If φ:Dm×n→D′m′×n′ is a graph homomorphism, then
[TABLE]
A nonempty subset S of Dm×n is called an adjacent set if any two distinct vertices (matrices) in S are adjacent.
An adjacent set M in Dm×n is called a maximal adjacent set (maximal set for short),
if there is no adjacent set in Dm×n which properly contains M as a subset.
In graph theory, a maximal set is also called a maximal clique [2, 6].
In Dm×n, every adjacent set can be extended to a maximal set, and there are only two type of maximal sets.
For convenience, we think that a maximal set and its vertex set are equal.
Suppose that D and D′ are division rings and m,n,m′,n′≥2 are integers. Write Eij=Eijm×n and Eij′=Eijm′×n′.
For 1≤i≤m and 1≤j≤n (or 1≤i≤m′ and 1≤j≤n′), we let
[TABLE]
[TABLE]
Lemma 1.1
(cf. [26, Prpopsition 3.8])* Every maximal set M of Dm×n is one of the following forms.*
Type one. M=PM1Q+A=PM1+A, where P∈GLm(D), Q∈GLn(D) and A∈Dm×n.
Type two. M=PN1Q+A=N1Q+A, where P∈GLm(D), Q∈GLn(D) and A∈Dm×n.
For 1≤k≤min{m,n} and A∈Dm×n, we let
[TABLE]
[TABLE]
[TABLE]
The BA is called the unit ball with a central point A, and the NA is called
the neighbourhood of A.
If φ:Dm×n→D′m′×n′ is a graph homomorphism, then
φ(NA)⊆Nφ(A) and φ(BA)⊆Bφ(A) for every A∈Dm×n.
Let φ:Dm×n→D′m′×n′ be a graph homomorphism. The homomorphism φ is called degenerate,
if there exists a matrix A∈D≤1m×n and there are two maximal sets M and N of
different types in D′m′×n′, such that φ(BA)⊆M∪N
with φ(A)∈M∩N.
The homomorphism φ is called non-degenerate if it is not degenerate.
The homomorphism φ is called a (vertex) colouring if φ(Dm×n) is an adjacent set in D′m′×n′.
Every (vertex) colouring is a degenerate graph homomorphism.
It is easy to see that φ is a (vertex) colouring if and only if diam(φ(Dm×n))=1.
The word “colouring” is derived from graph theory [6].
Any distance preserving map is a non-degenerate graph homomorphism but not vice versa.
This paper is organized as follows. In Section 2, we introduce some Lemmas on maximal sets.
In Section 3, We determine additive graph homomorphisms from Dm×n to D′m′×n′.
In Section 4, we will characterize the graph homomorphism φ from Dn×n to D′m′×n′ (where ∣D∣≥4)
if there exists A0∈Dn×n such that rank(φ(A0))=n, this result extends [24, Theorem 4.1] to
the cases of two division rings and n=2.
In Section 5, we discuss the degenerate graph homomorphisms. Let f:Dm×n→D′m′×n′ (where ∣D∣≥4)
be a degenerate graph homomorphism. We prove that f(D≤1m×n) and f(BA0) are two adjacent sets,
if there exists A0∈Dm×n such that rank(f(A0))=min{m,n}. Moreover, when min{m,n}=2, the image of f is contained in
a union of two maximal sets of different types. For the case of finite fields, we obtain two better results on the degenerate graph homomorphisms.
2 Lemmas on maximal sets
In this section, we will introduce maximal sets on Dm×n and their affine geometries.
Lemma 2.1
(cf. [9, Lemma 3.2])* Let m,n,r,s be integers with 1≤r,s<min{m,n}.
Assume that α={i1,…,ir}, β={j1,…,js}, where 1≤i1<⋯<ir≤m and 1≤j1<⋯<js≤n. Let A=(aij)∈Dm×n,
Bi=∑t=1r∑k=1sbitjk(i)Eitjk∈Dm×n (where bitjk(i)∈D), i=1,2, and B1=B2.
If A∼Bi, i=1,2, then either aij=0 for all i∈/α, or aij=0 for all j∈/β.*
Using Lemmas 2.1 and 1.1, we can prove the following results.
Corollary 2.2
(cf. [26, Corollary 3.10])*
Let A and B be two adjacent points in Dm×n. Then there are exactly two maximal sets
M and M′ containing A and B. Moreover, M and M′ are of different types.*
Corollary 2.3
(cf. [9, 12, 26])*
If M and N are two distinct maximal sets of the same type [resp. different types] in Dm×n with
M∩N=∅, then ∣M∩N∣=1 [resp. |\mathcal{M}\cap\mathcal{N}|\geq 2$$].*
Lemma 2.4
(cf. [14, Lemma 3.4])* Suppose that M, N are two distinct maximal sets in Dm×n
with M∩N=∅. Then:*
(i)* if M, N are of different types, then for any A∈M∩N,
there are P∈GLm(D) and Q∈GLn(D)
such that M=PM1Q+A=PM1+A and N=PN1Q+A=N1Q+A;*
(ii)* if both M and N are of type one [resp. type two], then there exists an invertible matrix P [resp. Q$$]
such that M=PM1+A and N=PM2+A
[resp. M=N1Q+A and {\cal N}={\cal N}_{2}Q+A$$], where M∩N={A}.*
There is an axiomatic definition of the affine geometry (cf. [1, 5]). Let V be
an r-dimensional left vector subspace of Dn and a∈Dn. Then V+a is called an r-dimensional left affine flat (flat for short)
over D. When r≥2, the set of all flats in V+a is called the left affine geometry on V+a, which is denoted by AG(V+a). The dimension of AG(V+a) is r,
denoted by dim(AG(V+a))=r. The flats of dimensions 0,1,2 are called points, lines, planes in AG(V+a).
Similarly, we have the right affine geometry on a right affine flat over D.
Let M=PM1+A be a maximal set of type one in Dm×n, where P∈GLm(D) and A∈Dm×n. Then we have
a left affine geometry AG(PM1+A) such that AG(PM1+A) and AG(Dn) are affine isomorphic.
Similarly, we have a right affine geometry AG(N1Q+A) such that AG(N1Q+A) and AG(mD) are affine isomorphic,
where Q∈GLn(D) (cf. [14]).
In AG(PM1+A), the parametric equation of a line ℓ is
[TABLE]
Lemma 2.5
(cf. [26, p.95])* Let M
be a maximal set in Dm×n. Then ℓ is a line in AG(M) if and only if
ℓ=M∩N, where M and N are two maximal sets of different types with M∩N=∅.
Moreover, ∣ℓ∣=∣M∩N∣=∣D∣.*
Lemma 2.6
(see [14, Lemma 4.6])* Let m,n,m′,n′≥2 be integers. Suppose that
φ:Dm×n→D′m′×n′ is a non-degenerate graph homomorphism with φ(0)=0. Then*
if M is a maximal set of type one [resp. type two] containing [math] in Dm×n and φ(M)⊆M′, where
M′ is a maximal set in D′m′×n′, then for any A∈M, there exists a maximal set R
of type one [resp. type two] in Dm×n, such that φ(R)⊆R′ and R∩M={A},
where R′ is a maximal set in D′m′×n′, R′ and M′ are of the same type with R′=M′;
if M and N are two distinct maximal sets of the same type [resp. different types]
in Dm×n such that 0∈M and M∩N=∅, then φ(M)⊆M′
and φ(N)⊆N′,
where M′ and N′ are two maximal sets of the same type [resp. different types]
in D′m′×n′;
if M is a maximal set containing [math] in Dm×n and φ(M)⊆M′
where M′ is a maximal set in D′m′×n′,
then M′ is the unique maximal set containing φ(M), and φ(M) is not contained in any line of AG(M′).
Let S be an adjacent set in Dm×n with 0∈S and ∣S∣≥2. Then there exists a maximal set M containing S.
By Lemma 1.1, M=PM1 or M=N1Q, where P and Q are invertible matrices. Hence
P−1S⊆M1 or SQ−1⊆N1. When P−1S⊆M1
[resp. SQ−1⊆N1],
the dimension of S, denoted by dim(S), is the
number of matrices in a maximal left [resp. right] linear independent subset of P−1S [resp. SQ−1].
The dim(S) is uniquely determined by S and dim(S)≤max{m,n}.
Lemma 2.7
(see [14, Lemma 4.13])* Let D,D′ be division rings with ∣D∣≥4. Suppose φ:Dm×n→D′m′×n′
is a non-degenerate graph homomorphism with φ(0)=0. Let M be a maximal set containing [math] in Dm×n.
If φ(M)⊆M′ where M′ is a maximal set in D′m′×n′,
then the restriction map φ∣M:M→M′
is an injective weighted semi-affine map. Moreover, if S is an adjacent set in Dm×n with 0∈S
and ∣S∣≥2, then*
[TABLE]
Lemma 2.8
Let M be a maximal set in Dm×n (m,n≥2) and A∈Dm×n. Then
A∈M if and only if A is adjacent with three noncollinear points in AG(M).
*Proof. *If A∈M, it is clear that A is adjacent with three noncollinear points in AG(M).
Now, suppose that A is adjacent with three noncollinear points B1,B2,B3 in AG(M).
Then, there are P∈GLm(D) and Q∈GLn(D) such that
B2−B1=PE11Q. After by the map X↦P−1(X−B1)Q−1, we may assume with no loss of generality that B1=0 and B2=E11.
By Corollary 2.2, we have either M=M1 or M=N1.
Without loss of generality we assume that M=M1.
Clearly, ℓ={xE11:x∈D} is a line in
AG(M1) containing [math] and E11. Since 0,E11,B3 are noncollinear points in AG(M1), B3 is of the form
\scriptsize B_{3}=\left(\begin{array}[]{cc}b&\beta\\
0&0\\
\end{array}\right) where 0=β∈Dn−1. Write \scriptsize A=\left(\begin{array}[]{cc}a_{11}&A_{12}\\
A_{21}&A_{22}\\
\end{array}\right) where a11∈D. By A∼0, A∼E11 and
\scriptsize A\sim\left(\begin{array}[]{cc}b&\beta\\
0&0\\
\end{array}\right), we get
[TABLE]
It follows from Lemma 2.1 that (A21,A22)=0, and hence A∈M1.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
3 Additive graph homomorphisms on rectangular matrices
Let ϕ:Dm×n→D′m′×n′ be a map. The ϕ is called an additive map if ϕ(A+B)=ϕ(A)+ϕ(B)
for all A,B∈Dm×n. The ϕ is called an additive graph homomorphism if ϕ
is a graph homomorphism and an additive map. If ϕ is an additive graph homomorphism, then ϕ(0)=0 and
ϕ(A−B)=ϕ(A)−ϕ(B) for all A,B∈Dm×n.
The additive preserver problems on matrices is an active research area in linear algebra and the theory of matrices [29].
In the additive preserver problems, an additive graph homomorphism is also called an additive rank-1 preserving map.
When D=D′ is a field, additive rank-1 preserving maps from Dm×n to Dm′×n′ is determined by [29].
In this section, we discuss the case of division rings, and our main result is the following theorem.
Theorem 3.1
Suppose D,D′ are division rings
and m,n,m′,n′≥2 are integers. Let
ϕ:Dm×n→D′m′×n′
be an additive graph homomorphism. Then either there exist matrices P∈D′m′×m and Q∈D′n×n′ with their ranks ≥2,
and a nonzero ring homomorphism τ:D→D′, such that
[TABLE]
or there exist matrices P∈D′m′×n and Q∈D′m×n′ with their ranks ≥2,
and a nonzero ring anti-homomorphism σ:D→D′, such that
[TABLE]
or ϕ is a (vertex) colouring.
In order to prove Theorem 3.1, we need the following results.
Theorem 3.2
Suppose D,D′ are division rings and m,n,m′,n′≥2 are integers.
Let ϕ:Dm×n→D′m′×n′
be an additive graph homomorphism. If ϕ is degenerate, then ϕ is a (vertex) colouring.
*Proof. *Assume that ϕ is degenerate. Since ϕ is additive, there are two maximal sets M,N of
different types in D′m′×n′, such that ϕ(D≤1m×n)⊆M∪N
with 0∈M∩N. We show that ϕ(D≤1m×n) is an adjacent set by contradiction as follows.
Suppose ϕ(D≤1m×n) is not an adjacent set.
Then there are matrices A,B∈D1m×n such that rank(A−B)=rank(ϕ(A)−ϕ(B))=2. Let Eij=Eijm×n and Eij′=Eijm′×n′.
There are invertible matrices P1,Q1 over D such that A=P1E11Q1 and B=P1E22Q1.
Also, there are invertible matrices P2,Q2 over D′ such that P2ϕ(A)Q2=E11′ and P2ϕ(B)Q2=E22′.
Replacing ϕ by the map X⟼P2ϕ(P1XQ1)Q2, we have
[TABLE]
By Corollary 2.2, there are exactly two maximal sets containing Eii and [math] [resp. Eii′ and [math]], they are Mi and Ni
[resp. Mi′ and Ni′] (i=1,2). Thus, by (6) and ϕ(0)=0, we get that
ϕ(M1)⊆M1′ or ϕ(M1)⊆N1′. Without loss of generality, we assume ϕ(M1)⊆M1′.
From the above discussion we have ϕ(N2)⊆N2′ or ϕ(N2)⊆M2′.
Since M1∩N2=DE12 and M1′∩M2′={0}, we must have ϕ(N2)⊆N2′.
By M1′∩N2′=D′E12′, we obtain ϕ(λE12)=λ∗E12′ for all λ∈D.
Since ϕ is additive,
[TABLE]
Recall that ϕ(D≤1m×n)⊆M∪N.
Using Corollary 2.2, it is clear that
ϕ(D≤1m×n)⊆M1′∪N2′.
Since E21∼(−E11−E12−E22), ϕ(E21)∼(−E11′+(−1)∗E12′−E22′). On the other hand, by ϕ(E21)∈M1′∪N2′ and
ϕ(E21)∼Eii′ (i=1,2), we must have ϕ(E21)=bE12′ where b∈D′∗. Hence
[TABLE]
a contradiction.
Thus, ϕ(D≤1m×n) is an adjacent set. Then there is a fixed maximal set M′ containing [math] in D′m′×n′,
such that ϕ(D≤1m×n)⊆M′. Note that Y1,Y2∈M′ implies that
Y1+Y2∈M′.
Since ϕ is additive, it is clear that
ϕ(Dm×n)⊆M′, and hence ϕ is a (vertex) colouring.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Lemma 3.3
Suppose D,D′ are division rings and m,n,m′,n′≥2 are
integers. Let φ:Dm×n→D′m′×n′
be a non-degenerate graph homomorphism with φ(0)=0.
Then there exist two invertible matrices T1 and T2 over D′, and two invertible matrices \scriptsize T_{3}^{-1}=\left(\begin{array}[]{cc}1&*\\
0&*\\
\end{array}\right)\in GL_{m}(\mathbb{D}) and \scriptsize T_{4}^{-1}=\left(\begin{array}[]{cc}1&0\\
&*\\
\end{array}\right)\in GL_{n}(\mathbb{D}), such that
either
[TABLE]
or
[TABLE]
Proof. Case 1. φ(M1) is contained in a maximal set of type one. Then there exists an invertible matrix T0 over D′
such that φ(M1)⊆T0M1′.
By Lemma 2.6(a), there exists a type one maximal set M in Dm×n containing [math],
such that M=M1 and φ(M)⊆M′,
where M′ is a type one maximal set in D′m′×n′ containing [math] and M′=T0M1′.
Using Lemma 2.4, there exists T1∈GLm′(D′) such that T0M1′=T1M1′
and M′=T1M2′. Thus, φ(M1)⊆T1M1′ and φ(M)⊆T1M2′.
Since
[TABLE]
there is
\scriptsize T_{3}^{-1}=\left(\begin{array}[]{cc}1&*\\
0&*\\
\end{array}\right)\in GL_{m}(\mathbb{D}) such that M=T3−1M2 and M1=T3−1M1. Thus
[TABLE]
Similarly, there exists a type two maximal set N in Dm×n containing [math],
such that N=N1,
φ(N1)⊆N1′T2=T1N1′T2 and φ(N)⊆N2′T2=T1N2′T2,
where T2∈GLn′(D′). Moreover, there is
\scriptsize T_{4}^{-1}=\left(\begin{array}[]{cc}1&0\\
&*\\
\end{array}\right)\in GL_{n}(\mathbb{D}) such that N=N2T4−1=T3−1N2T4−1 and
N1=N1T4−1=T3−1N1T4−1.
It follows that φ(T3−1NiT4−1)⊆T1Ni′T2, i=1,2.
Clearly, T3−1Mi=T3−1MiT4−1 and T1Mi′=T1Mi′T2, i=1,2. Therefore, we obtain
[TABLE]
Case 2. φ(M1) is contained in a maximal set of type two. Similarly, there exist two invertible matrices T1 and T2 over
D′, and two invertible matrices \scriptsize T_{3}^{-1}=\left(\begin{array}[]{cc}1&*\\
0&*\\
\end{array}\right)\in GL_{m}(\mathbb{D}) and \scriptsize T_{4}^{-1}=\left(\begin{array}[]{cc}1&0\\
&*\\
\end{array}\right)\in GL_{n}(\mathbb{D}), such that φ(T3−1MiT4−1)⊆T1Ni′T2 with
φ(T3−1NiT4−1)⊆T1Mi′T2, i=1,2.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Theorem 3.4
Suppose D,D′ are division rings and m′,n′≥2 are integers. Let
ϕ:D2×2→D′m′×n′
be a non-degenerate additive graph homomorphism. Then either there exist matrices P∈GLm′(D′) and Q∈GLn′(D′),
and a nonzero ring homomorphism τ:D→D′, such that
[TABLE]
or there exist matrices P∈GLm′(D′) and Q∈GLn′(D′), and
a nonzero ring anti-homomorphism σ:D→D′, such that
[TABLE]
*Proof. *By Lemma 3.3, we may assume with no loss of generality either
ϕ(Mi)⊆Mi′ with ϕ(Ni)⊆Ni′ (i=1,2),
or ϕ(Mi)⊆Ni′ with ϕ(Ni)⊆Mi′ (i=1,2).
We prove this result only for the first case; the second case is similar.
From now on we assume that
[TABLE]
We show that ϕ is of the form (7) as follows. (For the second case, we can prove similarly ϕ is of the form (8).)
Let Eij=Eij2×2 and Eij′=Eijm′×n′. By (9) we have that ϕ(xEij)=xσijEij′ for all x∈D, i,j=1,2,
where σij:D→D′ is an additive map with 0σij=0. Since ϕ is additive, we get
[TABLE]
Without loss of generality, we assume that 1σ11=1σ22=1.
Since \scriptsize\left(\begin{array}[]{cc}x&x\\
1&1\\
\end{array}\right)\sim 0 and \scriptsize\left(\begin{array}[]{cc}1&x\\
1&x\\
\end{array}\right)\sim 0 for all x∈D,
\scriptsize\left(\begin{array}[]{cc}x^{\sigma_{11}}&x^{\sigma_{12}}\\
1^{\sigma_{21}}&1\\
\end{array}\right)\sim 0 and \scriptsize\left(\begin{array}[]{cc}1&x^{\sigma_{12}}\\
1^{\sigma_{21}}&x^{\sigma_{22}}\\
\end{array}\right)\sim 0 for all x∈D. It follows that xσ11=xσ121σ21 and xσ22=1σ21xσ12
for all x∈D. Therefore, 1=1σ211σ12=1σ121σ21 and hence 1σ12=(1σ21)−1.
Replacing the map ϕ by the map
[TABLE]
we have that 1σij=1 for i,j=1,2. Then xσ11=xσ22=xσ12
for all x∈D. Write τ=σ11.
Since \scriptsize\left(\begin{array}[]{cc}x&x\\
x&x\\
\end{array}\right)\sim 0 for all x∈D∗, \scriptsize\left(\begin{array}[]{cc}x^{\tau}&x^{\tau}\\
x^{\sigma_{21}}&x^{\tau}\\
\end{array}\right)\sim 0 for all x∈D∗, which implies that σ21=τ. Since
\scriptsize\left(\begin{array}[]{cc}xy&x\\
y&1\\
\end{array}\right)\sim 0 for all x,y∈D, \scriptsize\left(\begin{array}[]{cc}(xy)^{\tau}&x^{\tau}\\
y^{\tau}&1\\
\end{array}\right)\sim 0 for all x,y∈D.
Consequently (xy)τ=xτyτ for all x,y∈D. Thus τ is a nonzero ring homomorphism,
and hence (7) holds.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Corollary 3.5
If ϕ:D2×2→D′m′×n′ (m′,n′≥2)
is a non-degenerate additive graph homomorphism, then ϕ is a distance preserving map.
Theorem 3.6
Suppose D,D′ are division rings and m,n,m′,n′≥2 are integers. Let
ϕ:Dm×n→D′m′×n′
be a non-degenerate additive graph homomorphism. Then either there exist matrices P∈D′m′×m and Q∈D′n×n′ with their ranks ≥2,
and a nonzero ring homomorphism τ:D→D′, such that
[TABLE]
or there exist matrices P∈D′m′×n and Q∈D′m×n′ with their ranks ≥2,
and a nonzero ring anti-homomorphism σ:D→D′, such that
[TABLE]
*Proof. *By Lemma 3.3, we may assume with no loss of generality either
ϕ(Mi)⊆Mi′ with ϕ(Ni)⊆Ni′ (i=1,2),
or ϕ(Mi)⊆Ni′ with ϕ(Ni)⊆Mi′ (i=1,2).
If the first case [resp. second case] happens, we can prove that ϕ is of the form (10) [resp. (11)].
We prove this theorem only for the first case; the second case is similar. From now on we assume that
[TABLE]
By Theorem 3.4 and its proof, we may assume with no loss of generality that
[TABLE]
where τ:D→D′ is a nonzero ring homomorphism.
Write Eij=Eijm×n and Eij′=Eijm′×n′. For i∈{1,2} and j∈{3,…,n}, we let
[TABLE]
Then ψij:D2×2→D′m′×n′ is an additive graph homomorphism.
For j∈{3,…,n}, there exists some k∈{1,2} such that ψkj is non-degenerate.
Otherwise, both ψ1j and ψ2j are degenerate, and Theorem 3.2 implies that ψ1j(D2×2)
and ψ2j(D2×2) are two adjacent sets.
By Corollary 2.3, (13) and Lemma 2.5, it is easy to see that
ψ1j(D2×2)⊆N1′ and ψ2j(D2×2)⊆N2′. It follows that
ϕ(x1jE1j+x2jE2j)∈N1′∩N2′={0} for all x1j,x2j∈D, a contradiction.
Thus ψkj is non-degenerate for some k∈{1,2}.
By Theorem 3.4 and (13), we can assume that
[TABLE]
for all x1k,x1j,x2k,x2j∈D, where Pk∈GLm′(D′) is a diagonal matrix, Qj∈GLn′(D′) and
μ:D→D′ is a nonzero ring homomorphism.
Let qji=(qji(1),…,qji(n′)) be the i-th row of Qj and let Pk=diag(pk1,…,pkm′). Then (14) and (13) imply that
[TABLE]
[TABLE]
By (15), we have xτ=pk1xμqj1(k) and xτ=pk2xμqj1(k) for all x∈D. Thus pk1=pk2=(qj1(k))−1.
Let ei be the i-th row of Im′, and let ei′ be the i-th row of In′.
Write qj2′=(qj1(k))−1qj2.
Then (16) can be written as
[TABLE]
For s∈{1,2} and i∈{3,…,n}, we define
[TABLE]
Then ψsi′:D2×2→D′m′×n′ is an additive graph homomorphism.
Similarly, there exists some s∈{1,2} such that ψsi′ is non-degenerate. Similar to the proof of (17),
there is 0=pi2′∈D′m′×1 such that
[TABLE]
Recall that ψkj is non-degenerate for some k∈{1,2}.
Put i∈{3,…,m}, j∈{3,…,n} and r∈{1,2}. We let
[TABLE]
Then θij(r):D2×2→D′m′×n′ is an additive graph homomorphism.
There exists some r∈{1,2} such that θij(r) is non-degenerate. Otherwise, both θij(1) and θij(2) are degenerate.
By Theorem 3.2, we have θij(1)(D2×2)⊆M, where M is a maximal set in D′m′×n′ containing [math].
From (13) we get \scriptsize\theta_{ij}^{(1)}\left(\begin{array}[]{cc}x_{1k}&0\\
0&0\\
\end{array}\right)=x_{1k}^{\tau}E_{1k}^{\prime} for all x1k∈D. Thus, Corollaries 2.2 and 2.3 imply that
M=M1′ or M=Nk′.
Suppose that M=Nk′. Then (12) implies that
\scriptsize\theta_{ij}^{(1)}\left(\begin{array}[]{cc}x_{1k}&x_{1j}\\
0&0\\
\end{array}\right)\in\mathcal{N}_{k}^{\prime}\cap\mathcal{M}_{1}^{\prime}=\mathbb{D}^{\prime}E_{1k}^{\prime}, and hence
ϕ(E1j)=a1E1k′ where a1∈D′∗. By (15) and (16), it is easy to see that qj1 and qj2 are left
linearly dependent, a contradiction to Qj being invertible.
Therefore, we must have M=M1′ and hence θij(1)(D2×2)⊆M1′. Similarly,
θij(2)(D2×2)⊆M2′. It follows that
ϕ(xikEik+xijEij)∈M1′∩M2′={0} for all xik,xij∈D, a contradiction.
Thus, θij(r) is non-degenerate for some r∈{1,2}.
By Theorem 3.4 and (12), we have
[TABLE]
for all xrk,xrj,xik,xij∈D, where Si∈GLm′(D′), Tj∈GLn′(D′) and
δ:D→D′ is a nonzero ring homomorphism.
Let tji=(tji(1),…,tji(n′)) be the i-th row of Tj, and let Si=(si1,…,sim′) where sij
be the j-th column of Si. Then (19) and (13) imply that
[TABLE]
[TABLE]
[TABLE]
[TABLE]
By (20), there are a,b∈D′∗ such that si1=tera and tj1=bek′. Moreover, xδ=a−1xτb−1 for all x∈D.
Since 1δ=1τ=1, we get that b−1=a. Hence
[TABLE]
Therefore, for above two fixed k,r∈{1,2}, we obtain that
[TABLE]
[TABLE]
[TABLE]
By (21) and (17), we get qj2′=atj2. Thus (17) can be written as
[TABLE]
By (18) and (22), we have pi2′=si2a−1. Hence (18) can be written as
[TABLE]
Let \scriptsize P=\left({}^{t}e_{1},\,^{t}e_{2},s_{32}a^{-1},s_{42}a^{-1},\ldots,s_{m2}a^{-1}\right)=\left(\begin{array}[]{cc}I_{2}&\ast\\
0&\ast\\
\end{array}\right)\in{\mathbb{D}^{\prime}}^{m^{\prime}\times m}, and let
[TABLE]
Then rank(P)≥2 and rank(Q)≥2. By (13) with (23)-(25), we obtain that
[TABLE]
Since ϕ is additive, we get (10).
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
By Theorem 3.6 and Theorem 3.2, it is clear that Theorem 3.1 holds.
4 Graph homomorphisms on n×n matrices
In this section, we will expand [24, Theorem 4.1] (which is due to Šemrl) to the cases of two division rings and n=2.
Theorem 4.1
Let D,D′ be division rings with ∣D∣≥4,
and let m′,n′,n be integers with m′,n′≥n≥2. Suppose that
φ:Dn×n→D′m′×n′
is a graph homomorphism with φ(0)=0, and there exists A0∈Dn×n such that rank(φ(A0))=n.
Then either there exist matrices P∈GLm′(D′) and Q∈GLn′(D′),
a nonzero ring homomorphism τ:D→D′, and a matrix L∈D′n×n with the property that
In+XτL∈GLn(D′) for every X∈Dn×n, such that
[TABLE]
or there exist matrices P∈GLm′(D′) and Q∈GLn′(D′),
a nonzero ring anti-homomorphism σ:D→D′, and a matrix L∈D′n×n
with the property that In+LtXσ∈GLn(D′) for every X∈Dn×n, such that
[TABLE]
or φ(D≤1n×n) is an adjacent set.
In particular, if τ [resp. \sigma$$] is surjective, then L=0 and τ is a ring isomorphism
[resp. σ is a ring anti-isomorphism].
By Theorem 4.1, it is easy to prove the following corollary.
Corollary 4.2
Let D,D′ be division rings with ∣D∣≥4,
and let m′,n′,n be integers with m′,n′≥n≥2. Suppose that
φ:Dn×n→D′m′×n′
is a graph homomorphism, and there exist A0,B0∈Dn×n such that rank(φ(B0)−φ(A0))=n.
Then either there exist matrices P∈GLm′(D′) and Q∈GLn′(D′),
a nonzero ring homomorphism τ:D→D′, and a matrix L∈D′n×n with the property that
In+XτL∈GLn(D′) for every X∈Dn×n, such that
[TABLE]
or there exist matrices P∈GLm′(D′) and Q∈GLn′(D′),
a nonzero ring anti-homomorphism σ:D→D′, and a matrix L∈D′n×n
with the property that In+LtXσ∈GLn(D′) for every X∈Dn×n, such that
[TABLE]
or both φ(BA0) and φ(BB0) are adjacent sets.
In particular, if τ [resp. \sigma$$] is surjective, then L=0 and τ is a ring isomorphism
[resp. σ is a ring anti-isomorphism].
Note that maps (26)-(29) are distance preserving maps (cf. [14, Examples 2.5 and 2.6]. We have:
Corollary 4.3
Let D,D′ be division rings with ∣D∣≥4,
and let m′,n′,n be integers with m′,n′≥n≥2. Suppose that φ:Dn×n→D′m′×n′
is a graph homomorphism, and there exist A0,B0∈Dn×n such that rank(φ(B0)−φ(A0))=n.
Then either φ is a distance preserving map, or both φ(BA0) and
φ(BB0) are adjacent sets.
In order to prove Theorem 4.1 we need the following knowledge and lemmas.
It is well-known that Dm×n (m,n≥2) is a partially ordered set (poset) with partial order defined by
A≤B if rank(B−A)=rank(B)−rank(A). This partial order is also called minus order (or minus partial order) of Dm×n
(cf. [22]). In particular, we write A<B ⇔ A≤B with A=B.
For any X∈Dm×n, a g-inverse of X will be denoted by X− and is understood as a matrix (over D)
for which XX−X=X.
Two matrices A,B∈Dm×n are said to be equivalent, denoted by A≅B, if B may be obtained from
A by a finite sequence of elementary row and column operations.
Lemma 4.4
(cf. [22, Section 3.3])* Let D be a division ring and let A,B∈Dm×n.
Then the following results are equivalent:*
A≤B;
there are g-inverses G1 and G2 of A such that AG1=BG1 and G2A=G2B;
there are P∈GLm(D) and Q∈GLn(D) such that
B=Pdiag(Ir+s,0)Q and
A=Pdiag(Ir,0)Q;
PAQ≤PBQ, where P∈GLm(D) and Q∈GLn(D).
Lemma 4.5
(see [22, Theorem 3.6.5])* Let A,B∈Dn×n with B2=B. Then A≤B if and only if A=A2=AB=BA.*
Lemma 4.6
Let A,B,C∈Dm×n and
d(A,B)=d(B,C)−d(A,C). Suppose that φ:Dm×n→D′m′×n′ is a graph homomorphism and
d(B,C)=d(φ(B),φ(C)). Then d(φ(A),φ(B))=d(φ(B),φ(C))−d(φ(A),φ(C)).
*Proof. *We have
d(φ(A),φ(B))≤d(A,B)=d(B,C)−d(A,C)=d(φ(B),φ(C))−d(A,C)≤d(φ(B),φ(C))−d(φ(A),φ(C)).
Hence
[TABLE]
On the other hand, it is clear that d(φ(A),φ(B))≥d(φ(B),φ(C))−d(φ(A),φ(C)).
Thus d(φ(A),φ(B))=d(φ(B),φ(C))−d(φ(A),φ(C)).
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Corollary 4.7
Let
φ:Dm×n→D′m′×n′ be a graph homomorphism with φ(0)=0, and let
A,B∈Dm×n.
If A≤B and rank(φ(B))=rank(B), then φ(A)≤φ(B) and rank(φ(A))=rank(A).
*Proof. *Assume that A≤B and rank(φ(B))=rank(B). Then d(A,B)=d(B,0)−d(A,0) and d(B,0)=d(φ(B),φ(0)).
By Lemma 4.6, d(φ(A),φ(B))=d(φ(B),φ(0))−d(φ(A),φ(0)), hence φ(A)≤φ(B).
It follows that rank(φ(A))=d(φ(A),φ(0))=d(φ(B),φ(0))−d(φ(A),φ(B))≥rank(B)−d(A,B)=rank(A).
Since rank(φ(A))≤rank(A), we obtain rank(φ(A))=rank(A).
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Lemma 4.8
Let D,D′ be division rings, and let n,m′,n′ be integers with m′,n′≥n≥2.
Suppose that φ:Dn×n→D′m′×n′
is a graph homomorphism with φ(0)=0, and there exists A0∈Dn×n such that d(φ(A0),0)=n.
Assume that M is a maximal set in Dn×n containing [math] and φ(M)⊆M′
where M′ is a maximal set in D′m′×n′.
Then φ(M) is not contained in any line in AG(M′), and
M′ is the unique maximal set containing φ(M) in D′m′×n′.
*Proof. *Without loss of generality, we assume that M is a maximal set of type two, and M′ is a maximal set of type one.
By Lemma 1.1, there are invertible matrices P1,P2 such that M=N1P1
and M′=P2M1′. Replacing φ by the map X↦P2−1φ(XP1),
we have M=N1, M′=M1′ and φ(N1)⊆M1′.
Suppose φ(N1) is contained in a line ℓ in AG(M1′). We show a contradiction as follows.
By the parametric equation of a line, there exists an invertible matrix Q such that ℓ=(D′E11+B)Q, where E11=E11m′×n′
and B∈M1′. Since 0∈ℓ, we can assume that B=0 and ℓ=D′E11Q.
Replacing φ by the map X↦φ(X)Q−1,
we have φ(0)=0 and φ(N1)⊆ℓ=D′E11.
By the conditions, there is an A0∈Dn×n such that d(φ(A0),0)=n=d(A0,0).
Let A0=(B1,B2) where B1∈D2n×2 and B2∈Dn−2n×(n−2).
When n=2, B2 is absent.
Put A1=(B1,0)∈D2n×n.
Then A1≤A0. Using Corollary 4.7, we get rank(φ(A1))=2.
Clearly, there are two distinct points Y1,Y2∈N1 such that A1∼Yi, i=1,2. Since φ(Yi)⊆ℓ,
φ(A1) are adjacent to two distinct points in D′E11. By Lemma 2.1,
φ(A1)∈M1′ or φ(A1)∈N1′, and
hence rank(φ(A1))≤1, a contradiction.
Thus φ(N1) is not contained in any line of AG(M1′). By Corollary 2.3 and Lemma 2.5,
it is easy to see that M′ is the unique maximal set containing φ(M).
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Lemma 4.9
(cf. [24])* Let D,D′ be division rings,
and let m′,n′,n be integers with m′,n′≥n≥2. Suppose that
φ:Dn×n→D′m′×n′
is a graph homomorphism with φ(0)=0 and rank(φ(In))=n.
Then there exist invertible matrices P∈GLm′(D′) and Q∈GLn′(D′) such that*
[TABLE]
*Proof. *Since diag(In−1,0)<In and rank(φ(In))=n, from Corollary 4.7 we get that
[TABLE]
Using Lemma 4.4(c), there exist Q1∈GLm′(D′) and Q2∈GLn′(D′) such that
φ(In)=Q1diag(In,0)Q2 and φ(diag(In−1,0))=Q1diag(In−1,0)Q2.
Replacing φ by the map X↦Q1−1φ(X)Q2−1, we have that φ(In)=diag(In,0) and
φ(diag(In−1,0))=diag(In−1,0m′−n+1,n′−n+1).
Now, let n≥3. Since diag(In−2,0)<diag(In−1,0),
Corollary 4.7 implies that rank(φ(diag(In−2,0))=n−2 and
[TABLE]
Write \scriptsize\varphi\left({\rm diag}(I_{n-2},0)\right)=\left(\begin{array}[]{cc}A_{11}&A_{12}\\
A_{21}&A_{22}\\
\end{array}\right) where A11∈D′(n−1)×(n−1).
By (31), Lemma 4.5 and multiplications of matrices,
it is easy to see that A12=0, A21=0 and A11 is an idempotent matrix.
(Note that when m′=n′ and using Lemma 4.5, we can get two suitable square matrices by adding some zero elements
on φ(diag(In−2,0)) and diag(In−1,0m′−n+1,n′−n+1).)
Since φ(diag(In−2,0))∼diag(In−1,0m′−n+1,n′−n+1), we have A22=0. Hence
φ(diag(In−2,0))=diag(A11,0m′−n+1,n′−n+1), where A11 is an idempotent matrix of rank n−2.
There is T∈GLn−1(D′) such that A11=T−1diag(In−2,0)T. Let Q3=diag(T−1,Im′−n+1) and
Q4=diag(T,In′−n+1). Replacing φ by the map X↦Q3−1φ(X)Q4−1, we get that
φ(In)=diag(In,0m′−n,n′−n), φ(diag(In−1,0))=diag(In−1,0m′−n+1,n′−n+1) and
φ(diag(In−2,0))=diag(In−2,0m′−n+2,n′−n+2).
Similarly, after by some transformations of the form X↦P′φ(X)Q′, we can get
φ(diag(Ir,0))=diag(Ir,0m′−r,n′−r), r=1,…,n. Thus (30) holds.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
A graph homomorphism φ:Dm×n→D′m′×n′
with φ(0)=0 is called to satisfy Condition (I), if for any two maximal sets M and N of different types
in Dm×n with 0∈M∩N, there are two maximal sets M′ and N′ of different types
in D′m′×n′, such that φ(M)⊆M′ and φ(N)⊆N′.
Lemma 4.10
Let D,D′ be division rings,
and let m′,n′,n be integers with m′,n′≥n≥2. Suppose that
φ:Dn×n→D′m′×n′
is a graph homomorphism with φ(0)=0, and there exists A0∈Dn×n such that rank(φ(A0))=n.
Assume further that φ satisfies the Condition (I). Then
[TABLE]
*Proof. *By φ(0)=0 and (1), A0 is invertible.
Replacing φ by the map X↦φ(A0−1X), we can assume that A0=In.
By Lemma 4.9, there exist invertible matrices P∈GLm′(D′) and Q∈GLn′(D′) such that
φ(diag(Ir,0))=Pdiag(Ir,0)Q, r=1,…,n.
Replacing φ by the map X↦P−1φ(X)Q−1, we get that
[TABLE]
Write Eij=Eijn×n and Eij′=Eijm′×n′.
Note that φ(E11)=E11′. Since φ satisfies the Condition (I), from Corollary 2.2
we have either φ(M1)⊆M1′ with φ(N1)⊆N1′, or
φ(M1)⊆N1′ with φ(N1)⊆M1′. We prove (32) only for the first case;
the second case is similar. From now on we assume that
[TABLE]
For any x∈D∗, by φ(M1)⊆M1′, we can assume that \scriptsize\varphi(E_{11}+xE_{12})=\left(\begin{array}[]{ccc}1^{*}&x^{\sigma_{1}}&0^{*}\\
0&0&0\\
\end{array}\right). Since E11+xE12∼E11+E22,
it follows from (33) that
\scriptsize{\rm rank}\left(\begin{array}[]{ccc}1^{*}-1&x^{\sigma_{1}}&0^{*}\\
0&-1&0\\
\end{array}\right)=1. Thus 1∗=1 and 0∗=0.
Therefore,
[TABLE]
where σ1:D→D′ is an injective map with 0σ1=0.
Similarly, we have
[TABLE]
where μ1:D→D′ is an injective map with 0μ1=0.
For 2≤k≤n and xi,yi∈D (i=2,…,k), we have E11+x2E12+⋯+xkE1k<diag(Ik,0) and
E11+y2E21+⋯+ykEk1<diag(Ik,0).
Thus Corollary 4.7 and (33) imply that φ(E11+x2E12+⋯+xkE1k)<diag(Ik,0m′−k,n′−k)
and φ(E11+y2E21+⋯+ykEk1)<diag(Ik,0m′−k,n′−k).
Using (34), it is easy to see that
[TABLE]
[TABLE]
where xj∗, yj∗∈D′, j=2,…,k. Moreover, by φ(E11)=E11′ and the adjacency,
(x2,…,xk)=0 [resp. t(y2,…,yk)=0] if and only if
(x2∗,…,xk∗)=0 [resp. t(y2∗,…,yk∗)=0].
For any 1≤r≤n−2 and 2≤k≤n−r,
we let \scriptsize A_{k}=E_{11}^{k\times k}+x_{2}E_{12}^{k\times k}+\cdots+x_{k}E_{1k}^{k\times k}=\left(\begin{array}[]{cc}1&\alpha_{k}\\
0&0\\
\end{array}\right),
where xi∈D and αk:=(x2,…,xk)=0. Then Ak is a k×k idempotent matrices of rank one.
By Corollary 4.7 and (33), we have that
[TABLE]
and rank(φ(diag(Ir,Ak,0)))=r+1.
Write \scriptsize\varphi\left({\rm diag}\left(I_{r},A_{k},0\right)\right)=\left(\begin{array}[]{cc}A_{11}&A_{12}\\
A_{21}&A_{22}\\
\end{array}\right) where A11∈D′(r+k)×(r+k).
By (33), φ(diag(Ir,Ak,0)) is adjacent with both diag(Ir+1,0)
and diag(Ir,0). It follows from Lemma 2.1 that A22=0.
By φ(diag(Ir,Ak,0))<diag(Ir+k,0) and
Lemma 4.5, we get that A12=0, A21=0 and A11 is an idempotent matrix of rank r+1.
(Note that when m′=n′ and using Lemma 4.5, we can get two suitable square matrices by adding some zero elements
on φ(diag(Ir,Ak,0)) and diag(Ir+k,0).)
Thus φ(diag(Ir,Ak,0))=diag(A11,0).
Write \scriptsize A_{11}=\left(\begin{array}[]{cc}B_{11}&B_{12}\\
B_{21}&B_{22}\\
\end{array}\right) where B11∈D′r×r and B22∈D′k×k.
Using diag(Ir,0k)<A11 and Lemma 4.5,
we have similarly that B12=0 and B21=0. By B22=0 and diag(Ir,0k)∼A11, it is clear that B11=Ir.
Therefore, we obtain
[TABLE]
where B22∈D′k×k is an idempotent matrix of rank one.
Since diag(Ir,Ak,0)∼diag(Ir+1,0), diag(Ir,B22,0)∼diag(Ir+1,0),
and hence B22∼E11k×k.
By Lemma 2.1, we obtain either \scriptsize B_{22}=\left(\begin{array}[]{cc}1&\alpha_{k}^{*}\\
0&0\\
\end{array}\right) or
\scriptsize B_{22}=\left(\begin{array}[]{cc}1&0\\
{}^{t}\alpha_{k}^{*}&0\\
\end{array}\right), where 0=αk∗∈D′k−1.
Since E11+Er+1,1≤diag(Ir,Ak,0), Corollary 4.7 implies that
φ(E11+Er+1,1)≤φ(diag(Ir,Ak,0)).
From (38) we must have \scriptsize B_{22}=\left(\begin{array}[]{cc}1&\alpha_{k}^{*}\\
0&0\\
\end{array}\right).
Therefore, for any 0=αk∈Dk−1, there is 0=αk∗∈D′k−1 such that
[TABLE]
Similarly, for any 0=βk∈k−1D, there is 0=βk∗∈k−1D′ such that
[TABLE]
For any 2≤k≤n, by (37) we write
[TABLE]
where a1j(k)∈D′ and (a12(k),…,a1k(k))=(0,…,0).
From (35) we have a12(2)=0.
We prove a1k(k)=0 (3≤k≤n) as follows. For any 3≤k≤n and 2≤r<k,
by (39), we let
[TABLE]
where arj(k)∈D′ and (ar,r+1(k),…,ark(k))=(0,…,0).
By (33) and the adjacency, when r=k−1 we have ak−1,k(k)=0.
We show ark(k)=0, r=2,…,k−2.
Since
φ(E11+⋯+Ek−1,k−1+Ek−1,k)∼φ(E11+⋯+Ek−2,k−2+Ek−2,k−1+Ek−2,k),
we get
[TABLE]
which implies that \small{\rm rank}\left(\begin{array}[]{cc}a_{k-2,k-1}^{(k)}&a_{k-2,k}^{(k)}\\
1&a_{k-1,k}^{(k)}\\
\end{array}\right)=1. By (ak−2,k−1(k),ak−2,k(k))=(0,0) and ak−1,k(k)=0,
we have ak−2,k(k)=0.
Since
φ(E11+⋯+Ek−2,k−2+Ek−2,k−1+Ek−2,k)∼φ(E11+⋯+Ek−3,k−3+∑j=k−2kEk−3,j),
one has
[TABLE]
Similarly, we have ak−3,k(k)=0.
In the similar way, we can prove that ak−4,k(k)=0, …, a2k(k)=0.
Since
φ(E11+∑j=2kE1j)∼φ(E11+E22+∑j=3kE2j),
E11′+∑j=2ka1j(k)E1j′∼E11′+E22′+∑j=3ka2j(k)E2j′.
It follows that
[TABLE]
By (a12(k),…,a1k(k))=(0,…,0) and a2k(k)=0, we must have a1k(k)=0.
Therefore, we have proved that
[TABLE]
Let γ1=E11, γk=E11+∑j=2kE1j, γ1∗=E11′ and
γk∗=E11′+∑j=2ka1j(k)E1j′, k=2,…,n. Then
γi∈M1, γi∗∈M1′, γ1,…,γn are left linearly independent over D,
and γ1∗,…,γn∗ are left linearly independent over D′.
By (41) we have φ(γk)=γk∗, k=1,…,n, and hence dim(φ(M1))≥n.
By Lemma 2.7, we get dim(φ(M1))≤n.
Hence dim(φ(M1))=n.
Similarly, we can prove dim(φ(N1))=n. Hence dim(φ(M1))=dim(φ(N1))=n.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Lemma 4.11
Let D,D′ be division rings,
and let m′,n′,n be integers with m′,n′≥n≥2. Suppose that
φ:Dn×n→D′m′×n′
is a graph homomorphism with φ(0)=0, and there exists A0∈Dn×n such that rank(φ(A0))=n.
Assume further that φ does not satisfies the Condition (I). Then there exist two
maximal sets M′ and N′ of different types in D′m′×n′ such that
φ(D≤1n×n)⊆M′∪N′. Moreover, if ∣D∣≥4,
then φ(D≤1n×n) is an adjacent set.
*Proof. *Step 1. Since φ does not satisfies the Condition (I), there are two maximal sets M and R of different types
in Dm×n with 0∈M∩R, such that φ(M)⊆M′ and φ(R)⊆R′,
where M′ and R′ are two maximal sets of the same type containing [math] in D′m′×n′.
Since ∣M∩R∣≥2, ∣M′∩R′∣≥2. It follows from Lemma 2.3 that M′=R′. Thus
[TABLE]
Without loss of generality, we assume that both M and M′ are of type one. Hence R is of type two.
By Lemma 2.6(b), every non-degenerate graph homomorphism satisfies the Condition (I). Thus φ is degenerate.
We prove that there exist a type two maximal set N′ such that
φ(D≤1n×n)⊆M′∪N′ as follows.
Suppose φ(D≤1n×n) is an adjacent set. By (42) and Lemma 4.8, it is easy to see that
φ(D≤1n×n)⊆M′.
Now, suppose φ(D≤1n×n) is not an adjacent set.
Then there exists a type one maximal set N containing [math] in Dn×n, such that M=N,
φ(N)⊆N′ and N′=M′, where N′ is a maximal set containing [math] in D′m′×n′.
Otherwise, for any type one maximal set N containing [math] in Dn×n,
we have φ(N)⊆M′. Since every matrix in D≤1n×n is contained in some type one maximal set containing [math],
we get φ(D≤1n×n)⊆M′, a contradiction to assumption.
By Corollary 2.3, we have ∣N∩R∣≥2, hence
∣N′∩M′∣≥2. It follows that N′ is of type two.
Let S be any type two maximal set containing [math] in Dn×n, and let φ(S)⊆S′
where S′ is a maximal set containing [math] in D′m′×n′.
By Corollary 2.3, we have
∣S∩M∣≥2 and ∣S∩N∣≥2, hence
∣S′∩M′∣≥2 and ∣S′∩N′∣≥2. Applying Corollary 2.3 again, we get either
S′=M′ or S′=N′, and hence S′⊆M′∪N′.
Consequently, φ(S)⊆M′∪N′ for any type two maximal set S containing [math] in Dn×n.
Since every matrix in D≤1n×n is contained in some type two maximal set containing [math],
we get φ(D≤1n×n)⊆M′∪N′.
Therefore, we always have
[TABLE]
Step 2. From now on we assume ∣D∣≥4. In this step, we will prove that φ(D≤1n×n) is an adjacent set.
By Lemma 2.4(i), there are two invertible matrices P1 and Q1 over D, such that
M=P1M1Q1 and R=P1N1Q1. Also, there is an invertible matrix P2 over D′, such that
M′=P2M1′. Replacing φ by the map X↦P2−1φ(P1XQ1), (42) becomes
[TABLE]
Suppose that φ(D≤1n×n) is not an adjacent set. We show a contradiction as follows.
There exists a type one maximal set R1 containing [math] in Dn×n with R1=M1, such that
φ(R1)⊈M1′. Otherwise, for any type one maximal set R1 containing [math] in Dn×n,
we have φ(R1)⊆M1′. Since every matrix in D≤1n×n is contained in some type one maximal set containing [math],
we get φ(D≤1n×n)⊆M1′, a contradiction.
By (43), it is easy to see that
[TABLE]
Using Lemma 2.4(ii), there is P3∈GLm(D) such that R1=P3M2 and M1=P3M1.
On the other hand, there is Q2∈GLn′(D′) such that N′=N1′Q2. Modifying the map φ by the map
X↦φ(P3X)Q2−1.
We get φ(M2)⊆N1′ and (44) holds. Therefore, we may assume that
[TABLE]
By the conditions of this lemma, there exists A0∈GLn(D) such that rank(φ(A0))=n.
Write
\scriptsize A_{0}=\left(\begin{array}[]{c}\alpha_{1}\\
\vdots\\
\alpha_{n}\\
\end{array}\right)=\left(\beta_{1},\ldots,\beta_{n}\right) where αi∈Dn and βi∈nD;
\scriptsize\varphi(A_{0})=\left(\begin{array}[]{cc}A_{11}&A_{12}\\
A_{21}&A_{22}\\
\end{array}\right) where A11∈D′1×1 and A22∈D′(m′−1)×(n′−1).
Let \scriptsize B=\left(\begin{array}[]{c}\alpha_{1}\\
0_{n-1,n}\\
\end{array}\right), C=(β1,0,…,0) and \scriptsize J_{n}=\left(\begin{array}[]{ccc}0&0&1\\
0&I_{n-2}&0\\
1&0&0\\
\end{array}\right).
Then B<A0 and C<A0. By Corollary 4.7, we have φ(B)<φ(A0) and φ(C)<φ(A0).
Since φ(B)∈M1′ and φ(C)∈N1′, it is clear that
[TABLE]
By (46) and rank(φ(A0))=n, we have either A22≅diag(In−1,0)
or A22≅diag(In−2,0). By appropriate elementary row
and column operations on matrices, we can obtain either diag(In,0) (if A22≅diag(In−1,0)) or
diag(Jn,0) (if A22≅diag(In−2,0)) from φ(A0). Since our matrix elementary
operations do not change N1′ and M1′, (45) still holds.
Thus, without loss of generality we may assume either φ(A0)=diag(In,0) or φ(A0)=diag(Jn,0).
Case 1. φ(A0)=diag(In,0).
Since \scriptsize\left(\begin{array}[]{c}0\\
\alpha_{2}+\lambda\alpha_{1}\\
0_{n-2,n}\\
\end{array}\right)<A_{0} for all λ∈D∗, Corollary 4.7 implies that
\scriptsize\varphi\left(\begin{array}[]{c}0\\
\alpha_{2}+\lambda\alpha_{1}\\
0_{n-2,\,n}\\
\end{array}\right)<\varphi(A_{0}), λ∈D∗. Thus φ(M2)⊆N1′ implies that
\scriptsize\varphi\left(\begin{array}[]{c}0\\
\alpha_{2}+\lambda\alpha_{1}\\
0_{n-2,\,n}\\
\end{array}\right)=\left(\begin{array}[]{cc}1&0\\
Z_{\lambda}&0_{m^{\prime}-1,n^{\prime}-1}\\
\end{array}\right), where Zλ∈m′−1D′, λ∈D∗.
Since \scriptsize\varphi\left(\begin{array}[]{c}\lambda^{-1}\alpha_{2}+\alpha_{1}\\
0\\
0_{n-2,n}\\
\end{array}\right)<\varphi(A_{0}) for all λ∈D∗, it follows from φ(M1)⊆M1′ that
\scriptsize\varphi\left(\begin{array}[]{c}\lambda^{-1}\alpha_{2}+\alpha_{1}\\
0\\
0_{n-2,n}\\
\end{array}\right)=\left(\begin{array}[]{cc}1&T_{\lambda}\\
0&0\\
\end{array}\right),
where Tλ∈D′n′−1, λ∈D∗. By ∣D∗∣≥3 and
the adjacency, there is λ0∈D∗
such that Zλ0=0 and Tλ0=0.
By \scriptsize\varphi\left(\begin{array}[]{c}\lambda^{-1}_{0}\alpha_{2}+\alpha_{1}\\
0\\
0\\
\end{array}\right)\sim\varphi\left(\begin{array}[]{c}0\\
\alpha_{2}+\lambda_{0}\alpha_{1}\\
0_{n-2,n}\\
\end{array}\right), we obtain \scriptsize\left(\begin{array}[]{cc}1&T_{\lambda_{0}}\\
0&0\\
\end{array}\right)\sim\left(\begin{array}[]{cc}1&0\\
Z_{\lambda_{0}}&0_{m^{\prime}-1,n^{\prime}-2}\\
\end{array}\right), a contradiction.
Case 2. φ(A0)=diag(Jn,0).
By \scriptsize\left(\begin{array}[]{c}\alpha_{1}+\alpha_{2}\\
0\\
0_{n-2,n}\\
\end{array}\right)<A_{0} and Corollary 4.7,
\scriptsize\varphi\left(\begin{array}[]{c}\alpha_{1}+\alpha_{2}\\
0\\
0_{n-2,n}\\
\end{array}\right)<\varphi(A_{0}). It follows from φ(M1)⊆M1′ that
\scriptsize\varphi\left(\begin{array}[]{c}\alpha_{1}+\alpha_{2}\\
0\\
0_{n-2,n}\\
\end{array}\right)=\left(\begin{array}[]{ccc}\alpha&1&0\\
0&0&0\\
0&0&0_{m^{\prime}-n,n^{\prime}-n}\\
\end{array}\right) where α∈D′n−1.
Since \scriptsize\left(\begin{array}[]{c}0\\
\alpha_{1}+\alpha_{2}\\
0_{n-2,\,n}\\
\end{array}\right)<A_{0} and Corollary 4.7,
\scriptsize\varphi\left(\begin{array}[]{c}0\\
\alpha_{1}+\alpha_{2}\\
0_{n-2,n}\\
\end{array}\right)<\varphi(A_{0}). By φ(M2)⊆N1′, we get
\scriptsize\varphi\left(\begin{array}[]{c}0\\
\alpha_{1}+\alpha_{2}\\
0_{n-2,n}\\
\end{array}\right)=\left(\begin{array}[]{ccc}\beta&0&0\\
1&0&0\\
0&0&0_{m^{\prime}-n,n^{\prime}-n}\\
\end{array}\right) where β∈n−1D′.
Since \small\varphi\left(\begin{array}[]{c}\alpha_{1}+\alpha_{2}\\
0\\
0_{n-2,n}\\
\end{array}\right)\sim\varphi\left(\begin{array}[]{c}0\\
\alpha_{1}+\alpha_{2}\\
0_{n-2,n}\\
\end{array}\right),
\small\left(\begin{array}[]{ccc}\alpha&1&0\\
0&0&0\\
0&0&0_{m^{\prime}-n,n^{\prime}-n}\\
\end{array}\right)\sim\left(\begin{array}[]{ccc}\beta&0&0\\
1&0&0\\
0&0&0_{m^{\prime}-n,n^{\prime}-n}\\
\end{array}\right),
a contradiction.
Thus both Case 1 and Case 2 cannot occur. It follows that φ(D≤1n×n) is an adjacent set.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Lemma 4.12
Let D,D′ be division rings with ∣D∣≥4,
and let m′,n′,n be integers with m′,n′≥n≥2. Suppose that
φ:Dn×n→D′m′×n′
is a graph homomorphism with φ(0)=0, and there exists A0∈Dn×n such that rank(φ(A0))=n.
Assume further that φ satisfies the Condition (I). Then φ is non-degenerate.
*Proof. * We prove that φ is non-degenerate by contradiction.
Suppose that φ is degenerate. Then there exists a matrix A∈D≤1n×n and there are two
maximal sets R and S of different types in D′m′×n′ such that
[TABLE]
Without loss of generality, we assume that R is of type one and S is of type two.
By rank(φ(A0))=n and (1), we have rank(A0)=n. Since d(φ(A),0)≤1, we have either d(φ(A0),φ(A))=n or d(φ(A0),φ(A))=n−1.
Note either d(A0,A)=n or d(A0,A)=n−1. Let Eij=Eijn×n and Eij′=Eijm′×n′.
We distinguish the following cases to show a contradiction.
Case 1. d(A0,A)=n and d(φ(A0),φ(A))=n−1. Then rank(φ(A))=rank(A)=1 and φ(A)<φ(A0).
By Lemma 4.4(c), there are invertible matrices P1,Q1 over D′ such that
φ(A)=P1E11′Q1 and φ(A0)=P1diag(In,0)Q1.
Also, there are invertible matrices P2,Q2 over D such that P2AQ2=E11. Let
\scriptsize P_{2}A_{0}Q_{2}=\left(\begin{array}[]{cc}A_{11}&A_{12}\\
A_{21}&A_{22}\\
\end{array}\right) where A11∈D1×1 and A22∈D(n−1)×(n−1),
Put
\scriptsize J_{n}=\left(\begin{array}[]{ccc}0&0&1\\
0&I_{n-2}&0\\
1&0&0\\
\end{array}\right).
By rank(A0)=rank(A0−A)=n, it is clear that A22≅In−1
or A22≅diag(In−2,0).
Using appropriate elementary row and column operations on matrices, we can obtain either diag(a,In−1) where a∈/{0,1} (if A22≅In−1)
or Jn (if A22≅diag(In−2,0)) from P2A0Q2. Moreover, P2AQ2=E11 is unchanged.
Thus, there are invertible matrices P3,Q3 over D, such that P3AQ3=E11 and either P3A0Q3=diag(a,In−1)
or P3A0Q3=Jn.
Replacing φ by the map X↦P1−1φ(P3−1XQ3−1)Q1−1, we have that
A=E11, and either A0=diag(a,In−1) or A0=Jn. Moreover,
φ(E11)=E11′ and φ(diag(a,In−1))=diag(In,0).
On the other hand, (47) becomes
φ(D≤1n×n+E11)⊆R∪S with φ(E11)=E11′∈R∩S.
Recall that φ satisfies the Condition (I). By φ(E11)=E11′, φ(0)=0 and Corollary 2.2, we may assume with no loss of generality that
[TABLE]
Since M1,N1⊆D≤1n×n+E11,
we get that φ(M1)⊆M1′∩(R∪S)
and φ(N1)⊆N1′∩(R∪S).
Suppose that M1′=R. Then M1′∩(R∪S)=M1′∩S, thus
ℓ:=M1′∩S is a line in AG(M1′) and φ(M1′)⊆ℓ, a contradiction to Lemma 4.8.
Therefore, we must have M1′=R. Similarly, N1′=S. It follows that
[TABLE]
Subcase 1.1. A0=diag(a,In−1). By (48), we have φ(aE11)=a∗E11′ where a∗∈D′∗.
Since aE11<A0, Corollary 4.7 implies that φ(aE11)<φ(A0)=diag(In,0). Consequently, a∗=1 and hence
φ(aE11)=E11′, a contradiction to φ(aE11)∼φ(E11).
Subcase 1.2. A0=Jn. By (49), we get φ(Enn+E11)∈M1′∪N1′.
Without loss of generality, we assume that φ(Enn+E11)∈M1′. Since d(Enn+E11,Jn)=n−1,
d(φ(Enn+E11),diag(In,0))≤n−1. It follows that
\scriptsize\varphi(E_{nn}+E_{11})=\left(\begin{array}[]{cc}1&\alpha\\
0&0\\
\end{array}\right), where 0=α∈D′n′−1 because φ(Enn+E11)∼φ(E11)=E11′.
Since d(En1+E11,Jn)=n−1,
d(φ(En1+E11),diag(In,0))≤n−1. Thus φ(N1)⊆N1′ implies that
\scriptsize\varphi(E_{n1}+E_{11})=\left(\begin{array}[]{cc}1&0\\
\beta&0\\
\end{array}\right), where 0=β∈m′−1D′ because φ(En1+E11)∼φ(E11).
Since φ(Enn+E11)∼φ(En1+E11), one gets
\scriptsize\left(\begin{array}[]{cc}1&\alpha\\
0&0\\
\end{array}\right)\sim\left(\begin{array}[]{cc}1&0\\
\beta&0\\
\end{array}\right), a contradiction.
By Subcases 1.1-1.2, we always have a contradiction in Case 1.
Case 2. d(A0,A)=n and d(φ(A0),φ(A))=n. Let ψ(X)=φ(X+A)−φ(A), X∈Dn×n. Then
ψ:Dn×n→D′m′×n′
is a graph homomorphism with ψ(0)=0 and rank(ψ(A0−A))=n. Moreover, from (47) we have
[TABLE]
where R′=R−φ(A) is a maximal set of type one, and S′=S−φ(A) is a maximal set of type two.
Subcase 2.1. ψ satisfies the Condition (I). Then, by Lemma 4.10 we have
[TABLE]
By Lemma 1.1, without loss of generality, we may assume either φ(M1)⊆M1′ with φ(N1)⊆N1′, or
φ(M1)⊆N1′ with φ(N1)⊆M1′. We prove this result only for the first case;
the second case is similar. From now on we assume that
[TABLE]
By (50) and (52), one has ψ(M1)⊆M1′∩(R′∪S′)
and ψ(N1)⊆N1′∩(R′∪S′). Clearly, M1′∩R′={0}=N1′∩S′.
We assert M1′=R′. Otherwise, we have that M1′=R′ and
ψ(M1)⊆M1′∩(R′∪S′)=M1′∩S′.
Hence Lemma 2.5 implies that ℓ:=M1′∩S′ is a line in AG(M1′), a contradiction to Lemma 4.8.
Similarly, N1′=S′. Therefore,
[TABLE]
By ψ satisfying the Condition (I) and ψ(M1)⊆M1′, ψ maps any type two maximal set containing [math]
into a type two maximal set. Thus (53) and Lemma 4.8 imply that ψ maps any type two maximal set containing [math]
into N1′. By (51), let {B1,…,Bn} be a maximal left linear independent subset in ψ(M1),
and let ψ(Ci)=Bi where Ci∈M1, i=1,…,n. Since Ci∼0 and ψ satisfies the Condition (I),
there is a type two maximal set Ri containing Ci and [math] in Dn×n, such that
ψ(Ri)⊆N1′, i=1,…,n. Thus, {B1,…,Bn}⊂(M1′∩N1′)=D′E11′,
a contradiction.
Subcase 2.2. ψ does not satisfies the Condition (I). By Lemma 4.11,
ψ(D≤1n×n) is an adjacent set. Thus φ(BA) is an adjacent set.
Then, there is a maximal set M′ containing φ(A) in D′m′×n′, such that
[TABLE]
Without loss of generality, we assume that M′ is of type one.
Since rank(A)≤1,
there is a type one maximal set MA [resp. type two maximal set SA] containing A and [math] in Dn×n.
Since φ satisfies the Condition (I), there are two maximal sets MA′ and SA′ of different types
in D′m′×n′, such that φ(MA)⊆MA′ and φ(SA)⊆SA′.
Without loss of generality, we assume that MA′ is of type one and SA′ is of type two.
Since SA⊆D≤1n×n+A,
it follows from (54) that φ(SA)⊆(SA′∩M′).
By Lemma 2.5, ℓ:=SA′∩M′ is a line in AG(SA′), a contradiction to Lemma 4.8.
Therefore, there is always a contradiction in Case 2.
Case 3. d(A0,A)=n−1. Then A<A0. Since rank(φ(A0))=rank(A0)=n and
Corollary 4.7, we get φ(A)<φ(A0).
By Lemma 4.4(c), there are invertible matrices P1,Q1 over D such that A=P1E11Q1 and A0=P1InQ1,
and there are invertible matrices P2,Q2 over D′ such that φ(A)=P2E11′Q2 and φ(A0)=P2diag(In,0)Q2.
Replacing φ by the map X↦P2−1φ(P1XQ1)Q2−1,
we have that A=E11, A0=In, φ(E11)=E11′ and φ(In)=diag(In,0).
Since φ satisfies the Condition (I) and φ(E11)=E11′,
Corollary 2.2 implies either φ(M1)⊆M1′ with φ(N1)⊆N1′, or
φ(M1)⊆N1′ with φ(N1)⊆M1′. We prove this result only for the first case;
the second case is similar. From now on we assume that
[TABLE]
Recalling (47), we have φ(D≤1n×n+E11)⊆R∪S with
φ(E11)=E11′∈R∩S.
Since M1,N1⊂(D≤1n×n+E11), we obtain that
φ(M1)⊆M1′∩(R∪S)=(M1′∩R)∪(M1′∩S) and
φ(N1)⊆N1′∩(R∪S)=(N1′∩R)∪(N1′∩S).
We show M1′=R by contradiction.
Suppose that M1′=R. Then M1′∩R={E11′} and
hence φ(M1)⊆(M1′∩S).
By Lemma 2.5, ℓ:=M1′∩S is a line in AG(M1′), a contradiction to Lemma 4.8.
Hence M1′=R. Similarly, N1′=S. Thus
[TABLE]
Since E11+E22∈(D≤1n×n+E11), we get φ(E11+E22)∈M1′ or φ(E11+E22)∈N1′.
Without loss of generality, we assume that φ(E11+E22)∈M1′. Recall φ(In)=diag(In,0).
We have d(E11+E22,In)=n−2 and d(φ(E11+E22),diag(In,0))≥n−1, a contradiction.
Combining Cases 1-3, we always have a contradiction. Hence φ is non-degenerate.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Now, we prove Theorem 4.1 as follows.
Proof of Theorem 4.1. Suppose the graph homomorphism φ satisfies the Condition (I). Then, by Lemmas 4.10 and 4.12,
φ is non-degenerate and dim(φ(M1))=dim(φ(N1))=n.
By [14, Theorem 3.1], φ is of the form either (26) or (27).
Now, we assume that the homomorphism φ does not satisfies the Condition (I). Then Lemma 4.11 implies that
φ(D≤1n×n) is an adjacent set.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
5 Degenerate graph homomorphisms
In this section, we discuss the degenerate graph homomorphisms.
For a degenerate graph homomorphism φ:Dm×n→D′m′×n′,
there are no explicit algebraic formulas of φ. Thus, we discuss the ranges and some properties
on degenerate graph homomorphisms.
Let φ:Dm×n→D′m′×n′ be a graph homomorphism. We called that
φ* maps distinct maximal sets of the same type [resp. different types] into distinct maximal sets of the same type [resp. different types],
if for any two distinct maximal sets M and N of the same type [resp. different types] in Dm×n, there are
two distinct maximal sets M′ and N′ of the same type [resp. different types] in D′m′×n′,
such that φ(M)⊆M′ and φ(N)⊆N′.
We called that φ maps maximal sets of the same type [resp. different types] into maximal sets of the same type [resp. different types]*,
if for any two distinct maximal sets M and N of the same type [resp. different types] in Dm×n, there are
two maximal sets M′ and N′ of the same type [resp. different types] in D′m′×n′, such that
φ(M)⊆M′ and φ(N)⊆N′
(where N′ and N′ may be equal if M and N are of the same type).
Our main results in this section are the following two theorems.
Theorem 5.1
Let D,D′ be division rings with ∣D∣≥4,
and let m,n,m′,n′≥2 be integers with m′,n′≥min{m,n}. Suppose φ:Dm×n→D′m′×n′
is a degenerate graph homomorphism with φ(0)=0, and there exists A0∈Dm×n such that rank(φ(A0))=min{m,n}.
Then φ(D≤1m×n) and φ(BA0) are two adjacent sets.
Theorem 5.2
Let D,D′ be division rings with ∣D∣≥4, and let m,n,m′,n′≥2 be integers
with min{m,n}=2.
Assume that φ:Dm×n→D′m′×n′
is a degenerate graph homomorphism. Then there are two fixed maximal sets M and N of different types containing [math] in D′m′×n′,
such that
[TABLE]
where R∈D′m′×n′ is fixed.
To prove Theorems 5.1 and 5.2, we need the following lemmas.
Lemma 5.3
Let D,D′ be division rings with ∣D∣≥4,
and let m,n,m′,n′≥2 be integers with n,m′,n′≥m. Suppose that
φ:Dm×n→D′m′×n′
is a graph homomorphism with φ(0)=0, and there exists A0∈Dm×n such that rank(φ(A0))=m.
Assume further that φ(D≤1m×n) is not an adjacent set. Then:
φ* maps distinct maximal sets of type one containing [math] into distinct maximal sets of the same type, and
φ maps maximal sets of different types [resp. the same type] containing [math] into maximal sets of different types [resp. the same type].
Moreover, if M is a maximal set containing [math] in Dm×n
and φ(M)⊆M′ where M′ is a maximal set in D′m′×n′,
then φ(M) is not contained in any line in AG(M′);*
if A∈D1m×n and d(A0,A)=m−1, then φ(BA)
is not contained in a union of two maximal sets of different types containing φ(A).
*Proof. *By Theorem 4.1 or Corollary 4.3, without loss of generality, we assume that n>m. There is Q1∈GLn(D) such that
A0=(A1,0)Q1 where A1∈GLm(D). Let ψ(X)=φ(XQ1) for all X∈Dm×n.
Then ψ is a graph homomorphism with ψ(0)=0, and rank(ψ(A1,0))=m=rank(A1,0).
Since φ(D≤1m×n) is not an adjacent set,
ψ(D≤1m×n) is not an adjacent set.
Definite the map g:Dm×m→D′m′×n′ by
[TABLE]
Then g is a graph homomorphism with g(0)=0,
rank(g(A1))=m=rank(A1). By Theorem 4.1 or Corollary 4.3, either
g(D≤1m×m) is an adjacent set, or g is a distance preserving map.
We assert that g(D≤1m×m) is not an adjacent set. Otherwise, g(D≤1m×m)⊆R′
where R′ is a maximal set containing [math] in D′m′×n′. We show a contradiction as follows.
By Lemma 1.1, R′=P2M1′Q2 or R′=P2N1′Q2
where P2∈GLm′(D′) and Q2∈GLn′(D′). Replacing the map g by the map X↦P2−1g(X)Q2−1,
we have either R′=M1′ or R′=N1′.
Without loss of generality, we may assume that R′=M1′. Then
[TABLE]
Thus, we obtain
[TABLE]
Set (D≤1m×m,0)={(X,0):X∈D≤1m×m}⊂D≤1m×n.
By (56), we have ψ(D≤1m×m,0)⊆M1′.
Let S be any maximal set of type one containing [math] in Dm×n, and let ψ(S)⊆S′
where S′ is a maximal set in D′m′×n′.
Then ∣S∩N1∣≥2. Thus (57) implies that ∣S′∩M1′∣≥2. Using Corollary 2.3,
either S′=M1′ or S′ is of type two.
Put (S(m),0)=S∩(D≤1m×m,0). Then S(m) is a maximal set of type one in Dm×m.
From (56)
we get g(S(m))⊆M1′. Since g(S(m))⊆S′,
g(S(m))⊆M1′∩S′. If S′ is of type two, then
ℓ:=M1′∩S′ is a line in AG(M1′), which is a contradiction because Lemma 4.8. Thus, S′=M1′.
Then, ψ maps every maximal set of type one containing [math] in Dm×n into M1′.
Since every matrix of rank one is contained in a maximal set of type one containing [math], we obtain
ψ(D≤1m×n)⊆M1′. Since ψ(D≤1m×n) is not an adjacent set,
we get a contradiction.
Therefore, g is a distance preserving map, and hence g is non-degenerate.
(i). By Lemma 2.6(b),
g maps two distinct maximal sets of different types [resp. the same type] containing [math] into two distinct maximal sets of different types [resp. the same type].
Since g(Y)=φ((Y,0)Q1) (Y∈Dm×m), it is easy to see that φ maps two distinct maximal sets of type one
containing [math] into two distinct maximal sets of the same type.
Let M be any type one maximal set containing [math] in Dm×n, and let φ(M)⊆M′
where M′ is a maximal set containing [math] in D′m′×n′.
Set (M(m),0)=M∩(D≤1m×m,0).
Then M(m) is a maximal set of type one containing [math] in Dm×m.
Recall that g(Y)=φ((Y,0)Q1) (Y∈Dm×m).
We get
(M(m),0)Q1⊆MQ1=M. Thus,
[TABLE]
By Lemma 2.6(c), g(M(m)) is not contained in any line in AG(M′).
It follows that φ(M) is not contained in any line in AG(M′).
Thus, if M is a type one maximal set containing [math] in Dm×n
and φ(M)⊆M′ where M′ is a maximal set in D′m′×n′,
then φ(M) is not contained in any line in AG(M′).
Next, we discuss maximal sets of type two.
Let S1, S2 be any two distinct maximal sets of type two containing [math] in Dm×n, and let φ(Si)⊆Si′
where Si′ is a maximal set in D′m′×n′, i=1,2. Assume that R1,R2 are any two
distinct type one maximal sets containing [math] in Dm×n. By the above results, there are two distinct maximal sets R1′,R2′
containing [math] in D′m′×n′, such that R1′ and R2′ are of the same type and
φ(Ri)⊆Ri′, i=1,2. By Corollary 2.3, we have ∣Si′∩Rj′∣≥2, i,j=1,2.
Thus R1′=R2′ implies that Si′ and R1′ are of different types i=1,2.
Consequently S1′ and S2′ are of the same type.
Therefore, we have proved that
φ maps two distinct maximal sets of different types [resp. the same type] containing [math] into two maximal sets of different types [resp. the same type].
On the other hand, by Lemma 2.5,
ℓ1:=S1∩R1 and ℓ2:=S1∩R2 are two distinct lines in AG(S1). Also,
ℓ1′:=S1′∩R1′ and ℓ2′:=S2′∩R2′ are two distinct lines in AG(S1′).
Since φ(ℓi)⊆ℓi′, i=1,2, it follows that φ(S1) is not contained in any line in AG(S1′) because
two different lines have at most a common point.
Thus, if S1 is a type two maximal set containing [math] in Dm×n
and φ(S1)⊆S1′ where S1′ is a maximal set in D′m′×n′,
then φ(S1) is not contained in any line in AG(S1′).
Therefore, if M is a maximal set containing [math] in Dm×n and φ(M)⊆M′ where M′ is a maximal set in D′m′×n′,
we have prove that φ(M) is not contained in any line in AG(M′). Thus, the (i) of this lemma is proved.
(ii). Suppose A∈D1m×n and d(A0,A)=m−1. Then A<A0.
By Lemma 4.4(c), there are P3∈GLm(D) and Q3∈GLn(D) such that
A=P3E11Q3 and A0=P3(Im,0)Q3. Replacing φ by the map X↦φ(P3XQ3),
we can assume that A0=(Im,0) and A=E11.
Definite the map f:Dm×m→D′m′×n′ by
f(Y)=φ(Y,0), Y∈Dm×m.
Then f is a graph homomorphism such that f(0)=0 and rank(f(Im))=m. By Theorem 4.1 or Corollary 4.3, either
f(D≤1m×m) is an adjacent set or f is a distance preserving map.
Similar to the proof on the homomorphism g, we can prove that f is a distance preserving map. Since every distance preserving map carries
distinct maximal sets into distinct maximal sets, f(D≤1m×m+E11m×m)
is not contained in a union of two maximal sets of different types containing f(E11m×m).
Since f(D≤1m×m+E11m×m)=φ(D≤1m×m+E11m×m,0)⊆φ(BE11),
φ(BE11)
is not contained in a union of two maximal sets of different types containing φ(E11). Thus the (ii) of this lemma is proved.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
By the symmetry of rows and columns of a matrix, we have similarly the following lemma.
Lemma 5.4
Let D,D′ be division rings with ∣D∣≥4,
and let m,n,m′,n′≥2 be integers with m,m′,n′≥n. Suppose that
φ:Dm×n→D′m′×n′
is a graph homomorphism with φ(0)=0, and there exists A0∈Dm×n such that rank(φ(A0))=n.
Assume further that φ(D≤1m×n) is not an adjacent set. Then:
φ* maps distinct type two maximal sets containing [math] into distinct maximal sets of the same type, and
φ maps maximal sets of different types [resp. the same type] containing [math] into maximal sets of different types [resp. the same type].
Moreover, if M is a maximal set containing [math] in Dm×n and φ(M)⊆M′ where
M′ is a maximal set in D′m′×n′, then φ(M) is not contained in any line in AG(M′);*
if A∈D1m×n and d(A0,A)=n−1, then φ(BA)
is not contained in a union of two maximal sets of different types containing φ(A).
Now, we prove Theorem 5.1 as follows.
Proof of Theorem 5.1. We prove this theorem only for the case of m=min{m,n}; the case of n=min{m,n} is similar by using Lemma 5.4.
Since φ is degenerate, there exists a matrix A∈D≤1m×n and there are two
maximal sets M and N of different types in D′m′×n′, such that
[TABLE]
Without loss of generality, we assume that M is of type one and N is of type two.
Since rank(φ(A0))=m and rank(φ(A))≤1, we have either d(φ(A0),φ(A))=m or m−1.
Step 1. In this step, we will prove that φ(D≤1m×n) is an adjacent set by contradiction.
By Corollary 4.3, without loss of generality, we assume that n>m.
Suppose that φ(D≤1m×n) is not an adjacent set.
We distinguish the following two cases to show a contradiction.
Case 1.1. d(φ(A0),φ(A))=m.
Let ψ(X)=φ(X+A)−φ(A), X∈Dm×n. Then ψ:Dm×n→D′m′×n′
is a graph homomorphism with ψ(0)=0 and rank(ψ(A0−A))=m. We show that ψ(D≤1m×n) is an adjacent set.
Otherwise, if ψ(D≤1m×n) is not an adjacent set, then by Lemma 5.3(i),
ψ(D≤1m×n) is not contained in a union of two maximal sets of different types containing [math],
which implies that φ(BA) is not contained in a union of two maximal sets of different types containing φ(A),
a contradiction to (58). Therefore, ψ(D≤1m×n) is an adjacent set.
It follows that φ(BA) is an adjacent set. Thus, there exists a maximal set S such that
[TABLE]
Since φ(D≤1m×n) is not an adjacent set, A is of rank one.
There is a type one maximal set MA [resp. type two maximal set SA] containing A and [math] in Dm×n.
By Lemma 5.3(i), we have φ(MA)⊆MA′ and φ(SA)⊆SA′, where
MA′ and SA′ are two maximal sets of different types in D′m′×n′ containing φ(A) and [math].
Since MA,SA⊆BA, we get φ(MA)⊆(MA′∩S) and φ(SA)⊆(SA′∩S).
Without loss of generality, we assume that MA′ and S are of the same type. Then Corollary 2.3
implies that MA′∩S={φ(A)} and φ(MA)⊆{φ(A)}, a contradiction.
Case 1.2. d(φ(A0),φ(A))=m−1.
Then, we have rank(φ(A))=rank(A)=1 and φ(A)<φ(A0). Write Eij′=Eijm′×n′ and Eij=Eijm×n.
By Lemma 4.4(c), there are invertible matrices P1,Q1 over D′ such that
[TABLE]
Also, there are invertible matrices P2,Q2 over D such that P2AQ2=E11.
Let
\scriptsize P_{2}A_{0}Q_{2}=\left(\begin{array}[]{cc}A_{11}&A_{12}\\
A_{21}&A_{22}\\
\end{array}\right) where A11∈D1×1 and A22∈D(m−1)×(n−1).
Clearly, d(A0,A)=m or m−1. By Lemma 5.3(ii) and (58), we have d(A0,A)=m.
Thus, either A22≅diag(Im−1,0) or A22≅diag(Im−2,0). Put
\scriptsize J_{m}=\left(\begin{array}[]{ccc}0&0&1\\
0&I_{m-2}&0\\
1&0&0\\
\end{array}\right).
When A22≅diag(Im−1,0), by appropriate elementary row and column operations on matrices, we can obtain
either (diag(a,Im−1),0) (where a∈D∗ with a=1) or \scriptsize\left(\begin{array}[]{cccc}0_{1}&0&1&0\\
0&I_{m-1}&0&0\\
\end{array}\right)
from P2A0Q2. Moreover, P2AQ2=E11 is unchanged.
When A22≅diag(Im−2,0), by appropriate elementary row and column operations on matrices, we can get
(Jm,0) from P2A0Q2. Moreover, P2AQ2=E11 is unchanged.
Thus, there are invertible matrices P3,Q3 over D, such that P3AQ3=E11 and either
[TABLE]
Replacing φ by the map X↦P1−1φ(P3−1XQ3−1)Q1−1, we have A=E11, and either
A0=(diag(a,Im−1),0), or (Jm,0), or \scriptsize\left(\begin{array}[]{cccc}0_{1}&0&1&0\\
0&I_{m-1}&0&0\\
\end{array}\right).
Moreover, we have
[TABLE]
On the other hand, (58) becomes
[TABLE]
In Dm×n [resp. D′m′×n′], by Corollary 2.2, there are only two maximal sets
of different types containing E11 and [math] [resp. E11′ and [math]], they are M1 and N1 [resp.
M1′ and N1′]. Thus, by Lemma 5.3(i) and φ(E11)=E11′,
we have either φ(M1)⊆M1′ with φ(N1)⊆N1′, or
φ(M1)⊆N1′ with φ(N1)⊆M1′. Without loss of generality, we assume that
[TABLE]
Since M1,N1⊆(D≤1m×n+E11),
we get that φ(M1)⊆M1′∩(M∪N)
and φ(N1)⊆N1′∩(M∪N).
Suppose that M1′=M. Then M1′∩M={E11′} and
M1′∩(M∪N)=M1′∩N, thus
ℓ:=M1′∩N is a line in AG(M1′) and φ(M1′)⊆ℓ.
By Lemma 5.3(i), this is a contradiction.
Therefore, we must have M1′=M. Similarly, N1′=N. It follows that
[TABLE]
In order to give a contradiction, we distinguish the following subcases.
Subcase 1.2.1. A0=(diag(a,Im−1),0) where a∈D∗ with a=1. By (60),
we have φ(aE11)=a∗E11′ where a∗∈D′∗.
Since aE11<A0, Corollary 4.7 and (59) imply that φ(aE11)<φ(A0)=diag(Im,0). Thus, a∗=1 and hence
φ(aE11)=E11′. Since φ(aE11)∼φ(E11)=E11′, we have a contradiction.
Subcase 1.2.2. A0=(Jm,0). By (61), we get φ(Emm+E11)∈M1′∪N1′.
Without loss of generality, we assume that φ(Emm+E11)∈M1′. Since d(Emm+E11,(Jm,0))=m−1,
it follows from (59) that d(φ(Emm+E11),diag(Im,0))≤m−1. Thus
\scriptsize\varphi(E_{mm}+E_{11})=\left(\begin{array}[]{cc}1&\alpha\\
0&0\\
\end{array}\right) where 0=α∈D′n′−1 because φ(Emm+E11)∼φ(E11)=E11′.
Since d(Em1+E11,(Jm,0))=m−1, from (59) we have
d(φ(Em1+E11),diag(Im,0))≤m−1. Thus φ(N1)⊆N1′ implies that
\scriptsize\varphi(E_{m1}+E_{11})=\left(\begin{array}[]{cc}1&0\\
\beta&0\\
\end{array}\right) where 0=β∈m′−1D′ because φ(Em1+E11)∼E11′.
By φ(Emm+E11)∼φ(Em1+E11), one gets
\scriptsize\left(\begin{array}[]{cc}1&\alpha\\
0&0\\
\end{array}\right)\sim\left(\begin{array}[]{cc}1&0\\
\beta&0\\
\end{array}\right), a contradiction.
Subcase 1.2.3. \scriptsize A_{0}=\left(\begin{array}[]{cccc}0_{1}&0&1&0\\
0&I_{m-1}&0&0\\
\end{array}\right). Let B=E11+Emm.
Since B∈BE11, from (61) we have φ(B)∈M1′ or φ(B)∈N1′.
Assume that φ(B)∈M1′. Since d(B,A0)=m−1, by (59) we get d(φ(B),diag(Im,0))≤m−1.
On the other hand, we have φ(B)∼φ(E11)=E11′, which implies that
\scriptsize\varphi(B)=\left(\begin{array}[]{cc}1&\alpha\\
0&0\\
\end{array}\right) where 0=α∈D′n′−1.
Let C1=E11+Em1.
Since C1∈N1 and φ(C1)∼φ(B), it follows from φ(N1)⊆N1′ that φ(C1)=c1E11′, where c1∈D′∗.
Let MC be the type one maximal set containing C1 and [math] in Dm×n. Then MC=M1.
Suppose φ(MC)⊆MC′ where MC′ is a maximal set containing φ(C1) and [math]
in D′m′×n′. By Lemma 5.3(i) and (60), MC′ is of type one and
MC′=M1′. Thus, {0,φ(C1)}⊆MC′∩M1′, which is a contradiction to Corollary 2.3.
Assume that φ(B)∈N1′. Similarly, we have
\scriptsize\varphi(B)=\left(\begin{array}[]{cc}1&0\\
\beta&0\\
\end{array}\right) where 0=β∈m′−1D′. Let B1=E11+Em1+Emm−Em,m+1.
Since B1∈BE11, by (61) we get φ(B1)∈M1′ or φ(B1)∈N1′.
By d(B1,A0)=m−1 and (59), we have d(φ(B1),diag(Im,0))≤m−1.
Thus \scriptsize\varphi(B_{1})=\left(\begin{array}[]{cc}1&\alpha_{1}\\
0&0\\
\end{array}\right) or \scriptsize\varphi(B_{1})=\left(\begin{array}[]{cc}1&0\\
\beta_{1}&0\\
\end{array}\right), where 0=α1∈D′n′−1 and 0=β1∈m′−1D′.
Since φ(B1)∼φ(B), we must have \scriptsize\varphi(B_{1})=\left(\begin{array}[]{cc}1&0\\
\beta_{1}&0\\
\end{array}\right). Let B2=−E1m+E1,m+1∈M1. Then B2∼B1 and B2∼E11, hence (59) and (60)
imply that φ(B2)=b2E11′, where b2∈D′∗ with b2=1. However, we have d(B2,A0)=m−1 and d(φ(B2),φ(A0))=d(b2E11′,diag(Im,0)))=m, a contradiction.
Combining Case 1.1 with Case 1.2, there is always a contradiction.
Therefore, φ(D≤1m×n) must be an adjacent set.
Step 2. In this step, we will prove that φ(BA0) is an adjacent set. By Step 1,
φ(D≤1m×n) is an adjacent set. Thus, there is a maximal set M′ containing [math] in D′m′×n′,
such that φ(D≤1m×n)⊆M′.
There is an invertible matrix Q over D such that A0=(A1,0)Q where A1∈GLm(D).
Let φ′(X)=φ(XQ)
for all X∈Dm×n. Then φ′ is a graph homomorphism, rank(φ′(A1,0))=m and
[TABLE]
Let f(Y)=φ′(Y+A1,0)−φ′(A1,0), Y∈Dm×m. Then f is a graph homomorphism such that f(0)=0 and
rank(f(−A1))=m.
By (62), it is clear that f does not preserve distance 2. It follows from Corollary 4.3 that
f(D≤1m×m) is an adjacent set.
Hence there is a maximal set N′ containing [math] in D′m′×n′, such that
[TABLE]
Let h(X)=φ′(X+(A1,0))−φ′(A1,0), X∈Dm×n. Then h is a graph homomorphism with h(0)=0.
Moreover, h(Y,0)=f(Y) for all Y∈Dm×m.
We assert h(D≤1m×n)⊆N′. Otherwise, there exists a type one maximal set R containing [math]
in Dm×n, such that
h(R)⊆S where S is a maximal set containing [math] in D′m′×n′ and S=N′.
Let (R(m),0)=R∩(D≤1m×m,0).
Then R(m) is a type one maximal set containing [math] in Dm×m, and hence
f(R(m))⊆N′∩S. By Corollary 2.3, S and N′ must be of different type. Thus
ℓ:=N′∩S is a line in AG(N′) by Lemma 2.5, a contradiction to Lemma 4.8.
Therefore, we obtain h(D≤1m×n)⊆N′, and hence
φ′(B(A1,0))⊆N′+φ′(A1,0). Consequently,
φ(BA0)⊆N′+φ(A0) and hence φ(BA0) is an adjacent set.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Next, we will prove Theorem 5.2. We need the following lemma.
Lemma 5.5
Let D,D′ be division rings with ∣D∣≥4, and let m,n,m′,n′≥2 be integers
with min{m,n}=2. Suppose φ:Dm×n→D′m′×n′
is a degenerate graph homomorphism with φ(0)=0, and
there exists A∈D2m×n such that rank(φ(A))=2.
Then there are two fixed maximal sets M and N of different types in D′m′×n′,
such that 0∈M∩N and
[TABLE]
where R∈M is fixed and rank(R)=1.
Moreover, there is M′∈{M,N} such that
φ(D≤1m×n)⊆M′ and φ(NA)⊆M′∩(N′+R)
where {M′,N′}={M,N}.
*Proof. * We prove this lemma only for the case m=min{m,n}=2; the case n=min{m,n}=2 is similar.
From now on we assume that m=min{m,n}=2.
Step 1. By Theorem 5.1, φ(D≤12×n) and φ(BA) are two adjacent sets.
Then, there are maximal sets M and N containing [math] in D′m′×n′,
such that φ(D≤12×n)⊆M and φ(BA)⊆N+φ(A).
By Lemma 1.1, M=P1M1′Q1 or M=P1N1′Q1
where P1∈GLm′(D′) and Q1∈GLn′(D′). Replacing φ by the map X↦P1−1φ(X)Q1−1,
we have either M=M1′ or M=N1′.
We prove this lemma only for the case of M=M1′; the case of M=N1′ is similar.
Now, we assume that M=M1′.
Write
\scriptsize A=\left(\begin{array}[]{c}\alpha_{1}\\
\alpha_{2}\\
\end{array}\right) where α1,α2∈Dn are left linearly independent. Set
\scriptsize C_{\lambda}=\left(\begin{array}[]{c}-\alpha_{1}+\lambda\alpha_{2}\\
0\\
\end{array}\right) where λ∈D.
Since Cλ+A∈BA∩D≤12×n for all λ∈D, ∣(N+φ(A))∩M1′∣≥2.
Since rank(φ(A))=2, N+φ(A)=M1′. Thus
Corollary 2.3 implies that N is of type two.
By Lemma 1.1, N=N1′Q2 where Q2∈GLn′(D′).
Replacing φ by the map X↦φ(X)Q2−1 (X∈D2×n), we may assume with no loss of generality that
N=N1′. Thus
[TABLE]
We prove φ(NA)⊆M1′ as follows.
Write
\scriptsize\varphi(A)=\left(\begin{array}[]{cc}a_{11}&A_{12}\\
A_{21}&A_{22}\\
\end{array}\right) where a11∈D′.
Since Cλ+A∈NA∩D≤12×n for all λ∈D,
φ(Cλ+A)∈(N1′+φ(A))∩M1′ for all λ∈D.
Hence φ(A) is of the form
[TABLE]
Otherwise, A22=0 implies that (N1′+φ(A))∩M1′=∅, a contradiction.
Now, we affirm that rank(φ(Z))=1 for every Z∈NA.
Suppose that Z∈NA and rank(φ(Z))=2. Then rank(Z)=2. We show a contradiction as follows.
By Theorem 5.1, φ(BZ) is an adjacent set. Thus, there exists a maximal set
S containing [math] in D′m′×n′ such that
[TABLE]
Write \scriptsize Z=\left(\begin{array}[]{c}\delta_{1}\\
\delta_{2}\\
\end{array}\right), where δ1,δ2∈Dn are left linearly independent.
Let
\scriptsize T_{\lambda}=\left(\begin{array}[]{c}-\delta_{1}+\lambda\delta_{2}\\
0\\
\end{array}\right) where λ∈D.
Since Tλ+Z∈BZ∩D≤12×n for all λ∈D, ∣(S+φ(Z))∩M1′∣≥2.
By rank(φ(Z))=2, we have S+φ(Z)=M1′. Hence
Corollary 2.3 implies that S+φ(Z) is a maximal set of type two.
Applying Corollary 2.3 again, we get ∣(S+φ(Z))∩(N1′+φ(A))∣≤1.
Let
\scriptsize Z-A=\left(\begin{array}[]{c}\gamma_{1}\\
\gamma_{2}\\
\end{array}\right)\in\mathbb{D}_{1}^{2\times n}, \scriptsize Z_{1}=\left(\begin{array}[]{c}0\\
\gamma_{1}-\gamma_{2}\\
\end{array}\right),
\scriptsize Z_{2}=\left(\begin{array}[]{c}\gamma_{2}-\gamma_{1}\\
0\\
\end{array}\right),
\scriptsize Y_{1}=\left(\begin{array}[]{c}\gamma_{1}\\
\gamma_{1}\\
\end{array}\right) and
\scriptsize Y_{2}=\left(\begin{array}[]{c}\gamma_{2}\\
\gamma_{2}\\
\end{array}\right). Then Zi+Z=Yi+A, i=1,2. Moreover, Z1+Z∼Z2+Z. Clearly, Zi+Z∈BZ and Yi+A∈BA, i=1,2.
It follows that ∣BZ∩BA∣≥2 and hence ∣(S+φ(Z))∩(N1′+φ(A))∣≥2,
a contradiction.
Therefore, rank(φ(Z))=2 for all Z∈NA. By rank(φ(A))=2 and φ(A)∼φ(Z), one gets
rank(φ(Z))=1 for every Z∈NA.
Note that NA⊂BA. By (64) and (65), we obtain
[TABLE]
Step 2. Let B∈D22×n with B=A and rank(φ(B))=2. By Theorem 5.1,
φ(BB) is an adjacent set. Thus,
there is a maximal set N′′ containing [math] in D′m′×n′ such that
[TABLE]
Write
\scriptsize B=\left(\begin{array}[]{c}\beta_{1}\\
\beta_{2}\\
\end{array}\right) where β1,β2∈Dn are left linearly independent.
Set
\scriptsize C_{\lambda}=\left(\begin{array}[]{c}-\beta_{1}+\lambda\beta_{2}\\
0\\
\end{array}\right) where λ∈D.
Since Cλ+B∈BB∩D≤12×n for all λ∈D, ∣(N′′+φ(B))∩M1′∣≥2.
Since rank(φ(B))=2, N′′+φ(B)=M1′.
It follows from Corollary 2.3 that N′′ is of type two.
We prove N′′=N1′ by contradiction as follows.
Suppose that N′′=N1′. Write N′′={(yq1,yq2,…,yqn):y∈mD} where qj∈D′ and
(q2,…,qn)=0. Then there is \scriptsize Q_{2}=\left(\begin{array}[]{cc}1&0\\
&*\\
\end{array}\right)\in GL_{n^{\prime}}(\mathbb{D}^{\prime}) such that
N′′=N2′Q2 and N1′=N1′Q2.
Modifying the map φ by the map X↦φ(X)Q2−1 (X∈D2×n). We may assume with no loss of
generality that N′′=N2′
and (64)-(66) hold. Thus
[TABLE]
Write
\scriptsize\varphi(B)=\left(\begin{array}[]{ccc}b_{11}&b_{12}&B_{13}\\
B_{21}&B_{22}&B_{23}\\
\end{array}\right) where b11,b12∈D′.
Since Cλ+B∈BB∩D≤12×n for all λ∈D,
φ(Cλ+B)∈(N2′+φ(B))∩M1′ for all λ∈D.
Hence φ(B) is of the form
[TABLE]
where B22=0 and (b11,B13)=(0,0).
Otherwise, we have (B21,B23)=(0,0), which implies that (N2′+φ(B))∩M1′=∅, a contradiction.
By φ(B)∈/M1′ and (66), we have B∈/NA and hence d(A,B)=2.
Write
\scriptsize B-A=\left(\begin{array}[]{c}\nu_{1}\\
\nu_{2}\\
\end{array}\right), where ν1,ν2∈Dn are left linearly independent.
Then
\scriptsize B\sim\left(\begin{array}[]{c}\nu_{1}+\lambda\nu_{2}\\
0\\
\end{array}\right)+A\sim A for all λ∈D. Let A12=(a12,A13) where a12∈D′. By (66), one has that
[TABLE]
where σ is an injection from D to D′.
Hence
[TABLE]
which is a contradiction because B22=0. Therefore, we must have N′′=N1′.
Similar to the proof of (69), we have that d(A,B)=2 and
[TABLE]
where μ is an injection from D to D′. Therefore,
[TABLE]
Using Lemma 2.1 and rank(φ(B))=2, it is easy to see that B22′=0 and B12′=A12.
Consequently, N1′+φ(B)=N1′+φ(A), and (67) implies that
[TABLE]
Step 3. Let T∈D22×n with rank(φ(T))=1. We show φ(T)∈M1′ as follows.
Put
\scriptsize\varphi(T)=\left(\begin{array}[]{cc}t_{11}&T_{12}\\
T_{21}&T_{22}\\
\end{array}\right) where t11∈D′.
If T∼A, then T∈NA and hence
φ(T)∈M1′ by (66).
Now we assume d(T,A)=2. Write
\scriptsize T-A=\left(\begin{array}[]{c}\delta_{1}\\
\delta_{2}\\
\end{array}\right) where δ1,δ2∈Dn are left linearly independent.
Then
\scriptsize T\sim\left(\begin{array}[]{c}\delta_{1}+\lambda\delta_{2}\\
0\\
\end{array}\right)+A\sim A for all λ∈D. By (66), we can let
\scriptsize\varphi\left(\left(\begin{array}[]{c}\delta_{1}+\lambda\delta_{2}\\
0\\
\end{array}\right)+A\right)=\left(\begin{array}[]{cc}\lambda^{\tau}&A_{12}\\
0&0\\
\end{array}\right) for all λ∈D, where τ is an injection from D to D′.
Since \scriptsize\varphi(T)\sim\left(\begin{array}[]{cc}\lambda^{\tau}&A_{12}\\
0&0\\
\end{array}\right) for all λ∈D, we get that
[TABLE]
By Lemma 2.1 and A12=0, we obtain (T21,T22)=0. Then
\scriptsize\varphi(T)=\left(\begin{array}[]{cc}t_{11}&T_{12}\\
0&0\\
\end{array}\right)\in\mathcal{M}_{1}^{\prime}.
Hence
[TABLE]
By (64), (71) and (72), we have that φ(X)∈N1′+φ(A) whenever rank(φ(X))=2, and
φ(X)∈M1′ whenever rank(φ(X))=2. Thus
[TABLE]
Recall that \scriptsize\varphi(A)=\left(\begin{array}[]{cc}a_{11}&A_{12}\\
A_{21}&0\\
\end{array}\right) where A21=0 and A12=0.
Let \scriptsize R=\left(\begin{array}[]{cc}a_{11}&A_{12}\\
0&0\\
\end{array}\right)\in\mathcal{M}_{1}^{\prime}. Then rank(R)=1, M1′=M1′+R and N1′+φ(A)=N1′+R, and hence
M1′∪(N1′+φ(A))=(M1′+R)∪(N1′+R). Therefore, (63) holds.
By (64) and (66), we have φ(D≤12×n)⊆M1′ and
φ(NA)⊆M1′∩(N1′+R). Thus, there is M′∈{M,N} such that
φ(D≤12×n)⊆M′ and φ(NA)⊆M′∩(N′+R)
where {M′,N′}={M,N}.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Now, we prove Theorem 5.2 as follows.
Proof of Theorem 5.2. Note that the map φ(X)−φ(0) is also a degenerate graph homomorphism. By the
map X↦φ(X)−φ(0), we may assume with no loss of generality that φ(0)=0.
We prove this theorem only for the case of m=2; the case of n=2 is similar. From now on we assume that m=min{m,n}=2.
Clearly, 1≤diam(φ(D2×n))≤2.
Case 1. There exists A∈D22×n such that rank(φ(A))=2.
By Lemma 5.5, this theorem holds.
Case 2. There is no A∈D22×n such that rank(φ(A))=2. Then
[TABLE]
If diam(φ(D2×n))=1, then φ(D2×n) is an adjacent set, and hence this theorem holds.
From now on we assume that diam(φ(D2×n))=2. Then, there are two matrices B1,B2∈D2×n such that
d(φ(B1),φ(B2))=2=d(B1,B2).
Let ψ(X)=φ(X+B1)−φ(B1), X∈D2×n.
Then ψ:D2×n→D′m′×n′ is a graph homomorphism with ψ(0)=0 and rank(ψ(B2−B1))=2.
Subcase 2.1. ψ is degenerate.
By Lemma 5.5, there are two fixed maximal sets M and N of different
types containing [math], such that
ψ(D2×n)⊆(M+R1)∪(N+R1),
where R1∈D′m′×n′ is fixed and rank(R1)=1.
Hence φ(D2×n)⊆(M+R1+φ(A))∪(N+R1+φ(B1)) and
this theorem holds.
Subcase 2.2. ψ is non-degenerate. By Lemma 3.3,
there exist invertible matrices T1,T2 over D′ and invertible matrices T3,T4 over D, such that
either
[TABLE]
or
[TABLE]
Without loss of generality, we may assume that (74) holds and all T1,T2,T3,T4 are identity matrices. Then
ψ(Mi)⊆Mi′ with ψ(Ni)⊆Ni′, i=1,2.
Since Mi∩Nj=DEij and Mi′∩Nj′=D′Eij′, 1≤i,j≤2,
we can let ψ(xEij)=xσijEij′, x∈D,
where σij:D→D′ is an injective map with 0σij=0.
By the definition of ψ, we obtain that
[TABLE]
Using (73), we have rank(xσijEij′+φ(B1))≤1, x∈D, i,j=1,2.
Applying Lemma 2.1, it is easy to verify that φ(B1)=0. Thus,
rank(φ(B2))=d(φ(B2),φ(B1))=2, a contradiction to (73).
Therefore, Subcase 2.2 does not happen.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
By Theorem 5.1, the following corollary is obvious.
Corollary 5.6
Let D,D′ be division rings with ∣D∣≥4,
and let m,n,m′,n′≥2 be integers with m′,n′≥min{m,n}. Suppose φ:Dm×n→D′m′×n′
is a graph homomorphism with φ(0)=0, and there exists A0∈Dm×n such that rank(φ(A0))=min{m,n}.
If φ(D≤1m×n) or φ(BA0) is not an adjacent set, then φ is non-degenerate.
The following result is a generalization of [17, Theorem 1.1] (which is due to Huang and Šemrl).
Corollary 5.7
Let D,D′ be division rings with ∣D∣≥4,
and let m′,n′≥2. Suppose
φ:D2×2→D′m′×n′
is a graph homomorphism. Then either φ is a distance preserving map (which is of the form either (28) or (29)),
or there are two fixed maximal sets M and N of different types in D′m′×n′,
such that 0∈M∩N and
[TABLE]
where R∈D′m′×n′ is fixed.
*Proof. *Assume that diam(φ(D2×2))=1. Then φ(D2×2) is an adjacent set, and hence (76) holds.
From now on we assume that diam(φ(D2×2))=2. Then
there are two matrices A0,B0∈D2×2 such that
d(φ(A0),φ(B0))=rank(φ(B0)−φ(A0))=2.
Let ψ(X)=φ(X+A0)−φ(A0), X∈D2×2. Then ψ:D2×2→D′m′×n′
is a graph homomorphism with ψ(0)=0 and rank(ψ(B0−A0))=2. By Corollary 4.3,
either ψ is a distance preserving map or ψ(D≤12×2) is an adjacent set.
Assume that ψ is a distance preserving map. Then φ is also a distance preserving map.
By Corollary 4.2, φ is of the form either (28) or (29).
Now, we assume that ψ(D≤12×2) is an adjacent set. By Theorem 5.2 or Lemma 5.5,
there are two fixed maximal sets M and N of different types in D′m′×n′,
such that 0∈M∩N and (76) holds.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Finally, we discuss the case of finite fields. For the case of finite fields, we have the following better results.
Theorem 5.8
Let D,D′ be two finite fields with ∣D∣>∣D′∣, and let
m,n,m′,n′≥2 be integers. Then every graph homomorphism from Dm×n to D′m′×n′ is a (vertex) colouring.
*Proof. *Suppose φ:Dm×n→D′m′×n′ is a graph homomorphism. Without loss of generality, we may assume that
φ(0)=0 and φ(M1)⊆M1′.
If ℓ is a line in AG(M1), then ∣D∣>∣D′∣ implies that φ(ℓ) is not contained in any line in AG(M1′),
and hence φ(ℓ) contains at least three noncollinear points in AG(M1′).
Let \scriptsize A=\left(\begin{array}[]{c}\alpha_{1}\\
\vdots\\
\alpha_{m}\\
\end{array}\right)\in\mathbb{D}_{1}^{m\times n}. Without loss of generality, we assume αm=0. Then αi=kiαm, i=1,…,m−1.
We have \scriptsize A\sim\left(\begin{array}[]{c}\lambda\alpha_{m}\\
0\\
\end{array}\right) for all λ∈D. Since \scriptsize\ell_{1}:=\left\{\left(\begin{array}[]{c}\lambda\alpha_{m}\\
0\\
\end{array}\right):\lambda\in\mathbb{D}\right\} is a line in AG(M1), it follows from above result that φ(A) is adjacent with
three noncollinear points in AG(M1′). By Lemma 2.8, φ(A)∈M1′ for all A∈D1m×n. Therefore, we obtain
φ(D≤1m×n)⊆M1′.
Suppose that φ(D≤k−1m×n)⊆M1′ where 2≤k≤m. Let B∈Dkm×n.
Note that P(D≤k−1m×n)Q=D≤k−1m×n for any P∈GLm(D and Q∈GLn(D.
Without loss of generality, we can assume that \scriptsize B=\left(\begin{array}[]{c}B_{1}\\
0\\
\end{array}\right) where \scriptsize B_{1}=\left(\begin{array}[]{c}\alpha_{1}\\
\vdots\\
\alpha_{k}\\
\end{array}\right)\in\mathbb{D}_{k}^{k\times n}. Put
\scriptsize C_{1}=\left(\begin{array}[]{c}\alpha_{1}\\
\vdots\\
\alpha_{k-1}\\
\end{array}\right). Then
\scriptsize B\sim\left(\begin{array}[]{c}C_{1}+{\scriptsize\left(\begin{array}[]{c}\lambda\alpha_{k}\\
0\\
\end{array}\right)}\\
0\\
\end{array}\right) for all λ∈D.
Let
\scriptsize\ell_{2}=\left\{\left(\begin{array}[]{c}C_{1}+{\scriptsize\left(\begin{array}[]{c}\lambda\alpha_{k}\\
0\\
\end{array}\right)}\\
0\\
\end{array}\right):\lambda\in\mathbb{D}\right\}\subset\mathbb{D}_{\leq\,k-1}^{m\times n}.
Then ℓ2 is a line in some affine geometry on a maximal set in Dm×n. By the induction hypothesis, we have φ(ℓ2)⊆M1′.
Since ∣D∣>∣D′∣, φ(ℓ2) contains at least three noncollinear points in AG(M1′). By Lemma 2.8 and φ(B)∼Y for any Y∈φ(ℓ2),
we obtain φ(B)∈M1′ for any B∈Dkm×n. Hence φ(D≤km×n)⊆M1′.
Taking k=m, we get φ(Dm×n)⊆M1′.
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Let ⌈x⌉ denote the smallest integer at least as large as x.
Theorem 5.9
Let D,D′ be two finite fields with 4≤∣D∣≤∣D′∣≤(∣D∣−1)⌈(∣D∣+1)/2⌉, and let
m,n,m′,n′≥2 be integers. Suppose φ:Dm×n→D′m′×n′
is a degenerate graph homomorphism. Then there are two fixed maximal sets M and N of different types containing [math] in D′m′×n′,
such that
[TABLE]
where R∈D′m′×n′ is fixed.
*Proof. *When min{m,n}=2, this theorem holds by Theorem 5.2. From now on we assume that m,n>2.
By Theorem 5.2,
there are two fixed maximal sets M and N of different types containing [math] in D′m′×n′, such that
\scriptsize\varphi\left(\begin{array}[]{c}\mathbb{D}^{2\times n}\\
0\\
\end{array}\right)\subseteq(\mathcal{M}+R)\cup(\mathcal{N}+R), where R∈D′m′×n′ is fixed.
Suppose that 3≤k≤m and
[TABLE]
We prove \scriptsize\varphi\left(\begin{array}[]{c}\mathbb{D}^{k\times n}\\
0\\
\end{array}\right)\subseteq(\mathcal{M}+R)\cup(\mathcal{N}+R) as follows.
Let \scriptsize A=\left(\begin{array}[]{c}A_{1}\\
0\\
\end{array}\right)\in\mathbb{D}^{m\times n}, where \scriptsize A_{1}=\left(\begin{array}[]{c}\alpha_{1}\\
\vdots\\
\alpha_{k}\\
\end{array}\right)\in\mathbb{D}^{k\times n} with αk=0. Put \scriptsize B_{1}=\left(\begin{array}[]{c}\alpha_{1}\\
\vdots\\
\alpha_{k-1}\\
\end{array}\right). Then
[TABLE]
Let
[TABLE]
[TABLE]
Then ℓ1,ℓ2,ℓd′ (d∈D∗) are ∣D∣+1 distinct lines in affine geometries on ∣D∣+1 maximal sets in Dm×n.
Moreover, \ell_{1}\cap\ell_{2}=\ell_{i}\cap\ell_{d}^{\prime}=\ell_{d_{1}}^{\prime}\cap\ell_{d_{2}}^{\prime}=\scriptsize\left(\begin{array}[]{c}B_{1}\\
0\\
\end{array}\right) for i=1,2 and d,d1,d2∈D∗ with d1=d2.
Clearly, φ(ℓi) or ℓd′ is contained in a maximal set in D′m′×n′, i=1,2, d∈D∗. Since \scriptsize\ell_{i},\ell_{d}^{\prime}\subseteq\left(\begin{array}[]{c}\mathbb{D}^{(k-1)\times n}\\
0\\
\end{array}\right),
it follows from (78) that
φ(ℓi)⊆M+R or φ(ℓi)⊆N+R, i=1,2; φ(ℓd′)⊆M+R or φ(ℓd′)⊆N+R, d∈D∗.
Let either M′=M+R or M′=N+R.
Suppose that there is some k or d such that
φ(ℓk) or ℓd′ is not contained in a line in AG(M′).
Then, from (79) φ(A) is adjacent with three noncollinear points in AG(M′). By Lemma 2.8, we get φ(A)∈M′. Hence
φ(A)∈(M+R)∪(N+R).
Now, we assume that φ(ℓk) [resp. ℓd′] is contained in a line in AG(M′) for k=1,2 [resp. all d∈D∗].
Let X,Y∈ℓ1∪ℓ2∪d∈D∗ℓd′ with X=Y. Then
X∼Y and hence φ(X)∼φ(Y) and φ(X)=φ(Y). By (79), we have φ(A)∼φ(X) and φ(A)∼φ(Y).
Clearly, M+R or N+R
contains ⌈(∣D∣+1)/2⌉ elements of the set {φ(ℓ1),φ(ℓ2),φ(ℓd′),d∈D∗}.
Without loss of generality, we assume that M+R contains ⌈(∣D∣+1)/2⌉ elements of the set
{φ(ℓ1),φ(ℓ2),φ(ℓd′),d∈D∗}. Then, M+R contains (∣D∣−1)⌈(∣D∣+1)/2⌉+1
distinct points in φ(ℓ1)∪φ(ℓ2)∪d∈D∗φ(ℓd′). Since ∣D′∣≤(∣D∣−1)⌈(∣D∣+1)/2⌉,
every line in AG(M+R) contains at most (∣D∣−1)⌈(∣D∣+1)/2⌉ points. Thus
AG(M+R) contains at least three noncollinear points. It follows from (79) that
φ(A) are adjacent with three noncollinear points in AG(M+R). Applying Lemma 2.8, we obtain φ(A)∈M+R.
Therefore, we always have φ(A)∈(M+R)∪(N+R) for any \scriptsize A\in\left(\begin{array}[]{c}\mathbb{D}^{k\times n}\\
0\\
\end{array}\right).
Then
[TABLE]
Taking k=m, we get (77).
\hfill□\vskip6.0ptplus2.0ptminus2.0pt
Remark 5.10
Let n,m,p,q≥2 be integers. By [23, Theorems 1.2 and 1.3], it is easy to see that
every degenerate graph homomorphism φ:Fqm×n→Fqp×q is a (vertex) colouring.
When D=D′=F2 or F3,
Both Theorem 4.1 and Corollary 5.7 still hold (cf. [23, 13, 17]).
However, when q≤3 with q<q′, it is an open problem to characterize the non-degenerate graph homomorphisms from Fqn×n to Fq′p×q.
Acknowledgments
This work was supported by the National Natural Science Foundation of China (Project 11371072), and
the Scientific Research Fund of Hunan Provincial Education Department 16C0037.