Kida’s formula for graphs with ramifications
Abstract.
Recently Iwasawa theory for graphs is developing. A significant achievement includes an analogue of Iwasawa class number formula, which describes the asymptotic growth of the numbers of spanning trees for -coverings of graphs. Moreover, an analogue of Kida’s formula concerning the behavior of the - and -invariants is obtained for unramified coverings. In this paper, we establish Kida’s formula for possibly ramified coverings.
Key words and phrases:
graphs, Jacobian groups, Iwasawa theory, Kida’s formula2020 Mathematics Subject Classification:
05C25 (Primary), 11R231. Introduction
1.1. Classical Iwasawa theory
We begin with a brief review of classical Iwasawa theory. Let be a prime number. In classical Iwasawa theory, we mainly deal with a -extension of number fields, that is,
where is a -extension. The so-called Iwasawa class number formula due to Iwasawa [3, Theorem 11] (see also Washington [13, Theorem 13.13]) claims
for some integers , , and , which are called the Iwasawa invariants. Here, denotes the class group of and denotes the -adic valuation that is normalized by .
Kida [7] obtained a formula that describes the behavior of the Iwasawa invariants when varies. To be concrete, let be a finite -group and be another -extension such that is a -extension for any . Then conceptually the formula claims that is equivalent to , in which case can be described by using together with the ramification information in . (To be precise, the original Kida’s formula only concerns the minus components for the cyclotomic -extensions of CM-fields.)
1.2. Iwasawa theory for graphs
The main object in this paper is graphs, which we assume to be finite and connected in this introduction. For a graph , let be the number of spanning trees of . By Kirchhoff’s theorem, the number is equal to the order of the Jacobian group of (see §2.1). Note that is also known as the Picard group of degree zero, the sandpile group, and the critical group. This interpretation enables us to study by an algebraic investigation of .
Let be an unramified (or unbranched) -covering of graphs, that is, we are given a family of graphs
where is an unramified -covering. This is called the -th layer of . Then an analogue of the Iwasawa class number formula, due to Gonet [2, Theorem 1.1] or McGown–Valliéres [8, Theorem 6.1] (see also the author’s article [5, §8.1]), claims
for some integers , , and .
To discuss Kida’s formula, let be a finite -group. Let be another unramified -covering such that the -th layer is an unramified -covering of for any . Then the analogue of Kida’s formula, due to Ray–Valliéres [10, Theorem 4.1] (see also [5, §8.2]), says that is equivalent to , in which case we have
with . Compared to the original formula of Kida, the ramification terms disappear naturally because is assumed to be unramified.
1.3. Main theorem
As we have emphasized, Iwasawa theory for graphs has been developed mainly for unramified coverings so far. In a latest paper of Gambheera–Valliéres [1], they initiated an Iwasawa theoretic study of ramified (or branched) coverings of graphs (see §2.2). As a fundamental result, for a possibly ramified -covering , they proved that the aforementioned analogue of the Iwasawa class number formula is still valid literally (see Theorem 4.1).
In this paper, we establish Kida’s formula for graphs with ramifications. As above, let be a finite -group and we consider -coverings and such that is a -covering for any . Let us stress that we allow the ramifications both in and in . The main theorem is the following:
Theorem 1.1.
We have if and only if we have and holds:
any vertex of is either ramified in or unramified in .
If these equivalent conditions hold, then we have
Here, denotes the set of vertices of , denotes the ramification index of in , and denotes the number of vertices of lying over .
Remark 1.2.
Theorem 1.1 is formulated symbolically, and to be precise it is better to rephrase it by using only finite graphs and instead of and . The degree is understood to be (which equals the degree for any ). Let be a vertex of .
-
•
Using the ramification indices , we say is ramified in if for some .
-
•
Using the ramification indices , which are decreasing with respect to , we define as its limit. We say is unramified in if .
-
•
Using the numbers of vertices of lying above , which are increasing with respect to , we define as its limit.
In general, can be infinite. However, in this case, is unramified in , so condition implies that and we set
This is why the formula makes sense.
Remark 1.3.
(1) If is unramified, then condition holds, no matter how is ramified. Therefore, we have the equivalence between for and for , in which case
holds. This formula is of the same form as the previous one for the unramified case.
(2) In the original Kida’s formula concerning class groups, the terms corresponding to are automatically finite since we deal with cyclotomic -extensions of number fields, in which all finite primes are finitely split. Contrary to this, Iwasawa [4, Theorem 1] constructed -extensions of number fields with by using the anti-cyclotomic -extensions of imaginary quadratic fields, in which finite primes often splits completely. Moreover, Iwasawa [4, Theorem 2] also showed that is retained as long as a condition like holds. These observations imply that condition is natural.
1.4. Organization of this paper
2. Preliminaries
In §2.1, we fix our convention concerning graphs and then define the Jacobian groups. In §2.2, we define Galois coverings of graphs with ramifications. In §§2.3–2.4, we show that Galois coverings arise as the derived graphs of voltage graphs.
2.1. Graphs and Jacobian groups
We first introduce the notions of graphs and the Jacobian groups. See [1, §§2.1–2.2] or the author’s article [5, §2] for the details. We use Serre’s formalism of graphs [11, Chapter I, §2.1].
Definition 2.1.
A finite graph consists of a finite set of vertices, a finite set of edges, an involution on without fixed points, denoted by , and two maps satisfying and .
Each is regarded as an edge that connects to , and is the opposite of . For each , we write for the set of such that . Note that we allow multi-edges and loops, so our graphs may be called multigraphs. We will usually study connected graphs, which means that any two vertices can be connected by a path of edges.
Definition 2.2.
Let be a finite connected graph. We define the divisor group of as the free -module on the set , i.e.,
We define a -homomorphism , called the Laplacian operator, by
We define the Picard group of as the cokernel of .
Let be the degree map, i.e., is the -homomorphism that sends any to . We clearly have , so factors through . Then we define the Jacobian group as the kernel of the induced map .
It is known that is a finite abelian group. Indeed, by Kirchhoff’s theorem, the order of is equal to the number of spanning trees of . It also follows that the kernel of is a free -module of rank one with a basis . Therefore, we have two fundamental exact sequences
(2.1) |
where sends to , and
(2.2) |
2.2. Galois coverings of graphs
We introduce the notion of (possibly ramified) Galois coverings, basically following [1, §3.1]. We begin with the definition of morphisms of graphs. Let and be finite graphs.
Definition 2.3 ([1, Definition 2.1]).
A morphism of graphs consists of maps and such that
for any .
Definition 2.4 ([1, Definition 3.1] or Sunada [12, page 69]).
A (ramified) covering is a morphism of graphs that satisfies the following condition:
For each vertex , there is a positive integer such that the map
is -to-one.
We often write for this covering, making implicit.
A vertex is said to be lying above if . The number is referred to as the ramification index of . Naturally we say is unramified if , and a vertex of is unramified if all vertices of lying above are unramified. An unramified covering is by definition a covering such that any vertices are unramified.
Now we go on to the definition of Galois coverings. The general definition does not explicitly written in [1]; instead, they only deal with derived graphs associated to voltage graphs (see §2.3). In this paper, we introduce a reasonable definition of Galois coverings. We will see that actually all of them can be constructed as derived graphs (Proposition 2.11).
Definition 2.5.
Let be a finite group. A -covering (or a Galois covering with Galois group ) is a morphism equipped with an action of on satisfying the following:
-
•
The action of on respects , so the fibers and are -stable for each and .
-
•
For each , the action of on is transitive.
-
•
For each , the action of on is transitive and free.
In other words, the action of on is free and induces an isomorphism between the quotient graph , defined in an obvious way, and .
It is easy to see that a -covering is actually a covering (cf. [1, Proposition 3.3(1)]). The ramification index coincides with the order of the stabilizer subgroup of . This depends only on the vertex since the action of on is transitive. We then define the ramification index of as by using any lying above .
Finally, let us introduce the notion of infinite Galois coverings.
Definition 2.6.
Let be a profinite group. A -covering of a finite graph is an inverse system of graphs, indexed by the open normal subgroups of (the order is defined by if ), equipped with an action of that induces a -covering structure on for any .
For instance, for , the open subgroups are precisely , so a -covering of consists of a system of graphs
such that is a -covering.
2.3. Voltage graphs and derived graphs
To deal with (finite or infinite) Galois coverings, it is convenient to use voltage graphs and derived graphs. See [5, §5] for the unramified cases, and [1, §4] for the ramified cases.
Firstly, we introduce the voltage graphs.
Definition 2.7.
A voltage graph consists of a finite graph , a group , and a map satisfying
for any . To handle the ramifications, we consider an extra structure , which is a family of subgroups. By abuse of notation, we also call a voltage graph.
Definition 2.8.
Let be a voltage graph. Let be a normal subgroup of . Then the induced voltage graph is defined as follows: Letting be the natural projection, we define and with .
Now we introduce the derived graphs.
Definition 2.9.
Let be a voltage graph with finite. We construct a finite graph (the map is implicit), called the derived graph, as follows. The set of vertices and edges are defined by
For an edge , we set
The group acts on the graph from the left in the natural way. We also have a natural morphism by projections to the second components. It is quite easy to see that this morphism is indeed a -covering. More generally, given a normal subgroup of , setting as in Definition 2.8, we have an -covering .
2.4. Galois coverings from voltage graphs
Now let us show that any Galois covering arises from a voltage graph. We begin with the finite case.
Proposition 2.11.
Let be a -covering with finite. Then there is a voltage graph structure such that as -coverings of .
Proof.
We construct a voltage graph in the following way. The construction depends on two choices:
-
•
For each , choose a vertex such that .
-
•
For each , choose an edge such that and .
Then we define and as follows:
-
•
Let be the unique element such that .
-
•
Let be the stabilizer of .
Note that exists uniquely because both and are in the fiber of with respect to and the action of on such a fiber is free and transitive. Then we have by
We construct a morphism by
The well-definedness of follows from the definition of . It is straightforward to see that is indeed a morphism:
and
Moreover, by the definition of the -coverings, both and are bijective, so is an isomorphism. ∎
Proposition 2.12.
Let be a profinite group and be a -covering of . Then there is a voltage graph structure such that is isomorphic to as -coverings of .
Proof.
As in the proof of Proposition 2.11, we firstly make two choices:
-
•
For each vertex of and , choose a vertex of that goes to . Moreover, we impose the compatibility with respect to , that is, goes to whenever .
-
•
For each edge of , choose an edge of that goes to and satisfies . Moreover, we impose the compatibility with respect to , that is, goes to whenever .
Then, for each , we define and as in the proof of Proposition 2.11 applied to . It is straightforward to see that and are compatible with respect to , so we may define and as the limits. By the proof of Proposition 2.11, for any , we have as -coverings. Therefore, as -coverings. ∎
3. Functorialities of Picard groups
The behavior of the Picard groups with respect to coverings plays important roles in the proof of Theorem 1.1. We first consider general coverings in §3.1. Then we will consider finite and infinite Galois coverings in §3.2 and §3.3, respectively.
3.1. Coverings
Let be a covering (Definition 2.4) between finite connected graphs. We define the degree of the covering as the number
which is independent of (see [1, §3.1]; here we need the connectedness of ). Note that, for any edge , we have
that is, the fiber of an arbitrary edge of consists of edges of .
Proposition 3.1.
The exact sequences (2.1) for and satisfy a commutative diagram
(3.1) |
where the rightmost vertical map between the Picard groups is induced by .
Proof.
This proposition follows from direct computations. The commutativity of the left one follows from
The commutativity of the middle square is [1, Proposition 3.4]. Indeed, for each , setting , we see
and
Since is -to-one, these coincide. ∎
3.2. Finite Galois coverings
Let be a voltage graph with finite.
Set , which we regard as a left -module. Then we may identify
(3.2) |
as -modules. Here, the first isomorphism is given by and the second by simply omitting to ease the notation. Then, associated to the endomorphism on , we introduce an endomorphism on (or ). In other words, is defined by a commutative diagram
Remark 3.2.
It is straightforward to see that may be explicitly defined by
Here, denotes the norm element of . However, this explicit formula will not be used.
Proposition 3.3.
Let be a voltage graph with finite. Suppose that is connected (so is also connected).
-
(1)
We have an exact sequence
-
(2)
Let be a normal subgroup of . We introduce a voltage graph as in Definition 2.8. Then we have a commutative diagram
(3.3) Here, the map is the natural projection, and the map sends to .
Proof.
(1) This is simply a reformulation of (2.1).
This description of in this proposition will be crucial in what follows.
3.3. Infinite Galois coverings
As in [5, §5.2], we shall define the Picard group of an infinite Galois covering by using the projective limit. Let be a compact flat -algebra; in the applications we will set . This will be used to make the projective limit functor exact.
Definition 3.4.
Let be a voltage graph with profinite. Suppose that are connected for all . By Proposition 3.3(2), the Picard groups form a projective system. We define
This is a module over the Iwasawa algebra .
For any profinite group , we define an ideal of by
where runs over the open normal subgroups of . For instance, if , we have if and only if the order of is divisible by .
Proposition 3.5.
Let be a voltage graph with profinite. Suppose that are connected for all .
-
(1)
We have an exact sequence
(3.4) where is introduced in the proof below.
-
(2)
Let be a closed normal subgroup of . Let be as in Definition 2.8. Then we have a commutative diagram
(3.5) Here, all the vertical arrows are the natural ones: The left two ones are induced by the inclusions and .
Proof.
By Proposition 3.3(2), for open normal subgroups of with , we have
(3.6) |
Here, on the -component sends to
By taking the tensor product with over and then taking the projective limit with respect to , we obtain claim (1). For claim (2), we only have to take the limit of the above diagram (after ) with the restriction . ∎
4. Kida’s formula
In §4.1, we review the Iwasawa class number formula in our settings. Then in §4.2, we prove our main theorem (Theorem 1.1).
4.1. Iwasawa class number formula
From now on, we fix a prime number and work over .
Let be a profinite group that is isomorphic to . For a finitely generated torsion -module , we have the , -invariants , , which are non-negative integers. They are usually defined by using the structure theorem for -modules (see Neukirch–Schmidt–Wingberg [9, Definition (5.3.9)]). Instead of the usual definition, we only recall the following properties:
-
•
We have if and only if is finitely generated over .
-
•
We have .
Now the Iwasawa class number formula is the following:
Theorem 4.1 (Gambheera–Valliéres [1, Theorem A]).
Let be a -covering of finite connected graphs and be its -th layer. Then we have
with
and some integer .
4.2. Kida’s formula
A key to prove the main theorem is the following algebraic proposition.
Proposition 4.2 ([5, Proposition 8.5]).
Let be a profinite group that is isomorphic to , and a finite -group. Let be a finitely generated torsion -module. We write for the -coinvariant of .
-
(1)
We have if and only if .
-
(2)
Suppose that we have , where denotes the projective dimension. If the equivalent conditions in (1) hold, then we have .
Proof.
Because of its importance, we include a rough sketch of the proof. Claim (1) follows from Nakayama’s lemma over the local ring . Under the assumptions in claim (2), the -module is indeed free of finite rank. Then the equality is clear. ∎
The author [6] extended this proposition to perfect complexes. The result is so useful that we can deduce analogues of Kida’s formula in various arithmetic situations. However, we do not need such an extension in this paper.
We are in a position to prove Theorem 1.1. By Proposition 2.12, the situation in Theorem 1.1 can be realized by a voltage graph. To be precise, let be a profinite group of the form
with isomorphic to and a finite -group. Let be a voltage graph with . Let us assume that is connected for any open normal subgroup of . We also obtain (write ) by using Definition 2.8 applied to the closed subgroup of . We set
Now Theorem 1.1 can be rephrased as follows:
Theorem 4.3.
We have if and only if we have and holds:
for any , the group is either infinite or trivial.
If these equivalent conditions hold, then we have
As in Remark 1.2, if is infinity, condition implies is trivial, so we set in this formula.
Proof.
Set . Note that
where the first equivalence holds since is -torsion-free. The motivation for this definition is that we have if (and only if) . Then Proposition 3.5(2) yields a commutative diagram
(4.1) |
Here, on the -component sends to . By taking the -coinvariant of the upper sequence, we obtain
(4.2) |
Here, is the injective homomorphism that is the multiplication by on the -component. This also explains why the induced homomorphism is injective. By the snake lemma, we obtain an exact sequence
Note that if and only if . Thus, we have if and only if and for any . Thanks to Proposition 4.2(1), this shows the first claim on the equivalence concerning .
In what follows, we assume the equivalent conditions. Then the in (4.2) is the identity map, so we have . However, Proposition 4.2(2) is not applicable to . This is because the condition does not hold in general. To remedy this, we use a slightly modified version of the Picard groups that satisfies .
We define
as the composition of with the projection to the -components. Define as the cokernel of this . Clearly we have an exact sequence
Therefore, we have
and . We also define in the same way: We introduce that is the projection of to the -components and then define as its cokernel. Then the same reasoning shows
Since is torsion, the homomorphism is injective (cf. [5, Lemma A.3]), so we have
By the same reasoning as the original Picard groups, since the homomorphism is the identity, we have
Now we are able to apply Proposition 4.2(2) to . As a result, we obtain
By combining these formulas, we obtain
An elementary observation shows
This completes the proof of Theorem 4.3. ∎
5. Examples
Let be a positive integer. Let be the cycle graph with vertices: The vertices are
and the edges are
such that and for ( is understood to be ).
Let and a cyclic group of order . Let
be a voltage assignment such that the components of are generators of and , and are all the unit element.
We consider three choices of :
-
(a)
for any .
-
(b)
for any .
-
(c)
for any .
Note that condition holds for (b) and (c) but does not hold for (a). In each case, we set
As will be clear, are indeed connected.
To compute the Iwasawa , -invariants, it is convenient to prepare a lemma. For positive integers and , we define a graph as follows. We set , which is the cycle graph with vertices. Then we set to be the “totally ramified” covering of of degree . More precisely, has vertices, say , and unoriented edges, and for each , exactly edges connects and .
Lemma 5.1.
We have .
Proof.
This is easily proved by counting the number of spanning trees. ∎
Case (a) | Case (b) | Case (c) | |
---|---|---|---|
Using this lemma, we can directly compute the Iwasawa , -invariants of and of for cases (a), (b), and (c). The results are summarized in Table LABEL:table:1 . For example, in case (a), we have , so by Lemma 5.1. This implies , for . The other entries are filled in a similar way (note that for (b) is the same as that for (c)).
Let us discuss the validity of Theorem 1.1. In case (a), is not retained because condition () does not hold, as the theorem predicts. In case (b), we have
as predicted. In case (c), we have
as predicted.
Acknowledgments
I am grateful to Daniel Vallières and Rusiru Gambheera for giving helpful comments on an earlier version of this paper. This work is supported by JSPS KAKENHI Grant Number 22K13898.
References
- [1] R. Gambheera and D. Vallières. Iwasawa theory for branched -towers of finite graphs. preprint, arXiv:2404.05131, 2024.
- [2] S. R. Gonet. Iwasawa Theory of Jacobians of Graphs. Algebr. Comb., 5(5):827–848, 2022.
- [3] K. Iwasawa. On -extensions of algebraic number fields. Bull. Amer. Math. Soc., 65:183–226, 1959.
- [4] K. Iwasawa. On the -invariants of -extensions. In Number theory, algebraic geometry and commutative algebra, in honor of Yasuo Akizuki, pages 1–11. Kinokuniya Book Store, Tokyo, 1973.
- [5] T. Kataoka. Fitting ideals of Jacobian groups of graphs. Algebr. Comb., 7(3):597–625, 2024.
- [6] T. Kataoka. Kida’s formula via Selmer complexes. preprint, arXiv:2401.07036, 2024.
- [7] Y. Kida. -extensions of CM-fields and cyclotomic invariants. J. Number Theory, 12(4):519–528, 1980.
- [8] K. McGown and D. Vallières. On abelian -towers of multigraphs III. Ann. Math. Qué., 48(1):1–19, 2024.
- [9] J. Neukirch, A. Schmidt, and K. Wingberg. Cohomology of number fields, volume 323 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, second edition, 2008.
- [10] A. Ray and D. Vallières. An analogue of Kida’s formula in graph theory. preprint, arXiv:2209.04890, 2022.
- [11] J.-P. Serre. Trees. Springer-Verlag, Berlin-New York, 1980. Translated from the French by John Stillwell.
- [12] T. Sunada. Topological crystallography, volume 6 of Surveys and Tutorials in the Applied Mathematical Sciences. Springer, Tokyo, 2013. With a view towards discrete geometric analysis.
- [13] L. C. Washington. Introduction to cyclotomic fields, volume 83 of Graduate Texts in Mathematics. Springer-Verlag, New York, second edition, 1997.