Papers
Topics
Authors
Recent
Search
2000 character limit reached

The valuative tree is the projective limit of Eggers-Wall trees

Published 8 Jul 2018 in math.AG | (1807.02841v1)

Abstract: Consider a germ CC of reduced curve on a smooth germ SS of complex analytic surface. Assume that CC contains a smooth branch LL. Using the Newton-Puiseux series of CC relative to any coordinate system (x,y)(x,y) on SS such that LL is the yy-axis, one may define the {\em Eggers-Wall tree} ΘL(C)\Theta_L(C) of CC relative to LL. Its ends are labeled by the branches of CC and it is endowed with three natural functions measuring the characteristic exponents of the previous Newton-Puiseux series, their denominators and contact orders. The main objective of this paper is to embed canonically ΘL(C)\Theta_L(C) into Favre and Jonsson's valuative tree P(V)\mathbb{P}(\mathcal{V}) of real-valued semivaluations of SS up to scalar multiplication, and to show that this embedding identifies the three natural functions on ΘL(C)\Theta_L(C) as pullbacks of other naturally defined functions on P(V)\mathbb{P}(\mathcal{V}). As a consequence, we prove an inversion theorem generalizing the well-known Abhyankar-Zariski inversion theorem concerning one branch: if $L'$ is a second smooth branch of CC, then the valuative embeddings of the Eggers-Wall trees $\Theta_{L'}(C)$ and ΘL(C)\Theta_L(C) identify them canonically, their associated triples of functions being easily expressible in terms of each other. We prove also that the space P(V)\mathbb{P}(\mathcal{V}) is the projective limit of Eggers-Wall trees over all choices of curves CC. As a supplementary result, we explain how to pass from ΘL(C)\Theta_L(C) to an associated splice diagram.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.