[Paper Review] On n-dependence

Artem Chernikov, Daniel Palacín+1 more|arXiv (Cornell University)|Nov 1, 2014

Limits and Structures in Graph Theory11 references3 citations

TL;DR

This paper develops and clarifies the concept of $n$-dependence in model theory, generalizing dependence via the inability to encode random $(n+1)$-partite hypergraphs with definable edges. It characterizes $n$-dependence via counting $φ$-types over finite sets and shows that failure of $n$-dependence is always witnessed by a formula in a single free variable, extending the Sauer–Shelah lemma and resolving a question of Shelah.

ABSTRACT

In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < \omega$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to encode a bipartite random graph with a definable edge relation, $n$-dependence corresponds to the inability to encode a random $(n+1)$-partite $(n+1)$-hypergraph with a definable edge relation. Most importantly, we characterize $n$-dependence by counting $\varphi$-types over finite sets (generalizing Sauer-Shelah lemma and answering a question of Shelah) and in terms of the collapse of random ordered $(n+1)$-hypergraph indiscernibles down to order-indiscernibles (which implies that the failure of $n$-dependence is always witnessed by a formula in a single free variable).

Motivation & Objective

• To clarify and develop foundational combinatorial properties of $n$-dependence, a generalization of dependence in model theory.
• To characterize $n$$-dependence through counting $φ$-types over finite sets, extending the Sauer–Shelah lemma to higher-order dependence.
• To show that failure of $n$-dependence is always witnessed by a formula in a single free variable, via collapse of random ordered $(n+1)$-hypergraph indiscernibles to order-indiscernibles.
• To answer a question posed by Shelah regarding the combinatorial nature of $n$-dependence and its connection to definable hypergraph encodings.

Proposed method

• Introduces and formalizes $n$-dependence as the inability to define a random $(n+1)$-partite $(n+1)$-hypergraph using a single definable edge relation.
• Applies type-counting techniques over finite sets to characterize $n$-dependence, generalizing the Sauer–Shelah lemma to higher-order structures.
• Analyzes indiscernible sequences in random ordered $(n+1)$-hypergraphs and proves their collapse to order-indiscernibles when $n$-dependence fails.
• Uses model-theoretic tools such as indiscernibles and definable hypergraph encodings to establish structural dichotomies in stable-like classes.
• Establishes a logical connection between combinatorial complexity (hypergraph encoding) and model-theoretic tameness (indiscernible collapse).
• Demonstrates that the failure of $n$-dependence is detectable via a single-variable formula, using the collapse of higher-order indiscernibles.

Experimental results

Research questions

• RQ1 How can $n$-dependence be characterized combinatorially in terms of type counting over finite sets, generalizing the Sauer–Shelah lemma?
• RQ2 What is the role of random ordered $(n+1)$-hypergraph indiscernibles in detecting the failure of $n$-dependence?
• RQ3 Does the failure of $n$-dependence always imply the existence of a witness formula in a single free variable?
• RQ4 Can the notion of $n$-dependence be fully captured by the combinatorics of definable hypergraph encodings in $n+1$ parts?
• RQ5 How does $n$-dependence relate to the broader hierarchy of model-theoretic tameness properties?

Key findings

• The paper establishes a precise characterization of $n$-dependence through counting $φ$-types over finite sets, generalizing the Sauer–Shelah lemma to $n$-dependent theories.
• It proves that the failure of $n$-dependence is always witnessed by a formula in a single free variable, via the collapse of random ordered $(n+1)$-hypergraph indiscernibles to order-indiscernibles.
• The structure of definable $(n+1)$-partite $(n+1)$-hypergraphs serves as a canonical witness for $n$-dependence, generalizing the bipartite random graph in the case $n=1$.
• The collapse of indiscernibles provides a strong combinatorial dichotomy: if a theory is not $n$-dependent, then such a collapse fails, and this failure is detectable via a single-variable formula.
• The results resolve a question of Shelah regarding the model-theoretic significance of type-counting in $n$-dependent theories.
• The framework unifies combinatorial type-counting with structural properties of indiscernibles, offering a new tool for analyzing higher-order dependence.