Embedding of Unimodular Row Vectors

: In this paper, we mainly study the embedding problem of unimodular row vectors, focusing on avoiding the identiﬁcation of polynomial zeros. We investigate the existence of the minimal syzygy module of the ZLP polynomial matrix and demonstrate that the minimal syzygy module has structural properties that are similar to the fundamental solution system of homogeneous linear equations found in linear algebra. Finally, we provide several embedding methods for unimodular vectors in certain cases


Introduction
In the fields of mathematical theory and engineering calculations, algorithmic algebra and symbolic computation hold significant scientific importance and application value.Some mathematical and engineering problems, such as algebraic topology, circuit analysis, multi-dimensional control, signal processing, multi-dimensional systems, algebraic geometry, and computer algebra can be transformed into problems in terms of multivariate polynomial matrices.Algorithmic algebra and symbolic computing play important roles in solving these problems [1][2][3][4][5][6][7][8][9][10][11][12].Topics related to polynomial matrix decomposition, equivalence, and embedding problems have consistently been hot topics in this field.
In 1955, French mathematician J.P. Serre proposed a conjecture: Finitely generated projective modules are free in a polynomial ring over a field.After more than 20 years of research and exploration [13][14][15][16][17][18][19][20][21][22], in 1976, Quillen [23] and Suslin [24] independently and almost simultaneously solved Serre's conjecture.The solution to this conjecture is equivalent to proving that any ZLP polynomial matrix can be embedded into a polynomial invertible matrix.The solution of Serre's conjecture has profoundly impacted algebraic geometry, computational algebra, symbolic computing, and topology.But this only proves the correctness of the conjecture in theory.In mathematical theory and engineering calculations, there is a need to obtain the specific polynomial invertible matrix after embedding.In 1992, Logar [25] presented an algorithm for the Quillen-Suslin theorem, focusing on the embedding problem of the ZLP polynomial matrix A(x).The core of the algorithm first requires identifying the polynomial invertible matrix U(x), so that A(x) • U(x) = (E 0).Then it is demonstrated that the final columns of the multivariate polynomial matrix U(x) constitute a group of free bases for the syzygy module of the polynomial matrix A(x); that is, the minimal syzygy module.Finally, a method to compute the free bases of the syzygy module is provided, but the algorithm needs to calculate the zeros of the polynomial.In 2007, Fabianska [26] presented the QS algorithm for the commutative ring.The algorithm first finds the normalized component in the last variable of the polynomial ring.Subsequently, it finds the qualified matrix on the local ring and finally promotes the local solution to obtain the matrix U(x).But the algorithm needs to calculate the maximum ideal containing a specified ideal, which equates to calculating the zeros of the polynomial.As is well known, Abel and Galois proved that there is no formulaic solution for a univariate quintic equation, and the challenge of determining zeros of higher-order univariate polynomials has not been fully solved.
The Quillen-Suslin theorem has established an important foundation for the study of multivariate polynomial matrices, strongly promoting advancements in related theories and applications in related fields.Although the Quillen-Suslin theorem theoretically proves that any ZLP polynomial matrix can be embedded into a polynomial invertible matrix, how to find the above polynomial invertible matrix has always been a difficult problem for mathematical workers.According to research, the embedding problem of the ZLP matrix can be transformed into the study of the embedding of unimodular vectors using a recursive method.This paper mainly studies the embedding problem of unimodular vectors, and we present several embedding methods for unimodular vectors in certain cases.

Preliminaries and Results
In the following, let with coefficients in the field K; R l×m denotes the set of l × m matrices with entries in R, E r denotes the r × r identity matrix, and 0 r×t denotes the r × t zero matrix.
To avoid confusion, and for simplicity, A(x) will be denoted by A.
Firstly, we provide several basic definitions.
We know that the right inverse matrix is easy to calculate [17], but the right zero matrix involves calculating free bases, and it is difficult.Definition 3. In the ring R n×1 , a solution vector that satisfies A • y = 0 is termed a syzygy of the equations A • y = 0, and the set of all solution vectors is termed the syzygy module of matrix A, denoted as Syz(A).The set with the least number of generating elements in the syzygy module is called the minimal syzygy module.Definition 4. The embedding of a ZLP matrix A ∈ R s×t (s < t) refers to completing the ZLP matrix A to a square invertible matrix B ∈ R t×t , i.e., the rows of A in B be ordered in the same manner as in A; we say that the embedding of A can be implemented.Definition 5. Let A ∈ R s×t (s < t) be a ZLP matrix; the solution set vector α 1 , α 2 , . . ., α r of the homogeneous linear equation system A • y = 0 is termed the fundamental solution system of A • y = 0 if the following two conditions are met: (1) α 1 , α 2 , . . ., α r is linearly independent on ring R, i.e., if there exists u 1 , u 2 , . . ., u r ∈ R, such that u (2) For any solution vector β with A • y = 0, there exists u 1 , u 2 , . . ., u r ∈ R, such that If the above equation holds, we can say that β can be represented as an R-combination of α 1 , α 2 , . . ., α r .
From the definitions, it is easy to see that the solution vector of the homogeneous linear equation system A • y = 0 is syzygy of A, and the fundamental solution system of A • y = 0 corresponds to the minimal syzygy module of A.

Lemma 1.
Let A ∈ R s×t (s < t) be a ZLP matrix, then the right zero matrix of A must exist.
Proof.Since A is a ZLP matrix, by the Quillen-Suslin theorem, there exists and block B into B = (P Q), where P ∈ A t×s , Q ∈ A t×(t−s) , then we have , and Q is a ZRP matrix, i.e., Q is a right zero matrix of A.
Thus, F can be embedded into the invertible matrix U −1 .
Since the right inverse matrix of F can be easily found, the embedding problem of F can be transformed into finding the right zero matrix of F. Theorem 1.Let A ∈ R s×t (s < t) be a ZLP matrix, then the column vector of the right zero matrix Q of A constitutes the fundamental solution system of Ax = 0.
Proof.Assume α 1 , α 2 , . . ., α t−s is the column vector of Q.Thus, α 1 , α 2 , . . ., α t−s are all solution vectors of A • y = 0, if there exists u 1 , u 2 , . . ., Next, we prove that any solution vector β with A • y = 0 can be represented as an R-combination of α 1 , α 2 , . . ., α t−s .Assuming β is a solution of the original equation system A • y = 0, then β ∈ R t×1 , consider A • y = 0 as a linear equation system of the fraction field K(x 1 , x 2 , . . ., x n ), because the rank of A is s, then the number of vectors contained in the fundamental solution system of A • y = 0 is t − s, and α 1 , α 2 , . . ., α t−s is a fundamental solution system of the equation system, then , so β can be expressed as an R-combination of (α 1 , α 2 , . . ., α t−s ), and the column vector (α 1 , α 2 , . . ., α t−s ) of the right zero matrix of A constitutes the fundamental solution system of the original equation system A • y = 0. Lemma 2. Let A ∈ R s×t (s < t) be a ZLP matrix, Q 1 ∈ R t×(t−s) is the right zero matrix of A, then there exists P ∈ R t×s , such that (P Q 1 ) is an invertible matrix, and A • (P Q 1 ) = (E s 0 s×(t−s) ).
Proof.Since A is a ZLP matrix, according to the Quillen-Suslin theorem, there is an invertible matrix (P Q), such that A • (P Q) = (E s 0 s×(t−s) ), where P ∈ R t×s , Q ∈ A t×(t−s) .Since (P Q) is invertible, then Q is a ZRP matrix, and A • Q = 0; therefore, Q is the right zero matrix of A. And if the column vectors of Q, Q 1 are the fundamental solution system of A • y = 0, then there exists Since (P Q), diag(E s V) are both invertible matrices, then (P Q 1 ) is also an invertible matrix, A • (P Q 1 ) = A • (P QV) = (AP AQV) = (E s 0), and the conclusion is true.
is a matrix composed of a column vector based on the fundamental solution system of A • y = 0, then Q 1 is the right zero matrix of A.
Proof.According to the Quillen-Suslin theorem, there is an invertible matrix (P Q), such that A(P Q) = (E s 0 s×(t−s) ).It can be seen that Q is the right zero matrix of A.
We know that the embedding challenge for a ZLP matrix can be transformed into the embedding problems of unimodular rows.By addressing the embedding of a single unimodular row, we can recursively solve the embedding of a ZLP matrix.
Now, thinking about a matrix Proof.Thus, each column of E n − u • v belongs to Syz(v).Thinking about the matrix , where u is a ZRP matrix if we perform a column transformation on it, we have that According to the proposition of Lin [27], there exist unimodular matrices M, N ∈ R n×n , such that • N = (0, 0, . . ., 0).Therefore, each column of Q is a solution vector of v • y = 0 and Q is the right zero matrix of v.By theorem 1, Q is the fundamental solution system of v • y = 0. Since Q can be linearly represented by the column vectors of v, we have that any r ∈ Syz(v) can be linearly represented by the column vectors of E n − u • v and the column vectors of the matrix E n − u • v form the generating set for the syzygy of the unimodular row v.
where u, u ∈ R n×1 are unimodular columns, and v ∈ R 1×n is a unimodular row.
Proof.Without loss of generality, let i = 1, and then, we have where u 2 , . . ., u n ∈ R. By Formula (1), completing unimodular row v to a square invertible matrix where detV 1 = c, and then, we have where detV = 1.
If the embedding of v can be implemented, then, the embedding of u can be implemented.
Proof.Since the embedding of v can be implemented, by the Quillen-Suslin theorem, we assume that there is an invertible matrix We perform a linear row transformation on matrix Q • u; we have P • Q • u = [1, 0, . . ., 0] T where P is the elementary matrix product.Since P and Q are invertible matrices, by Proposition 1, we have solved the embedding of u.Theorem 6.If there are n − 1 components in v = (v 1 , v 2 , . . ., v n ), we generate the principal ideal, then the embedding of v can be implemented.
Since u = (u 1 , u 2 , . . ., u n ) T , and vu = 1, we set u = (0, q 2 , . . ., Thus, u and u are unimodular columns and v is a unimodular row.Think about the embedding of u, by Theorem 5, we have as an invertible matrix.Since v u = 1, by Lemma 4, we can obtain the invertible matrix, which includes v .Subsequently, since v u = 1, using Lemma 4 once more, we can solve the embedding of u . Assuming that the embedding of u = (u 1 , du 2 , . . ., du n ) T is where a ij ∈ R, i, j = 1, 2, . . ., n and detM = 1.Then by the properties of determinants, we have and N is an invertible matrix; therefore, we solved the embedding of u.
And because vu = 1, using Lemma 4, we can obtain the invertible matrix, which includes the v.

Algorithm and Example
Based on a well-known result on the connection of stable self-modules with orbits of unimodular rows, we have the following Algorithm 1.
q n m n d = d and q 2 m 2 + q 3 m 3 + . . .+ q n m n = 1.3: set u = (0, q 2 , . . ., q n ) T , v = (v 1 , m 2 , . . ., m n ), u = (u 1 , du 2 , . . ., du n ) T .Thus, u and u are unimodular columns and v is a unimodular row.4: By Theorem 5, compute the embedding of u. 5: By Lemma 4, compute the embedding of v .6: By Lemma 4, compute the embedding of u .7: By properties of determinants, compute the embedding of u. 8: By Lemma 4, compute the embedding of v and obtain the invertible matrix N, which includes v. 9: Return N.
Example 1.Let v = (1 + xy x x 2 y); thus, v is a unimodular row, and then, we calculate the invertible matrix after embedding vector v.

By calculation, we have
By Theorem 6, we assume

Conclusions
In this paper, we avoid the challenge of finding the zeros of multivariate polynomials by transforming the matrix embedding problem into studying matrix E n − uv.For special unimodular vectors, we provide embedding methods, but there are also many problems that need to be solved.Investigating these problems holds significant theoretical value and scientific relevance in algebraic geometry, computer algebra, symbolic computing, and topology.It will also enrich the content, ideas, and methodologies of algorithmic algebra

Theorem 3 .
and u, v is a unimodular.Below, we present an important theorem.The column vectors of the matrix E n − u • v is the generator set of the syzygy of unimodular row vector v, where v • u = 1.

1 +2 y 2 − 1  1  1 + xy + x x x 2 y xy 2 + 2 y 2
xy) u = (1 − xy x(xy − 1) xy) T .Thus, u and u are unimodular columns and v is a unimodular row.Think about the embedding of u, by Theorem 5, we have matrix.Since v u = 1, by Lemma 4, we can obtain the invertible matrix A, which includes v , where perform the row transformation on it, and we have xy + x 1 xy x 2 y 2 + x 2 y − x xy − 1 x 2 y 2 − xy xy(1 + xy + x) xy x By the Quillen-Suslin theorem, the inverse matrix of P is the matrix embedded with vector u , where P − 1) (1 + xy + x) xy xy 0 Using Lemma 4, we have that matrix Q is the matrix embedded with vector u, where because vu = 1, using Lemma 4, we can obtain the invertible matrix M embedded with vector v, where M =  xy − 1 xy − 1 x 2 y 2 − xy y(1 + xy + x) xy x

Definition 1 .
Let A ∈ R s×t (s < t); A is said to be a ZLP (zero left prime) matrix if the s × s minors of A generate the unit ideal R.