24 \papernumber2171
A Strong Gram Classification of Non-negative Unit Forms of
Dynkin Type
Abstract
An integral quadratic form is usually identified with a bilinear form satisfying for any vector in , and such that its Gram matrix with respect to the canonical basis of is upper triangular. Two integral quadratic forms are called strongly (resp. weakly) Gram congruent if their corresponding upper triangular bilinear forms (resp. their symmetrizations) are equivalent. If is unitary, such upper triangular bilinear form is unimodular, and one considers the associated Coxeter transformation and its characteristic polynomial, the so-called Coxeter polynomial of with this identification. Two strongly Gram congruent quadratic unit forms are weakly Gram congruent and have the same Coxeter polynomial.
Here we show that the converse of this statement holds for the connected non-negative case of Dynkin type () and arbitrary corank, and use this characterization to complete a combinatorial classification of such quadratic forms started in [Fundamenta Informaticae 184(1):49–82, 2021] and [Fundamenta Informaticae 185(3):221–246, 2022].
keywords:
Integral quadratic form, Gram congruence, Dynkin type, Coxeter polynomial, edge-bipartite graph, quiver, incidence matrix, signed line graph. 2020 MSC: 15A63, 15A21, 15B36, 05C22, 05C50, 05C76, 05B20.To the memory of Prof. Daniel Simson
A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type
Introduction
An integral quadratic form is an integer homogeneous polynomial () of degree two on integer variables , more generally considered as a function whose associated map
given for (column) vectors by , is a bilinear form, usually called polarization of . The form is said to be positive (resp. non-negative) if (resp. ) for any non-zero vector , that is, whenever the polarization is a positive (semi-) definite form, since for any in . Recall that two integral bilinear forms and are called equivalent if there is a -invertible matrix such that for any .
Integral quadratic forms appear frequently, sometimes implicitly, in Lie theory, in the representation theory of groups, algebras, posets and bocses, in cluster theory, and in the spectral graph theory of signed graphs, to mention some examples. Their usefulness, in representation theory alone, which is our main motivation, has prompted extensive original research for some decades now. For instance:
-
•
In the early stages of the representation theory of associative algebras of finite dimension, after the work of Gabriel [23]: Bernstein, Gelfand and Ponomarev [9], Ovsienko [49] (see also [21] and [53]), Dlab and Ringel [17, 18], Ringel [53], Bongartz [12, 13], de la Peña [51, 50], Brüstle, de la Peña, Skowroński [14].
- •
- •
-
•
In a graphical context, considering morsifications, Weyl and isotropy groups, certain mesh geometries of orbits of roots, and classification problems: Simson [57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68], Kosakowska [37], and Simson and collaborators: Bocian and Felisiak [10, 11], Gąsiorek and Zając [25, 26], Kasjan [35, 36], Makuracki and Zyglarski [42, 43], Zając [69, 70].
- •
Let us fix some of the notation and terminology used in the paper. We denote by the set of matrices with integer coefficients. The identity matrix of size is denoted by , or simply by for adequate size. Recall that is -invertible if and only if . The transpose of a matrix is denoted by , and if is -invertible then . Here all matrices have integer coefficients, and as usual, we identify a matrix with the linear transformation given by . We denote by and the column space of and the null right space of , respectively. We say that the matrix is a kernel matrix of if its columns consists of a basis of . The column vector with entries, all of them equal to , is denoted by , or simply by for appropriate size. For matrices of size for the matrix with columns those of , in that order, is denoted by , where . For arbitrary matrices , take
The canonical basis of is denoted by . For a permutation of the set , the matrix satisfying for is called permutation matrix of .
The matrix with integer coefficients is called Gram matrix of an integral bilinear form , with respect to the canonical basis of . By symmetric Gram matrix of an integral quadratic form we mean the Gram matrix of the polarization of (notice that is symmetric and has integer coefficients). We also consider the (unique) bilinear form such that for all , and such that its Gram matrix with respect to the canonical basis of , denoted by , is upper triangular. Note that . We say that is a unit form (or a unitary integral quadratic form) if for . In that case, is a -invertible matrix (since it is upper triangular with all diagonal coefficients equal to ), and is called the standard morsification of in Simson’s terminology [57, 61]. Two unit forms and are called weakly Gram congruent if their polarizations are equivalent, that is, if there is a -invertible matrix such that (or equivalently, ). Similarly, and are called strongly Gram congruent if their standard morsifications are equivalent, that is, if there is a -invertible matrix such that . Then we write and for the weak and strong cases respectively (or simply and ). The weak Gram classification of connected non-negative unit forms is due to Barot and de la Peña [6] and Simson [62] (see also [70]), in terms of a unique pair where is a Dynkin diagram , , (for , or ) and is the corank of the quadratic form , that is, the rank of the kernel of the symmetric Gram matrix . Here we deal with the strong Gram classification problem of connected non-negative unit forms of Dynkin type for .
For a unit form , consider the matrix with integer coefficients , called Coxeter matrix of . The characteristic polynomial of , denoted by , is called Coxeter polynomial of . It is well known, and can be easily shown, that if , then and (cf. [33, Lemma 4.6]). The validity of the converse of this claim in this, or in partial or equivalent forms, is a question raised by Simson for at least a decade (see [61]). Here we give a formulation in terms of non-negative unit forms (see also [34, Problem A]), which correspond to non-negative loop-less bigraphs as in [61], or to non-negative symmetric quasi-Cartan matrices as in [4]. Generalizations of these problems may be found, for instance, in terms of Cox-regular bigraphs in [45, Problem 1.3], or of symmetrizable quasi-Cartan matrices in [66] (see also [61, 62, 63]).
Problem 1 (Simson’s Coxeter Spectral Characterization Question).
If two connected non-negative unit forms are weakly Gram congruent and have the same Coxeter polynomial, are they strongly Gram congruent?
Problem 2 (Simson’s Strong Gram Classification Problems).
-
i)
Classify all non-negative unit forms up to the strong Gram congruence. This includes (and up to Problem 1, is exhausted by) the determination of all Coxeter polynomials per weak Gram congruence class.
-
ii)
Given two non-negative unit forms and that are strongly Gram congruent, find a -invertible matrix such that .
Solutions to these problems for special classes of quadratic forms are known. For instance, the positive case was completed recently by Simson [64, 67, 68] (see further examples and related problems in [45]). An alternative proof for positive unit forms of Dynkin type was given by the author in [33]. Here we present affirmative solutions to Problems 1 and 2 for connected non-negative unit forms of Dynkin type (for ) and arbitrary corank, with the combinatorial methods presented in [32], and developed to this end in [33, 34].
Recall that two connected non-negative unit forms are weakly Gram congruent if and only if they have the same Dynkin type and the same corank (see [6] or [70]), or equivalently, the same Dynkin type and the same number of variables. Simson determined in [62] representatives of the weak Gram congruence classes of connected non-negative unit forms, the so-called canonical extensions, showing that any such form having Dynkin type is weakly Gram congruent to a unique canonical extension of the unit form , see [62, Theorems 1.12 and 2.12] and [70, Theorem 1.8] (recall that the quadratic form associated to a graph is determined by , where denotes the symmetric adjacency matrix of ). A family of representatives for the corresponding strong Gram classes of Dynkin type was proposed in [34, Definition 5.2] (see Figure 1 and 1.3 below). There they are called standard extensions of the unit form , and here we confirm that they are representatives of strong Gram congruence in the following classification theorem.
Theorem 1
Every connected non-negative unit form of Dynkin type for is strongly Gram congruent to a unique standard extension of the unit form .
Alternatively, the following formulation of Theorem 1 answers directly Problem 1.
Theorem 2
Let and be weakly Gram congruent connected non-negative unit forms of Dynkin type for . Then and are strongly Gram congruent if and only if they have the same Coxeter polynomial.
Using Theorem 2, and the results on Coxeter polynomials of [34] (based on [33, Theorem A]), we complete the following descriptive theorem of non-negative unit forms of Dynkin type up to the strong Gram congruence (cf. [34, Problem B]). We need the following general notions. Let be a unit form, with symmetric Gram matrix and Coxeter matrix .
-
•
A partition of an integer , denoted by , is a non-increasing sequence of positive integers such that . The integer is called the length of , and the set of partitions of is denoted by .
-
•
The kernel of in is called radical of , denoted by , and its elements are called radical vectors of . The rank of is called corank of , and is denoted by . The reduced corank of is the rank of the kernel of the restriction of to its radical (see details in 2.1 below).
-
•
The Coxeter number of is the minimal such that , if such exists, and otherwise. The reduced Coxeter number is the minimal such that is a nilpotent matrix (such always exists if is non-negative, cf. [55]). The degree of degeneracy of is the integer such that , which is a non-negative even number since it is the rank of a skew-symmetric form (namely, the restriction of to the radical of , see (13) and further details in 2.1 below).
Theorem 3
Let denote the set of connected non-negative unit forms in variables having corank and Dynkin type . Taking , there is a function , called the cycle type of a unit form in , which induces a bijection,
where denotes the set of partitions of whose length is conditioned by as follows,
Moreover, if for , then the following hold.
-
i)
The Coxeter polynomial of is .
-
ii)
The Coxeter number of is if , and otherwise.
-
iii)
The reduced Coxeter number of is .
-
iv)
The geometric multiplicity of as eigenvalue of is .
-
v)
The reduced corank of is , and the algebraic multiplicity of as eigenvalue of is .
A solution for the positive and principal cases (coranks zero and one) of Theorem 2, within our combinatorial framework, was shown in [33, Theorems A and B] by means of certain (admissible) flations at the level of loop-less quivers. Here we pursue an alternative strategy which we sketch as follows (see details in Section 4). Let be a unit form in . We fix a unique standard extension such that and (see Definition 3.3 and Remark 1.17 below), and proceed in three main steps, for which, for a matrix , we consider the matrix .
-
Step 1. Find a matrix such that, among other technical conditions (see Definition 3.3), satisfies
It can be shown that for corank zero or one, the matrix of Step 1 determines itself a strong Gram congruence (cf. Lemma 4.22). In general, analyzing how far is from being a strong Gram congruence, we arrive to the following correction steps.
-
Step 2. Find a matrix such that the matrix is -invertible, and satisfies the same conditions of Step 1:
-
Step 3. Find a matrix such that .
Clearly, the condition for a square matrix implies that is -invertible and . The goal of this paper is to constructively exhibit the existence of matrices , and . A solution to Step 1 is given in Section 1, using the specific structure of standard extensions, see Proposition1.23. Steps 2 and 3 are simple correction algorithms that work in a much general context (see Remark 4.17). However, their justification is long and technical at some points, and requires a special condition that can be easily verified for standard extension (see Lemma 2.13 and Corollary 4.15). Steps 2 and 3 are shown in Sections 2 and 3, see Propositions 2.17 and 3.13 and their implementable formulations as Algorithms 3 and 4, respectively. The proofs to our main theorems, comments on generalizations and suggestions for an implementation are collected in Section 4.
1 A combinatorial realization
In this section we summarize the needed combinatorial notions and results introduced in [32] and developed in [33, 34] for the Coxeter analysis of non-negative unit forms of Dynkin type , namely, structural walks, incidence vectors, the inverse of a quiver and standard quivers.
1.1 Basic notions
Let be a quiver, that is, and are finite sets (whose elements are called vertices and arrows of , respectively), and are functions assigning to each arrow of a source vertex and a target vertex . Throughout the paper we assume that both sets and are totally ordered (see Remark 1.1 below). Moreover, taking and we usually identify the set of vertices with the set , and the set of arrows with the set . The incidence matrix of has as -th column the difference . The symmetric Gram matrix of is defined by , and its upper triangular Gram matrix is the unique upper triangular matrix satisfying . Notice that if has no loop, then is -invertible, and that if is connected then is generated by the single vector (see [34, Theorem 3.3]).
The integral quadratic form associated to a quiver with vertices and arrows, as defined in [32], is given by
(1) |
where denotes the squared Euclidean norm of a vector . By definition, we have , which implies that .
Remark 1.1
Let be a connected loop-less quiver. For any permutation of the set of vertices , denote by the quiver obtained from by permuting its vertices via (that is, and for any arrow ). Denote by the quiver obtained from by reversing the orientation of all of its arrows (that is, and ).
-
i)
Then and .
-
ii)
We have , and consequently .
Proof 1.2
Observe that if , then
and
Then holds. The claim on quadratic forms in follows from and (1), since
The claim on standard morsifications is clear from the first part of .
In the following result we interpret the weak and strong Gram congruences within this combinatorial realization (compare with [34, Lemma 6.1]).
Theorem 1.3
If is a connected loop-less quiver with vertices and arrows, then is a connected non-negative unit form of Dynkin type and corank . Moreover, if is a connected non-negative unit form in variables, with Dynkin type for and corank , then there is a connected loop-less quiver with arrows and vertices such that . Assuming that is also a connected loop-less quiver:
-
i)
We have if and only if there is a permutation matrix and a sign such that .
-
ii)
We have if and only if , which holds if and only if there is a permutation matrix , a sign and a -invertible matrix satisfying .
-
iii)
We have if and only if there is a permutation matrix , a sign and a (-invertible) matrix satisfying and .
Proof 1.4
The main claim follows from [32, Theorem 5.5], see also [33, Proposition 3.15 and Corollary 3.6]. The existence of and in claim follows from [32, Corollary 7.3], see [34, Lemma 6.1] and Remark 1.1. The converse follows from Remark 1.1 above.
To show , recall first that two non-negative connected unit forms are weakly Gram congruent if and only if they have the same Dynkin type and same corank (see the main corollary in [6]), or equivalently, the same number of variables and the same Dynkin type. By the main part of the theorem, is a connected unit form on variables and Dynkin type . This shows that if and only if . For the second equivalence in , it was shown in [34, Lemma 6.1] that if , then there is a permutation matrix , a sign and a -invertible matrix satisfying (note that the sign might be “included” in matrix , as in [34, Lemma 6.1]). The converse is clear, since and , and therefore
Similarly, the necessity in claim was shown in [34, Lemma 6.1], and the sufficiency is clear from definition.
Based on Theorem 1.3, we propose two characterizations of strong Gram congruence between quadratic forms associated to connected loop-less quivers in Theorem 4.1 below. The proof and hints for its implementation, which will take the rest of the paper to complete, depend on the following matrices (cf. [34, Theorem 3.3]). If has vertices and arrows, take
(2) |
These are called the Coxeter-Gram matrix of and the Coxeter-Laplacian of , respectively. Basic properties of and , and their relation with the Coxeter matrix of , are collected in the following observation.
Remark 1.5
Let be a connected loop-less quiver with arrows and vertices, and with incidence matrix . Then,
-
a)
.
-
b)
is a permutation matrix.
-
c)
, where denotes the characteristic polynomial of .
-
d)
.
-
e)
.
Proof 1.6
Claims were shown in [34, Theorem 3.3 and Corollary 4.3]. Claim is clear, since
Claim follows from and , since
Loosely speaking, due to Remark 1.5 and , the (inverse transpose) Coxeter-Gram matrix acts on the columns of the incidence matrix , and such action is recorded in the Coxeter-Laplacian of .
1.2 Walks and incidence vectors
By walk of a quiver we mean an alternating sequence of vertices and arrows of ,
starting with a vertex called the source of , and ending with a vertex called the target of , and satisfying for . The integer is the length of , and if (that is, if ), then is called a trivial walk. A walk in of length has either the shape or for an arrow . In the first case we use the notation , and in the second . Viewing an arbitrary walk of positive length as concatenation of walks of length one, we use the notation
where for . A walk as above is called minimally descending, if for the difference is positive and it is the minimal positive difference possible, that is,
A minimally descending walk is called a (descending) structural walk, if whenever a concatenation of the form is minimally descending, then both and are trivial walks. Such walks are determined by their sources (or targets), and we will use the notation for the structural walk having vertex as source. Take given by
(3) |
The definitions of minimally ascending walk and (ascending) structural walk are analogous, and so are the notions of and . It can be easily shown that and are inverse to each other, since
(4) |
where denotes the reverse of walk (see [34, Lemma 3.1]). The mapping is referred to as permutation of vertices of the quiver determined by the ordering of its arrows. The cycle type of is given by the sequence
(5) |
where are the cardinalities of the -orbits on . Then is a partition of , and we take , which is well-defined by Theorem 1.3. We stress that the cycle type depends on the numbering of the arrows in , see Example 2.8 below. For a walk of , define the incidence vector of as
(6) |
The following simple identity is fundamental for our analysis (cf. [34, Remark 3.2]),
(7) |
By (1), it implies that (that is, is a -root of ) for any walk of , and the converse also holds (cf. [32, Lemma 6.1]). Consequently, -roots of can be treated combinatorially via the walks of quiver . This also implies that is also the incidence matrix of a quiver, called the (standard) inverse of and denoted by . In [34] we take a constructive route, and derive (denoted by in [33] and [34]) directly from the structural walks of , as follows.
For every arrow in , there are exactly two descending structural walks containing arrow , one in the positive direction , and the other one in the opposite direction . Denote them respectively by and for some vertices and , and define and . In [33, Proposition 4.4 and Corollary 4.5] we show that is also a connected loop-less quiver, satisfying
(8) |
This approach is useful for several reasons. Among others, the results of [34] depend on the following facts.
Lemma 1.7
Let be a connected loop-less quiver with vertices and arrows. Consider the structural walks of (for ), and take .
-
i)
For any we have .
-
ii)
If is the inverse quiver of , then .
-
iii)
We have .
Proof 1.8
Combining equations (7), (8) and Lemma 1.7, with a straightforward calculation we get the following combinatorial expression for the Coxeter-Laplacian of Q,
(9) |
see details in [34, Theorem 3.3]. Some basic notions and result will be illustrated with a couple of running examples.
Example 1.9
Consider the following integral quadratic forms on four variables:
with corresponding standard morsifications given by the upper triangular matrices
Consider also the following (connected, loop-less) quivers with corresponding incidence matrices,
A direct calculation shows that for . By Theorem 1.3, the quadratic forms are connected non-negative unit forms of Dynkin type and corank , satisfying (indeed, if is the transposition of and in then ). The corresponding inverse quivers (8) are given as follows,
1.3 Standard quivers
For any partition of an integer , and any non-negative integer , consider the connected loop-less quivers and with vertices and arrows, given as follows (see [34, Definition 5.2] and Figure 1 above).
Definition 1.10
Fix , a partition of and an integer . Take for .
-
i)
Let be the quiver with vertices and arrows such that and for . Then the quiver is obtained from by adding arrows in the following way. Define and for . Moreover, taking if , and if , define and for , where . The set of vertices has the natural order , and the set of arrows is ordered as follows: .
-
ii)
Let be the quiver with vertices and arrows such that and for . Then the quiver is obtained from by adding arrows in the following way. Define and for . Moreover, taking if and if , define and for . As before, the set of vertices has the natural order , and the set of arrows is ordered as follows: .
The quiver constructed in is called standard -extension quiver of cycle type and degeneracy degree (see Corollary 2.11), or simply standard quiver. The corresponding quadratic form is referred to as standard -extension of the unit form , or simply as standard extension of . The quiver constructed in is the inverse of (see [34, Remark 5.3]).
Since we fixed linear orders on the sets of vertices and the set of arrows of and , these quivers fix incidence matrices, given explicitly in Remark 1.20 below.
Corollary 1.11
For any partition of and any non-negative integer , the quadratic forms for are non-negative unit forms of Dynkin type and corank .
Proof 1.12
Apply Theorem 1.3.
In the following technical observation we show that the cycle type of for a standard quiver is precisely . One of its consequences, Corollary 1.15 below, is used implicitly in the proof of [34, Theorem 6.3].
Remark 1.13
Let be the standard -extension quiver for a partition of and . Recall from Definition 1.10 that the number of vertices (resp. arrows) of is (resp. ).
-
a)
Consider the permutation of vertices determined by , take and for . Then
-
b)
The cycle type of is .
Proof 1.14
By definition (3), we have .
Assume first that . Denote by the unique arrow in with and , and by the unique arrow in with and for (these are all the arrows of , since ). Then a direct calculation shows that if , then , and therefore . Now, if for some , then , and therefore . Moreover, if , then
In particular, . This shows for , since is unchanged by adding pairs of (anti-) parallel arrows (see [34, Remark 5.1]).
To show , recall that is defined as the sequence of cardinalities of the -orbits on , ordered non-increasingly (5), which equals by .
Corollary 1.15
Let and be partitions of and respectively, and take .
-
a)
We have if and only if .
-
b)
The following conditions are equivalent:
-
b1)
.
-
b2)
.
-
b3)
.
-
b4)
-
b1)
Proof 1.16
Similar claims, not needed for our discussion, hold for the inverse quivers . In the following result, the mentioned non-negative integer is the so-called degree of degeneracy of , cf. 2.1 and Corollaries 2.9, 2.11 below.
Remark 1.17
Let be a connected loop-less quiver. Then there is a unique standard quiver with the same number of vertices and arrows as such that , namely, for some integer . Moreover, in this case there is a permutation of such that .
Proof 1.18
Take and . Recall that if and then the corank of is given by (see Theorem 1.3). Since by [34, Proposition 4.5], then there is a non-negative integer such that . Take . Since is a partition of , the standard quiver has vertices, and by Definition 1.10 it also has arrows. By Remark 1.13, . The uniqueness of follows from Corollary 1.15.
To show the existence of such permutation , recall from Remark 1.5 that there are permutations and of the sets and such that and , and therefore , cf. (5). By Lemma 4.5, and are conjugate permutations, that is, there is a permutation such that , or matricially,
Using Remark 1.1 and the definition of Coxeter-Laplacian (2), we conclude that
Example 1.19
The Coxeter-Laplacians of the quivers and of Example 1.9 are given by
see (2). In particular, the cycle types of the quadratic forms are and , cf. (5) and (9). The standard quivers associated to and , as in Remark 1.17, are given as follows,
Note that for . The corresponding inverse quivers (8) are given by
It will be convenient to have explicit formulas for the incidence matrices of the standard quivers and their inverses. The proof of the following remark is clear from Definition 1.10.
Remark 1.20
Take a partition of , an integer , and denote by the standard quiver . Take and for .
-
a)
If , then . Taking we have
If , taking for we have
-
b)
If , for we have
If , take for . For we have
For instance, the standard quivers include all (inverse) generalized Kronecker quivers, as indicated in the following useful observation.
Remark 1.21
For , consider the (generalized) Kronecker quiver with two vertices and arrows in the same direction,
Observe that if is even ( for ) then and its inverse is given by . On the other hand, if is odd ( for ) then and its inverse is given by . Moreover, assume that for some integer .
-
a)
Take and for . Then the set is a basis of the kernel of , and for we have
-
b)
Take if is even, and if is odd, and let be the matrix with columns the vectors . Then is a kernel matrix for , and
Proof 1.22
The shape of the corresponding standard quiver and is clear from definition. That they are the inverse of the Kronecker quiver (for and respectively), follows from [34, Remark 5.3].
Claim is straightforward. In particular, the matrix of the point is a kernel matrix of . Observe that the matrix is given by
where , and that for . Then, for we have
(10) |
Indeed, if both and are even, then by the definition and using , we get . A similarly claim holds if both and are odd. Assume that is even and is odd. Using we get
Similarly, if is odd and is even, then
These identities show equation (10), which is a coefficientwise expression of the direct sum of copies of . This completes the proof.
1.4 The Coxeter-Laplacian
Our proposed solution to Problem 2 starts with an explicit combinatorial construction, that uses the structural walks of given above, cf. Step 1 on page Introduction.
Proposition 1.23
Let be a connected loop-less quiver with vertices and arrows, and such that for a standard quiver with the same number of vertices and arrows as . Then there is a (not necessarily -invertible) matrix such that
Proof 1.24
If such standard quiver exists then , see (5) and (9). Therefore, is the unique standard quiver with , see Remark 1.17 and Corollary 1.15. Consider the vectors in as in Lemma 1.7, with . By hypothesis we have , which implies that by (9). Consider the description of given in Remark 1.13.
Case . In this case, we have necessarily . Take the matrices
(11) |
Clearly, is a matrix since . In the following steps we show that satisfies the wanted conditions.
Case . For fix arbitrary walks from to (recall that for ), and take . Consider the matrices
(12) |
where for . Clearly, is a matrix since . Again, we show that satisfies the wanted conditions in two steps.
Example 1.25
Let us apply Proposition 1.23 (keeping the notation of its proof) to the running Example 1.9. First we take the descending structural walks of quiver :
The cycle type of has length (cf. Example 1.19). Then the matrix obtained in Proposition 1.23, given by , is shown explicitly above. On the other hand, the cycle type of has length , and its descending structural walks are given by
We need arbitrary walks in for , which we choose to be and (note that , , and , since ). The matrix obtained in Proposition 1.23, given by , is shown above. A direct computation shows that and for , see Example 1.19 for the description of quivers and their inverses.
2 Radicals and invertibility assumption
In this section we analyze some strong Gram invariants within the radical of a non-negative unit form (Lemmas 2.4 and 2.6) in order to prove our invertibility-correction algorithm Proposition 2.17 (see Algorithm 3).
2.1 The reduced radical
Recall that a subgroup of is called pure if whenever for some and some non-zero , then . For any unit form consider the following subgroups of ,
These are pure subgroups of . The group is called the radical of , and we will refer to as the reduced radical of . The rank of the reduced radical of will be called reduced corank of . The restriction of the standard morsification to the radical of is denoted by . To be precise, let be the inclusion of the radical of in , and take
Clearly, is a skew-symmetric bilinear form. In particular, its rank is an even non-negative number, for some (cf. [24, XI, §4]), and we call the degree of degeneracy of . Note that
(13) |
Observe also that the reduced corank and the degree of degeneracy are strong Gram invariants of (see Lemma 4.13 below). To the best of the author’s knowledge, these notions are new in the literature on integral bilinear and quadratic forms. Fixing a -basis of we get matricial forms of and of given by
(14) |
Let us illustrate these notions.
Example 2.1
Consider the quadratic forms and of Example 1.9. A basis of the radical is given in the columns of the matrix below, and the restriction of the standard morsification of to its radical, under such basis, is given by the matrix as in (14), for ,
Being the nullity of , the respective reduced coranks are given by and , and by (13) the corresponding degrees of degeneracy are and .
Recall that denotes the vector in with all entries equal to .
Lemma 2.2
Let be a connected loop-less quiver with vertices. Then the image of the incidence matrix , as a linear transformation , is the set
which is a pure subgroup of .
Proof 2.3
Assume first that is a tree, that is, that has arrows. By [33, Propositions 3.13 and 3.8], there is a -invertible matrix such that , where is a maximal star with center a vertex , that is, the columns of are given by for . These columns are a basis of the group , which shows that .
Now, take an arbitrary loop-less quiver with vertices. Since , we have . Choose a spanning tree of . Clearly, the image of is a subset of the image of , since is obtained from by deleting those columns indexed by the elements of the set . Thus, by the first part of the proof, we have , hence . Clearly, if for some non-zero , then . Since , we have , that is, is a pure subgroup of .
The following is a useful characterization of the reduced radical in case of non-negative unit forms of Dynkin type .
Lemma 2.4
Let be a connected loop-less quiver with inverse quiver , Coxeter-Gram matrix and Coxeter-Laplacian . Then
Proof 2.5
The first identity is easy to verify, since if and only if , that is, if and only if .
For the second identity, recall from (8) that , and observe that if then
that is, . Moreover, for any we have
which means that .
2.2 Bases for the reduced radical
Let be representative vertices of the -orbits in , with orbit sizes . The cycle type of , as given in (5), is the partition of the integer (cf. [34, Definition 4.2]). For consider the concatenated walks
(15) |
where for , and . This is indeed a walk, since if . Alternatively, taking as the vector in with entry in position given by if is in the -orbit of , and otherwise (for ), then using Lemma 1.7 we have
(16) |
Lemma 2.6
The set is a basis of for any .
Proof 2.7
First observe that the vectors of are a basis of the eigenspace of corresponding to the eigenvalue , since is the permutation matrix of , see (9). Hence, by (16), Lemma 2.4, and since
the set generates , for any .
Take now integers such that . That is, if then . In particular, if and only if all are equal, since the left null space of is generated by (see [34, Theorem 3.3]). This shows that if , and
then for , which completes the proof.
Example 2.8
Recall the description of the Coxeter-Laplacians and of the quivers and of Example 1.9, given in Example 1.19. In the first case we have iff for some , and in this case
By Lemma 2.4, we have (see Example 2.1). In the second case for all . Following the procedure (15), we find the walks
(cf. Example 1.25). Alternatively, consider the inverse quiver of given in Example 1.19, and observe that the columns of the matrix are precisely the incidence vectors of the walks , see (16). Note that the basis of chosen in Example 2.1 (as columns of ) corresponds to the basis of Lemma 2.6.
As direct consequence of Lemma 2.6 we have the following results.
Corollary 2.9
Let be a connected non-negative unit form of Dynkin type , corank and cycle type . Then the reduced corank of is , and the degree of degeneracy of is .
Proof 2.10
Corollary 2.11
The degree of degeneracy of the standard -extension of is .
Proof 2.12
Recall that in the text, matrices, linear transformations and their images and kernels are taken over . A matrix or linear transformation will be called pure if so is the group . Similarly, a bilinear form will be called pure if so is the adjoint transformation , or equivalently, if its Gram matrix is pure (under any choice of basis). The following result is a simple and important observation: the upper triangular bilinear form of any standard extension of has pure restriction to its radical. After completing the proof of our main results we will be able to prove that this observation holds for any connected non-negative unit form of Dynkin type (Corollary 4.15).
Lemma 2.13
The standard morsification of every standard extension of a unit form of Dynkin type () has pure restriction to its radical.
Proof 2.14
Consider a standard quiver with a partition of with length , and take . Then is a connected non-negative unit form of Dynkin type in variables with corank (Corollary 1.11) and reduced corank (Lemma 2.6). We fix a kernel matrix of in the following way. Take the matrix whose columns are a basis of , see for instance Lemma 2.6. If , then . If , observe that the last arrows of the standard quiver determine the inverse Kronecker quiver . Consider the inclusion of into the last entries of , and take the matrix with the vectors constructed in Remark 1.21, where we showed the second equality identity in (17) below (the first identity can be easily shown, since is a subquiver of ):
(17) |
Then the subspace of generated by the columns of has zero intersection with the reduced radical of , which implies that the matrix is indeed a kernel matrix of .
2.3 Adding for invertibility
Here we show how to correct the non-invertibility of the matrices obtained in Proposition 1.23. We need the following preliminary observation.
Lemma 2.15
Let and be connected loop-less quivers with vertices and arrows. Assume that , and that there is a matrix such that . Then restricts to an isomorphism .
Proof 2.16
For a slightly more general version of the following proposition, see Remark 4.17 below.
Proposition 2.17
Let be a connected loop-less quiver. If there is a square matrix such that
where is a standard quiver with same number of vertices and arrows as , then there is a matrix such that is -invertible and satisfies
Proof 2.18
Let be a kernel matrix for , and assume that where the last columns of are a basis of the reduced radical . Take similarly a kernel matrix of written as , and define and , which are kernel matrices of and respectively. Since , there is a unique matrix such that . The matrices and have the following shapes
where is -invertible (Lemma 2.15), and by (17) in the proof of Lemma 2.13, is a -invertible skew-symmetric matrix (since it corresponds to the restriction of to its radical, modulo its kernel: the reduced radical). Define for some matrix , and notice that
and
Since and , we have
Taking and (with and arbitrary, say equal to zero), we get
with a -invertible matrix. Then the restriction
is an isomorphism, which implies that is -invertible by Corollary 4.11.
Example 2.19
Consider the quivers of Example 1.9, and the matrices satisfying the assumptions of Proposition 2.17, as given in Example 1.25 (for ). Observe that and , so we apply Proposition 2.17 only for the case . Besides the kernel matrix of given in Example 2.1, we fix the following kernel matrix for the corresponding standard quiver (cf. Example 1.19),
Observe that , and therefore the matrix (using the notation of the proof of Proposition 2.17) is the zero matrix. Note also that . Then, as defined in the proof of Proposition 2.17, the matrix is given by . Taking where , we get
Note that , as claimed in Proposition 2.17. In fact, a direct computation shows that .
3 A model for pseudo-endomorphisms
In this section we provide a method to modify a -invertible matrix satisfying the equations of Proposition 1.23 (called pseudo-morphisms) into a strong Gram congruence. It depends on a special decomposition of skew-symmetric matrices, presented first in Lemma 3.1.
3.1 Decompositions of skew-symmetric matrices
Recall that if is a skew-symmetric matrix, then there exists a -invertible matrix such that is in canonical form, that is, there are positive integers such that
for a square zero matrix of size , and where divides for (see for instance [48, Theorem IV.1]). Such expression is usually called the skew normal form of . Observe that is pure if and only if for .
Lemma 3.1
Let and be skew-symmetric matrices.
-
a)
If is -invertible, then there is a matrix such that .
-
b)
If is pure, then there is a matrix such that .
Proof 3.2
Take for some -invertible matrix . If claims and hold for and arbitrary , then they also hold for and arbitrary . Indeed, if , then for each case or there is a matrix such that either
respectively. Take . Then , and
Therefore, we may assume that is in skew normal form. In particular, if is -invertible then .
To show , observe that if is -invertible then for some and , where . Take a -invertible matrix such that (not necessarily in skew normal form), and consider the diagonal matrix . Then
To show , assume first that is -invertible and take , which is also skew-symmetric. By part there is a matrix such that . Taking , we get
as wanted. In the pure case, where is -invertible (since is in its skew normal form). Taking
then . Using the first part of the proof of , since is skew-symmetric and is -invertible, we may find such that . Take , and take any matrix such that . Then , which completes the proof.
3.2 Pseudo-morphisms
Let us formalize some of the notions already used in the paper.
Definition 3.3
Consider connected loop-less quivers and with vertices and arrows.
-
a)
A square matrix satisfying
is referred to as pseudo-morphism from to . These relations are expressed with the notation , or simply by if such matrix exists.
-
b)
If we call a pseudo-endomorphism of . The set of pseudo-endomorphisms of will be denoted by , that is,
-
c)
For matrices , and in we will use the notation
Remark 3.4
Let denote the set of connected loop-less quivers with at least two vertices. For and in , denote by the set of pseudo-morphisms from to . Then , together with the product of matrices, is a category. Moreover, the following hold if and have the same number of vertices and arrows.
-
a)
If then .
-
b)
If then , where .
In particular, is an equivalence relation on the set .
Proof 3.5
Let and be pseudo-morphisms. Then
and
that is, . Note that the identity matrix serves as neutral element of the monoid , and the associativity of the matrix product shows that is a category.
To prove , using (8) we get
Note that is a reflective relation since , and it is transitive by the first part of the proof. Since the symmetry of was shown in , we conclude that is an equivalence relation.
With the notation introduced in Definition 3.3, Propositions 1.23 and 2.17 may be summarized as follows:
Corollary 3.6
If is a connected loop-less quiver with for a standard quiver with the same number of arrows as , then there is a -invertible matrix such that .
Lemma 3.7
Let be a connected loop-less quiver with vertices and arrows, fix a kernel matrix for , and take . If , then the function
is a bijection, with inverse denoted by . Moreover, if and are pseudo-endomorphisms of , and , then
-
a)
, where is as in Definition 3.3.
-
b)
We have , and is -invertible if and only if there is a matrix with (or equivalently, ).
Proof 3.8
Let be the corank of . Then and are matrices, and for any , we have
and
since and . This shows, as claimed, that belongs to .
Now, if is a pseudo-endomorphism of , then may be expressed uniquely as
for a matrix . Indeed, we have , which implies that there is a unique matrix such that (since the kernel matrix of has rank ). On the other hand, implies that since the columns of are linearly independent, thus there is a unique matrix such that . Then the mapping is well defined, by the uniqueness of . That is, , and clearly
which proves that is a bijection with inverse .
To show take and . Then
since (recall that ). Claim follows from the uniqueness of , since clearly .
Remark 3.9
Let be a connected loop-less quiver, and take a kernel matrix for . If , then the binary operation given in Definition 3.3 makes a monoid with identity element the zero matrix .
3.3 Multiplying for strong Gram congruence
For a pseudo-morphism we have often considered the matrix (see for instance Theorem 4.1 or Remark 3.4). Here we consider further properties of this star operation,
see Remark 3.4.
Lemma 3.11
Let and be connected loop-less quivers with the same number of vertices and arrows. Assume that , and take .
-
a)
If then we have .
-
b)
Both matrices and are skew-symmetric.
-
c)
If is -invertible then and
Proof 3.12
To show assume that , and take . Note that
that is, .
To show take . Since and , we have
and therefore,
Since we get
In particular, since the columns of are linearly independent. The case can be shown in a similar way.
For , using that and , if is -invertible then
that is, . The last claim of is immediate.
For a more general version of the following proposition, see Remark 4.17 below.
Proposition 3.13
Let be a connected loop-less quiver. If there is a -invertible matrix such that
where is a standard quiver with same number of vertices and arrows as , then there is a matrix such that and .
Proof 3.14
With the notation of Definition 3.3, we have . Fix kernel matrices and of and , respectively.
Take , and , where is the function constructed in Lemma 3.7 with respect to . By Lemma 3.7, we have where . By Lemma 3.11, the matrices and are skew-symmetric. By Lemma 3.1, there is a matrix such that , since is a pure skew-symmetric matrix by Lemma 2.13, cf. (14). Consider the pseudo-endomorphism of , which is -invertible by Lemma 3.7, since
using the associativity of (Remark 3.9). Observe that
In particular, if and only if since is -invertible. Applying Lemma 3.7 we get
since , and by Lemma 3.11. Thus, we have , as wanted.
Example 3.15
We now apply Proposition 3.13 to the quiver of Example 1.9 (recall from Example 2.19 that we have already found a matrix such that ). Consider the -invertible matrix given in Example 1.25 satisfying . Following the notation of the proof of Proposition 3.13 we get
Taking we have
By Lemma 3.1, there is a matrix such that . Indeed, note that , therefore , so we may simply take . As in the proof above, we take
A direct calculation shows that , as claimed in Proposition 3.13.
4 Main proofs, concluding remarks and algorithms
This section collects all preliminary results to prove the main technical theorem of the paper (Theorem 4.1), which connects the Coxeter-Laplacian with the existence of strong Gram congruences, and suggests implementable algorithms to solve Simson’s Problem 2. The section ends with those results of general interest used along the paper, and with some comments on generalizations and future work.
4.1 Main results
The following is a combinatorial version of Theorem 2 in terms of the Coxeter-Laplacian of a quiver.
Theorem 4.1
The following are equivalent for connected loop-less quivers and with the same number of vertices and arrows:
-
i)
The Coxeter-Laplacians of and coincide, .
-
ii)
There is a (not necessarily -invertible) matrix such that .
-
iii)
There is a (-invertible) matrix such that and .
Proof 4.2
Assume first that satisfies and recall that for any connected loop-less quiver , see (8). Since , then is -invertible and
That is, , and holds. That implies was shown in Remark 3.4.
Assume that . By Remark 1.17, there is a standard quiver with the same number of vertices and arrows as , and such that . By permuting the vertices of and if necessary, we may assume that (see Remarks 1.1 and 1.17; recall that in Definition 1.10 we fixed linear orders on and ).
By Proposition 1.23 there is a matrix such that , and by Proposition 2.17 there is a matrix such that is -invertible and . Moreover, using Proposition 3.13 we find a matrix such that if , then and . Similarly, since , we may find a matrix such that and (in particular, is -invertible since it is a square matrix with ). This means that and , and therefore, and
which completes the proof.
Proof of Theorem 1:
Let be a connected non-negative unit form in variables and of Dynkin type for . Using Theorem 1.3 we find a connected loop-less quiver with vertices and arrows such that . Consider the cycle type and degree of degeneracy of . Take , which is also a connected loop-less quiver with vertices and arrows (see Definition 1.10). Since by Remark 1.17, we may assume that (by replacing by the quiver for some permutation of the set of vertices , see Remark 1.1). By Theorem 4.1 there is a matrix such that and . Taking , by definition we have and , and therefore, . The uniqueness of follows from the uniqueness of the standard quiver with cycle type , vertices and arrows, cf. Corollary 1.15.
\QED
Proof of Theorem 2:
Let and be weakly Gram congruent connected non-negative unit forms in variables and of Dynkin type . If and are strongly Gram congruent, then , see for instance [33, Lemma 4.6].
Assume conversely that . Since , then and have the same corank . Using Theorem 1.3 we find quivers and such that and , both of which have vertices and arrows. By Remark 1.5 we have
Therefore, the Coxeter-Laplacians and are co-spectral. By Lemma 4.5 below, the matrices and are conjugate, that is, there is a permutation matrix such that . Thus, by Theorem 1.3 and replacing by if necessary, we may assume that , see Remark 1.1. We conclude that by Theorem 1.3, and using the equivalence of and in Theorem 4.1.\QED
Proof of Theorem 3:
The construction of the cycle type is given in [34, Definition 4.2], see also (5) above, where it is shown that is well-defined and surjective. The injectivity of is direct consequence of Theorem 2, and the properties were shown in [34, Theorem 6.3 and Corollary 6.4]. Claim is clear from definition, see Lemma 2.4.
4.2 Some general results
On pure subgroups and orthogonal matrices
We collect some well-known facts about pure subgroups, giving a sketch of the proofs.
Lemma 4.3
The following are equivalent for a subgroup of .
-
a)
The group is pure.
-
b)
The quotient is free.
-
c)
There is a subgroup of such that .
-
d)
The canonical inclusion has a left inverse.
-
e)
If is any morphism of abelian groups with , then for any morphism of abelian groups with there is a morphism (not necessarily unique) such that .
Proof 4.4
Assume that is pure. If satisfies for some non-zero , then , hence , that is, . This shows that is a torsion free (finitely generated) abelian group, thus free. Assume that is free, and fix a basis of with and for . Take the subgroup of generated by , and verify that . Assume that , and take the inclusion . Then the projection satisfies , that is, is left invertible. Assume that has a left inverse , and that for a non-zero . Then , which implies that , that is, , and is a pure subgroup of . These arguments show that the statements are equivalent.
Assume now that holds, and take functions and as in claim . Denote by the restriction of to its image, . Then , and therefore , where is the canonical inclusion, and is a left inverse of . Since is a cokernel of the inclusion , there is such that . Then the following diagram is commutative,
Take and observe that , as wanted. Finally, assume that holds, and take and . Since then , and by hypothesis there is such that . This shows the equivalence of claims and , completing the proof.
Recall that two permutation matrices and are called conjugate if there is a permutation matrix such that .
Lemma 4.5
The following are equivalent for permutations and of the set .
-
i)
and are conjugate permutation matrices.
-
ii)
The matrices and are co-spectral.
-
iii)
The cycle types and coincide.
-
iv)
and are conjugate permutations.
Proof 4.6
If and are conjugate permutation matrices, then they are similar matrices and their spectra coincide. Recall that the characteristic polynomial of is given by
where is the cycle type of (cf. [54, §2.2] or [34]). If and are co-spectral, then the cycle types of and coincide (cf. [34, Algorithm 2 and Remark 7.4]). In this case, and are conjugate permutations (see [54, Proposition 2.33]), which in turn shows that and are conjugate permutation matrices.
On non-negative integral quadratic forms
Let be a free finitely generated abelian group. By integral quadratic form on we mean a function satisfying for any and , and such that its polarization , given by , is a (symmetric) bilinear form. The symmetric matrix of with respect to a fixed basis of is denoted by . Since the determinant of is independent of the chosen basis, it is referred to as determinant of . The radical of is the kernel (or right null space) of . Since for any , the induced function is well defined.
Lemma 4.7
Let be an integral quadratic form.
-
i)
The form has zero radical (that is, ) if and only if .
-
ii)
If is a free finitely generated abelian group, and is a linear transformation, then is an integral quadratic form.
-
iii)
If is a free finitely generated abelian group, is a function and is a surjective linear transformation such that , then is an integral quadratic form.
-
iv)
The radical is a pure subgroup of , and the function is an integral quadratic form with radical zero.
-
v)
If is non-negative, then is a radical vector of if and only if .
Proof 4.8
Fix a basis of , and let be the Gram matrix of with respect to such basis. Then if and only if there is a trivial integral linear combination of the rows of , that is, if there is a vector such that (indeed, use Gaussian elimination over the rational numbers, then multiply any solution by a common multiple of the denominators to get integer coefficients). Then claim is clear, since is a radical vector of .
For take . The polarization of is given by for vectors . Then the bilinearity of follows from the linearity of and the bilinearity of . Moreover, for any and we have
since is linear and is an integral quadratic form.
To show observe that the polarization of has the following shape, for vectors and vectors such that and ,
Then a standard calculation, using that is linear and surjective and that is bilinear, shows that is bilinear. Moreover, for arbitrary and , there is such that (since is surjective), and we have
since is a quadratic form and is linear.
To show , since is the kernel of then it is a pure subgroup of . Moreover, observe that if and only if for any , which shows that the induced function is well defined. If is the canonical surjection, then and is an integral quadratic form by .
The proof of is a simple generalization of [33, Lemma 2.1]. Indeed, if then (here we identify the elements with their coordinate vectors in in the fixed basis). Conversely, if is non-negative and , then for an arbitrary and a basis of we have
Since is arbitrary, then , and this holds for any . That is, .
Lemma 4.9
Let be a non-negative integral quadratic form, a linear transformation, and take . Then is an isomorphism if and only if the following conditions hold,
-
a)
the transformation restricts to an isomorphism ;
-
b)
the determinants of and coincide.
Proof 4.10
By Lemma 4.7, is an integral quadratic form, which is clearly non-negative. By non-negativity, restricts to a transformation . Indeed, if then , and by Lemma 4.7 the vector is in the radical of . In particular, induces a linear transformation such that the following diagram commutes,
Assume first that is an isomorphism. Then and since is also non-negative, the restriction is inverse of . Since is a direct summand of , and so is of (Lemma 4.3), then is an isomorphism between free finitely generated abelian groups, which implies that . This shows that and hold.
For the converse, by Lemma 4.7 we have and . By , this implies that , that is, that is an isomorphism. Assume now that for some . Then , which implies that since is injective. Since is injective by , we have , that is, is injective. Take now arbitrary. Since is surjective, there is such that , that is, since . Using that is surjective, again by there is such that , that is, . This shows the surjectivity of , completing the proof.
Corollary 4.11
Let and be connected non-negative unit forms in the same number of variables. Then the following hold:
-
i)
The forms and have the same Dynkin type if and only if the determinants of and coincide.
-
ii)
If and have the same Dynkin type and for an integer matrix , then is -invertible if and only if restricts to an isomorphism .
Proof 4.12
To show assume first that and have the same Dynkin type. Then they are weakly Gram congruent since they have the same number of variables, that is, there is a -invertible matrix with . By Lemma 4.9 the determinants of and coincide. Conversely, assume that and have different Dynkin types, say and . By [5, Theorem 3.15], the forms and are equivalent, therefore, they have the same determinant. The same holds for and . Since and have the same number of variables, and , then (see for instance [66, Corollary 3.10]), which shows that the determinants of and are different.
Claim follows from and Lemma 4.9.
Lemma 4.13
Let and be non-negative unit forms with for a matrix . Then restricts to isomorphisms
In particular, the standard morsification has pure restriction to its radical if and only if has pure restriction to its radical.
Proof 4.14
That is an isomorphism was shown in Lemma 4.9. The second isomorphism holds since for any , and is -invertible. The claim on pure restriction is clear since both and are isomorphisms, and is the kernel of the restriction of to its radical.
Some consequences
The following technical observation, basic for our work, seems to hold for more general contexts (for other Dynkin types and for other unimodular morsifications). The author was not able to find any related results in the literature, nor any more general proofs.
Corollary 4.15
Let be a connected non-negative unit form of Dynkin type for . Then the associated upper triangular bilinear form (the standard morsification of ) has pure restriction to its radical.
Remark 4.17
In the proofs of Propositions 2.17 and 3.13, the only needed condition of the standard quiver is that the upper triangular bilinear form has pure restriction to its radical (Lemma 2.13). As consequence of Corollary 4.15, the same constructions of Propositions 2.17 or 3.13 hold when replacing for an arbitrary quiver satisfying for a square or a -invertible matrix , respectively.
Observe that a loop-less quiver and its inverse have the same Coxeter polynomial. Indeed, using that and that (cf. [33, Proposition 4.4]), a direct calculation yields . Then the following result, consequence of Theorem 2, helps us find explicit congruences between the upper and lower triangular Gram matrices for the class of unit forms considered in this paper (see [31] for related problems).
Corollary 4.18
Let be a connected non-negative unit form of Dynkin type for some , consider the upper triangular Gram matrix and take . Then is a connected unit form with . Moreover, any strong Gram congruence determines a congruence
by taking .
Proof 4.19
By Theorem 1.3, there is a connected loop-less quiver such that . Taking as in (8), that is, , then
Therefore, using again Theorem 1.3, is a non-negative connected unit form of Dynkin type . Clearly, , and since is upper triangular then so is its inverse, which shows that . Note that
In particular, the Coxeter polynomials of and coincide. Then by Theorem 2. Finally, if and we take , then
as claimed.
We end this section with a numerical strong Gram classification of non-negative connected unit forms of Dynkin type and some comments on the number of corresponding classes. Recall that denotes the set of connected non-negative unit forms on variables having Dynkin type and corank .
Corollary 4.20
Let be non-negative connected unit forms of Dynkin type , . Then if and only if . Moreover,
Proof 4.21
Observe first that , and since , then and are weakly Gram congruent (cf. [6]). Then the main claim follows directly by Theorem 3, where it is shown that
Denoting by the number of partition of having exactly parts, then
(18) |
Using that and for all , and that , we get the claimed values of for . If then . It can be easily shown that this coincides with the number of partitions of into or fewer distinct parts, a number known to be given by , cf. entry in [71].
In general, the value of can be found using (18) and the well-known recursive formula for , see for instance [1, pp. 345–348],
subject to the starting conditions and if , and .
Comments on generalizations and future work
Following Simson’s work, there are many interesting problems to consider in the setting of non-negative unit forms of arbitrary corank, for instance: the computation of isotropy mini-groups and Weyl group actions, the description of morsifications, Coxeter-translation quivers and mesh geometries, and applications to quadratic forms associated to posets. The combinatorial framework explored here is certainly useful for the analysis of such problems, at least for the class of connected non-negative unit forms of Dynkin type .
As already mentioned in [32], the ideas presented here may be generalized to cover the Dynkin type for , replacing loop-less quivers by certain loop-less bidirected graphs (in the sense of Zaslavsky [74], see also [73]), satisfying certain cycle condition (cf. [32, §8]). Most of the constructions and results are similar to those for quivers, the main challenge now being the choice of an adequate family of representatives of strong Gram congruence (the corresponding standard unit forms of Dynkin type ). By admitting loops we include semi-unit forms, as well as a class of non-unitary connected non-negative quadratic forms to be classified yet. The seminal paper by Cameron, Goethals, Seidel and Shult [15], connecting classical root systems with the spectral analysis of signed graphs, contains fundamental ideas suitable for further generalizations (see also [73]).
In the following lemma we consider some of the ideas that originated the results of this paper, presented in a slightly more general context.
Lemma 4.22
Let be non-negative connected unit forms with . Then the following are equivalent for a matrix ,
-
a)
is -invertible and ;
-
b)
satisfies and , where .
Proof 4.23
Note first that if holds then and, by definition of , we have . Assume now that holds, which does not require the matrix to be -invertible. Note that implies that , which shows that the matrix is skew-symmetric (recall that and similarly for ). Hence, the rank of is a non-negative even number (cf. [24, XI, §4]). Since is -invertible, then the rank of is also a non-negative even number. However, the condition guarantees that the columns of are radical vectors of , since
Then , which shows that , that is, . In particular, and , as claimed.
In our context of Dynkin type via connected loop-less quivers, any matrix satisfying the condition of Definition 3.3, namely , satisfies and . In particular, if , then determines a strong Gram congruence , as claimed in the introduction (see comments after Step 1 on page Introduction).
4.3 Hints for an implementation
We end the paper with some ideas and suggestions for an implementation of our main results, solving Problem 2 for the class of connected non-negative unit forms of Dynkin type . All algorithms are straightforward, and make use of well-known methods as least squares and depth-first search. The main construction is presented in Algorithm 1 (resp. Algorithm 2), where for a connected non-negative unit form of Dynkin type (resp. a connected loop-less quiver on vertices) we compute a matrix that determines a strong Gram congruence to the corresponding standard unit form (resp. standard quiver) representative of class, see Theorem 1 and Definition 3.3. This construction is based on the correction Algorithms 3 and 4, corresponding to Propositions 2.17 and 3.13 respectively, and on further auxiliary methods given in Algorithms 5, 6 and 7. An algorithmic approach to the skew normal form may be found in [72] or [48, Theorem IV.1].
Algorithm 1
Standard solution for quadratic forms.
Input: A connected non-negative unit form in variables and of Dynkin type for .
Output: A matrix such that
where is the standard non-negative unit form weakly congruent to and satisfying .
Step 1. Find a quiver with arrows and vertices such that (see [34, Algorithm 1]).
Step 2. Apply Algorithm 2 below to find a matrix satisfying , where is a standard quiver and is a permutation such that (cf. Remark 1.1). Since , then is the wanted strong Gram congruence matrix, by taking . Return matrix .
Algorithm 2
Standard solution for quivers.
Input: A connected loop-less quiver with arrows and vertices.
Output: A permutation of and a matrix such that , and
where is the standard quiver with and same number of arrows as .
Step 1. Compute the permutation of vertices of . [Hint: determine the structural walks for , see definition (3), or compute directly the Coxeter-Laplacian of using (9)].
Step 2. Compute the cycle type of by considering the cardinalities of the orbits of (see also [34, Algorithm 2]), and let be the length of .
Step 3. Consider the degree of degeneracy of , where is the corank of , and take the standard quiver .
Step 4. Determine a permutation such that .
Step 5. Take By Step 4 we have . Find a matrix such that and , that is, [Hint: using the structural walks of Step 1 and apply equations (11) and (12) from the proof of Proposition 1.23; we also need to find arbitrary connecting walks , for which we may use, for instance, a depth-first search algorithm].
Step 6. Apply Algorithm 3 below to the matrix of Step 5 to find a matrix such that is -invertible and .
Step 7. Apply Algorithm 4 below to the matrix of Step 6 to find a matrix such that if , then and , as wanted. Return the pair .
Using Corollary 4.15, the following correction Algorithms 3 and 4, based on the proofs of Propositions 2.17 and 3.13 respectively, work for arbitrary connected loop-less quivers and with same number of vertices and arrows (see Remark 4.17).
Algorithm 3
Invertible pseudo-morphism.
Input: Two connected loop-less quivers and with the same number of arrows , and a matrix such that .
Output: A matrix such that is -invertible and .
Step 1. Fix kernel matrices and of and respectively, and consider the skew-symmetric matrices and .
Step 2. Make sure that the kernel matrix has the shape , where is a kernel matrix of the reduced radical , and assume that has a similar shape .
Step 3. Find a matrix such that (for instance, using a least squares algorithm). As indicated by the partitions and , the matrices and have the following shapes,
By Corollary 4.15, the matrix is -invertible.
Step 4. Take and . Take also and , where . Then satisfies the claim, as in Proposition 2.17. Return matrix .
Algorithm 4
Strong congruence matrix.
Input: Two connected loop-less quivers and with the same number of arrows , and a -invertible matrix such that .
Output: A -invertible matrix such that and .
Step 1. Fix kernel matrices and of and as in Steps 1 and 2 of Algorithm 3.
Step 2. Take , and use Algorithm 5 below to compute and .
Step 4. Define where is the matrix of Step 3, and . Then satisfies the claim as in the proof of Proposition 3.13. Return matrix .
The following are auxiliary constructions for Algorithm 4.
Algorithm 5
Construction of the bijection of Lemma 3.7.
Input: A connected loop-less quiver with arrows, a fixed kernel matrix of , and a pseudo-endomorphism of .
Output: A matrix such that , where .
Step 1. Find a solution to the equation (for instance, using a least squares algorithm).
Step 2. Find similarly a solution to the equation where is the matrix of Step 1. Return matrix .
Algorithm 6
Special decomposition of a skew-symmetric matrix.
Input: A pair of skew-symmetric matrices, where is pure and in skew normal form.
Output: A matrix such that .
Step 1. Assume first that is -invertible and take . Using Algorithm 7 below we find a matrix such that , and take (see the first part of the proof of Lemma 3.1).
Step 2. Assume now that is not -invertible. Then for a -invertible skew-symmetric matrix and a zero matrix of adequate size, and has the following shape
Step 3. Since and are skew-symmetric, and is -invertible, using Step 1 we find a matrix such that .
Step 4. Take , and let be the upper triangular part of (so that , since is also skew-symmetric). Take
Then satisfies the claim, as in the proof of Lemma 3.1. Return matrix .
Algorithm 7
Direct factorization of a skew-symmetric matrix.
Input: A pair of skew-symmetric matrices, where is -invertible and in skew normal form.
Output: A matrix such that .
Step 1. Since is -invertible then for some . Find a matrix such that
for integers (the product not necessarily in skew normal form).
Step 2. Consider the matrix and return .
Acknowledgements.
Thanks to the anonymous referees for their careful revision and useful suggestions. Thanks to the Instituto de Matemáticas UNAM, Mexico, for financial support. Part of this paper was completed during a research stay at the Faculty of Mathematics and Computer Science of Nicolaus Copernicus University in Toruń within project University Centre of Excellence “Dynamics, Mathematical Analysis and Artificial Intelligence”. The author expresses his gratitude to NCU for the hospitality and for providing excellent working conditions.References
- [1] Arndt J, Matters Computational: Ideas, Algorithms, Source Code, Springer 2011. doi:10.1007/978-3-642-14764-7.
- [2] Barot M. A characterization of positive unit forms, Bol. Soc. Mat. Mexicana (3), 1999. Vol. 5, pp. 87–93.
- [3] Barot M. A characterization of positive unit forms, II, Bol. Soc. Mat. Mexicana (3), 2001. Vol. 7, pp. 13–22.
- [4] Barot M, Geiss C, and Zelevinsky A. Cluster algebras of finite type and positive symmetrizable matrices. J. London Math. Soc., 2006. 73:545–564. doi:10.1112/S0024610706022769.
- [5] Barot M, Jiménez González JA, and de la Peña JA. Quadratic Forms: Combinatorics and Numerical Results, Algebra and Applications, Vol. 25 Springer Nature Switzerland AG 2018. doi:10.1007/978-3-030-05627-8.
- [6] Barot M, and de la Peña JA. The Dynkin type of a non-negative unit form, Expo. Math. 1999. 17:339–348.
- [7] Barot M, and de la Peña JA. Algebras whose Euler form is non-negative, Colloquium Mathematicum 1999. 79:119–131. doi:10.4064/cm-79-1-119-131.
- [8] Barot M, and de la Peña JA. Root-induced integral quadratic forms, Linear Algebra Appl. 2006. 412:291–302. doi:10.1016/j.laa.2005.06.030.
- [9] Bernstein IN, and Gelfand IM, and Ponomarev VA. Coxeter functors and Gabriel’s theorem, Russian Math. Surveys 1973. 28:17–32.
- [10] Bocian R, Felisiak M, and Simson D. On Coxeter Type Classification of Loop-Free Edge-Bipartite Graphs and Matrix Morsifications, 2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013. pp. 115–118. doi:10.1109/SYNASC.2013.22.
- [11] Bocian R, Felisiak M, and Simson D. Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups. Journal of Computational and Applied Mathematics 2014. 259:815–827. doi:10.1016/j.cam.2013.07.013.
- [12] Bongartz K. Algebras and quadratic forms. J. London Math. Soc. (2), 1983. 28(3):461–469.
- [13] Bongartz K. Quadratic forms and finite representation type. In: Malliavin MP. (eds) Séminaire d’Algébre Paul Dubreil et Marie-Paule Malliavin. Lecture Notes in Mathematics, 2006. vol. 1146. Springer, Berlin, Heidelberg. doi:10.1007/BFb0074545.
- [14] Brüstle T, de la Peña JA, and Skowroński A. Tame algebras and Tits quadratic forms, Advances in Mathematics 2011. 226:887–951. doi:10.1016/j.aim.2010.07.007.
- [15] Cameron PJ, Goethals JM, Seidel JJ, and Shult EE. Line graphs, Root Systems, and Elliptic Geometry, J. Algebra 1976. 43:305–327. doi:10.1016/0021-8693(76)90162-9.
- [16] Dean A, and de la Peña JA. Algorithms for weakly nonnegative quadratic forms, Linear Algebra Appl. 1996. 235:35–46. doi:10.1016/0024-3795(94)00109-X.
- [17] Dlab V, and Ringel CM. Indecomposable representations of graphs and algebras. Memoirs AMS 1976. Vol. 6, 173. doi:10.1090/memo/0173.
- [18] Dlab V, and Ringel CM. A module theoretical interpretation of properties of the root systems. Proc. Conf. on Ring Theory (Antwerp, 1978), Marcel Dekker (1979).
- [19] Dräxler P, and de la Peña JA. The homological quadratic form of a biextension algebra. Archiv der Mathematik 1999. 72:9–21. doi:10.1007/s000130050297.
- [20] Dräxler P, and de la Peña JA. Tree algebras with non-negative Tits form. Communications in Algebra 2000. 28(8):3993–4012. doi:10.1080/00927870008827071.
- [21] Dräxler, Drozd YA, Golovachtshuc NS, Ovsienko SA, and Zeldych MM. Towards the classification of sincere weakly positive unit forms. European Journal of Combinatorics 1995. 16(1):1–16. doi:10.1016/0195-6698(95)90084-5.
- [22] Felisiak M, and Simson D. Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs, Discrete Applied Mathematics 10 September 2015. 192:49–64. doi:10.1016/j.dam.2014.05.002.
- [23] Gabriel P. Unzerlegbare Darstellungen I, Man. Math., 1972. 6:71–103. doi:10.1007/BF01298413.
- [24] Gantmacher FR. The Theory of Matrices, Vols. 1 and 2, Chelsea Publishing Company, New York, N.Y. 1960. ISBN:978-0-8218-1376-8, 10:0821813935, 13:978-0821813935.
- [25] Gąsiorek M, Simson D, and Zając K. Algorithmic computation of principal posets using Maple and Python. Algebra and Discrete Math. 2014. 17:33–69. URL. http://dspace.nbuv.gov.ua/handle/ 123456789/152339.
- [26] Gąsiorek M, Simson D, and Zając K. A Gram classification of non-negative corank-two loop-free edge-bipartite graphs. Linear Algebra Appl. 2016. 500:88–118. doi:10.1016/j.laa.2016.03.007.
- [27] Happel D. The converse of Drozd’s theorem on quadratic forms, Communications in Algebra 1995. 23(2):737–738. doi:10.1080/00927879508825243.
- [28] von Höhne H-J. On weakly positive unit forms, Comment. Math. Helvetici 1988. 63:312–336. doi:10.1007/BF02566771.
- [29] von Höhne H-J. Edge reduction for unit forms, Archiv der Mathematik, Vol. 1995. 65:300–302. doi:10.1007/BF01195540.
- [30] von Höhne H-J. On weakly non-negative unit forms and tame algebras, Proc. London Math. Soc. (3) 1996. 73:47–67. doi:10.1112/plms/s3-73.1.47.
- [31] Horn RA, and Sergeichuk VV. Congruences of a square matrix and its transpose, Linear Algebra Appl. 2004. 389:347–353. doi:10.1016/j.laa.2004.03.010.
- [32] Jiménez González JA. Incidence graphs and non-negative integral quadratic forms. Journal of Algebra 2018. 513:208–245. doi:10.1016/j.jalgebra.2018.07.020.
- [33] Jiménez González JA. A graph theoretical framework for the strong Gram classification of non-negative unit forms of Dynkin type . Fundamenta Informaticae 2012. 184(1):49–82. doi:10.3233/FI-2021-2092.
- [34] Jiménez González JA. Coxeter invariants for non-negative unit forms of Dynkin type . Fundamenta Informaticae 2022. 185(3):221–246. doi:10.3233/FI-222109.
- [35] Kasjan S, and Simson D. Mesh algorithms for Coxeter spectral classification of Cox-regular edge-bipartite graphs with loops, I. Mesh root systems. Fundamenta Informaticae 2015. 139(2):153–184. doi:10.3233/FI-2015-1230.
- [36] Kasjan S, and Simson D. Mesh algorithms for Coxeter spectral classification of Cox-regular edge-bipartite graphs with loops, II. Application to Coxeter spectral analysis. Fundamenta Informaticae 2015. 139:185–209. doi:10.3233/FI-2015-1231.
- [37] Kosakowska J. Inflation algorithms for positive and principal edge-bipartite graphs and unit quadratic forms, Fundamenta Informaticae 2012. 119(2):149–162. doi:10.3233/FI-2012-731.
- [38] Lenzing H. A -theoretical study of canonical algebras. In: R. Bautista, et al. (Eds.), Representations of Algebras, Seventh International Conference, Cocoyoc, Mexico, 1994, in: CMS Conf. Proc., American Mathematical Society, Providence, RI. 1996. vol. 18, pp. 433–454.
- [39] Lenzing H, and Reiten I. Hereditary noetherian categories of positive Euler characteristic. Math. Z. 2006. 254:133–171. doi:10.1007/s00209-006-0938-6.
- [40] Makuracki B, and Mróz A. Root systems and inflations of non-negative quasi-Cartan matrices, Linear Algebra Appl. 2019. 580:128–165. doi:10.1016/j.laa.2019.06.006.
- [41] Makuracki B, and Mróz, A. Coefficients of non-negative quasi-Cartan matrices, their symmetrizers and Gram matrices, Discrete Applied Mathematics 2021. 303:108–121. doi:10.1016/j.dam.2020.05.022.
- [42] Makuracki B, and Simson, D. A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm, Discrete Applied Mathematics 253, 25–36 (2019)
- [43] Makuracki B, Simson D, and Zyglarski B. Inflation algorithm for Cox-regular positive edge-bipartite graphs with loops, Fundamenta Informaticae 2017. 153(4):367–398. doi:10.3233/FI-2017-1545.
- [44] Mróz A. Congruences of edge-bipartite graphs with applications to Grothendieck group recognition I. Inflation algorithm revisited, Fundamenta Informaticae 2016. 146(2):121–144. doi:10.3233/FI-2016-1377.
- [45] Mróz A. Congruences of edge-bipartite graphs with applications to Grothendieck group recognition II. Coxeter type study, Fundamenta Informaticae 2016. 146(2):145–177. doi:10.3233/FI-2016-1378.
- [46] Mróz A, and de la Peña JA. Tubes in derived categories and cyclotomic factors of the Coxeter polynomial of an algebra, Journal of Algebra 2014. 420:242–260. doi:10.1016/j.jalgebra.2014.08.017.
- [47] Mróz A, and de la Peña JA. Periodicity in bilinear lattices and the Coxeter formalism, Linear Algebra Appl. 2016. 493:227–260. doi:10.1016/j.laa.2015.11.021.
- [48] Newman M. Integral matrices, Academic Press 1972. ISBN:0080873588, 9780080873589.
- [49] Ovsienko SA. Integral weakly positive forms, in Schur matrix problems and quadratic forms, Inst. Mat. Akad. Nauk. Ukr. S.S.R., Inst. Mat. Kiev (in Russian), 1979. pp. 106–126.
- [50] de la Peña JA. Algebras with hypercritical Tits form. Topics in Algebra, Banach Center Publications, PWN-Polish Scientific Publishers, Warsaw, 1990. 26(1):353–369.
- [51] de la Peña JA. Quadratic forms and the representation type of an algebra. Engänzungsreihe 90–103. Bielefeld 1990.
- [52] Perez C, Abarca M, and Rivera D. Cubic algorithm to compute the Dynkin type of positive definite quasi-Cartan matrices, Fundamenta Informaticae 2018. 158(4):369–384. doi:10.3233/FI-2018-1653.
- [53] Ringel CM. Tame algebras and integral quadratic forms, Springer LNM, 1984. vol. 1099. doi:10.1007/BFb0072870.
- [54] Rotman JJ. A first course in abstract algebra with applications, 3rd Ed., Upper Saddle River, New Jersey 07458, Pearson Prentice Hall 2006. ISBN-10:0201763907, 13:978-0201763904.
- [55] Sato M. Periodic Coxeter matrices and their associated quadratic forms. Linear Algebra Appl. 2005. 406:99–108. doi:10.1016/j.laa.2005.03.036.
- [56] Simson D. Mesh algorithms for solving principal Diophantine equations, sand-glass tubes and tori of roots. Fundamenta Informaticae 2011. 109(4):425–462. doi:10.3233/FI-2011-520.
- [57] Simson D. Mesh geometries of root orbits of integral quadratic forms, J. Pure Appl. Algebras 2011. 215(1):13–34. doi:10.1016/j.jpaa.2010.02.029.
- [58] Simson D. Algorithms determining matrix morsifications, Weyl orbits, Coxeter polynomials and mesh geometries of roots for Dynkin diagrams, Fundamenta Informaticae 2013. 123(4):447–490. doi:10.3233/FI-2013-820.
- [59] Simson D. A framework for Coxeter spectral analysis of edge-bipartite graphs, their rational morsifications and mesh geometries of root orbits, Fundamenta Informaticae 2013. 124(3):309–338. doi:10.3233/FI-2013-836.
- [60] Simson, D. Toroidal algorithms for mesh geometries for Root orbits of the Dynkin diagram , Fundamenta Informaticae 2013. 124(3):339–364. doi:10.3233/FI-2013-837.
- [61] Simson D. A Coxeter Gram classification of positive simply laced edge-bipartite graphs. SIAM J. Discrete Math., 2013. 27:827–854. doi:10.1137/110843721.
- [62] Simson D. Symbolic algorithms computing Gram congruences in the Coxeter spectral classification of edge-bipartite graphs I. A Gram classification. Fundamenta Informaticae 2016. 145(1):19–48. doi:10.3233/FI-2016-1345.
- [63] Simson D. Symbolic algorithms computing Gram congruences in the Coxeter spectral classification of edge-bipartite graphs II. Isotropy mini-groups. Fundamenta Informaticae 2016. 145(1):49–80. doi:10.3233/FI-2016-1346.
- [64] Simson D. A Coxeter spectral classification of positive edge-bipartite graphs I. Dynkin types , , , , , , . Linear Algebra Appl. 2018. 557:105–133. doi:0.1016/j.laa.2018.07.013.
- [65] Simson D. Symbolic computations of strong Gram congruences for positive Cox-regular edge-bipartite graphs with loops, Linear Algebra Appl., 2019. 557:90–143. doi:10.1016/j.laa.2019.02.023.
- [66] Simson D. A computational technique in Coxeter spectral study of symmetrizable integer Cartan matrices. Linear Algebra Appl., 2020. 586:190–238. doi:10.1016/j.laa.2019.10.015.
- [67] Simson D. A Coxeter spectral classification of positive edge-bipartite graphs II. Dynkin type . Linear Algebra Appl. 2021. 612:223–272. doi:10.1016/j.laa.2020.11.001.
- [68] Simson D. Weyl orbits of matrix morsifications and a Coxeter spectral classification of positive signed graphs and quasi-Cartan matrices of Dynkin type . Advances in Mathematics 404, 108389 (2022)
- [69] Simson D, and Zając K. A Framework for Coxeter Spectral Classification of Finite Posets and Their Mesh Geometries of Roots, Hindawi Publishing Corporation International Journal of Mathematics and Mathematical Sciences Vol. 2013, Article ID: 743734, 22 pages.
- [70] Simson D, and Zając K. Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two, Linear Algebra Appl. 2017. 524, 109–152. doi:10.1016/j.laa.2017.02.021.
- [71] Sloane NJA. The On-Line Encyclopedia of Integer Sequences, (2009). URL: http://oeis.org/classic/?blank=1.
- [72] Veblen O, and Franklin P. On matrices whose elements are integers. Annals of Mathematics, Second Series, 1921. 23:(1):1–15. doi:10.2307/1967777.
- [73] Zaslavsky T. The geometry of root systems and signed graphs, Amer. Math. Monthly 1981. 88(2):88–105. doi:10.2307/2321133.
- [74] Zaslavsky T. Matrices in the theory of signed simple graphs, in: Advances in Discrete Mathematics and Applications: Mysore, 2008, in Ramanujan Math. Soc. Lect. Notes Ser., Vol. 13, Ramanujan Math. Soc., Mysore, 2010, pp. 207–229. doi:10.48550/arXiv.1303.3083.