We study invariant types in NIP theories. Amongst other things: we prove a definable version of the [Formula: see text]-theorem in theories of small or medium directionality; we construct a canonical retraction from the space of [Formula: see text]-invariant types to that of [Formula: see text]-finitely satisfiable types; we show some amalgamation results for invariant types and list a number of open questions.

We use exact saturation to study the complexity of unstable theories, showing that a variant of this notion called pseudo-elementary class (PC)-exact saturation meaningfully reflects combinatorial dividing lines. We study PC-exact saturation for stable and simple theories. Among other results, we show that PC-exact saturation characterizes the stability cardinals of size at least continuum of a countable stable theory and, additionally, that simple unstable theories have PC-exact saturation at singular cardinals satisfying mild set-theoretic hypotheses. This had previously been open even (...) for the random graph. We characterize supersimplicity of countable theories in terms of having PC-exact saturation at singular cardinals of countable cofinality. We also consider the local analog of PC-exact saturation, showing that local PC-exact saturation for singular cardinals of countable cofinality characterizes supershort theories. (shrink)