LPS-Type Ramanujan Graphs from Definite Quaternion Algebras over of Class Number One
Abstract.
In this paper we construct explicit LPS-type Ramanujan graphs from each definite quaternion algebra over of class number 1, extending the constructions of [10] and [1], and answering in the affirmative a question raised in [6]. We do this by showing that for each definite quaternion algebra over of class number 1 with maximal order , if and is prime such that then there exists a congruence -arithmetic subgroup of which acts simply transitively on the Bruhat-Tits tree of .
1. Introduction
A -regular graph is called a Ramanujan graph if the second largest eigenvalue in absolute value is less than or equal to . Ramanujan graphs are optimal expander graphs from a spectral perspective. In their paper [10], Lubotzky, Philips, and Sarnak explicitly construct a family of degree Ramanujan graphs, for each odd prime (for the case see [2]). The LPS Ramanujan graphs are Cayley graphs of the group for primes , with respect to a well-chosen generating set coming from the Hamiltonian quaternion algebra over . In [1], Chiu addresses the case when and gives an explicit construction of a family of 3-regular Ramanujan graphs, by using the definite quaternion algebra over with discriminant 13.
In [6], Jo and Yamasaki generalize the construction of LPS and Chiu’s Ramanujan graphs. More precisely, they consider any definite quaternion algebra over of class number one, make use of Ibukiyama’s [5] explicit construction of maximal orders for all definite quaternion algebras, and construct Cayley graphs of with generating sets coming from these quaternion algebras, which they call LPS-type graphs.
The question of whether these LPS-type graphs are indeed Ramanujan was raised in [6], who were able to answer it only in the special case of the definite quaternion algebra over with discriminant 13. In this paper we answer this question affirmatively, showing that for any definite quaternion algebra over of class number one we can construct from it LPS-type Ramanujan graphs.
Theorem 1.1.
For any , let be a quaternion algebra over with discriminant and let be the maximal order of . For almost any prime , there is a specific subset of size , such that the LPS-type graphs of , for infinitely many primes , with respect to the generating set , are Ramanujan graphs.
For the precise construction of these Ramanujan graphs, see Section 5. The key ingredient in proving Theorem 1.1 is to find congruence -arithmetic subgroups of , where , which acts simply transitively on the vertices of the Bruhat-Tits tree of . The fact that it is a congruence subgroup is crucial for the proof that these graphs are Ramanujan, see for example [9, Theorem 7.3.1].
Therefore, our second main result, which might be of independent interest, is the construction of such congruence subgroups which acts simply transitively on Bruhat-Tits trees.
Theorem 1.2.
Let be a quaternion algebra over of class number one and let be the maximal order of . For any commutative ring with unity , define the group . Then there exists and such that for any prime , the congruence subgroup
acts simply transitively on the vertices of the Bruhat-Tits tree of .
Organization of the paper: In section 2, we collect definitions and results on quaternion algebras, their orders and Bruhat-Tits trees. In section 3, we explain the construction of Ramanujan graphs as Cayley graphs of . In section 4, we describe the construction of LPS-type graphs and show how Theorem 1.1 is obtained from Theorem 1.2. In section 5, we prove Theorem 1.2, and show that the definite quaternion algebra over of discriminant 3 does not contain a simply transitively congruence subgroup of level , for any prime .
2. Preliminaries
Notation.
Let be a prime number and a ring. We will use the following conventions:
-
•
denotes the field of elements.
-
•
denotes the set of -adic integers and the set of -adic rationals.
-
•
denotes the multiplicative group of units in .
-
•
denotes the ring of matrices over .
-
•
and .
-
•
and .
-
•
are the symmetric and alternating group on elements respectively.
-
•
is the cyclic group of elements.
-
•
is the dihedral group of elements.
-
•
is the trivial group.
-
•
For a finite group , denotes the conjugacy classes of subgroups of .
-
•
Let a group act on a set . For , .
2.1. Quaternion Algebras
Let be a field of characteristic and . The quaternion algebra is an algebra over generated by the elements satisfying
Let . We define the conjugate and norm of to be
respectively. We write to denote quaternion algebras over .
We say that a quaternion algebra splits if . Otherwise we say that ramifies. Similarly, we say that a quaternion algebra over splits at a prime if . Otherwise, we say that ramifies at . We say that a quaternion algebra is definite if is a division algebra. The following lemma gives us helpful facts about splitting.
Proposition 2.1.
[13, Corollary 7.1.2, Theorem 14.1.3]
-
(1)
A quaternion algebra that is not a division ring splits.
-
(2)
For any finite field , all quaternion algebras over split.
-
(3)
Two definite quaternion algebras and over are isomorphic if and only if they ramify at exactly the same primes.
-
(4)
A quaternion algebra over ramifies at only finitely many primes.
The product of the finitely many primes at which ramifies at is called the discriminant of and is denoted .
2.2. Orders of Quaternion Algebras
An order of a quaternion algebra is a rank 4 module over that is also a subring of . An order is called a maximal order if it is not properly contained in an order of . A right ideal of an order is a module satisfying . The class number of an order is the number of inequivalent right ideals of , where two ideals are equivalent if for some . It turns out that all maximal orders of a quaternion algebra have the same class number [13, Chapter 17] and we define the class number of the quaternion algebra to be the class number of its maximal orders. The following theorem provides a way to calculate the class number of a quaternion algebra.
Theorem 2.2.
[4, Theorem 6] The class number of a definite quaternion algebra is given by
where is the Legendre symbol defined as
Corollary 2.3.
The class number of is if and only if .
A class number one quaternion algebra over has only one maximal order up to conjugation. When the quaternion algebra is definite and has class number 1, the following theorem gives us a way to count the number of elements whose norm is a prime power, unique up to units, in the maximal ideal.
Proposition 2.4.
[1, Theorem 3.2] Let be a definite quaternion algebra of class number 1 over which splits at . Let be a maximal order of . Then,
2.3. The Bruhat-Tits Tree
A lattice in is a rank 2 -submodule of . Given two -lattices in , if for some , then we say that and are homothetic, and we write . Let be the set of -lattices in . It is clear that the homoethetic relation defines an equivalence relation on . We define the set of homothetic classes of lattices to be . Let be the graph whose vertices are elements of . Given two vertices and , there is an edge between and if and only if there exists and such that
Theorem 2.5.
[12, Chapter II Theorem 1] The graph defined above is a tree of degree .
We call the Bruhat-Tits tree of degree . The following proposition relates the Bruhat-Tits tree to the groups and .
Proposition 2.6.
[12, Chapter II, Sections 3,4] The group acts transitively on the Bruhat-Tits tree and the stabilizer of the root is .
3. Ramanujan Graphs and Algebraic Groups
3.1. The Algebraic Group
Fix a prime . Let be a definite class number 1 quaternion algebra over which splits at . Let be the unique (up to conjugacy) maximal order of . Let be the norm. Note that and
For any abelian ring with unity , define
When the context is clear, we drop the subscript . Note that . Furthermore, . Therefore,
(1) |
The following proposition relates to the Bruhat-Tits tree .
Proposition 3.1.
The group acts transitively on the vertices of and is the stabilizer of .
Proof.
Because splits at , there is an isomorphism such that for . The map induces an embedding, . Matrices of determinant map any vertex of to a neighbor. Thus, elements in of norm map any vertex to a neighbor. By Proposition 2.4, there exist elements in that have norm . They map each vertex of to the neighbors of it. Thus, we can reach any vertex of by a product of elements of norm acting on the origin. Therefore, acts transitively on .
We have that . Elements in have determinants in . Thus, . Therefore, when acts on , the stabilizer of the root is . ∎
We want to find a subgroup of which acts simply transitively on . Let be a positive integer. We define the reduction modulo map to be
where is the reduction modulo of the integer . We know from (1) that elements of are represented by elements of , so induces a map,
Definition 3.2.
Let be a group and let be subgroups of . We call a right complement of if
Definition 3.3.
Let be a pair where is a positive integer and is a subgroup of such that
-
(1)
embeds into via ,
-
(2)
is a right complement of in .
Then we call a congruence pair of . If , we define the following congruence subgroup of ,
with a subset
When the context is clear, we write and .
Proposition 3.4.
Let be a congruence pair of . Then and are complementary subgroups of ,
Proof.
We have that , so is a subgroup of . We can deduce that from the assumptions and is injective. Let . We have that , so we can choose and be such that . We have that
Therefore, . Thus, , so . Therefore, . ∎
Proposition 3.5.
Let be a congruence pair of . Then the group acts simply transitively on the Bruhat-Tits tree .
Proof.
We first show that acts transtively on . Let be vertices of . Let be a -lattice. There exists such that . By Proposition 3.4, we can write for and . We have that
because is the stabilizer of . Therefore, acts transitively on . Lastly, acts imply on because
∎
Proposition 3.6.
For any congruence pair , and generates .
Proof.
The group acts transitively on the vertices of . Therefore, there exist at least elements of which take to each of its neighbors respectively. Each of these elements have norm . Let and be distinct elements of norm such that . Then is a nontrivial element of which acts trivially on . This is a contradiction because acts simply on the vertices of . Therefore, there are exactly elements in of norm . We now want to show that generates . Fix a vertex of of distance from . For every neighbor of , there exists a unique element of which takes to . Therefore, there exists a unique word of symbols in of length which takes . Therefore, there is an isomorphism of graphs with taken as the identity. Because is connected, we have that generates . ∎
The following proposition characterizes the structure of . This proposition also helps us find congruence pairs .
Proposition 3.7.
When for , then
Proof.
splits at . Thus, because is a maximal order of . Therefore, we have the following isomorphisms of rings,
We have that . Therefore, by showing that , we have that . ∎
Proposition 3.8.
Let be a prime such that splits at . Let
i.e., the kernel of restricted to . Then we have the following isomorphism of groups,
Proof.
By Proposition 3.7, . We want to show that , for which we use Strong Approximation. By [11, Lemma 1.2], the reduction modulo map induces a surjection
Let for . By [11, Lemma 1.1], we can find such that is of norm where and . Therefore,
Let . Then, for some . Suppose that . Then there exists such that and . Let such that . Note that in . Moreover,
Therefore, . Now suppose that . Suppose that and . Then there exists , , such that but this implies is a square modulo , which is a contradiction. Therefore, and . But is an index 2 subgroup of , so . ∎
Let be an odd prime such that . Let . Note that when is not injective on , we consider to be a multi-set where each element has multiplicity of the size of its pre-image in . As shown above, we can consider this set to be a generating set of . Therefore, we have the Cayley graph
Proposition 3.9.
When is an odd prime such that , we have an isometry of graphs
Proof.
As a subgroup of , the group acts simply on . By Proposition 3.8, the orbits of the action are in 1-1 correspondence with . We can thus view the vertices of the quotient graph as elements of . We see this in the sequence of bijections of sets,
where are the vertices of . By Proposition 3.6, generates so generates the quotient graph. ∎
Theorem 3.10.
[9, Theorem 7.3.1] Let be a maximal order of class number 1 which splits at a prime . Let be a prime such that . Let be a congruence pair of . Then the Cayley graph is a Ramanujan graph.
Note that so the graph has vertices.
4. Construction of Explicit Maximal Orders and LPS-Type Ramanujan Graphs
In this section, we explain Jo and Yamasaki’s construction of LPS-type graphs as in [6]. In the construction, we need a quaternion algebra of class number 1 and a maximal order. In [5], Ibukiyama explicitly constructs a maximal order for any definite quaternion algebra over . We discuss a special case for when the quaternion algebra only ramifies at one prime.
Proposition 4.1 ([5]).
Let be a prime number. Take a prime such that
(2) |
Let be an integer such that . Then, (i.e. , , ) is a definite quaternion algebra which only ramifies at and the quaternion algebra has a maximal order where
Definition 4.2.
Let be a pair of positive integers such that is prime and satisfies (2). We call an Ibukiyama Pair.
Note that by quadratic reciprocity, we can find an appropriate integer that satisfies the required conditions. By Corollary 2.3, the class number of is 1 if and only if . Also, if then
(3) |
Note that our choice of and is irrelevant. We now make the following adjustments to our notation:
Proposition 4.3.
[6, Remark V.2] Let be a prime, , and . The map induced by the reduction modulo map on is defined by
where
gives an isomorphism satisfying .
Lemma 4.4.
Let be an Ibukiyama pair. Then
where
Proof.
Using (3), we see that the number of elements with and is . Therefore, .
Because , we can break up the to put the elements of in terms of . It is clear that the elements of and have nonzero norm. Furthermore, and are both closed under multiplication. Thus, and can be identified as subgroups of . Observe that , , . We have computed that , which shows that . Lastly, is normal in because for and , we have that and
Therefore, . ∎
Definition 4.5.
An LPS-type graph is any graph constructed in the following way:
-
(1)
Fix a prime .
-
(2)
Let be an Ibukiyama pair such that , . We have a definite class number 1 rational maximal order which splits at .
-
(3)
Find all elements in by solving the norm equation .
-
(4)
Find elements of of norm , unique up to units, which form a set .
-
(5)
Take a prime satisfying
(4) -
(6)
Via the reduction map then the isomorphism in Proposition 4.3, realize as a multi-set of elements of and write it as . Note that each element of has multiplicity of the size of its pre-image in .
-
(7)
Construct the Cayley graph
The graph is a LPS-type graph.
Theorem 4.6.
Let be an Ibukiyama pair. Let be elements of norm in . Let be a prime such that satisifies . Let be the corresponding LPS-type graph. If we can find a congruence pair of such that , then is Ramanujan.
Proof.
We have that is a rational maximal class number one maximal order which splits at . Because for some congruence pair , we have that . Theorem 3.10 implies that is Ramanujan. ∎
5. The Ramanujan Property for Certain LPS-Type Graphs
Our goal is to show that we can construct Ramanujan LPS-type graphs from definite class number 1 rational quaternion algebras. That is, we want to prove Theorem 1.2, which we restate more explicitly below in terms of congruence pairs. Note that by Proposition 3.5, we have that Theorem 5.1 is equivalent to Theorem 1.2.
Theorem 5.1.
Let be a definite class number 1 quaternion algebra over . Let be the unique maximal order of . There exists a positive integer and a subgroup of such that is a congruence pair.
To prove Theorem 5.1, we need the following calculation.
Proposition 5.2.
The unit groups of for are
Proof.
Proof of Theorem 5.1.
Note that is completely determined by the ramified primes, so the choice of does not matter.
5.1. The Quaternion Algebra Ramifies at 2
Set and . Observe that (we don’t need the reciprocity condition because ). Set . Observe that . is a quaternion algebra over which is of class number 1 and ramifies only at 2. By Theorem 4.1, has a maximal order , where
Lemma 5.3.
Proof.
1 | 1 | ||||||
---|---|---|---|---|---|---|---|
1 | 0 | 0 | 1 | 0 | 0 | 3/11 | 1/11 |
0 | 1 | 0 | -2 | 1/2 | 0 | -1/22 | -2/11 |
0 | 1 | 0 | -1 | 1/2 | 0 | 5/22 | -1/11 |
1 | -3 | -1 | 5 | -1/2 | -1/2 | -3/22 | -1/22 |
1 | -3 | -1 | 6 | -1/2 | -1/2 | 3/22 | 1/22 |
1 | -2 | -1 | 4 | 0 | -1/2 | 1/11 | -3/22 |
1 | -1 | 0 | 1 | 1/2 | 0 | -5/22 | 1/11 |
1 | -1 | 0 | 2 | 1/2 | 0 | 1/22 | 2/11 |
1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
2 | -4 | -1 | 7 | 0 | -1/2 | -1/22 | 3/22 |
2 | -3 | -1 | 5 | 1/2 | -1/2 | -3/22 | -1/22 |
2 | -3 | -1 | 6 | 1/2 | -1/2 | 3/22 | 1/22 |
Proposition 5.4.
There exists a subgroup such that and is a congruence pair of .
5.2. The Quaternion Algebra Ramifies at 3
Set and . Observe that and . Set . Observe that . Thus, is a quaternion algebra over which is of class number 1 and ramifies only at 3. By Theorem 4.1, has a maximal order , where
Lemma 5.5.
Proof.
For , it follows from (3) that
Solving , we get 12 solutions in , which form a group under multiplication. When we quotient by , we get a noncommutative group with six elements. There is only one noncommutative group of order 6, , so . Representations of the elements of are enumerated in Figure 2. ∎
1 | 1 | ||||||
1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 |
2 | -4 | -1 | 10 | 0 | -1/2 | 2/19 | 1/38 |
2 | -4 | -1 | 9 | 0 | -1/2 | -2/19 | -1/38 |
1 | -1 | 0 | 2 | 1/2 | 0 | -3/38 | 2/19 |
0 | 1 | 0 | -2 | 1/2 | 0 | 3/38 | -2/19 |
0 | 0 | 0 | 1 | 0 | 0 | 4/19 | 1/19 |
Proposition 5.6.
There exist subgroups such that
and , , and are congruence pairs of .
5.3. The Quaternion Algebra Ramifies at 5
Set and . Observe that and . Set . Observe that . is a quaternion algebra over which is of class number 1 and ramifies only at 5. By Theorem 4.1, has a maximal order , where
Lemma 5.7.
Proof.
For , it follows from (3) that
Solving , we get solutions in , which form a group under multiplication. When we quotient by , we get a group which is isomorphic to . ∎
Lemma 5.8.
Let
The set is a group isomorphic with .
Proof.
We first check that contains inverses. Suppose that . Then
Therefore, . Next suppose that , then
In particular, every element of has order 2. Therefore, for . We now show that is a group. We check the following cases.
-
(1)
Let . Let and . Then
Therefore, .
-
(2)
Let . Let and . Then
Therefore, .
-
(3)
Let and . Let and . Then
Therefore, .
-
(4)
Let and . Let and . Then
Therefore, .
Therefore, is in fact a group. is noncommutative of order 50, and contains elements of order 2. Therefore, . ∎
Proposition 5.9.
There exists a subgroup such that
and is a congruence pair of .
5.4. The Quaternion Algebra Ramifies at 7
Set and . Observe that and . Set . Observe that . is a quaternion algebra over which is of class number 1 and ramifies only at 7. By Theorem 4.1, has a maximal order , where
Lemma 5.10.
Proof.
For , it follows from (3) that
Solving , we get solutions in which form a group under multiplication. The solutions to are . When we quotient by , we get the group . ∎
Proposition 5.11.
There exists a subgroup such that and is a congruence pair of .
6. Further Directions for Finding Congruence Pairs
Theorem 4.6 tells us that a LPS-Type graph is Ramanujan if we can find a congruence pair whose corresponding congruence subgroup contains the generating set of . Therefore, it is of some interest to know what the congruence pairs of a given class number 1 maximal order are.
Question 6.1.
What are all the possible congruence pairs for class number one quaternion algebras?
We take some steps in answering this question. In the cases and , we show that there is no odd prime for which there exists a congruence pair of the respective maximal order. For the case , we use Propostion 6.2 to bound the possible for congruence pairs of . For a full treatment of Proposition 6.2, see [3, Chapter 12] or [7, Corollary 2.3]. While we only show the case and , Proposition 6.2 can be used for and to bound .
Proposition 6.2.
For an odd prime, the maximal subgroups of are as follows:
-
(1)
dihedral groups of order for ,
-
(2)
dihedral groups of order ,
-
(3)
a group of order ,
-
(4)
,
-
(5)
when .
Proposition 6.3.
There is no congruence pair associated with for odd primes .
Proof.
We consider the following cases:
-
(1)
Let . Let and be as in Proposition 4.4, i.e.,
Then, , , and by Lemma 3.7, . Therefore, . Suppose that we can find that is a complement of in . We have that has order 6. Thus, , so has an element of order 4. We have that has order 4. Therefore, and . We have that
One can check that for all , has order 4. Therefore, for and . This is a contradiction.
-
(2)
Let . One can check that every subgroup isomorphic to of does not have a complementary subgroup.
-
(3)
Let . Using Proposition 6.2, we see that for any prime , there is no index 6 subgroup of .
∎
Proposition 6.4.
There is no congruence pair associated with for odd primes .
Proof.
Case 1 (): Let and be as in Proposition 3.7, i.e.,
Then , , and by Proposition 3.7, . Therefore, . Suppose that we can find that is the complement of in . Then . Therefore, does not have any element of order . Therefore, but . We have that
and we quotient by scalers, so . Therefore,
One can check that has order 8, which is a contradiction. Therefore, it is impossible to find that satisfies our desired conditions.
Case 3 (): Observe that , so embeds into . By Proposition 3.7, . Note that maps to to a cyclic group of order 2 in . Suppose that we can find that is the complement of in . Let . Then, and . However, this implies that has index as a subgroup of which implies that is normal in . This is a contradiction because is simple for odd primes . ∎
Question 6.5.
Let and be two Ramanujan graphs constructed from a Quaternion algebra. Suppose that and have the same degree and same number of vertices. Are and isomorphic? In particular, let be sets with elements of norm which satisfy the conditions of Theorem 4.6. Then does there exist an isomorphism
Question 6.6.
In Table 8.2 of [8], Kirschmer and Voight classify all definite class number one Eichler orders, which gives all the class number one maximal orders of quaternion algebras over a number field. For which of these orders can one find a congruence pair?
Acknowledgements
We would like to thank Professor Shai Evra and the Einstein Institute of Mathematics REU for their support during our research project. Professor Evra provided invaluable guidance and feedback, and the REU program’s funding and resources were essential to our success. We are grateful for the experience and knowledge gained from this opportunity.
References
- [1] Patrick Chiu “Cubic Ramanujan graphs” In Combinatorica 12, 1992, pp. 275–285
- [2] Giuliana Davidoff, Peter Sarnak and Alain Valette “Elementary Number Theory, Group Theory and Ramanujan Graphs”, London Mathematical Society Student Texts Cambridge: Cambridge University Press, 2003
- [3] Leonard Eugene Dickson “Linear Groups, with an Exposition of the Galois Field Theory”, 1958
- [4] Martin Eichler “The Basis Problem for Modular Forms and the Traces of the Hecke Operators” In Proc. of the Conf. on Modular Functions of One Variable V Berlin, Heidelberg: Springer Berlin Heidelberg, 1973, pp. 75–152
- [5] Tomoyoshi Ibukiyama “On maximal orders of division quaternion algebras over the rational number field with certain optimal embeddings” In Nagoya Math. J. 88, 1982, pp. 181–195
- [6] Hyungrok Jo and Yoshinori Yamasaki “LPS-type Ramanujan graphs” In 2018 International Symposium on Information Theory and Its Applications (ISITA) IEEE, 2018, pp. 399–403
- [7] Oliver H. King “The subgroup structure of finite classical groups in terms of geometric configurations” In Surveys in Combinatorics 2005 327 Cambridge: Cambridge University Press, 2005, pp. 29–56
- [8] Markus Kirschmer and John Voight “Algorithmic Enumeration of Ideal Classes for Quaternion Orders” In SIAM Journal on Computing 39.5, 2010, pp. 1714–1747
- [9] Alexander Lubotzky “Discrete Groups, Expanding Graphs and Invariant Measures” Birkhäuser Basel, 1994
- [10] Alexander Lubotzky, Ralph Phillips and Peter Sarnak “Ramanujan graphs” In Combinatorica 8, 1988, pp. 261–277
- [11] Andrei Rapinchuk “On strong approximation for algebraic groups” In MSRI Publications 61, 2012, pp. 211–252
- [12] Jean-Pierre Serre “Trees” Springer Berlin Heidelberg, 1980
- [13] John Voight “Quaternion Algebras” 288, Graduate Texts in Mathematics Springer, 2021