Mathematics > Algebraic Geometry
[Submitted on 4 Feb 2022 (v1), last revised 14 Aug 2022 (this version, v2)]
Title:Rigidity of valuative trees under henselization
View PDFAbstract:Let $(K,v)$ be a valued field and let $(K^h,v^h)$ be the henselization determined by the choice of an extension of $v$ to an algebraic closure of $K$. Consider an embedding $v(K^*)\hookrightarrow\Lambda$ of the value group into a divisible ordered abelian group. Let $T(K,\Lambda)$, $T(K^h,\Lambda)$ be the trees formed by all $\Lambda$-valued extensions of $v$, $v^h$ to the polynomial rings $K[x]$, $K^h[x]$, respectively. We show that the natural restriction mapping $T(K^h,\Lambda)\to T(K,\Lambda)$ is an isomorphism of posets.
As a consequence, the restriction mapping $T_v\to T_{v^h}$ is an isomorphism of posets too, where $T_v$, $T_{v^h}$ are the trees whose nodes are the equivalence classes of valuations on $K[x]$, $K^h[x]$ whose restriction to $K$, $K^h$ are equivalent to $v$, $v^h$, respectively.
Submission history
From: Enric Nart [view email][v1] Fri, 4 Feb 2022 09:29:29 UTC (23 KB)
[v2] Sun, 14 Aug 2022 15:21:09 UTC (23 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.