Searcharxiv⌕ Search

arXiv subjects

Anand Pillay

Publications and source records attributed to Anand Pillay.

At least 37 records · Page 2Linked to original sources

Continuous stable regularity

We prove an analytic version of the stable graph regularity lemma from \cite{MaSh}, which applies to stable functions $f\colon V\times W\to [0,1]$. Our methods involve continuous model theory and, in particular, results on the structure of local Keisler measures for stable continuous formulas. Along the way, we develop some basic tools around ultraproducts of metric structures and linear functionals on continuous formulas, and we also describe several concrete families of examples of stable functions.

math.LO↗

Tighter Bounds on the Expressivity of Transformer Encoders

Characterizing neural networks in terms of better-understood formal systems has the potential to yield new insights into the power and limitations of these networks. Doing so for transformers remains an active area of research. Bhattamishra and others have shown that transformer encoders are at least as expressive as a certain kind of counter machine, while Merrill and Sabharwal have shown that fixed-precision transformer encoders recognize only languages in uniform $TC^0$. We connect and strengthen these results by identifying a variant of first-order logic with counting quantifiers that is simultaneously an upper bound for fixed-precision transformer encoders and a lower bound for transformer encoders. This brings us much closer than before to an exact characterization of the languages that transformer encoders recognize.

cs.LG↗

Picard-Vessiot extensions, linear differential algebraic groups and their torsors

Let K be differential field with algebraically closed field of constants. Let K^diff be a differential closure of K, and L the (iterated) Picard-Vessiot closure of K inside K^diff. Let G be a linear differential algebraic group over K and X a differential algebraic torsor for G over K. We prove that X(L) is Kolchin-dense in X. When G is finite-dimensional we prove that X(L) = X(K^diff). We give close relationships between Picard-Vessiot extensions of K and torsors for suitable finite-dimensional linear differential algebraic groups over K. We suggest some differential field analogues of the notion of boundedness for fields (Serre's property F).

math.AG↗

Forking and invariant measures in NIP theories

We give an example of an NIP theory $T$ in which there is a formula that does not fork over $\varnothing$ but has measure $0$ under any global $\varnothing$-invariant Keisler measure, and we show that this cannot occur if $T$ is also first-order amenable.

math.LO↗

On definable groups and D-group in certain fields with a generic derivation

We continue our earlier study of finite dimensional definable groups in models of the the model companion of an o-minimal L-theory T expanded by a generic derivation as in [F-K]. We generalize Buium's notion of an algebraic D-group to L-definable D-groups, namely (G,s), where G is a L-definable group in a model of T, and s is an L-definable group section into the prolongation of G. Our main theorem says that every definable group of finite dimension in a model of the theory is definably isomorphic to the ``sharp'' points of an L-definable D-group. We obtain analogous results when T is either the theory of p-adically closed fields or the theory of pseudo-finite fields of characteristic zero.

math.LO↗

Open subgroups of $p$-adic algebraic groups

In \cite{Pillay} and more formally in \cite{Onshuus-Pillay} it was asked whether open subgroups of $p$-adic algebraic groups are ($p$-adic) semialgebraic, equivalently, definable in the structure $(\mathbb Q_{p}, +, \times)$. We give a positive answer in the commutative case. Together with results of \cite{Prasad} this leads to a positive answer for reductive algebraic groups.

math.GR↗

On definable groups in real closed fields with a generic derivation, and related structures

We study finite-dimensional groups definable in models of the theory of real closed fields with a generic derivation (also known as CODF). We prove that any such group definably embeds in a semialgebraic group. We extend the results to several more general contexts; strongly model complete theories of large geometric fields with a generic derivation, model complete o-minimal expansions of RCF with a generic derivation, open theories of topological fields with a generic derivation. We also give a general theorem on recovering a definable group from generic data in the context of geometric structures.

math.LO↗

On groups with definable $f$-generics definable in $p$-adically closed fields

The aim of this paper is to develop the theory of groups definable in the $p$-adic field ${\mathbb Q}_p$, with ``definable $f$-generics" in the sense of an ambient saturated elementary extension of ${\mathbb Q}_p$. We call such groups definable $f$-generic groups. So, by a ``definable f-generic'' or dfg group we mean a definable group in a saturated model with a global f-generic type which is definable over a small model. In the present context the group is definable over ${\mathbb Q}_p$, and the small model will be ${\mathbb Q}_p$ itself. The notion of a dfg group is dual, or rather opposite to that of an fsg group (group with ``finitely satisfiable generics") and is a useful tool to describe the analogue of torsion free o-minimal groups in the $p$-adic context. In the current paper our group will be definable over ${\mathbb Q}_p$ in an ambient saturated elementary extension $\mathbb K$ of ${\mathbb Q}_p$, so as to make sense of the notions of $f$-generic etc. In this paper we will show that every definable $f$-generic group definable in ${\mathbb Q}_p$ is virtually isomorphic to a finite index subgroup of a trigonalizable algebraic group over ${\mathbb Q}_p$. This is analogous to the $o$-minimal context, where every connected torsion free group definable in $\mathbb R$ is isomorphic to a trigonalizable algebraic group (Lemma 3.4, \cite{COS}). We will also show that every open definable $f$-generic subgroup of a definable $f$-generic group has finite index, and every $f$-generic type of a definable $f$-generic group is almost periodic, which gives a positive answer to the problem raised in \cite{P-Y} of whether $f$-generic types coincide with almost periodic types in the $p$-adic case.

math.LO↗

On the topological dynamics of automorphism groups; a model-theoretic perspective

We give a model-theoretic treatment of the fundamental results of Kechris-Pestov-Todorčević theory in the more general context of automorphism groups of not necessarily countable structures. One of the main points is a description of the universal ambit as a certain space of types in an expanded language. Using this, we recover various results of Kechris-Pestov-Todorčević, Moore, Ngyuen Van Thé, in the context of automorphism groups of not necessarily countable structures, as well as Zucker.

math.LO↗

A note on Pontryagin duality and continuous logic

We exhibit Pontryagin duality as a special case of Stone duality in a continuous logic setting. More specifically, given an abelian topological group $A$, and $\mathcal F$ the family (group) of continuous homomorphisms from $A$ to the circle group $\mathbb T$, then, viewing $(A,+)$ equipped with the collection $\mathcal F$ as a continuous logic structure $M$, we show that the local type space $S_\mathcal F(M)$ is precisely the Pontryagin dual of the group $\mathcal F$ where the latter is considered as a discrete group. We conclude, using Pontryagin duality (between compact and discrete abelian groups), that $S_\mathcal F(M)$ is the Bohr compactification of the topological group $A$.

math.LO↗

Thorn forking, weak normality, and theories with selectors

We discuss the role of weakly normal formulas in the theory of thorn forking, as part of a commentary on the paper "Thorn forking and stable forking" by Ealy and Onshuus (Rev. acad. colomb. cienc. exact. fis. nat. vol.40 no.157 Bogotá Oct./Dec. 2016). We also give a counterexample to Corollary 4.2 from that paper, and in the process discuss "theories with selectors".

math.LO↗

Invariant measures in simple and in small theories

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.

math.LO↗

Galois groups of large fields with simple theory (with an appendix by Philip Dittmann)

Suppose that $K$ is an infinite field which is large (in the sense of Pop) and whose first order theory is simple. We show that $K$ is {\em bounded}, namely has only finitely many separable extensions of any given finite degree. We also show that any genus $0$ curve over $K$ has a $K$-point and if $K$ is additionally perfect then $K$ has trivial Brauer group. These results give evidence towards the conjecture that large simple fields are bounded PAC. Combining our results with a theorem of Lubotzky and van den Dries we show that there is a bounded $\mathrm{PAC}$ field $L$ with the same absolute Galois group as $K$. In the appendix we show that if $K$ is large and $\mathrm{NSOP}_\infty$ and $v$ is a non-trivial valuation on $K$ then $(K,v)$ has separably closed Henselization, so in particular the residue field of $(K,v)$ is algebraically closed and the value group is divisible. The appendix also shows that formally real and formally $p$-adic fields are $\mathrm{SOP}_\infty$ (without assuming largeness).

math.LO↗

Amenability, connected components, and definable actions

We study amenability of definable and topological groups. Among our main technical tools is an elaboration on and strengthening of the Massicot-Wagner version of the stabilizer theorem, and some results around measures. As an application we show that if $G$ is an amenable topological group, then the Bohr compactification of $G$ coincides with a certain "weak Bohr compactification" introduced in [24]. Formally, $G^{00}_{topo} = G^{000}_{topo}$. We also prove wide generalizations of this result, implying in particular its extension to a "definable-topological" context, confirming the main conjectures from [24]. We introduce $\bigvee$-definable group topologies on a given $\emptyset$-definable group $G$ (including group topologies induced by type-definable subgroups as well as uniformly definable group topologies), and prove that the existence of a mean on the lattice of closed, type-definable subsets of $G$ implies (under some assumption) that $cl(G^{00}_M) = cl(G^{000}_M)$ for any model $M$. We study the relationship between definability of an action of a definable group on a compact space, weakly almost periodic actions, and stability. We conclude that for any group $G$ definable in a sufficiently saturated structure, every definable action of $G$ on a compact space supports a $G$-invariant probability measure. This gives negative solutions to some questions and conjectures from [22] and [24]. We give an example of a $\emptyset$-definable approximate subgroup $X$ in a saturated extension of the group $\mathbb{F}_2 \times \mathbb{Z}$ in a suitable language for which the $\bigvee$-definable group $H:=\langle X \rangle$ contains no type-definable subgroup of bounded index. This refutes a conjecture by Wagner and shows that the Massicot-Wagner approach to prove that a locally compact "model" exists for each approximate subgroup does not work in general.

math.LO↗

On pp elimination and stability in a continuous setting

We generalize pp elimination for modules, or more generally abelian structures, to a continuous logic environment where the abelian structure is equipped with a homomorphism to a compact (Hausdorff) group. We conclude that the continuous logic theory of such a structure is stable.

math.LO↗

Model Theory and Groups

This is a largely expository paper about how groups arise or are of interest in model theory. Included are the following topics: classifying groups definable in specific structures or theories and the relation to algebraic groups, groups definable in stable, simple and NIP theories, definable compactifications of groups, definable Galois theory (including differential Galois theory), connections with topological dynamics, model theory of the free group.

math.LO↗

Saturated Free Algebras and Almost Indiscernible Theories

We extend the concept of "almost indiscernible theory" introduced by Pillay and Sklinos in [Bull. Symb. Log., 2015] (which was itself a modernization and expansion of Baldwin and Shelah [Algebra Universalis, 1983]), to uncountable languages and uncountable parameter sequences. Roughly speaking a theory $T$ is almost indiscernible if some saturated model is in the algebraic closure of an indiscernible set of sequences. We show that such a theory $T$ is nonmultidimensional, superstable, and stable in all cardinals $\ge |T |$ . We prove a structure theorem for sufficiently large $a$-models $M$: Theorem 2.10 which states that over a suitable base, $M$ is in the algebraic closure of an independent set of realizations of weight one types (in possibly infinitely many variables). We also explore further the saturated free algebras of Baldwin and Shelah in both the countable and uncountable context. We study in particular theories and varieties of $R$-modules, characterizing those rings $R$ for which the free $R$-module on $|R|^+$ generators is saturated (Theorem 3.15), and pointing out a counterexample to a conjecture from Pillay-Sklinos (Example 3.16).

math.LO↗

Multi-experiment parameter identifiability of ODEs and model theory

Structural identifiability is a property of an ODE model with parameters that allows for the parameters to be determined from continuous noise-free data. This is a natural prerequisite for practical identifiability. Conducting multiple independent experiments could make more parameters or functions of parameters identifiable, which is a desirable property to have. How many experiments are sufficient? In the present paper, we provide an algorithm to determine the exact number of experiments for multi-experiment local identifiability and obtain an upper bound that is off at most by one for the number of experiments for multi-experiment global identifiability. Interestingly, the main theoretical ingredient of the algorithm has been discovered and proved using model theory (in the sense of mathematical logic). We hope that this unexpected connection will stimulate interactions between applied algebra and model theory, and we provide a short introduction to model theory in the context of parameter identifiability. As another related application of model theory in this area, we construct a nonlinear ODE system with one output such that single-experiment and multiple-experiment identifiability are different for the system. This contrasts with recent results about single-output linear systems. We also present a Monte Carlo randomized version of the algorithm with a polynomial arithmetic complexity. Implementation of the algorithm is provided and its performance is demonstrated on several examples. The source code is available at https://github.com/pogudingleb/ExperimentsBound.

math.AG↗