Article · Wikipedia archive · Last revised Jul 12, 2026

Ahlswede–Daykin inequality

The Ahlswede–Daykin inequality, also known as the four functions theorem, is a correlation-type inequality for four functions on a finite distributive lattice. It is a fundamental tool in statistical mechanics and probabilistic combinatorics.

Last revised
Jul 12, 2026
Read time
≈ 2 min
Length
513 w
Citations
1
Source

The Ahlswede–Daykin inequality (Ahlswede & Daykin 1978), also known as the four functions theorem (or inequality), is a correlation-type inequality for four functions on a finite distributive lattice. It is a fundamental tool in statistical mechanics and probabilistic combinatorics (especially random graphs and the probabilistic method).

The inequality states that if f 1 , f 2 , f 3 , f 4 {\displaystyle f_{1},f_{2},f_{3},f_{4}} are nonnegative functions on a finite distributive lattice such that

f 1 ( x ) f 2 ( y ) f 3 ( x y ) f 4 ( x y ) {\displaystyle f_{1}(x)f_{2}(y)\leq f_{3}(x\vee y)f_{4}(x\wedge y)}

for all x, y in the lattice, then

f 1 ( X ) f 2 ( Y ) f 3 ( X Y ) f 4 ( X Y ) {\displaystyle f_{1}(X)f_{2}(Y)\leq f_{3}(X\vee Y)f_{4}(X\wedge Y)}

for all subsets X, Y of the lattice, where

f ( X ) = x X f ( x ) {\displaystyle f(X)=\sum _{x\in X}f(x)}

and

X Y = { x y x X , y Y } {\displaystyle X\vee Y=\{x\vee y\mid x\in X,y\in Y\}}
X Y = { x y x X , y Y } . {\displaystyle X\wedge Y=\{x\wedge y\mid x\in X,y\in Y\}.}

The Ahlswede–Daykin inequality can be used to provide a short proof of both the Holley inequality and the FKG inequality. It also implies the XYZ inequality.

For a proof, see the original article (Ahlswede & Daykin 1978) or (Alon & Spencer 2000).

Generalizations

The "four functions theorem" was independently generalized to 2k functions in (Aharoni & Keich 1996) and (Rinott & Saks 1991).

History

The story of the discovery of the Ahlswede–Daykin inequality was described in the Introduction to the A. Ahlswede et al. book:

"The history of the idea of the AD-inequality is very interesting. As Daykin came to a visit to Bielefeld, Ahlswede was just wallpapering. He stood on the ladder, and Daykin wanted to tell him from a newly proven inequality. The declaration was complicated, and Ahlswede said that probably a more general (and easier) theorem should hold. He made directly—on the ladder—a proposal which already was the AD-inequality."1

References

References

  1. Ahlswede, Alexander; Ahlswede, Rudolf; Althöfer, Ingo; Deppe, Christian; Tamm, Ulrich (30 June 2017). Combinatorial Methods and Models: Rudolf Ahlswede’s Lectures on Information Theory 4. Springer. ISBN 978-3-319-53139-7.
Sources

Sources