Riemann surfaces are one dimension complex manifold. Yet, apart from the elementary examples, like and their quotients by some groups, it is not easy to construct directly some compact Riemann surfaces(of course, according to the Uniformization theorem, all compact Riemann surfaces arise in as quotients of these three Riemann surfaces). Here we get inspirations from the theory of manifolds. In fact, we know that some important examples of manifolds arise as particular subsets of the Euclidean spaces. In particular, we can construct some manifolds from the loci of some polynomials. This is the way we are going to use in the following.

For a simple of dimension, we consider a polynomial of two variables non constant, . We write it as where is not the zero polynomial. We set , the zero set of . For the present, we pretend that is a Riemann surface(we can see that, it is not a Riemann surface because of some points). Then we should try to find these ‘bad’ points. One way is to find a holomorphic map from to some Riemann surface that we know, and use this map to find which points are not ‘good’.

Consider the projection . Note that, for those such that , we have that has solutions for the variable . So, if we note , so is a ramified covering of degree . so, in this way is a Riemann surface.

If is a non-zero constant, then , we can say something more. In fact, we can compactify to , and add also one point to to make it compact. So, in this way, we get a compact Riemann surface. In this case, we can even calculate the genus of using Riemann-Hurwitz formula.

Here we consider a simple example. Suppose that where are distincts points and . Then, the ramified points of are of ramification degree (the point difficult is the infinity). So, according to the Riemann-Hurwitz formula, we have that

Thus we get that

.

This formula shows that, for any genus , there is a polynomial such that the Riemann surface defined by this polynomial(with compactification) is of genus .

This method is, in some sense, more explicit than the quotient method.

### Like this:

Like Loading...

*Related*