Searcharxiv⌕ Search

arXiv subjects

Luck Darnière

Publications and source records attributed to Luck Darnière.

11 recordsLinked to original sources

Semi-algebraic triangulation over p-adically closed fields

We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for semi-algebraic sets.

math.GT↗

Defining integer valued functions in rings of continuous definable functions over a topological field

Let K be an expansion of either an ordered field or a valued field. Given a definable set X $\subseteq$ K m let C(X) be the ring of continuous definable functions from X to K. Under very mild assumptions on the geometry of X and on the structure K, in particular when K is o-minimal or P-minimal, or an expansion of a local field, we prove that the ring of integers Z is interpretable in C(X). If K is o-minimal and X is definably connected of pure dimension 2, then C(X) defines the subring Z. If K is P-minimal and X has no isolated points, then there is a discrete ring Z contained in K and naturally isomorphic to Z, such that the ring of functions f $\in$ C(X) which take values in Z is definable in C(X).

math.LO↗

Model completion of scaled lattices and co-Heyting algebras of p-adic semi-algebraic sets

Let p be prime number, K be a p-adically closed field, X $\subseteq$ K^m a semi-algebraic set defined over K and L(X) the lattice of semi-algebraic subsets of X which are closed in X. We prove that the complete theory of L(X) eliminates the quantifiers in a certain language LASC, the LASC-structure on L(X) being an extension by definition of the lattice structure. Moreover it is decidable, contrary to what happens over a real closed field. We classify these LASC-structures up to elementary equivalence, and get in particular that the complete theory of L(K^m) only depends on m, not on K nor even on p. As an application we obtain a classification of semi-algebraic sets over countable p-adically closed fields up to so-called "pre-algebraic" homeomorphisms.

math.LO↗

On the model-completion of Heyting algebras

We axiomatize the model-completion of the theory of Heyting algebras by means of the "Density" and "Splitting" properties in [DJ18], and of a certain "QE Property" that we introduce here. In addition: we prove that this model-completion has a prime model, which is locally finite and which we explicitly construct; we show how the Open Mapping Theorem of [vGR18] can be derived from the QE Property of existentially closed Heyting algebras; and we construct a certain "discriminant" for equations in Heyting algebras, similar to its ring theoretic counterpart.

math.LO↗

Model-completion of varieties of co-Heyting algebras

It is known that exactly eight varieties of Heyting algebras have a model-completion, but no concrete axiomatisation of these model-completions were known by now except for the trivial variety (reduced to the one-point algebra) and the variety of Boolean algebras. For each of the six remaining varieties we introduce two axioms and show that 1) these axioms are satisfied by all the algebras in the model-completion, and 2) all the algebras in this variety satisfying these two axioms have a certain embedding property. For four of these six varieties (those which are locally finite) this actually provides a new proof of the existence of a model-completion, this time with an explicit and finite axiomatisation.

math.LO↗

Polytopes and simplexes in p-adic fields

We introduce topological notions of polytopes and simplexes, the latter being expected to play in p-adically closed fields the role played by real simplexes in the classical results of triangulation of semi-algebraic sets over real closed fields. We prove that the faces of every p-adic polytope are polytopes and that they form a rooted tree with respect to specialisation. Simplexes are then defined as polytopes whose faces tree is a chain. Our main result is a construction allowing to divide every p-adic polytope in a complex of p-adic simplexes with prescribed faces and shapes.

math.LO↗

Cell decomposition and classification of definable sets in p-optimal fields

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 [Invent. Math, 77 (1984)]. We derive from it the existence of definable Skolem functions and strong p-minimality. Then we turn to strongly p-optimal 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 KxK^d whose fibers are inverse images by the valuation of subsets of the value group, are semi-algebraic. 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 isomorphic iff they have the same dimension.

math.LO↗

Topological cell decomposition and dimension theory in P-minimal fields

This paper addresses some questions about dimension theory for P-minimal structures. We show that, for any definable set A, the dimension of the frontier of A is strictly smaller than the dimension of A itself, and that A has a decomposition into definable, pure-dimensional components. This is then used to show that the intersection of finitely many definable dense subsets of A is still dense in A. As an application, we obtain that any m-ary definable function is continuous on a dense, relatively open subset of its domain, thereby answering a question that was originally posed by Haskell and Macpherson. In order to obtain these results, we show that P-minimal structures admit a type of cell decomposition, using a topological notion of cells inspired by real algebraic geometry.

math.LO↗

Codimension and pseudometric in co-Heyting algebras

In this paper we introduce a notion of dimension and codimension for every element of a distributive bounded lattice $L$. These notions prove to have a good behavior when $L$ is a co-Heyting algebra. In this case the codimension gives rise to a pseudometric on $L$ which satisfies the ultrametric triangle inequality. We prove that the Hausdorff completion of $L$ with respect to this pseudometric is precisely the projective limit of all its finite dimensional quotients. This completion has some familiar metric properties, such as the convergence of every monotonic sequence in a compact subset. It coincides with the profinite completion of $L$ if and only if it is compact or equivalently if every finite dimensional quotient of $L$ is finite. In this case we say that $L$ is precompact. If $L$ is precompact and Hausdorff, it inherits many of the remarkable properties of its completion, specially those regarding the join/meet irreducible elements. Since every finitely presented co-Heyting algebra is precompact Hausdorff, all the results we prove on the algebraic structure of the latter apply in particular to the former. As an application, we obtain the existence for every positive integers $n,d$ of a term $t_{n,d}$ such that in every co-Heyting algebra generated by an $n$-tuple $a$, $t_{n,d}(a)$ is precisely the maximal element of codimension $d$.

math.LO↗

On Bellissima's construction of the finitely generated free Heyting algebras, and beyond

We study finitely generated free Heyting algebras from a topological and from a model theoretic point of view. We review Bellissima's representation of the finitely generated free Heyting algebra; we prove that it yields an embedding in the profinite completion, which is also the completion with respect to a naturally defined metric. We give an algebraic interpretation of the Kripke model used by Bellissima as the principal ideal sprectrum and show it to be first order interpretable in the Heyting algebra, from which several model theoretic and algebraic properties are derived. For example we prove that a free finitely generated Heyting algebra has only one set of free generators, which is definable in it. As a consequence its automorphism group is the permutation group over its generators.

math.LO↗

Model-completion of scaled lattices

It is known from Grzegorczyk's paper \cite{grze-1951} that the lattice of real semi-algebraic closed subsets of ${\mathbb R}^n$ is undecidable for every integer $n\geq 2$. More generally, if $X$ is any definable set over a real or algebraically closed field $K$, then the lattice $L(X)$ of all definable subsets of $X$ closed in $X$ is undecidable whenever $\dim X\geq 2$. Nevertheless, we investigate in this paper the model theory of the class ${\rm SC\_{def}}(K,d)$ of all such lattices $L(X)$ with $\dim X\leq d$ and $K$ as above or a henselian valued field of characteristic zero. We show that the universal theory of ${\rm SC\_{def}}(K,d)$, in a natural expansion by definition of the lattice language, is the same for every such field $K$. We give a finite axiomatization of it and prove that it is locally finite and admits a model-completion, which turns to be decidable as well as all its completions. We expect $L({\mathbb Q}\_p^d)$ to be a model of (a little variant of) this model-completion. This leads us to a new conjecture in $p$-adic semi-algebraic geometry which, combined with the results of this paper, would give decidability (via a natural recursive axiomatization) and elimination of quantifiers for the complete theory of $L({\mathbb R}\_p^d)$, uniformly in $p$.

math.LO↗