We give several characterizations of when a complete first-order theory T T is monadically NIP, i.e. when expansions of T T by arbitrary unary predicates do not have the independence property. The central characterization is a condition on finite satisfiability of types. Other characterizations include decompositions of models, the behavior of indiscernibles, and a forbidden configuration. As an application, we prove non-structure results for hereditary classes of finite substructures of non-monadically NIP models that eliminate quantifiers.
more »
« less
This content will become publicly available on July 25, 2026
Indiscernibles in monadically NIP theories
Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories. Here, via finite combinatorics, we prove a result implying that every planar graph admits a distal expansion. Finally, we prove a result implying that no monadically NIP theory interprets an infinite group, and note an example of a (monadically) stable theory with no distal expansion that does not interpret an infinite group.
more »
« less
- Award ID(s):
- 2154101
- PAR ID:
- 10618370
- Publisher / Repository:
- London Math Society (Wiley)
- Date Published:
- Journal Name:
- Bulletin of the London Mathematical Society
- ISSN:
- 0024-6093
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The authors correct results in “Characterizations of monadic NIP” [Trans. Amer. Math. Soc. Ser. B 8 (2021), pp. 948–970]. The notion of endless indiscernible triviality is introduced and replaces indiscernible triviality throughout, in particular in Theorem 1.1. The claim regarding the failure of 4-wqo in Theorem 1.2 is withdrawn and remains unproved.more » « less
-
Abstract We introduce and study (weakly) semi-equational theories, generalizing equationality in stable theories (in the sense of Srour) to the NIP context. In particular, we establish a connection to distality via one-sided strong honest definitions; demonstrate that certain trees are semi-equational, while algebraically closed valued fields are not weakly semi-equational; and obtain a general criterion for weak semi-equationality of an expansion of a distal structure by a new predicate.more » « less
-
Abstract We prove a dichotomy for o‐minimal fields , expanded by a ‐convex valuation ring (where is the theory of ) and a compatible monomial group. We show that if is power bounded, then this expansion of is model complete (assuming that is), it has a distal theory, and the definable sets are geometrically tame. On the other hand, if defines an exponential function, then the natural numbers are externally definable in our expansion, precluding any sort of model‐theoretic tameness.more » « less
-
Fix a weakly minimal (i.e. superstable [Formula: see text]-rank [Formula: see text]) structure [Formula: see text]. Let [Formula: see text] be an expansion by constants for an elementary substructure, and let [Formula: see text] be an arbitrary subset of the universe [Formula: see text]. We show that all formulas in the expansion [Formula: see text] are equivalent to bounded formulas, and so [Formula: see text] is stable (or NIP) if and only if the [Formula: see text]-induced structure [Formula: see text] on [Formula: see text] is stable (or NIP). We then restrict to the case that [Formula: see text] is a pure abelian group with a weakly minimal theory, and [Formula: see text] is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of [Formula: see text]. Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form [Formula: see text]. Most notably, we show that if [Formula: see text] is a weakly minimal additive subgroup of the algebraic numbers, [Formula: see text] is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of [Formula: see text] is a root of unity, then [Formula: see text] is superstable for any [Formula: see text].more » « less
An official website of the United States government
