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.

✓ 4 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Loss, Risk and Decision Theory

1 · Prerequisites

2 · Summary

This page defines nonnegative loss and its possibly infinite sampling risk for deterministic and randomized rules. It separates pointwise risk domination and admissibility from prior-averaged Bayes risk and worst-case minimax risk. Under explicit measurability and standard-Borel hypotheses, a measurable posterior minimizer minimizes prior risk. For closed convex finite-dimensional action sets, a randomized rule for which, at every θ, Pθ-almost every data value has finite first moment and barycenter in the action set can be replaced by its measurable barycenter without increasing convex loss; the local integral Jensen proof states its extended-convexity convention, choice assumptions and boundary conditions.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Integral Jensen inequality for finite-dimensional convex losses

Statement

Assume the Axiom of Choice and Countable Choice. Let d≥1 and let C be a nonempty closed convex subset of Rd, with closedness in the Euclidean topology (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space) and convexity as in A convex subset of Rm contains every line segment between two of its points. Let μ be a probability measure on its Borel sets, and assume ∫C∥a∥2 μ(da)<∞, where ∥⋅∥2 is the Euclidean norm from The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn. Define the barycenter b=∫Ca μ(da) coordinatewise and assume b∈C. If f:C→[0,+∞] is Borel measurable and convex, then f(b)≤∫Cf(a) μ(da). Convexity for this possibly extended-valued f uses the extended-functional convention of Convex and strictly convex functionals on a convex subset of a real vector space, including its endpoint convention for 0⋅(+∞). On a convex restriction where f is finite, this inequality reduces to the real-valued Euclidean convention of Convex and strictly convex functions on Euclidean convex sets, as used in the subgradient step of the proof. The barycenter is the vector of coordinate integrals.

Facts & Assumptions

Given: The statement's C, μ, f, and barycenter b.

[A1]

Assume the Axiom of Choice and Countable Choice, as required by the supporting-hyperplane and subgradient suppliers (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

A point outside a nonempty closed convex set is strictly separated from it by a hyperplane (A point outside a nonempty closed convex set is strictly separated from it).

[F2]

A boundary point of a nonempty convex set has a supporting hyperplane (Every boundary point belonging to a nonempty Euclidean convex set has a supporting hyperplane).

[F3]

The supplier statement gives common ordinary interior and boundary; its proof steps 2.1--3.1 also prove that a convex set and its closure have the same relative interior in their affine hull (A convex set and its closure have the same interior and boundary).

[F4]

A finite convex function has a subgradient at every interior point of its domain (A convex function has a subgradient at every interior point of its domain); a subgradient satisfies the global supporting inequality of Subgradients and the subdifferential of a convex function.

[F5]

A nonnegative measurable function with integral zero vanishes almost everywhere (A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere).

[F6]

Coordinate integrals are linear and give the barycenter, while the expectation of an integrable real function is the difference of its positive- and negative-part integrals (Expectation of a nonnegative or integrable random variable, The Lebesgue integral is linear on L1(μ)).

[F7]

The nonnegative integral is monotone and positively homogeneous, so a pointwise nonnegative simple minorant gives a lower bound on the integral (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F8]

The nonnegative integral is additive on finite sums (Additivity of the nonnegative Lebesgue integral).

Proof

technique · direct
1.1F7given

If ∫f dμ=+∞, the conclusion holds because f(b)∈[0,+∞]. Otherwise let A:={a∈C:f(a)=+∞}. For every integer n≥1, the simple function n1A is bounded above by f, so [F7] gives nμ(A)=∫n1A dμ≤∫f dμ<∞. If μ(A)>0, these lower bounds are unbounded as n→∞ (and are already infinite if μ(A)=+∞), a contradiction. Thus E:=C∖A={a:f(a)<∞} has full μ-measure. Let S be the support of μ, the set of points every relative open neighbourhood of which has positive measure. Since C has a countable base inherited from rational balls in Rd, the complement of S is a countable union of open null basic sets, so μ(S)=1. Every neighbourhood of a point of S meets E, hence E∩S is dense in S.

2.1F1F5F6step 1.1

Let C0 be the closure of the set of finite convex combinations of points of S. Then C0⊆C. If b∉C0, [F1] gives a linear functional u and a real α with ⟨u,y⟩≤α<⟨u,b⟩ for all y∈C0. The function ψ(a)=α−⟨u,a⟩ is integrable by the first-moment assumption and is nonnegative on the full-measure support S. Hence ψ−=0 almost everywhere, so [F5] gives ∫ψ− dμ=0 and ∫ψ dμ=∫ψ+ dμ≥0. By [F6] and the coordinate definition of b, this says α−⟨u,b⟩≥0, contradicting the strict separation. Thus b∈C0.

3.1A1F2F5F6step 2.1

If b were on the relative boundary of C0, [F2], applied in its affine hull, would give a nonzero supporting normal v there with ⟨v,y−b⟩≤0 for all y∈C0. Set u(a)=⟨v,b−a⟩. The first-moment assumption makes u integrable, and [F6] gives ∫u dμ=0. Since u≥0 on the full-measure support S, its negative part u− vanishes almost everywhere; [F5] gives ∫u− dμ=0. The signed-integral definition in [F6] then gives ∫u+ dμ=0, so [F5] implies u+=0 almost everywhere and therefore u=0 almost everywhere. By continuity of u and the definition of support, every point of S must lie in the hyperplane ⟨v,y−b⟩=0: otherwise a neighborhood of a support point outside it would have positive measure on which u≠0. Its closed convex hull C0 would lie in that hyperplane, contradicting that v is nonzero in the direction space of its affine hull. Hence b is in the relative interior of C0.

4.1A1F3F4step 1.1step 3.1

Put C1=conv⁡(E∩S), where conv⁡ denotes finite convex combinations. The extended-functional convexity inequality makes f finite on C1; on these finite values it is the real-valued Euclidean convexity of Convex and strictly convex functions on Euclidean convex sets. Density from step 1.1 gives C1‾=C0. By [F3], b is in the relative interior of C1. If this affine hull has dimension zero, then μ is concentrated at b and the claim is equality. Otherwise identify the affine hull isometrically with Rk; [F4] applied to f∣C1 gives a subgradient v at b, so f(y)≥f(b)+⟨v,y−b⟩ for every y∈C1.

5.1F5F6F8step 1.1step 4.1∎

Let ℓ(a)=f(b)+⟨v,a−b⟩ and w=(f−ℓ)1E, defining w=0 on Ec. The function w is integrable because f1E has finite nonnegative integral and ℓ is integrable by the first-moment assumption. The supporting inequality gives w≥0 on E∩S, a full-measure set; thus w−=0 almost everywhere. By [F5], ∫w− dμ=0, so [F6] gives ∫w dμ=∫w+ dμ≥0. Linearity [F6] now yields ∫f1E dμ≥∫ℓ1E dμ. Also f=f1E+f1Ec, with f1Ec=0 almost everywhere; [F5] and additivity [F8] give ∫f dμ=∫f1E dμ. The integrable function ℓ1Ec is likewise zero almost everywhere, so [F5] applied to its positive and negative parts and linearity [F6] give ∫ℓ dμ=∫ℓ1E dμ. Finally [F6] and the barycenter definition yield ∫ℓ dμ=f(b)+⟨v,b−b⟩=f(b). This proves the claim in the finite-integral case; the infinite-integral case was handled in step 1.1.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

A prior and model kernel define a joint law

Statement

Let (Θ,T) and (X,A) be measurable spaces, let π be a probability measure on (Θ,T), and let K:Θ×A→[0,1] be a probability kernel. For C∈T⊗A, write Cθ={x∈X:(θ,x)∈C} and set J(C)=∫ΘK(θ,Cθ) π(dθ). Then J is a probability measure on the product sigma-algebra, and for every nonnegative product-measurable h, ∫Θ×Xh(θ,x) J(dθ,dx)=∫Θ(∫Xh(θ,x) K(θ,dx))π(dθ). In particular, J(A×B)=∫AK(θ,B) π(dθ) for A∈T and B∈A.

Facts & Assumptions

Given: The measurable spaces, prior, and probability kernel in the statement.

[F1]

The parameter-measurable model is a probability kernel, so every section is a probability and every event evaluation is measurable (Parameter-measurable statistical models as kernels).

[F2]

Sections of a product-measurable set are measurable (Every section of a product-measurable function is measurable).

[F3]

Integrating a nonnegative product-measurable function against a kernel gives a measurable function (Measurability of integration against a kernel).

[F4]

Nonnegative functions admit increasing simple approximations and increasing limits pass through integrals (Every nonnegative measurable function is the increasing limit of simple measurable functions, Monotone convergence for the integral).

[F5]

A probability measure has total mass one and is countably additive (Probability measures and probability spaces).

[F6]

The nonnegative integral is additive on finite sums and homogeneous under nonnegative scalars (Additivity of the nonnegative Lebesgue integral, Monotonicity and nonnegative homogeneity of the nonnegative integral).

Proof

technique · direct
1.1F1F2F3F5

For each C∈T⊗A, [F2] makes Cθ measurable and [F3], applied to 1C, makes θ↦K(θ,Cθ) measurable. Thus J(C) is defined. The empty set has J-mass zero, while (Θ×X)θ=X and [F1], [F5] give J(Θ×X)=1.

2.1F1F4F5step 1.1

If (Cn)n≥0 are pairwise disjoint product-measurable sets, their sections are pairwise disjoint. Countable additivity of each K(θ,⋅) gives K(θ,(⋃nCn)θ)=lim⁡N∑n=0NK(θ,(Cn)θ). The partial sums increase; [F4] passes this limit through the π-integral and yields J(⋃nCn)=∑nJ(Cn). Therefore J is a probability measure.

3.1F1F3F6step 1.1step 2.1

For a rectangle A×B, its section is B on A and empty off A, so the definition gives J(A×B)=∫AK(θ,B) π(dθ). For a nonnegative simple function h=∑i=1mci1Ci with disjoint measurable sets and ci≥0, the set formula for J and [F6] give the displayed iterated-integral identity by finite addition and homogeneity.

4.1F2F3F4step 3.1∎

For general nonnegative product-measurable h, take the increasing simple approximants of [F4]. Apply monotone convergence first under J, then sectionwise under each K(θ,⋅), and finally under π. The identity for the simple functions from step 3.1 passes to the limit, including when either side is +∞.

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

Loss functions and risk

Definition

Let E=((X,A),Θ,(Pθ)θ∈Θ) be a statistical experiment (Statistical experiments), let (D,G) be a measurable action space, meaning a set with a specified sigma-algebra (Measurable spaces and measurable sets), and let L:Θ×D→[0,+∞] be a loss function whose section a↦L(θ,a) is G-measurable for each θ. A randomized decision rule is a probability kernel δ from the data space to the action space (Randomized procedures as probability kernels). Its risk at θ is the extended nonnegative number R(θ,δ)=∫X(∫DL(θ,a) δ(x,da))Pθ(dx). The inner integral is a measurable function of x, by A randomized procedure has a measurable action law, so the outer nonnegative integral is defined by Expectation of a nonnegative or integrable random variable. A deterministic measurable rule is included by taking its point-mass action kernel. No measurability on Θ is required for this definition.

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

Risk domination and admissibility

Definition

For two decision rules δ0,δ1 in one decision problem, δ1 dominates δ0 if R(θ,δ1)≤R(θ,δ0) for every parameter θ, with strict inequality for at least one θ. A rule is admissible if no decision rule dominates it; otherwise it is inadmissible. Risk is the extended-valued function of Loss functions and risk. Admissibility is a pointwise comparison across the whole parameter set; it does not assert that the rule minimizes risk at any particular parameter or under a global criterion.

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

Bayes risk and minimax risk

Definition

Let (Θ,T) and (X,A) be measurable parameter and data spaces, with Θ nonempty, and let K:Θ×A→[0,1] be a probability kernel, writing Pθ=K(θ,⋅) for the sampling law (Parameter-measurable statistical models as kernels). Let (D,G) be a nonempty measurable action space (Measurable spaces and measurable sets). Let L:Θ×D→R‾ be measurable from the product measurable space with sigma-algebra T⊗G to the extended real line with its Borel sigma-algebra, and assume L(θ,a)≥0 for all (θ,a) (The product sigma-algebra and its finite iterates, A measurable function between measurable spaces, The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined, The Borel sigma-algebra on the extended real line). A prior π is a probability measure on Θ. The risk function θ↦R(θ,δ) is measurable under these hypotheses by kernel integration (Parameter-measurable statistical models as kernels, Measurability of integration against a kernel). The Bayes risk of δ under π is rπ(δ)=∫ΘR(θ,δ) π(dθ)∈[0,+∞]. Its worst-case risk is R∗(δ)=sup⁡θ∈ΘR(θ,δ)∈[0,+∞], and the minimax value is Vmm=inf⁡{R∗(δ):δ is a measurable randomized rule from data to actions}∈[0,+∞]. These suprema and infima are taken in the extended order on R‾ (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined); they exist by Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R. The parameter set is nonempty and the rule class is nonempty under the action-space hypothesis, so these are suprema and infima of nonempty sets of nonnegative extended risks. A rule is minimax if its worst-case risk equals this infimum. These definitions make no assertion that a minimizer exists. Nonemptiness of D ensures the rule class is nonempty: fixing any a0∈D gives the constant point-mass rule x↦δa0.

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

Randomization does not improve convex action loss

Statement

Assume the Axiom of Choice and Countable Choice. Let d≥1 and let the statistical experiment be E=((X,A),Θ,(Pθ)θ∈Θ), (Statistical experiments), with a nonempty closed convex action set D⊆Rd, with its Borel sigma-algebra (Measurable spaces and measurable sets). Closedness is in the Euclidean topology (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space) and convexity uses A convex subset of Rm contains every line segment between two of its points. Let δ(x,da) be a randomized decision rule, and let L(θ,⋅):D→[0,+∞] be a nonnegative Borel loss convex in the extended-functional sense of Convex and strictly convex functionals on a convex subset of a real vector space. On its convex finite-valued domain this inequality agrees with the real-valued Euclidean convention of Convex and strictly convex functions on Euclidean convex sets, used in the Jensen proof's subgradient step. Define mδ(x)=∫D∥a∥2 δ(x,da),E0={x:mδ(x)<∞}. For x∈E0, define the coordinatewise barycenter bδ(x)=(∫Daj δ(x,da))j=1d. Assume that for every θ∈Θ, Pθ({x∈E0:bδ(x)∈D})=1. Then there is a measurable deterministic rule d such that R(θ,d)≤R(θ,δ)(θ∈Θ). On E0, finite first moment in the Euclidean norm of The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn makes each coordinate integral finite. No claim is made for nonconvex action sets or when the parameterwise almost-sure barycenter condition fails.

Facts & Assumptions

Given: The action set, loss, randomized rule, and parameterwise almost-sure moment and barycenter conditions in the statement.

[A1]

Assume AC and Countable Choice, used by the finite-dimensional integral Jensen supplier (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

[F1]

A randomized procedure is a probability kernel, and its risk is the iterated loss integral (Randomized procedures as probability kernels, Loss functions and risk).

[F2]

Nonnegative and signed integrals against a probability kernel are measurable; the signed integral is defined on the set of finite absolute integral (Measurability of integration against a kernel).

[F3]

For a probability measure on a closed convex finite-dimensional action set, an extended-valued convex loss has integral at least its value at the barycenter; the lemma uses the extended-functional convexity convention and its finite-valued Euclidean restriction (Integral Jensen inequality for finite-dimensional convex losses).

[F4]

A nonnegative measurable function has integral zero on a measurable null set (A nonnegative integral over a null set vanishes).

Proof

technique · direct
1.1F2algebra

Let m(x)=∫D∥a∥2 δ(x,da). By [F2], m is measurable. For each coordinate j, ∣aj∣≤∥a∥2, so the signed integral bj(x)=∫aj δ(x,da) is measurable on E0={x:m(x)<∞} by [F2]; hence b=(b1,…,bd) is measurable on E0.

1.2givenF2construct

The set E={x∈E0:b(x)∈D} is measurable because D is closed and therefore Borel. Fix one a0∈D and define d(x)=b(x) on E and d(x)=a0 off E. This is a measurable map into D; the hypotheses give Pθ(E)=1 for every θ.

2.1A1F1F3step 1.2

For each θ and every x∈E, the section a↦L(θ,a) is nonnegative Borel convex, δ(x,⋅) is a probability measure with finite first moment, and its barycenter b(x) belongs to D. Applying [F3] gives L(θ,d(x))=L(θ,b(x))≤∫DL(θ,a) δ(x,da).

3.1F1F2F4F5step 2.1∎

Put gθ(x)=L(θ,d(x)) and hθ(x)=∫DL(θ,a) δ(x,da). Both are nonnegative measurable functions by [F1], [F2], and measurability of d. Step 2.1 gives gθ1E≤hθ1E, so monotonicity [F5] gives ∫gθ1E dPθ≤∫hθ1E dPθ. Since Pθ(Ec)=0, [F4] gives zero integrals on Ec; additivity [F5] then yields ∫gθ dPθ≤∫hθ dPθ. This is R(θ,d)≤R(θ,δ), and it holds for every θ.

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

A posterior-risk minimizer minimizes prior risk

Statement

Assume the Axiom of Choice. Let K be a probability kernel from a standard-Borel parameter space (Θ,T) to a standard-Borel data space (X,A), where standard Borel means measurably isomorphic to a Polish space (Standard Borel spaces). Let π be a prior, and let L:Θ×D→[0,+∞] be jointly measurable for a measurable action space (D,G). Let J be the joint prior-data law of A prior and model kernel define a joint law, let M be its data marginal, and let Πx(dθ) be a regular posterior distribution of θ given x (the disintegration is supplied by Disintegration of a joint law on standard borel spaces). Define posterior risk q(x,a)=∫ΘL(θ,a) Πx(dθ). Suppose a measurable deterministic rule d∗:X→D attains the posterior minimum for M-almost every x; that is, q(x,d∗(x))≤q(x,a) for every a∈D on one measurable M-full-measure set. Then d∗ minimizes prior-integrated risk among all randomized decision rules δ: rπ(d∗)≤rπ(δ). No conclusion is asserted when a measurable posterior minimizer does not exist. All risks may be +∞.

Facts & Assumptions

Given: The kernels, prior, joint loss, posterior, and measurable minimizing rule in the statement.

[A1]

Assume AC, as required by standard-Borel disintegration (The Axiom of Choice).

[F1]

The model is a probability kernel from parameters to data (Parameter-measurable statistical models as kernels).

[F2]

A randomized decision rule is a probability kernel and its risk is the iterated nonnegative loss integral (Randomized procedures as probability kernels, Loss functions and risk).

[F3]

A prior and model kernel define a joint probability whose integral of each nonnegative product-measurable function is the iterated kernel integral (A prior and model kernel define a joint law).

[F4]

On standard-Borel spaces, the joint law disintegrates through its data marginal into a regular posterior, and the integral identity holds for every nonnegative product-measurable function (Regular conditional distribution, Disintegration of a joint law on standard borel spaces).

[F5]

Integrals of nonnegative product-measurable functions against kernels are measurable (Measurability of integration against a kernel).

[F6]

Tonelli's theorem equates iterated integrals of nonnegative measurable functions on product probability spaces (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F7]

The nonnegative integral over a measurable null set is zero (A nonnegative integral over a null set vanishes).

[F9]

The nonnegative integral is additive on finite sums (Additivity of the nonnegative Lebesgue integral).

[F10]

A function between measurable spaces is measurable when preimages of measurable sets are measurable (A measurable function between measurable spaces).

[F11]

Prior-integrated risk is rπ(δ)=∫ΘR(θ,δ) π(dθ) (Bayes risk and minimax risk).

[F12]

Product sigma-algebras are generated by measurable rectangles, so coordinate projections and measurable pairing maps into finite products are measurable (The product sigma-algebra and its finite iterates).

Proof

technique · direct
1.1F1F2F3F5F11F12

Fix a randomized rule δ and put hδ(θ,x)=∫DL(θ,a) δ(x,da). The lifted kernel ((θ,x),B)↦δ(x,B) is a probability kernel because the coordinate projection (θ,x)↦x is measurable by [F12]. The lifted integrand (θ,x,a)↦L(θ,a) is product-measurable because the pairing map ((θ,x),a)↦(θ,a) is measurable by [F12]. By [F5], hδ is product-measurable. The risk definition [F2], prior-risk definition [F11], and joint-law identity [F3] therefore give rπ(δ)=∫hδ dJ.

2.1A1F3F4step 1.1

Apply the posterior disintegration identity [F4] to hδ≥0. If M is the second marginal of J, then rπ(δ)=∫X(∫Θhδ(θ,x) Πx(dθ))M(dx). Every integral is an extended nonnegative integral, so no integrability beyond the stated measurability is needed.

3.1F2F5F6F12step 2.1

Lift Π to the kernel ((x,a),B)↦Πx(B) from X×D to Θ. The pairing map ((x,a),θ)↦(θ,a) is measurable by [F12], so [F5] makes q(x,a) product-measurable. For each fixed x, [F6] applied to the product probability Πx×δ(x,⋅) and L(θ,a) gives ∫Θhδ(θ,x) Πx(dθ)=∫Dq(x,a) δ(x,da). The right side is measurable in x by [F5]. Thus step 2.1 yields rπ(δ)=∫X∫Dq(x,a) δ(x,da) M(dx).

4.1givenF2F5F7F8F9F10F12step 3.1algebra∎

The point-mass kernel δ∗(x,B)=1B(d∗(x)) is measurable because d∗ is measurable by [F10]; applying step 3.1 gives rπ(d∗)=∫g dM for g(x)=q(x,d∗(x)). The pairing map x↦(x,d∗(x)) is measurable by [F10, F12], so g is measurable. Put h(x)=∫q(x,a) δ(x,da), which is measurable by [F5]. On the measurable full-measure set E from the statement, g1E≤h1E, so [F8] gives ∫g1E dM≤∫h1E dM. The complementary integrals vanish by [F7]; additivity [F9] gives ∫g dM≤∫h dM=rπ(δ) by step 3.1. The rule δ was arbitrary.

5 · Examples, counterexamples and false statements

None yet.

Sources