CELL DECOMPOSITION AND CLASSIFICATION OF DEFINABLE SETS INp-OPTIMAL FIELDS

Abstract

AbstractWe prove that forp-optimal fields (a very large subclass ofp-minimal fields containing all the known examples) a cell decomposition theorem follows from methods going back to Denef’s paper [7]. We derive from it the existence of definable Skolem functions and strongp-minimality. Then we turn to stronglyp-minimal fields satisfying the Extreme Value Property—a property which in particular holds in fields which are elementarily equivalent to ap-adic one. For such fieldsK, we prove that every definable subset ofK×Kdwhose fibers overKare inverse images by the valuation of subsets of the value group is semialgebraic. Combining the two we get a preparation theorem for definable functions onp-optimal fields satisfying the Extreme Value Property, from which it follows that infinite sets definable over such fields are in definable bijection iff they have the same dimension.