Reason: Proof of the Poisson moment formulas via simple-function approximation, monotone convergence, exponential-series evaluation, and null-set transfer from the truncated variable. Approved by Aaron.
Step 1 (moments of K). For m∈N define the nonnegative simple functionssm=∑n=0mn21{K=n}, where 1E is 1 on E and 0 off E. The sequence (sm) is nondecreasing and converges pointwise to K2: at each ω, once m≥K(ω) we have sm(ω)=K(ω)2. By the monotone convergence theorem and the integral of simple functions,
To evaluate the series, use n2=n(n−1)+n and split (all terms nonnegative, so the two partial-sum sequences converge separately and add, by the algebra of limits):
using the factorial recursions n!=n(n−1)! and n!=n(n−1)(n−2)! (for n≥1, resp. n≥2; the terms n=0,1 of the first series and n=0 of the second vanish), the index shifts being equalities of partial sums, and the defining series of the exponential function. Hence
Step 2 (transfer to K). Let G={K=K}, so P(Ω∖G)=0. The nonnegative random variables K21Ω∖G and K21Ω∖G have expectation 0 by the null-support principle, and K21G=K21G pointwise. Adding the pieces with additivity of expectation on nonnegative random variables,
E[K2]=E[K21G]+0=E[K21G]=E[K2]−E[K21Ω∖G]=μ+μ2.
In particular K is square-integrable, hence integrable by Square-Integrable Random Variables and the Mean-Square Inner Product. For the first moment, decompose the integrable variable K−K: it vanishes on G, so its positive and negative parts are nonnegative variables vanishing off the null event Ω∖G, each with expectation 0; hence E[K−K]=0 and E[K]=E[K]=μ by linearity.
Step 3 (variance). By Expectation, Variance, and Moments, Var(K)=E[(K−E[K])2]. Expanding (K−μ)2=K2−2μK+μ2 pointwise and using linearity (all terms integrable),