Because is a nonnegative integer, its indicator function satisfies . Taking expected values proves the upper bound. The finite second moment also gives a finite expected value, by the Cauchy-Schwarz inequality. Applying that inequality to and gives
The assumed positive second moment permits division, yielding
The lower bound is the basic second moment method; the upper bound also follows from Markov's inequality at threshold one. Integer-valuedness is essential for that upper bound, but not for the lower bound. For example, a constant would violate the upper bound.

Articles by others on the same topic (0)

There are currently no matching articles.