MathIsimple

Probability Theory – Problem 15: Determine all possible distributions of

Question

Let XX be a random variable. Suppose there exists a random variable YY, independent of XX, such that both YY and X+YX+Y follow Poisson distributions. Determine all possible distributions of XX.

Step-by-step solution

Step 1. Define the probability generating function. For a random variable ξ\xi, define its probability generating function (PGF) as Gξ(s)=E[sξ]=k=0P(ξ=k)skG_{\xi}(s) = E[s^{\xi}] = \sum_{k=0}^{\infty} P(\xi=k)s^k. For a Poisson distribution with parameter λ\lambda, the PGF is: G(s)=eλ(s1)G(s) = e^{\lambda(s-1)}

Step 2. Set up the parameters and express the PGFs of YY and X+YX+Y. Let YP(λ)Y \sim P(\lambda) with λ>0\lambda > 0. Then: GY(s)=eλ(s1)G_{Y}(s) = e^{\lambda(s-1)} Let Z=X+YZ = X + Y with ZP(μ)Z \sim P(\mu) and μ>0\mu > 0. Then: GZ(s)=eμ(s1)G_{Z}(s) = e^{\mu(s-1)}

Step 3. Apply the independence property. Since XX and YY are independent, the PGF of their sum Z=X+YZ = X + Y equals the product of their individual PGFs: GZ(s)=GX(s)GY(s)G_{Z}(s) = G_{X}(s) \cdot G_{Y}(s)

Step 4. Solve for GX(s)G_{X}(s). Substituting the known expressions into the equation above: eμ(s1)=GX(s)eλ(s1)e^{\mu(s-1)} = G_{X}(s) \cdot e^{\lambda(s-1)} Solving yields: GX(s)=eμ(s1)eλ(s1)=eμ(s1)λ(s1)=e(μλ)(s1)G_{X}(s) = \frac{e^{\mu(s-1)}}{e^{\lambda(s-1)}} = e^{\mu(s-1) - \lambda(s-1)} = e^{(\mu - \lambda)(s-1)}

Step 5. Identify the distribution. Observe that GX(s)=e(μλ)(s1)G_{X}(s) = e^{(\mu - \lambda)(s-1)} is precisely the PGF of a Poisson distribution with parameter θ=μλ\theta = \mu - \lambda. This implies that XX must follow a Poisson distribution with parameter μλ\mu - \lambda.

Step 6. Discuss the validity of the parameter. For XX to be a well-defined random variable (with non-negative probabilities), the corresponding Poisson parameter must be non-negative. That is, we require μλ0\mu - \lambda \geqslant 0, i.e., μλ\mu \geqslant \lambda. * Case 1: If μ<λ\mu < \lambda, then the resulting P(X=k)P(X=k) would alternate in sign or become complex, which does not constitute a valid probability distribution. Hence this case is impossible under the hypothesis that X+YX+Y is Poisson with XX and YY independent (the parameter of X+YX+Y must be at least that of YY). * Case 2: If μ=λ\mu = \lambda, then GX(s)=e0=1G_{X}(s) = e^{0} = 1. This corresponds to the degenerate Poisson distribution (parameter 0), i.e., P(X=0)=1P(X=0)=1, so XX is the constant 0. * Case 3: If μ>λ\mu > \lambda, then XP(μλ)X \sim P(\mu - \lambda), a standard Poisson distribution.

Step 7. Conclusion. XX follows a Poisson distribution P(θ)P(\theta) with parameter θ0\theta \geqslant 0. Specifically, if YP(λ)Y \sim P(\lambda) and X+YP(μ)X+Y \sim P(\mu), then XP(μλ)X \sim P(\mu - \lambda), and the constraint μλ\mu \geqslant \lambda must hold.

Final answer

XX follows a Poisson distribution (including the degenerate case with parameter 0).

Marking scheme

The following rubric is based on the official solution approach:

1. Checkpoints (max 7 pts total)

Score exactly one chain | take the maximum subtotal among chains; do not add points across chains.

Chain A: Transform Method (PGF / Characteristic Function / MGF) (Recommended Approach)

  • Establish the transform relation (2 pts) [additive]:
  • Introduce an appropriate transform tool (e.g., PGF G(s)G(s), characteristic function ϕ(t)\phi(t), or MGF M(t)M(t)).
  • And invoke the independence of XX and YY to write down the product relation explicitly (e.g., GX+Y(s)=GX(s)GY(s)G_{X+Y}(s) = G_X(s) \cdot G_Y(s)).
  • *If only the definition is stated without establishing the relation between XX and X+YX+Y, award 0 pts.*
  • Compute the transform of XX (2 pts) [additive]:
  • Substitute the specific Poisson transform formula (e.g., eλ(s1)e^{\lambda(s-1)} or eλ(eit1)e^{\lambda(e^{it}-1)}).
  • Use algebraic manipulation to correctly solve for the transform of XX (e.g., GX(s)=eμ(s1)eλ(s1)=e(μλ)(s1)G_X(s) = \frac{e^{\mu(s-1)}}{e^{\lambda(s-1)}} = e^{(\mu-\lambda)(s-1)}).
  • Identify the distribution type (2 pts) [additive]:
  • Based on the derived functional form, explicitly state that XX follows a Poisson distribution with parameter μλ\mu - \lambda.
  • *If only the transform expression is given without naming the distribution, deduct 1 pt.*
  • Discussion of parameter validity (1 pt) [additive]:
  • State that the parameter must be non-negative (μλ\mu \ge \lambda or μλ0\mu - \lambda \ge 0), or discuss the degenerate case μ=λ\mu = \lambda where XX reduces to the constant 0.
  • *If the parameter range is not discussed, no credit for this item.*

Chain B: Via Raikov's Theorem (and Cumulant / Characteristic Function Analysis)

  • Cite the decomposition theorem (4 pts) [additive]:
  • Explicitly invoke Raikov's theorem (or the equivalent application of Cramer's decomposition theorem to the Poisson distribution), arguing that if the sum of independent random variables follows a Poisson distribution, then each summand must itself follow a Poisson distribution.
  • *Note: This is the key theoretical justification for the existence of the distributional form; the theorem name or its content must be explicitly mentioned.*
  • Determine the parameter (2 pts) [additive]:
  • Use the additivity of expectations, variances, or cumulants (e.g., E[X+Y]=E[X]+E[Y]E[X+Y] = E[X] + E[Y]) to correctly derive that the parameter of XX is μλ\mu - \lambda.
  • Discussion of parameter validity (1 pt) [additive]:
  • State that the parameter must be non-negative (μλ\mu \ge \lambda).

Total (max 7)


2. Zero-credit items

  • Merely copying the given conditions from the problem statement (e.g., XYX \perp Y, YP(λ)Y \sim P(\lambda)).
  • Merely listing the Poisson probability formula (P(X=k)=P(X=k)=\dots) without any concrete steps toward deriving the distribution of XX.
  • Conjecturing that XX follows some other distribution (e.g., binomial, normal) and attempting verification, leading to contradictions or computational errors.

3. Deductions

  • Logical inversion / circular reasoning (Cap at 3/7):
  • The student uses only the property that the sum of two independent Poisson random variables is Poisson (a sufficient condition) to directly assert that XX must be Poisson (necessity), without employing the transform method to prove uniqueness or citing Raikov's theorem. Such a solution is considered logically incomplete and is capped at 3 pts (awarded for parameter computation and conclusion).
  • Missing parameter range (Flat -1):
  • Derives XP(μλ)X \sim P(\mu-\lambda) but does not mention the constraint μλ\mu \ge \lambda.
  • Symbol confusion (Flat -1):
  • Confuses random variables (uppercase XX) with their realizations or parameters during the derivation, resulting in unclear logical exposition.
Ask AI ✨