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.
Loss, Risk and Decision Theory
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Convex and Semicontinuous Functions on Rⁿ
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Estimators and Randomized Procedures
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Direct Method and Euler--Lagrange Equations
- The Lebesgue Integral and the Convergence Theorems
- The Riemann Integral in Rᵐ and Jordan Content
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak and Weak Star Topologies
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 , -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
Integral Jensen inequality for finite-dimensional convex losses
Statement
Assume the Axiom of Choice and Countable Choice. Let and let be a nonempty closed convex subset of , 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 contains every line segment between two of its points. Let be a probability measure on its Borel sets, and assume , where is the Euclidean norm from The Euclidean inner product on . Define the barycenter coordinatewise and assume . If is Borel measurable and convex, then Convexity for this possibly extended-valued 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 . On a convex restriction where 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 , , , and barycenter .
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 ()).
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).
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).
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).
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.
A nonnegative measurable function with integral zero vanishes almost everywhere (A nonnegative measurable function has integral exactly when it vanishes almost everywhere).
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 ).
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).
The nonnegative integral is additive on finite sums (Additivity of the nonnegative Lebesgue integral).
Proof
If , the conclusion holds because . Otherwise let . For every integer , the simple function is bounded above by , so [F7] gives . If , these lower bounds are unbounded as (and are already infinite if ), a contradiction. Thus has full -measure. Let be the support of , the set of points every relative open neighbourhood of which has positive measure. Since has a countable base inherited from rational balls in , the complement of is a countable union of open null basic sets, so . Every neighbourhood of a point of meets , hence is dense in .
Let be the closure of the set of finite convex combinations of points of . Then . If , [F1] gives a linear functional and a real with for all . The function is integrable by the first-moment assumption and is nonnegative on the full-measure support . Hence almost everywhere, so [F5] gives and . By [F6] and the coordinate definition of , this says , contradicting the strict separation. Thus .
If were on the relative boundary of , [F2], applied in its affine hull, would give a nonzero supporting normal there with for all . Set . The first-moment assumption makes integrable, and [F6] gives . Since on the full-measure support , its negative part vanishes almost everywhere; [F5] gives . The signed-integral definition in [F6] then gives , so [F5] implies almost everywhere and therefore almost everywhere. By continuity of and the definition of support, every point of must lie in the hyperplane : otherwise a neighborhood of a support point outside it would have positive measure on which . Its closed convex hull would lie in that hyperplane, contradicting that is nonzero in the direction space of its affine hull. Hence is in the relative interior of .
Put , where denotes finite convex combinations. The extended-functional convexity inequality makes finite on ; 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 . By [F3], is in the relative interior of . If this affine hull has dimension zero, then is concentrated at and the claim is equality. Otherwise identify the affine hull isometrically with ; [F4] applied to gives a subgradient at , so for every .
Let and , defining on . The function is integrable because has finite nonnegative integral and is integrable by the first-moment assumption. The supporting inequality gives on , a full-measure set; thus almost everywhere. By [F5], , so [F6] gives . Linearity [F6] now yields . Also , with almost everywhere; [F5] and additivity [F8] give . The integrable function is likewise zero almost everywhere, so [F5] applied to its positive and negative parts and linearity [F6] give . Finally [F6] and the barycenter definition yield . This proves the claim in the finite-integral case; the infinite-integral case was handled in step 1.1.
A prior and model kernel define a joint law
Statement
Let and be measurable spaces, let be a probability measure on , and let be a probability kernel. For , write and set Then is a probability measure on the product sigma-algebra, and for every nonnegative product-measurable , In particular, for and .
Facts & Assumptions
Given: The measurable spaces, prior, and probability kernel in the statement.
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).
Sections of a product-measurable set are measurable (Every section of a product-measurable function is measurable).
Integrating a nonnegative product-measurable function against a kernel gives a measurable function (Measurability of integration against a kernel).
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).
A probability measure has total mass one and is countably additive (Probability measures and probability spaces).
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
For each , [F2] makes measurable and [F3], applied to , makes measurable. Thus is defined. The empty set has -mass zero, while and [F1], [F5] give .
If are pairwise disjoint product-measurable sets, their sections are pairwise disjoint. Countable additivity of each gives . The partial sums increase; [F4] passes this limit through the -integral and yields . Therefore is a probability measure.
For a rectangle , its section is on and empty off , so the definition gives . For a nonnegative simple function with disjoint measurable sets and , the set formula for and [F6] give the displayed iterated-integral identity by finite addition and homogeneity.
For general nonnegative product-measurable , take the increasing simple approximants of [F4]. Apply monotone convergence first under , then sectionwise under each , and finally under . The identity for the simple functions from step 3.1 passes to the limit, including when either side is .
Loss functions and risk
Definition
Let be a statistical experiment (Statistical experiments), let be a measurable action space, meaning a set with a specified sigma-algebra (Measurable spaces and measurable sets), and let be a loss function whose section is -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 The inner integral is a measurable function of , 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.
Risk domination and admissibility
Definition
For two decision rules in one decision problem, dominates if 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.
Bayes risk and minimax risk
Definition
Let and be measurable parameter and data spaces, with nonempty, and let be a probability kernel, writing for the sampling law (Parameter-measurable statistical models as kernels). Let be a nonempty measurable action space (Measurable spaces and measurable sets). Let be measurable from the product measurable space with sigma-algebra to the extended real line with its Borel sigma-algebra, and assume for all (The product sigma-algebra and its finite iterates, A measurable function between measurable spaces, The extended real line , 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 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 Its worst-case risk is and the minimax value is These suprema and infima are taken in the extended order on (The extended real line , its order, and the arithmetic that is left undefined); they exist by Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in . 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 ensures the rule class is nonempty: fixing any gives the constant point-mass rule .
Randomization does not improve convex action loss
Statement
Assume the Axiom of Choice and Countable Choice. Let and let the statistical experiment be , (Statistical experiments), with a nonempty closed convex action set , 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 contains every line segment between two of its points. Let be a randomized decision rule, and let 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 For , define the coordinatewise barycenter Assume that for every , Then there is a measurable deterministic rule such that On , finite first moment in the Euclidean norm of The Euclidean inner product on 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.
Assume AC and Countable Choice, used by the finite-dimensional integral Jensen supplier (The Axiom of Choice, The Axiom of Countable Choice ()).
A randomized procedure is a probability kernel, and its risk is the iterated loss integral (Randomized procedures as probability kernels, Loss functions and risk).
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).
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).
A nonnegative measurable function has integral zero on a measurable null set (A nonnegative integral over a null set vanishes).
The nonnegative integral is additive on finite sums and monotone (Additivity of the nonnegative Lebesgue integral, Monotonicity and nonnegative homogeneity of the nonnegative integral).
Proof
Let . By [F2], is measurable. For each coordinate , , so the signed integral is measurable on by [F2]; hence is measurable on .
The set is measurable because is closed and therefore Borel. Fix one and define on and off . This is a measurable map into ; the hypotheses give for every .
For each and every , the section is nonnegative Borel convex, is a probability measure with finite first moment, and its barycenter belongs to . Applying [F3] gives .
Put and . Both are nonnegative measurable functions by [F1], [F2], and measurability of . Step 2.1 gives , so monotonicity [F5] gives . Since , [F4] gives zero integrals on ; additivity [F5] then yields . This is , and it holds for every .
A posterior-risk minimizer minimizes prior risk
Statement
Assume the Axiom of Choice. Let be a probability kernel from a standard-Borel parameter space to a standard-Borel data space , where standard Borel means measurably isomorphic to a Polish space (Standard Borel spaces). Let be a prior, and let be jointly measurable for a measurable action space . Let be the joint prior-data law of A prior and model kernel define a joint law, let be its data marginal, and let be a regular posterior distribution of given (the disintegration is supplied by Disintegration of a joint law on standard borel spaces). Define posterior risk Suppose a measurable deterministic rule attains the posterior minimum for -almost every ; that is, for every on one measurable -full-measure set. Then minimizes prior-integrated risk among all randomized decision rules : 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.
Assume AC, as required by standard-Borel disintegration (The Axiom of Choice).
The model is a probability kernel from parameters to data (Parameter-measurable statistical models as kernels).
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).
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).
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).
Integrals of nonnegative product-measurable functions against kernels are measurable (Measurability of integration against a kernel).
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).
The nonnegative integral over a measurable null set is zero (A nonnegative integral over a null set vanishes).
The nonnegative integral is monotone (Monotonicity and nonnegative homogeneity of the nonnegative integral).
The nonnegative integral is additive on finite sums (Additivity of the nonnegative Lebesgue integral).
A function between measurable spaces is measurable when preimages of measurable sets are measurable (A measurable function between measurable spaces).
Prior-integrated risk is (Bayes risk and minimax risk).
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
Fix a randomized rule and put . The lifted kernel is a probability kernel because the coordinate projection is measurable by [F12]. The lifted integrand is product-measurable because the pairing map is measurable by [F12]. By [F5], is product-measurable. The risk definition [F2], prior-risk definition [F11], and joint-law identity [F3] therefore give .
Apply the posterior disintegration identity [F4] to . If is the second marginal of , then . Every integral is an extended nonnegative integral, so no integrability beyond the stated measurability is needed.
Lift to the kernel from to . The pairing map is measurable by [F12], so [F5] makes product-measurable. For each fixed , [F6] applied to the product probability and gives . The right side is measurable in by [F5]. Thus step 2.1 yields .
The point-mass kernel is measurable because is measurable by [F10]; applying step 3.1 gives for . The pairing map is measurable by [F10, F12], so is measurable. Put , which is measurable by [F5]. On the measurable full-measure set from the statement, , so [F8] gives . The complementary integrals vanish by [F7]; additivity [F9] gives by step 3.1. The rule was arbitrary.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §5.2, PDF pp. 102–104
- Peter Hoff, Statistical Decision Problems, §§4–5, PDF pp. 7–13
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §§5.1 and 5.3.1, PDF pp. 100–105
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §5.1, PDF pp. 100–102
- Peter Hoff, Statistical Decision Problems, §§4.1–4.2, PDF pp. 7–8
- Peter Hoff, Statistical Decision Problems, §5, PDF pp. 11–12
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §§5.3.1–5.3.2, PDF pp. 104–110
- Ryan Martin, Lecture Notes on Advanced Statistical Theory, §5.3.1, PDF pp. 104–107