Today Abhishek Koparde spoke on the tropicalization of abstract curves. These are some rough notes taken during the talk.
Main reference: Tropical geometry and correspondence theorems via toric stacks. Link to Abhishek's notes: not yet obtained.
is algebraicaly closed, is a complex DVR with residue field and fraction field . We let be the separable closure of and is a normalized valuation on so that .
Graphs are finite connected with the usual notations.
Curves are denoted by , are assumed to be complete with marked points over , and is the nodal model ( is an intermediate field extension). is a proper curve and is finite separable. is a finite set of points and the total space is normal. is nodal and .
A tropical curve is a topological graph with a complete (possibly degenerate) metric. (Note that a degenerate metric is one where does not necessarily imply that . I think this is sometimes called a pseudo-metric.)
(s1) Vertices of are divided into finite vertices and infinite vertices
(s2) is equipped with a total order and is just a set.
(p1) has finitely many vertices and edges
(p2) any infinite vertex has valency 1 and is connected to a finite vertex by an edge called an "unbounded edge". We denote by those edges between finite vertices and by those edges between a finite and infinite vertex.
(p3) Any bounded edge is isometric to the interval (read as "the length of ") where and an unbounded edge is isometric to where maps to the finite vertex and maps to the infinite vertex.
These axioms describe a general tropical curve. We say
a -tropical curve if for any
a tropical curve is irreducible if is connected
the genus of a tropical curve is
we say a curve is stable if all finite vertices have valency at least
An isomorphism of tropical curves is an isomorphism of the underlying metric graphs.
The following modifications made to a general tropical graph will not change the genus:
Operation 1: Divide each bounded edge into finitely many pieces
Operation 2: Subdivide each unbounded edge into finitely many pieces
Operation 3: Attach rooted metric trees at some finite vertices such that all edges (but maybe not some leaves of that metric tree) are bounded
Claim: Let be an irreducible tropical curve satisfying . Then there exists a unique stable tropical curve such that and can be obtained from and can be obtained from by using finitely many of the above steps. We call the stabilization of .
Consider a curve and remember that is the nodal model and is the fiber over the base. Irreducible components will correspond to finite vertices, nodes will correspond to edges between finite vertices and which specialize to will correspond to infinite edges. This should determine a tropical curve, and we call this tropical curve the tropicalization of the curve.
At this point Abhishek included a picture of a sphere identified with a torus at a point corresponding a tropical curve with two finite vertices, one finite edge and three infinite edge. One finite vertex has valence 3 and the other has valence 2. In particular, this means the tropicalization is not stable.
There was some ambiguity about what it means to say " is stable". At first, we thought it might mean that there exists a nodal model such that its special fiber is stable, but this is true of any curve because of the stable reduction theorem, so it must be something else.
Let be a lattice, . A parameterized tropical curve is a pair where is a map such that for and
We also require that it satisfies the balancing condition:
If for all then we say is a -parameterized -tropical curve. For the duration of today we'll attempt to justify the balancing condition.
Suppose that you have a map and let be a nodal model. Here is the algebraic torus of dimension equal to the rank of . There's a diagram that I'd like to draw but can't because of tikzcd support in markdown, but its rows look like and .
In this picture, given a character on , I can pull back to obtain a character on . I can evaluate the order of this on an irreducible component of , and arrive at the following definition for :
The character is a linear function of for some , so in particular, . Furthermore,
so this definition of is linear. We also need that for any bounded edge .
We completed the proof that does indeed satisfy the balancing condition, but I wasn't able to get all of it down. Please see the end of Abhishek's notes.