For increasing containment events in a Bernoulli product space, let , , and
where the sum is ordered and dependency means overlapping coordinate supports. Then
In particular it is at most when , and at most when .
For increasing containment indicators, attach independent Bernoulli selectors of parameter . Janson inequality applied to the selected events gives . Set and apply the exponential Markov bound. The estimates give exponent at most . Optimizing at proves the displayed lower-tail bound, with the dependency sum ordered and excluding the diagonal.
The Janson dependency sum adds over ordered pairs of distinct containment events whose coordinate supports overlap.
For containment-event indicators in a Bernoulli product space,
It follows by exposing the avoidance events in sequence, separating disjoint coordinate supports, and applying Harris' inequality to the remaining decreasing events.

Articles by others on the same topic (1)

The Janson inequality is a result in probability theory, particularly in the context of the study of random variables and dependent events. It provides a bound on the probability that a sum of random variables exceeds its expected value. Specifically, it is often used when dealing with random variables that exhibit some form of dependence.