[Paper Review] Dependent theories and the generic pair conjecture

Saharon Shelah|arXiv (Cornell University)|Feb 10, 2007

Advanced Topology and Set Theory6 references4 citations

TL;DR

This paper develops a decomposition theorem for complete types over $κ$-saturated models in dependent (NIP) first-order theories, combining stable and tree-like structural features. It proves the generic pair conjecture for measurable cardinals $κ$ under $2^\u03ba = \u03ba^+$, showing that for a $\kappa^+$-saturated chain of models, generic pairs $(M_\delta, M_\alpha)$ with $\text{cf}(\delta) = \kappa$ are isomorphic, yielding $\mathbb{L}_{\infty,\kappa}(\tau_T)$-equivalence.

ABSTRACT

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory is the combination of the one for stable theories and the one for the theory of dense linear order or trees (and first we should try to understand the quite saturated case). As a measure of our progress, we give several applications considering some test questions; in particular we try to prove the generic pair conjecture and do it for measurable cardinals.

Motivation & Objective

• To understand complete types over $\kappa$-saturated models in dependent (NIP) theories by decomposing them into stable-like and tree-like components.
• To establish a structural picture of dependent theories as a hybrid of stable theories and dense linear orders or trees.
• To prove the generic pair conjecture for measurable cardinals, confirming that generic pairs of models of the same theory are isomorphic under certain saturation and cardinality conditions.
• To characterize exact $\kappa$-saturation and the existence of indiscernible sets in dependent theories, particularly under GCH.
• To develop a strict decomposition framework for types over $\kappa$-saturated models when $\kappa$ is measurable, enabling analysis of generic pairs.

Proposed method

• Introduces the concept of $\kappa$-saturated models and uses the notion of $\kappa$-exact saturation to analyze type behavior.
• Develops a two-step decomposition of types into pseudo-stable and tree-like parts via the classes $K_\ell$ and $\text{mx}K^\ell_{\lambda,\kappa,\theta}$.
• Defines a partial order $\leq_{\text{AP}}$ on 'approximate pairs' (AP) to analyze embeddings between models and build chains of decompositions.
• Uses club sets of ordinals of cofinality $\kappa$ to identify isomorphism types of generic pairs in $\kappa^+$-saturated chains.
• Applies the strict decomposition theorem to show that increasing sequences of strict $(\kappa,\theta)$-decompositions have limits, enabling inductive constructions.
• Establishes $\mathbb{L}_{\infty,\kappa}(\tau_T)$-equivalence of generic pairs under $2^\kappa = \kappa^+$ and $\kappa = \kappa^{<\kappa}$, implying a derived first-order theory.

Experimental results

Research questions

• RQ1 Can complete types over $\kappa$-saturated models in dependent theories be decomposed into stable-like and tree-like components?
• RQ2 Does the generic pair conjecture hold for measurable cardinals in dependent theories?
• RQ3 Under what conditions does a dependent theory admit a model of singular exact saturation?
• RQ4 What characterizes the spectrum of a 1-type over a sufficiently saturated model in a dependent theory?
• RQ5 Can the structure of generic pairs of models be captured via $\mathbb{L}_{\infty,\kappa}(\tau_T)$-equivalence?

Key findings

• The Type Decomposition Theorem (2.4) establishes a two-part decomposition of types over $\kappa$-saturated models into pseudo-stable and tree-like components.
• For a measurable cardinal $\kappa > |T|$ with $2^\kappa = \kappa^+$, the generic pair conjecture holds: generic pairs $(M_\delta, M_\alpha)$ with $\text{cf}(\delta) = \kappa$ are isomorphic.
• A club $E \subseteq \kappa^+$ of ordinals of cofinality $\kappa$ exists such that for $\alpha < \beta$ in $E$, the pairs $(M_\beta, M_\alpha)$ are isomorphic.
• The generic pair conjecture implies $\mathbb{L}_{\infty,\kappa}(\tau_T)$-equivalence of such pairs, yielding a derived first-order theory.
• The existence of an indiscernible set in a dependent theory suffices for exact $\kappa$-saturation under GCH, and such models have a neat characterization.
• An increasing sequence of strict $(\kappa,\theta)$-decompositions has a limit, enabling the construction of isomorphisms between generic pairs.