English

Definable completeness of $P$-minimal fields and applications

Logic 2020-07-16 v1

Abstract

We show that every definable nested family of closed and bounded subsets of a PP-minimal field KK has non-empty intersection. As an application we answer a question of Darni\`ere and Halupczok showing that PP-minimal fields satisfy the "extreme value property": for every closed and bounded subset UKU\subseteq K and every interpretable continuous function f ⁣:UΓKf\colon U \to \Gamma_K (where ΓK\Gamma_K denotes the value group), f(U)f(U) admits a maximal value. Two further corollaries are obtained as a consequence of their work. The first one shows that every interpretable subset of K×ΓKnK\times\Gamma_K^n is already interpretable in the language of rings, answering a question of Cluckers and Halupczok. This implies in particular that every PP-minimal field is polynomially bounded. The second one characterizes those PP-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

R2 v1 2026-06-23T17:07:55.015Z