Alphabeta Math
Pipeline-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.

Hierarchical Bayes and partial pooling

1 · Prerequisites

2 · Summary

This page develops a finite-group hierarchical Bayesian model from its probability kernels. A proper hyperprior and conditionally independent group parameters induce a joint prior and a product likelihood; the posterior is normalized only on observation fibers with positive finite evidence. The known-variance normal specialization gives conditional shrinkage toward the population mean, while the full posterior continues to integrate uncertainty in unknown hyperparameters. Current-group prediction uses that group's posterior parameter; new-group prediction first draws from the population kernel. The product-kernel structure is an explicit modeling assumption; no finite de Finetti representation is asserted.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Finite products of dominated kernels have the product density

Statement

Let n≥1 and let (S,Σ) be a measurable space. For each j<n, let Kj be a probability kernel from (S,Σ) to (Tj,Tj), let νj be sigma-finite on (Tj,Tj), and let fj:S×Tj→[0,∞] be a specified jointly measurable function such that Kj(s,B)=∫Bfj(s,tj) νj(dtj)(B∈Tj). On the finite product spaces, let K=⨂j<nKj be the product probability kernel, let ν=⨂j<nνj, and put f(s,t)=∏j<nfj(s,tj), using the extended-product convention 0⋅∞=0. Then f is jointly measurable and, for every s∈S, it is a density of K(s,⋅) with respect to ν on the entire product sigma-algebra.

Facts & Assumptions

Given: A positive finite number of probability kernels Kj, sigma-finite measures νj, and specified nonnegative jointly measurable densities fj as in the Statement.

[F1]

Finite products of probability kernels exist, are probability kernels, and have the product rectangle formula. Finite products of probability kernels are probability kernels

[F2]

Finite products of sigma-finite measures exist, are sigma-finite, and have the product rectangle formula. For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique

[F3]

For a nonnegative product-measurable function, Tonelli gives measurable section integrals and identifies the product integral with either iterated integral. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F4]

Integrating a nonnegative measurable function over measurable sets defines a measure. The indefinite integral of a nonnegative measurable function is a measure

[F5]

Measures agreeing on a generating pi-system are equal when that pi-system supplies an increasing finite-measure exhaustion. Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system

[F6]

Extended nonnegative measurability is determined by strict superlevel sets; between any two distinct real numbers there is a rational. Extended-real-valued measurable functions, Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable

[F7]

The finite product sigma-algebra is generated by measurable rectangles, and its coordinate projections are measurable. The product sigma-algebra and its finite iterates

Proof

technique · construct the product density and compare its induced measure with the product kernel on rectangles

Given: The hypotheses and conventions in the Statement.

1.1F1F2F6F7given

The product kernel K is a probability kernel by [F1]. Construct the finite product measure recursively: the one-factor case is ν0, and each next product is sigma-finite by [F2] applied to the preceding sigma-finite product and the next νj. By [F7], each coordinate pullback (s,t)↦fj(s,tj) is measurable on S×∏j<nTj. For two nonnegative extended-measurable functions u,v and a≥0, {uv>a}=⋃q∈Q, q>0{u>q}∩{v>a/q}; when uv>a, one can choose a positive rational q with a/v<q<u, with the evident choice of any 0<q<u when a=0; this also covers infinite factors and excludes a zero factor under the stated 0⋅∞=0 convention. For a<0 the superlevel set is the whole domain. Thus finite multiplication preserves measurability by [F6], and f is jointly measurable.

1.2F3F4given

Fix s and define λs(A)=∫Af(s,t) ν(dt). By [F4], λs is a measure. Repeated Tonelli [F3] and the probability-kernel density identities give λs ⁣(∏j<nTj)=∫∏j<nfj(s,tj) dν=∏j<n∫fj(s,tj) νj(dtj)=∏j<nKj(s,Tj)=1. Hence λs is a probability measure.

2.1F1F5step 1.2∎

For a measurable rectangle R=∏j<nBj, repeated Tonelli and the density identities yield λs(R)=∏j<n∫Bjfj(s,tj) νj(dtj)=∏j<nKj(s,Bj)=K(s,R), where the last equality is [F1]. Rectangles form a generating pi-system containing the whole product. Both measures are probabilities by step 1.2 and [F1], so the constant exhaustion by the whole product has common finite mass one. [F5] therefore gives λs=K(s,⋅) on the full product sigma-algebra. This holds for every s, proving the density assertion.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Finite-group hierarchical Bayesian model

Definition

Fix a finite group count m≥1, a standard Borel hyperparameter space (H,H), and a standard Borel parameter space (Θ,T). Let Π be a probability measure on (H,H) and let G:H×T→[0,1] be a probability kernel. For each j∈{1,…,m}, let (Yj,Aj) be a measurable observation space, let νj be a sigma-finite measure on it, and let Kj be a probability kernel from (Θ,T) to (Yj,Aj) with a specified jointly measurable density fj:Θ×Yj→[0,∞]: Kj(θ,B)=∫Bfj(θ,yj) νj(dyj)(B∈Aj).

The finite-group hierarchical model is the following specified kernel construction. First draw η∼Π. Conditional on η, draw θ1,…,θm from the finite product kernel Gη⊗m(dθ1⋯dθm)=⨂j=1mGη(dθj). Thus the group parameters are conditionally independent and have the same conditional law Gη. Conditional on the parameter tuple, draw the group observations from the product kernel ⨂j=1mKj(θj,⋅). The product-kernel laws are probability kernels by Finite products of probability kernels are probability kernels. For each fixed η, the coordinate maps under Gη⊗m are independent random elements, so their joint law is the finite product law (Independent random elements have product joint law).

Put Ξ=H×Θm with its finite product sigma-algebra. The proper latent prior P0 on Ξ is P0(dη,dθ1⋯dθm)=Π(dη)∏j=1mGη(dθj), well-defined by A prior and model kernel define a joint law. For ξ=(η,θ1,…,θm)∈Ξ, lift each observation kernel to the common source Ξ by Mj(ξ,B)=Kj(θj,B)(B∈Aj). The coordinate projection ξ↦θj is measurable, so the kernel definition shows that each Mj is a probability kernel. Its specified jointly measurable density is (ξ,yj)↦fj(θj,yj), by composition with the same measurable coordinate projection. Let Y=∏j=1mYj, ν=⨂j=1mνj, and y=(y1,…,ym). The observation kernel from Ξ has jointly measurable density Ly(η,θ1⋯θm)=∏j=1mfj(θj,yj) with respect to ν, by Finite products of dominated kernels have the product density. Its evidence is the possibly extended nonnegative number Z(y)=∫ΞLy(η,θ1⋯θm) P0(dη,dθ1⋯dθm). The normalized likelihood measure is called a pointwise joint posterior on a fiber only when 0<Z(y)<∞; no quotient is formed at zero or infinite evidence.

For each group, θ↦Kj(θ,⋅) is a parametric statistical model in the sense of Parametric statistical models, with its parameter-measurable kernel representation as in Parameter-measurable statistical models as kernels. Here “conditionally independent given η” is shorthand for the explicit finite product-kernel specification above. The library's random-element conditional-independence terminology is defined in Conditional independence given a sigma-algebra; its conditional-expectation-class convention assumes AC. The finite product-kernel definition here does not use that class convention or any choice axiom.

Remarks

The product-kernel assumption is part of this model. An arbitrary finitely exchangeable law need not be a mixture of iid laws; no finite de Finetti theorem is claimed here. When η is unknown, the joint posterior retains its uncertainty and induces dependence between group parameters after η is integrated out.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

A finite-group hierarchical model has a conditional law of its latent tuple

Statement

Assume the Axiom of Choice and the hypotheses of Finite-group hierarchical Bayesian model. On the canonical joint probability space, the latent tuple ξ=(η,θ1,…,θm) has a regular conditional distribution given the sigma-algebra generated by the observed data Y. The conditional law is a probability kernel at every sample point, including exceptional points. This existence conclusion alone does not assign a normalized likelihood posterior to a fixed observation fiber on which the evidence is zero or infinite.

Facts & Assumptions

Given: The finite-group hierarchical model and AC.

[F1]

The model supplies a proper hyperprior, a finite product group-parameter kernel, and a finite product observation kernel, all with the stated measurable spaces. Finite-group hierarchical Bayesian model

[F2]

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

[F3]

A finite product of standard-Borel spaces with its finite product sigma-algebra is standard Borel. Finite products of standard Borel spaces are standard Borel

[F4]

Under AC, a random element with standard-Borel target has a regular conditional distribution given any sub-sigma-algebra, with probability sections at every sample point. Existence of regular conditional distributions for standard borel targets

[F5]

Coordinate projections from a product measurable space are measurable. The product sigma-algebra and its finite iterates

[A1]

AC holds; it is used to apply [F4]. The Axiom of Choice

Proof

technique · construct the canonical joint law, then apply standard-Borel disintegration to the latent coordinate

Given: The hypotheses in the Statement.

1.1F1F2F5given

Put Ξ=H×Θm with its finite product sigma-algebra. The model definition supplies the proper latent prior P0 on Ξ and the probability kernel from Ξ to the product observation space Y; apply [F2] to obtain the joint probability law P0(dξ)K(ξ,dy) on Ξ×Y. Let Ω=Ξ×Y with this law and let ξ and Y be the coordinate projections. By [F5], both projections are measurable.

2.1A1F3F4step 1.1∎

The target Ξ is standard Borel by [F3], since H and Θ are standard Borel and there are finitely many factors. The coordinate map ξ:Ω→Ξ is a measurable random element, and σ(Y) is a sub-sigma-algebra of the canonical product sigma-algebra. By [F4] under [A1], ξ has a regular conditional distribution given σ(Y). The definition of a regular conditional distribution requires every section to be a probability measure, including at exceptional sample points. The theorem asserts no normalization formula on a fixed observation fiber.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Hierarchical posterior normalization on positive finite evidence

Statement

Assume the finite-group hierarchical model of Finite-group hierarchical Bayesian model. Write P0 for its proper prior on Ξ=H×Θm, let Ly(ξ) be its specified product likelihood density with respect to the finite product measure ν, and define Z(y)=∫ΞLy(ξ) P0(dξ). For every observation y with 0<Z(y)<∞, the measure Py(A)=∫ALy(ξ) P0(dξ)Z(y)(A∈H⊗T⊗m) is the joint posterior law of the latent tuple. Defining Py=P0 when Z(y)=0 or Z(y)=∞ gives a regular conditional distribution under the prior-predictive law; no quotient is formed on either exceptional fiber.

Facts & Assumptions

Given: A proper hyperprior, finite product group and observation kernels, and their specified jointly measurable likelihood densities.

[F1]

The finite-group model defines a proper latent prior P0 and the product observation kernel with likelihood section Ly. Finite-group hierarchical Bayesian model

[F2]

The finite product of the group observation kernels has jointly measurable product density L(ξ,y)=∏jfj(θj,yj) relative to the sigma-finite product measure ν. Finite products of dominated kernels have the product density

[F3]

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

[F4]

For a proper prior and a dominated probability kernel with a specified jointly measurable density, the posterior kernel is the normalized density on 0<m(y)<∞ fibers and uses the prior as filler on zero or infinite normalizer fibers. Bayes formula for dominated kernels

Proof

technique · identify the finite product likelihood density and apply the dominated-kernel Bayes formula

Given: The hypotheses in the Statement.

1.1F1F2F3F4given

By [F1] and [F3], the latent prior P0 is a probability measure and the model kernel gives a joint probability law for the latent tuple and the observations. By [F2], that observation kernel is dominated by the sigma-finite product measure ν with the specified jointly measurable density L(ξ,y)=∏jfj(θj,yj). Thus all hypotheses of [F4] apply with prior P0 and likelihood density L.

2.1F4step 1.1∎

The resulting evidence is m(y)=∫ΞLy(ξ)P0(dξ)=Z(y). On every fiber with 0<Z(y)<∞, [F4] gives the probability measure Py(A)=Z(y)−1∫ALy dP0 and the conditional-event identities. On fibers with zero or infinite evidence [F4] uses the probability filler P0, so its kernel remains a regular conditional distribution there without dividing by zero or infinity. The same theorem says these filled fibers have prior-predictive measure zero.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Conditional normal shrinkage in a finite hierarchy

Statement

Assume the normal specialization of Finite-group hierarchical Bayesian model with parameter space Θ=R and hyperparameter space H=R×(0,∞). Fix μ∈R and τ2>0. Conditional on (μ,τ2), let the group parameters be independent with θj∼N(μ,τ2). Let the observed group summaries be conditionally independent with Yˉj∣θj∼N(θj,sj2), where each known sj2>0. In this normal specialization, the supplied likelihood-density version is the canonical normal density at every parameter and observation value: fj(θ,y)=(2πsj2)−1/2exp⁡ ⁣(−(y−θ)22sj2)(θ,y∈R). Then, conditional on (μ,τ2,Yˉ1=yˉ1,…,Yˉm=yˉm), the θj are independent and θj∼N(θ^j,Vj),θ^j=yˉj/sj2+μ/τ21/sj2+1/τ2,Vj=(1/sj2+1/τ2)−1. If (μ,τ2) is unknown with a proper hyperprior supported on R×(0,∞), let Py be the full posterior kernel from Hierarchical posterior normalization on positive finite evidence and, on each positive finite evidence fiber, define its hyperparameter marginal on Borel C⊆H by Πy(C):=Py(C×Rm). The posterior law of θj is the mixture of these conditional normal laws over Πy; replacing μ,τ2 by point estimates need not give this posterior. No normalized hyperparameter posterior is asserted on a zero or infinite evidence fiber.

Facts & Assumptions

Given: The normal hierarchical model, known positive sampling variances sj2, positive conditional prior variance τ2, and the stated observed group summaries.

[F1]

Conditional on the hyperparameters, the model uses the normal prior N(μ,τ2) and group observation kernels with the canonical normal density factors fj(θ,y)=(2πsj2)−1/2exp⁡(−(y−θ)2/(2sj2)) specified pointwise in the Statement; these factors are jointly measurable, and distinct groups factor under the specified product kernels. Finite-group hierarchical Bayesian model

[F2]

The finite product observation kernel has its specified product density. Finite products of dominated kernels have the product density

[F3]

On a positive finite evidence fiber, the posterior of the full latent tuple is the normalized joint likelihood density. Hierarchical posterior normalization on positive finite evidence

[F4]

Tonelli passes nonnegative integrals through the finite product likelihood and the hyperparameter integral. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F5]

For a proper normal prior N(μ0,τ02) and n≥1 IID observations from N(μ,σ2) with known positive variance, the evidence is finite positive and the posterior has precision τ0−2+nσ−2 and precision-weighted mean. Known-variance Normal-Normal conjugate update

[F6]

Measures agreeing on a generating pi-system are equal when that pi-system has an increasing finite-measure exhaustion. Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system

[F7]

Integrating a nonnegative product-measurable function against a finite probability kernel gives a measurable function of its source parameter. Measurability of integration against a kernel

[F8]

Sections and coordinate projections in finite product measurable spaces are measurable, and measurable rectangles generate the product sigma-algebra. Every section of a product-measurable function is measurable, The product sigma-algebra and its finite iterates

[F9]

Finite products of probability kernels with a common source are probability kernels and satisfy the product rectangle formula. Finite products of probability kernels are probability kernels

[A1]

AC is assumed for the library normal-law and conditional-expectation-class conventions. The Axiom of Choice

[A2]

τ2>0 and all sj2>0.

Proof

technique · specialize the BCS-03 Normal–Normal update to each group, factor the finite conditional posterior, and integrate over the hyperparameter posterior

Given: The stated fixed hyperparameters, group summaries, and variances.

1.1A1A2F1F5givenalgebra

Fix a group j and specialize [F5] to one observation: identify its parameter with θj, set μ0=μ, τ02=τ2, n=1, y1=yˉj, and σ2=sj2. The model and pointwise density specification in [F1] supply this normal prior and the canonical normal likelihood density used by [F5], while [A1] and [A2] verify the choice and positive-variance hypotheses of [F5]. The theorem gives a finite positive group evidence and posterior variance Vj=(1/τ2+1/sj2)−1 and mean θ^j=Vj(μ/τ2+yˉj/sj2), as stated.

2.1A1A2F1F2F3F4F5F6F8F9step 1.1algebra

For each group put μj(A)=∫Afj(θ,yˉj)N(μ,τ2)(dθ) and let mj=μj(R)>0. By [F5] and step 1.1, μj/mj=Qj=N(θ^j,Vj). Apply [F3] to the hierarchy with the proper point-mass hyperprior at the fixed (μ,τ2). Its latent prior on Rm is the product of the group priors by [F1], and its likelihood density is ∏jfj(θj,yˉj) by [F2]. Repeated Tonelli [F4] shows that the normalized posterior assigns each measurable rectangle ∏jAj mass ∏jμj(Aj)/∏jmj=∏jQj(Aj), the rectangle mass of ⨂jQj by [F9]. By [F8], rectangles form a generating pi-system. Both are probability measures agreeing on it; the constant exhaustion by the full space has common finite mass one, so [F6] makes them equal. This proves conditional independence and the displayed formula for every group.

3.1F3F4F5F7F8step 1.1algebra∎

Now suppose (μ,τ2) is random with a proper hyperprior supported on H. For fixed observed summaries, put Mj((μ,τ2),A)=∫Afj(θ,yˉj)N(μ,τ2)(dθ). The factor fj(⋅,yˉj) is measurable by the section fact [F8]; composing it with the parameter-coordinate projection shows that (η,θ)↦1A(θ)fj(θ,yˉj) is product-measurable. Since Gη=N(μ,τ2) is a probability kernel, [F7] makes Mj(⋅,A) measurable. Hence mj=Mj(⋅,R) and Qj(A)=Mj(⋅,A)/mj are measurable, with mj>0 by step 1.1. Repeated Tonelli [F4] and the full-posterior formula [F3] give, for measurable C⊆H and A1,…,Am⊆R, Py(C×∏jAj)=Z(y)−1∫C∏jMj((μ,τ2),Aj) Π(dμ,dτ2). Taking every Aj=R shows Πy(C)=Z(y)−1∫C∏jmj dΠ. Taking only Aj=A and all other sets equal to R therefore gives Py(θj∈A)=∫HQj(A) Πy(dμ,dτ2). By [F5] and step 1.1, Qj=N(θ^j,Vj), so the group posterior is its conditional normal law averaged over the full hyperparameter posterior. If Πy is a point mass, this mixture equals its single conditional normal component; in general it need not equal a plug-in law.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Current-group and new-group posterior prediction

Definition

Let Y=∏j=1mYj be the data space and Y+={y∈Y:0<Z(y)<∞} its measurable subset of positive finite evidence fibers. Write Py for the full latent probability kernel supplied by Hierarchical posterior normalization on positive finite evidence, and set Λy:=Py for every y∈Y. On Y+ this is the normalized joint posterior; off Y+ it is the prior filler P0, so no likelihood quotient is formed there. For an already observed group j, its current-group posterior predictive law for a future observation with the same conditional observation kernel is Qj,ycur(A)=∫ΞKj(θj,A) Λy(dη,dθ1⋯dθm).

For a new group, specify a probability kernel Knew from (Θ,T) to a future observation space (Y~,A~). Its new-group posterior predictive law is Qynew(A)=∫Ξ[∫ΘKnew(θ,A) Gη(dθ)] Λy(dη,dθ1⋯dθm). For y∈Y+, if Λyη denotes the hyperparameter marginal of Λy, the joint posterior law of (η,θnew) used here is Λyη(dη)Gη(dθnew). Thus the new-group prediction first draws a new latent parameter from Gη and then draws its observation from Knew. On Y+ both formulas average over the joint posterior and retain uncertainty about unknown hyperparameters. On exceptional fibers they reduce to prior-predictive laws because Λy=P0.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources