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.
Prediction problems, risks, and empirical minimization — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Interference and exposure mappings
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outward rounded interval and ball arithmetic
- Polynomial Rings, the Division Algorithm and Roots
- Prediction problems, risks, and empirical minimization
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
Binary zero-one loss and risk
Example
Let , with their discrete sigma-algebras, and let the joint law be Use zero-one loss . The predictor with , has population risk ; the predictor with the opposite labels has risk . The two constant predictors each have risk . Thus is the unique population-risk minimizer among the four predictors.
Facts & Assumptions
Given: The finite measurable spaces, probability law, loss and predictors stated in the example.
A supervised problem specifies the measurable instance/label/action spaces, joint law, predictors and loss. Supervised prediction problems
Population risk is the integral of the nonnegative loss under the joint law. Population and empirical risk
Verification
The table entries sum to one, and each of and has marginal probability . The loss of is one exactly at and , so its risk is .
The loss of is one at and , so its risk is . The constant-one predictor errs on label-zero mass , and the constant-zero predictor errs on label-one mass . These are all four functions from to , so uniquely minimizes risk.
Squared loss and a conditional mean
Example
Let with its discrete sigma-algebra, let with its discrete sigma-algebra, let the action space be with its Borel sigma-algebra, and let be all functions from to . Define and on . Give the joint law by with all other atoms having probability zero, and set . Use squared loss . For define the conditional mean . Then and , and the predictor uniquely minimizes population squared risk over , with risk .
Facts & Assumptions
Given: The finite spaces, joint law, real-valued predictor class and squared loss stated in the example.
Population risk is the expectation of the nonnegative loss under the joint law. Population and empirical risk
On a positive-probability event in a finite probability space, conditional expectation is the normalized finite weighted sum. Conditional expectation on positive-probability events in finite spaces
Expectation splits over a finite positive-probability partition as the probability-weighted sum of the conditional expectations. Conditional expectation on positive-probability events in finite spaces
Verification
The displayed atom weights sum to one and . Applying [F2] to the two events and gives conditional means , , and conditional second moments , .
For any predictor , expansion on each event gives and . The partition identity in [F3] and [F1] therefore give , with equality exactly when and .
Absolute loss and conditional medians
Example
Let , with discrete sigma-algebras, with its Borel sigma-algebra, and the set of all predictors from to . Give the joint law by and define the label coordinate . Use absolute loss . A median of a probability law on is a value satisfying both and . The conditional law of at the only instance assigns probability to each of and , so every is a median. The predictors for all minimize population risk, with risk ; every predictor with value outside has risk greater than .
Facts & Assumptions
Given: The finite measurable spaces, joint law, absolute loss and predictor class stated in the example.
A supervised problem specifies the measurable spaces, joint law, predictor class and loss. Supervised prediction problems
Population risk is the integral of the nonnegative loss under the joint law. Population and empirical risk
Verification
The only instance has probability one, so for a predictor with value the population risk is .
If , this risk is ; if , it is ; and if , it is . Thus its minimizers are exactly . For each such , both median inequalities hold with probability at least ; outside this interval one of the inequalities fails.
A nonattained risk infimum
Example
Let and with discrete sigma-algebras, let with its Borel sigma-algebra, and let put mass one on . For each positive integer , let and set . Use squared loss . For every sample size , the only sample has . The empirical and population infima over are both and are not attained. For tolerance , the constant selector supplies the approximate-ERM procedure with output ; for tolerance , no exact ERM exists.
Facts & Assumptions
Given: The singleton instance and label spaces, point-mass law, predictor class and squared loss stated in the example.
Population and empirical risks are the joint-law integral and finite sample average of the loss. Population and empirical risk
An exact ERM attains the empirical infimum; if a finite infimum is not attained, no exact minimizer exists. Empirical risk minimizers
The approximate-ERM procedure takes a supplied jointly measurable selector satisfying the samplewise risk condition. Approximate empirical risk minimization with a supplied selector
The real line is a complete ordered field, with the usual embedded positive integers. Dedekind-complete ordered real field
For every in a complete ordered field, some positive integer satisfies . For every in a complete ordered field there is a natural with
The inverse of a positive field element is positive. Inverses of positives are positive, and reciprocation reverses order
Every canonical positive integer is positive in the ordered real field. Canonical naturals are positive and strictly increasing
Verification
For every sample and every , the only observed pair is , so [F1] gives . By [F4] and [F7], , so [F6] gives and each listed risk is positive.
Let and set . By [F5] choose with . Then . Thus is a lower bound and no positive number is a lower bound; the infimum is . Step 1.1 shows it is never attained, so no exact ERM exists.
For each fixed , the sample space contains only the all- sample. The constant evaluation map is jointly measurable and its slice is , whose risk is by steps 1.1 and 2.1. It is therefore an admissible supplied selector for [F3], which returns ; tolerance has no output satisfying exact minimization by step 2.1.