The motivation for this paper is to extend the known model theoretic treatment of differential Galois theory to the case of linear difference equations (where the derivative is replaced by an automorphism.) The model theoretic difficulties in this case arise from the fact that the corresponding theory ACFA does not eliminate quantifiers. We therefore study groups of restricted automorphisms, preserving only part of the structure. We give conditions for such a group to be (infinitely) definable, and when these conditions are satisfied we describe the definition of the group and the action explicitly.
We then examine the special case when the theory in question is obtained by enriching a stable theory with a generic automorphism. Finally, we interpret the results in the case of ACFA, and explain the connection of our construction with the algebraic theory of Picard-Vessiot extensions.
The only model theoretic background assumed is the notion of a definable set.
We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness, ...). For example, if $M$ is a countable, $ω$-categorical structure and $Aut(M)$ is amenable, as a topological group, then the Lascar Galois group $Gal_{L}(T)$ of the theory $T$ of $M$ is compact, Hausdorff (also over any finite set of parameters), that is $T$ is G-compact. An essentially special case is that if $Aut(M)$ is extremely amenable, then $Gal_{L}(T)$ …
We make explicit certain results around the Galois correspondence in the context of definable automorphism groups, and point out the relation to some recent papers dealing with the Galois theory of algebraic differential equations when the constants are not "closed" in suitable senses. We also improve the definitions and results on generalized strongly normal extensions.
We prove that in some cases definable chains of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic chains, ROD chains in the Solovay model, and $Σ^1_2$ chains in the assumption that $ω_1^{L[x]}<ω_1$ for all reals $x$.
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support iteration of Cohen forcing. The main points is that (1) all monotone functions from P to P will (essentially) have countable range (this uses a Delta-system argument) and (2) that all countable subsets of P will be first order definable, so we have to code these countable sets into the partial order. Amalgamation of finite structures plays an essential role.
In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this final paper, we give describe a way of constructing `decorated' CFPOs by attaching treelike CFPOs to and between the elements of a cone transitive CFPO. We then show that the automorphism groups of the components of of a decorated CFPO are second order definable in the abstract automorphism group of the decorated CFPO.
We give examples of (i) a simple theory with a formula (with parameters) which does not fork over the empty set but has mu measure 0 for every automorphism invariant Keisler measure mu, and (ii) a definable group G in a simple theory such that G is not definably amenable, i.e. there is no translation invariant Keisler measure on G We also discuss paradoxical decompositions both in the setting of discrete groups and of definable groups, and prove some positive results about small theories, including the definable amenability of definable groups, and nontriviality of the graded Grothendieck ring…
We modify arguments in Vladimir Kanovei, Linearization of definable order relations, APAL, 102(1-2):69--100, 2000, to reprove a linearization theorem on real-ordinal definable partial quasi-orderings in the Solovay model.
Model theoretic internality provides conditions under which the group of automorphisms of a model over a reduct is itself a definable group. In this paper we formulate a categorical analogue of the condition of internality, and prove an analogous result on the categorical level. The model theoretic statement is recovered by considering the category of definable sets.
Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern model theory. The aim of this paper is threefold. (1) We give a simple purely-logical proof of the claim and show that the advanced results from topology and model theory are not needed; (2) we introduce an intrinsic characterisation of the statement "definable CSP has a solution iff it has a definable solution" and investigate it in general intuitionistic se…
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.
NTP2 is a large class of first-order theories defined by Shelah and generalizing simple and NIP theories. Algebraic examples of NTP2 structures are given by ultra-products of p-adics and certain valued difference fields (such as a non-standard Frobenius automorphism living on an algebraically closed valued field of characteristic 0). In this note we present some results on groups and fields definable in NTP2 structures. Most importantly, we isolate a chain condition for definable normal subgroups and use it to show that any NTP2 field has only finitely many Artin-Schreier extensions. We also d…
We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from \cite{BenYaacov:TopometricSpacesAndPerturbations}, allowing us to prove the theorem in case the metric is invariant under the group action; and \item Results concerning the existence of translation-invariant definable metrics on type-definable groups and the extension of partial definable metrics to total ones. \end{enumerate}
We give strengthened versions of the Herwig-Lascar and Hodkinson-Otto extension theorems for partial automorphisms of finite structures. Such strengthenings yield several combinatorial and group-theoretic consequences for homogeneous structures. For instance, we establish a coherent form of the extension property for partial automorphisms for certain Fraisse classes. We deduce from these results that the isometry group of the rational Urysohn space, the automorphism group of the Fraisse limit of any Fraisse class that is the class of all $\mathcal{F}$-free structures (in the Herwig--Lascar sen…
We prove that the class of partial differential fields of characteristic zero with an automorphism has a model companion. We then establish the basic model theoretic properties of this theory and prove that it satisfies the Zilber dichotomy for finite dimensional minimal types.
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve this result by showing that there exist exactly five closed permutation groups which contain the automorphism group of the random partial order, and thus expose all symmetries of this structure. Our classification lines up with previous similar classifications, such as the structures definable in the random graph or the order of the rationals; it also provides…
In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this first paper, we give a variety of conditions that guarantee when a CFPO shares an automorphism group with a tree. Some of these conditions are conditions on the abstract automorphism group, while some are one the CFPO itself. Some of the lemmas used have corollaries concerning the model theoretic properties of a CFPO.
In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this middle paper, we adapt a method used by Shelah in \cite{ShelahPermutation} and \cite{ShelahPermutationErrata}, and by Shelah and Truss in \cite{ShelahTrussQuotients} to define a cone transitive CFPO inside its automorphism group using the language of group theory.
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.
The group configuration in o-minimal structures gives rise, just like in the stable case, to a transitive action of a type-definable group on a partial type. Because $acl=dcl$ the o-minimal proof is significantly simpler than Hrushovski's original argument. Several equivalent versions, which are more suitable to the o-minimal setting, are formulated, in functional language and also in terms of a certain $4$-ary relation. In addition, the following question is considered: Can every definably connected type-definable group be definably embedded into a definable group of the same dimension? Two s…
We survey recent developments concerning two properties of classes of finite structures: the Ramsey property and the extension property for partial automorphisms (EPPA).
We consider an arbitrary topological group $G$ definable in a structure $\mathcal M$, such that some basis for the topology of $G$ consists of sets definable in $\mathcal M$. To each such group $G$ we associate a compact $G$-space of partial types $S^μ_G(M)=\{p_μ:p\in S_G(M)\}$ which is the quotient of the usual type space $S_G(M)$ by the relation of two types being "infinitesimally close to each other". In the o-minimal setting, if $p$ is a definable type then it has a corresponding definable subgroup $Stab_μ(p)$, which is the stabilizer of $p_μ$. This group is nontrivial when $p$ is unbounde…
This paper began as a generalization of a part of the author's PhD thesis about ACFA and ended up with a characterization of groups definable in T_A. The thesis concerns minimal formulae in ACFA of the form "p lies on an algebraic curve A and s(x)=f(x)" for some dominant rational function f from A to s(A), where s is the automorphism. These are shown to be uniform in the Zilber trichotomy, and the pairs (A,f) that fall into each of the three cases are characterized. These characterizations are definable in families. This paper covers approximately half of the thesis, namely those parts of it w…
In a stable theory, a stationary type $q \in S(A)$ internal to a family of partial types $\mathcal{P}$ over $A$ gives rise to a type-definable group, called its binding group. This group is isomorphic to the group $\mathrm{Aut}(q/\mathcal{P},A)$ of permutations of the set of realizations of $q$, induced by automorphisms of the monster model, fixing $\mathcal{P} \cup A$ pointwise. In this paper, we investigate families of internal types varying uniformly, what we will call relative internality. We prove that the binding groups also vary uniformly, and are the isotropy groups of a natural type-d…
We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all completions of the theory of pseudo-finite fields we show that algebraic closure agrees with definable closure, as soon as A contains the relative algebraic closure of the prime field.
We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the Nešetřil-Rödl Theorem and the second and third authors' Ramsey theorem for finite models (that is, structures with both relations and functions). We also find subclasses with the ordering property. For languages with relational symbols and unary functions we also show the extension property for partial automorphisms (EPPA) of free amalgamation classes. These general results s…
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite ordered structures with finitely many partial equivalence relations with convex classes.
I prove forcing preservation theorems for products of definable partial orders preserving the cofinality of the meager or null ideal. Rectangular Ramsey theorems for related ideals follow from the proofs.
In this paper, we compute universal minimal flows of groups of automorphisms of uncountable $ω$-homogeneous graphs, $K_n$-free graphs, hypergraphs, partially ordered sets, and their extensions with an $ω$-homogeneous ordering. We present an easy construction of such structures, expanding the jungle of extremely amenable groups.
Definable convolution and idempotent Keisler measures III. Generic stability, generic transitivity, and revised Newelski's conjecture
University of Maryland, College Park（马里兰大学帕克分校）；University of California, Los Angeles（加州大学洛杉矶分校）；Beijing International Center for Mathematical Research (BICMR) Peking University（北京大学北京国际数学研究中心）；Instytut Matematyczny Uniwersytet Wrocławski（弗罗茨瓦夫大学数学研究所）
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is concerned with Cameron's problem of classifying the homogeneous structures in a language of finitely many linear orders, which we call finite-dimensional permutation structures. Towards this problem, we present a construction that we conjecture produces all such structures. Some evidence for this conjecture is given, including the classification of the homogene…
