Inducing spectral gaps for the cohomological
Laplacians of and
Abstract.
The technique of inducing spectral gaps for cohomological Laplacians in degree zero was used by Kaluba, Kielak and Nowak [KKN21] to prove property (T) for and . In this paper, we adapt this technique to Laplacians in degree one. This allows to provide a lower bound for the cohomological Laplacian in degree one for for every unitary representation. In particular, one gets in that way an alternative proof of property (T) for whenever .
1. Introduction
Cohomological Laplacians were introduced by Bader and Nowak [BN20] in the context of vanishing of group cohomology with unitary coefficients. Such vanishing of the first cohomology is known to be equivalent to Kazhdan’s property (T) and an algebraic characterization for it was found by Ozawa [Oza16] for finitely generated groups. It turns out that property (T) can be described in terms of a specific degree zero Laplacian : Ozawa showed that a group has property (T) if and only if is a sum of squares in the real group ring for some positive spectral gap . Using this characterization, Kaluba, Kielak, Nowak, and Ozawa [KNO19, KKN21] were able to show property (T) for and for and respectively. Estimating the spectral gap from below has another advantage of prividing a lower bound for , the Kazhdan constant associated to a generating set of a group . It is known that has property (T) if and only if and this inequality does not depend on the generating set. For a symmetric generating set , the lower bound for Kazhdan constants is given by the formula (see [BdlHV08, Remark 5.4.7] and [KN18])
where is a positive constant such that is a sum of squares.
We focus on providing lower bounds for the spectral gap of , the one-degree Laplacian. The existence of such a positive spectral gap for a group is equivalent to vanishing of the first cohomology of with unitary coefficients and reducibility of the second (reducibility means that the images of the differentials in the chain complex of Hilbert spaces computing the cohomology for a given unitary representation are closed), see [BN20, The Main Theorem]. Once a positive spectral gap is found for , it turns out to be a lower bound for the Ozawa’s spectral gap, see Remark 2.2. We acknowledge that it has been recently announced by U. Bader and R. Sauer that the reducibility condition is a consequence of vanishing of cohomology one degree lower, see [BS23].
Recently, M. Kaluba, P. W. Nowak and the author showed that for , the first cohomological Laplacian of , and , the matrix is a sum of squares ([KMN24, Theorem 1.1]). In this paper we show how to use a slightly stronger statement for to induce the spectral gap for , whenever . Our technique works as well for the case . We remark however that in such a case we were unable to obtain such a spectral gap for any particular . On the other other hand, in his preprint [Nit22] M. Nitsche shows property (T) for . This, in combination with the work of Bader and Nowak [BN20] and the announcement of Bader and Sauer, would yield the desired gap for the Laplacian in degree one for . Nevertheless, this will still not allow us to induce the spectral gap since we would need a spectral gap for a specific summand of the Laplacian of .
Our induction technique is inspired by the idea of decomposing the generating set of into three parts: square, adjacent, and opposite, see [KKN21]. This allows us to decompose for any into the sum of the appropriate parts. Denoting the adjacent part by for any , and the generating set for by , the main theorem can be stated as follows.
Theorem 1.1 (cf. Corollary 5.5).
Suppose is a sum of squares in . Then
is a sum of squares in for any .
Bounding the spectral gap for the adjacent part of , we get the following
Corollary 1.2 (cf. Corollary 6.2).
Let be the cohomological Laplacian in degree one of . Then is a sum of squares for .
To our knowledge, the lower bounds for the spectral gaps we obtained are the first examples of explicit computations for for an infinite family of property (T) groups.
This article is organized as follows. In section 2 we introduce Fox derivatives which provide a setting to calculate one-degree Laplacians and define the positivity in the group ring setting in terms of sums of squares. In the next section we introduce the presentions for : using the elementary matrices for and Nielsen transvections for . Next, we decompose the Laplacian in degree one into the three parts mentioned above. In section 5 we show Theorem 1.1 using the technique of symmetrization and apply this result in the section 6 to obtain a lower bound for the spectral gap of for whenever .
Acknowledgements
The author would like to express his sincere thanks to Prof. Dawid Kielak for many valuable suggestions concerning the induction technique. I am also greatly indebted to Dr Marek Kaluba for his collaboration on the substance of section 5.2, as well as his careful reading of the whole contents and many valuable remarks.
This research was supported by National Science Centre, Poland SONATINA 6 grant Algebraic spectral gaps in group cohomology (grant agreement no. 2022/44/C/ST1/00037).
2. Fox derivatives and sums of squares
We describe the model of which appears in Theorem 1.1. This can be achieved by means of Fox derivatives. Further details can be found in the papers of Fox and Lyndon, [Fox53, Fox54, Lyn50, LS77].
Let be a finitely presented group. The Fox derivatives are the endomorphisms of , the group ring of the free group , given by the following conditions:
where denotes the Kronecker delta. The Jacobian of is then the matrix obtained by quotienting the Fox derivatives into the group ring . Denoting by the vertical vector , the one-degree Laplacian associated to the presentation is defined by
where and , and, for any matrix with entries in , the matrix is the composition of the matrix transposition with the -involution on given by .
Definition 2.1.
We say that a matrix is a sum of squares if there exist matrices such that .
It follows from [BN20, Lemma 14] that , and therefore as well, are sums of squares.
By saying that a matrix has a positive spectral gap we mean that there exists a positive such that is a sum of squares.
As noted in [KMN24, Lemma 2.1], it turns out that we have some freedom in choosing the relations which build up . Denote
and put for any subset of indices . Then, once has a spectral gap then has at least the same spectral gap.
Computing lower bounds for sepctral gaps for the first Laplacians provides the bounds for the Ozawa’s spectral gap:
Remark 2.2.
Suppose the matrix is a sum of squares for some subset of relator indices and a positive constant and let . Then is a sum of squares as well (note that is always zero). Note that in the case the generating set and the set of its inverses, , are disjoint, then is the zero degree Laplacian for the symmetric generating set .
3. Presentations of and
In this section, we introduce the presentations of and which we shall use to perform the Fox calculus and prove property (T) for these groups. The presentations can be found in [CRW92] and [Ger84] for and respectively. For the latter, we provide an equivalent presentation which is easy to obtain from [Ger84].
The presentation for is given below.
The generator represents the elementary matrix with at the -th entry and the diagonal and zeroes elsewhere. Using Remark 2.2, we shall exclude the relation from further considerations.
The generators of are denoted by and for and are called left and right Nielsen transvections respectively. The relator set contains commutators and pentagonal relations as well, along with other relations which we shall not consider, again by Remark 2.2. We only present the commutator and pentagonal relations therefore. These relations are defined for distinct indices as follows:
The transvection generators correspond in to the following automorphisms of 111We take in the group operation order given by composition of automorphisms, i.e. . Note that this is different than the convention of Gersten [Ger84]. In his paper the convention is: . We had to reverse the order in pentagonal relators for that account.:
4. Decomposition into square, adjacent and opposite part
Let be an integer and be or . We introduce the following decompositions of the Laplacians of :
Our decomposition is inspired by [KKN21, pp. 543 – 545].
The generators of take form for and denoting either elementary matrices or Nielsen transvections. Then, for any , there exists a natural embedding given by . From now on, when talking about the relations of , we shall restrict ourselves to commutator and pentagonal relations only.
Let be the -simplex with the vertices and let denote the set of its faces, that is the subsets of the set . Denoting by the generator set of and by the free group on , one can define the map
by sending an element of to the face on the indices of the generators occurring in that element, i.e.
In order to define , and we distinguish from the following three subsets of faces
that is, , and constitute respectively the sets of edges, triangles, and tetrahedra of .
The decomposition is obtained as follows:
We remark that the group ring elements , , and are equal to the elements , , and as defined in [KKN21].
The decomposition is defined, in turn, by summing over specific relators of .
Note that and can be non-zero only if or belongs to and respectively. We shall call , and the square, adjacent and opposite part respectively.
Example 4.1.
Let and let us focus on . We have six generators of , namely the elementary matrices , , , , , and . The relator set we take into account contains the following relators:
The simplex is a triangle. Its faces contain three edges – more precisely, , and only one triangle, i.e. . There are no tetrahedra in .
The function takes the following values on the generators (the situation depicted in Figure 1):
and is constant on the relators – for every one has . Thus, denoting by the element , we get
and
It is apparent that is the zero matrix. Since equals the face on all relators, we have
for any two generators . In particular, and are the zero matrices.
Example 4.2.
This time, let and . The matrices get significantly bigger for this case and for this account we shall restrict ourselves to the demonstration of the function only. The following transvections consitute the generators of :
Since there are already relatively many relations of , we will not list them all. Instead, we comment on the values that the function takes on them. The simplex is a tetrahderon. The faces of contain six edges, four triangles and one tetrahedron:
The function takes the following values on the generators (see Figure 2):
Let be pairwise distinct. The values of on the relators are the following:
4.1. Sum of squares decomposition for square and opposite part
It turns out that the square and opposite parts behave well with respect to sum of squares decompositions. The precise statement is given below.
Lemma 4.3.
The matrices and are sums of squares.
Proof.
For any , define to be the column vector indexed by the generators of with the only non-zero entries being , indexed by the generators satisfying . That is a sums of squares follows from the decomposition below:
We have already observed that both and (in this case, just by the definition) have vanishing -entries whenever or the generator has the same indices as but with the reversed order. In addition, the diagonal vanishes for as well. This is not the case for . However, since is a sum of squares by its definition, it follows that the same applies to its diagonal part. On the other hand, the non-diagonal parts of and cancel out – for distinct we have:
∎
5. Symmetrization of the adjacent part
In this section we show how to get the lower bound for spectral gap of for once we assume that the lower bound for the corresponding spectral gap for is known for some . Our method is inspired by the symmetrization method used in [KKN21].
5.1. General setting for symmetrization
Note that the symmetric group acts by automorphisms on by sending the generator to for any permutation . This induces an action of on by automorphisms which preserves the -involution. Using this action we can define the action on by the formula
for any matrix over indexed by the generators . This is also the action by -algebra automorphisms (the multiplication being the group ring matrix multiplication). Thus, for any matrix and , the matrix is a sum of squares provided was a sum of squares.
5.2. Invariance of Laplacians
Let us show first that the adjacent Laplacians and for are -invariant. The statement for is straightforward:
Let us show the invariance of . Let be the number of generators of and be the number of its relations such that . Suppose moreover that this set of relations is invariant with respect to the action of , that is, for all and satisfying , the word is another relator. Notice that each permutation from defines permutations of and (we fix the order of generators and relations such that ). Having this, we can endow both products and with the action of as follows:
Finally, denote by the Jacobian map from to given by the relations such that , that is . It turns out that the invariance of follows from the equivariance of :
Lemma 5.1.
For any we have provided is equivariant.
Proof.
Suppose is equivariant. Let . Since we have ordered the generators in , we can identify them with the corresponding indices from the set . Thus, we must show that for any .
It is easy to check that the equivariance of is equivalent to the following condition: for any and . Using this relationship, we get
∎
The following lemma is the key tool to prove the equivariance of .
Lemma 5.2.
For any , and a word in the free group generated by , the following holds:
where the action of on is given by for any .
Proof.
We prove the assertion by induction on the word length of the relation . Note first that both sides of the equation in question vanish for . Suppose is a single generator (if is the inverse of a generator, the proof is analogous). In the case both sides of the equation in question vanish. If , then
while if , then
Suppose now the assertion follows for all words of length . Take a word of length . Then for some words and of length at most . Using the induction assumption, we get
∎
Corollary 5.3.
The Jacobian homomorphism is an equivariant map.
Proof.
5.3. Adjacent part symmetrizes well
In this section we show how to express in terms of and the action of the symmetric group , for any . This allows us to induce spectral gaps for parts (cf. Corollary 5.5).
For any and , we denote by the embedding of the adjacent part given by the traingle of , i.e., for any generators and of , we have
Since it shall be clear from the context, given , we shall also denote by the canonical embedding of into :
Due to the same reason, we decided to remove the grading from the notation .
Lemma 5.4.
For , one has
Proof.
The idea of the proof is to transfer the action of the symmetric group from the matrices over group rings to the simplex and apply the invariance of under the action of . The transfer is possible due to the following relationships:
(1) |
holding for every permutation and a triangle . Let us show (1) for only since the proof for is a direct application of its definition and the action of on . Pick two generators and of . Then, it follows by Lemma 5.2 that
Note that, for any , we can express by summing its projections to the triangles of :
Applying (1) and the orbit-stabilizer theorem applied to the action of on the triangles , we get
(2) |
Let , be the representatives of the cosets . Applying (2) first for and then for , we get
We conclude the proof by applying -invariance of (cf. Lemma 5.1 and Corollary 5.3):
∎
For any , let . We have the following
Corollary 5.5 (cf. Theorem 1.1).
The matrix
is a sum of squares in , provided is a sum of squares in .
Proof.
As in the case of , let us also use the notation for the canonical embedding of into . We show first that
(3) |
Note that the right-hand side of the expression above is a multiplicity of the identity matrix. Let be in the case and in the case . Then each summand contributes neutral elements to the diagonal which yields neutral elements altogether. Since the diagonal of has neutral elements, the multiplication factor is equal to .
6. Application to
In this section, let for any . Using the algorithm for estimating lower bounds for spectral gaps for matrices over group rings described in [KMN24], we were able to obtain the following
Lemma 6.1.
The matrix is a sum of squares in .
The replication details of the computation justifying the result above have been desribed in subsection 6.1.
Corollary 6.2 (cf. Corollary 1.2).
Let be the cohomological Laplacian in degree one of . Then is a sum of squares in for .
Proof.
Lemma 6.1 together with Corollary 5.5 show that is a sum of squares in . It follows by Lemma 4.3 that the matrices and are sums of squares. From this we conclude that is a sum of squares in :
∎
6.1. Replication details for
The arguments for converting the numerical sum of squares approximation to the actual one have been described in subsection 3.2 of [KMN24]. Further details concerning finding the numerical approximation can be also found in [KMN24].
We provide a Julia [BEKS17] code to replicate the result of Lemma 6.1. The replication has been described at [KM22], in the ”README.md” file, in the section marked with the arXiv identifier of this preprint. Note that, in order to access the version of the repository corresponding to this article, switching to the branch marked with its arXiv identifier is necessary. The script ”SL_3_Z_adj.jl” contains the replication code for the result of Lemma 6.1. We encourage, however, to use the precomputed solution and run the script ”SL_3_Z_adj_cert.jl” contained in the ”sl3_adj_precom” folder. It should take approximately minute on a standard laptop computer to run the certification script providing the rigorous mathematical proof (the script containing the whole computation takes in turn about hours). The hermitian-squared matrices from the decomposition obtained in Lemma 6.1 have entries supported on the ball of radius with respect to the word-length metric defined by the generating set consisting of six elementary matrices , , , , , and .
References
- [BdlHV08] Bachir Bekka, Pierre de la Harpe, and Alain Valette. Kazhdan’s property (T), volume 11 of New Mathematical Monographs. Cambridge University Press, Cambridge, 2008.
- [BEKS17] Jeff Bezanson, Alan Edelman, Stefan Karpinski, and Viral B Shah. Julia: A fresh approach to numerical computing. SIAM review, 59(1):65–98, 2017.
- [BN20] Uri Bader and Piotr W. Nowak. Group algebra criteria for vanishing of cohomology. J. Funct. Anal., 279(11):108730, 18, 2020.
- [BS23] Uri Bader and Roman Sauer. Higher kazhdan property and unitary cohomology of arithmetic groups, 2023. https://arxiv.org/abs/2308.06517.
- [CRW92] Marston Conder, Edmund Robertson, and Peter Williams. Presentations for -dimensional special linear groups over integer rings. Proc. Amer. Math. Soc., 115(1):19–26, 1992.
- [Fox53] Ralph H. Fox. Free differential calculus. I. Derivation in the free group ring. Ann. of Math. (2), 57:547–560, 1953.
- [Fox54] Ralph H. Fox. Free differential calculus. II. The isomorphism problem of groups. Ann. of Math. (2), 59:196–210, 1954.
- [Ger84] S. M. Gersten. A presentation for the special automorphism group of a free group. J. Pure Appl. Algebra, 33(3):269–279, 1984.
- [KKN21] Marek Kaluba, Dawid Kielak, and Piotr W. Nowak. On property (T) for and . Ann. of Math. (2), 193(2):539–562, 2021.
- [KM22] Marek Kaluba and Piotr Mizerka. LowCohomologySOS, 2022. https://github.com/piotrmizerka/LowCohomologySOS.
- [KMN24] Marek Kaluba, Piotr Mizerka, and Piotr W. Nowak. Spectral gap for the cohomological laplacian of . Experimental Mathematics, 0(0):1–6, 2024.
- [KN18] Marek Kaluba and Piotr W. Nowak. Certifying numerical estimates of spectral gaps. Groups Complex. Cryptol., 10(1):33–41, 2018.
- [KNO19] Marek Kaluba, Piotr W. Nowak, and Narutaka Ozawa. has property . Math. Ann., 375(3-4):1169–1191, 2019.
- [LS77] Roger C. Lyndon and Paul E. Schupp. Combinatorial group theory. Ergebnisse der Mathematik und ihrer Grenzgebiete, Band 89. Springer-Verlag, Berlin-New York, 1977.
- [Lyn50] Roger C. Lyndon. Cohomology theory of groups with a single defining relation. Ann. of Math. (2), 52:650–665, 1950.
- [Nit22] Martin Nitsche. Computer proofs for property (t), and sdp duality, 2022. https://arxiv.org/abs/2009.05134.
- [Oza16] Narutaka Ozawa. Noncommutative real algebraic geometry of Kazhdan’s property (T). J. Inst. Math. Jussieu, 15(1):85–90, 2016.