The reduction graph of the special fiber [01J9]
Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.
Complete original source context · Original author HTML
The reduction graph of the special fiber
In that situation, the reduction graph is a metrized graph defined as follows. It has for vertices the irreducible components of the special fiber, with as many edges of length between two vertices as the number of intersection points of the corresponding components. In an neighbourghood of a double point, looks like (i.e., has an étale map to) the scheme with equation in the affine plane .
If one replaces the field by a finite extension , the base change may no more be regular. Indeed, is étale locally isomorphic to , where is a uniformizing element of , and is the ramification index. When , the origin is a singular point of that scheme and one needs to blow it up repeatedly in order to obtain a regular scheme, which is a semi-stable model of over . The two initial components are replaced by a chain of components, the intermediate ones being projective lines. In other words, vertices have been added, regularly spaced along each edge. One concludes that the reduction graph has not changed, as a topological space. Its metric has not changed neither, since the edges that partition an original edge (of length ) have length .
We say that a function on is piecewise linear if, up to passing to a finite extension (which replaces each edge by edges of length equal to th of the initial one), it is linear on each edge.