The proposed cumulative distribution function satisfies and is smooth. Its derivative isso 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.
Every cumulative distribution function is nondecreasing, right-continuous, valued in , and has limits at and at . For a continuous random variable it is continuous. When a probability density function exists, it is in fact absolutely continuous, with nonnegative derivative almost everywhere.
The cumulative distribution function is . In the absolutely continuous setting of a probability density function, the probability density function is a nonnegative integrable function satisfyingThus 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 yieldsFor 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 hasAt 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 givesincluding the empty product when . Taking expectation over proves the probability generating function of an independent random sum formulaThe 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 .
This is the geometric distribution on with success parameter . Its probability generating function is a geometric series:
For a nonnegative integer-valued random variable, its probability generating function isThe 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 giveApply 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 . ThusIndeed for , and taking the positive integer power preserves this strict inequality. This proves the negative covariance directly.
Write , the probability that all balls avoid a specified box. Each of the empty-box indicators in uniform allocation is an indicator random variable with success probability . Since , its expectation and variance are
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. ThereforeThis also covers , when the answer is zero.
In the uniform balls-in-bins allocation, each ball enters box 1 independently with probability . Thus has the binomial distribution , with probability mass functionand zero outside that range.
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.
Every nonzero integer has , proving reflexivity. Because , the relation is symmetric. If and , then , proving transitivity. Thus this is an equivalence relation, whose two equivalence classes are the positive integers and the negative integers:
This binary relation is not an equivalence relation, because it is not symmetric: since , but is false. In fact the injective encoding gives a total order. There are no equivalence classes for this binary relation.
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 isFor this is the circle centred at the origin with radius ; the remaining equivalence class is the singleton .
A binary relation is an equivalence relation precisely when it is reflexive, symmetric, and transitive.
There are unlisted articles, also show them or only show them.