Alphabeta Math
TheoremStatement: 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.

Current-group and new-group posterior predictions are probability kernels

Statement

Under Finite-group hierarchical Bayesian model, the current-group and new-group predictive assignments of Current-group and new-group posterior prediction are probability kernels from the full data space Y to Yj for current group j, and to Y~ for a new group, with their specified sigma-algebras. On every positive finite evidence fiber they are the stated posterior-predictive laws. On zero or infinite evidence fibers, the posterior kernel uses its prior filler, so the predictions are the corresponding prior-predictive laws. For the conditional-law interpretation, extend the model by the following product-kernel construction. Given the latent tuple ξ, draw the observed data from its original observation kernel and independently draw either a future current-group observation from Kj(θj,⋅), or a fresh new-group parameter from Gη followed by its observation from Knew. Under this extension, the predictive kernels are conditional laws of the future observations given the observed data. This is a posterior-predictive statement under the specified model, not a frequentist coverage claim.

Facts & Assumptions

Given: A proper hierarchical model, its posterior kernel on Y+, and the future observation kernels specified in the predictive definition.

[F1]

For every y∈Y, Py is a probability measure and conditional law of the latent tuple; it is the normalized posterior on positive finite evidence fibers and equals P0 on zero or infinite evidence fibers. The evidence-positive set is measurable and has prior-predictive probability one. Hierarchical posterior normalization on positive finite evidence

[F2]

Gη, each current-group Kj(θj,⋅), and Knew(θ,⋅) are probability kernels. Finite-group hierarchical Bayesian model, Current-group and new-group posterior prediction

[F3]

Integrating a nonnegative measurable function against a kernel gives a measurable function. Measurability of integration against a kernel

[F4]

Increasing nonnegative limits pass through integrals. Monotone convergence for the integral

[F5]

Integrating a nonnegative measurable function against a regular conditional law gives the conditional integral on every conditioning event. Conditional integration through a regular conditional law

[F6]

A proper prior and a probability model kernel define a joint probability law with the iterated-integral identity. A prior and model kernel define a joint law

[F7]

The finite product of probability kernels with a common source is a probability kernel. Finite products of probability kernels are probability kernels

Proof

technique · verify probability-kernel mixture properties, then check the conditional-event identity for a future draw

Given: The hypotheses in the Statement.

1.1F1F2F3F4given

Fix a current group j and y∈Y. For each measurable future-event set A, the formula Qj,ycur(A)=∫Kj(θj,A) Py(dξ) gives zero on A=∅ and one on the full observation space by [F1] and [F2]. If (Ak)k≥0 are disjoint, then Kj(θj,⋃kAk)=lim⁡N∑k≤NKj(θj,Ak); [F4] passes this increasing limit through the Py integral and gives countable additivity. The integrand is measurable in ξ by the kernel definition and coordinate projection, so [F3] makes y↦Qj,ycur(A) measurable against the posterior kernel y↦Py. Thus each Qjcur is a probability kernel from Y to Yj.

1.2F1F2F3F4

For a new group, define Rη(A)=∫Knew(θ,A)Gη(dθ). The empty-set and whole-space evaluations are zero and one. For disjoint (Ak), countable additivity of each Knew(θ,⋅) and [F4] pass the increasing partial sums through the Gη integral; hence Rη is a probability measure. [F3] makes η↦Rη(A) measurable, so R is a probability kernel. Mixing Rη(A) over Py through the measurable coordinate η and repeating the countable-additivity argument shows that Qynew(A) is a probability measure and [F3] makes its evaluations measurable in y. Thus Qnew is a probability kernel from Y to Y~. Its integral through the marginal Pyη is the same iterated-kernel law.

2.1F1F5F6F7step 1.1step 1.2∎

For either prediction let H(ξ,A) be its conditional future-event probability given the latent tuple: Kj(θj,A) for a current group, or Rη(A) for a new group. Steps 1.1–1.2 make H a probability kernel. In the stipulated extension, [F7] ensures that the product of the observation kernel and this future kernel is a probability kernel from Ξ to the product of data and future-observation spaces; applying [F6] with prior P0 gives a joint probability law on (ξ,Y,Y~). Because every section of H has total mass one, marginalizing out Y~ leaves the original joint law of (ξ,Y), so [F1] still supplies its posterior conditional law Py. For data event B and future event A, the triple law gives P(Y∈B,Y~∈A)=E[1{Y∈B}H(ξ,A)]. Applying the event identity in [F5] to H(ξ,A) turns the right side into ∫B∫H(ξ,A) Py(dξ) PY(dy)=∫BQy(A) PY(dy). This verifies the conditional-event identity for every data event B and proves that both predictive kernels are the conditional laws of the future observations. Since Py=P0 off Y+, their exceptional-fiber predictions are the prior-predictive laws.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

42 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