Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

The posterior forecast minimizes strictly proper scoring risk

Statement

Assume AC. Let X and a finite label Y∈{1,…,K} with the full power-set sigma-algebra, K≥2, have a joint probability law on standard-Borel spaces. For a proper finite-label score loss S, a measurable posterior forecast G(x)=P(Y∈⋅∣X=x) minimizes the expected score loss among all measurable forecasts. If S is strictly proper and the posterior forecast has finite expected score loss, equality of risk for another forecast q(X) implies q(X)=G(X) almost surely.

Statement references

Strictly proper scoring rules on a finite label set: defines a proper or strictly proper nonnegative score loss on the finite label simplex.

Standard Borel spaces: standard-Borel spaces are measurably isomorphic to Polish spaces.

A posterior-risk minimizer minimizes prior risk: a measurable posterior-risk minimizer minimizes prior-integrated risk.

Disintegration of a joint law on standard borel spaces: supplies a measurable posterior kernel for the standard-Borel joint law.

Facts & Assumptions

Given: AC, a standard-Borel feature and finite label with joint law, and a proper score loss S.

[A1]

Assume AC, as required by standard-Borel disintegration and the Bayes-risk interface. The Axiom of Choice

[F2]

Properness says that for every class distribution p, reporting p minimizes Sˉ(p,q) over forecast actions q. Strict propriety makes this minimizer unique. Strictly proper scoring rules on a finite label set

[F3]

A finite-label score loss is jointly measurable on the finite label space and forecast simplex; its expected score is the nonnegative risk of the associated decision problem. Strictly proper scoring rules on a finite label set Loss functions and risk

[F4]

Conditional risk integrals against the posterior kernel are measurable functions of the feature. Measurability of integration against a kernel

[F5]

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

[F6]

A measurable posterior-risk minimizing rule minimizes prior-integrated risk among deterministic and randomized decision rules under the stated standard-Borel model hypotheses. A posterior-risk minimizer minimizes prior risk

[F7]

A nonnegative measurable function with finite integral is finite almost everywhere. A nonnegative measurable function with finite integral is finite almost everywhere

[F8]

The nonnegative integral is additive for nonnegative measurable functions, and its integral over a measurable null set is zero. Additivity of the nonnegative Lebesgue integral A nonnegative integral over a null set vanishes

[F9]

The Lebesgue integral is linear on integrable real functions. The Lebesgue integral is linear on L1(μ)

[F10]

Defined arithmetic operations on measurable extended-real functions preserve measurability. Arithmetic and lattice operations preserve measurability whenever they are defined

Proof

1.1A1F1F2F4F6

By [F1], choose a measurable posterior probability kernel Πx on the finite label set; identify it with the measurable vector G(x)=(Πx(1),…,Πx(K))∈ΔK. For each x, the posterior expected score of reporting q is Sˉ(G(x),q), which is minimized at q=G(x) by [F2]. The posterior risk of this rule is measurable by [F4], so the rule meets the measurable-minimizer hypothesis in [F6].

1.2F1F3F6givenconstruct

To apply the Bayes-risk interface to the original joint law, let πj=P(Y=j). For πj>0, define Kj(A)=P(X∈A,Y=j)/πj on feature events A; for πj=0, set Kj=PX. Each Kj is a probability measure, and the finite map j↦Kj is a probability kernel. The joint prior-data law built from prior (πj) and kernel Kj agrees with the original joint law because for every A and j its (A,j) mass is P(X∈A,Y=j), including zero-prior labels. Consequently the Bayes-risk theorem [F6] states that the posterior rule G minimizes the original expected score risk over all measurable randomized forecasts, hence over deterministic forecasts.

2.1F1F2F3F4F5F7F8F9F10givenalgebra∎

Now suppose S is strictly proper and another measurable forecast q has the same risk as G, whose risk is finite by hypothesis. Write Rq(x)=Sˉ(G(x),q(x)) and RG(x)=Sˉ(G(x),G(x)). They are nonnegative measurable functions by [F3,F4], and posterior disintegration gives their integrals as the two risks, so both integrals are finite. By [F7], the measurable set N={Rq=+∞}∪{RG=+∞} is null. Set R~q=Rq and R~G=RG off N, and set both to zero on N; these modified functions are measurable by [F10]. By [F8], the changes preserve their integrals: each original function is the sum of its restriction to Nc and its restriction to the null set N. The functions R~q,R~G are finite and integrable. By propriety, D=R~q−R~G is nonnegative, and it is measurable by [F10]; [F9] gives ED=ER~q−ER~G=0. Thus [F5] makes D=0 almost surely. Off N this is equality of the finite posterior risks, so strict propriety in [F2] gives q(X)=G(X) almost surely.

Source notes

The local definition supplies pointwise propriety; this proof integrates that defining inequality against the posterior law and does not import any scoring-rule representation theorem. The standard-Borel and Bayes-risk suppliers provide the measurable posterior and its prior-risk interpretation. Finite posterior risk is stated explicitly because equality of two infinite extended risks alone cannot yield uniqueness.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

72 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