The Riemann-Hurwitz Formula
The Riemann-Hurwitz Formula
The Riemann-Hurwitz Formula
JUSTIN LANIER
Abstract. In this paper, we discuss the Riemann-Hurwitz formula, first as a theorem
about topological surfaces, and then as a theorem about Riemann surfaces. We then prove
the result as a theorem about algebraic curves over an arbitrary field as a consequence of
the Riemann-Roch theorem. To conclude we discuss extensions of the Riemann-Hurwitz
formula to the case of graphs. We give illustrative examples throughout.
1. Covering Maps
We begin in a topological setting. You have probably wrapped a rubber band around
your finger before. By doing so, you took a circle and then doubled or tripled it up. If you
looked at any little section of your looping, it would look like you might have used two or
three little rubber bands all stacked up, rather than a single long rubber band wrapped
multiple times. Depictions of these scenarios are given in Figure 1.
A multiple covering of a circle by a circle is one of the simplest examples of a covering
map, a map from one topological space to another that is a local homeomorphism and
where the inverse image of any point is a collection of points of cardinality n. This n is
called the degree of the map.
In this paper we will mostly be concerned with the case when the spaces involved are
orientable surfaces, that is, orientable manifolds locally homeomorphic to R2 . Such surfaces
are uniquely determined by their genus, which can be thought of as the number of holes
JUSTIN LANIER
JUSTIN LANIER
10
X
1,
since there are ten ramification points, all with ramification index 2.
JUSTIN LANIER
for then we could take degrees. That is, we could then plug in our 2gY 2 and 2gX 2
terms, and since the degree of (eP 1)[P ] is just (eP 1), this yields the theorem.
To obtain this inequality, then, consider any P in X. Let s be a local coordinate at P ,
JUSTIN LANIER
to the coefficient of [P ] in both D(f tn ) and D(). Finally, we have equality if and
only if is tamely ramified, for otherwise a term in the summation may be zeroed out, as
noted above.
5. Riemann-Hurwitz for graphs
A prevalent trend in certain areas of mathematics is taking more classical results about
surfaces and translating them over to the realm of graphs. For instance, much progress has
been made in analyzing the group of outer automorphisms of free groups by considering
mapping class groups of graphs, in analogy with mapping class groups of surfaces. Another
example is how the study of the moduli space of tropical curvesthat is, metric graphs
arose in analogy with with the moduli space of curvesthat is, surfaces. In much the same
spirit, there have been translations in recent years of the Riemann-Hurwitz formula to the
case of graph coverings. We present here one such effort as pursued by Mednykh [5].
First, we define the genus of a graph X to be the rank of H1 (X; Z) or, informally, the
number of independent loops in X. (Note that this diverges from the definition of genus
for surfaces; the number of independent loops in a surface is twice its genus.) Now, since
surfaces are manifolds, they are topologically homogeneousno point can be topologically
distinguished from any other. Graphs do not enjoy this propertya point along an edge
is different from a point at a vertex. As such we must modify the definition of ramification
somewhat for graphs, as we may get ramification along a graph edge.
Mednykh restricts to the case where the covering map is induced by a graph automorphism and so an element of a finite group G. Mednykh lays out several possibilities as to
the allowed fixed sets of these automorphisms. We may have that G acts freely on the edges
and without edge inversionsso that no edge xy is taken to edge yx. This case, treated
by Baker-Norine [1] and Corry [2], yields the following analogue to the Riemann-Hurwitz
formula,
g 1 = |G|(g 0 1) +
(|Gx | 1),
xV (X)
|Gx |
where
denotes the size of the stabilizer of the vertex x of the graph X. Note that the
formula matches up exactly with the formula for surfaces, once we take into account the
change in definition of genus.
We will now look at an example of a graph, a graph automorphism that acts freely
on edges, and how it satisfies this Riemann-Hurwitz formula. We take the graph X of
genus 4 depicted in Figure 7 and its quotient X/G by the cyclic group G = Z/4Z. The
quotient graph has genus 1. When we consider the five vertices of X, the hub vertex is fixed
by all four graph automorphisms, while the spoke vertices are fixed only by the identity
automorphism. Hence we have
4 1 = 3 = 4(1 1) + (4 1).
In his paper, Mednykh address the more general case where automorphisms are allowed
to fix edges and invert edges. Mednykh points out that the main difficulty is defining the
X
vV (X)
(|Gv | 1)
(|Ge | 1) +
eE(X)
|Ge |
eE inv (X)
where |Gv | and |Ge | denote the size of the stabilizer of either a vertex or edge of the graph
X and E inv (X) denotes the set of edges that are inverted by the group action.
In Figure 8 we depict a graph and its quotient under an action of G = Z/2Z Z/2Z.
The first factor swaps the left path and the right path, and the second factor reflects the
graph along a horizontal line. Note that the central vertical edge is inverted under this
latter action and that this is the only edge that is inverted under G. We will now compute
the inputs to Mednykhs Riemann-Hurwitz formula in this example. The genus of X is 4
and the genus of X/G is 1. The cardinality of the group G is 4. Each of the four vertices
is fixed by exactly two elements of G, and so each contribute a 1 to the sum. The four side
edges are fixed only by the identity of G, while the two loop edges are fixed by two elements
of G. The central edge is fixed by two elements and is also inverted by two elements. Thus
we have that
4 1 = 3 = 4(0) + (1 + 1 + 1 + 1) (0 + 0 + 0 + 0 + 1 + 1 + 1) + 2.
10
JUSTIN LANIER
Figure 8. A graph X and its quotient X/G under a Z/2Z action. The
white dot indicates a semi-edge in the quotient.
The proof that Mednykh produces for Riemann-Hurwitz for graphs with inversions and
fixed edges allow is bootstrapped from the results of Baker-Norine and Corry. The idea
of the proof is to first subdivide the graph by adding a vertex, and then it is a matter of
careful bookkeeping.
6. Summing up
We have now seen the Riemann-Hurwitz formula appear in different guises across a
variety of different contexts: surface topology, complex analysis, algebraic geometry, and
graph theory. The formula does not so much link these different areas of math as it stands
as a signpost for how these fields overlap and share common themes, tools, and insights.
References
[1] Matthew Baker and Serguei Norine. Harmonic morphisms and hyperelliptic graphs.
Int. Math. Res. Not. IMRN, (15):29142955, 2009.
[2] Scott Corry. Genus bounds for harmonic group actions on finite graphs. Int. Math.
Res. Not. IMRN, (19):45154533, 2011.
[3] Benson Farb and Dan Margalit. A Primer on Mapping Class Groups. Princeton University Press, 2011.
[4] Allen Hatcher. Algebraic topology. Cambridge University Press, Cambridge, 2002.
[5] A. D. Mednykh. On the Riemann-Hurwitz formula for graph coverings, 2015.
[6] Brian Osserman. The Riemann-Roch and Riemann-Hurwitz theorems. Available at
https://www.math.ucdavis.edu/ osserman/classes/248A-F13/riemann.pdf, 2013.
[7] Rebecca R. Winarski. Symmetry, isotopy, and irregular covers. Geom. Dedicata,
177:213227, 2015.