An official website of the United States government
This paper builds model-theoretic tools to detect changes in complexity among the simple theories. We develop a generalization of dividing, called shearing, which depends on a so-called context c. This leads to defining c-superstability, a syntactical notion, which includes supersimplicity as a special case. The main result is a separation theorem showing that for any countable context and any two theories T1, T2, such that T1 is c-superstable and T2 is c-unsuperstable, and for arbitrarily large mu, it is possible to build models of any theory interpreting both T1 and T2 whose restriction to tau(T1) is mu-saturated and whose restriction to tau(T2) is not aleph1-saturated. (This suggests “c-superstable” is really a dividing line.) The proof uses generalized Ehrenfeucht-Mostowski models, and along the way, we clarify the use of these techniques to realize certain types while omitting others. In some sense, shearing allows us to study the interaction of complexity coming from the usual notion of dividing in simple theories and the more combinatorial complexity detected by the general definition. This work is inspired by our recent progress on Keisler’s order, but does not use ultrafilters, rather aiming to build up the internal model theory of these classes. https://doi.org/10.1090/tran/8513
more »
« less
Shearing in some simple rank one theories
Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along generalized indiscernible sequences. Here we characterize the shearing of the random graph. We then use shearing to distinguish between the random graph and the theories $$T_{n,k}$$, the higher-order analogues of the triangle-free random graph. It follows that shearing is distinct from dividing in simple unstable theories, and distinguishes meaningfully between classes of simple unstable rank one theories. The paper begins with an overview of shearing, and includes open questions.
more »
« less
- PAR ID:
- 10517943
- Publisher / Repository:
- Israel Journal of Mathematics
- Date Published:
- Journal Name:
- Israel Journal of Mathematics
- Volume:
- 257
- Issue:
- 2
- ISSN:
- 0021-2172
- Page Range / eLocation ID:
- 481 to 518
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $$T_m$$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the theories $$T_{n,k}$$, which are the higher-order analogues of the triangle-free random graph. The proof involves building Boolean algebras and ultrafilters ``by hand'' to satisfy certain model theoretically meaningful chain conditions. This may be seen as advancing a line of work going back through Kunen's construction of good ultrafilters in ZFC using families of independent functions. We conclude with a theorem on flexible ultrafilters, and open questions.more » « less
-
The upper tail problem in a random graph asks to estimate the probability that the number of copies of some fixed subgraph in an Erdős‐Rényi random graph exceeds its expectation by some constant factor. There has been much exciting recent progress on this problem. We study the corresponding problem for hypergraphs, for which less is known about the large deviation rate. We present new phenomena in upper tail large deviations for sparse random hypergraphs that are not seen in random graphs. We conjecture a formula for the large deviation rate, that is, the first order asymptotics of the log‐probability that the number of copies of fixed subgraphHin a sparse Erdős‐Rényi randomk‐uniform hypergraph exceeds its expectation by a constant factor. This conjecture turns out to be significantly more intricate compared to the case for graphs. We verify our conjecture when the fixed subgraphHbeing counted is a clique, as well as whenHis the 3‐uniform 6‐vertex 4‐edge hypergraph consisting of alternating faces of an octahedron, where new techniques are required.more » « less
-
Abstract We investigate the notion of a semi-retraction between two first-order structures (in typically different signatures) that was introduced by the second author as a link between the Ramsey property and generalized indiscernible sequences. We look at semi-retractions through a new lens establishing transfers of the Ramsey property and finite Ramsey degrees under quite general conditions that are optimal as demonstrated by counterexamples. Finally, we compare semi-retractions to the category theoretic notion of a pre-adjunction.more » « less
-
Abstract We develop the theory of Kim-independence in the context of NSOP $$_{1}$$ theories satisfying the existence axiom. We show that, in such theories, Kim-independence is transitive and that -Morley sequences witness Kim-dividing. As applications, we show that, under the assumption of existence, in a low NSOP $$_{1}$$ theory, Shelah strong types and Lascar strong types coincide and, additionally, we introduce a notion of rank for NSOP $$_{1}$$ theories.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.1007/s11856-023-2547-z
