We investigate Keisler measures in arbitrary theories. Our initial focus is on Borel definability. We show that when working over countable parameter sets in countable theories, Borel definable measures are closed under Morley products and satisfy associativity. However, we also demonstrate failures of both properties over uncountable parameter sets. In particular, we show that the Morley product of Borel definable types need not be Borel definable (correcting an erroneous result from the literature). We then study various notions of generic stability for Keisler measures and generalize several results from the NIP setting to arbitrary theories. We also prove some positive results for the class of frequency interpretation measures in arbitrary theories, namely, that such measures are closed under convex combinations and commute with all Borel definable measures. Finally, we construct the first example of a complete type which is definable and finitely satisfiable in a small model, but not finitely approximated over any small model.
We study generically stable measures in the local, NIP context. We show that in this setting, a measure is generically stable if and only if it admits a natural finite approximation.
This paper is a modified chapter of the author's Ph.D. thesis. We introduce the notions of sequentially approximated types and sequentially approximated Keisler measures. As the names imply, these are types which can be approximated by a sequence of realized types and measures which can be approximated by a sequence of `averaging measures' on tuples of realized types. We show that both generically stable types (in arbitrary theories) and Keisler measures which are finitely satisfiable over a countable model (in NIP theories) are sequentially approximated. We also introduce the notion of a smoo…
We initiate a systematic study of the convolution operation on Keisler measures, generalizing the work of Newelski in the case of types. Adapting results of Glicksberg, we show that the supports of generically stable (or just definable, assuming NIP) measures are nice semigroups, and classify idempotent measures in stable groups as invariant measures on type-definable subgroups. We establish left-continuity of the convolution map in NIP theories, and use it to show that the convolution semigroup on finitely satisfiable measures is isomorphic to a particular Ellis semigroup in this context.
We introduce a combinatorial notion of measures called Rudin-Keisler capturing and use it to give a new construction of elementary substructures around singular cardinals. The new construction is used to establish mutual stationary results at the first successor of singular cardinals $\langle \aleph_{ωn + 1}\rangle_{n< ω}$.
We study forking, Lascar strong types, Keisler measures and definable groups, under an assumption of $NIP$ (not the independence property), continuing aspects of math.LO/0607442. Among key results are: (i) if $p = tp(b/A)$ does not fork over $A$ then the Lascar strong type of $b$ over $A$ coincides with the compact strong type of $b$ over $A$ and any global nonforking extension of $p$ is Borel definable over $bdd(A)$ (ii) analogous statements for Keisler measures and definable groups, including the fact that $G^{000} = G^{00}$ for $G$ definably amenable, (iii) definitions, characterizations an…
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…
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（弗罗茨瓦夫大学数学研究所）
We discuss two constructions for obtaining generically stable Keisler measures in an NIP theory. First, we show how to symmetrize an arbitrary invariant measure to obtain a generically stable one from it. Next, we show that suitable sigma-additive probability measures give rise to generically stable measures. Also included is a proof that generically stable measures over o-minimal theories and the p-adics are smooth.
Motivated by Keisler's order, a far-reaching program of understanding basic model-theoretic structure through the lens of regular ultrapowers, we prove that for a class of regular filters $D$ on $I$, $|I| = λ> \aleph_0$, the fact that $P(I)/\de$ has little freedom (as measured by the fact that any maximal antichain is of size $<λ$, or even countable) does not prevent extending $D$ to an ultrafilter $D_1$ on $I$ which saturates ultrapowers of the random graph. "Saturates" means that $M^I/\de_1$ is $λ^+$-saturated whenever M is a model of the theory of the random graph. This was known to be true…
In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic stability for types coincides with the notion of a frequency interpretation measure. We also give combinatorial examples of types in NSOP theories that are finitely approximated but not generically stable, as well as $ϕ$-types in simple theories that are definable and finitely satisfiable in a small model, but not finitely approximated. Our proofs demonstrate in…
The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra B to each formula. We show some basic results regarding the effect of the properties of B on the behavior of such types, and show they are particularity well behaved in the case of NIP theories. In particular, we generalize the third author's result about counting types, as well as the notion of a smooth type and extending a type to a smooth one. We then show that Keisler measures are tied to certain Boolean types and show that some of the results can thus be transfer…
We prove a regularity lemma with respect to arbitrary Keisler measures mu on V, nu on W where the bipartite graph (V,W,R) is definable in a saturated structure M and the formula R(x,y) is stable. The proof is rather quick and uses local stability theory. The special case where (V,W,R) is pseudofinite, mu, nu are the counting measures and M is suitably chosen (for example a nonstandard model of set theory), yields the stable regularity theorem of Malliaris-Shelah (Transactions AMS, 366, 2014, 1551-1585), though without explicit bounds or equitability.
