An information-theoretic proof of a finite de finetti theorem

Abstract

A finite form of de Finetti’s representation theorem is established using elementary information-theoretic tools: The distribution of the first k random variables in an exchangeable binary vector of length n ≥ k is close to a mixture of product distribu-tions. Closeness is measured in terms of the relative entropy and an explicit bound is provided.