Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Shared-minimum coupling of two Poisson counts

Statement

Let h≥0 and let λ1,λ2≥0. Let C,R1,R2 be independent counts with laws C∼Pois⁡(hmin⁡(λ1,λ2)),R1∼Pois⁡(h(λ1−λ2)+),R2∼Pois⁡(h(λ2−λ1)+), and set K1=C+R1, K2=C+R2. Then Ki∼Pois⁡(hλi), E(K1−K2)=h(λ1−λ2),Var⁡(K1−K2)=h∣λ1−λ2∣, and Cov⁡(K1,K2)=hmin⁡(λ1,λ2).

Facts & Assumptions

Given: h≥0, nonnegative rates λ1,λ2, and the independent Poisson counts in the Statement.

[F1]

The scalar Poisson count law: for finite θ≥0, Pois⁡(θ) has masses e−θθk/k! for k∈N0, with the zero-parameter law concentrated at 0.

[F2]

Normalization, moments, and generating function of the Poisson count law: a Poisson count with parameter θ has mean and variance θ.

Proof

Given: The independent counts and facts [F1]–[F2].

1.1F1algebra

If A∼Pois⁡(α) and B∼Pois⁡(β) are independent, then for α,β>0 and n∈N0 their convolution is P(A+B=n)=e−(α+β)∑k=0nαkβn−kk!(n−k)!=e−(α+β)(α+β)nn!, by the binomial theorem. If either parameter is zero, the corresponding count is identically zero by [F1], and the same conclusion follows. Thus an independent sum has Poisson law with the sum of its parameters.

2.1step 1.1algebra

Apply step 1.1 to C+R1 and C+R2. Their parameters are respectively hmin⁡(λ1,λ2)+h(λ1−λ2)+=hλ1 and hmin⁡(λ1,λ2)+h(λ2−λ1)+=hλ2. This proves the marginal laws.

3.1F2algebra∎

The shared count cancels in K1−K2=R1−R2. Independence and [F2] give its mean as h(λ1−λ2)+−h(λ2−λ1)+=h(λ1−λ2) and its variance as h(λ1−λ2)++h(λ2−λ1)+=h∣λ1−λ2∣. Also, since R1,R2 are independent of C and of each other, Cov⁡(K1,K2)=Var⁡(C)=hmin⁡(λ1,λ2) by [F2]. This proves all identities.

Depends on

Used by

Dependency tree · two levels

9 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