Constructive Proofs of Generalized Boole--Frechet Bounds: A Dynamic Programming Approach
Probability
2025-12-11 v1
Abstract
Extensions of the Boole--Frechet inequalities give sharp bounds for the probabilities of compound events, particularly when only the probabilities of atomic events (that make up the compound events) are known. We present a constructive approach to obtaining generalized Boole--Frechet bounds using dynamic programming.
Cite
@article{arxiv.2512.09161,
title = {Constructive Proofs of Generalized Boole--Frechet Bounds: A Dynamic Programming Approach},
author = {Kizito Salako},
journal= {arXiv preprint arXiv:2512.09161},
year = {2025}
}