Integral points on varieties defined by matrix factorization into elementary matrices
Bruce W. Jordan, Yevgeny Zaytman

TL;DR
This paper studies varieties parametrizing factorizations of matrices into elementary matrices over rings of S-integers, showing that for sufficiently many factors, the integral points are Zariski dense under certain conditions, revealing infinite factorizations.
Contribution
It introduces matrix-factorization varieties $V_k(A)$, analyzes their geometric structure, and proves Zariski density of integral points for $k \,\geq\, 4$, extending understanding of matrix factorizations over rings of integers.
Findings
$V_k(A)$ are rational $(k-3)$-folds with fibration structure
For $k\geq 4$, integral points are Zariski dense if non-empty and units are infinite
Density holds for $k\geq 9$ under the same conditions
Abstract
Let be the ring of -integers in a number field . For and , we define matrix-factorization varieties over which parametrize factoring into a product of elementary matrices; the equations defining are written in terms of Euler's continuant polynomials. We show that the are rational -folds with an inductive fibration structure. We combine this geometric structure with arithmetic results to study the Zariski closure of the -points of . We prove that for the -points on are Zariski dense if assuming the group of units is infinite. This shows that if can be written as a product of elementary matrices, then this can be done in infinitely many ways inβ¦
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Integral points on varieties defined by matrix factorization into elementary matrices
BruceΒ W.Β Jordan
Department of Mathematics, Baruch College, The City University of New York, One Bernard Baruch Way, New York, NY 10010-5526, USA
Β andΒ
YevgenyΒ Zaytman
Center for Communications Research, 805 Bunn Drive, Princeton, NJ 08540-1966, USA
Abstract.
Let be the ring of -integers in a number field . For and , we define matrix-factorization varieties over which parametrize factoring into a product of elementary matrices; the equations defining are written in terms of Eulerβs continuant polynomials. We show that the are rational -folds with an inductive fibration structure. We combine this geometric structure with arithmetic results to study the Zariski closure of the -points of . We prove that for the -points on are Zariski dense if assuming the group of units is infinite. This shows that if can be written as a product of elementary matrices, then this can be done in infinitely many ways in the strongest sense possible. This can then be combined with results on factoring into elementary matrices for . One result is that for the -points on are Zariski dense if is infinite.
Key words and phrases:
matrix factorization, integral points, elementary matrices,
2010 Mathematics Subject Classification:
Primary 20G30; Secondary 11C20, 11G35
1. Introduction
Let be a number field and let be a finite set of primes of containing the archimedean valuations. Denote by the ring of -integers in :
[TABLE]
Factoring in is naturally parametrized by associated factorization varieties. For , set
[TABLE]
The (affine) variety is smooth, rational, irreducible, and of dimension . When , is a curve of genus [math] with points at infinity. Because there are fewer than points at on this rational curve, Siegelβs Theorem [siegel], [serre-mw, Chapter 7] does not force to have finitely many -points. And, indeed, is Zariski dense if and only if is infinite. It is easy to see that this generalizes for :
Theorem 1.1**.**
The -points on for are Zariski dense if and only if the group of units is infinite.
We would like to generalize this picture to matrices and consider integral points on matrix-factorization varieties. In this paper we give one such generalization to , considering the varieties parametrizing factoring into a product of elementary matrices. For define the upper triangular matrix , the lower triangular matrix , and the matrix by
[TABLE]
The elementary matrices over are the matrices , for ; . Set and note the identities
[TABLE]
We consider the (affine) matrix-factorization varieties defined by writing as a product of matrices from (2):
Definition 1.2**.**
Suppose .
- Define the variety by writing a product of elementary matrices beginning with a lower triangular matrix:
[TABLE]
- Define the variety by writing a product of elementary matrices beginning with an upper triangular matrix:
[TABLE]
-
Put . Note that if and only if can be written as the product of elementary matrices.
-
Define the variety by writing as product of of the βs and :
[TABLE]
In this paper our main result is the following analogue for matrix-factorization varieties of Theorem 1.1:
Theorem 1.3**.**
*Suppose and let be , , or . Assume the group of units is infinite.
1) Suppose . Then the -points on the rational and irreducible -fold are Zariski dense.
2) Suppose contains a real archimedean or a finite prime. Then the -points on are Zariski dense for .
3) Assume the Generalized Riemann Hypothesis as in [jz, Section 4]. Then the -points on are Zariski dense for if contains a real archimedean prime, for if contains a finite prime, and for in general.*
Roughly speaking, Theorem 1.3 says that if , then for sufficiently large, not only can every be written as the product of elementary matrices over , but this can be done in (infinitely) many ways in the strongest possible sense.
2. First properties of the Matrix-Factorization Varieties
, , andΒ
In fact we only have to study one of the three matrix-factorization varieties in Definition 1.2 and the three factorization problems are equivalent. Let
[TABLE]
with . Then we have and
[TABLE]
In other words, are the elements of order in a Klein Vierergruppe acting on the set .
Proposition 2.1**.**
- *Suppose . The polynomial equations in defining , , and in are identical. The following are equivalent:
*a) * .
*b) * \begin{cases}A=L(a_{1})U(a_{2})\cdots L(a_{k})\quad\mbox{if kis odd}\\ A=L(a_{1})U(a_{2})\cdots U(a_{k})\quad\mbox{ ifk is even}.\end{cases}
*c) * .
*d) * \begin{cases}A^{\prime}=U(a_{1})L(a_{2})\cdots U(a_{k})\quad\mbox{if kis odd}\\ A^{\prime}=U(a_{1})L(a_{2})\cdots L(a_{k})\quad\mbox{ifk is even}.\end{cases}
*e) *
*f) * .
*2. * In particular, the following are equivalent:
*a) * For every matrix , .
*b) * For every matrix , .
c) * For every matrix , .
Proof.
- The varieties and are defined by the same equations.
If is even, then
[TABLE]
If is odd, then similarly
[TABLE]
proving 1).
- The varieties and are defined by the same equations.
We have and . Verify by induction that for odd
[TABLE]
and for even
[TABLE]
proving 2). β
Proposition 2.2**.**
*Suppose . The following are equivalent:
*a) * .
b) * \begin{cases}(a_{k},a_{k-1},\ldots,a_{1})\in V_{k}(A^{\ast})(\mathcal{O})\subseteq\mathbb{A}^{k}(\mathcal{O})\quad\mbox{if kis odd}\\ (a_{k},a_{k-1},\ldots,a_{1})\in V_{k}(A^{t})(\mathcal{O})\subseteq\mathbb{A}^{k}(\mathcal{O})\quad\mbox{ifk is even}.\end{cases}
Proof.
Proposition 2.2(a) is equivalent to Proposition 2.1(b). We need only note that if is odd and , then
[TABLE]
which is equivalent to by Proposition 2.1(d). Likewise if is even and , then , equivalently, . β
Henceforth we restrict our attention to ; in light of Proposition 2.1 and its proof all results are easily transferred to the matrix factorization problems associated to and . In particular, note that we could equally well put since and are defined by identical equations. The explicit equations defining over can be written down in terms of the continuant polynomials of Euler [e]. The are defined recursively by
[TABLE]
For example,
[TABLE]
Proposition 2.3**.**
-
- If is odd,*
[TABLE]
- If is even,
[TABLE]
Proof.
Proceed by induction on . β
Hence we deduce:
Proposition 2.4**.**
- If is odd, the equations defining are
[TABLE]
- If is even, the equations defining are
[TABLE]
3. The geometry of
An initial observation on is that we know its dimension; a further observation is that is rational:
Proposition 3.1**.**
For , we have unless and . It is irreducible unless and or and . In the case with if , is also rational (or the union of two irreducible rational varieties) with a birational map given by
[TABLE]
(with the other component given by
[TABLE]
in the case when is reducible)* and inductively fibered.*
Proof.
We proceed by induction on . For by Proposition 2.4 is given by
[TABLE]
Hence unless the unique solution is given by
[TABLE]
Notice that in the case when , the variety is empty unless we also have in which case itβs a rational curve with a birational map to given by .
Now assume the result holds for by induction. Consider the fibration , given by . Notice the fibers of this map are given by for odd and for even. Either way the generic fibers will be generically inductively fibered rational varieties of dimension by the induction hypothesis. Hence, is an inductively fibered rational variety of dimension .
In fact the fibers will be rational and irreducible unless . We now describe the cases. If , the fibers will be either a point or empty unless in which case one of the fibers is a rational curve. Hence if , then is the reducible union of two rational curves with maps to given by and respectively.
If , the generic fiber is irreducible with birational map given by (11) unless . Hence for , is either irreducible or has a component of dimension which is impossible since it is given by equations (the fourth is redundant since the determinant is ), and thus canβt have any components of dimension less than . On the other hand if then all the components are reducible; hence here is the union of two rational surfaces with birational maps given by (11) and (12).
If , the generic fiber is always irreducible; therefore, is always irreducible with birational map given by (11) by the same logic as above. β
4. The arithmetic of
We begin with a rather remarkable identity, which can be verified simply by multiplying matrices.
Lemma 4.1**.**
For , set
[TABLE]
Then we have an equality in :**
[TABLE]
Suppose with as in (7). Then by Proposition 2.4(2), we have . Hence if , then by (14) of Lemma 4.1
[TABLE]
Proposition 4.2**.**
Suppose and suppose is infinite. If , then the -points are Zariski dense.
Proof.
First assume . Set . Since is infinite by assumption, is infinite too. If , then for as in (15) is an infinite set of points in .
Now suppose , then and
[TABLE]
Hence for any , we get . Thus we again get an infinite set of points in .
In the case when is irreducible this implies that the -points are Zariski dense. By Proposition 3.1 this leaves us with the case when . In that case we get so the two components correspond to and . For , the formulas and give infinitely many points on each of the two components. β
Theorem 4.3**.**
*Suppose and suppose the group of units is infinite.
1) If the -points of are Zariski dense for some , then the -points of are Zariski dense for all .
2) If and , then the -points are Zariski dense.*
Proof.
We start by proving (2). We proceed by induction. The case is Lemma 4.1. Now consider the subvariety of given by fixing . Note that is given by for some matrix and is nonempty since . Thus by Lemma 4.1 the -points are Zariski dense in and in particular the images of the -points under the map to given by from Proposition 3.1 are Zariski dense. Also, by the induction hypothesis the -points of are Zariski dense in each of the fibers above each of these points in . Hence, the -points are Zariski dense in .
Now (1) follows trivially from (2) and the fact that if , then for since implies . β
Remark 4.4*.*
There has been recent work on factoring matrices in into products of elementary matrices. Recall that the statement that can be written as the product of elementary matrices is equivalent to . However, the constructions in [mrs] and [v] all write any as a product of elementary matrices beginning with a lower triangular matrix β so in these cases we can deduce that . The construction of [jz, Proof of Theorem 2.6] writes any as a product of elementary matrices beginning with an upper triangular matrix if is odd and a lower triangular matrix if is even. Hence in either case here we can also conclude that .
Below we summarize known results:
-
For all , if is infinite and ([mrs, Remark (1), page 1969]).
-
Suppose is infinite and contains a real archimedean prime or a finite prime. Then for all and for all we have ([jz, Theorem 1.2 and proof]).
-
Assume the Generalized Riemann Hypothesis and suppose is infinite. Then for all we have for if contains a real archimedean prime, for if contains a finite prime, and for in general ([jz, Theorem 1.3 and proof]).
-
Suppose is a prime. Then for all we have for ([v, Remark 1.1]).
-
There is a prime and matrix such that ([mrs, Proposition 5.1]).
Proof of Theorem 1.3.
Combining these known results with Proposition 2.1 and Theorem 4.3 then proves our main Theorem 1.3. β
References
