Complexity

Complexity / 2018 / Article

Research Article | Open Access

Volume 2018 |Article ID 6235649 | 9 pages | https://doi.org/10.1155/2018/6235649

Minor Prime Factorization for -D Polynomial Matrices over Arbitrary Coefficient Field

Academic Editor: Eulalia Martínez
Received11 Jan 2018
Revised04 Sep 2018
Accepted10 Sep 2018
Published08 Oct 2018

Abstract

In this paper, we investigate two classes of multivariate (-D) polynomial matrices whose coefficient field is arbitrary and the greatest common divisor of maximal order minors satisfy certain condition. Two tractable criterions are presented for the existence of minor prime factorization, which can be realized by programming and complexity computations. On the theory and application, we shall obtain some new and interesting results, giving some constructive computational methods for carrying out the minor prime factorization.

1. Introduction

In the polynomial approach, pioneered by Rosenbrock [1], matrices over , are used to represent linear systems of ordinary differential equations. For more general linear functional systems, e.g., partial differential systems or delay-differential systems, the resulting system matrices are multivariate. The problem of multivariate (-D) polynomial matrix has attracted much attention over the past decades because of its diverse applications in -D systems, network theory, Wiener-Hopf equations, controls, and signal processing ([28]); its factorizations have attracted much attention over the past decades because of their wide applications ([925]). Lin-Bose conjecture is one of the important problems of -D polynomial matrix factorizations, which has been proved in [1520]. It gave a sufficient condition for a matrix to have zero prime factorization or minor prime factorization. After that, Lin et al. proposed a tractable criterion for the existence of minor prime factorizations for a class of -D polynomial matrices whose greatest common divisor of maximal order minors is . They have presented a constructive method for carrying out the minor prime factorization when it exists [14], where the coefficient field is the complex number field. In this paper, we investigate the -D polynomial matrices whose coefficient field is arbitrary and minor prime factorizations for two classes of -D polynomial matrices whose the greatest common divisor of maximal order minors is or . In this case, because the coefficient field is an arbitrary field, the many previous results (lemmas) cannot be used directly. By giving some new key lemmas, two tractable criterions for the existence of minor prime factorization are obtained. These criterions can be judged by using “programming of reduced Gröbner basis.” Furthermore, we give constructive computational methods for carrying out the minor prime factorization.

2. Notations and Preliminaries

For an arbitrary field , let denote the set of polynomial ring in variables with coefficients in and denote an algebraic closed field of . For the convenience, is denoted simply by ; when is the complex number field, is denoted simply by . Let denote the set of matrices with entries in and denote the zero matrices. Throughout the paper, the argument is omitted whenever its omission does not cause confusion.

Definition 2.1 (see [21]). Let be of normal rank and denote all the minors of the matrix . Extracting the greatest common divisor (g.c.d.), denoted by or , of gives Then, are called the reduced minors of .

Definition 2.2. Let be of normal full rank, then is said to be zero left prime (zero right prime) if the minors of generate the unit ideal , which is simplified as that is ZLP (ZRP).
First, the following two lemmas and a well-known result (Theorem 1 in [14]) are required.

Lemma 2.1. Let and . Supposing that , then is a divisor of .
The proof is simple and omitted.

Lemma 2.2. Let be polynomials, then they have no common zeros in (are zero coprime) if and only if there are such that i.e., is a ZLP row vector in , or generate the unit ideal .

Proof 1. Necessity. It is clear that . Let and denote the ideal generated by in and in , respectively. From the assumption and Hilbert Zero Theorem, . Then the unit element 1 (in ) may be represented by a Gröbner basis of , i.e., 1 may be reduced to 0 by . According to computational methods of , we have that , then 1 can be represented by in , i.e., there are such that Sufficiency. We assume that have common zeros in and is one of them. From (2), we have This is a contradiction. So have no common zeros in .

Theorem 2.1 (see [14]). Let , . Then a necessary and sufficient condition for to admit a minor prime factorization with , and is that there exists a full rank submatrix of such that the reduced minors of are zero coprime.

3. Main Results

For the complex number field and an -D polynomial matrix , from Lemma 2.2, we see that the reduced minors of are zero coprime if and only if the reduced minors of generate the unit ideal . In the following, we investigate the case in which , where is an arbitrary field (may be a finite field); we shall extend the range of applicability of Theorem 2.1 and present our main results. First, several key lemmas are presented.

Lemma 3.1. Let be of normal full rank, if the reduced minors of generate , then there is a ZLP matrix such that .

Proof 2. Since the reduced minors of generate the unit ideal , by Lin-Bose Theorem (Theorem 3.3 in [18]), can be factorized as such that is of normal full rank, and is ZRP. By Quillen-Suslin Theorem [26], there is a unimodular such that is its first rows, i.e., , where . Let , where , , then . Obviously, is ZLP. We have that .

Lemma 3.2. Let and , where for . Then rank is , where .

Proof 3. Let , for , we may write as where , .
Setting , , we have that . Since , then there is an minor of such that is a simple divisor of . Let denote an submatrix consisting of the rows of such that is a simple divisor of . Then Since , where , , is independent of , and is a simple divisor of , by the properties of determinant, some exists such that From (7) and Laplace Theorem, there is a permutation of such that It is obvious that , then is an minor of . Since , combined with (8), we have that rank is .

Lemma 3.3. Let and , where for . Then rank for every , and rank ; furthermore, the minors of generate the unit ideal , where .

Proof 4. For arbitrary but fixed , where , let , then are distinguished. Assuming that , for , we may write as where , .
Setting , , then we have that , Since , where , and , is a simple divisor of , by the properties of determinant, there is some such that From (11) and Laplace Theorem, there is a permutation of such that It is obvious that , then is an minor of . Since , combined with (12), we have that rank is for every , i.e., the minor of have no common zeros in . Noting that , then rank . Furthermore, by Lemma 2.2, we obtain that the minors of generate the unit ideal .

Corollary 3.1. Let with , where are distinguished. Then rank , the minors of generate the unit ideal , where .

Lemma 3.4. Let , , where for . Then, for , where , is an invertible matrix.

Proof 5. Since , for , by Lemma 3.3, rank and the minors of generate . By Lemma 3.1, there is a ZLP vector such that . According to Quillen-Suslin Theorem [26], a unimodular matrix can be constructed such that is its first column, then where . Setting , then the desired results are obtained.

Lemma 3.5. Let , if is of normal full rank and has the following factorization: where , is a unimodular matrix. Then the reduced minors of generate the unit ideal .

Proof 6. We partition , as the following form, respectively, where , , , . Then is ZLP, i.e., the reduced minors of generate the unit ideal , and So the reduced minors of are the same as that of , which generate the unit ideal .

Theorem 3.1. Let be an arbitrary field, be of normal full rank , . Then a necessary and sufficient condition for to admit a minor prime factorization with , and is that there exists a normal full rank submatrix of such that the reduced minors of generate the unit ideal .

Proof 7. Necessity. Supposing that admits a minor prime factorization with , , and . From Lemma 3.4, , where is unimodular. Combined with (18), we have By Lemma 3.2, we see that the normal rank of is . Hence, from (19), there exists a normal full rank submatrix of such that where is a submatrix of . By Lemma 3.5, the reduced minors of generate the unit ideal .
Sufficieny. Assuming that there exists a normal full rank submatrix of such that the reduced minors of generate the unit ideal . According to Lemma 3.1, a ZRP vector can be constructed such that Since is of normal rank , by (21) and the fact that is a normal full rank submatrix of , we have By Quillen-Suslin Theorem [26], a unimodular square matrix can be constructed such that is its first column; combined with Lemma 2.1, we have where . It follows that where with .

Remark 3.1. When is the complex number field, according to Hilbert Zero Theorem, we see that the condition in Theorem 3.1 is the same as that of Theorem 2.1, and Theorem 3.1 is a generalization of Theorem 2.1.

According to Theorem 3.1, in order to check that satisfies the conditions of Theorem 3.1, we first find all the submatrices of , denoted by , where . For every , we compute the minors of , saying as . Let the ideal , we compute the reduced Gröbner basis of . If contains only a polynomial , by the following result (Theorem 3.2), the reduced minors of generate the unit ideal .

Theorem 3.2. Let be the greatest common divisor of , i.e., and be the reduced Gröbner basis of the ideal . Then contains only a polynomial if and only if generate the unit .

Proof 8. Necessity. Assuming that , it is obvious that , where . Then . Setting , since , we have that there are such that So . Thus, generate the unit ideal .
Sufficiency. Assuming that generate the unit ideal , then the reduced Gröbner basis of the ideal is . Furthermore, the reduced Gröbner basis of is .
The reduced Gröbner basis algorithm of an ideal can be found in [16].

Remark 3.2. From the discussion above, we see that judging whether satisfies the conditions of Theorem 3.1 or not, we only need to compute the reduced Gröbner basis of , where .

Lin et al. studied the matrix factorization for a class of matrix whose g.c.d. of maximal order minors has divisor ([13]); in the following, we study the minor prime factorization for this class of matrices and propose a tractable criterion.

Theorem 3.3. Let be an arbitrary field, be of normal full rank, , where are distinguished. Then admits a minor prime factorization with , , and if and only if there are normal full rank submatrices of such that the reduced minors of generate the unit ideal , where .

Proof 9. Necessity. Supposing that admits a minor prime factorization as follows: where , , and . For arbitrary but fixed , from (27) and Lemma 3.4, we have By Lemma 3.2, we obtain that rank is . Hence, from (28), there is a normal full rank submatrix of such that where is an submatrix of . By Lemma 3.5, the reduced minors of also generate the unit ideal .
Sufficiency. If there exists a normal full rank submatrix of such that the reduced minors of generate the unit ideal , according to Lemma 3.1, we can construct a ZRP vector such that By Lemma 3.2,