Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T19:19:55.500Z Has data issue: false hasContentIssue false

CELL DECOMPOSITION AND CLASSIFICATION OF DEFINABLE SETS IN p-OPTIMAL FIELDS

Published online by Cambridge University Press:  24 January 2017

LUCK DARNIÈRE
Affiliation:
FACULTÉ DES SCIENCES 2 BOULEVARD LAVOISIER 49045 ANGERS CEDEX 01, FRANCE
IMMANUEL HALPUCZOK
Affiliation:
SCHOOL OF MATHEMATICS UNIVERSITY OF LEEDS WOODHOUS LANE, LEEDS, UK
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We prove that for p-optimal fields (a very large subclass of p-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 strong p-minimality. Then we turn to strongly p-minimal fields satisfying the Extreme Value Property—a property which in particular holds in fields which are elementarily equivalent to a p-adic one. For such fields K, we prove that every definable subset of K × K d whose fibers over K are inverse images by the valuation of subsets of the value group is semialgebraic. Combining the two we get a preparation theorem for definable functions on p-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.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2017