Fishburn, Peter C.; Shepp, Lawrence A. The Ahlswede-Daykin theorem. (English) Zbl 0953.06009 Althöfer, Ingo (ed.) et al., Numbers, information and complexity. Dedicated to Rudolf Ahlswede on the occasion of his 60th birthday. Dordrecht: Kluwer Academic Publishers. 501-516 (2000). Summary: In Z. Wahrscheinlichkeitstheor. Verw. Geb. 43, 183-185 (1978; Zbl 0369.04004), Rudolf Ahlswede and David Daykin published a theorem which says that a certain inequality on nonnegative real-valued functions for pairs of points in a finite distributive lattice extends additively to pairs of lattice subsets. It is an elegant theorem with widespread applications to inequalities for systems of subsets, linear extensions of partially ordered sets, and probabilistic correlation. We review the theorem and its applications, and describe a recent generalization to \(n\)-tuples of points and subsets in distributive lattices. Although many implications of the Ahlswede-Daykin theorem follow from the weaker hypotheses of the widely-cited FKG theorem, several important implications are noted to require the stronger hypotheses of the basic theorem of Ahlswede and Daykin.For the entire collection see [Zbl 0933.00056]. Cited in 1 Document MSC: 06A07 Combinatorics of partially ordered sets 05A05 Permutations, words, matrices 06D05 Structure and representation theory of distributive lattices Keywords:inequality; real-valued functions; pairs of points in a finite distributive lattice; pairs of lattice subsets; generalization to \(n\)-tuples of points; Ahlswede-Daykin theorem Citations:Zbl 0369.04004 PDFBibTeX XMLCite \textit{P. C. Fishburn} and \textit{L. A. Shepp}, in: Numbers, information and complexity. Dedicated to Rudolf Ahlswede on the occasion of his 60th birthday. Dordrecht: Kluwer Academic Publishers. 501--516 (2000; Zbl 0953.06009)