Metraipolis › archive › dc_5b3b752bf452
Ahlswede–Daykin inequality — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Ahlswede%E2%80%93Daykin_inequality
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T14:24:56.695Z
- SHA-256 of the archived text
1d9eb73e18c35e94b01c51f91634d36573760e812d3af3b7e5cdaf234d6ef383- Stable URL of this page
https://metraipolis.com/documento/dc_5b3b752bf452
How to cite
Ahlswede–Daykin inequality — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Ahlswede%E2%80%93Daykin_inequality (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5b3b752bf452 (Metraipolis archive dc_5b3b752bf452, sha256 1d9eb73e18c35e94b01c51f91634d36573760e812d3af3b7e5cdaf234d6ef383)
BibTeX
@misc{dc5b3b752bf452,
title = {Ahlswede–Daykin inequality — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Ahlswede%E2%80%93Daykin_inequality},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5b3b752bf452; sha256 1d9eb73e18c35e94b01c51f91634d36573760e812d3af3b7e5cdaf234d6ef383},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Ahlswede%E2%80%93Daykin_inequality. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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).
Tema degli esploratori: fisica e astronomia (deposito sistematico; categoria «Statistical mechanics»).
Fonte: Wikipedia in inglese, voce «Ahlswede–Daykin inequality» — https://en.wikipedia.org/wiki/Ahlswede%E2%80%93Daykin_inequality
Wikidata Q4695203 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4695203
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Ahlswede%E2%80%93Daykin_inequality?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1373728948, consultata il 2026-10-15T13:54:48.301Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 5c8e003551380651db4aa30d4ce898d73ed48fb74582d3aafff71fa92daf9819