A Brunnian Theorem for Finite Families of Random Variables
Abstract
In 2014, during a study on the connectivity structures of quantum entanglement, I specifically introduced the notion of ''the connectivity structure of a family of random variables'' -- a structure that expresses the dependency relations between the variables in question -- and I stated the following proposition, which can be described as Brunnian in reference to Hermann Brunn's work on links (1892) : "Every finite connectivity structure is that of a family of random variables". At the time, however, I neglected to write down the proof of this assertion, merely providing an intuitive idea of it. The purpose of this article is to present such a proof.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.