Finite basis for analytic multiple gaps

Abstract

An n-gap consists of n many pairwise orthogonal families of subsets of a countable set that cannot be separated. We prove that for every positive integer n there is a finite basis for the class of analytic n-gaps. The proof requires an analysis of certain combinatorial problems on the n-adic tree, and in particular a new partition theorem for trees.