A note on stable Kim-forking
Yvon Bossut
TL;DR
This note introduces weak stable Kim-forking as an NSOP$_1$-theory analogue of stable forking and studies its consequences. It proves that stable Kim-forking over models forces simplicity, while weak stable Kim-forking over models yields NSOP$_1$ without guaranteeing simplicity, clarifying where stability-based arguments can be carried in NSOP$_1$ theories. Concrete examples, such as $T_{eq,P}$ and infinite-dimensional vector spaces with a generic bilinear form, illustrate how stable formulas can witness Kim-forking in practice. The work also develops definability and canonical-base phenomena over algebraically closed sets in the context of $T^{eq}$ and explores the challenges of passing these properties to imaginaries, ending with several open questions for future research. Overall, the paper broadens the transfer of stable-forking techniques to NSOP$_1$ settings and maps out the boundaries and questions surrounding imaginaries and $T^{eq}$.
Abstract
We define weak stable Kim-forking, a notion that generalizes stable forking to the context of NSOP1 theories. We adapt some of the known results on stable forking to this context.
