Axiomatic Theory of Independence Relations in Model Theory

TL;DR

This paper develops an axiomatic framework for independence relations in model theory, linking set-theoretic concepts with model-theoretic properties, and explores their applications to forking, dividing, and simplicity.

Contribution

It introduces a comprehensive axiomatic approach to independence relations, connecting naive set theory with advanced model-theoretic concepts and providing new insights into symmetry and simplicity.

Findings

Adler independence relations satisfy symmetry under certain axioms

Dividing independence is stronger than Adler independence relations

Existence of Adler independence relations implies simplicity

Abstract

This course introduces the fruitful links between model theory and a combinatoric of sets given by independence relations. An independence relation on a set is a ternary relation between subsets. Chapter 1 should be considered as an introductory chapter. It does not mention first-order theories or formulas. It introduces independence relations in a naive set theory framework. Its goal is to get the reader familiar with basic axioms of independence relations (which do not need an ambient theory to be stated) as well as introduce closure operators and pregeometries. Chapter 2 introduces the model-theoretic context. The two main examples (algebraically closed fields and the random graph) are described as well as independence relations in those examples. Chapter 3 gives the axioms of independence relations in a model-theoretic context. It introduces the general toolbox of the model-theorists (indiscernible sequences, Ramsey/Erdos-Rado and compactness) and the independence relations of heirs/coheirs with two main applications: Adler's theorem of symmetry (how symmetry emerges from a weaker set of axioms, which is rooted in the work of Kim and Pillay) and a criterion for NSOP4 using stationary independence relations in the style of Conant. Independence relations satisfying Adler's theorem of symmetry are here called 'Adler independence relations' or AIR. Chapter 4 treats forking and dividing. It is proved that dividing independence is always stronger than any AIR (even though it is not an AIR in general) a connection between the independence theorem and forking independence, which holds in all generality and is based on Kim-Pillay's approach. Then, simplicity is defined and the interesting direction of the Kim-Pillay theorem (namely that the existence of an Adler independence relation satisfying the independence theorem yields simplicity) is deduced from earlier results.