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.

Posterior-predictive mean and variance decomposition

Statement

Let Πy be a supplied posterior probability measure on Θ and Qθ a future probability kernel on R. Put s2(θ)=∫Rz2 Qθ(dz),and assume ∫Θs2(θ) Πy(dθ)<∞. On the full-measure set Ey={θ:s2(θ)<∞}, defineμ(θ)=∫z Qθ(dz),v(θ)=Var⁡Qθ(Z),and set μ=v=0 off Ey when integrating them against Πy. Then∫z Qypred(dz)=∫μ(θ) Πy(dθ), Var⁡Qypred(Z)=∫v(θ) Πy(dθ)+Var⁡Πy(μ). These kernel identities are choice-free. For the conditional interpretation, suppose a joint probability space (Ω,F,P) carries measurable random elements Y (data), X (parameter), and Z (future observation). Let G⊆H⊆F be sub-sigma-algebras such that Y is G-measurable and X is H-measurable. Assume ΠY is a regular conditional distribution of X given G and QX is a regular conditional distribution of Z given H. Thus the future law given the information in H is assumed to depend on it through X alone. If E[Z2]<∞, then QYpred is a regular conditional distribution of Z given G, and the displayed identities give the corresponding conditional-mean and conditional-variance versions almost surely. Here conditional variance means a version of the conditional expectation of the squared deviation from the corresponding conditional-mean version, using Conditional expectation given a sigma algebra. Identifying those versions with conditional-expectation equivalence classes uses AC, as stated below. Values on null data fibers remain version-dependent.

Facts & Assumptions

Given: A posterior probability measure Πy, a future probability kernel Qθ on R, and the finite mixture second moment in the Statement. For the conditional interpretation, also assume the joint-model and global second-moment hypotheses stated there.

[A1]

Assume AC only for the optional conditional-expectation-class reading; AC is the assertion that every family of nonempty sets has a choice function. The Axiom of Choice

[F1]

The posterior predictive law is Qypred(B)=∫Qθ(B)Πy(dθ). Posterior-predictive probability kernel

[F2]

The posterior-predictive mixture integrates every nonnegative measurable future function by iterated integration. A posterior mixture of future kernels is a probability kernel

[F3]

A square-integrable real variable has mean EZ and variance E[(Z−EZ)2]. Moments, variance, and covariance on a probability space

[F4]

Kernel integrals of nonnegative product-measurable functions are measurable, and signed integrals are measurable on their finite-absolute-integral domains. Measurability of integration against a kernel

[F5]

For a supplied regular conditional distribution, kernel integrals give conditional-expectation versions; the version identity is choice-free, while identifying conditional-expectation classes uses AC. Conditional integration through a regular conditional law

[F6]

A regular conditional distribution is a supplied probability kernel satisfying the conditioning-event identities. Regular conditional distribution

[F8]

A conditional-expectation version is a measurable integrable function satisfying the integral identity on every event of the conditioning sigma-algebra. Conditional expectation given a sigma algebra

[F9]

A probability kernel has pointwise probability-measure sections and measurable event evaluations. Measure kernel and probability kernel

Proof

Given: The hypotheses in the Statement.

1.1givenF3F4algebra

Let s2(θ)=∫z2Qθ(dz). It is measurable by [F4]. Since ∫s2 dΠy<∞, the set Ey={s2<∞} is measurable and has Πy(Ey)=1. On Ey, ∣z∣≤1+z2 gives a finite first absolute moment, so μ(θ) is finite and measurable by [F4]. Expanding the square in the variance definition [F3] gives v(θ)=s2(θ)−μ(θ)2≥0, hence μ(θ)2≤s2(θ); therefore μ is square-integrable under Πy and v is integrable.

1.2givenF2F5F6F9

For the joint-model hypotheses in the Statement, let B be a measurable future event and G∈G. The function θ↦Qθ(B) is measurable by [F9]. Apply [F5] to the posterior conditional law and this bounded function to obtain ∫GQYpred(B) dP=∫GQX(B) dP. Since G∈G⊆H, apply [F5] again to the conditional law QX to get ∫GQX(B) dP=P(G∩{Z∈B}). By [F2], the mixture has probability-measure sections and measurable evaluations; these event identities therefore make QYpred a regular conditional distribution of Z given G under [F6].

2.1givenF1F2step 1.1algebra

By [F1], Qypred is the mixture defined from Qθ and Πy. Apply [F2] to g(z)=z2 to obtain ∫z2Qypred(dz)=∫s2 dΠy<∞. Apply [F2] to ∣z∣ and use ∣z∣≤1+z2 to see that Qypred has finite first absolute moment. Applying [F2] to the nonnegative positive and negative parts of z and subtracting their finite integrals gives ∫zQypred(dz)=∫μ dΠy.

2.2givenF5F6F8step 1.1

Apply [F5] to z and z2 under QX. Writing m:=μ(X) and s:=s2(X), their conditional-integration identities give E[1AZ]=E[1Am] and E[1AZ2]=E[1As] for every A∈H, and E[s]=E[Z2]<∞. Applying [F5] to s2 under ΠY gives a conditional version of s with expectation E[s]; hence D:={y:∫s2(θ)Πy(dθ)<∞} has full probability. Take the zero-filled representative sˉ(Y):=∫s2(θ)Πy(dθ) on D and zero elsewhere. Then E[sˉ(Y)]=E[s]=E[Z2]<∞ and ΠY(E)=1 almost surely for E={θ:s2(θ)<∞}. The conditioning identity for X then gives P(X∈E)=1. By step 1.1, m2≤s and 0≤v(X)≤s almost surely; hence m∈L2 and v(X) is integrable, with v(X)=s−m2 almost surely. Because X is H-measurable and these moment functions are measurable, m,s,v(X) are H-measurable. The first event identity extends from bounded simple H-measurable multipliers to 1Am by simple approximation and truncation; 2∣mZ∣≤m2+Z2 and m2∈L1 justify the limits. Thus E[1AmZ]=E[1Am2], and expansion gives E[1A(Z−m)2]=E[1A(s−m2)]=E[1Av(X)] for every A∈H. This proves eventwise that m is the conditional-mean version of Z and v(X) is the conditional-variance version given H.

3.1F3step 1.1step 2.1algebra

On Ey, s2=v+μ2, and off Ey the set is Πy-null. By [F3] and step 2.1, Var⁡Qypred(Z)=∫s2 dΠy−(∫μ dΠy)2=∫v dΠy+∫μ2 dΠy−(∫μ dΠy)2=∫v dΠy+Var⁡Πy(μ). This proves both displayed kernel identities without choosing conditional-expectation representatives.

4.1givenF3F5step 2.1step 1.2step 3.1

On the full-measure data domain where b(Y):=∫s2 dΠY<∞, set c(Y):=∫μ dΠY, d(Y):=∫μ2 dΠY, and e(Y):=∫v dΠY, and extend b,c,d,e by zero on its null complement, using the signed zero-filled extension for c. By [F5] and the kernel identities in steps 2.1 and 3.1, c,b are conditional first- and second-moment versions of Z given G, while c,d,e are conditional moments of m,m2,v(X) given G. Since Y is G-measurable, these functions of Y are G-measurable. Also E[b(Y)]=E[Z2]<∞, c2≤b almost surely since b−c2=Var⁡QYpred(Z)≥0, and d≤b<∞ almost surely since μ2≤s2.

5.1A1F3F5F8step 3.1step 2.2step 4.1∎

For each A∈G, the same simple-multiplier and truncation argument as in step 2.2, now applied to m with center c(Y) and to Z with that same center, gives E[1A(m−c(Y))2]=E[1A(d−c(Y)2)] and E[1A(Z−c(Y))2]=E[1A(b(Y)−c(Y)2)]; the bounds 2∣cm∣≤c2+m2 and 2∣cZ∣≤c2+Z2 justify the respective truncations. Thus d−c2 and b−c2 are the conditional-variance versions of m and Z given G. The kernel identity in step 3.1 gives b−c2=e+(d−c2), so the conditional variance of Z given G is the expected conditional variance given H plus the conditional variance of the conditional mean. These event-identity versions are choice-free; under [A1] they may also be read as conditional-expectation equivalence classes by [F5], while [F8] gives the eventwise version convention. No value on a null data fiber is thereby made canonical.

Depends on

Used by

Dependency tree · two levels

28 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