![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
Abstract
It is shown that if a matrix -algebra
over certain
-fields
contains a positive
-cycle
such that
is a
-element on
then it is isomorphic to the
-algebra
over
with the entrywise lattice order.
AMS Subject Classification:
Public Interest Statement
Given a positive integer n, a n by n matrix is a square array consisting of n rows and n columns of numbers. We could add two matrices, multiply two matrices, and compare two matrices by certain rules. Matrices with those operations consist of a very important research area in mathematics, and it has rich applications to other areas in mathematics, physics, etc.
The present research continues the study of matrices with the operations and order. It considers matrices with the operations and order in a more general setting to generalize some important known results. The article exposes more properties of such matrices to better understand them.
1. Introduction
Let be a lattice-ordered ring (
-ring) with the positive identity element and
(
) be the
matrix ring over
.
may be made into an
-ring by defining a matrix in
positive if each entry of the matrix is positive in
. This lattice order on
is called the entrywise lattice order. Since
has the positive identity element, the identity matrix of
is positive with respect to the entrywise lattice order. In 1966, Weinberg first proved that if
is an
-ring in which the identity matrix is positive, where
is the field of rational numbers, then it is isomorphic to the
-ring
with the entrywise lattice order (Weinberg, Citation1966). Then in Ma and Wojciechowski (Citation2002) it was proven that this fact is true for any totally ordered subfield
of the field
of real numbers and any
matrix algebra over
. Whether or not the above fact is true for an
(
) matrix algebra over an arbitrary totally ordered field is still an open question. Under some stronger conditions, though, the result is true; for instance, if an
-algebra
(
) contains a positive
-cycle, where
is an arbitrary totally ordered field, then it is isomorphic to the
-algebra
with the entrywise lattice order (Ma, Citation2000). The reader is referred to Steinberg (Citation2010) for more information on research activities in this area.
The same problem for matrices over a lattice-ordered field (-field) has not been studied. In this article, we consider
matrix
-algebra over certain Archimedean
-fields. We first provide an example to show that the
matrix
-algebra
over an
-field
may not be isomorphic to the
with entrywise lattice order even it contains a positive
-cycle.
Example 1.1
Consider the -field
with coordinatewise lattice order, that is,
if
and
in
. Now define a matrix
to be positive if each
is greater than or equal to zero with respect to the usual total order in
. Since the coordinatewise lattice order on
is contained in the total order induced from
,
is an
-algebra over
and the identity matrix is positive under this order. We notice that this lattice order is not the entrywise lattice order on
over the
-field
, for instance, the matrix
is positive, where
is the identity matrix, but
is not positive in
with respect to the coordinatewise lattice order. The
matrix
is an
-cycle as defined below, where
are standard matrix units. It is clear that
is positive in the above lattice order defined on
.
The main result of this article is a proof that for a certain -field
, if the
-algebra
over
contains a positive
-cycle
such that
is also a
-element on
then the
-algebra is isomorphic to the
-algebra
with the entrywise lattice order. We will briefly review few definitions and results, the reader is referred to Birkhoff and Pierce (Citation1956) and Steinberg (Citation2010) for general information on
-rings and undefined terminologies.
We call the permutation matrix as an
-cycle in the
matrix ring, where
are the standard matrix units, that is,
entry of
is 1, and other entries are zero. For an
-field
, the
-ring
is called a lattice-ordered algebra (
-algebra) if for any
and
,
. A positive element
of
is called a
-element on
(on
) if for any
,
in
(if for any
,
in
), and a positive element
is called a
-element on
(on
) if for any
,
in
(if for any
,
in
). It is well known that if
are both positive then
is a
-element both on
and on
, and if
are both positive, then
is a
-element on
but may not be a
-element on
. For instance, the element
in Example 1.1 is not a
-element on
. We refer the reader to Steinberg (Citation2010) for more information on properties of
-elements.
2. Main result
Let be an
-field with a positive identity element 1. It is well known that 1 is a basic element in the sense that for any
or
. Define
. Then
is the largest totally ordered subfield of
(Schwartz, Citation1986, Theorem 4). In the following, we always assume that
is an Archimedean
-field and finite-dimensional as a vector space over
. Then
has a
-basis
(Schwartz, Citation1986, Corollary, p. 186), that is,
and
, where
, if and only if each
. Moreover, we assume that each
is a
-element on
. Then
since
implies that
.
A simple example of this situation is with the coordinatewise lattice order. Then
,
is a
-basis of
over
. It is clear that
and
are
-elements on
and on any
-algebra
.
Suppose that is an Archimedean
-field with
and suppose
is finite-dimensional over
with a
-basis that consists of
-elements of
. Consider the
matrix algebra
over
with
. Suppose that
is an
-algebra over
. Then
is also an
-algebra over
since the lattice order on
extends the total order of
. Since
contains no nonzero nilpotent ideals,
is Archimedean over
(Birkhoff & Pierce, Citation1956, Corollary 1, p. 51). Since
is also finite-dimensional over
, it implies that
is a direct sum of maximal convex totally ordered subspaces over
(Conrad, Citation1961, Theorem 7.3, p. 232). Let
be a
-basis of
over
in which each
is a
-element of
. We will assume that
, the identity element of
. The identity matrix of
is denoted by
. The following is the main result of the paper.
Theorem 2.1
Suppose that is an
-algebra over
. If
contains a positive
-cycle
and
is a
-element on
then the
-algebra
is isomorphic to the
-algebra
over
with the entrywise lattice order.
Proof
As we discussed in the previous paragraph, is a direct sum of maximal convex totally ordered subspaces of
over
. Since the identity matrix
,
is a sum of disjoint basic elements. Suppose that
is a basic element. Since
for each
, every
is also a basic element of
. For
, define
and
. Then each
is a maximal convex totally ordered subspace of
over
since
is a
-module over
, and each
is a convex
-subspace of
over
. We divide the proof of Theorem 2.1 into several lemmas.
Lemma 2.2
for
and
.
Proof
Clearly the sets and
of maximal convex totally ordered subspaces over
are either identical or disjoint (Conrad, Citation1961, Lemma 3.1). Thus either
or
. Suppose that
. Then
, so
and hence
for some
since
is basic. Thus,
and
are comparable. On the other hand,
and
is a
-element on
, so
Since ,
and also . Thus
, which is a contradiction. Therefore, we must have
for
.
Lemma 2.3
.
Proof
Let ,
. Then by Lemma 2.2,
is a disjoint set, that is,
. For each
, since
, we have
Indeed, since and
for
, the characteristic polynomial of
is
, so
has
distinct eigenvalues and hence the eigenspace for each eigenvalue is of one-dimensional. From
, each column in
is an eigenvector of
to 1. Then each column in
is a scalar multiple of the vector
, each of whose components is equal to 1. Similarly, each row of
is a scalar multiple of
, the transpose of
. Thus,
for some
.
Let in
. Then since
is a
-element on
,
so , and hence
for each
. Similarly we show that
for
, and so
is a disjoint set in
. Since each positive element in
is a positive linear combination of
, each
is a strictly positive multiple by a scalar in
of exactly one of
, so without loss of generality, we may assume that
, where
,
.
Suppose that . Then there exists a maximal convex totally ordered subspace
of
over
which is not in the sum of
. Let
and
. Then
and by a similar argument as before
for some
, and
in
for
. Hence
in
for
, so
, which is a contradiction. Therefore,
.
Lemma 2.4
For each ,
is a direct sum.
Proof
To prove that is a direct sum, we show that any two summands are different, and thus they must have zero intersection (Conrad, Citation1961). For
with
or
, suppose first that
. Then for any
,
and
are comparable. If
then
, which is a contradiction. Similarly
. Thus,
for all
, so
for all
. For any
,
, since
and
are comparable,
and
are comparable, so
by
and previous arguments. Hence,
for all
, so
for all
,
. Since
by Lemma 2.3, we have
for all
. In particular,
, so
, and hence
and
. Therefore,
for any
, that is,
is in the center of
with
, which is a contradiction. Hence, for
with
or
,
.
Now for , suppose that
. If
then
if
, which is a contradiction by previous paragraph. If
then
, which is again a contradiction. Thus,
. Similarly,
, and hence
. Similarly,
. Therefore,
is a direct sum of
maximal convex totally ordered subspaces
,
.
We notice that since and
is a direct sum of
totally ordered subspaces over
, each
,
, is one-dimensional over
, so
for each
.
Lemma 2.5
is isomorphic to the
-algebra
over
with the entrywise lattice order.
Proof
First, we notice that cannot be a basic element since in that case,
, so
implies that
, which is a contradiction by Lemma 2.5. Suppose that
, where
are disjoint basic elements and
. For each
,
implies that each
is an
-element for
, and
is also a basic element since
.
We claim that . For
, since
is basic, there exists
for some
such that
and
are comparable. We show that
. Since
and
are comparable,
for any
and
. Otherwise
and
will be comparable since both are basic elements, so
, which implies that
and
are comparable, a contradiction. Then from
we have , and similarly
. Thus
, so each
,
, appears in the sum
.
Next, we show that each ,
, is equal to
for some
. We first notice that since
,
, appear in the sum for
, they are disjoint
-element, so
for
. Since
is basic,
for some
and
,
. Then that
is idempotent implies that
, so
. Suppose that
, where
. Thus
. From
, we have
for some
, then
, and hence
, otherwise
. It follows from
that
, an identity element of
. Therefore,
.
Since is a sum of disjoint elements, each
is an idempotent
-element and
for
. Thus,
is an
-algebra over
. For
, define
. Then
is a disjoint set of basic elements and also a set of
matrix units. It follows that
is a direct sum as a vector lattice over
. Define
by
, where
. Then
is an
-isomorphism between two
-algebras over
, so
is isomorphic to the
-algebra
with the entrywise lattice order.
Now for ,
and
implies that
,
. Therefore, the
-algebra
is isomorphic to the
-algebra
over
with the entrywise lattice order. This completes the proof of Theorem 2.1.
Example 1 shows that the condition “ is a
-element on
" couldn’t be omitted in Theorem 2.1. However, if
is a totally ordered field then this condition is automatically satisfied, so it is not necessary.
By Schwartz (Citation1986, Theorem 10), under the assumption for the -field
in Theorem 2.1, the lattice order on
is uniquely extendible to a total order. Although we believe that if
is not a
-element on
then the lattice order on
is defined by the unique total order on
just like the situation in Example 1.1, we lack the ability to prove it. In the next, we will show that this fact is true for the simplest case.
3. ![](//:0)
case
Let be an Archimedean
-field which is a two-dimensional extension of
and let
be a
-basis of
over
and let
be a
-element. Suppose that
is a
matrix
-algebra over
and that
. By Theorem 2.1, we know that if
is a
-element on
then
is isomorphic to the
-algebra
with the entrywise lattice order. In this section, we show that if
is not a
-element on
then the lattice order on
is the lattice order defined in Example 1.1.
Theorem 3.1
Let be an
-algebra over
in which
is positive, but
is not a
-element on
. Then the lattice order on
is defined by declaring a matrix
to be positive if each
in
, where
is the unique total order that extends the lattice order on
.
Proof
As before, suppose that is the unique largest totally ordered subfield of
and
is an
-basis of
over
where
is a
-element. From the discussion in the previous section,
is a direct sum of totally ordered subspaces of
over
.
We first show that . Let
. Then
, so
for some
. Since
,
is an
-element of
, so
implies that
. Thus,
implies that
, and hence either
or
. If
then
implies that
, which is a contradiction. Thus, we must have
, so
.
Next, we show that cannot be a basic element. Assume, on the contrary, that
is basic. Therefore,
is also basic. Suppose that
, where each
is a totally ordered subspace of
over
and
. We may assume that
and
. We consider two cases.
(1) |
| ||||
(2) |
|
We claim that . If
then we have
. Since
, we may assume
. Then
implies that
, which is a contradiction. Suppose that
. Then
is disjoint and
is eight-dimensional over
, so
is a
-basis of
over
. It is straightforward to check that
is a basic element, and hence
or
for some
. In the first case, we have
, which is a contradiction. So
, and hence
. Hence
, so
or
, which is again a contradiction. Therefore, we must have
, so
.
Thus, we have , where
are disjoint basic elements. Then as we have discussed before
and
. Let
, where
and each
is a maximal convex totally ordered subspace of
over
. Assume that
, and define
. Then
. Since
is basic,
for some
. If
is not in
then
, where
. On the other hand,
implies that
, then
, which is a contradiction. Thus,
is one of
, so
is in one of
. If
then
, a contradiction. If
then
, so
. Similarly
is not comparable with
and
, so
. Since
and
are linearly independent over
,
is two-dimensional over
, and hence
,
, and
are all two-dimensional over
. Hence,
as a vector lattice over
.
Let us consider the structure of first. Since
are linearly independent over
,
. Then clearly
is a field that is isomorphic to
under the mapping
for any
. Since
is totally ordered,
will be totally ordered if we define an order
on
by saying that for any
,
if
in
. Take
, if
in
then since
is an
-algebra over
, we have
in
, so
in
. Thus, the total order
on
extends the lattice order
on
, and hence
since there is a unique total order on
that extends the lattice order
on
. Hence, for any
,
if and only if
in
.
Since , if we define the mapping
: for any
then clearly is an algebra isomorphism over
. We also have
Hence, the -algebra
is isomorphic to the
-algebra
with the lattice order defined by
if each
in
. This completes the proof.
Finally, we provide an example to show that the assumption that is a
-element cannot be omitted in Theorem 3.1.
Example 3.2
Let and
. Then
is a basis of vector space
over
. Define an element
to be positive if
and
. Since
,
becomes an
-field in which
is not a
-element since
but
. Another lattice order may be defined by the positive cone
. Then
. Now, we define a lattice order on
by calling a matrix
positive if each
. Since
,
is an
-algebra over
. We notice that
, and
is not a
-element on
since
but
. However, the lattice order on
is not defined by the usual total order extension of
.
Acknowledgements
The author thanks professor Yuehui Zhang (Shanghai Jiao Tong University) for valuable comments during the preparation of this paper.
Additional information
Funding
Notes on contributors
Jingjing Ma
Jingjing Ma’s research is in the area of Lattice-ordered Rings and Algebras that was first systematically studied by G Birkhoff and RS Pierce about 60 years ago. His interests involve different topics on lattice-ordered rings with the focus on trying to better understand the algebraic structures of such systems.
The algebraic structure of lattice-ordered matrix algebras has been one of his research topics. In 2000, working together with Wojciechowski (University of Texas at El Paso), they proved the so-called Weinberg’s conjecture, which states that there is only one lattice order on matrix rings over the field of rational number in which the identity matrix is positive. The present work continues the study of lattice-ordered matrix algebras in a more general setting. More precisely, this article considers lattice-ordered matrix algebras over certain lattice-ordered fields, which include totally ordered fields as a special case.
References
- Birkhoff, G., & Pierce, R. S. (1956). Lattice-ordered rings. Anais da Academia Brasileira de Ciências, 28, 41–69.
- Conrad, P. (1961). Some structure theorems for lattice-ordered groups. Transactions of the American Mathematical Society, 99, 212–240.
- Ma, J. (2000). Lattice-ordered matrix algebras with the usual lattice order. Journal of Algebra, 228, 406–416.
- Ma, J., & Wojciechowski, P. (2002). A proof of Weinberg’s conjecture on lattice-ordered matrix algebras. Proceedings of the American Mathematical Society, 130, 2845–2851.
- Schwartz, N. (1986). Lattice-ordered fields. Order, 3, 179–194.
- Steinberg, S. (2010). Lattice-ordered rings and modules. New York, NY: Springer.
- Weinberg, E. (1966). Scarcity on lattice-ordered matrix algebras. Pacific Journal of Mathematics, 19, 561–571.