The proposed cumulative distribution function satisfies and is smooth. Its derivative is
so it is increasing and continuous, hence right-continuous. As , and ; as , and . Thus it has all the required cumulative distribution function properties, and defines the standard Gumbel distribution.
The cumulative distribution function is . In the absolutely continuous setting of a probability density function, the probability density function is a nonnegative integrable function satisfying
Thus and almost everywhere. A merely continuous cumulative distribution function need not possess a probability density function; the density assumption means absolute continuity.
The extra ancestor multiplies the probability generating function by . The preceding probability generating function of an independent random sum formula therefore yields
For the two roots are . A probability generating function lies in there, so the plus root is impossible. Also gives . Consequently the total progeny with critical geometric offspring has
At the value is , consistent with almost-sure finiteness. For complex , the same expression uses the analytic square root that equals at .
For , condition on . Independence of the descendant total progeny variables gives
including the empty product when . Taking expectation over proves the probability generating function of an independent random sum formula
The same identity holds for complex by absolute convergence.
The ancestor contributes one individual. Given its offspring count , the descendant family rooted at each child is an independent branching process with the same offspring distribution as the original one. Its total progeny therefore has the same distribution as . The independent reproduction choices let these descendant total progeny variables be represented by independent copies , independent of . Hence, on this family-tree construction,
where the sum is zero when .
For a nonnegative integer-valued random variable, its probability generating function is
The series converges absolutely at least for , with in the term; it may converge on a larger domain.
By linearity of expectation, . The variance of a sum and the negative covariance just proved give
Apply Chebyshev's inequality to the empty-box indicators in uniform allocation:
This proves the required concentration of the empty-box fraction. Since , it also yields convergence in probability of to .
Let . The product of two distinct empty-box indicators in uniform allocation is the indicator random variable of both boxes being empty, so . Thus
Indeed for , and taking the positive integer power preserves this strict inequality. This proves the negative covariance directly.
For both boxes to be empty, each ball must avoid two specified boxes. The individual avoidance probability is , and the choices of different balls are independent. Therefore
This also covers , when the answer is zero.
Assume finite second moments and set . By linearity of expectation, centring gives . Expanding its square and using the definitions of variance and covariance,
No independence assumption is required for this variance of a sum identity.
Write . Equality of -values defines an equivalence relation induced by a function: equality is reflexive, symmetric, and transitive, so all three properties hold for . The equivalence class of is
For this is the circle centred at the origin with radius ; the remaining equivalence class is the singleton .

There are unlisted articles, also show them or only show them.