Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Normalization, moments, and generating function of the Poisson count law

Statement

For finite λ≥0, the masses in The scalar Poisson count law sum to one. If N∼Pois⁡(λ), then E[N]=λ,E[N(N−1)]=λ2,E[N2]=λ2+λ,Var⁡(N)=λ, and E[sN]=exp⁡(λ(s−1)) for 0≤s≤1.

Facts & Assumptions

Given: A finite parameter λ≥0 and the mass formula in The scalar Poisson count law.

[F1]

For λ>0, the mass at k is e−λλk/k!; at λ=0 the law is concentrated at 0. (The scalar Poisson count law)

[F2]

The real exponential is defined by the convergent power series ex=∑k≥0xk/k! and satisfies eaeb=ea+b. (The real exponential function and the number e by a power series, The exponential addition formula exp⁡(x+y)=exp⁡(x)exp⁡(y))

[F3]

Expectation is integration against the probability law, and variance is E[(N−EN)2] when the second moment is finite. (Expectation of a nonnegative or integrable random variable, Moments, variance, and covariance on a probability space)

Proof

technique · direct
1.1givenF1

If λ=0, [F1] puts all mass at 0, so the masses sum to one and the stated moments and generating function have their asserted values.

1.2givenF1F2algebra

Suppose λ>0. By [F1] and the defining exponential series [F2], ∑k=0∞e−λλkk!=e−λeλ=1. Thus the displayed masses normalize to a probability law.

2.1step 1.2F1F2F3algebra

Using [F1] and reindexing the nonnegative series, E[N]=e−λ∑k=1∞kλkk!=λe−λ∑j=0∞λjj!=λ.

3.1step 2.1F1F2F3algebra

Reindexing with j=k−2 gives E[N(N−1)]=e−λ∑k=2∞k(k−1)λk/k!=λ2e−λ∑j=0∞λj/j!=λ2 by [F2]. Since N2=N(N−1)+N, this and step 2.1 yield E[N2]=λ2+λ and hence Var⁡(N)=E[N2]−(EN)2=λ.

4.1step 1.1F1F2algebra∎

For 0≤s≤1, [F1] and [F2] give E[sN]=e−λ∑k=0∞(λs)kk!=e−λeλs=eλ(s−1). Together with step 1.1 this proves the generating-function formula also at λ=0.

Depends on

Used by

Cited to discharge well-definedness by The scalar Poisson count law.

Dependency tree · two levels

36 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources