We prove that externally definable sets in first order NIP theories have honest definitions, giving a new proof of Shelah's expansion theorem. Also we discuss a weak notion of stable embeddedness true in this context. Those results are then used to prove a general theorem on dependent pairs, which in particular answers a question of Baldwin and Benedikt on naming an indiscernible sequence.
We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of non-forking instances of a formula (with parameters ranging over a type-definable set) can be covered with finitely many invariant types; we give some criteria for the boundedness of an expansion by a new predicate in a distal theory; naming an arbitrary small indiscernible sequence preserves NIP, while naming a large one doesn't; there are models of NIP theorie…
Let $\mathcal{R}$ be an $\mathrm{NIP}$ expansion of $(\mathbb{R},<,+)$ by closed subsets of $\mathbb{R}^n$ and continuous functions $f : \mathbb{R}^m \to \mathbb{R}^n$. Then $\mathcal{R}$ is generically locally o-minimal. It follows that if $X \subseteq \mathbb{R}^n$ is definable in $\mathcal{R}$ then the $C^k$-points of $X$ are dense in $X$ for any $k \geq 0$. This follows from a more general theorem on $\mathrm{NIP}$ expansions of locally compact groups, which itself follows from a result on quotients of definable sets by equivalence relations which are externally definable and $\bigwedge$-d…
For a group $G$ first order definable in a structure $M$, we continue the study of the "definable topological dynamics" of $G$. The special case when all subsets of $G$ are definable in the given structure $M$ is simply the usual topological dynamics of the discrete group $G$; in particular, in this case, the words "externally definable" and "definable" can be removed in the results described below. Here we consider the mutual interactions of three notions or objects: a certain model-theoretic invariant $G^{*}/(G^{*})^{000}_{M}$ of $G$, which appears to be "new" in the classical discrete case …
We entirely classify definable sets up to definable bijections in $\mathbb{Z}$-groups, where the language is the one of ordered abelian groups. From this, we deduce, among others, a classification of definable families of bounded definable sets.
Let $K$ be an NIP field and let $v$ be a henselian valuation on $K$. We ask whether $(K,v)$ is NIP as a valued field. By a result of Shelah, we know that if $v$ is externally definable, then $(K,v)$ is NIP. Using the definability of the canonical $p$-henselian valuation, we show that whenever the residue field of $v$ is not separably closed, then $v$ is externally definable. In the case of separably closed residue field, we show that $(K,v)$ is NIP as a pure valued field.
We introduce a non real-valued measure on the definable sets contained in the finite part of a cartesian power of an o-minimal field $R$. The measure takes values in an ordered semiring, the Dedekind completion of a quotient of $R$. We show that every measurable subset of $R^n$ with non-empty interior has positive measure, and that the measure is preserved by definable $C^1$-diffeomorphisms with Jacobian determinant equal to $\pm 1$.
We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $Σ^1_2$ thin sets in the assumption that $ω_1^{L[x]}<ω_1$ for all reals $x$. We also prove that definable thin wellorderings admit partitions into definable chains in the Solovay model.
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a join-semilattice under inclusion that may fail to be a lattice. We investigate the question of which semilattices arise as the collection of definable sets in a continuous theory. We show that for any non-trivial finite semilattice $L$ (or, equivalently, any finite lattice $L$), there is a superstable theory $T$ whose semilattice of definable sets is $L$. We then extend t…
We give an example of a dense o-minimal structure in which there is a definable quotient that cannot be eliminated, even after naming parameters. Equivalently, there is an interpretable set which cannot be put in parametrically definable bijection with any definable set. This gives a negative answer to a question of Eleftheriou, Peterzil, and Ramakrishnan. Additionally, we show that interpretable sets in dense o-minimal structures admit definable topologies which are "tame" in several ways: (a) they are Hausdorff, (b) every point has a neighborhood which is definably homeomorphic to a definabl…
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 o…
We use the Cauchy-Crofton formula to show that every definable cell (bounded by a ball with rational radius) in an O-minimal expansion of a field extension of the real numbers satisfies the Whitney arc property.
We obtain some new results on the topology of unary definable sets in densely ordered Abelian groups of burden groups of burden 2. In the special case in which the structure has dp-rank 2, we show that the existence of an infinite definable discrete set precludes the definability of a set which is dense and codense in an interval, or of a set which is topologically like the Cantor middle-third set. If the structure has burden 2 and both an infinite discrete set D and a dense-codense set X are definable, then translates of X must witness the Independence Property. In the last section, an explic…
We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable sets, definable functions are almost everywhere continuous, and definable sets are finite unions of graphs of definable continuous "multi-valued functions". This generalizes known statements about weakly o-minimal, C-minimal and P-minimal theories.
A visceral structure on M is given by a definable base for a uniform topology on its universe in which all basic open sets are infinite and any infinite definable subset X of M has non-empty interior. This context includes o-minimal ordered groups, p-adic fields, and other examples. Assuming only viscerality, we show that the definable sets in M satisfy some desirable topological tameness conditions. For example, any definable unary function on M has a finite set of discontinuities; any definable function on a Cartesian power of M is continuous on a nonempty open set; and assuming definable fi…
We show that after forcing with a countable support iteration or a finite product of Sacks or splitting forcing over $L$, every analytic hypergraph on a Polish space admits a $\mathbfΔ^1_2$ maximal independent set. As a main application we get the consistency of $\mathfrak{r} = \mathfrak{u} = \mathfrak{i} = ω_2$ together with the existence of a $Δ^1_2$ ultrafilter, a $Π^1_1$ maximal independent family and a $Δ^1_2$ Hamel basis. This solves open problems of Brendle, Fischer and Khomskii and the author. We also show in ZFC that $\mathfrak{d} \leq \mathfrak{i}_{cl}$.
We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three tameness conditions hold. We prove a structure theorem for definable sets and functions in analogy with the influential cell decomposition theorem known for o-minimal structures. The structure theorem advances the state-of-the-art in all known examples of $\mathcal {\widetilde M}$, as it achieves a decomposition of definable sets into \emph{unions} of `cones'…
We describe the ind- and pro- categories of the category of definable sets, in some first order theory, in terms of points in a sufficiently saturated model.
We study $Σ_1(ω_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $Σ_1$-formula with parameter $ω_1$) in the presence of large cardinals. Our results show that the existence of a Woodin cardinal and a measurable cardinal above it imply that no well-ordering of the reals is $Σ_1(ω_1)$-definable, the set of all stationary subsets of $ω_1$ is not $Σ_1(ω_1)$-definable and the complement of every $Σ_1(ω_1)$-definable Bernstein subset of ${}^{ω_1}ω_1$ is not $Σ_1(ω_1)$-definable. In contrast, we show that the existence of a Woodin cardinal is compatible …
Let R be an o-minimal field and V a proper convex subring with residue field k and standard part (residue) map st: V \to k. Let k_{ind} be the expansion of k by the standard parts of the definable relations in R. We investigate the definable sets in k_{ind} and conditions on (R,V) which imply o-minimality of k_{ind}. We also show that if R is omega-saturated and V is the convex hull of the rationals in R, then the sets definable in k_{ind} are exactly the standard parts of the sets definable in (R,V).
We study directed sets definable in o-minimal structures, showing that in expansions of ordered fields these admit cofinal definable curves, as well as a suitable analogue in expansions of ordered groups, and furthermore that no analogue holds in full generality. We use the theory of tame pairs to extend the results in the field case to definable families of sets with the finite intersection property. We then apply our results to the study of definable topologies. We prove that all definable topological spaces display properties akin to first countability, and give several characterizations of…
In this paper, we show that a partitioned formula ϕis dependent if and only if ϕhas uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by giving a decomposition of the truth values of an externally definable formula on a finite partial order indiscernible.
We show that, for a certain large class of power-bounded $o$-minimal $\mathcal{L}_T$-theories $T$ whose field of exponents is infinite-dimensional as a vector space over the rationals, any definable set in a $T$-convex valued field $(\mathcal{R}, \mathfrak{O})$ is in a precise sense the limit of a family of $\mathcal{L}_T$-definable sets indexed over the residue field. Alternatively, in the mainstream model-theoretic language, this says that if $(\mathcal{R}', \mathfrak{O}')$ is an elementary substructure of $(\mathcal{R}, \mathfrak{O})$ and if the residue field of $\mathfrak{O}$ contains an e…
Let $\mathcal R$ be a $Σ^1_1$ binary relation, and recall that a set $A$ is $\mathcal R$-discrete if no two elements of $A$ are related by $\mathcal R$. We show that in the Sacks and Miller forcing extensions of $L$ there is a $Δ^1_2$ maximal $\mathcal{R}$-discrete set. We use this to answer in the negative the main question posed in \cite{Fischer2010} by showing that in the Sacks and Miller extensions there is a $Π^1_1$ maximal orthogonal family ("mof") of Borel probability measures on Cantor space. By contrast, we show that if there is a Mathias real over $L$ then there are no $Σ^1_2$ mofs.
We give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in the group is a union of a family of quantifier free definable sets, where the parameter of the family runs over a set definable (with quantifiers) in a sort which carries the structure of an ordered set with some additional unary predicates. As a corollary, we find that all definable functions in ordered abelian groups are piecewise affine linear on finitely …
In 1996, Michaux and Villemaire considered integer relations $R$ which are not definable in Presburger Arithmetic. That is, not definable in first-order logic over integers with the addition function and the order relation (FO[N,+,<]-definable relations). They proved that, for each such $R$, there exists a FO[N,+,<,$R$]-formula $ν_{R}(x)$ which defines a set of integers which is not ultimately periodic, i.e. not FO[N,+,<]-definable. It is proven in this paper that the formula $ν(x)$ can be chosen such that it does not depend on the interpretation of $R$. It is furthermore proven that $ν(x)$ ca…
Let $\mathcal K=\langle\mathcal R, δ\rangle$ be a closed ordered differential field, in the sense of M. Singer, and $C$ its field of constants. In this note, we prove that, for sets definable in the pair $\mathcal M=\langle \mathcal R, C\rangle$, the $δ$-dimension and the large dimension coincide. As an application, we characterize the definable sets in $\mathcal K$ that are internal to $C$ as those sets that are definable in $\mathcal M$ and have $δ$-dimension $0$. We further show that, for sets definable in $\mathcal K$, having $δ$-dimension $0$ does not generally imply co-analyzability in $…
Suppose $E \subseteq \mathbb{R}$ is nowhere dense. If $(\mathbb{R},<,+,(x \mapsto λx)_{λ\in \mathbb{R} }, E)$ does not define every bounded Borel subset of every $\mathbb{R}^n$ then for every $s > 0$ we have $$ | \{ k \in \mathbb{Z}, -m \leq k \leq m - 1 : [k,k+1] \cap E \neq \emptyset \} | < m^s $$ for sufficiently large $m \in \mathbb{N}$. Then there is an $n \in \mathbb{N}$ and a linear $T : \mathbb{R}^n \to \mathbb{R}$ such that $T(E^n)$ is dense. It follows that if $E$ is in addition nowhere dense then $(\mathbb{R},<,+,0,(x \mapsto λx)_{λ\in \mathbb{R}}, E)$ defines every bounded Borel su…
We study a reduct L\ast of the ring language where multiplication is restricted to a neighbourhood of zero. The language is chosen such that for p-adically closed fields K, the L\ast-definable subsets of K coincide with the semi-algebraic subsets of K. Hence structures (K,L\ast) can be seen as the p-adic counterpart of the o-minimal structure of semibounded sets. We show that in this language, p-adically closed fields admit cell decomposition, using cells similar to p-adic semi-algebraic cells. From this we can derive quantifier-elimination, and give a characterization of definable functions. …
Let G be a definably compact group in an o-minimal expansion of a real closed field. We prove that if dim(G X) < dim G for some definable X subset of G then X contains a torsion point of G. Along the way we develop a general theory for so-called G-linear sets, and investigate definable sets which contain abstract subgroups of G.
We prove new upper bounds on homotopy and homology groups of o-minimal sets in terms of their approximations by compact o-minimal sets. In particular, we improve the known upper bounds on Betti numbers of semialgebraic sets defined by quantifier-free formulae, and obtain for the first time a singly exponential bound on Betti numbers of sub-Pfaffian sets.
We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically closed fields as above; in the sense that definable sets are exactly the constructible sets in this topology.
We introduce the Hausdorff measure for definable sets in an o-minimal structure, and prove the Cauchy-Crofton and co-area formulae for the o-minimal Hausdorff measure. We also prove that every definable set can be partitioned into "basic rectifiable sets", and that the Whitney arc property holds for basic rectifiable sets.
We prove that many properties and invariants of definable groups in NIP theories, such as definable amenability, G/G^{00}, etc., are preserved when passing to the theory of the Shelah expansion by externally definable sets, M^{ext}, of a model M. In the light of these results we continue the study of the "definable topological dynamics" of groups in NIP theories. In particular we prove the Ellis group conjecture relating the Ellis group to G/G^{00} in some new cases, including definably amenable groups in o-minimal structures.
We introduce a notion of density point and prove results analogous to Lebesgue's density theorem for various well-known ideals on Cantor space and Baire space. In fact, we isolate a class of ideals for which our results hold. In contrast to these results, we show that there is no reasonably definable selector that chooses representatives for the equivalence relation on the Borel sets of having countable symmetric difference. In other words, there is no notion of density which makes the ideal of countable sets satisfy an analogue to the density theorem. The proofs of the positive results use on…
Recall that the Mouse Set Conjecture says that under AD++V=L(P(R)), a real is ordinal definable if and only if it belongs to an iterable mouse. The Mouse Set Conjecture for sets of reals says that under the same theory, a set of reals is ordinal definable from a real if and only if it belongs to a mouse over the reals. We prove that the Mouse Set Conjecture implies the Mouse Set Conjecture for sets of reals.
On the measure of definable sets in profinite groups
Fakultät für Mathematik, Universität Bielefeld(比勒费尔德大学数学学院);Dipartimento di Matematica ‘Ulisse Dini’, Università degli Studi di Firenze(佛罗伦萨大学乌利塞·迪尼数学系)
To a definable subset of Z_p^n (or to a scheme of finite type over Z_p) one can associate a tree in a natural way. It is known that the corresponding Poincare series P(X) = \sum_i N_i X^i is rational, where N_i is the number of nodes of the tree at depth i. This suggests that the trees themselves are far from arbitrary. We state a conjectural, purely combinatorial description of the class of possible trees and provide some evidence for it. We verify that any tree in our class indeed arises from a definable set, and we prove that the tree of a definable set (or of a scheme) lies in our class in…
We prove a cell decomposition theorem for Presburger sets and introduce a dimension theory for Z-groups with the Presburger structure. Using the cell decomposition theorem we obtain a full classification of Presburger sets up to definable bijection. We also exhibit a tight connection between the definable sets in an arbitrary p-minimal field and Presburger sets in its value group. We give a negative result about expansions of Presburger structures and prove uniform elimination of imaginaries for Presburger structures within the Presburger language.
In this mostly expository note, I give a very quick proof of the definable Chow theorem of Peterzil and Starchenko using the Bishop-Stoll theorem and a volume estimate for definable sets due to Nguyen and Valette. The volume estimate says that any $d$-dimensional definable subset of $S\subseteq\mathbb{R}^n$ in an o-minimal expansion of the ordered field of real numbers satisfies the inequality $\mathcal{H}^d(\{x\in S:\lVert x\rVert<r\})\leq Cr^d$, where $\mathcal{H}^d$ denotes the $d$-dimensional Hausdorff measure on $\mathbb{R}^n$ and $C$ is a constant depending on $S$. A closely related volu…
As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.) Here, we first consider it on densely ordered abelian groups to prove Heine-Borel theorem (every closed and bounded interval is compact with respect to order topology) in those structures. Then, using the recently introduced notion of pseudo finite sets, we introduce a first order definable version of {\it continuous induction} in the language of ordered gro…
We analyze the effect of replacing several natural uses of definability in set theory by the weaker model-theoretic notion of algebraicity. We find, for example, that the class of hereditarily ordinal algebraic sets is the same as the class of hereditarily ordinal definable sets, that is, HOA = HOD. Moreover, we show that every (pointwise) algebraic model of ZF is actually pointwise definable. Finally, we consider the implicitly constructible universe Imp---an algebraic analogue of the constructible universe---which is obtained by iteratively adding not only the sets that are definable over wh…
We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits all relations on $D$ which are definable in $M^{eq}$, and has no other definable relations. Our results imply that if no relation symbol of the language of $M$ has arity higher than 2, then there is a close relationship between triviality of dependence and $D$ being a reduct of a binary random structure. Somewhat more preciely: (a) if for every $n \geq 2$, …
We study the geometry of germs of definable (semialgebraic or subanalytic) sets over a $p$-adic field from the metric, differential and measure geometric point of view. We prove that the local density of such sets at each of their points does exist. We then introduce the notion of distinguished tangent cone with respect to some open subgroup with finite index in the multiplicative group of our field and show, as it is the case in the real setting, that, up to some multiplicities, the local density may be computed on this distinguished tangent cone.We also prove that these distinguished tangent…