For all integers *g* ≥ 6 we prove the existence of a metric graph *G* with
*G* has Clifford index 2 and there is no tropical modification *G*′ of *G* such that there exists a finite harmonic morphism of degree 2 from *G*′ to a metric graph of genus 1. Those examples show that not all dimension theorems on the space classifying special linear systems for curves have immediate translation to the theory of divisors on metric graphs.

Keywords:
Metric graphs;
Curves;
Lifting problems;
Special divisors;
Clifford index;
Dimension theorems

Let *K* be an algebraically closed field complete with respect to some non-trivial non-Archimedean valuation. Let *R* be the valuation ring of *K*, let *m*_{R} be its maximal ideal and *k* = *R*/*m*_{R} the residue field. Let *X* be a smooth complete curve of genus *g* defined over *K*. Associated to a semistable formal model 𝔛 over *R* of *X* there exists a so-called skeleton Γ = Γ_{𝔛} which is a finite metric subgraph of the Berkovich analytification *X*^{an} of *X* together with an augmentation function *a*: Γ → ℤ^{+} such that *a*(*v*) = 0 except for at most finitely many points (see e.g. [1]). In the case all components of the special fiber
*X*is a lift of Γ.

There exists a theory of divisors and linear equivalence on Γ very similar to the theory on curves and, in case *X*is a lift of Γ, those theories on *X*and Γ are related by means of a specialisation map

For a divisor *E* on Γ one defines a rank rk(*E*) and for a divisor *D* on *X* the specialisation theorem says (see e.g. [2], since we restrict to the case of zero augmentation map this is in principle considered in [3])

In the hyperelliptic case many classical results on linear systems on curves also do hold for linear systems on metric graphs. As an example, if the graph Γ has a very special linear system
*d* – 2*r* = 0) is the same for graphs as for curves (see Section 2.2 for this terminology). This is not true for the theory of linear systems of Clifford index more than 0. As an example: the theory of linear systems of Clifford index 1 concerns the theory of linear systems
*d* – 2*r* = 1, *r* ≥ 1 and *d* ≤ *r* + *g* – 2. In the case of curves, H. Martens Theorem (see [6]) states that if *C* is a non-hyperelliptic curve and *C* has a linear system
*d* ≤ *g* – 1 then either *d* = 3 or *d* = 5. In [7] we obtain for all *r* ≥ 1 and *d* = 2*r* + 1 ≤ *g* – 1 the existence of a non-hyperelliptic graph Γ of genus *g* having a linear system

For a curve *X* the complete linear systems
*n* ≥ *r* are parametrized by a closed subscheme
*J*(*X*) and
*X*. In particular in the case *r* ≤ *g* – 1 then
*r* < *g* – 1 if and only if *X* is hyperelliptic (see [8]). In [9] it is shown that using the dimension of a similar subspace of the Jacobian *J*(Γ) of a metric graph Γ this statement is not true. Moreover in that paper the authors do introduce a much better invariant
*X* is a lift of Γ. At the moment is seems not known whether
*r* < *g* – 1 implies Γ is hyperelliptic.

Concerning the next case, in [11, Appendix] one finds Mumford’s classification of all curves *X* such that
*C* is a non-hyperelliptic curve such that
*r* ≥ 1 and *d* ≤ *g* – 1 then either *C* is a trigonal curve or *C* is a smooth plane curve of degree 5 or *C* is a bi-elliptic curve (meaning that there exists a double covering *π*: *C* → *E* with *E* an elliptic curve). In [11] the author assumes char(*k*) ≠ 2 although it is not so clear whether this is also necessary for the arguments in the appendix of that paper. In the appendix of this paper I give a very short proof that in the case *C* is neither hyperelliptic, not trigonal of genus *g* ≥ 10 and if *C* has two different linear systems
*C* is bi-elliptic not using any assumption on char(*k*). Many more generalisations are proved by different authors (see e.g. [12]). In this paper we show that the theory of curves satisfying
*g*> 10 we prove the existence of a metric graph *G*_{n} of genus *g* (*n* = *g* – 3) satisfying

Related to this result it should be mentioned that non-liftable linear systems on graphs are also known. We say that a linear system
*G* is liftable if there exists a lift *X* of *G* and a divisor *D* on *X* with dim(|*D*|) = *r* such that
*v* adjacent to at least 3 different bridges (a bridge of a graph *G* is an edge *e* such that *G* \ *e* is disconnected) is not liftable to a hyperelliptic curve because of the violation of some Hurwitz condition. In [14, Example 5.13] one finds an example due to Luo of a graph with a

In Section 2 we recall some generalities on graphs and the theory of divisors on graphs. For generalities on the specialisation map and the relation between the metric graphs and skeleta inside Berkovich curves we refer to the references. It is not needed to understand the arguments used in this paper, it is important for the motivation. In Section 3 we give the description of the graph denoted by *G*_{n} (*n* an integer at least equal to 2) and we prove it satisfies
*G*_{n} could be lifted to a curve satisfying
*G*_{n} there would exist a finite harmonic morphism (see Section 2.3)

A *topological graph* Γ is a compact topological space such that for each *P* ∈ Γ there exists *n*_{P} ∈ ℤ^{+} and
*U*_{p} of *P* in Γ is homeomorphic to {*z* = *re*^{2πik/nP}: 0 ≤ *r* ≤ ∊ and *k* is an integer satisfying 0 ≤ *k* ≤*n*_{P} – 1} ⊂ ℂ with *P* corresponding to 0. Such a topological graph Γ is called *finite* in the case there are only finitely many points *P* ∈ Γ satisfying *n*_{p} ≠ 2. We only consider finite topological graphs. We call *n*_{P} the *valence* of *P* on Γ. Those finitely many points *P* of Γ with *n*_{p} ≠ 2 are called the *essential vertices* of Γ. The *tangent space T*_{p}(Γ) of Γ at *P* is the set of *n*_{P} connected components of *U*_{P}\{*P*} for *U*_{P} as above. In this definition, using another such neighborhood
*U*_{P} \{*P*} and

A metric graph Γ is a finite topological graph Γ together with a finite subset *V*_{∞} (Γ) of the set of 1-valent points of Γ and a complete metric on Γ \ *V*_{∞}(Γ). A *vertex set V* of a metric graph Γ is a finite subset of Γ containing all essential vertices. The pair (Γ, *V*) is called a *metric graph with vertex set V*. The elements of *V* are called the vertices of (Γ, *V*). The connected components of Γ \ *V* are called the *edges* of (Γ, *V*). The elements of *ē* \ *e* are called the *end vertices* of *e*(*ē* is the closure of *e*). We always choose *V* such that each edge has two different end vertices. Using the metric on Γ \ *V*_{∞}(Γ) each edge *e* of Γ has a length
*l*(*e*) = ∞ if and only if some end vertex of *e* belongs to *V*_{∞}(Γ). We write *E*(Γ, *V*) to denote the set of edges of (Γ, *V*). The *genus* of (Γ, *V*) is defined by |*E*(Γ)| – |*V*(Γ)| + 1 and it is independent of the choice of *V*. Therefore it is denoted by *g*(Γ) and called the genus of Γ.

A *subgraph* of a metric graph (Γ, *V*) with vertex set is a closed subset Γ′ ⊂ Γ such that (Γ′, Γ′ ∩ *V*) is a metric graph with vertex set. In the case Γ′ is homeomorphic to the unit circle *S*^{1} in ℂ then it is called a *loop* in (Γ, *V*). A metric graph Γ is called a *tree* if, *g*(Γ) = 0.

We refer to Section 2 of [7] for the definitions of a divisor, an effective divisor, a rational function, linear equivalence of divisors, the canonical divisor and the rank of a divisor on a metric graph. The rank of a divisor *D* on a metric graph Γ is denoted by rk(*D*) and if it is necessary to add the graph then we write rk_{Γ}(*D*). For a divisor *D* on a graph Γ we write *D* ≥ 0 to indicate it is an effective divisor on Γ. A very important tool in the study of divisors on a metric graph Γ is the concept of a reduced divisor at some point *P* of Γ (see [7]*Section 2.1) and the burning algorithm to decide whether a given divisor on Γ is reduced at *P* (see [7, Section 2.2]).

For a divisor *D* on a metric graph Γ we write |*D*| to denote the set of effective divisors linearly equivalent to *D*. As in the case of curves we call it the *complete linear system* defined by *D*. The rank rk(*D*) replaces the concept of the dimension of a complete linear system on a curve. As in the case of curves we say the complete linear system |*D*| is a linear system
*D*) = *d* and rk(*D*) = *r*. From of the Riemann-Roch Theorem for divisors on graphs it follows as in the case of curves that divisors *D* on Γ such that rk(*D*) cannot be computed in a trivial way are exactly those divisors satisfying rk(*D*) > max{0, deg(*D*) – *g*(Γ) + 1}. Those divisors are called *very special*. The *Clifford index* of a very special divisor *D* on Γ is defined by *c*(*D*) = deg(*Z*) – 2rk(*D*). Clifford’s Theorem for metric graphs implies *c*(*D*) ≥ 0 for all very special divisors *D* on Γ. The Clifford index *c*(Γ) of Γ is the minimal value *c*(*D*) for a very special divisor *D*on Γ.

Motivated by the definition of the rank of a divisor on a metric graph one introduces the following replacement for the dimension of the space
*w* > 0 such that for each effective divisor *F* of degree *r* + *w* there exists an effective divisor *E* of degree *d* with rk(*E*) ≥ *r* such that *E* – *F* ≥ 0.

Let Γ and Γ′ be two metric graphs and let *ϕ*: Γ′ → Γ be a continuous map. In the case *V*(resp. *V*′) is a vertex set of Γ (resp. Γ′) then *ϕ* is called a *morphism* from (Γ′, *V*′) to (Γ, *V*) if *ϕ*(*V*′) ⊂ *V* and for each *e* ∈ *E*(Γ, *V*) the set *ϕ*^{−1} (ē) is a union of closures of edges of (Γ′, *V*′). Moreover if *e*′ ∈ *E*(Γ′, *V*′) with *e*′ ⊂ *ϕ*^{−1} (ē) then either *ϕ*(*e*′) is a vertex in *V*′ or the restriction *ϕ*_{e}′ : *e*′ → *e* is a dilation with some factor
*ϕ*(*e*′) is a vertex then we write *d*_{e}′ (*ϕ*) = 0. We call *d*_{e}′ (*ϕ*) the *degree* of *ϕ* along *e*′.

We say *ϕ* is a morphism of metric graphs if there exist vertex sets *V* (resp. *V*′) of Γ (resp. Γ′) such that *ϕ* is a morphism from (Γ′, *V*′) to (Γ, *V*). In that case, for *P* ∈ Γ′, *ν*′ ∈ *T*_{ρ}′(Γ′) and *e*′ an edge of (Γ′, *V*′) such that *v*′ is defined by some connected component of *e*′ \ {*P*′} we set *d*_{ν′} (*ϕ*) = *d*_{e}′(*ϕ*). Such morphism is called *finite* in the case *d*_{e}′ (*ϕ*) > 0 for all *e*′ ∈ *E*(Γ′, *V*′). There is a natural map *d*_{ϕ}(*P*′): *T*_{P}′(Γ′) \ {*ν*′: *d*_{ν}′ (*ϕ*) = 0} → *T*_{ϕ(P′)}(Γ) defined as follows. The connected component of *e*′ \ {*P*′} defining *υ*′ ∈ *T*_{p′}(Γ′) with *d*_{υ′}(*ϕ*) ≠ 0 is mapped to a connected component of *ϕ*(*e*′) \ {*ϕ*(*P*′)} and this defines *υ* ∈ *T*_{ϕ(P′)}(Γ), then *d _{ϕ}*(

The morphism *ϕ* : Γ′ → Γ of metric graphs is called *harmonic* at *P*′ ∈ Γ′ if for each *υ* ∈ *T*_{ϕ(P′)} (Γ) the number

An *elementary tropical modification* of a metric graph Γ is a metric graph Γ′ obtained by attaching an infinite closed edge to Γ at some point *P* ∈ Γ \ *V*_{∞}(Γ). A metric graph obtained from Γ as a composition of finitely many elementary tropical modifications is called a *tropical modification* of Γ. Two metric graphs Γ_{1} and Γ_{2} are called *tropically equivalent* if there is a common tropical modification Γ of Γ_{1} and Γ_{2}. This terminology can be found in e.g. [14] together with some examples.

In the proof of this section we are going to use some lemmas concerning linear systems on graphs.

Lemma 3.1

(Lemma 1 in [7]). *Let* Γ_{0}*be a metric graph and let* Γ *be a graph obtained from* Γ_{0}*by attaching loops at some different points of valence 2 on* Γ_{0}. *Let γ be such a loop attached to* Γ_{0}. *Let E and E*′ *be linearly equivalent divisors on* Γ_{0}*or on γ then E and E*′ *are linearly equivalent divisors on* Γ.

Lemma 3.2

(Lemma 2 in [7]). *Assume* Γ_{0}*and* Γ *are as in Lemma 3.1. Let E and E*′ *be effective divisors on* Γ_{0}*such that E and E*′ *are linearly equivalent as divisors on* Γ. *Then E and E*′ *are linearly equivalent as divisors on* Γ_{0}.

The proofs of Lemmas 3.1 and 3.2 do not depend on the particular graph Γ_{0} used in [7].

Lemma 3.3

(Corollary 1 in [7]). *Let* Γ_{0}*be a metric graph and let* Γ *be the graph obtained from* Γ_{0}*by attaching a loop γ at some point υ* ∈ Γ_{0}. *Let P be a point of γ* \ {*υ*} *and let D be an effective divisor on* Γ_{0}. *If* rk_{Γ}(*D* + *P*) ≥ *r then* rk_{Γ0}(*D*) ≥ *r*.

Lemma 3.4

(Main Theorem in [4]). *Let* Γ *be a metric graph of genus g* ≥ 4 *and let r be an integer satisfying* 2 ≤ *r* ≤ *g* − 2 *such that* Γ *has a linear system*
*then* Γ *has a linear system*

The metric graph *G*_{0} we start with has genus 2 and can be seen in figure 1.

Here *υ*_{1} and *υ*_{2} are two points of valence 3 (all other points have valence 2) and they are connected by three edges *e*_{0}, *e*_{1} and *e*_{2} of mutually different lengths. For 0 ≤ / ≤ 2 the point *m _{i}* is the midpoint of

Lemma 3.5.

*The graph G*_{0}*has a unique*
*given by* |*υ*_{1} + *υ*_{2}| = |2*m*_{0}| = |2*m*_{1}| = |*2*_{m}_{2}| *and in the case υ* ∈ *G*_{0}*such that* 2*υ* ∈ |*υ*_{1} + *υ*_{2}| *then* υ = *m _{i}*

*Proof.* Clearly 2*m _{i}* ∈ |

Finally for *υ* + *υ*′ ∈ |*υ*_{1} + *υ*_{2}| as before (including the possibility *υ* + *υ*′ = *υ*_{1} + *υ*_{2}), since *υ*′ is a u-reduced divisor one has
*υ* ∈ |*υ*_{1} + *υ*_{2}| implies *A* = *m _{i}* for some 0 ≤

As indicated in figure 1 we fix *q _{i}* ∈]

Lemma 3.6.

*There is no*
*on**G*_{0}*such that*
*and*

*Proof.* For *i* = 1,2 we take
*e _{i}* from

First assume *υ* ∈ (*e*_{0} ∪ *e*_{2}) \ {*υ*_{1}}. Then
*q*_{1}-reduced divisor. This implies
*υ* ∉ (*e*_{0} ∪ *e*_{2}) \ {*υ*_{1}} then certainly *υ* ∈ (*e*_{0} ∪ *e*_{1}) \ {*υ*_{2}} and using similar arguments we find

Now for an integer *n* ≥ 1 we make a graph *G _{n}* as follows. In case

Proposition 3.7.

*Let r be an integer with* 1 ≤ *r* ≥ *n*. *Then G _{n} has no*

*Proof.* First we show *G _{n}* has no linear system

From now on assume *n* ≥ 2. Fix some integer *r* satisfying 1 ≤ *r* ≥ *n* − 1 and assume *G _{n}* has a linear system

So we obtain
*G _{n}* such that

Finally, if *G _{n}* has an

Proposition 3.8.

*On G _{n} we have*

In order to prove this proposition we need the existence of many linear systems
*G _{n}*. Those can be obtained from divisors of degree 4 on Go using the following lemma.

Lemma 3.9.

*Let D be an effective divisor of degree 4 on G*_{0}. Then rk_{Gn}(*D*) ≥ 1.

*Proof*. Since *D* is an effective divisor of degree 4 on *G*_{0} from the Riemann-Roch Theorem it follows rk_{G}_{0}(*D*) = 2. This implies for each 0 ≤ *i* ≤ *n* there is an effective divisor *D*′ ≥ 2*q _{i}* linearly equivalent to

*Proof of**Proposition 3.8*. Fix *υ*_{1}, *υ*_{2} ∈ *G _{n}*. We need to prove that there exists a

In the case *υ*_{1}, *υ*_{2} ∈ *G*_{0} we can use any effective divisor *D* on *G*_{0} containing *υ*_{1} + *υ*_{2}. Then we have rk*G _{n}* (

We now consider the following lifting problem associated to *G _{n}*. Let

Assume the lifting problem has a solution. The curve *X* of that solution cannot be hyperelliptic since *G _{n}* is not hyperelliptic. This follows from the specialisation Theorem from [2] or [3] already mentioned in the introduction. From [11] one obtains the following classification in case char(

So assume there exists a morphism *π*: *X* → *E* with *g*(*E*) = 1 of degree 2. This induces a map *π ^{an}*:

Lemma 4.1.

*Let ϕ*: (Γ_{1}, *V*_{1}) → (Γ_{1}, *V*_{2}) *be a finite harmonic morphism between metric graphs with vertex sets. Let* (*T*′, *V*′) ⊂ (Γ_{1}, *V*_{1}) *be a subgraph such that T*′ *is a tree*,
*is connected and*
*consists of a unique point t* (*in particular t* ∈ *V*_{1}). *There is no subtree* (*T, V*) *of* (*T*′, *V*′) *different from a point such that ϕ*(*T*) *is contained in a loop* Γ ⊂ Γ_{2}.

*Proof*. Assume *T* is a subtree of *T*′ not being one point and assume *ϕ*(*T*) is contained in a loop Γ of Γ_{2}. Let *l*(*T*) (resp. *l*(Γ)) be the sum of the lengths of all the edges of *T* (resp. Γ). By definition one has *l*(*T*) ≤ deg(*ϕ*)*l*(Γ), in particular *l*(*T*) is finite. We are going to prove that we have to be able to enlarge *T* such that *l*(*T*) grows with a fixed lower bound. Repeating this a few times gives a contradiction to the upper bound deg(*ϕ*)*l*(*Γ*).

Let *q* ∈ *V* be a point of valence 1 on *T* such that *q* ≠ *t* and let *f* be the edge of *T* having *q* as a vertex point. This edge *f* defines *v* ∈ *T _{q}*(Γ

Theorem 4.2.

*There does not exist a tropical modification*
*of G _{n} such that there exists a graph* Γ

*Proof*. Assume
*G _{n}* and

Step 1: Assume *g*(*ϕ*(*G*_{0})) = 0. Then *ϕ*(*G*_{0}) looks as in Figure 3 with *ϕ*|_{ei}: *e _{i}* → [

Assume *g*(*ϕ*(*G*_{0})) = 0. Consider the loop *c*_{1} = *e*_{1} ∪ *e*_{0} (remember Figure 1). Since *ϕ*(*G*_{0}) has genus 0 it follows *ϕ*(*c*_{i}) is a subtree *T*_{1} of *ϕ*(*G*_{0}). Since *T*_{1} is the image of a loop and deg(*ϕ*) = 2, it follows that ♯((*ϕ*|_{c1})^{−1}(*q*′)) = 1 for some *q*′ ∈ *ϕ*(*c*_{1}) if and only if *q*′ is a point of valence 1 of *ϕ*(*c*_{1}). Since deg(*ϕ*) = 2 it follows *d _{q}*(

Assume *ϕ*(*v*_{1}) ≠ *ϕ*(*v*_{2}). Then *ϕ*(*e*_{2}) is a path from *ϕ*(*v*_{1}) to *ϕ*(*v*_{2}) outside of *ϕ*(*c*_{1}). This would imply *g*(*ϕ*(*G*_{0})) ≥ 1, contradicting *g*(*ϕ*(*G*_{0})) = 0, hence *ϕ*(*v*_{1}) = *ϕ*(*v*_{2}). This also implies that *ϕ*(*m*_{0}) and *ϕ*(*m*_{1}) are the two points of valence 1 on *ϕ*(*c*_{1}). Repeating the previous arguments for the loop *c*_{2} = *e*_{2} ∪ *e*_{0} one obtains the given description for *ϕ*|*G*_{0}: *G*_{0} → *ϕ*(*G*_{0}).

Step 2:*g*(*ϕ*(*G*_{0})) = 1.

In case *g*(*ϕ*(*G*_{0})) = 0 then we have the description for *ϕ*|_{G0}:*G*_{0} → *ϕ*(*G*_{0}) obtained in Step 1. We are going to prove that this description cannot hold. Since *g*(*ϕ*(*G*_{0})) ≤ 1, this implies *g*(*ϕ*(*G*_{0})) = 1.

Consider *ϕ*(*q*_{1}) ∈ *ϕ*(*e*_{1}) and
*e*_{1} with
*ϕ*(*γ*_{1}) is a tree. If *ϕ*(*γ*_{1}) would have valence 1 at *ϕ*(*q*_{1}) then from the arguments used in Step 1 it follows *d*_{q1}(*ϕ*) = 2. But from Step 1 we know *d*_{q1}(*ϕ)* = 1, therefore *ϕ*(*q*_{1}) cannot be a point of valence 1 on *ϕ*(*γ*_{1}). Hence there exists
*ϕ*^{−1}(*ϕ*(*q*_{1}))) ≥ 3, contradicting deg(*ϕ*) = 2. It follows *g*(*ϕ*(*γ*_{1})) = 1, hence *ϕ*(*γ*_{1}) contains a loop
*ϕ*^{−1}(*ϕ*(*q*_{1}))) ≥ 3, contradicting deg(*ϕ*) = 2. Therefore *ϕ*(*q*_{1}) ∈

Repeating the arguments using *q*_{2} and *γ*_{2} we obtain a loop
*g*(Γ) = 1 this is impossible. As a conclusion we obtain *g*(*ϕ*(*G*_{0})) = 1 finishing the proof of step 2.

In the case *ϕ*(*c*_{1}) would have genus 0 (*c*_{1} as in the proof of Step 1), then from the arguments used in Step 1 it follows that for *q* ∈ *e*_{2} \ {*v*_{1}, *v*_{2}} one has *ϕ*(*q*) ∉ *ϕ*(*c*_{1}). In the case *ϕ*(*v*_{1}) ≡ *ϕ*{*v*_{2}) it implies *ϕ*(*c*_{2}) has genus 1 (again *c*_{2} as in the proof of Step 1). In the case *ϕ*(*v*_{1}) = *ϕ*(*v*_{2}) and *g*(*ϕ*(*c*_{2})) = O too, it would imply *g*(*ϕ*(*G*_{0})) = 0

so this cannot occur. Therefore without loss of generality, we can assume *ϕ*(*c*_{1}) has genus 1 (but then *ϕ*(*c*_{2}) could have genus 0).

Step 3:*ϕ*|_{c1}: *c*_{1} → *ϕ*(*c*_{1}) is an isomorphism (meaning it is finite harmonic of degree 1)

Since *g*(*ϕ*(*c*_{1})) = 1 it follows there is a loop *e* in *ϕ*(*c*_{1}), finitely many points *r*_{1}, · · ·, *r _{t}* on

*T _{i}* ∩

*i* ≡ *j*

*ϕ*(*c*_{1}) = *e* ∪ *T*_{1} ∪ · · · ∪ *T _{t}*

(of course *t* = 0, hence *ϕ*(*c*_{1}) is a loop, is also possible; we are going to prove that *t* = 0).

In the case val_{ϕ(c1)} (*r _{i}*) > 3 for some 1 ≤

Because deg(*ϕ*) = 2 we cannot go back and forth on *e* moving along *c*_{1} and taking the image under *ϕ*. In principle it could be the case that there exist different points *q*′, *q*″ on *c*_{1} such that the image of the closure of both components of *c*_{1} \ {*q*′, *q*″} is equal to *e* with *ϕ*(*q*′) = *ϕ*(*q*″) and *d*_{q′}(*ϕ*) = *d*_{q″}(*ϕ*) = 2. This would correspond to something like shown in Figure 6. This figure has to be understood as follows. Moving along *c*_{1} from *q*′ to *q*″ in the direction indicated by 1 (left hand side of the figure) the image under *ϕ* is equal to *e* while moving in the direction indicated by 1 (right hand side of the figure). Moving on *c*_{1} from *q*″ to *q*′ in the direction indicated by 2 (left hand side of the figure) the image under *ϕ* is equal to *e* while moving in the direction indicated by 2 (right hand side of the figure).

In that case there should exist
*d _{ϕ}*(

It follows that in the case there exist *q*′ ≠ *q*″ on *c*_{1} such that *ϕ*(*q*′) = *ϕ*(*q*″) then *ϕ*|_{c1} : *c*_{1} → *e* is harmonic of degree 2 and *d _{q}* (

In the case for each edge *f* on
*f* ⊂ *c*_{1} one has *d _{f}*(

Step 4: Finishing the proof of the theorem.

It follows that *ϕ*(*υ*_{1}) and *ϕ*(*υ*_{2}) do split *e* into two parts *e*′ and *e*″ of lengths *l*(*e*_{1}) and *l*(*e*_{0}). Since *g*(Γ) = 1 it follows *ϕ*(*e*_{2}) contains *e*′ or *e*″, we assume it contains *e*′. In the case *ϕ*(*e*_{2}) would contain
*g*(Γ) = 1 it follows *ϕ*(*e*_{2}) contains one of the connected components of
*ϕ*) = 2. Indeed, for a point on that connected component the inverse image under *ϕ* contains one point of *c*_{1} and two different points of *e*_{2}.

So we obtain different points *r*_{1}, … , *r _{t}* on

Assume *r _{i}* =

As a corollary of the theorem we obtain the goal of this paper.

Corollary 4.3.

*For each genus g* ≥ 5 *there is metric graph G of genus g satisfying*
*that has no divisor of Clifford index at most 1 and is not tropically equivalent to a metric graph*
*such that there exists a finite harmonic morphism
*

We give a very easy proof of a statement implying Mumford’s Theorem in [11, Appendix] in the case of
*g* ≥ 10 not using any assumption on the characteristic. This case corresponds to the situation considered in the paper.

Proposition 4.4.

*Assume C is a smooth non-hyperelliptic, non-trigonal irreducible complete curve defined over an algebraically closed field k of any characteristic. In the case g*(*C*) ≥ 10 *and C has at least two different linear systems
*.

*Proof*. Let *g*_{1} and *g*_{2} be two linear systems
*C*. Since *C* has no
*g _{i}* defines a morphism

The Picard group of ℙ^{1} × ℙ^{1} is equal to ℤ × ℤ with (*a*, *b*) being represented by the divisor *a* (*P* × ℙ) + *b*(ℙ × *P*) (with *P* ∈ ℙ^{1}). Using (1,1) one gets an embedding of ℙ^{1} × ℙ^{1} as a smooth quadric *Q* in ℙ^{3}. By composition we have a morphism *ϕ*: *C* → *Q* ⊂ ℙ^{3} defined by a linear subsystem of degree 8 of |*g* + *g*_{2}|.

In the case the linear system does not have dimension 3 then *ϕ*(*C*) is contained in a hyperplane section of *Q*. In the case this hyperplane section is a union of two lines on *Q* then *ϕ*(*C*) is one of those lines implying some *ϕ _{i}* is constant, a contradiction. Otherwise this hyperplane section is a smooth conic

It follows that *ϕ* : *C* → *Q* ⊂ ℙ^{3} is non-degenerated (defined by some
*ϕ*(*C*) is not contained in a plane and therefore deg(*ϕ*(*C*)) ≥ 3. Also deg(*ϕ*(*C*)) divides 8, therefore deg(*ϕ*(*C*)) = 4 or deg(*ϕ*(*C*)) = 8. Then either *ϕ* : *C* → *ϕ*(*C*) has degree 2 or degree 1. In the case the degree is 1 then *C* is birationally equivalent to a curve on *Q* belonging to the linear system (4, 4). Because of the adjunction formula this implies *g*(*C*) ≤ 9, a contradiction to our assumptions. Therefore *ϕ* : *C* → *ϕ*(*C*) has degree 2 and *ϕ*(*C*) is an irreducible curve on *Q* belonging to the linear system (2,2). The adjuction formula implies *g*(*ϕ*(*C*)) ≤ 1. Since *C* is not hyperelliptic we obtain *ϕ*(*C*) is a smooth elliptic curve *E* on *Q* and we obtain a double covering *ϕ* : *C* → *E*. □

Reasearch partially supported by the FWO-grant 1.5.012.13N. The author likes to thank the referee for the suggestions to improve the paper.

[1] Baker, M., Payne, S., Rabinoff, J., Non-archimedean geometry, tropicalization and metrics on curves, submitted for publication Search in Google Scholar

[2] Amini, O., Baker, M., Linear series on metrized complexes of algebraic curves, math. Ann., 2015, 362, 55-106 Search in Google Scholar

[3] Baker, M., Specialization of linear systems from curves to graphs, Algebra Number Theory, 2008, 2, 613-653 Search in Google Scholar

[4] Coppens, M., Clifford’s Theorem for graphs, submitted for publication Search in Google Scholar

[5] Facchini, L, On tropical Clifford’s theorem, Ricerche Mat., 2010, 59, 343-349 Search in Google Scholar

[6] Martens, H.H., Varieties of special divisors on a curve II, J. reine angew. Math., 1968, 233, 89-100 Search in Google Scholar

[7] Coppens, M., Free divisors on metric graphs, Annali di Matematica, (in press), 10.1007/s10231-015-0525-8 Search in Google Scholar

[8] Martens, H.H., On the variety of special divisors on a curve, J. reine angew. Math., 1967, 227, 110-120 Search in Google Scholar

[9] Lim, CM., Payne, S., Potashnik, N., A note on Brill-Noether theory and rank-determining sets, Int. Math. Res. Notes, 2012, 5484-5504 Search in Google Scholar

[10] Len, Y, The Brill-Noether rank of a tropical curve, J. Algebr. Comb., 2014, 40, 841-860 Search in Google Scholar

[11] Mumford, D., Prym varieties I, Contributions to analysis, Academic Press, 1974, 325-350 Search in Google Scholar

[12] Keem, Ch., On the variety of special linear systems on an algebraic curve, Math. Ann., 1990, 288, 309-322 Search in Google Scholar

[13] Caporaso, L., Gonality of algebraic curves and graphs Algebraic and Complex Geometry, Proceedings in Mathematics and Statistics, Springer, 2014, 71, 77-108 Search in Google Scholar

[14] Amini, O., Baker, M., Brugallé, E., Rabinoff, J., Lifting harmonic morphisms II : tropical curves and metrized complexes, Algebra and Number Theory, 2015, 9, 267-315 Search in Google Scholar

[15] Baker, M., Norine, S., Harmonic morphisms and hyperelliptic graphs, International Math. Research Notices, 2009, 15, 2914-2955 Search in Google Scholar

[16] Amini, O., Baker, M., Brugallé, E., Rabinoff, J., Lifting harmonic morphisms I : metrized complexes and Berkovich skeleta, Research in the Mathematical Science, 2014, 2:7 Search in Google Scholar

© 2015 Coppens, published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.