PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 26, 2026Selecta Mathematica0 citationsOpen Access

On first order amenability

EHEhud HrushovskiKKKrzysztof KrupińskiAPAnand. Pillay

Key Points

  • This research aims to define and explore first order amenability and its relationship to global Keisler measures.
  • Introduced the concept of first order amenability in a first order theory.
  • Examined properties of amenable theories and established equivalent conditions.
  • Utilized a stabilizer theorem to demonstrate G-compactness in amenable theories.
  • If a theory is amenable, it is shown to be G-compact, indicating strong type coincidences.
  • Provided a new proof for amenability in cases using definable global Keisler measures.
  • Extended earlier findings regarding ω-categorical theories to a broader context.

Abstract

Abstract We introduce the notion of first order amenability, as a property of a first order theory T: every complete type over ∅, in possibly infinitely many variables, extends to an automorphism-invariant global Keisler measure in the same variables. Amenability of T follows from amenability of the (topological) group {\, {Aut\, }} (M) Aut (M) for all sufficiently large ₀ ℵ 0 -homogeneous countable models M of T (assuming T to be countable), but is radically less restrictive. First, we study basic properties of amenable theories, giving many equivalent conditions. Then, applying a version of the stabilizer theorem from Selecta Math. (N. S. ) 28, 16 (2022), we prove that if T is amenable, then T is G -compact, namely Lascar strong types and Kim-Pillay strong types over ∅ coincide. This extends and essentially generalizes a similar result proved via different methods for ω -categorical theories in Adv. Math. 345, 1253–1299 (2019). In the special case when amenability is witnessed by ∅ -definable global Keisler measures (which is for example the case for amenable ω -categorical theories), we also give a different proof, based on stability in continuous logic. Parallel (but easier) results hold for the notion of extreme amenability.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Hrushovski et al. (2026) studied this question.

synapsesocial.com/papers/699fe44895ddcd3a253e86f2https://doi.org/10.1007/s00029-026-01125-1
Ask AI
Helpful
Bookmark
Share
View Full Paper