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.

Posterior Prediction, Credible Sets, and Bayes Actions

1 · Prerequisites

2 · Summary

Fix a supplied measurable posterior probability kernel and a future probability kernel. A data-indexed posterior kernel can be supplied by the standard-Borel construction on bayesian-models-priors-and-posterior-laws under the Axiom of Choice (The Axiom of Choice) when both parameter and data spaces are standard Borel; the construction of a sample-point-indexed posterior regular conditional distribution needs only a standard-Borel parameter space. Standard-Borel spaces are defined in Standard Borel spaces. Alternatively, the dominated formula on posterior-propriety-and-dominated-bayes-formula applies to a proper prior and a probability sampling kernel represented by a specified nonnegative jointly measurable density with respect to a sigma-finite data measure. Null-data values remain version-dependent. The posterior/future-kernel mixture is the posterior-predictive law; when its second moment is finite, its variance separates future sampling variance from posterior uncertainty in the conditional mean. A graph-measurable set has posterior credibility when its posterior mass reaches the stated level. Equal-tailed quantile intervals are one construction; highest-posterior-density regions require a density relative to a specified measure and can be disconnected or nonunique. Posterior risk is recorded only when its loss integral is finite, and a Bayes action rule must be measurable, have finite risk, and attain the minimum. The squared-loss posterior-mean result assumes a finite posterior second moment and AC through the L²-projection theorem; the median result assumes a finite first absolute moment, and the finite-class maximizer result uses zero-one loss on a nonempty finite class. Posterior credibility is not a repeated-sampling coverage guarantee.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Posterior-predictive probability kernel

Definition

Let (Θ,T) and (Y,Y) be measurable spaces. Suppose Π is a supplied probability kernel from Y to Θ; write its probability measure at y as Πy. Let Q be a probability kernel from Θ to a measurable future-observation space (Z,Z). Define the posterior-predictive probability kernel by Qypred(B):=∫ΘQθ(B) Πy(dθ),y∈Y, B∈Z. A probability kernel has pointwise probability-measure sections and measurable event evaluations, as in Measure kernel and probability kernel. This definition takes the posterior kernel as supplied; it does not form a likelihood quotient.

For a proper-prior dominated model, Bayes formula for dominated kernels supplies one such data-indexed kernel when the sampling laws have a specified nonnegative jointly measurable density against a sigma-finite data measure. Its stated filler on zero or infinite normalizers is part of that kernel version.

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

A posterior mixture of future kernels is a probability kernel

Statement

Let Π be a probability kernel from (Y,Y) to (Θ,T) and let Q be a probability kernel from (Θ,T) to (Z,Z). For Qypred(B)=∫ΘQθ(B) Πy(dθ), each Qypred is a probability measure, the evaluations y↦Qypred(B) are measurable, and, for every nonnegative measurable g:Z→[0,∞], ∫Zg(z) Qypred(dz)=∫Θ(∫Zg(z) Qθ(dz))Πy(dθ).

Facts & Assumptions

Given: The probability kernels Π and Q above, and the definition of Qpred.

[F1]

The posterior-predictive set function is the stated mixture integral. Posterior-predictive probability kernel

[F2]

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

[F3]

A probability measure and parameter-measurable probability kernel define a joint probability measure whose nonnegative integrals are the iterated kernel integrals. A prior and model kernel define a joint law

[F4]

Integrating a nonnegative product-measurable function against a probability kernel gives a measurable function of the kernel index. Measurability of integration against a kernel

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2F3

Fix y∈Y and regard Πy as a probability measure on Θ. By [F2], Q is a probability kernel, so [F3] gives a joint probability measure Jy on Θ×Z satisfying Jy(A×B)=∫AQθ(B) Πy(dθ) and the iterated-integral identity for every nonnegative product-measurable function. Taking A=Θ shows Qypred(B)=Jy(Θ×B); hence it is the second marginal of a probability measure and is itself a probability measure. The same identity applied to (θ,z)↦g(z) gives the displayed integral formula.

2.1givenF1F2F4∎

Fix B∈Z. The function θ↦Qθ(B) is T-measurable by [F2], so (y,θ)↦Qθ(B) is Y⊗T-measurable as the composition with the measurable coordinate projection. By [F4], y↦∫ΘQθ(B)Πy(dθ) is measurable. By [F1] this is Qypred(B), proving kernel measurability.

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

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.

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

Posterior credible set

Definition

Let (Θ,T) and (Y,Y) be measurable spaces and let y↦Πy be a supplied posterior probability kernel. For α∈[0,1], a set-valued rule C is graph-measurable when {(y,θ)∈Y×Θ:θ∈C(y)}∈Y⊗T. It is a posterior credible set at level 1−α when it is graph-measurable and Πy(C(y))≥1−αfor every y in its declared data domain. The posterior-mass function is measurable by integration of the indicator of the membership graph against the kernel. If a density is available relative to a specified dominating measure, a highest-posterior-density region selects parameter values with largest density; such regions need not be intervals and may be disconnected or nonunique.

Remarks

On a real parameter space, equal-tailed intervals formed from posterior quantiles are one choice; Equal-tailed posterior quantile intervals are credible proves their mass bound.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Posterior quantiles are measurable and bracket their probability level

Statement

Write Q for the canonical image of the rationals in R under the embedding of The rationals embed densely in the reals.

Let y↦Πy be a probability kernel on R. For u∈(0,1) put Fy(t)=Πy((−∞,t]),qu(y)=inf⁡{r∈Q:Fy(r)≥u}.The infimum is taken in R; Every nonempty set bounded below has an infimum supplies it once the defining set is shown nonempty and bounded below. Then qu:Y→R is measurable, andΠy((−∞,qu(y)))≤u≤Πy((−∞,qu(y)]).

Facts & Assumptions

Given: The posterior probability kernel Π and a fixed u∈(0,1).

[F1]

Every event evaluation of a probability kernel is measurable, and each section is a probability measure. Measure kernel and probability kernel

[F2]

For increasing measurable sets, the measure of their union is the supremum of their measures. Continuity from below for measures

[F3]

For decreasing sets whose first member has finite measure, the measure of their intersection is the infimum of their measures. Continuity from above when one set has finite measure

[F5]

The rationals are countable and their injective embedding into R restricts to a bijection onto this canonical image, so the union over Q is countable. Q is countably infinite, The rationals embed densely in the reals

[F6]

Every nonempty subset of R that is bounded below has a real infimum; an infimum is a lower bound that is at least every other lower bound. Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)

[F7]

A probability measure is monotone on nested measurable sets. Measures are monotone

[F8]

The canonical natural numbers are cofinal in the complete ordered field R. Every complete ordered field is Archimedean

[F9]

For every real ε>0 there is a natural n≥1 with 1/n<ε; for all m≥n, 1/m≤1/n, so 1/m<ε. Thus 1/n decreases to zero. For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε, Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order

[F10]

The Cauchy-sequence real field has the least-upper-bound property and is a complete ordered field, so the infimum and Archimedean results above apply to R. The Cauchy-sequence reals have the least-upper-bound property

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2F3F4F6F7F8F10choose

Fix y. By [F8, F10], the sets (−∞,n] increase to R, so [F2] gives Fy(n)↑1 and some natural n satisfies Fy(n)≥u. By [F4] choose a rational r>n; then [F7] gives Fy(r)≥u, so Sy={r∈Q:Fy(r)≥u} is nonempty. Again by [F8, F10], the sets (−∞,−n] decrease to the empty set; [F3] gives some natural m with Fy(−m)<u. Choose a rational s<−m by [F4]. For any rational r≤s, [F7] gives Fy(r)≤Fy(−m)<u, so every member of Sy exceeds s and Sy is bounded below. Hence [F6, F10] gives its real infimum qu(y).

2.1step 1.1F1F5F6F10

For each c∈R, the infimum definition and nonemptiness give {y:qu(y)<c}=⋃r∈Qr<c{y:Fy(r)≥u}. Each set on the right is measurable by [F1], and the union is countable by [F5], so qu is measurable.

2.2givenF1F3F4F6F7F9algebrachoosestep 1.1

Suppose Πy((−∞,qu(y)])<u. By [F9], the sets (−∞,qu(y)+1/n] decrease to (−∞,qu(y)]; they have finite measure by [F1], so [F3] gives an n with Fy(qu(y)+1/n)<u. By [F4], choose rational r with qu(y)<r<qu(y)+1/n. Then [F7] gives Fy(r)≤Fy(qu(y)+1/n)<u. Consequently no member of Sy is at most r, so r is a lower bound of Sy. Then qu(y)=inf⁡Sy≥r>qu(y), a contradiction; therefore u≤Πy((−∞,qu(y)]).

3.1givenF1F2F4F6F7F9step 2.2choosestep 1.1∎

Suppose Πy((−∞,qu(y)))>u. By [F9], the sets (−∞,qu(y)−1/n] increase to (−∞,qu(y)), so [F2] gives an n with Fy(qu(y)−1/n)>u. By [F4], choose rational r with qu(y)−1/n<r<qu(y). Then [F7] gives Fy(r)≥Fy(qu(y)−1/n)>u, so r∈Sy, contradicting that qu(y) is a lower bound of Sy. Thus Πy((−∞,qu(y)))≤u. Combining with step 2.2 proves the CDF bracket.

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

Equal-tailed posterior quantile intervals are credible

Statement

Let Πy be a posterior probability kernel on R and let 0<α<1. Define Cα(y)=[qα/2(y),q1−α/2(y)] using the quantiles from Posterior quantiles are measurable and bracket their probability level. Then Cα is graph-measurable and Πy(Cα(y))≥1−α for every y. Thus equal-tailed posterior quantile intervals are one kind of credible set.

Facts & Assumptions

Given: The posterior probability kernel, the quantile convention, and 0<α<1 in the Statement.

[F1]

A credible set is a graph-measurable set-valued rule whose posterior mass is at least its stated level. Posterior credible set

[F2]

By the quantile definition qu(y)=inf⁡{r∈Q:Fy(r)≥u}, the defining sets are nested oppositely to u, so u≤v implies qu(y)≤qv(y). Each qu is measurable and satisfies Πy((−infty,qu(y)))≤u≤Πy((−infty,qu(y)]). Posterior quantiles are measurable and bracket their probability level

[F3]

The product sigma-algebra is generated by measurable rectangles. The product sigma-algebra and its finite iterates

[F4]

There is a rational strictly between any two distinct real numbers. Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable

[F5]

If A⊆B and Πy(A)<∞, then Πy(B∖A)=Πy(B)−Πy(A). Measure of a set difference when the smaller set has finite measure

Proof

Given: The hypotheses in the Statement.

1.1givenF2

Since α/2<1−α/2, the defining rational sets for the two quantiles are nested in the direction that gives qα/2(y)≤q1−α/2(y). Both endpoint functions are measurable by [F2].

1.2givenF2F5algebra

Put l=qα/2(y) and u=q1−α/2(y). The disjoint difference (−∞,u]∖(−∞,l) is [l,u], so Πy([l,u])=Πy((−∞,u])−Πy((−∞,l)). By [F2], the first term is at least 1−α/2 and the second is at most α/2, giving posterior mass at least 1−α.

2.1F2F3F4step 1.1

The complement of the interval membership graph consists of pairs with x<qα/2(y) or x>q1−α/2(y). By [F4], the first relation is the countable union over r∈Q of {y:qα/2(y)>r}×(−∞,r), and the second is the countable union over r∈Q of {y:q1−α/2(y)<r}×(r,∞). Each is a measurable rectangle by endpoint measurability, so [F3] makes the graph measurable.

3.1F1step 2.1step 1.2∎

The graph measurability from step 2.1 and the mass bound from step 1.2 satisfy [F1], so Cα is a posterior credible set.

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

Posterior median

Definition

For a probability measure Πy on R, a posterior median is any m∈R satisfying Πy((−∞,m])≥12andΠy([m,∞))≥12. The two inequalities, rather than a density-based definition, apply to discrete, continuous, and mixed posteriors and permit more than one median.

Remarks

The lower posterior median is a measurable rule constructs a measurable median rule from a posterior probability kernel.

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

The lower posterior median is a measurable rule

Statement

Let Π be a posterior probability kernel on R. The rule m(y)=q1/2(y) is measurable and is a posterior median on every data fiber.

Facts & Assumptions

Given: The posterior kernel and the median definition in the Statement.

[F1]

A posterior median satisfies Πy((−∞,m])≥1/2 and Πy([m,∞))≥1/2. Posterior median

[F2]

The lower quantile is measurable and satisfies Πy((−∞,q1/2(y)))≤1/2≤Πy((−∞,q1/2(y)]). Posterior quantiles are measurable and bracket their probability level

Proof

Given: The posterior probability kernel in the Statement.

1.1givenF2

By [F2], m(y)=q1/2(y) is measurable and Πy((−∞,m(y)])≥1/2.

2.1F1F2step 1.1algebra∎

Since Πy is a probability measure, Πy([m(y),∞))=1−Πy((−∞,m(y)))≥1/2 by [F2]. Thus both inequalities in [F1] hold, so m(y) is a median for every y.

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

Finite posterior risk and Bayes action rule

Definition

Let (Θ,T) have a supplied posterior probability kernel Πy, let (A,G) be a measurable action space, and let L:Θ×A→[0,∞] be a measurable function on the product measurable space The product sigma-algebra and its finite iterates, in the sense of A measurable function between measurable spaces. This strengthens the section-measurability convention in Loss functions and risk so that posterior integrals vary measurably with measurable action rules.

For a fixed data fiber y and action a, define the posterior risk only when ρy(a):=∫ΘL(θ,a) Πy(dθ)<∞. A pointwise Bayes action at y is a finite-risk action attaining the minimum among all finite-risk actions. On a declared measurable data domain D, a Bayes action rule is a measurable map δ:D→A whose finite posterior risk attains that minimum at every y∈D. This definition makes no assertion that finite-risk actions or measurable minimizing rules always exist. It therefore does not infer a Bayes action merely from the existence of an infimum. The sampling risk in Loss functions and risk is a different integral, taken over the data law at a fixed parameter.

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

Under AC, the finite-second-moment posterior mean uniquely minimizes squared risk

Statement

Assume AC. Let Π be a probability kernel from a measurable data space (Y,Y) to R, and take the action space to be R with its Borel sigma-algebra. Put D2={y:∫Rθ2 Πy(dθ)<∞},μ(y)=∫Rθ Πy(dθ)(y∈D2). Then D2∈Y, μ is measurable on D2, and for every y∈D2, μ(y) is the unique action minimizing the finite squared posterior risk ∫(θ−a)2Πy(dθ) over a∈R. Thus μ is a measurable Bayes action rule on D2.

Facts & Assumptions

Given: AC, the posterior probability kernel Π, and the finite-second-moment data domain D2.

[A1]

The Axiom of Choice asserts that every family of nonempty sets has a choice function. The Axiom of Choice

[F1]

Under AC, conditional expectation is the orthogonal projection onto the square-integrable functions measurable with respect to the conditioning sigma-algebra, with a unique minimizing almost-sure class. Conditional expectation is the l2 orthogonal projection

[F2]

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

[F3]

A Bayes action rule must be measurable, have finite posterior risk, and attain the minimum among finite-risk actions. Finite posterior risk and Bayes action rule

[F4]

Integrating a product-measurable nonnegative function against a probability kernel gives a measurable function; an integrable signed function has a measurable signed integral on its finite-absolute-integral domain. Measurability of integration against a kernel

[F5]

A real random variable is a measurable map into R with its Borel sigma-algebra. Random elements and real random variables

Proof

Given: The hypotheses in the Statement.

1.1givenF3F4algebra

The squared loss L(θ,a)=(θ−a)2 is continuous on R2, hence product-Borel measurable as required by [F3]. Let s2(y)=∫θ2Πy(dθ). The function (y,θ)↦θ2 is product-measurable, so [F4] makes s2 measurable and D2={s2<∞} measurable. On D2, 2∣θ∣≤1+θ2 gives a finite absolute first moment; [F4] therefore makes the signed mean μ measurable on D2.

1.2givenF2F5

Fix y∈D2 and use (R,B(R),Πy) as a probability space with trivial sub-sigma-algebra G={∅,R}. The identity variable θ is a real random variable by [F5] and is square-integrable. The constant function μ(y) is G-measurable and satisfies ∫Hθ dΠy=∫Hμ(y) dΠy for both possible H∈G; by [F2] it is a conditional-expectation version.

2.1A1F1step 1.2

By [F1] under [A1], this conditional expectation uniquely minimizes squared distance over L2(G). The real-valued G-measurable functions are exactly constants, and every finite constant is in L2(Πy); hence μ(y) uniquely minimizes ∫(θ−a)2Πy(dθ) over all real actions. This risk is finite because both θ and the constant action are square-integrable.

3.1F3step 1.1step 2.1∎

By step 1.1 the mean rule is measurable on D2, and by step 2.1 it has finite risk and attains the minimum on every fiber. The definition [F3] therefore makes it a Bayes action rule on D2.

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

Every posterior median minimizes absolute risk when the first absolute moment is finite

Statement

Let Π be a posterior probability kernel on R and take the action space to be R with its Borel sigma-algebra. Let D1={y:∫R∣θ∣ Πy(dθ)<∞}. Then D1 is measurable. For every y∈D1, every posterior median minimizes the finite absolute posterior risk a↦∫∣θ−a∣ Πy(dθ). The measurable lower-median rule from The lower posterior median is a measurable rule is therefore an attained Bayes action rule on D1.

Facts & Assumptions

Given: The posterior probability kernel, the finite first-moment set D1, absolute loss, and the median convention in the Statement.

[F1]

A posterior median satisfies the two half-mass inequalities. Posterior median

[F2]

Posterior risk is the finite integral of the stated loss; a Bayes action rule must measurably attain a finite minimum. Finite posterior risk and Bayes action rule

[F3]

The lower-median selection is measurable and is a median on every fiber. The lower posterior median is a measurable rule

[F4]

Kernel integration makes y↦∫∣θ∣Πy(dθ) measurable. Measurability of integration against a kernel

Proof

Given: The hypotheses in the Statement.

1.1givenF2F4algebra

The absolute loss L(θ,a)=∣θ−a∣ is continuous on R2, hence product-Borel measurable as required by [F2]. The function (y,θ)↦∣θ∣ is product-measurable, so [F4] makes its posterior integral measurable and hence D1 a measurable data domain. For y∈D1 and every finite a, ∣θ−a∣≤∣θ∣+∣a∣ makes the posterior risk finite.

1.2givenF1F2algebra

Fix y∈D1 and a median m. For any a>m, put d=a−m and partition R into A=(−∞,m], B=(m,a), and C=[a,∞). On these three sets respectively, ∣θ−a∣−∣θ−m∣ equals d, a+m−2θ, and −d. On B, a+m−2θ≥−d. Therefore ρy(a)−ρy(m)≥d{Πy(A)−Πy(B)−Πy(C)}=d{2Πy(A)−1}≥0, where the last inequality is the first median condition [F1].

2.1givenF1F2F3step 1.2algebra∎

If a<m, put d=m−a and partition into A=(−∞,a], B=(a,m), and C=[m,∞). On these sets the loss difference is respectively −d, 2θ−a−m, and d; on B, 2θ−a−m≥−d. Hence ρy(a)−ρy(m)≥d{−Πy(A)−Πy(B)+Πy(C)}=d{2Πy(C)−1}≥0 by the second median condition [F1]. Equality holds when a=m. Thus every median is a pointwise minimizer; [F3] supplies a measurable median rule, whose finite risk on D1 and attained minimum satisfy [F2].

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

A maximal-mass action is Bayes under finite-class zero–one loss

Statement

Let Π be a posterior probability kernel on a nonempty finite class Θ={1,…,k} with the sigma-algebra of all its subsets; give the action class the same measurable structure and use zero–one loss L(θ,a)=1{θ≠a}. Every posterior-mass maximizer minimizes pointwise posterior risk. The least-indexed posterior-mass maximizer is a measurable, finite-risk Bayes action rule. This statement is choice-free.

Facts & Assumptions

Given: The finite posterior probability kernel, finite nonempty class, action space, and zero–one loss in the Statement.

[F1]

Posterior risk is the finite integral of a jointly measurable nonnegative loss, and a Bayes action rule is a measurable finite-risk minimizer whose minimum is attained. Finite posterior risk and Bayes action rule

[F2]

Each kernel event evaluation is measurable in its index and each posterior section is a probability measure. Measure kernel and probability kernel

Proof

Given: The hypotheses in the Statement.

1.1givenF1F2algebra

Since the parameter and action spaces are finite with all subsets measurable, the zero–one loss is product-measurable as required by [F1]. For j=1,…,k, put pj(y)=Πy({j}). By [F2], every pj is measurable. The zero–one posterior risk of action j is ρy(j)=∑ℓ≠jpℓ(y)=1−pj(y). Thus the risk is minimized exactly by maximizing pj(y).

2.1givenF1step 1.1algebra∎

Since k≥1 is finite, the nonempty finite list p1(y),…,pk(y) has a maximum. Define j∗(y) to be the least index attaining it. For each j, {y:j∗(y)=j}=⋂ℓ>j{y:pj(y)≥pℓ(y)} ∩ ⋂ℓ<j{y:pj(y)>pℓ(y)}. Both intersections are finite, and each set is measurable because the pℓ are measurable; hence j∗ is measurable. Its risk is finite and it attains the pointwise minimum from step 1.1, so [F1] makes it a Bayes action rule. Choosing the least maximizing index uses only the displayed finite order, not AC.

5 · Examples, counterexamples and false statements

None yet.

Sources