Metraipolis › archive › dc_b76b461c394d
XYZ inequality — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/XYZ_inequality
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T22:58:19.096Z
- SHA-256 of the archived text
a3e69f285c5fe8528a12cbc51b5ea838ca25043e7d0969d1a4aed3bbac6b0efe- Stable URL of this page
https://metraipolis.com/documento/dc_b76b461c394d
How to cite
XYZ inequality — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/XYZ_inequality (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_b76b461c394d (Metraipolis archive dc_b76b461c394d, sha256 a3e69f285c5fe8528a12cbc51b5ea838ca25043e7d0969d1a4aed3bbac6b0efe)
BibTeX
@misc{dcb76b461c394d,
title = {XYZ inequality — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/XYZ_inequality},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_b76b461c394d; sha256 a3e69f285c5fe8528a12cbc51b5ea838ca25043e7d0969d1a4aed3bbac6b0efe},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/XYZ_inequality. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In combinatorial mathematics, the XYZ inequality, also called the Fishburn–Shepp inequality, is an inequality for the number of linear extensions of finite partial orders. The inequality was conjectured by Ivan Rival and Bill Sands in 1981. It was proved by Lawrence Shepp in Shepp (1982). An extension was given by Peter Fishburn in Fishburn (1984). It states that if x, y, and z are incomparable elements of a finite poset, then P ( x ≺ y ) P ( x ≺ z ) ⩽ P ( ( x ≺ y ) ∧ ( x ≺ z ) ) {\displaystyle P(x\prec y)P(x\prec z)\leqslant P((x\prec y)\wedge (x\prec z))} , where P(A) is the probability that a linear order extending the partial order ≺ {\displaystyle \prec } has the property A. In other words, the probability that x ≺ z {\displaystyle x\prec z} increases if one adds the condition that x ≺ y {\displaystyle x\prec y} . In the language of conditional probability, P ( x ≺ z ) ⩽ P ( x ≺ z ∣ x ≺ y ) . {\displaystyle P(x\prec z)\leqslant P(x\prec z\mid x\prec y).} The proof uses the Ahlswede–Daykin inequality.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «combinatorics»).
Fonte: Wikipedia in inglese, voce «XYZ inequality» — https://en.wikipedia.org/wiki/XYZ_inequality
Wikidata Q5454716 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5454716
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/XYZ_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 1285636238, consultata il 2026-10-07T22:36:01.017Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: fe8cedb54b90a4574b6ff103b49bfb1034898375f5f669d5fa1f84f493469709