Definable completeness of $P$-minimal fields and applications
Abstract
We show that every definable nested family of closed and bounded subsets of a -minimal field has non-empty intersection. As an application we answer a question of Darni\`ere and Halupczok showing that -minimal fields satisfy the "extreme value property": for every closed and bounded subset and every interpretable continuous function (where denotes the value group), admits a maximal value. Two further corollaries are obtained as a consequence of their work. The first one shows that every interpretable subset of is already interpretable in the language of rings, answering a question of Cluckers and Halupczok. This implies in particular that every -minimal field is polynomially bounded. The second one characterizes those -minimal fields satisfying a classical cell preparation theorem as those having definable Skolem functions, generalizing a result of Mourgues.
Keywords
Cite
@article{arxiv.2007.07521,
title = {Definable completeness of $P$-minimal fields and applications},
author = {Pablo Cubides Kovacsics and Françoise Delon},
journal= {arXiv preprint arXiv:2007.07521},
year = {2020}
}
Comments
14 pages