![MathJax Logo](/templates/jsp/_style2/_tandf/pb2/images/math-jax.gif)
ABSTRACT
A new equivalent version of Gordan’s theorem of the alternative is presented based on the system of linear inequalities. Such a version has a more intuitive geometric interpretation than Gordan’s theorem. The real Jordan canonical form theorem is utilized in proving the theorem.
PUBLIC INTEREST STATEMENT
This note examines whether a system of linear inequalities is solvable or a system of linear equations has a positive solution. In this note, we also investigated the geometrical properties of real linear operators by the use of its Jordan canonical form.
1. Introduction
Let denote the set of vectors with size
, and
denote the collection of
-by-
real matrices. The following theorem examines circumstances under which a system of linear equations has a positive solution.
Theorem 1 (Gordan’s theorem). Let be arbitrary. Then, either the system
has a nonzero solution , or the system
has a solution , but never both.
Theorem 1, due to Gordan (Gordan, Citation1873), has a long history and has been reproved numerous times. The survey by Kjeldsen (Kjeldsen, Citation2002) attributed the historical development of the theory of the systems of linear inequalities (1.1) and (1.2). It was rediscovered by Stiemke (Stiemke, Citation1915), representing a large class of theorems of the alternative that play an important role in linear and nonlinear programming. Such theorems are crucial in deriving optimality conditions for wide classes of extremal problems. For more background information and applications on the theorems of the alternative and other relevant matters, we refer to the textbooks (Ciarlet, Citation1989; Gill et al., Citation1991; Mccormick, Citation1983; Osborne, Citation1985), the surveys (Dax, Citation1993; Saunders & Schneider, Citation1979), and research papers (Dax & Sreedharan, Citation1997; Galán, Citation2017; Giannessi, Citation1984; Mangasarian, Citation1981).
Gordan (Gordan, Citation1873) and Stiemke (Stiemke, Citation1915) proved Theorem 1 by induction independently. However, they did not give any motivation for this investigation. Such an investigation do not make clear why the theorem works; see e.g. (Gale, Citation1960). Recent proofs are usually based on separation theorems of the convex sets with a simple geometrical interpretation. In this note, we present a simple self-contained proof which is based on elementary arguments in linear algebra.
The paper is organized as follows. In the next section, we will present a new equivalent form of Theorem 1. And in Section 3, we will give a simple, elementary proof of the equivalent form by the use of the real Jordan canonical form. The last section contains conclusions and some remarks.
2. An equivalent form
Let denote the rank of the matrix
. Clearly, one has
For the sake of avoiding trivial cases, we always assume that is greater than zero. By the theory of the linear algebra (Wilkinson & Reinsch, Citation1971), there is an invertible matrix
and a permutation matrix
such that
where is a
-by-
real matrix, and
denotes a unit matrix with a suitable size. The left product is equivalent to performing a series of elementary row operations on the matrix
. Then the system of equations in (1.1) can be rewritten as follows:
If , where
and
, then
means that both
and
hold. This results in our main theorem, an equivalent algebraic version of Gordan’s theorem (Theorem 1).
Theorem 2. (The Main Theorem). Let be arbitrary. Then, either the system
has a nonzero solution , or the system
has a solution , but never both.
From this it is simple to prove Gordan’s theorem (Theorem 1). Our main theorem has a more intuitive geometric interpretation than Gordan’s theorem in the sense discussed below but despite this is perhaps simpler to prove.
In the following statement, we assume without loss of generality that , i.e. the matrix
is square (if not, make it a square matrix by adding zero rows or columns).
Let and
denote the positive and the nonnegative quadrant cones, respectively, that is,
If is a linear operator represented by the matrix
, then the solvability of the system (2.3) is equivalent to that
while the solvability of the system (2.4) is equivalent to that
where is the adjoint operator of
, and it can be represented by the matrix
when
is a real matrix.
3. Proofs
The Jordan canonical form is described with reference to matrices known as elementary Jordan blocks. An elementary Jordan block of size associated with an eigenvalue
will be denoted by
, and its general form is adequately illustrated by the definition
The basic theorem is that given any matrix with complex entries, there exists a nonsingular matrix
such that
where , the Jordan canonical form of
, is block diagonal, each diagonal matrix being an elementary Jordan block with
. Apart from the ordering of the blocks along the diagonal of
(which can be arbitrary), the Jordan canonical form is unique, although
is far from unique.
Following we mainly consider the Jordan canonical form when the matrix has only real entries. In this case, all the nonreal eigenvalues must occur in conjugate pairs. Moreover, if
is an eigenvector of the real matrix
associated with the complex eigenvalue
, then
must be an eigenvector of
associated with the conjugate eigenvalue
, where
,
and
is the imaginary unit, i.e.
. That is
or equivalently,
in which the right real matrix, denoted by
, has eigenvalues
. If
, then
So the linear operator represented by the matrix on the real space
is a superposition of rotation and stretching. Of course, the rotation angle of the corresponding adjoint operator, represented by the matrix
, is the opposite of the rotational angle of
. When
or
, such two linear operators have no eigenvector on the
-dimensional real space
.
Note that the structure of the Jordan blocks corresponding to the conjugate eigenvalue must be the same as the structure of the Jordan blocks corresponding to the eigenvalue
, e.g. see, (Horn & Johnson, Citation1990). For example, if
is a complex eigenvalue of the real matrix
, and if
appears in the Jordan canonical form of
with a certain multiplicity,
must also appear with the same multiplicity. Then, the block matrix
is permutation similar to the block matrix
If and
, then it is also similar to the matrix
In general, each block pair of conjugate -by-
Jordan block
with nonreal is similar to a real
-by-
block of the form
These observations lead us to the real Jordan canonical form, see, (Horn & Johnson, Citation1990).
Theorem 3. Each real matrix is similar to a block diagonal real matrix of the form
where is a nonreal eigenvalue of
for
,
are real,
are real eigenvalues of
. The real Jordan block
is of the form (3.3), and the Jordan block
are exactly the Jordan blocks in (3.2) with
.
The motivation to prove our main theorem drives us to investigate the connection between the real Jordan canonical forms of the real matrix and its transpose. A simple observation is that if the real matrix
has a real Jordan canonical form
, then its transpose has a real Jordan canonical form
. This yields the following result.
Corollary 4. Let the real Jordan canonical form of the real matrix
be defined by (3.4).
(1) If is an eigenvector of
associated with the Jordan block
, then
is an invariant subspace of , in which
has one linearly independent real eigenvector on
;
(2) If are eigenvectors of
on the complex space
associated with the real Jordan block
, where
, then
is an invariant subspace of on
;
(3) is a direct sum of the subspaces
, i.e.
Proof. If , then the result is trivial. Otherwise, each Jordan block
and its transpose
have only one linearly independent real eigenvector
and
, respectively, where
and
denote the last column and the first column of the unit matrix with order
. Then, it is easy to verify that the above results for the real Jordan canonical form
hold. Then, the desired results hold since the similarity invariance of the subspaces
.□
If the real matrix in Corollary 4 is replaced by its transpose, then the corresponding result also is true. We may obtain another decomposition of
in the form of the matrix
Of course, we have for all
.
It follows from Corollary 4 that if and
denote the geometric multiplicity and the eigensubspace of
associated with the matrix
, then the null space of
is equal to
In addition, the first and last terms of Corollary 4 is still true when is a complex matrix, only if the transpose matrix
is replaced by the conjugate transpose matrix
, and the corresponding Jordan block
is replaced by
.
Let
and
be invariant subspaces of , where
are eigenvalues of
associated with the eigenvalues
. Then
such that
on one 2-dimensional real subspace
rotates the angles
, while the adjoint operator
on the subspace
rotates the angles
.
Now we ready to Theorem 2.
Proof of the main theorem. It is easy to show that both two inequalities (2.5) and (2.6) cannot be true together. From Corollary 4, we only need prove that at least one of them holds for each ,
. The proof requires consideration of two cases.
When the eigenvalue is a real number, the inequality (2.6) holds on
if and only if
, while the inequality (2.5) holds on
if and only if
.
When the eigenvalue is a complex number, the inequality (2.6) holds on
if and only if
, while the inequality (2.5) holds on
if and only if
. The proof is finished.
Finally, Gordan’s theorem follows from our main theorem trivially.
4. Concluding remarks
In this note, we have given an alternative proof of Gordan’s theorem, a proof that is based on the real Jordan canonical form. Another purely algebraic ways are to apply the property of the orthogonal or antisymmetric matrix. See, for example, (Broyden, Citation1998) and (Tucker, Citation1956; Vajda, Citation1961). This approach still don’t make clear why the theorem works. In our proof, a new geometrical interpretation for a pair of real linear adjoint operators is presented.
Other theorems of the alternative seem to be also related to the above geometrical interpretation. This will be our further work.
Acknowledgements
This study was funded by the National Natural Science Foundation of China (11871118). The author has received research grants from Yangtze University. The author declares that he has no conflict of interest. The author is indebted to the anonymous referees, whose detailed remarks helped in improving the manuscript.
Disclosure statement
No potential conflict of interest was reported by the author(s).
Additional information
Funding
Notes on contributors
![](/cms/asset/29631ab2-2ac0-474f-b95d-b10f574120de/oama_a_2068740_ilg0001.jpg)
Zi-Zong Yan
Zi-Zong Yan is currently a professor in the school of information and mathematics at Yangtze university. He received his Ph.D. degree in the school of mathematics and statistics from Wuhan university in 2005. His current research interests are in the area of optimization theory and matrix analysis.
Zhi-Jia Shu
Zhi-Jia Shu was born in Hubei, China, in 1995. He received his Bachelor’s degree in the school of information and mathematics at Yangtze university, in 2019. Currently, he is a master in reading at Yangtze university. His research interest is optimization theory.
References
- Broyden, C. G. (1998). A simple algebraic proof of Farkas’s lemma and related theorems. Optimization Methods and Software, 8(3–4), 185–5. https://doi.org/10.1080/10556789808805676
- Ciarlet, P. G. (1989). Introduction to numerical linear algebra and optimization. Cambridge University Press.
- Dax, A. (1993). The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review. Annals of Operations Research, 46(1), 11–60 https://doi.org/10.1007/BF02096256
- Dax, A., & Sreedharan, P. (1997). Theorems of the alternative and duality. Journal of Optimization Theory and Applications, 94(3), 561–590. https://doi.org/10.1023/A:1022644832111
- Galán, M. R. (2017). A theorem of the alternative with an arbitrary number of inequalities and quadraticprogramming. Journal of Global Optimization, 69(2), 427–442. https://doi.org/10.1007/s10898-017-0525-x
- Gale, D. (1960). The theory of linear economic models. McGraw-Hill.
- Giannessi, F. (1984). Theorems of the alternative and optimality conditions. Journal of Optimization Theory and Applications, 42(3), 331–365. https://doi.org/10.1007/BF00935321
- Gill, P. E., Murry, W., & Wright, M. H. (1991). Numerical linear algebra and optimization. Vol. 1 Addison-Wesley.
- Gordan, P. (1873). Über die auflösung linearer gleichungen mit reelen coefficienten. Mathematische Annalen, 6(1), 23–28. https://doi.org/10.1007/BF01442864
- Horn, R. A., & Johnson, C. R. (1990). Matrix analysis. Cambridge University Press.
- Kjeldsen, T. H. (2002). Different motivations and goals in the historical development of the theory of systems of linear inequalities. Archive for History of Exact Sciences, 56(6), 469–538. https://doi.org/10.1007/s004070200057
- Mangasarian, O. L. (1981). A stable theorem of the alternative: An extension of the Gordan theorem. Linear Algebra and Its Applications, 41, 209–223. https://doi.org/10.1016/0024-3795(81)90100-2
- Mccormick, G. P. (1983). Nonlinear programming. John Wiley.
- Osborne, M. R. (1985). Finite algorithms in optimization and data analysis. John Wiley & Sons.
- Saunders, B. D., & Schneider, H. (1979). Applications of the Gordan-Stiemke theorem in combinatorial matrix theory. SIAM Review, 21(4), 528–541. https://doi.org/10.1137/1021094
- Stiemke, E. (1915). Über positive Lösungen homogener linearer Gleichungen. Mathematische Annalen, 76(2–3), 340–342. https://doi.org/10.1007/BF01458147
- Tucker, A. W. (1956). Dual systems of homogeneous linear relations. In H. W. Kuhn & A. W. Tucker (Eds.), Linear Inequalities and Related Systems (pp. 3–18). Ann Math Stud. Princeton Univ. Press.
- Vajda, S. Mathematical programming, Addison Wesley: 1961.
- Wilkinson, J. H., & Reinsch, C. (1971). Linear algebra, handbook for automatic computation (Vol. 2). Springer-Verlag.