Metraipolis › archive › dc_8469243ca4e9
Fréchet inequalities — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Fr%C3%A9chet_inequalities
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T18:04:44.177Z
- SHA-256 of the archived text
0c18d67268655991d34d218e10f2ed250c3c506cb27ee062fd8bc4a4978d8081- Stable URL of this page
https://metraipolis.com/documento/dc_8469243ca4e9
How to cite
Fréchet inequalities — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Fr%C3%A9chet_inequalities (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_8469243ca4e9 (Metraipolis archive dc_8469243ca4e9, sha256 0c18d67268655991d34d218e10f2ed250c3c506cb27ee062fd8bc4a4978d8081)
BibTeX
@misc{dc8469243ca4e9,
title = {Fréchet inequalities — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Fr%C3%A9chet_inequalities},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_8469243ca4e9; sha256 0c18d67268655991d34d218e10f2ed250c3c506cb27ee062fd8bc4a4978d8081},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Fr%C3%A9chet_inequalities. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In probabilistic logic, the Fréchet inequalities, also known as the Boole–Fréchet inequalities, are rules implicit in the work of George Boole and explicitly derived by Maurice Fréchet that govern the combination of probabilities about logical propositions or events logically linked together in conjunctions (AND operations) or disjunctions (OR operations) as in Boolean expressions or fault or event trees common in risk assessments, engineering design and artificial intelligence. These inequalities can be considered rules about how to bound calculations involving probabilities without assuming independence or, indeed, without making any dependence assumptions whatsoever. The Fréchet inequalities are closely related to the Boole–Bonferroni–Fréchet inequalities, and to Fréchet bounds. If Ai are logical propositions or events, the Fréchet inequalities are Probability of a logical conjunction ( ∧ {\displaystyle \land } ) max ( 0 , ∑ k = 1 n P ( A k ) − ( n − 1 ) ) ≤ P ( ⋀ k = 1 n A k ) ≤ min k { P ( A k ) } , {\displaystyle \max \left(0,\,\sum _{k=1}^{n}\mathbb {P} (A_{k})-(n-1)\right)\leq \mathbb {P} \left(\bigwedge _{k=1}^{n}A_{k}\right)\leq \min _{k}\{\mathbb {P} (A_{k})\},} Probability of a logical disjunction ( ∨ {\displaystyle \lor } ) max k { P ( A k ) } ≤ P ( ⋁ k = 1 n A k ) ≤ min ( 1 , ∑ k = 1 n P ( A k ) ) , {\displaystyle \max _{k}\{\mathbb {P} (A_{k})\}\leq \mathbb {P} \left(\bigvee _{k=1}^{n}A_{k}\right)\leq \min \left(1,\,\sum _{k=1}^{n}\mathbb {P} (A_{k})\right),} where P( ) denotes the probability of an event or proposition. In the case where there are only two events, say A and B, the inequalities reduce to Probability of a logical conjunction ( ∧ {\displaystyle \land } ) max ( 0 , P ( A ) + P ( B ) − 1 ) ≤ P ( A ∧ B ) ≤ min ( P ( A ) , P ( B ) ) , {\displaystyle \max(0,\,\mathbb {P} (A)+\mathbb {P} (B)-1)\leq \mathbb {P} (A\land B)\leq \min(\mathbb {P} (A),\,\mathbb {P} (B)),} Probability of a logical disjunction ( ∨ {\displaystyle \lor } ) max ( P ( A ) , P ( B ) ) ≤ P ( A ∨ B ) ≤ min ( 1 , P ( A ) + P ( B ) ) . {\displaystyle \max(\mathbb {P} (A),\,\mathbb {P} (B))\leq \mathbb {P} (A\lor B)\leq \min(1,\,\mathbb {P} (A)+\mathbb {P} (B)).} The inequalities bound the probabilities of the two kinds of joint events given the probabilities of the individual events. For example, if A is "has lung cancer", and B is "has mesothelioma", then A & B is "has both lung cancer and mesothelioma", and A ∨ B is "has lung cancer or mesothelioma or both diseases", and the inequalities relate the risks of these events. Note that logical conjunctions are denoted in various ways in different fields, including AND, &, ∧ and graphical AND-gates. Logical disjunctions are likewise denoted in various ways, including OR, |, ∨, and graphical OR-gates. If events are taken to be sets rather than logical propositions, the set-theoretic versions of the Fréchet inequalities are Probability of an intersection of events max ( 0 , P ( A ) + P ( B ) − 1 ) ≤ P ( A ∩ B )
Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «zero-knowledge proof»).
Fonte: Wikipedia in inglese, voce «Fréchet inequalities» — https://en.wikipedia.org/wiki/Fr%C3%A9chet_inequalities
Wikidata Q5506660 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5506660
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Fr%C3%A9chet_inequalities?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 1316998057, consultata il 2026-10-15T17:15:51.146Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 6375037095df9419e58f387434266d04a1ef2fe8314047c8590a4487cf3f4520