Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

Exposure-adjusted Gamma-Poisson conjugate update

Statement

Assume Countable Choice. Let n∈N0, a,b>0, and λ∼Gamma⁡(a,b) in shape-rate convention. Conditional on λ, let Y1,…,Yn be independent with Yi∼Pois⁡(eiλ) for i=1,…,n, where each fixed exposure ei≥0. The data space N0n has counting measure. If some ei=0 but yi>0, the likelihood and evidence are zero and no posterior quotient is defined. Otherwise put E=∑iei, S=∑iyi, and c(e,y)=∏i:ei>0eiyiyi!, with the empty product one. Then m(y)=c(e,y) baΓ(a+S)Γ(a)(b+E)a+S∈(0,∞), and the posterior is Gamma⁡(a+S,b+E). This includes all-zero exposures with zero counts, for which the posterior equals the prior.

Facts & Assumptions

Given: Countable Choice, n∈N0, a,b>0, finite nonnegative exposures, and a finite count vector y∈N0n.

[A1]

Countable Choice is used by the Gamma density normalization supplier. The Axiom of Countable Choice (ACω).

[F1]

The shape-rate Gamma density is baλa−1e−bλ/Γ(a) and is normalized for a,b>0. Shape-rate Gamma distribution.

[F2]

A zero exposure gives a point mass at zero; for positive exposure the Poisson mass is e−eλ(eλ)y/y!. Exposure-parameterized Poisson law.

[F3]

The Gamma kernel has finite positive Lebesgue integral, and its normalized shape-rate density integrates to one. The shape-rate Gamma density is normalized.

[F4]

The specified proper prior and parameter-measurable sampling probability kernel form a Bayesian model. Bayesian model as a prior and sampling kernel.

[F5]

Evidence is the prior integral of the likelihood section, and a quotient is defined only for finite positive evidence. Evidence normalizer and fiberwise posterior update.

[F6]

Probability normalization of the likelihood-weighted prior is equivalent to finite positive evidence. Fiberwise posterior propriety is equivalent to finite positive evidence.

[F7]

The dominated Bayes formula identifies the normalized density quotient as a posterior kernel. Bayes formula for dominated kernels.

[F9]

Continuous maps have Borel preimages of Borel sets, and the finite product data space has its product sigma-algebra. A continuous map has Borel preimages of Borel sets The product sigma-algebra and its finite iterates.

Proof

Given: Countable Choice, the hypotheses in the Statement and observed y.

1.1A1F1F2F4F5F7F8F9givencases

For fixed e>0 and y∈N0, the mass qe,y(λ)=e−eλ(eλ)y/y! is continuous on (0,∞) by [F8]; for e=0 it is the constant 1{y=0}, also continuous. Conditional independence gives the data mass ℓ(λ,y)=∏iqei,yi(λ), continuous in λ for each fixed y (and equal to 1 for the empty sample), hence Borel by [F9]. The count space is a countable union of the finite boxes {0,…,m}n and has its discrete sigma-algebra, so ℓ is jointly measurable on (0,∞)×N0n: for each Borel C⊆[0,∞], its inverse image is the countable union over y of the Borel section {λ:ℓ(λ,y)∈C}×{y}. For any data event D⊆N0n, its probability under parameter λ is K(λ,D)=∑y∈Dℓ(λ,y); the sums over D∩{0,…,m}n are finite and increase to this value, so K(⋅,D) is measurable by [F8]. For each λ, conditional independence and the normalized marginal Poisson laws [F2] make K(λ,⋅) a probability measure; the empty sample gives the point mass on its singleton data space. Thus K is a probability kernel and ℓ is the jointly measurable density required by [F7]. If some ei=0 and yi>0, [F2] makes the likelihood factor zero and its evidence zero by [F5]. Otherwise yi=0 whenever ei=0, and multiplying the mass factors in [F2] gives Ly(λ)=c(e,y)λSe−Eλ. The constant c is finite and positive, including when there are no positive exposures; the prior [F1] and kernel K give the Bayesian model [F4].

2.1A1F1F3step 1.1algebra

Multiply the likelihood from step 1.1 by the prior density [F1]. The parameter-dependent part is c(e,y)baΓ(a)λa+S−1e−(b+E)λ. Because a+S>0 and b+E>0, integrating this expression and applying [F3] with shape a+S and rate b+E yields the displayed evidence. Every factor is finite and strictly positive.

3.1A1F1F3F5F6F7step 2.1cases∎

Dividing by that evidence leaves (b+E)a+Sλa+S−1e−(b+E)λ/Γ(a+S), the normalized Gamma(a+S,b+E) density by [F3]. Its evidence is finite positive, so [F5] and [F6] permit the update and [F7] identifies it as the posterior kernel. When all exposures and counts vanish, S=E=0 and the formula is the original prior density.

Depends on

Used by

Dependency tree · two levels

78 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